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 条
  • [1] Combining CPU and GPU architectures for fast similarity search
    Krulis, Martin
    Skopal, Tomas
    Lokoc, Jakub
    Beecks, Christian
    DISTRIBUTED AND PARALLEL DATABASES, 2012, 30 (3-4) : 179 - 207
  • [2] Combining CPU and GPU architectures for fast similarity search
    Martin Kruliš
    Tomáš Skopal
    Jakub Lokoč
    Christian Beecks
    Distributed and Parallel Databases, 2012, 30 : 179 - 207
  • [3] Rank hash similarity for fast similarity search
    Lu, Min
    Huang, YaLou
    Xie, MaoQiang
    Liu, Jie
    INFORMATION PROCESSING & MANAGEMENT, 2013, 49 (01) : 158 - 168
  • [4] Learning ordinal constraint binary codes for fast similarity search
    Zhang, Zheng
    Pun, Chi-Man
    INFORMATION PROCESSING & MANAGEMENT, 2022, 59 (03)
  • [5] Fast Spectral Ranking for Similarity Search
    Iscen, Ahmet
    Avrithis, Yannis
    Tolias, Giorgos
    Furon, Teddy
    Chum, Ondrej
    2018 IEEE/CVF CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2018, : 7632 - 7641
  • [6] Improved Fast Similarity Search in Dictionaries
    Karch, Daniel
    Luxen, Dennis
    Sanders, Peter
    STRING PROCESSING AND INFORMATION RETRIEVAL, 2010, 6393 : 173 - 178
  • [7] Fast similarity search in string databases
    Sheu, S
    Chang, A
    Huang, W
    19TH INTERNATIONAL CONFERENCE ON ADVANCED INFORMATION NETWORKING AND APPLICATIONS, VOL 1, PROCEEDINGS: AINA 2005, 2005, : 617 - 622
  • [8] Fast Similarity Search for Learned Metrics
    Kulis, Brian
    Jain, Prateek
    Grauman, Kristen
    IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2009, 31 (12) : 2143 - 2157
  • [9] Fast business process similarity search
    Yan, Zhiqiang
    Dijkman, Remco
    Grefen, Paul
    DISTRIBUTED AND PARALLEL DATABASES, 2012, 30 (02) : 105 - 144
  • [10] Fast business process similarity search
    Zhiqiang Yan
    Remco Dijkman
    Paul Grefen
    Distributed and Parallel Databases, 2012, 30 : 105 - 144