Decomposition of binary images - A survey and comparison

Pattern Recognition

Volumn 45, Issue 12, 2012, Pages 4279-4291

  Suk, Tomáš ^a   Höschl IV, Cyril ^a   Flusser, Jan ^a  

^a INSTITUTE OF INFORMATION THEORY AND AUTOMATION   (Czech Republic)

Author keywords

Binary image decomposition; Bipartite graph; Distance transform; Fast convolution; Image compression; Moment computation; Quadtree

Indexed keywords

GRAPH THEORY; IMAGE COMPRESSION; MATHEMATICAL MORPHOLOGY; MATHEMATICAL TRANSFORMATIONS;

BINARY IMAGE DECOMPOSITIONS; BIPARTITE GRAPHS; DISTANCE TRANSFORMS; FAST CONVOLUTION; MOMENT COMPUTATIONS; QUAD TREES;

BINARY IMAGES;

EID: 84864289216     PISSN: 00313203     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patcog.2012.05.012     Document Type: Article

References (33)

1. J.M. Keil, Polygon decomposition, in: Handbook of Computational Geometry, Elsevier, 2000, pp. 491-518.
2. M.F. Zakaria, L.J. Vroomen, P. Zsombor-Murray, J.M. van Kessel Fast algorithm for the computation of moment invariants Pattern Recognition 20 6 1987 639 643
3. M. Dai, P. Baylou, M. Najim An efficient algorithm for computation of shape moments from run-length codes or chain codes Pattern Recognition 25 10 1992 1119 1128
4. B.C. Li A new computation of geometric moments Pattern Recognition 26 1 1993 109 113
5. I.M. Spiliotis, B.G. Mertzios Real-time computation of two-dimensional moments on binary images using image block representation IEEE Transactions on Image Processing 7 11 1998 1609 1615
6. J. Flusser Refined moment calculation using image block representation IEEE Transactions on Image Processing 9 11 2000 1977 1978
7. C.-H. Wu, S.-J. Horng, P.-Z. Lee A new computation of shape moments via quadtree decomposition Pattern Recognition 34 7 2001 1319 1330
8. J.H. Sossa-Azuela, C. Yáñez-Márquez, J.L. Díaz de León Santiago Computing geometric moments using morphological erosions Pattern Recognition 34 2 2001 271 276
9. T. Suk, J. Flusser, Refined morphological methods of moment computation, in: 20th International Conference on Pattern Recognition ICPR'10, IEEE Computer Society, 2010, pp. 966-970.
10. W. Liou, J. Tan, R. Lee, Minimum partitioning simple rectilinear polygons in O(n log log n)-time, in: Proceeding of the 5th Annual ACM Symposium on Computational Geometry SoCG'89, ACM, New York, NY, USA, 1989, pp. 344-353.
11. K.D. Gourley, D.M. Green A polygon-to-rectangle conversion algorithm IEEE Computer Graphics and Applications 3 1 1983 31 36
12. E. Kawaguchi, T. Endo On a method of binary-picture representation and its application to data compression IEEE Transactions on Pattern Analysis and Machine Intelligence 2 1 1980 27 35
13. J. Flusser An adaptive method for image registration Pattern Recognition 25 1 1992 45 54
14. D.N. Vizireanu Generalizations of binary morphological shape decomposition Journal of Electronic Imaging 16 1 2007 013002-1-6
15. G. Borgefors Distance transformations in digital images Computer Vision, Graphics, Image Processing 34 3 1986 344 371
16. M. Seaidoun, A Fast Exact Euclidean Distance Transform with Application to Computer Vision and Digital Image Processing, Ph.D. Thesis, Northeastern University, Boston, USA, Advisor John Gauch, September, 1993.
17. T.E. Schouten, E.L. van den Broek, Incremental distance transforms (IDT), in: 20th International Conference on Pattern Recognition ICPR'10, IEEE Computer Society, 2010, pp. 237-240.
18. W. Lipski Jr., E. Lodi, F. Luccio, C. Mugnai, L. Pagli, On two-dimensional data organization II, in: Fundamenta Informaticae, Annales Societatis Mathematicae Polonae, Series IV, vol. II, 1979, pp. 245-260.
19. T. Ohtsuki, Minimum dissection of rectilinear regions, in: Proceedings of the IEEE International Conference on Circuits and Systems ISCAS'82, IEEE, 1982, pp. 1210-1213.
20. L. Ferrari, P.V. Sankar, J. Sklansky Minimal rectangular partitions of digitized blobs Computer Vision, Graphics, Image Processing 28 1 1984 58 71
21. H. Imai, T. Asano Efficient algorithms for geometric graph search problems SIAM Journal on Computing 15 2 1986 478 494
22. D. Eppstein, Graph-theoretic solutions to computational geometry problems, in: 35th International Workshop on Graph-Theoretic Concepts in Computer Science WG09, Lecture Notes in Computer Science, vol. 5911, Springer, 2009, pp. 1-16.
23. A.V. Goldberg, S. Rao Beyond the flow decomposition barrier Journal of the Association for Computing Machinery 45 5 1998 783 797
24. A.V. Goldberg, R.E. Tarjan A new approach to the maximum-flow problem Journal of the Association for Computing Machinery 35 4 1988 921 940
25. J. Edmonds, R.M. Karp Theoretical improvements in algorithmic efficiency for network flow problems Journal of the Association for Computing Machinery 19 2 1972 248 264
26. Department of Image Processing, Tree LEAF database, URL 〈 http://zoi.utia.cas.cz/tree-leaves 〉.
27. J. Flusser, T. Suk, B. Zitová Moments and Moment Invariants in Pattern Recognition 2009 Wiley Chichester
28. A. Levin, R. Fergus, F. Durand, W.T. Freeman, Image and depth from a conventional camera with a coded aperture, in: Special Interest Group on Computer Graphics and Interactive Techniques Conference SIGGRAPH'07, ACM, New York, NY, USA, 2007.
29. A. Levin, R. Fergus, F. Durand, B. Freeman, Image and depth from a conventional camera with a coded aperture, URL 〈 http://groups.csail.mit. edu/graphics/CodedAperture 〉.
30. P.N. Swarztrauber, FFTPACK, URL 〈 http://www.netlib.org/fftpack/ 〉.
31. A. Fernandes, FFTPACK translated to pure iso C/C, URL 〈 http://www.fernandes.org/txp/article/4/fftpack-translated-to-pure-iso-cc 〉.
32. G.A. Papakostas, E.G. Karakasis, D.E. Koulouriotis Efficient and accurate computation of geometric moments on gray-scale images Pattern Recognition 41 6 2008 1895 1904
33. I.M. Spiliotis, Y.S. Boutalis Parameterized real-time moment computation on gray images using block techniques Journal of Real-Time Image Processing 2011 81 91