메뉴 건너뛰기




Volumn 41, Issue 3 SPEC. ISS., 2005, Pages 285-291

Audio fingerprinting: Nearest neighbor search in high dimensional binary spaces

Author keywords

[No Author keywords available]

Indexed keywords

MEMORY COSTS; PROBABILISTIC SEARCH ALGORITHM;

EID: 29344470029     PISSN: 13875485     EISSN: None     Source Type: Journal    
DOI: 10.1007/s11265-005-4152-2     Document Type: Conference Paper
Times cited : (34)

References (11)
  • 2
    • 0032201716 scopus 로고    scopus 로고
    • An optimal algorithm for approximate nearest neighbor searching in fixed dimensions
    • S. Arya, D.M. Mount, N.S. Nctanyahu, R. Silverman, and A.Y. Wu, "An Optimal Algorithm for Approximate Nearest Neighbor Searching in Fixed Dimensions," J. of the ACM, vol. 45, no. 6, 1998, pp. 891-923.
    • (1998) J. of the ACM , vol.45 , Issue.6 , pp. 891-923
    • Arya, S.1    Mount, D.M.2    Nctanyahu, N.S.3    Silverman, R.4    Wu, A.Y.5
  • 10
    • 84944407482 scopus 로고    scopus 로고
    • Feature extraction and a database strategy for video fingerprinting
    • Springer Verlag
    • J. Oostveen, T. Kalker, and J. Haitsma, "Feature Extraction and a Database Strategy for Video Fingerprinting," in 5th Int. Conf. on Visual Information Systems, vol. LNCS 2314, pp. 117-128. Springer Verlag, 2002.
    • (2002) 5th Int. Conf. on Visual Information Systems , vol.LNCS 2314 , pp. 117-128
    • Oostveen, J.1    Kalker, T.2    Haitsma, J.3


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