Parallel algorithms for gray-scale digitized picture component labeling on a mesh-connected computer
DOI10.1006/JPDC.1994.1005zbMATH Open0807.68106OpenAlexW1963645679MaRDI QIDQ1328110FDOQ1328110
Authors: Susanne E. Hambrusch, Xin He, Russ Miller
Publication date: 1 March 1995
Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://docs.lib.purdue.edu/cgi/viewcontent.cgi?article=1931&context=cstech
Recommendations
- Hypercube and shuffle-exchange algorithms for image component labeling
- Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays
- scientific article; zbMATH DE number 1057773
- A general approach to connected-component labeling for arbitrary image representations
- Fast connected-component labeling
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10) Distributed algorithms (68W15)
Cited In (7)
- Determining maximum \(k\)-width-connectivity on meshes
- Quasi-flat zones for angular data simplification
- Data Movement Techniques for the Pyramid Computer
- Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays
- Topological numbering of features on a mesh
- A distributed-memory algorithm for connected components labeling of simulation data
- Linear time algorithms for an image labelling machine
This page was built for publication: Parallel algorithms for gray-scale digitized picture component labeling on a mesh-connected computer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1328110)