A heuristic method for initial dominant point detection for polygonal approximations
暂无分享,去创建一个
[1] Kai-Kuang Ma,et al. A novel scheme for progressive polygon approximation of shape contours , 1999, 1999 IEEE Third Workshop on Multimedia Signal Processing (Cat. No.99TH8451).
[2] Paul L. Rosin. Techniques for Assessing Polygonal Approximations of Curves , 1997, IEEE Trans. Pattern Anal. Mach. Intell..
[3] Mohammad Tanvir Parvez. Optimized polygonal approximations through vertex relocations in contour neighborhoods , 2015, Image Vis. Comput..
[4] Thanh Phuong Nguyen,et al. A discrete geometry approach for dominant point detection , 2011, Pattern Recognit..
[5] Herbert Freeman,et al. On the Encoding of Arbitrary Geometric Configurations , 1961, IRE Trans. Electron. Comput..
[6] Francisco José Madrid-Cuevas,et al. An efficient unsupervised method for obtaining polygonal approximations of closed digital planar curves , 2016, J. Vis. Commun. Image Represent..
[7] Alexander Kolesnikov. ISE-bounded polygonal approximation of digital curves , 2012, Pattern Recognit. Lett..
[8] Pepe Siy,et al. A new algorithm for dominant points detection and polygonization of digital curves , 2003, Pattern Recognit..
[9] H. Stone. Approximation of curves by line segments , 1961 .
[10] Francisco José Madrid-Cuevas,et al. Novel method to obtain the optimal polygonal approximation of digital planar curves based on Mixed Integer Programming , 2015, J. Vis. Commun. Image Represent..
[11] Wen-Yen Wu,et al. An adaptive method for detecting dominant points , 2003, Pattern Recognit..
[12] Andrew V. Goldberg,et al. Shortest paths algorithms: Theory and experimental evaluation , 1994, SODA '94.
[13] Asif Masood,et al. Optimized polygonal approximation by dominant point deletion , 2008, Pattern Recognit..
[14] Ugo Montanari,et al. A note on minimal length polygonal approximation to a digitized contour , 1970, CACM.
[15] André Ricardo Backes,et al. Polygonal approximation of digital planar curves through vertex betweenness , 2013, Inf. Sci..
[16] Francisco José Madrid-Cuevas,et al. A new thresholding approach for automatic generation of polygonal approximations , 2016, J. Vis. Commun. Image Represent..
[17] Francisco José Madrid-Cuevas,et al. Dominant point detection: A new proposal , 2005, Image Vis. Comput..
[18] Hiok Chai Quek,et al. A novel framework for making dominant point detection methods non-parametric , 2012, Image Vis. Comput..
[19] Roland T. Chin,et al. On the Detection of Dominant Points on Digital Curves , 1989, IEEE Trans. Pattern Anal. Mach. Intell..
[20] Pepe Siy,et al. Polygonal representation of digital planar curves through dominant point detection - a nonparametric algorithm , 2004, Pattern Recognit..
[21] Juan Carlos Pérez-Cortes,et al. Optimum polygonal approximation of digitized curves , 1994, Pattern Recognit. Lett..
[22] C. P. Chau,et al. New nonparametric dominant point detection algorithm , 2001 .
[23] Francisco José Madrid-Cuevas,et al. Polygonal approximation of digital planar curves through break point suppression , 2010, Pattern Recognit..
[24] Urs Ramer,et al. An iterative procedure for the polygonal approximation of plane curves , 1972, Comput. Graph. Image Process..
[25] Maria Robaszkiewicz. S. Loidolt, Phenomenology of Plurality , 2018 .
[26] Francisco José Madrid-Cuevas,et al. A new measurement for assessing polygonal approximation of curves , 2011, Pattern Recognit..
[27] Alexander Kolesnikov,et al. Unsupervised segmentation and approximation of digital curves with rate-distortion curve modeling , 2014, Pattern Recognit..
[28] Sabri A. Mahmoud,et al. Polygonal approximation of digital planar curves through adaptive optimizations , 2010, Pattern Recognit. Lett..
[29] David H. Douglas,et al. ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .
[30] S. W. E. Earles,et al. Optimal polygonal approximation of digitized curves , 1994 .