Abstract
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.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Baldock, R., Graham, J.: Image Processing and Analysis. Oxford University Press, Oxford (2000)
Chen, D.Z., Daescu, O.: Space-efficient Algorithms for Approximating Polygonal Curves in Two Dimensional Space. In: Hsu, W.-L., Kao, M.-Y. (eds.) COCOON 1998. LNCS, vol. 1449, pp. 55–64. Springer, Heidelberg (1998)
da Fontoura Costa, L., Cesar Jr., R.M.: Shape Analysis and Classification: Theory and Practicce. CRC Press, Boca Raton (2001)
Fujimura, K., Sako, Y.: Shape Signature by Deformation. In: Shape Modeling and Applications, pp. 225–232. IEEE, Los Alamitos (1999)
Imai, H., Iri, M.: Computational-Geometric Methods for Polygonal Approximation of a Curve. Computer Vision, Graphics and Image Processing, 31–41 (1986)
Milios, E., Petrakis, E.: Shape Retrieval Based on Dynamic Programming. IEEE Transactions on Image Processing 9(1), 141–147 (2000)
Ramer, U.: An Iterative Procedure for the Polygonal Approximation of Plane Curves. Computer Graphics and Image Processing 1, 244–256 (1972)
Safar, Shahabi, C., Sun, X.: Image Retrieval by Shape: A Comparative Study. In: Multimedia and Expo., vol. 1, pp. 141–144. IEEE, Los Alamitos (2000)
Multimedia Computing and Systems, pp. 875–879. IEEE, Los Alamitos (1999)
SQUID, http://www.ee.surrey.ac.uk/Research/VSSP/imagedb/demo.html
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Um, K., Jo, S., Cho, K. (2006). An Extraction Technique of Optimal Interest Points for Shape-Based Image Classification. In: Gunsel, B., Jain, A.K., Tekalp, A.M., Sankur, B. (eds) Multimedia Content Representation, Classification and Security. MRCS 2006. Lecture Notes in Computer Science, vol 4105. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11848035_67
Download citation
DOI: https://doi.org/10.1007/11848035_67
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-39392-4
Online ISBN: 978-3-540-39393-1
eBook Packages: Computer ScienceComputer Science (R0)