Extraction and Analysis of Story Unit Based on Clustering of Hyper-Graph
Affiliation:

  • Article
  • | |
  • Metrics
  • |
  • Reference [9]
  • |
  • Related [20]
  • |
  • Cited by [6]
  • | |
  • Comments
    Abstract:

    It is the important precondition for browsing, retrieval and indexing videos that effectively and rationally organizing the video structure. In this paper, for hierarchically organizing the video structure, a method for extracting story units is proposed. k-nearest neighbor hyper-graph is used to represent the content relations among shots, and shots are clustered based on hyper-graph model. By analyzing time projection relations among shot clusters, story units are extracted, and represented by the 1D strings. A frame using specific domain knowledge for identifying the type of story unit is also proposed, and is applied to identify the dialogs in the videos. The new algorithm is applied to multiple test videos, and the experiments results are satisfying.

    Reference
    [1]Bach J, Fuller C, Gupta A, Hampapur A, Horowitz B, Humphrey R, Jain R. The virage image search engine: an open framework for image management. In: Proceedings of the SPIE, Storage and Retrieval for Image and Video Databases IV. San Jose: SPIE Press, 1996. 76~87. http://citeseer.nj.nec.com/context/565/0.
    [2]Gudivada VN, Raghavan VV. Content based image retrieval systems. IEEE Computer, 1995,28(9):18~22.
    [3]Wactlar H, Kanade T, Smith MA, Stevens SM. Intelligent access to digital video: informedia project. IEEE Computer, 1996,29(3): 46~52.
    [4]Ge D. Introduction to the Camera Work of Cinematics. Beijing: China Film Press, 1995 (in Chinese).
    [5]Yeung M, Yeo BL, Liu B. Time constraint clustering for segmentation of video into story units. In: Proceedings of the International Conference on Pattern Recognition. 1996. 375~380. http://citeseer.nj.nec.com.
    [6]Hanjalic A, Lagendijk RL, Biemond J. Automatically segmenting movies into logical story units. In: Proceedings of the 3rd International Conference on Visual Information Systems. Amsterdam, 1999. 229~236. http://citeseer.nj.nec.com/context/1074914/ 179834.
    [7]Karypis G, Han EH, Kumar V. Chameleon: Hierarchical clustering using dynamic modeling. IEEE Computer, 1999,32(8):68~75.
    [8]Zhang HJ, Kankanhalli A. Automatic partitioning of full-motion video. ACM Multimedia Systems, 1993,1(1):10~28.
    [9]葛德.电影摄影艺术概论.北京:中国电影出版社,1995.
    Comments
    Comments
    分享到微博
    Submit
Get Citation

樊昀,王润生.基于超图聚类的故事单元的抽取与分析.软件学报,2003,14(4):857-863

Copy
Share
Article Metrics
  • Abstract:4156
  • PDF: 5443
  • HTML: 0
  • Cited by: 0
History
  • Received:September 10,2001
  • Revised:October 18,2001
You are the first2038773Visitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-4
Address:4# South Fourth Street, Zhong Guan Cun, Beijing 100190,Postal Code:100190
Phone:010-62562563 Fax:010-62562533 Email:jos@iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063