Compressing 2-D Shapes Using Concavity Trees

作者: O. El Badawy , M. S. Kamel

DOI: 10.1007/11559573_69

关键词:

摘要: Concavity trees have been known for quite some time as structural descriptors of 2-D shape; however, they haven't explored further until recently. This paper shows how shapes can be concisely, but reversibly, represented during concavity tree extraction. The representation exact, or approximate to a pre-set degree. is equivalent lossless, lossy compression the image containing shape. details proposed technique and reports near-lossless ratios that are 150% better than JBIG standard on test set binary silhouette images.

参考文章(11)
Ossama El Badawy, Mohamed Kamel, Matching Concavity Trees Lecture Notes in Computer Science. pp. 556- 564 ,(2004) , 10.1007/978-3-540-27868-9_60
B. G. BATCHELOR, HIERARCHICAL SHAPE DESCRIPTION BASED UPON CONVEX HULLS OF CONCAVITIES Cybernetics and Systems. ,vol. 10, pp. 205- 210 ,(1980) , 10.1080/01969728008927632
Gunilla Borgefors, Gabriella Sanniti di Baja, Analyzing Nonconvex 2D and 3D Patterns Computer Vision and Image Understanding. ,vol. 63, pp. 145- 157 ,(1996) , 10.1006/CVIU.1996.0010
O. El Badawy, M.S. Kamel, Hierarchical representation of 2-D shapes using convex polygons: a contour-based approach Pattern Recognition Letters. ,vol. 26, pp. 865- 877 ,(2005) , 10.1016/J.PATREC.2004.09.031
B. G. BATCHELOR, SHAPE DESCRIPTORS FOR LABELING CONCAVITY TREES Cybernetics and Systems. ,vol. 10, pp. 233- 237 ,(1980) , 10.1080/01969728008927634
M. Kamel, O. El Badawy, Shape retrieval using concavity trees international conference on pattern recognition. ,vol. 3, pp. 111- 115 ,(2004) , 10.1109/ICPR.2004.825
G. Borgefors, G. Sanniti di Baja, Methods for hierarchical analysis of concavities international conference on pattern recognition. pp. 171- 175 ,(1992) , 10.1109/ICPR.1992.201954
J. Sklansky, Measuring Concavity on a Rectangular Mosaic IEEE Transactions on Computers. ,vol. C-21, pp. 1355- 1364 ,(1972) , 10.1109/T-C.1972.223507