INFORMATION CHANGE THE WORLD

International Journal of Image, Graphics and Signal Processing(IJIGSP)

ISSN: 2074-9074 (Print), ISSN: 2074-9082 (Online)

Published By: MECS Press

IJIGSP Vol.10, No.4, Apr. 2018

A Heuristic Strategy for Sub-Optimal Thick-Edged Polygonal Approximation of 2-D Planar Shape

Full Text (PDF, 1316KB), PP.48-58


Views:53   Downloads:1

Author(s)

Sourav Saha, Saptarsi Goswami, Priya Ranjan Sinha Mahapatra

Index Terms

Shape Representation;Computational Geometry;Polygonal Approximation; Dominant Point

Abstract

This paper presents a heuristic approach to approximate a two-dimensional planar shape using a thick-edged polygonal representation based on some optimal criteria. The optimal criteria primarily focus on derivation of minimal thickness for an edge of the polygonal shape representation to handle noisy contour. Vertices of the shape-approximating polygon are extracted through a heuristic exploration using a digital geometric approach in order to find optimally thick-line to represent a discrete curve. The merit of such strategies depends on how efficiently a polygon having minimal number of vertices can be generated with modest computational complexity as a meaningful representation of a shape without loss of significant visual characteristics. The performance of the proposed frame- work is comparable to the existing schemes based on extensive empirical study with standard data set.

Cite This Paper

Sourav Saha, Saptarsi Goswami, Priya Ranjan Sinha Mahapatra," A Heuristic Strategy for Sub-Optimal Thick-Edged Polygonal Approximation of 2-D Planar Shape", International Journal of Image, Graphics and Signal Processing(IJIGSP), Vol.10, No.4, pp. 48-58, 2018.DOI: 10.5815/ijigsp.2018.04.06

Reference

[1]R. C. Gonzalez, R. E. Woods, “Digital Image Processing” (3rd Edition), Prentice-Hall, Inc., Upper Saddle River, NJ, USA, 2006.

[2]A. Goshvarpour, H. Ebrahimnezhad, A. Goshvarpour, “Shape classification based on normalized distance and angle histograms using pnn”, I.J

[3]Information Technology and Computer Science 5 (9) (2013) 65 – 72.

[4]D. Zhang, G. Lu, “Review of shape representation and description techniques”, Pattern Recognition 37 (1) (2004) 1–19.

[5]K. Asrani, R. Jain, “Contour based retrieval for plant species”, I.J. Image, Graphics and Signal Processing 5 (9) (2013) 29 – 35.

[6]W.-Y. Wu, “An adaptive method for detecting dominant points”, Pattern Recognition 36 (10) (2003) 2231–2237.

[7]U. Ramer, “An iterative procedure for the polygonal approximation of plane curves”, j-CGIP 1 (3) (1972) 244–256.

[8]N. Fernndez-Garca, L. D.-M. Martnez, A. Carmona-Poyato, F. Madrid- Cuevas, R. Medina-Carnicer, “A new thresholding approach for automatic generation of polygonal approximations”, Journal of Visual Communication and Image Representation 35 (2016) 155 – 168.

[9]J. Sklansky, V. Gonzalez, “Fast polygonal approximation of digitized curves”, Pattern Recognition 12 (5) (1980) 327–331.

[10]K. Wall, P.-E. Danielsson, “A fast sequential method for polygonal approximation of digitized curves”, Computer Vision, Graphics, and Image Processing 28 (2) (1984) 220–227.

[11]N. Ansari, E. J. Delp, “On detecting dominant points”, Pattern Recognition 24 (5) (1991) 441–451.

[12]M. S. Kankanhalli, “An adaptive dominant point detection algorithm for digital curves”, Pattern Recognition Letters 14 (5) (1993) 385–390.

[13]F. Madrid-Cuevas, E. Aguilera-Aguilera, A. Carmona-Poyato, R. Muoz- Salinas, R. Medina-Carnicer, N. Fernndez-Garca, “An efficient unsupervised method for obtaining polygonal approximations of closed digital planar curves”, Journal of Visual Communication and Image Representation 39 (2016) 152 – 163.

[14]J. G. Dunham, “Optimum uniform piecewise linear approximation of planar curves”, IEEE Transactions on Pattern Analysis and Machine Intelligence PAMI-8 (1) (1986) 67–75.

[15]P. L. Rosin, G. A. W. West, “Nonparametric segmentation of curves into various representations”, IEEE Trans. Pattern Anal. Mach. Intell. 17 (12) (1995) 1140–1153.

[16]S. Goswami, S. Saha, S. Chakravorty, “A new evaluation measure for feature subset selection with genetic algorithm”, I.J. Intelligent Systems and Applications 7 (10) (2015) 28 – 36.

[17]S.-C. Huang, Y.-N.  Sun, “Polygonal approximation using genetic algorithm”, Evolutionary Computation, 1996. Proceedings of IEEE International Conference, 1996, pp. 469–474.

[18]Y. Xiao, J. J. Zou, H. Yan, “An adaptive split-and-merge method for binary image contour data compression”, Pattern Recognition Letters 22 (34) (2001) 299–307.

[19]A.  Masood, “Optimized polygonal approximation by dominant point deletion”, Pattern Recognition 41 (1) (2008) 227–239.

[20]A. Masood, S. A. Haq, “A novel approach to polygonal approximation of digital curves”, Journal of Visual Communication and Image Representation 18 (3) (2007) 264–274.

[21]A. Kolesnikov, “Ise-bounded polygonal approximation of digital curves”, Pattern Recognition Letters. 33 (10) (2012) 1329–1337.

[22]E. Aguilera-Aguilera, A. Carmona-Poyato, F. Madrid-Cuevas, R. Muoz-Salinas, “Novel method to obtain the optimal polygonal approximation of digital planar curves based on mixed integer programming”, Journal of Visual Communication and Image Representation 30 (2015) 106 – 116.

[23]E. Aguilera-Aguilera, A. Carmona-Poyato, F. Madrid-Cuevas, M. Marn- Jimnez, “Fast computation of optimal polygonal approximations of digital planar closed curves”, Graphical Models 84 (2016) 15 – 27.

[24]J. Mukhopadhyay, P. P. Das, S. Chattopadhyay, P. Bhowmick, B. N. Chatterji, “Digital geometry in image processing”, CRC Press, 2013.

[25]R. Klette, A. Rosenfeld, “Digital geometry: geometric methods for digital picture analysis”, Elsevier, 2004.

[26]S. J. Russell, P. Norvig, “Artificial Intelligence: A Modern Approach”, 2nd Edition, Pearson Education, 2003.

[27]C. H. Teh, R. T. Chin, “On the detection of dominant points on digital curves”, IEEE Trans. Pattern Anal. Mach. Intell. 11 (8) (1989) 859–872. 

[28]R.Ralph,Mpeg-7core experiment, http://www.dabi.temple.edu/~shape/MPEG7/dataset.html(1999).

[29]P. L. Rosin, “Techniques for assessing polygonal approximations of curves”, IEEE Trans. Pattern Anal. Mach. Intell. 19 (6) (1997) 659–666. 

[30]D. Sarkar, “A simple algorithm for detection of significant vertices for polygonal approximation of chain-coded curves”, Pattern Recognition Letters 14 (12) (1993) 959–964.

[31]P. L. Rosin, “Assessing the behaviour of polygonal approximation algorithms”, Pattern Recognition 36 (2) (2003) 505–518, biometrics.

[32]M. T. Parvez, S. A. Mahmoud, “Polygonal approximation of digital planar curves through adaptive optimizations”, Pattern Recognition Letters 31 (13) (2010) 1997–2005, meta-heuristic Intelligence Based Image Processing.

[33]A. Carmona-Poyato, R. Medina-Carnicer, F. Madrid-Cuevas, R. Muoz- Salinas, N. Fernndez-Garca, “A new measurement for assessing polygonal approximation of curves”, Pattern Recognition 44 (1) (2011) 45–54.

[34]A. Carmona-Poyato, N. Fernndez-Garca, R. Medina-Carnicer, F. Madrid-Cuevas, “Dominant point detection: A new proposal”, Image and Vision Computing 23 (13) (2005) 1226–1236.

[35]B. K. Ray, K. S. Ray, “Detection of significant points and polygonal approximation of digitized curves”, Pattern Recognition Letters 13 (6) (1992) 443–452.

[36]N. Ansari, K. Wei Huang, “Non-parametric dominant point detection”, Pattern Recognition 24 (9) (1991) 849–862.

[37]M. Radhika Mani, G.P.S. Varma, Potukuchi D.M., Ch. Satyanarayana, “Design of a Novel Shape Signature by Farthest Point Angle for Object Recognition”, I.J. Image, Graphics and Signal Processing, vol.7, no.1, pp.35-46, 2015.

[38]Archana A. Chaugule, Suresh N. Mali, “Evaluation of Shape and Color Features for Classification of Four Paddy Varieties”, I.J. Image, Graphics and Signal Processing, vol.6, no.12, pp.32-38, 2014.