메뉴 건너뛰기




Volumn 4071 LNCS, Issue , 2006, Pages 401-410

Multidimensional descriptor indexing: Exploring the BitMatrix

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DATA STRUCTURES; INFORMATION RETRIEVAL; MULTIMEDIA SYSTEMS; SEARCH ENGINES;

EID: 33746605712     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11788034_41     Document Type: Conference Paper
Times cited : (10)

References (18)
  • 1
    • 10044240379 scopus 로고    scopus 로고
    • Semantic metric for image library exploration
    • Mojsilovic, A.: Semantic Metric for Image Library Exploration. IEEE Transactions on Multimedia 6 (2004) 828-838
    • (2004) IEEE Transactions on Multimedia , vol.6 , pp. 828-838
    • Mojsilovic, A.1
  • 2
    • 0038520452 scopus 로고    scopus 로고
    • MPEG-7 Requirements Group (Editor José M. Martínez). ISO/IEC JTC1/SC29/WG11 N6828
    • MPEG-7 Requirements Group (Editor José M. Martínez): MPEG-7 Overview v.10. ISO/IEC JTC1/SC29/WG11 N6828 (2004)
    • (2004) MPEG-7 Overview V.10
  • 4
    • 0038670812 scopus 로고    scopus 로고
    • Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases
    • Böhm, C., Berchtold, S., Keim, D.A.: Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Comput. Surv. 33 (2001) 322-373
    • (2001) ACM Comput. Surv. , vol.33 , pp. 322-373
    • Böhm, C.1    Berchtold, S.2    Keim, D.A.3
  • 6
    • 33947101568 scopus 로고    scopus 로고
    • High-dimensional similarity searches using a metric pseudo-grid
    • Digout, C., Nascimento, M.A.: High-dimensional similarity searches using a metric pseudo-grid. In: ICDE Workshops 1174. (2005)
    • (2005) ICDE Workshops , vol.1174
    • Digout, C.1    Nascimento, M.A.2
  • 7
    • 23944466912 scopus 로고    scopus 로고
    • iDistance: An adaptive B+-tree based indexing method for nearest neighbor search
    • Jagadish, H.V., Ooi, B.C., Tan, K.L., Yu, C., Zhang, R.: iDistance: An adaptive B+-tree based indexing method for nearest neighbor search. ACM Trans. Database Syst. 30 (2005) 364-397
    • (2005) ACM Trans. Database Syst. , vol.30 , pp. 364-397
    • Jagadish, H.V.1    Ooi, B.C.2    Tan, K.L.3    Yu, C.4    Zhang, R.5
  • 11
    • 0000681228 scopus 로고    scopus 로고
    • A quantitative analysis and performance study for similarity-search methods in high-dimensional spaces
    • Weber, R., Schek, H.J., Blott, S.: A Quantitative Analysis and Performance Study for Similarity-Search Methods in High-Dimensional Spaces. In: Proc. 24th Int. Conf. Very Large Data Bases, VLDB. (1998) 194-205
    • (1998) Proc. 24th Int. Conf. Very Large Data Bases, VLDB , pp. 194-205
    • Weber, R.1    Schek, H.J.2    Blott, S.3
  • 17
    • 0035020719 scopus 로고    scopus 로고
    • Distinctiveness-sensitive nearest neighbor search for efficient similarity retrieval of multimedia information
    • Washington, DC, USA, IEEE Computer Society
    • Katayama, N., Satoh, S.: Distinctiveness-Sensitive Nearest Neighbor Search for Efficient Similarity Retrieval of Multimedia Information. In: Proceedings of the 17th International Conference on Data Engineering, Washington, DC, USA, IEEE Computer Society (2001) 493-502
    • (2001) Proceedings of the 17th International Conference on Data Engineering , pp. 493-502
    • Katayama, N.1    Satoh, S.2


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