An Efficiently Computable Metric for Comparing Polygonal Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence
Wavelet-based corner detection technique using optimal scale
Pattern Recognition Letters
Content-based trademark retrieval system using visually salient features
CVPR '97 Proceedings of the 1997 Conference on Computer Vision and Pattern Recognition (CVPR '97)
A Novel Energy Minimization Criterion for Color Image Segmentation
ICPR '04 Proceedings of the Pattern Recognition, 17th International Conference on (ICPR'04) Volume 3 - Volume 03
NURBS curve shape modification and fairness evaluation for computer aided aesthetic design
ISCGAV'07 Proceedings of the 7th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision
Identification of curvature features with use of boundary-skeleton model of image
ISCGAV'07 Proceedings of the 7th WSEAS International Conference on Signal Processing, Computational Geometry & Artificial Vision
Evaluating approximations generated by the GNG3D method for mesh simplification
AIKED'08 Proceedings of the 7th WSEAS International Conference on Artificial intelligence, knowledge engineering and data bases
On using B+-tree for efficient processing for the boundary neighborhood problem
WSEAS TRANSACTIONS on SYSTEMS
Hi-index | 0.00 |
Research in shape approximation has been motivated by object analysis, matching and recognition. Polygonal shape approximation is widely acceptable and gives reasonable reflection for the shape of the object. This paper presents an object shape approximation algorithm which generates polygons for closed objects. The algorithm is also capable of handling open objects as well as handwritten characters. The proposed algorithm utilizes circular grids to generate the segments. The user can control the number of segments generated by adjusting the granularity of the grid. The outcome of the proposed algorithm is scale and rotation invariant.