Hypercube and shuffle-exchange algorithms for image component labeling

DOI10.1016/0196-6774(89)90028-XMaRDI QIDQ4203820zbMATH OpenOpenAlexFDO

Authors

Publication date 1989

Published in Journal of Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0196-6774(89)90028-x

zbMATH Keywords

divide-and-conquerhypercubeimage component labelingimage processingparallel algorithmsPRAMshuffle-exchange computer

Mathematics Subject Classification ID

Theory of operating systems (68N25) Analysis of algorithms and problem complexity (68Q25) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 140494
• scientific article; zbMATH DE number 49825
• Component-hypertrees for image segmentation
• A general approach to connected-component labeling for arbitrary image representations
• A new framework for connected components labeling of binary images
• Image algebra techniques for binary image component labeling with local operators

Cited in

(17)

• Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays
• Parallel algorithms for determining \(k\)-width connectivity in binary images
• Data reduction and fast routing: A strategy for efficient algorithms for message-passing parallel computers
• Parallel algorithms for gray-scale digitized picture component labeling on a mesh-connected computer
• Image algebra techniques for binary image component labeling with local operators
• Linear time algorithms for an image labelling machine
• Optimal Parallel Algorithms for Region Labeling and Medial Axis Transform of Binary Images
• scientific article; zbMATH DE number 140494 (Why is no real title available?)
• A general approach to connected-component labeling for arbitrary image representations
• A duality theorem for two connectivity-preserving parallel shrinking transformations
• A distributed-memory algorithm for connected components labeling of simulation data
• Computing a complete histogram of an image in (n) steps and minimum expected memory requirements using hypercubes
• Dynamic computational geometry on meshes and hypercubes
• Computing the component-labeling and the adjacency tree of a binary digital image in near logarithmic-time
• Determining maximum \(k\)-width-connectivity on meshes
• In-place algorithm for erasing a connected component in a binary image
• Efficient parallel manipulations of IBB coded images on meshes with multiple broadcasting.

This page was built for publication: Hypercube and shuffle-exchange algorithms for image component labeling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4203820)