Dominant point detection by reverse polygonization of digital curves

Image and Vision Computing

Volumn 26, Issue 5, 2008, Pages 702-715

  Masood, Asif ^a  

^a UNIVERSITY OF ENGINEERING AND TECHNOLOGY   (Pakistan)

Author keywords

Break points; Dominant points; Polygonal approximation; Reverse polygonization

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL COMPLEXITY;

DOMINANT POINTS; POLYGONAL APPROXIMATION; REVERSE POLYGONIZATION;

CURVE FITTING;

EID: 39749105420     PISSN: 02628856     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.imavis.2007.08.006     Document Type: Article

References (40)

1. Ansari N., and Huang K.W. Non-parametric dominant points detection. Pattern Recognition 24 (1991) 849-862
2. Anderson I.M., and Bezdek J.C. Curvature and tangential deflection of discrete arcs. Transactions on Pattern Analysis and Machine Intelligence 6 (1984) 27-40
3. Arcelli C., and Ramella G. Finding contour-based abstractions of planar patterns. Pattern Recognition 26 (1993) 563-577
4. Attneave F. Some informational aspects of visual perception. Psychological Review 61 (1954) 183-193
5. S. Banerjee, W. Niblack, M. Flickner, A minimum description length polygonal approximation method, Technical Report no. RJ 10007, IBM Research Division, 1996.
6. Cronin T.M. A boundary concavity code to support dominant points detection. Pattern Recognition Letters 20 (1999) 617-634
7. Dunham J.G. Optimum uniform piecewise linear approximation of planar curves. IEEE Transactions on Pattern Analysis Machinery Intelligence 8 (1986) 67-75
8. Freeman H. On the encoding of arbitrary geometric configurations. IEEE Transactions on Electronic Computer 10 (1961) 260-268
9. D.E. Goldberg, Genetic Algorithms in Search Optimization and Machine Learning. Addison Reading, MA, 1989.
10. Guru D.S., Dinesh R., and Nagabhushan P. Boundary based corner detection and localization using new 'cornerity' index: a robust approach. Proceedings of the 1st Canadian Conference on Computer and Robot Vision (2004) 417-423
11. Held A., Abe K., and Arcelli C. Towards a hierarchical contour description via dominant point detection. IEEE Transactions on Systems, Man and Cybernetics 24 6 (1994) 942-949
12. Hu X., and Ahuja N. Matching point features with ordered geometric, rigidity, and disparity constraints. IEEE Transactions on Pattern Analysis Machinery Intelligence 16 (1994) 1041-1049
13. Huang S.C., and Sun Y.N. Polygonal approximation using genetic algorithms. Pattern Recognition 32 (1999) 1409-1420
14. Kurozumi Y., and Davis W.A. Polygonal approximation by the minimax method. Computer Graphics and Image Processing 19 (1982) 248-264
15. L.J. Latecki and R. Lakämper, Polygon evolution by vertex deletion, in: Proceedings of the 2nd International Conference on Scale-Space Theories in Computer Vision, Springer-Verlag, (1999) pp. 398-409.
16. Latecki L.J., and Lakämper R. Convexity rule for shape decomposition based on discrete contour evolution. Computer Vision and Image Understanding 73 3 (1999) 441-454
17. Latecki L.J., Ghadially R.-R., Lakämper R., and Eckhardt U. Continuity of the discrete curve evolution. Journal of Electronic Imaging 9 3 (2000) 317-326
18. Lowe D.G. Three-dimensional object recognition from single two dimensional images. AI. 31 (1987) 355-395
19. Marji M., and Siy P. A new algorithm for dominant points detection and polygonization of digital curves. Pattern Recognition 36 (2003) 2239-2251
20. Melkman A., and Rourke J.O. On polygonal chain approximation. Proceedings of Computational Morphology (1988), North-Holland, Amsterdam pp. 87-95
21. Neumann R., and Teisseron G. Extraction of dominant points by estimation of the contour fluctuations. Pattern Recognition 35 (2002) 1447-1462
22. Pal N.R., Nandi S., and Kundu M.K. Self crossover: a new genetic operator and its application to feature selection. International Journal of Systems Science 2 2 (1998) 207-212
23. Perez, and Vidal E. Optimum polygonal approximation of digitized curves. Pattern Recognition 15 (1994) 743-750
24. Ramer U. An iterative procedure for the polygonal approximation of plane curves. Computer Graphics in Image Processing 1 (1972) 244-256
25. Rattarangsi A., and Chin R.T. Scale-based detection of corners of planar curves. Transactions Pattern Analysis on Machinery Intelligence 14 (1992) 430-449
26. Ray B.K., and Ray K.S. Detection of significant points and polygonal approximation of digital curves. Pattern Recognition Letters 13 (1992) 443-452
27. Ray B.K., and Ray K.S. Determination of optimal polygon from digital curve using L1 norm. Pattern Recognition 26 (1993) 505-509
28. Ray B.K., and Ray K.S. An algorithm for detecting dominant points and polygonal approximation of digitized curves. Pattern Recognition Letters 13 (1992) 849-856
29. Rosin P.L. Techniques for assessing polygonal approximations of curves. IEEE Transactions on PAMI. 19 6 (1997) 659-666
30. M. Sarfraz, M.R. Asim, A. Masood, Piecewise polygonal approximation of digital curves, in: Proceedings of the 8th IEEE International Conference on Information Visualisation, UK, IEEE Computer Society Press, USA, (2004) pp. 991-996.
31. Sarkar D. A simple algorithm for detection of significant vertices for polygonal approximation of chain-coded curves. Pattern Recognition Letters 14 (1993) 959-964
32. Sato Y. Piecewise linear approximation of plane curves by perimeter optimization. Pattern Recognition 25 (1992) 1535-1543
33. Sethi I.K., and Jain R. Finding trajectories of feature points in a monocular image sequence. IEEE Transactions on Pattern Analysis Machinery Intelligence 9 (1987) 56-73
34. Sklansky J., and Gonzalez V. Fast polygonal approximation of digitized curves. Pattern Recognition vol. 12 (1980) 327-331
35. Teh C., and Chin R. On the detection of dominant points on digital curves. IEEE Transactions on PAMI. 8 (1989) 859-873
36. Tsai W.H. Attributed string matching with merging for shape recognition. IEEE Transactions on Pattern Analysis Machinery Intelligence 7 (1985) 453-462
37. Wu W.Y. An adaptive method for detecting dominant points. Pattern Recognition 36 (2003) 2231-2237
38. Yin P.Y. Genetic algorithms for polygonal approximation of digital curves. International Journal of Pattern Recognition on Artificial Intelligence 13 (1999) 1-22
39. Yuen P.C. Dominant point matching algorithm. Electronic Letters 29 (1993) 2023-2024
40. Zhu P., and Chirlian P.M. On critical point detection of digital shapes. IEEE Transactions on Pattern Analysis Machinery Intelligence 17 8 (1995) 737-748