메뉴 건너뛰기




Volumn 53, Issue 6, 2010, Pages 84-94

Efficiently searching for similar images

Author keywords

[No Author keywords available]

Indexed keywords

SCALABLE IMAGE; SIMILAR IMAGE;

EID: 77953223981     PISSN: 00010782     EISSN: 15577317     Source Type: Journal    
DOI: 10.1145/1743546.1743570     Document Type: Review
Times cited : (26)

References (33)
  • 2
    • 0019648752 scopus 로고
    • A survey of heuristics for the weighted matching problem
    • Avis, D. A survey of heuristics for the weighted matching problem. networks, 13 (1983), 475-493.
    • (1983) Networks , vol.13 , pp. 475-493
    • Avis, D.1
  • 5
  • 8
    • 0029375609 scopus 로고
    • Query by image and video content: The QbIC system
    • Flickner, M. et al. Query by image and video content: The QbIC system. IEEE Comput. 28, 9 (1995), 23-32.
    • (1995) IEEE Comput. , vol.28 , Issue.9 , pp. 23-32
    • Flickner, M.1
  • 9
    • 84945709355 scopus 로고
    • An algorithm for fnding best matches in logarithmic expected time
    • Friedman, J., bentley, J., Finkel, R. An algorithm for fnding best matches in logarithmic expected time. ACM Trans. Math. Softw. 3, 3 (1977), 209-226.
    • (1977) ACM Trans. Math. Softw. , vol.3 , Issue.3 , pp. 209-226
    • Friedman, J.1    Bentley, J.2    Finkel, R.3
  • 11
    • 84893574327 scopus 로고
    • Improved approximation algorithms for maximum cut and satisfability problems using semidefnite programming
    • Goemans, M., Williamson, D. Improved approximation algorithms for maximum cut and satisfability problems using semidefnite programming. J. Assoc. Comput. Mach. 42, 6 (1995), 1115-1145.
    • (1995) J. Assoc. Comput. Mach. , vol.42 , Issue.6 , pp. 1115-1145
    • Goemans, M.1    Williamson, D.2
  • 15
    • 34247576789 scopus 로고    scopus 로고
    • The pyramid match kernel: Effcient learning with sets of features
    • Grauman, k., Darrell, T. The pyramid match kernel: effcient learning with sets of features. J. Mach. Learn. res. 8 (2007), 725-760.
    • (2007) J. Mach. Learn. Res. , vol.8 , pp. 725-760
    • Grauman, K.1    Darrell, T.2
  • 16
    • 0031644241 scopus 로고    scopus 로고
    • Approximate nearest neighbors: Towards removing the curse of dimensionality
    • Indyk, P., Motwani, R. Approximate nearest neighbors: Towards removing the curse of dimensionality. In Symposium on Theory of Computing (1998).
    • (1998) Symposium on Theory of Computing
    • Indyk, P.1    Motwani, R.2
  • 23
    • 3042535216 scopus 로고    scopus 로고
    • Distinctive image features from scale-invariant keypoints
    • Lowe, D. Distinctive image features from scale-invariant keypoints. Int. J. Comput. vis. 60, 2 (2004).
    • (2004) Int. J. Comput. Vis. , vol.60 , pp. 2
    • Lowe, D.1
  • 25
    • 34247333458 scopus 로고    scopus 로고
    • From omnidirectional images to hierarchical localization
    • May
    • Murilloa, A. et al. From omnidirectional images to hierarchical localization. robotics Auton. Syst. 55, 5 (May 2007), 372-382.
    • (2007) Robotics Auton. Syst. , vol.55 , Issue.5 , pp. 372-382
    • Murilloa, A.1
  • 31
    • 0026256261 scopus 로고
    • Satisfying general proximity/similarity queries with metric trees
    • Uhlmann, J. Satisfying general proximity/similarity queries with metric trees. Inf. Process. Lett. 40 (1991), 175-179.
    • (1991) Inf. Process. Lett. , vol.40 , pp. 175-179
    • Uhlmann, J.1


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