An efficient algorithm for the optimal polygonal approximation of digitized curves
作者： Marc Salotti
DOI: 10.1016/S0167-8655(00)00088-X
关键词:
摘要: … that determines the same polygonal approximation with a … is based on the search of the shortest path in a graph, using the A ∗ … the optimality of the solution is preserved, the result of the …
acm.org
elsevier.com
sci-hub.se 参考文章(9)
Theodosios Pavlidis, Structural Pattern Recognition ,(1977)
Alberto Martelli, An application of heuristic search methods to edge and contour detection Communications of the ACM. ,vol. 19, pp. 73- 83 ,(1976) , 10.1145/359997.360004
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
Pau-Choo Chung, Ching-Tsorng Tsai, E-Liang Chen, Yung-Nien Sun, Polygonal approximation using a competitive Hopfield neural network Pattern Recognition. ,vol. 27, pp. 1505- 1512 ,(1994) , 10.1016/0031-3203(94)90128-7
Arbind K. Gupta, Santanu Chaudhury, Guturu Parthasarathy, A new approach for aggregating edge points into line segments Pattern Recognition. ,vol. 26, pp. 1069- 1086 ,(1993) , 10.1016/0031-3203(93)90008-K
Jia-Guu Leu, Limin Chen, Polygonal approximation of 2-D shape through boundary merging Pattern Recognition Letters. ,vol. 7, pp. 231- 238 ,(1988) , 10.1016/0167-8655(88)90107-9
James George Dunham, Optimum Uniform Piecewise Linear Approximation of Planar Curves IEEE Transactions on Pattern Analysis and Machine Intelligence. ,vol. PAMI-8, pp. 67- 75 ,(1986) , 10.1109/TPAMI.1986.4767753
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
T. Pavlidis, Structural Pattern Recognition Springer Berlin Heidelberg. ,(1977) , 10.1007/978-3-642-88304-0