Ant colony search algorithms for optimal polygonal approximation of plane curves
Author:
- Peng-Yeng YinPYPeng-Yeng Yin
- 1 August 2003
- journal article
- Published by Elsevier in Pattern Recognition
- Vol. 36 (8) , 1783-1797
Abstract
No abstract availableKeywords
This publication has 17 references indexed in Scilit:
- A new split-and-merge technique for polygonal approximation of chain coded curvesPattern Recognition Letters, 1995
- Towards a hierarchical contour description via dominant point detectionIEEE Transactions on Systems, Man, and Cybernetics, 1994
- Determination of optimal polygon from digital curve using L1 normPattern Recognition, 1993
- Detecting the Dominant Points by the Curvature-Based Polygonal ApproximationCVGIP: Graphical Models and Image Processing, 1993
- On detecting dominant pointsPattern Recognition, 1991
- On the detection of dominant points on digital curvesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1989
- Optimum Uniform Piecewise Linear Approximation of Planar CurvesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1986
- Polygonal approximation by the minimax methodComputer Graphics and Image Processing, 1982
- Fast polygonal approximation of digitized curvesPattern Recognition, 1980
- An iterative procedure for the polygonal approximation of plane curvesComputer Graphics and Image Processing, 1972