Learning intrinsic video content using levenshtein distance in graph partitioning

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

Volumn 2353, Issue , 2002, Pages 670-684

  Ng, Jeffrey ^a   Gong, Shaogang ^a  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

Author keywords

Automatic model order selection; Dynamic time warping; Graph partitioning; Leven shtein distance; Modelling video content; Normalised cut; Trajectory modelling; Unsupervised clustering

Indexed keywords

GRAPH THEORY; IMAGE SEGMENTATION; TRAJECTORIES; VIDEO RECORDING;

AUTOMATIC MODELING; DYNAMIC TIME WARPING; GRAPH PARTITIONING; LEVEN-SHTEIN DISTANCE; NORMALISED CUTS; TRAJECTORY MODELLING; UNSUPERVISED CLUSTERING; VIDEO CONTENTS;

COMPUTER VISION;

EID: 23044533433     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47979-1_45     Document Type: Conference Paper

References (17)

1. M.J. Black and A.D. Jepson. A probabilistic framework for matching temporal trajectories: Condensation-based recognition of gestures and expressions. In ECCV, pages 909–924, Freiburg, 1998.
2. M. Brand and V. Kettnaker. Discovery and segmentation of activities in video. IEEE PAMI, 22(8):844–851, August 2000.
3. R.A. Fisher. The statistical utilization of multiple measurements. Annals of Eugenics, 8:376–386, 1938.
4. S. Furui. Vector-quantization-based speechrecognition and speaker recognition techniques. In Asilomar Conference on Signals, Systems and Computers, volume 2, pages 954–958, Los Alamitos, USA, 1991.
5. T. Jebara and A. Pentland. Automatic visual analysis and synthesis of interactive behaviour. In International Conference on Vision Systems, pages 273–292, Berlin, Germany, 1999.
6. N. Johnson and D.C. Hogg. Learning the distribution of object trajectories for event recognition. IVC, 14(8):609–615, 1996.
7. J.B. Kruskal and M. Liberman. The symmetric time-warping problem: From continuous to discrete. In Time Warps, String Edits, And Macromolecules: The Theory and Practice of Sequence Comparison, pages 125–161. CSLI Publications, 1999.
8. V.I. Levenshtein. Binary codes capable of correcting spurious insertions and deletions of ones. Cybernetics and Control Theory, 10(8):707–710, 1965.
9. S.Y. Lee M.K. Shan. Content-based video retrieval via motion trajectories. SPIE, 3562:52–61, 1998.
10. A. Robles-Kelly and E.R. Hancock. An em-like algorithm for motion segmentation via eigendecomposition. In BMVC, pages 123–132, Manchester, U.K., 2001.
11. S. Sarkar and K.L. Boyer. Quantitative measures of change based on feature organisation: Eigenvalues and eigenvectors. CVIU, 71(1):110–136, July 1998.
12. G.L. Scott and H.C. Longuet-Higgins. Feature grouping by relocalisation of eigenvectors of the proximity matrix. In BMVC, pages 103–108, 1990.
13. J. Sherrah and S. Gong. Resolving visual uncertainty and occlusion through probabilistic reasoning. In BMVC, pages 252–261, Bristol, UK, 2000.
14. J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE PAMI, 22(8):888–905, August 2000.
15. T. Wada and T. Matsuyama. Multiobject behavior recognition by event driven selective attention method. IEEE PAMI, 22(8):873–887, 2000.
16. M. Walter, A. Psarrou, and S. Gong. Data driven gesture model acquisition using minimum description length. In BMVC, pages 673–683, Manchester, UK, 2001.
17. Y. Weiss. Segmentation using eigenvectors: A unifying view. In ICCV, pages 975–982, Los Alamitos, USA, 1999.