Result: An extraction technique of optimal interest points for shape-based image classification

Title:
An extraction technique of optimal interest points for shape-based image classification
Source:
Multimedia content representation, classification and security (International Workshop, MRCS 2006, Istanbul, Turkey, September 11-13, 2006)0MRCS 2006. :505-513
Publisher Information:
Berlin: Springer, 2006.
Publication Year:
2006
Physical Description:
print, 10 ref 1
Original Material:
INIST-CNRS
Document Type:
Conference Conference Paper
File Description:
text
Language:
English
Author Affiliations:
Dept. of Computer and Multimedia Engineering, Dongguk University Pildong 3 ga 26, Chunggu, Seoul, 100-715, Korea, Republic of
Dept. of Internet & Information, Kyungmin University Ganeung 3 Dong, Uijeongbu, Gyeonggido, 480-702, Korea, Republic of
ISSN:
0302-9743
Rights:
Copyright 2007 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Computer science; theoretical automation; systems
Accession Number:
edscal.19151397
Database:
PASCAL Archive

Further Information

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 0(nlog n). 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.