A new measurement for assessing polygonal approximation of curves
作者： A. Carmona-Poyato , R. Medina-Carnicer , F.J. Madrid-Cuevas , R. Muñoz-Salinas , N.L. Fernández-García
DOI: 10.1016/J.PATCOG.2010.07.029
关键词: Signal classification 、 Similarity (geometry) 、 Algorithm 、 Similitude 、 Approximation algorithm 、 Iterative method 、 Mathematical optimization 、 Mathematics
摘要: This paper presents a novel method for assessing the accuracy of unsupervised polygonal approximation algorithms. measurement relies on called ''reference approximation''. The reference is obtained using Perez and Vidal [11] by an iterative that optimizes objective function. Then, proposed calculated comparing with to be evaluated, taking into account similarity between original contour, penalizing approximations excessive number points. A comparative experiment commonly used algorithms showed more efficient than other measurements at different
acm.org
elsevier.com
sci-hub.se 参考文章(15)
Y. Zhu, S. W. E. Earles, L. D. Seneviratne, Optimal polygonal approximation of digitized curves Proceedings of the 17th meeting of the Austrian Association for pattern recognition on Image analysis and synthesis. pp. 451- 460 ,(1994)
Qiang Ji, R.M. Haralick, Breakpoint detection using covariance propagation IEEE Transactions on Pattern Analysis and Machine Intelligence. ,vol. 20, pp. 845- 851 ,(1998) , 10.1109/34.709604
Asif Masood, Shaiq A. Haq, A novel approach to polygonal approximation of digital curves Journal of Visual Communication and Image Representation. ,vol. 18, pp. 264- 274 ,(2007) , 10.1016/J.JVCIR.2006.12.002
Juan-Carlos Perez, Enrique Vidal, Optimum polygonal approximation of digitized curves Pattern Recognition Letters. ,vol. 15, pp. 743- 750 ,(1994) , 10.1016/0167-8655(94)90002-7
Debranjan Sarkar, A simple algorithm for detection of significant vertices for polygonal approximation of chain-coded curves Pattern Recognition Letters. ,vol. 14, pp. 959- 964 ,(1993) , 10.1016/0167-8655(93)90004-W
Majed Marji, Pepe Siy, Polygonal representation of digital planar curves through dominant point detection-a nonparametric algorithm Pattern Recognition. ,vol. 37, pp. 2113- 2130 ,(2004) , 10.1016/J.PATCOG.2004.03.004
A. Carmona-Poyato, F.J. Madrid-Cuevas, R. Medina-Carnicer, R. Muñoz-Salinas, Polygonal approximation of digital planar curves through break point suppression Pattern Recognition. ,vol. 43, pp. 14- 25 ,(2010) , 10.1016/J.PATCOG.2009.06.010
R. Medina-Carnicer, F.J. Madrid-Cuevas, Unimodal thresholding for edge detection Pattern Recognition. ,vol. 41, pp. 2337- 2346 ,(2008) , 10.1016/J.PATCOG.2007.12.007
A. Carmona-Poyato, N.L. Fernández-García, R. Medina-Carnicer, F.J. Madrid-Cuevas, Dominant point detection: A new proposal Image and Vision Computing. ,vol. 23, pp. 1226- 1236 ,(2005) , 10.1016/J.IMAVIS.2005.07.025
P.L. Rosin, Techniques for assessing polygonal approximations of curves IEEE Transactions on Pattern Analysis and Machine Intelligence. ,vol. 19, pp. 659- 666 ,(1997) , 10.1109/34.601253