Name
Abstract | ||
|---|---|---|
In this paper, we present a novel non-parametric polygonal approximation algorithm for digital planar curves. The proposed algorithm first selects a set of points (called cut-points) on the contour which are of very 'high' curvature. An optimization procedure is then applied to find adaptively the best fitting polygonal approximations for the different segments of the contour as defined by the cut-points. The optimization procedure uses one of the efficiency measures for polygonal approximation algorithms as the objective function. 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, while addressing noise by using suppression techniques. This makes the algorithm very robust for noisy, real-life contours having different levels of details. The proposed algorithm performs favorably when compared with other polygonal approximation algorithms using the popular shapes. In addition, the effectiveness of the algorithm is shown by measuring its performance over a large set of handwritten Arabic characters and MPEG7 CE Shape-1 Part B database. Experimental results demonstrate that the proposed algorithm is very stable and robust compared with other algorithms. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1016/j.patrec.2010.06.007 | Pattern Recognition Letters |
Keywords | Field | DocType |
contour processing,dominant points,different level,digital planar curve,fitting polygonal approximation,algorithm adaptively locates segment,planar curves,novel non-parametric polygonal approximation,proposed algorithm,optimization procedure,polygonal approximation,real-life contour,adaptive optimizations,different segment,polygonal approximation algorithm,level of detail,adaptive optimization,objective function | Noise reduction,Signal processing,Approximation algorithm,Polygon,Curvature,Ramer–Douglas–Peucker algorithm,Pattern recognition,Algorithm,Planar,Artificial intelligence,Polygonal chain,Mathematics | Journal |
Volume | Issue | ISSN |
31 | 13 | Pattern Recognition Letters |
Citations | PageRank | References |
23 | 0.73 | 15 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Mohammad Tanvir Parvez | 1 | 169 | 9.19 |
| Sabri A. Mahmoud | 2 | 443 | 33.96 |
| ParvezMohammad Tanvir | 3 | 23 | 0.73 |