Morphological decomposition and compression of binary images via a minimum set cover algorithm

DOI10.1007/s10851-018-0825-xzbMath1485.68274OpenAlexW2807194722MaRDI QIDQ1716775

Erdal Karapınar

Publication date: 5 February 2019

Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10851-018-0825-x

zbMATH Keywords

decompositioncompressionminimum set cover algorithm

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Image processing (compression, reconstruction, etc.) in information and communication theory (94A08)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A linear-time algorithm for Euclidean feature transform sets
• A unified linear-time algorithm for computing distance maps
• Refined moment calculation using image block representation
• Beyond the flow decomposition barrier
• Efficient Algorithms for Geometric Graph Search Problems
• Minimal rectangular partitions of digitized blobs
• On a Method of Binary-Picture Representation and Its Application to Data Compression
• Binary text image compression using overlapping rectangular partitioning
• Reducibility among Combinatorial Problems
• Graph-Theoretic Solutions to Computational Geometry Problems
• Computing geometric moments using morphological erosions