Share Email Print
cover

Proceedings Paper

Algorithm for efficient segmentation and selection of representative frames in video sequences
Author(s): Konstantin Y. Kupeev; Zohar Sivan
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

We study the problem of temporal partitioning a video sequence by blobs - the segments consisting of similar frames, and the choice of frames within the blobs well representing their content. In general, blobs give a finer subdivision of video then the shots. This problem is relevant for various applications, e.g., indexing and retrieval in video databases, or compression of video at very low bitrates. We present an efficient algorithm for the considered problem based on the use of a suitable frame distance measure reflecting similarity among the frames. Experimental results are presented.

Paper Details

Date Published: 1 January 2001
PDF: 9 pages
Proc. SPIE 4315, Storage and Retrieval for Media Databases 2001, (1 January 2001); doi: 10.1117/12.410934
Show Author Affiliations
Konstantin Y. Kupeev, IBM Corp. (Israel)
Zohar Sivan, IBM Corp. (Israel)


Published in SPIE Proceedings Vol. 4315:
Storage and Retrieval for Media Databases 2001
Minerva M. Yeung; Chung-Sheng Li; Rainer W. Lienhart, Editor(s)

© SPIE. Terms of Use
Back to Top