메뉴 건너뛰기




Volumn 2, Issue , 2003, Pages II389-II392

Dynamic-segmentation-based feature dimension reduction for quick audio/video searching

Author keywords

[No Author keywords available]

Indexed keywords

DYNAMIC SEGMENTATION; FEATURE DIMENSIONS; MULTIMEDIA SEARCH; SEGMENT LENGTHS;

EID: 64849090286     PISSN: 19457871     EISSN: 1945788X     Source Type: Conference Proceeding    
DOI: 10.1109/ICME.2003.1221635     Document Type: Conference Paper
Times cited : (2)

References (8)
  • 1
    • 0001802606 scopus 로고    scopus 로고
    • The X-tree : An index structurefor high-dimensional data
    • S. Berchtold et al.: 'The X-tree : An Index Structurefor High-Dimensional Data", Pmc. of VLDB96, pp,28-39, 1996.
    • (1996) Proc. of VLDB96 , pp. 28-39
    • Berchtold, S.1
  • 2
    • 0031162081 scopus 로고    scopus 로고
    • The SR-tree : An index structure for high-dimensional nearest neighbor queries
    • N. Katayama et al.: "The SR-tree : An IndexStructure for High-Dimensional Nearest NeighborQueries", Proc. ofACM SIGMOD Conference 97, pp.369-380, 1997.
    • (1997) Proc. OfACM SIGMOD Conference , vol.97 , pp. 369-380
    • Katayama, N.1
  • 3
    • 0036293822 scopus 로고    scopus 로고
    • A quick search method for multimediasignals using feature compression based on piecewise linear maps
    • A. Kimura et al.: "A Quick Search Method for MultimediaSignals Using Feature Compression Based onPiecewise Linear Maps", Pruc. of ICASSP2002, Vol.4, pp. 3656-3659.2002.
    • (2002) Pruc. of ICASSP2002 , vol.4 , pp. 3656-3659
    • Kimura, A.1
  • 4
    • 0015641966 scopus 로고
    • Waveform segmentation through functional approximation
    • T. Pavlidis: "Waveform segmentation through functionalapproximation", IEEE Trans. on Computers,Vol. C-22. No. 7, pp. 689-697. 1973.
    • (1973) IEEE Trans. on Computers , Issue.7 C-22 , pp. 689-697
    • Pavlidis, T.1
  • 5
    • 84983224534 scopus 로고    scopus 로고
    • A probabilistic approach for fastpattern matching in time-series databases
    • E. Keogh et al.: "A Probabilistic Approach for FastPattern Matching in Time-series Databases", Pmc. ofKDD97, pp. 24-30, 1997.
    • (1997) Proc. of KDD , vol.97 , pp. 24-30
    • Keogh, E.1
  • 6
    • 53949085995 scopus 로고    scopus 로고
    • Supparting content-based searcheson time series via approximation
    • C. Wang et al.: "Supparting Content-based Searcheson Time Series via Approximation", Pmc. of SSDBMZOOO,pp. 69-81,2000.
    • (2000) Proc. of SSDBMZOOO , pp. 69-81
    • Wang, C.1
  • 7
    • 0034832364 scopus 로고    scopus 로고
    • Locally adaptive dimensionality reduction for indexing large time series databases
    • E. Koegh et al : "Locally Adaptive DimensionalityReduction for Indexing Large Time SeriesDatabases", Proc. of ACM SIGMOD Conference2001,pp. 151-162,2001.
    • (2001) Proc. of ACM SIGMOD Conference 2001 , pp. 151-162
    • Koegh, E.1
  • 8
    • 0032675799 scopus 로고    scopus 로고
    • Time-series active search forquick retrieval of audio and video
    • K. Kashino et al.: "Time-Series Active Search forQuick Retrieval of Audio and Video", Pmc. ofICASSP99, Vol. 6, pp. 2993-2996, 1999.
    • (1999) Pmc ofICASSP99 , vol.6 , pp. 2993-2996
    • Kashino, K.1


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