ACM Home Page
Please provide us with feedback. Feedback
Cast indexing for videos by NCuts and page ranking
Full text PdfPdf (954 KB)
Source Conference On Image And Video Retrieval archive
Proceedings of the 6th ACM international conference on Image and video retrieval table of contents
Amsterdam, The Netherlands
Pages: 441 - 447  
Year of Publication: 2007
ISBN:978-1-59593-733-9
Authors
Yong Gao  Intel China Research Center, Beijing, P. R. China
Tao Wang  Intel China Research Center, Beijing, P. R. China
Jianguo Li  Intel China Research Center, Beijing, P. R. China
YangZhou Du  Intel China Research Center, Beijing, P. R. China
Wei Hu  Intel China Research Center, Beijing, P. R. China
Yimin Zhang  Intel China Research Center, Beijing, P. R. China
HaiZhou Ai  Tech. of Tsinghua University, Beijing, P. R. China
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 54,   Citation Count: 3
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1282280.1282345
What is a DOI?

ABSTRACT

Cast indexing is an important video mining technique which provides audience the capability to efficiently retrieve interested scenes, events, and stories from a long video. This paper proposes a novel cast indexing approach based on Normalized Graph Cuts (NCuts) and Page Ranking. The system first adopts face tracker to group face images in each shot into face sets, and then extract local SIFT feature as the feature representation. There are two key problems for cast indexing. One is to find an optimal partition to cluster face sets into main cast. The other is how to exploit the latent relationships among characters to provide a more accurate cast ranking. For the first problem, we model each face set as a graph node, and adopt Normalized Graph Cuts (NCuts) to realize an optimal graph partition. A novel local neighborhood distance is proposed to measure the distance between face sets for NCuts, which is robust to outliers. For the second problem, we build a relation graph for characters by their co-occurrence information, and then adopt the PageRank algorithm to estimate the Important Factor (IF) of each character. The PageRank IF is fused with the content based retrieval score for final ranking. Extensive experiments are carried out on movies, TV series and home videos. Promising results demonstrate the effectiveness of proposed methods.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
 
2
 
3
 
4
Yuan J. H., Zheng W. J., Chen L., et. al. Tsinghua University a TRECVID 2004: shot boundary detection and high-level feature extraction, In NIST workshop of TRECVID 2004.
 
5
 
6
Lawrence, P. and Sergey, B. The PageRank Citation Ranking: Bringing Order to the Web. Stanford Digital Library Technologies Project, 1998
 
7
 
8
Zhang L., Ai HZ, Lao SH, Robust Face Alignment Based On Hierarchical Classifier Network, T. S. Huang et al. (Eds.): HCI/ECCV 2006, LNCS 3979, pp.1--11, 2006. Springer-Verlag Berlin Heidelberg 2006.
 
9
 
10
Rasheed, Z., Shah, M., Detection and representation of scenes in videos. IEEE Transactions on Multimedia, Volume 7, Issue 6, Dec. 2005, 1097--1105.
 
11
 
12
Studholme, C., Hill, D. and Hawkes, D. An overlap invariant entropy measure of 3D medical image alignment. Pattern recognition. 1999, 712--721.
 
13
Fan W., Wang T., Bouguet, J. Y., Hu W., et. al. Semi-supervised Cast Indexing for Feature-Length Films. In Proeedings of the 13th International MultiMedia Modelling Conference (MMM 2007).
 
14
Li Y., Ai HZ, Huang C., Lao SH, Robust Head Tracking with Particles Based on Multiple Cues Fusion, T. S. Huang et al. (Eds.): HCI/ECCV 2006, LNCS 3979, pp.29--39, 2006. Springer-Verlag Berlin Heidelberg 2006.


Collaborative Colleagues:
Yong Gao: colleagues
Tao Wang: colleagues
Jianguo Li: colleagues
YangZhou Du: colleagues
Wei Hu: colleagues
Yimin Zhang: colleagues
HaiZhou Ai: colleagues