메뉴 건너뛰기




Volumn , Issue , 2004, Pages 222-226

An extendible semantic-based content representation method for distributed image databases

Author keywords

[No Author keywords available]

Indexed keywords

AUTOMATED SYSTEM; DISTRIBUTED IMAGE DATABASES; INDEXING MODELS; SUMMARY-SCHEMAS MODEL (SSM);

EID: 20844439573     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (6)

References (10)
  • 1
    • 0031331669 scopus 로고    scopus 로고
    • Managing multimedia information in database systems
    • W. I. Grosky. Managing multimedia information in database systems. Communications of the ACM, 1997, 40 (12): 73-80.
    • (1997) Communications of the ACM , vol.40 , Issue.12 , pp. 73-80
    • Grosky, W.I.1
  • 3
    • 0021644214 scopus 로고
    • The Quadtree and related hierarchical data structures
    • H. Samet. The Quadtree and related hierarchical data structures. ACM computing surveys, 1984, 16(2): 187-260.
    • (1984) ACM Computing Surveys , vol.16 , Issue.2 , pp. 187-260
    • Samet, H.1
  • 4
    • 0034215869 scopus 로고    scopus 로고
    • Dynamic VP-tree indexing for n-nearest neighbor search given pair-wise distances
    • A. W. Fu, P. M. Chan, Y. Cheung, and Y. S. Moon. Dynamic VP-tree indexing for n-nearest neighbor search given pair-wise distances. VLDB Journal, 2000, 9(2): 154-173.
    • (2000) VLDB Journal , vol.9 , Issue.2 , pp. 154-173
    • Fu, A.W.1    Chan, P.M.2    Cheung, Y.3    Moon, Y.S.4
  • 6
    • 0025447750 scopus 로고
    • The R*-tree: An efficient and robust access method for points and rectangles
    • N. Beckmann, H. Kriegel, R. Schneider, and B. Seeger. The R*-tree: An Efficient and Robust Access Method for Points and Rectangles, Conference on Management of data, 1990, 19(2): 322-331.
    • (1990) Conference on Management of Data , vol.19 , Issue.2 , pp. 322-331
    • Beckmann, N.1    Kriegel, H.2    Schneider, R.3    Seeger, B.4
  • 7
    • 0031162081 scopus 로고    scopus 로고
    • The SR-tree: An index structure for high-dimensional nearest neighbor queries
    • N. Katayama, S. Satoh. The SR-tree: An Index Structure for High-dimensional Nearest Neighbor Queries, conference on Management of data, 1997, 26(2): 369-380.
    • (1997) Conference on Management of Data , vol.26 , Issue.2 , pp. 369-380
    • Katayama, N.1    Satoh, S.2
  • 8
    • 0026837501 scopus 로고
    • A taxonomy and current issues in multidatabase systems
    • M. W. Bright, A. R. Hurson, and S. Pakzad. A Taxonomy and Current Issues in Multidatabase Systems. IEEE Computer, 1992, 25(3): 50-60.
    • (1992) IEEE Computer , vol.25 , Issue.3 , pp. 50-60
    • Bright, M.W.1    Hurson, A.R.2    Pakzad, S.3
  • 9
    • 2342451199 scopus 로고    scopus 로고
    • Multimedia content processing through cross-modal association
    • Dongge Li, Nevenka Dimitrova, Mingkun Li, Ishwar K. Sethi. Multimedia content processing through cross-modal association. ACM Conference on Multimedia, 2003: 604-611.
    • (2003) ACM Conference on Multimedia , pp. 604-611
    • Li, D.1    Dimitrova, N.2    Li, M.3    Sethi, I.K.4
  • 10
    • 0033886791 scopus 로고    scopus 로고
    • Binary partition tree as an efficient representation for image processing, segmentation, and information retrieval
    • Philippe Salembier and Luis Garrido. Binary partition tree as an efficient representation for image processing, segmentation, and information retrieval. IEEE Transaction on Image Processing, 2000, 9(4): 561-576.
    • (2000) IEEE Transaction on Image Processing , vol.9 , Issue.4 , pp. 561-576
    • Salembier, P.1    Garrido, L.2


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