메뉴 건너뛰기




Volumn , Issue , 2012, Pages 83-88

Distributed high-dimensional index creation using Hadoop, HDFS and C++

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRUCTION PHASE; HIGH-DIMENSIONAL INDEX; LARGE DATASETS; OPEN-SOURCE; PERFORMANCE GAIN; PRACTICAL PROBLEMS; RUNTIME ENVIRONMENTS;

EID: 84866636304     PISSN: 19493991     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CBMI.2012.6269848     Document Type: Conference Paper
Times cited : (5)

References (14)
  • 2
    • 37549003336 scopus 로고    scopus 로고
    • Mapreduce: Simplified data processing on large clusters
    • J. Dean and S. Ghemawat. Mapreduce: simplified data processing on large clusters. CACM, 2008.
    • (2008) CACM
    • Dean, J.1    Ghemawat, S.2
  • 3
    • 74049093505 scopus 로고    scopus 로고
    • Evaluation of gist descriptors for web-scale image search
    • M. Douze, H. Jégou, H. Singh, L. Amsaleg, and C. Schmid. Evaluation of gist descriptors for web-scale image search. In CIVR, 2009.
    • (2009) CIVR
    • Douze, M.1    Jégou, H.2    Singh, H.3    Amsaleg, L.4    Schmid, C.5
  • 6
    • 78649317568 scopus 로고    scopus 로고
    • Product quantization for nearest neighbor search
    • H. Jégou, M. Douze, and C. Schmid. Product quantization for nearest neighbor search. TPAMI, 2011.
    • (2011) TPAMI
    • Jégou, H.1    Douze, M.2    Schmid, C.3
  • 8
    • 80051606616 scopus 로고    scopus 로고
    • Searching in one billion vectors: Re-rank with source coding
    • H. Jégou, R. Tavenard, M. Douze, and L. Amsaleg. Searching in one billion vectors: Re-rank with source coding. In ICASSP, 2011.
    • (2011) ICASSP
    • Jégou, H.1    Tavenard, R.2    Douze, M.3    Amsaleg, L.4
  • 9
    • 64849099560 scopus 로고    scopus 로고
    • NVTree: An efficient disk-based index for approximate search in very large high-dimensional collections
    • H. Lejsek, F. Amundsson, B. Jónsson, and L. Amsaleg. NVTree: An efficient disk-based index for approximate search in very large high-dimensional collections. TPAMI, 2009.
    • (2009) TPAMI
    • Lejsek, H.1    Amundsson, F.2    Jónsson, B.3    Amsaleg, L.4
  • 10
    • 79959687325 scopus 로고    scopus 로고
    • NV-Tree: Nearest neighbors at the billion scale
    • H. Lejsek, B. Jónsson, and L. Amsaleg. NV-Tree: nearest neighbors at the billion scale. In ICMR, 2011.
    • (2011) ICMR
    • Lejsek, H.1    Jónsson, B.2    Amsaleg, L.3
  • 11
    • 3042535216 scopus 로고    scopus 로고
    • Distinctive image features from scale invariant keypoints
    • D. Lowe. Distinctive image features from scale invariant keypoints. IJCV, 2004.
    • (2004) IJCV
    • Lowe, D.1
  • 12
    • 77953324416 scopus 로고    scopus 로고
    • Locality sensitive hashing: A comparison of hash function types and querying mechanisms
    • L. Paulevé, H. Jégou, and L. Amsaleg. Locality sensitive hashing: A comparison of hash function types and querying mechanisms. Pattern Recognition Letters, 2010.
    • (2010) Pattern Recognition Letters
    • Paulevé, L.1    Jégou, H.2    Amsaleg, L.3
  • 13
    • 0345414182 scopus 로고    scopus 로고
    • Video google: A text retrieval approach to object matching in videos
    • J. Sivic and A. Zisserman. Video google: A text retrieval approach to object matching in videos. In ICCV, 2003.
    • (2003) ICCV
    • Sivic, J.1    Zisserman, A.2


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