Name
Abstract | ||
|---|---|---|
In this paper, we present a novel non-parametric polygonal approximation algorithm for planar curves. The proposed algorithm first selects all the breakpoints on the contour. From this set, a smaller set of high curvature points, cut-points, are obtained. An optimization procedure adaptively finds the best fitting polygonal approximation. Our algorithm adaptively locates segments of the contour with different levels of details. The proposed algorithm follows the contour more closely where the level of details on the curve is high. Experimental results demonstrate that the proposed algorithm is robust for noisy, real-life contours and compares favorably with other algorithms. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/ISSPA.2010.5605424 | Information Sciences Signal Processing and their Applications |
Keywords | Field | DocType |
approximation theory,computational geometry,optimisation,curvature points,optimization procedure,planar curves,polygonal approximation,triangular suppression,Contour processing,Dominant points,Planar curves,Polygonal approximation | Spline (mathematics),Computer science,Computational geometry,Artificial intelligence,Geometry,Approximation algorithm,Polygon,Curvature,Algorithm design,Pattern recognition,Approximation theory,Algorithm,Polygonal chain | Conference |
ISBN | Citations | PageRank |
978-1-4244-7165-2 | 2 | 0.37 |
References | Authors | |
8 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mohammad Tanvir Parvez | 1 | 169 | 9.19 |
| Sabri A. Mahmoud | 2 | 443 | 33.96 |