Browse > Article

Extraction of Optimal Interest Points for Shape-based Image Classification  

조성택 (경민대학 인터넷정보과)
엄기현 (동국대학교 컴퓨터멀티미디어공학과)
Abstract
In this paper, we propose an optimal interest point extraction method to support shape-base image classification and indexing for image database by applying a dynamic threshold that reflects the characteristics of the shape contour. The threshold is determined dynamically 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 n points of the contour, the proposed algorithm has O(nlogn) computational cost on an average to extract the number of m optimal interest points. Experiments were performed on the 70 synthetic shapes of 7 different contour types and 1100 fish shapes. It shows the average optimization ratio up to 0.92 and has 14% improvement, compared to the fixed threshold method. The shape features extracted from our proposed method can be used for shape-based image classification, indexing, and similarity search via normalization.
Keywords
interest point; polygonal approximation; shape-based image classification;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 J. Wang, W. Chang, and R. Acharya, 'Efficient and Effective Similar Shape Retrieval,' Multimedia Computing and Systems, IEEE, pp.875 879, 1999   DOI
2 Danny Z.Chen, Ovidiu Daescu, 'Space efficient Algorithms for Approximating Polygonal Curves in Two Dimensional Space,' The Fourth Annual International Computing and Combinatorics Conference (COCOON), pp.55 64, 1998
3 Kikuo Fujimura, Yusaku sako,' Shape Signature by Deformation,' Shape Modeling and Applications, IEEE, pp.225 232, 1999
4 Luciano da Fontoura Costa, Roberto Marcondes Cesar Jr., Shape Analysis and Classification : Theory and Practicce, CRC Press, 2001
5 R. Baldock, J. Graham, Image Processing and Analysis, Oxford University Press, 2000
6 U. Ramer, 'An Iterative Procedure for the Poly gonal Approximation of Plane Curves', Computer Graphics and Image Processing, Vol.1, pp.244 256, 1972   DOI
7 Paul L. Rosin, 'Techniques for Assessing Poly gonal Approximations of Curves,' Transactions on Pattern Analysis and Machine Intelligence, IEEE, Vol.19, No.6, pp.659 666, 1997   DOI   ScienceOn
8 E. Milios, E. Petrakis, 'Shape Retrieval Based on Dynamic Programming,' IEEE Transactions on Image Processing, Vol. 9, No.1, pp.141 147, 2000   DOI   ScienceOn
9 M. Safar, C. Shahabi, X. Sun, 'Image Retrieval by Shape : A Comparative Study,' Multimedia and Expo, IEEE, Vol.1, pp.141 144, 2000   DOI
10 H. Imai, M. Iri, 'Computational Geometric Methods for Polygonal Approximation of a Curve,' Computer Vision, Graphics and Image Processing, pp.31 41, 1986   DOI
11 김영태, 엄기현, '객체 모양의 특징을 표현하는 재귀적 윤곽 우세 점 추출 방안', 한국정보과학회 봄 학술발표 논문집, 제28권 제1호, pp.19 21, 2001   과학기술학회마을
12 SQUID, http://www.ee.surrey.ac.uk/Research/VSSP/imagedb/demo.html