Computational-geometric methods for polygonal approximations of a curve
Computer Vision, Graphics, and Image Processing
Image Processing and Analysis: A Practical Approach
Image Processing and Analysis: A Practical Approach
Space-Efficient Algorithms for Approximating Polygonal Curves in Two Dimensional Space
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
Shape Signature by Deformation
SMI '99 Proceedings of the International Conference on Shape Modeling and Applications
Shape Classification and Analysis: Theory and Practice
Shape Classification and Analysis: Theory and Practice
Shape retrieval based on dynamic programming
IEEE Transactions on Image Processing
Hi-index | 0.00 |
In this paper, we propose an extraction method of optimal interest points to support shape-based image classification and indexing for image database by applying a dynamic threshold that reflects the characteristics of a shape contour. The threshold is dynamically determined by comparing the contour length ratio of the original shape and the approximated polygon while the algorithm is running. Because our algorithm considers the characteristics of the shape contour, it can minimize the number of interest points. For a shape with n contour points, this algorithm has the time complexity O(n logn). Our experiments show the average optimization ratio up to 0.92. We expect that features of shapes extracted from the proposed method are used for shape-based image classification, indexing, and similarity search.