Determining maximum k-width-connectivity on meshes
From MaRDI portal
Let \(I\) be a \(n\times n\) binary image storage in a \(n\times n\) mesh of processors with one pixel per processor. Image \(I\) is \(k\)-width-connected if, informally, between any pair of 1-pixels there exists a path of width \(k\) (composed of 1-pixels only). We consider the problem of determining the largest integer \(k\) such that \(I\) is \(k\)-width-connected, and present an optimal \(O(n)\) time algorithm for the mesh architecture.
Recommendations
- Parallel algorithms for determining \(k\)-width connectivity in binary images
- Parallel asynchronous connected components in a mesh
- Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays
- scientific article; zbMATH DE number 140494
- Parallel algorithms for gray-scale digitized picture component labeling on a mesh-connected computer
Cites work
- Connectivity in Digital Pictures
- Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
- scientific article; zbMATH DE number 3757746 (Why is no real title available?)
- Hypercube and shuffle-exchange algorithms for image component labeling
- On shrinking binary picture patterns
- Parallel algorithms for determining \(k\)-width connectivity in binary images
- Parallel Image Processing by Memory-Augmented Cellular Automata
- Solving tree problems on a mesh-connected processor array
Cited in
(2)
This page was built for publication: Determining maximum \(k\)-width-connectivity on meshes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q685604)
