loading...
Clustering of Video Objects by Graph Matching
Amsterdam, Netherlands July 06-July 06
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ICME.2005.15214432005 IEEE International Conference on ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
null JeongKyu Lee, Department of Computer Science and Engineering University of Texas at Arlington, Arlington, TX 76019-0015 U. S. A. e-mail: jelee@cse.uta.edu
We propose a new graph-based data structure, called Spatio Temporal Region Graph (STRG) which can represent the content of video sequence. Unlike existing ones which consider mainly spatial information in the frame level of video, the proposed STRG is able to formulate its temporal information in the video level additionally. After an STRG is constructed from a given video sequence, it is decomposed into its subgraphs called Object Graphs (OGs), which represent the temporal characteristics of video objects. For unsupervised learning, we cluster similar OGs into a group, in which we need to match two OGs. For this graph matching, we introduce a new distance measure, called Extended Graph Edit Distance (EGED), which can handle the temporal characteristics of OGs. For actual clustering, we exploit Expectation Maximization (EM) with EGED. The experiments have been conducted on real video streams, and their results show the effectiveness and robustness of the proposed schemes.
Citation:
null JeongKyu Lee, null JungHwan Oh, null Sae Hwang, "Clustering of Video Objects by Graph Matching," icme, pp.394-397, 2005 IEEE International Conference on Multimedia and Expo, 2005
Usage of this product signifies your acceptance of the Terms of Use.