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
关键词
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
相关论文
共 50 条
  • [41] Weighted Hashing for Fast Large Scale Similarity Search
    Wang, Qifan
    Zhang, Dan
    Si, Luo
    PROCEEDINGS OF THE 22ND ACM INTERNATIONAL CONFERENCE ON INFORMATION & KNOWLEDGE MANAGEMENT (CIKM'13), 2013, : 1185 - 1188
  • [42] Fast Similarity Search in Small-World Networks
    Aoyama, Kazuo
    Saito, Kazumi
    Yamada, Takeshi
    Ueda, Naonori
    COMPLEX NETWORKS, 2009, 207 : 185 - +
  • [43] Fast similarity search for high-dimensional dataset
    Wang, Quan
    You, Suya
    ISM 2006: EIGHTH IEEE INTERNATIONAL SYMPOSIUM ON MULTIMEDIA, PROCEEDINGS, 2006, : 799 - +
  • [44] Index Structures for Fast Similarity Search for Binary Vectors
    Rachkovskij D.A.
    Rachkovskij, D.A. (dar@infrm.kiev.ua), 1600, Springer Science and Business Media, LLC (53): : 799 - 820
  • [45] FAST SEARCH
    CAMPISE, L
    DR DOBBS JOURNAL, 1990, 15 (09): : 42 - &
  • [46] Fast marching and fast driving: Combining off-line search and reactive AI
    Livingstone, D
    McDowell, R
    GAME-ON 2003: 4th International Conference on Intelligent Games and Simulation, 2003, : 197 - 200
  • [47] Distance-Based Index Structures for Fast Similarity Search
    Rachkovskij D.A.
    Cybernetics and Systems Analysis, 2017, 53 (04) : 636 - 658
  • [48] Fast Similarity Search on Keyword-Induced Point Groups
    Li, Zhe
    Li, Yu
    Yiu, Man Lung
    26TH ACM SIGSPATIAL INTERNATIONAL CONFERENCE ON ADVANCES IN GEOGRAPHIC INFORMATION SYSTEMS (ACM SIGSPATIAL GIS 2018), 2018, : 109 - 118
  • [49] Fast structural similarity search based on topology string matching
    Park, Sung-Hee
    Gilbert, David
    Ryu, Keun Ho
    PROCEEDINGS OF THE 5TH ASIA- PACIFIC BIOINFOMATICS CONFERENCE 2007, 2007, 5 : 341 - +
  • [50] Toward a phylogenetically aware algorithm for fast DNA similarity search
    Buhler, J
    Nordgren, R
    COMPARATIVE GENOMICS, 2005, 3388 : 15 - 29