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 条
  • [31] Protein Domain Embeddings for Fast and Accurate Similarity Search
    Iovino, Benjamin Giovanni
    Tang, Haixu
    Ye, Yuzhen
    RESEARCH IN COMPUTATIONAL MOLECULAR BIOLOGY, RECOMB 2024, 2024, 14758 : 421 - 424
  • [32] Fast Similarity Search via Optimal Sparse Lifting
    Li, Wenye
    Mao, Jingwei
    Zhang, Yin
    Cui, Shuguang
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 31 (NIPS 2018), 2018, 31
  • [33] Self-Taught Hashing for Fast Similarity Search
    Zhang, Dell
    Wang, Jun
    Cal, Deng
    Lu, Jinsong
    SIGIR 2010: PROCEEDINGS OF THE 33RD ANNUAL INTERNATIONAL ACM SIGIR CONFERENCE ON RESEARCH DEVELOPMENT IN INFORMATION RETRIEVAL, 2010, : 18 - 25
  • [34] Bayesian Locality Sensitive Hashing for Fast Similarity Search
    Satuluri, Venu
    Parthasarathy, Srinivasan
    PROCEEDINGS OF THE VLDB ENDOWMENT, 2012, 5 (05): : 430 - 441
  • [35] PSimScan: Algorithm and Utility for Fast Protein Similarity Search
    Kaznadzey, Anna
    Alexandrova, Natalia
    Novichkov, Vladimir
    Kaznadzey, Denis
    PLOS ONE, 2013, 8 (03):
  • [36] Protein domain embeddings for fast and accurate similarity search
    Iovino, Benjamin Giovanni
    Tang, Haixu
    Ye, Yuzhen
    GENOME RESEARCH, 2024, 34 (09) : 1434 - 1444
  • [37] Fast Similarity Search Using Multiple Binary Codes
    Shirakawa, Shinichi
    2014 22ND INTERNATIONAL CONFERENCE ON PATTERN RECOGNITION (ICPR), 2014, : 3714 - 3719
  • [38] Index Structures for Fast Similarity Search for Symbol Strings
    D. A. Rachkovskij
    Cybernetics and Systems Analysis, 2019, 55 : 860 - 878
  • [39] Index Structures for Fast Similarity Search for Symbol Strings
    Rachkovskij, D. A.
    CYBERNETICS AND SYSTEMS ANALYSIS, 2019, 55 (05) : 860 - 878
  • [40] Fast and secure similarity search in high dimensional space
    Furon, Teddy
    Jegou, Herve
    Amsaleg, Laurent
    Mathon, Benjamin
    PROCEEDINGS OF THE 2013 IEEE INTERNATIONAL WORKSHOP ON INFORMATION FORENSICS AND SECURITY (WIFS'13), 2013, : 73 - 78