Optimal hypercube algorithms for labeled images

DOI10.1007/3-540-51542-9_43MaRDI QIDQ4028914zbMATH OpenFDO

Authors Russ Miller, Q. F. Stout

Publication date 28 March 1993

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-51542-9_43

zbMATH Keywords

areaconvexitydiameterdivide-and-conquerhypercubeimage analysisperimetersmallest enclosing rectangle

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Distributed algorithms (68W15)

Recommendations

• Hypercube and shuffle-exchange algorithms for image component labeling
• Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays
• Optimal geometric algorithms for digitized images on fixed-size linear arrays and scan-line arrays
• Optimal Parallel Algorithms for Region Labeling and Medial Axis Transform of Binary Images
• Optimal parallel hypercube algorithms for polygon problems

Cited in

(6)

• Computing convexity properties of images on a pyramid computer
• Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays
• Hypercube and shuffle-exchange algorithms for image component labeling
• Computing a complete histogram of an image in (n) steps and minimum expected memory requirements using hypercubes
• Dynamic computational geometry on meshes and hypercubes
• Determining maximum \(k\)-width-connectivity on meshes

This page was built for publication: Optimal hypercube algorithms for labeled images

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