Graph partition model for robust temporal data segmentation

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3518 LNAI, Issue , 2005, Pages 758-763

  Yuan, Jinhui ^a   Zhang, Bo ^a   Lin, Fuzong ^a  

^a TSINGHUA UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BENCHMARKING; CONSTRAINT THEORY; DATABASE SYSTEMS; IMAGE SEGMENTATION; OPTIMIZATION; ROBUSTNESS (CONTROL SYSTEMS);

COMPARISON STRATEGY; DATA SEGMENTATION; GRAPH PARTITION MODEL; TIME ALGORITHM;

GRAPH THEORY;

EID: 26944491820     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11430919_88     Document Type: Conference Paper

References (7)

1. E. Keogh, et al, Segmenting time series: a survey and novel approach, Data Mining in Time Series Databases, World Scientific Publishing Company, 2003
2. C. Ding, et al, A min-max cut algorithm for graph partitioning and data clustering. Proc. IEEE Int'l Conf. Data Mining, pp.107-114, 2001
3. A. F. Smeaton, et al, TRECVID: Evaluating the effectiveness of information retrieval tasks on digital video. In Proceedings of the ACM MM'04,pp. 652-655,2004
4. M.R. Naphade,et al, A high-performance shot boundary detection algorithm using multiple cues, International Conference on Image Processing, vol.3, 1998
5. Boon-Lock Yeo and Bede Liu, Rapid scene analysis on compressed video, IEEE Transactions on Circuits and Systems for Video Technology, vol.5, pp.533-544, 1995
6. C. J. van Rijsbergen. Information Retireval. Butter-worths, London, 1979
7. Jinhui Yuan, et al, A robust temporal data segmentation method base on graph partition model, Technical Report, Department of Computer Science and Technology, Tsinghua University, 2004