메뉴 건너뛰기




Volumn , Issue , 2005, Pages 730-741

Towards effective indexing for very large video sequence database

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; CONFORMAL MAPPING; DATABASE SYSTEMS; INFORMATION RETRIEVAL; INFORMATION RETRIEVAL SYSTEMS; MATHEMATICAL TRANSFORMATIONS; VECTORS;

EID: 29844453532     PISSN: 07308078     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1066157.1066240     Document Type: Conference Paper
Times cited : (116)

References (15)
  • 1
    • 29844444939 scopus 로고    scopus 로고
    • http://www.virtualdub.org/.
  • 2
    • 0032094513 scopus 로고    scopus 로고
    • The pyramid-technique: Towards breaking the curse of dimensionality
    • S. Berchtold, C. Böhm, and H.-P. Kriegel. The pyramid-technique: Towards breaking the curse of dimensionality. In SIGMOD, pages 142-153, 1998.
    • (1998) SIGMOD , pp. 142-153
    • Berchtold, S.1    Böhm, C.2    Kriegel, H.-P.3
  • 3
    • 0038670812 scopus 로고    scopus 로고
    • Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases
    • C. Böhm, S. Berchtold, and D. Keim. Searching in high-dimensional spaces: Index structures for improving the performance of multimedia databases. ACM Computing Surveys, pages 33(3):322-373, 2001.
    • (2001) ACM Computing Surveys , vol.33 , Issue.3 , pp. 322-373
    • Böhm, C.1    Berchtold, S.2    Keim, D.3
  • 4
    • 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. In VLDB, pages 89-100, 2000.
    • (2000) VLDB , pp. 89-100
    • Chakrabarti, K.1    Mehrotra, S.2
  • 8
    • 0034444417 scopus 로고    scopus 로고
    • Distributional clustering for efficient content-based retrieval of images and video
    • G. Iyengar and A. Lippman. Distributional clustering for efficient content-based retrieval of images and video. In ICIP, pages 81-84, 2000.
    • (2000) ICIP , pp. 81-84
    • Iyengar, G.1    Lippman, A.2
  • 9
    • 29844448208 scopus 로고    scopus 로고
    • J. Jacquelin. Problem of hyperspace. In http://maths-express.ifrance.com/ maths-express/articles/voir/hyperchevre.htm, 2004.
    • (2004) Problem of Hyperspace
    • Jacquelin, J.1
  • 10
    • 84983469675 scopus 로고    scopus 로고
    • Query and update efficient b+-tree based indexing of moving objects
    • C. Jensen, D. Lin, and B.C.Ooi. Query and update efficient b+-tree based indexing of moving objects. In VLDB, 2004.
    • (2004) VLDB
    • Jensen, C.1    Lin, D.2    Ooi, B.C.3
  • 11
    • 0345359234 scopus 로고    scopus 로고
    • An adaptive and efficient dimensionality reduction algorithm for high-dimensional indexing
    • H. Jin, B. Ooi, H. Shen, C. Yu, and A. Zhou. An Adaptive and Efficient Dimensionality Reduction Algorithm for High-Dimensional Indexing. In ICDE, pages 87-98, 2003.
    • (2003) ICDE , pp. 87-98
    • Jin, H.1    Ooi, B.2    Shen, H.3    Yu, C.4    Zhou, A.5
  • 12
    • 0035747552 scopus 로고    scopus 로고
    • Effective nearest neighbor indexing with the euclidean metric
    • S.-W. Kim, C. C. Aggarwal, and P. S. Y. i. Effective nearest neighbor indexing with the euclidean metric. In CIKM, pages 9-16, 2001.
    • (2001) CIKM , pp. 9-16
    • Kim, S.-W.1    Aggarwal, C.C.2    I., P.S.Y.3
  • 13
    • 0035055957 scopus 로고    scopus 로고
    • Multimodal pattern matching for audiovisual query and retrieval
    • M. R. Naphade, R. Wang, and T. S. Huang. Multimodal pattern matching for audiovisual query and retrieval. In SPIE, pages 188-195, 2001.
    • (2001) SPIE , pp. 188-195
    • Naphade, M.R.1    Wang, R.2    Huang, T.S.3
  • 14
    • 0034850734 scopus 로고    scopus 로고
    • On the complexity of probabilistic image retrieval
    • N. Vasconcelos. On the complexity of probabilistic image retrieval. In ICCV, 2001.
    • (2001) ICCV
    • Vasconcelos, N.1
  • 15
    • 84944319598 scopus 로고    scopus 로고
    • Indexing the distance: An efficient method to KNN processing
    • C. Yu, B. Ooi, K. Tan, and H. V. Jagadish. Indexing the distance: An efficient method to KNN processing. In VLDB, pages 166-174, 2001.
    • (2001) VLDB , pp. 166-174
    • Yu, C.1    Ooi, B.2    Tan, K.3    Jagadish, H.V.4


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