Paper Info
Title
Fast Video Segmentation Using Encoding Cost Data
Abstract
This paper presents a simple and effective pre-processing method developed for the segmentation of MPEG compressed video sequences. The proposed method for scene-cut detection only involves computing the number of bits spent for each frame (encoding cost data), thus avoiding decoding the bitstream. The information is separated into I-, P-, B-frames, thus forming 3 vectors which are independently processed by a new peak detection algorithm based on overcomplete filter banks and on joint thresholding using a confidence number. Each processed vector yields a set of candidate frame numbers, i.e. "hints" of positions where scene-cuts may have occurred. The "hints" for all frame types are recombined into one frame sequence and clustered into scene cuts. The algorithm was not designed to distintuish among types of cuts but rather to indicate its position and duration. Experimental results show that the proposed algorithm is effective in detecting abrupt scene changes as well as gradual transitions. For precision demanding applications, the algorithm can be used with a low confidence factor just to select the frames that are worth being investigated by a more complex algorithm. The algorithm is not particularly tailored to MPEG and can be applied to most video compression techniques.
Year
DOI
Venue
1999
10.1117/12.333890
STORAGE AND RETRIEVAL FOR IMAGE AND VIDEO DATABASES VII
Keywords
Field
DocType
MPEG, video segmentation, encoding cost data, cut detection
Reference frame,Computer vision,Block-matching algorithm,Computer science,Image processing,Image segmentation,Artificial intelligence,Thresholding,Data compression,Bitstream,Signal compression
Conference
Volume
ISSN
Citations 
3656
0277-786X
2
PageRank 
References 
Authors
0.67
2
3
Name
Order
Citations
PageRank
Ricardo L. de Queiroz131541.35
Gozde Bozdagi2254.10
taha h sencar320.67