Pages that link to "Item:Q4203820"
From MaRDI portal
The following pages link to Hypercube and shuffle-exchange algorithms for image component labeling (Q4203820):
Displaying 11 items.
- Dynamic computational geometry on meshes and hypercubes (Q547490) (← links)
- Determining maximum \(k\)-width-connectivity on meshes (Q685604) (← links)
- In-place algorithm for erasing a connected component in a binary image (Q692939) (← links)
- Efficient parallel manipulations of IBB coded images on meshes with multiple broadcasting. (Q960432) (← links)
- Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays (Q1175647) (← links)
- Parallel algorithms for determining \(k\)-width connectivity in binary images (Q1177080) (← links)
- Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers (Q1187201) (← links)
- Parallel algorithms for gray-scale digitized picture component labeling on a mesh-connected computer (Q1328110) (← links)
- Image algebra techniques for binary image component labeling with local operators (Q1898086) (← links)
- Optimal Parallel Algorithms for Region Labeling and Medial Axis Transform of Binary Images (Q3977294) (← links)
- A general approach to connected-component labeling for arbitrary image representations (Q4302810) (← links)
