메뉴 건너뛰기




Volumn 32, Issue 11, 2011, Pages 1511-1516

A fast pivot-based indexing algorithm for metric spaces

Author keywords

Fast nearest neighbor; Metric space; Similarity search

Indexed keywords

DISTANCE COMPUTATION; DISTANCE FUNCTIONS; EMPIRICAL RESULTS; EUCLIDEAN DISTANCE; EXECUTION TIME; INDEXING ALGORITHMS; METRIC SPACES; NEAREST NEIGHBOR SEARCHES; NEAREST NEIGHBORS; PERFORMANCE MEASUREMENTS; PREPROCESSING TIME; RUNTIMES; SIMILARITY SEARCH; WORK FOCUS;

EID: 79957490409     PISSN: 01678655     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.patrec.2011.04.016     Document Type: Article
Times cited : (16)

References (30)
  • 3
    • 34548386174 scopus 로고    scopus 로고
    • Advanced indexing schema for imaging applications: Three case studies
    • DOI 10.1049/iet-ipr:20060315
    • S. Battiato, G.D. Blasi, and D. Reforgiato Advanced indexing schema for imaging applications: Three case studies Image Process.; IET 1 3 2007 249 268 (Pubitemid 47351640)
    • (2007) IET Image Processing , vol.1 , Issue.3 , pp. 249-268
    • Battiato, S.1    Di Blasi, G.2    Reforgiato, D.3
  • 4
    • 46249118951 scopus 로고    scopus 로고
    • Similarity search using sparse pivots for efficient multimedia information retrieval
    • IEEE Computer Society Washington, DC, USA
    • N. Brisaboa, A. Farina, O. Pedreira, and N. Reyes Similarity search using sparse pivots for efficient multimedia information retrieval ISM '06: Proc. Eighth IEEE Internat. Symposium on Multimedia 2006 IEEE Computer Society Washington, DC, USA 881 888
    • (2006) ISM '06: Proc. Eighth IEEE Internat. Symposium on Multimedia , pp. 881-888
    • Brisaboa, N.1    Farina, A.2    Pedreira, O.3    Reyes, N.4
  • 5
    • 0041339760 scopus 로고    scopus 로고
    • Pivot selection techniques for proximity searching in metric spaces
    • DOI 10.1016/S0167-8655(03)00065-5
    • B. Bustos, G. Navarro, and E. Chávez Pivot selection techniques for proximity searching in metric spaces Pattern Recognition Lett. 24 14 2003 2357 2366 (Pubitemid 36911079)
    • (2003) Pattern Recognition Letters , vol.24 , Issue.14 , pp. 2357-2366
    • Bustos, B.1    Navarro, G.2    Chavez, E.3
  • 10
  • 11
    • 84945709355 scopus 로고
    • An algorithm for finding best matches in logarithmic expected time
    • J. Friedman, J. Bentley, and R. Finkel An algorithm for finding best matches in logarithmic expected time ACM Trans. Math. Softw. 3 1977 209 226
    • (1977) ACM Trans. Math. Softw. , vol.3 , pp. 209-226
    • Friedman, J.1    Bentley, J.2    Finkel, R.3
  • 12
    • 36849058744 scopus 로고    scopus 로고
    • A nearest-neighbor approach to relevance feedback in content based image retrieval
    • DOI 10.1145/1282280.1282347, Proceedings of the 6th ACM International Conference on Image and Video Retrieval, CIVR 2007
    • G. Giacinto A nearest-neighbor approach to relevance feedback in content based image retrieval CIVR '07: Proc. 6th ACM Internat. Conf. on Image and Video Retrieval 2007 ACM New York, NY, USA 456 463 (Pubitemid 350229659)
    • (2007) Proceedings of the 6th ACM International Conference on Image and Video Retrieval, CIVR 2007 , pp. 456-463
    • Giacinto, G.1
  • 13
    • 0041664272 scopus 로고    scopus 로고
    • Index-driven similarity search in metric spaces
    • G. Hjaltason, and H. Samet Index-driven similarity search in metric spaces ACM Trans. Database Systems 28 4 2003 517 580 (survey article)
    • (2003) ACM Trans. Database Systems , vol.28 , Issue.4 , pp. 517-580
    • Hjaltason, G.1    Samet, H.2
  • 17
    • 0041654220 scopus 로고
    • Multidimensional scaling by optimizing goodness of fit to a non-metric hypothesis
    • J. Kruskal Multidimensional scaling by optimizing goodness of fit to a non-metric hypothesis Psychomotrika 29 1964 1 27
    • (1964) Psychomotrika , vol.29 , pp. 1-27
    • Kruskal, J.1
  • 18
    • 0000390142 scopus 로고
    • Binary codes capable of correcting deletions, insertions, and reversals
    • V.I. Levenshtein Binary codes capable of correcting deletions, insertions, and reversals Dokl. Akad. Nauk SSSR 163 4 1965 845 848
    • (1965) Dokl. Akad. Nauk SSSR , vol.163 , Issue.4 , pp. 845-848
    • Levenshtein, V.I.1
  • 19
    • 18744416013 scopus 로고    scopus 로고
    • Image similarity search with compact data structures
    • CIKM 2004: Proceedings of the Thirteenth ACM Conference on Information and Knowledge Management
    • Q. Lv, M. Charikar, and K. Li Image similarity search with compact data structures CIKM '04: Proc. Thirteenth ACM Internat. Conf. on Information and Knowledge Management 2004 ACM New York, NY, USA 208 217 (Pubitemid 40673448)
    • (2004) International Conference on Information and Knowledge Management, Proceedings , pp. 208-217
    • Lv, Q.1    Charikar, M.2    Li, K.3
  • 20
    • 0003159276 scopus 로고
    • A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements
    • L. Micó, J. Oncina, and E. Vidal A new version of the nearest-neighbour approximating and eliminating search algorithm (AESA) with linear preprocessing time and memory requirements Pattern Recognition Lett. 15 1 1994 9 17
    • (1994) Pattern Recognition Lett. , vol.15 , Issue.1 , pp. 9-17
    • Micó, L.1    Oncina, J.2    Vidal, E.3
  • 23
    • 76249095073 scopus 로고    scopus 로고
    • Similarity searching for on-line handwritten documents
    • S. Schimke, and C. Vielhauer Similarity searching for on-line handwritten documents J. Multimodal User Interfaces 1 2 2007 49 54
    • (2007) J. Multimodal User Interfaces , vol.1 , Issue.2 , pp. 49-54
    • Schimke, S.1    Vielhauer, C.2
  • 24
    • 84993661650 scopus 로고    scopus 로고
    • Efficient user-adaptable similarity search in large multimedia databases
    • Morgan Kaufmann Publishers Inc. San Francisco, CA, USA
    • T. Seidl, and H.P. Kriegel Efficient user-adaptable similarity search in large multimedia databases VLDB '97: Proc. 23rd Internat. Conf. on Very Large Data Bases 1997 Morgan Kaufmann Publishers Inc. San Francisco, CA, USA 506 515
    • (1997) VLDB '97: Proc. 23rd Internat. Conf. on Very Large Data Bases , pp. 506-515
    • Seidl, T.1    Kriegel, H.P.2
  • 25
    • 72849144638 scopus 로고    scopus 로고
    • Anytime classification using the nearest neighbor algorithm with applications to stream mining
    • IEEE Computer Society Washington, DC, USA
    • K. Ueno, X. Xi, E. Keogh, and D.-J. Lee Anytime classification using the nearest neighbor algorithm with applications to stream mining ICDM '06: Proc. Sixth Internat. Conf. on Data Mining 2006 IEEE Computer Society Washington, DC, USA 623 632
    • (2006) ICDM '06: Proc. Sixth Internat. Conf. on Data Mining , pp. 623-632
    • Ueno, K.1    Xi, X.2    Keogh, E.3    Lee, D.-J.4
  • 26
    • 0022858293 scopus 로고
    • An algorithm for finding nearest neighbours in (approximately) constant average time
    • E. Vidal An algorithm for finding nearest neighbours in (approximately) constant average time Pattern Recognition Lett. 4 3 1986 145 157
    • (1986) Pattern Recognition Lett. , vol.4 , Issue.3 , pp. 145-157
    • Vidal, E.1
  • 27
    • 0036132154 scopus 로고    scopus 로고
    • Efficient image retrieval through vantage objects
    • J. Vleugels, and R. Veltkamp Efficient image retrieval through vantage objects Pattern Recognition 35 1999 69 80
    • (1999) Pattern Recognition , vol.35 , pp. 69-80
    • Vleugels, J.1    Veltkamp, R.2
  • 28
    • 0015960104 scopus 로고
    • The string-to-string correction problem
    • R.A. Wagner, and M.J. Fischer The string-to-string correction problem J. ACM 21 1 1974 168 173
    • (1974) J. ACM , vol.21 , Issue.1 , pp. 168-173
    • Wagner, R.A.1    Fischer, M.J.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.