Decomposition of binary images¡ªA survey and comparison

详细信息    查看全文

• 作者：Tom¨¢? Suk ; Cyril H?schl IV ; Jan Flusser
• 关键词：Binary image decomposition ; Distance transform ; Quadtree ; Bipartite graph ; Image compression ; Moment computation ; Fast convolution
• 刊名：Pattern Recognition
• 出版年：2012
• 出版时间：December, 2012
• 年：2012
• 卷：45
• 期：12
• 页码：4279-4291
• 全文大小：1881 K

文摘

We present an overview of the most important methods that decompose an arbitrary binary object into a union of rectangles. We describe a run-length encoding and its generalization, decompositions based on quadtrees, on mathematical morphology, on the distance transform, and a theoretically optimal decomposition based on a maximal matching in bipartite graphs. We compare their performance in image compression, in moment computation and in linear filtering. We show that the choice is always a compromise between the complexity and time/memory consumption. We give advice how to select an appropriate method in particular cases.