Share Email Print

Proceedings Paper

Combining fast search and learning for fast similarity search
Author(s): Hooman Vassef; Chung-Sheng Li; Vittorio Castelli
Format Member Price Non-Member Price
PDF $14.40 $18.00

Paper Abstract

In this paper,we propose a new scalable simultaneous learning and indexing technique for efficient content-based retrieval of images that can be described by high- dimensional feature vectors. This scheme combines the elements of an efficient nearest neighbor search algorithm, and a relevance feedback learning algorithm which refines the raw feature space to the specific subjective needs of each new application, around a commonly shared compact indexing structure based on recursive clustering. Consequently, much better time efficiency and scalability can be achieved as compared to those techniques that do not make provisions for efficient indexing or fast learning steps. After an overview of the current related literature, and a presentation of our objectives and foundations, we describe in detail the three aspects of our technique: learning, indexing and similarity search. We conclude with an analysis of the objectives met, and an outline of the current work and considered future enhancements and variations on this technique.

Paper Details

Date Published: 23 December 1999
PDF: 11 pages
Proc. SPIE 3972, Storage and Retrieval for Media Databases 2000, (23 December 1999); doi: 10.1117/12.373570
Show Author Affiliations
Hooman Vassef, IBM Thomas J. Watson Research Ctr. (United States)
Chung-Sheng Li, IBM Thomas J. Watson Research Ctr. (United States)
Vittorio Castelli, IBM Thomas J. Watson Research Ctr. (United States)

Published in SPIE Proceedings Vol. 3972:
Storage and Retrieval for Media Databases 2000
Minerva M. Yeung; Boon-Lock Yeo; Charles A. Bouman, Editor(s)

© SPIE. Terms of Use
Back to Top