메뉴 건너뛰기




Volumn 30, Issue 1, 2008, Pages 89-104

BoostMap: An embedding method for efficient nearest neighbor retrieval

Author keywords

Embedding methods; Indexing methods; Multimedia databases; Nearest neighbor classification; Nearest neighbor retrieval; Non Euclidean spaces; Similarity matching

Indexed keywords

CLASSIFICATION (OF INFORMATION); DATABASE SYSTEMS; INDEXING (OF INFORMATION); OPTIMIZATION; PATTERN MATCHING; QUERY PROCESSING;

EID: 36448945460     PISSN: 01628828     EISSN: None     Source Type: Journal    
DOI: 10.1109/TPAMI.2007.1140     Document Type: Article
Times cited : (59)

References (67)
  • 2
    • 33845568895 scopus 로고
    • The Symmetric Time Warping Algorithm: From Continuous to Discrete
    • Addison-Wesley
    • J.B. Kruskall and M. Liberman, "The Symmetric Time Warping Algorithm: From Continuous to Discrete," Time Warps, Addison-Wesley, 1983.
    • (1983) Time Warps
    • Kruskall, J.B.1    Liberman, M.2
  • 4
    • 0001116877 scopus 로고
    • Binary Codes Capable of Correcting Deletions, Insertions, and Reversals
    • V.I. Levenshtein, "Binary Codes Capable of Correcting Deletions, Insertions, and Reversals," Soviet Physics, vol. 10, no. 8, pp. 707-710, 1966.
    • (1966) Soviet Physics , vol.10 , Issue.8 , pp. 707-710
    • Levenshtein, V.I.1
  • 5
    • 0038633576 scopus 로고    scopus 로고
    • Properties of Embedding Methods for Similarity Searching in Metric Spaces
    • May
    • G. Hjaltason and H. Samet, "Properties of Embedding Methods for Similarity Searching in Metric Spaces," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 25, no. 5, pp. 530-549, May 2003.
    • (2003) IEEE Trans. Pattern Analysis and Machine Intelligence , vol.25 , Issue.5 , pp. 530-549
    • Hjaltason, G.1    Samet, H.2
  • 6
    • 0033281701 scopus 로고    scopus 로고
    • Improved Boosting Algorithms Using Confidence-Rated Predictions
    • R. Schapire and Y. Singer, "Improved Boosting Algorithms Using Confidence-Rated Predictions," Machine Learning, vol. 37, no. 3, pp. 297-336, 1999.
    • (1999) Machine Learning , vol.37 , Issue.3 , pp. 297-336
    • Schapire, R.1    Singer, Y.2
  • 9
    • 84976803260 scopus 로고
    • FastMap: A Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Datasets
    • C. Faloutsos and K.I. Lin, "FastMap: A Fast Algorithm for Indexing, Data-Mining and Visualization of Traditional and Multimedia Datasets," Proc. ACM Int'l Conf. Management of Data pp. 163-174, 1995.
    • (1995) Proc. ACM Int'l Conf. Management of Data , pp. 163-174
    • Faloutsos, C.1    Lin, K.I.2
  • 10
    • 0027188633 scopus 로고
    • Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces
    • P. Yianilos, "Data Structures and Algorithms for Nearest Neighbor Search in General Metric Spaces," Proc. ACM-SIAM Symp. Discrete Algorithms, pp. 311-321, 1993.
    • (1993) Proc. ACM-SIAM Symp. Discrete Algorithms , pp. 311-321
    • Yianilos, P.1
  • 11
    • 0038670812 scopus 로고    scopus 로고
    • Searching in High-Dimensional Spaces: Index Structures for Improving the Performance of Multimedia Databases
    • C. Böhm, S. Berchtold, and D.A. Keim, "Searching in High-Dimensional Spaces: Index Structures for Improving the Performance of Multimedia Databases," ACM Computing Surveys, vol. 33, no. 3, pp. 322-373, 2001.
    • (2001) ACM Computing Surveys , vol.33 , Issue.3 , pp. 322-373
    • Böhm, C.1    Berchtold, S.2    Keim, D.A.3
  • 12
    • 0041664272 scopus 로고    scopus 로고
    • Index-Driven Similarity Search in Metric Spaces
    • G.R. Hjaltason and H. Samet, "Index-Driven Similarity Search in Metric Spaces," ACM Trans. Database Systems, vol. 28, no. 4, pp. 517-580, 2003.
    • (2003) ACM Trans. Database Systems , vol.28 , Issue.4 , pp. 517-580
    • Hjaltason, G.R.1    Samet, H.2
  • 14
    • 0000681228 scopus 로고    scopus 로고
    • A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces
    • R. Weber, H.-J. Schek, and S. Blott, "A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces," Proc. Int'l Conf. Very Large Data Bases, pp. 194-205, 1998.
    • (1998) Proc. Int'l Conf. Very Large Data Bases , pp. 194-205
    • Weber, R.1    Schek, H.-J.2    Blott, S.3
  • 16
    • 0005287692 scopus 로고    scopus 로고
    • Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces
    • K. Chakrabarti and S. Mehrotra, "Local Dimensionality Reduction: A New Approach to Indexing High Dimensional Spaces," Proc. Int'l Conf. Very Large Data Bases, pp. 89-100, 2000.
    • (2000) Proc. Int'l Conf. Very Large Data Bases , pp. 89-100
    • Chakrabarti, K.1    Mehrotra, S.2
  • 17
    • 0036649291 scopus 로고    scopus 로고
    • Clustering for Approximate Similarity Search in High-Dimensional Spaces
    • Nov./Dec
    • C. Li, E. Chang, H. Garcia-Molina, and G. Wiederhold, "Clustering for Approximate Similarity Search in High-Dimensional Spaces," IEEE Trans. Knowledge and Data Eng., vol. 14, no. 4, pp. 792-808, Nov./Dec. 2002.
    • (2002) IEEE Trans. Knowledge and Data Eng , vol.14 , Issue.4 , pp. 792-808
    • Li, C.1    Chang, E.2    Garcia-Molina, H.3    Wiederhold, G.4
  • 22
    • 0038376764 scopus 로고    scopus 로고
    • VQ-Index: An Index Structure for Similarity Searching in Multimedia Databases
    • E. Tuncel, H. Ferhatosmanoglu, and K. Rose, "VQ-Index: An Index Structure for Similarity Searching in Multimedia Databases," Proc. ACM Multimedia, pp. 543-552, 2002.
    • (2002) Proc. ACM Multimedia , pp. 543-552
    • Tuncel, E.1    Ferhatosmanoglu, H.2    Rose, K.3
  • 25
    • 5044239992 scopus 로고    scopus 로고
    • K. Grauman and T.J. Darrell, Fast Contour Matching Using Approximate Earth Mover's Distance, Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. I: 220-I: 227, 2004.
    • K. Grauman and T.J. Darrell, "Fast Contour Matching Using Approximate Earth Mover's Distance," Proc. IEEE Conf. Computer Vision and Pattern Recognition, pp. I: 220-I: 227, 2004.
  • 28
    • 0002719797 scopus 로고
    • The Hungarian Method for the Assignment Problem
    • H.W. Kuhn, "The Hungarian Method for the Assignment Problem," Naval Research Logistics Quarterly, vol. 2, pp. 83-87, 1955.
    • (1955) Naval Research Logistics Quarterly , vol.2 , pp. 83-87
    • Kuhn, H.W.1
  • 29
    • 0026256261 scopus 로고
    • Satisfying General Proximity/Similarity Queries with Metric Trees
    • J. Uhlman, "Satisfying General Proximity/Similarity Queries with Metric Trees," Information Processing Letters, vol. 40, no. 4, pp. 175-179, 1991.
    • (1991) Information Processing Letters , vol.40 , Issue.4 , pp. 175-179
    • Uhlman, J.1
  • 30
    • 0001728087 scopus 로고    scopus 로고
    • Indexing Large Metric Spaces for Similarity Search Queries
    • T. Bozkaya and Z. Özsoyoglu, "Indexing Large Metric Spaces for Similarity Search Queries," ACM Trans. Database Systems, vol. 24, no. 3, pp. 361-404, 1999.
    • (1999) ACM Trans. Database Systems , vol.24 , Issue.3 , pp. 361-404
    • Bozkaya, T.1    Özsoyoglu, Z.2
  • 31
  • 33
    • 0000395928 scopus 로고    scopus 로고
    • Approximate Similarity Retrieval with M-Trees
    • P. Zezula, P. Savino, G. Amato, and F. Rabitti, "Approximate Similarity Retrieval with M-Trees," VLDB J., vol. 4, pp. 275-293, 1998.
    • (1998) VLDB J , vol.4 , pp. 275-293
    • Zezula, P.1    Savino, P.2    Amato, G.3    Rabitti, F.4
  • 34
    • 0003046095 scopus 로고
    • New Formulation and Improvements of the Nearest-Neighbour Approximating and Eliminating Search Algorithm (AESA)
    • E. Vidal, "New Formulation and Improvements of the Nearest-Neighbour Approximating and Eliminating Search Algorithm (AESA)," Pattern Recognition Letters, vol. 15, no. 1, pp. 1-7, 1994.
    • (1994) Pattern Recognition Letters , vol.15 , Issue.1 , pp. 1-7
    • Vidal, E.1
  • 35
    • 0003159276 scopus 로고
    • A New Version of the Nearest-Neighbour Approximating and Eliminating Search Algorithm (AESA) with Linear Preprocessing Time and Memory Requirements
    • L. Micó 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 Letters, vol. 15, no. 1, pp. 9-17, 1994.
    • (1994) Pattern Recognition Letters , vol.15 , Issue.1 , pp. 9-17
    • Micó, L.1    Vidal, E.2
  • 36
    • 51249178997 scopus 로고
    • On Lipschitz Embeddings of Finite Metric Spaces in Hilbert Space
    • J. Bourgain, "On Lipschitz Embeddings of Finite Metric Spaces in Hilbert Space," Israel J. Math., vol. 52, pp. 46-52, 1985.
    • (1985) Israel J. Math , vol.52 , pp. 46-52
    • Bourgain, J.1
  • 37
    • 0010011718 scopus 로고    scopus 로고
    • Cluster-Preserving Embedding of Proteins
    • Technical Report 99-50, Computer Science Dept, Rutgers Univ
    • G. Hristescu and M. Farach-Colton, "Cluster-Preserving Embedding of Proteins," Technical Report 99-50, Computer Science Dept., Rutgers Univ., 1999.
    • (1999)
    • Hristescu, G.1    Farach-Colton, M.2
  • 38
    • 0034704222 scopus 로고    scopus 로고
    • Nonlinear Dimensionality Reduction by Locally Linear Embedding
    • S. Roweis and L. Saul, "Nonlinear Dimensionality Reduction by Locally Linear Embedding," Science, vol. 290, pp. 2323-2326, 2000.
    • (2000) Science , vol.290 , pp. 2323-2326
    • Roweis, S.1    Saul, L.2
  • 39
    • 0034704229 scopus 로고    scopus 로고
    • A Global Geometric Framework for Nonlinear Dimensionality Reduction
    • J. Tenenbaum, V.D. Silva, and J. Langford, "A Global Geometric Framework for Nonlinear Dimensionality Reduction," Science, vol. 290, pp. 2319-2323, 2000.
    • (2000) Science , vol.290 , pp. 2319-2323
    • Tenenbaum, J.1    Silva, V.D.2    Langford, J.3
  • 48
    • 1342324582 scopus 로고    scopus 로고
    • The Writer Independent Online Handwriting Recognition System Frog on Hand and Cluster Generative Statistical Dynamic Time Warping
    • Mar
    • C. Bahlmann and H. Burkhardt, "The Writer Independent Online Handwriting Recognition System Frog on Hand and Cluster Generative Statistical Dynamic Time Warping," IEEE Trans. Pattern Analysis and Machine Intelligence, vol. 26, no. 3, pp. 299-310, Mar. 2004.
    • (2004) IEEE Trans. Pattern Analysis and Machine Intelligence , vol.26 , Issue.3 , pp. 299-310
    • Bahlmann, C.1    Burkhardt, H.2
  • 49
    • 0036466989 scopus 로고    scopus 로고
    • An Incremental Prototype Set Building Technique
    • V.S. Devi and M.N. Murty, "An Incremental Prototype Set Building Technique," Pattern Recognition, vol. 35, no. 2, pp. 505-513, 2002.
    • (2002) Pattern Recognition , vol.35 , Issue.2 , pp. 505-513
    • Devi, V.S.1    Murty, M.N.2
  • 50
    • 0015346497 scopus 로고
    • The Reduced Nearest Neighbor Rule
    • G.W. Gates, "The Reduced Nearest Neighbor Rule," IEEE Trans. Information Theory, vol. 18, no. 3, pp. 431-433, 1972.
    • (1972) IEEE Trans. Information Theory , vol.18 , Issue.3 , pp. 431-433
    • Gates, G.W.1
  • 51
    • 84931162639 scopus 로고
    • The Condensed Nearest Neighbor Rule
    • P.E. Hart, "The Condensed Nearest Neighbor Rule," IEEE Trans. Information Theory, vol. 14, no. 3, pp. 515-516, 1968.
    • (1968) IEEE Trans. Information Theory , vol.14 , Issue.3 , pp. 515-516
    • Hart, P.E.1
  • 54
    • 36448936896 scopus 로고    scopus 로고
    • Learning Embeddings for Indexing, Retrieval and Classification, with Applications to Object and Shape Recognition in Image Databases,
    • PhD dissertation, Boston Univ
    • V. Athitsos, "Learning Embeddings for Indexing, Retrieval and Classification, with Applications to Object and Shape Recognition in Image Databases," PhD dissertation, Boston Univ., 2006.
    • (2006)
    • Athitsos, V.1
  • 55
    • 0034164230 scopus 로고    scopus 로고
    • Additive Logistic Regression: A Statistical View of Boosting
    • J. Friedman, T. Hastie, and R. Tibshirani, "Additive Logistic Regression: A Statistical View of Boosting," Annals of Statistics vol. 28, no. 2, pp. 337-374, 2000.
    • (2000) Annals of Statistics , vol.28 , Issue.2 , pp. 337-374
    • Friedman, J.1    Hastie, T.2    Tibshirani, R.3
  • 59
    • 0032203257 scopus 로고    scopus 로고
    • Gradient-Based Learning Applied to Document Recognition
    • Y. LeCun, L. Bottou, Y. Bengio, and P. Haffner, "Gradient-Based Learning Applied to Document Recognition," Proc. IEEE, vol. 86, no. 11, pp. 2278-2324, 1998.
    • (1998) Proc. IEEE , vol.86 , Issue.11 , pp. 2278-2324
    • LeCun, Y.1    Bottou, L.2    Bengio, Y.3    Haffner, P.4


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