Finding a minimal cover for binary images: An optimal parallel algorithm

DOI10.1007/BF01759065MaRDI QIDQ1175643zbMATH OpenFDO

Authors Dipen Moitra

Publication date 25 June 1992

Published in Algorithmica (Search for Journal in Brave)

zbMATH Keywords

bipartite graphsimage compressionorthogonal polygonsEREW-PRAMminimal vertex coversminimum square coverparallel prefix computations

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10) Distributed algorithms (68W15)

Recommendations

• A new algorithmic framework for basic problems on binary images
• Morphological decomposition and compression of binary images via a minimum set cover algorithm
• An optimal parallel algorithm for the Euclidean distance maps of 2-D binary images
• An optimal parallel algorithm for the minimum circle-cover problem
• scientific article; zbMATH DE number 1304054
• A parallel circle-cover minimization algorithm
• Optimal Parallel Algorithms for Region Labeling and Medial Axis Transform of Binary Images
• Approximation schemes for covering and packing problems in image processing and VLSI
• Parallel algorithms for determining \(k\)-width connectivity in binary images

Cites work

• Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
• Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time
• Covering Polygons Is Hard
• Faster optimal parallel prefix sums and list ranking
• Minimal rectangular partitions of digitized blobs
• Parallel Prefix Computation
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes

Cited in

(5)

• FIXED PARAMETER ALGORITHMS FOR THE MINIMUM WEIGHT TRIANGULATION PROBLEM
• Medial axis transform on mesh-connected computers with hyperbus broadcasting
• scientific article; zbMATH DE number 140489 (Why is no real title available?)
• Approximation algorithms for decomposing octilinear polygons
• Morphological decomposition and compression of binary images via a minimum set cover algorithm

This page was built for publication: Finding a minimal cover for binary images: An optimal parallel algorithm

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