Fast Scene Change Detection Algorithm in MPEG Compressed Video by Minimal Decoding


The KIPS Transactions:PartB , Vol. 9, No. 3, pp. 343-350, Jun. 2002
10.3745/KIPSTB.2002.9.3.343,   PDF Download:

Abstract

A scene change detection which involves finding a cut between two consecutive shots is an important step for video indexing and retrieval. This paper proposes an algorithm for fast and accurate detection of abrupt scene changes in an MPEG compressed domain with minimal decoding requirements and computational effort. The proposed method compares two successive DC images of I-frames for finding the GOP (group of picture) which contain a scene change and uses macroblock-coded type information contained in B-frames to detect the exact frame where the scene change occurred. The experiment results demonstrate that the proposed algorithm has better detection performance, such as precision and recall rate, than the existing method using all DC images. The algorithm has the advantage of speed, simplicity and accuracy. In addition, it requires less amount of storage.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
C. S. Hwang, K. W. Kim, J. S. Lee, J. H. Kim, "Fast Scene Change Detection Algorithm in MPEG Compressed Video by Minimal Decoding," The KIPS Transactions:PartB , vol. 9, no. 3, pp. 343-350, 2002. DOI: 10.3745/KIPSTB.2002.9.3.343.

[ACM Style]
Chan Sik Hwang, Kang Wook Kim, Jae Seung Lee, and Jong Hoon Kim. 2002. Fast Scene Change Detection Algorithm in MPEG Compressed Video by Minimal Decoding. The KIPS Transactions:PartB , 9, 3, (2002), 343-350. DOI: 10.3745/KIPSTB.2002.9.3.343.