A hierarchical algorithm for image retrieval by sketch

Author

Chan, Yin ; Kung, S.Y.

Author_Institution

Princeton Univ., NJ, USA

fYear

1997

fDate

23-25 Jun 1997

Firstpage

564

Lastpage

569

Abstract

In this paper, we introduce a hierarchical algorithm for image retrieval by sketch, The application scenario is that the user inputs a rough sketch depicting the prominent edges or contours of objects and wishes to retrieve database images that have similar shapes. We can only expect to get a rough query sketch from the user, which is likely a distorted version of the intended database image, hence it is imperative that tolerance be provided towards sketch distortion. Compared with a previous method that has been adopted by various well-known content-based image indexing and retrieval systems such as the IBM QBIC project, this hierarchical algorithm offers 7 times computation speed-up while demonstrates more tolerance towards distortion in user sketches

Keywords

query processing; visual databases; IBM QBIC; application scenario; content-based image indexing and retrieval systems; contours; database image; hierarchical algorithm; image retrieval; prominent edges; rough sketch; sketch distortion; Content based retrieval; Data mining; Feature extraction; Image databases; Image retrieval; Indexing; Information retrieval; Search engines; Shape; Spatial databases;

fLanguage

English

Publisher

ieee

Conference_Titel

Multimedia Signal Processing, 1997., IEEE First Workshop on

Conference_Location

Princeton, NJ

Print_ISBN

0-7803-3780-8

Type

conf

DOI

10.1109/MMSP.1997.602694

Filename

602694