Combining fast search and learning for fast similarity search

被引:0
作者
Vassef, H [1 ]
Li, CS [1 ]
Castelli, V [1 ]
机构
[1] IBM Corp, Thomas J Watson Res Ctr, Yorktown Heights, NY 10598 USA
来源
STORAGE AND RETRIEVAL FOR MEDIA DATABASES 2000 | 2000年 / 3972卷
关键词
nearest neighbor search; high-dimensional indexing; relevance feedback; learning; scalability;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页码:32 / 42
页数:11
相关论文
共 17 条
  • [1] The Virage image search engine: An open framework for image management
    Bach, JR
    Fuller, C
    Gupta, A
    Hampapur, A
    Horowitz, B
    Humphrey, R
    Jain, R
    Shu, CF
    [J]. STORAGE AND RETRIEVAL FOR STILL IMAGE AND VIDEO DATABASES IV, 1996, 2670 : 76 - 87
  • [2] BEATTY M, 1997, P IEEE INT C IM PROC
  • [3] Berchtold S, 1996, PROCEEDINGS OF THE INTERNATIONAL CONFERENCE ON VERY LARGE DATA BASES, P28
  • [4] BHANU B, 1998, IEEE COMPUTER VI JUN
  • [5] COX IJ, 1998, SPIE PHOTONICS W
  • [6] COX IJ, 1996, INT C PATT REC VIENN, P361
  • [7] Everitt B., 1993, CLUSTER ANAL
  • [8] FLICKNER M, 1995, IEEE COMPUT, V28, P23, DOI DOI 10.1109/2.410146
  • [9] A FAST K NEAREST NEIGHBOR FINDING ALGORITHM BASED ON THE ORDERED PARTITION
    KIM, BS
    PARK, SB
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1986, 8 (06) : 761 - 766
  • [10] LI CS, 1998, S EL IM SCI TECHN ST, V6