Share Email Print
cover

Proceedings Paper

Novel scheme for fast and efficent video sequence matching using compact signatures
Author(s): Milind Ramesh Naphade; Minerva M. Yeung; Boon-Lock Yeo
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Efficient ways to manage digital video data have assumed enormous importance lately. An integral aspect is the ability to browse, index nd search huge volumes of video data automatically and efficiently. This paper presents a novel scheme for matching video sequences base on low-level features. The scheme supports fast and efficient matching and can search 450,000 frames of video data within 72 seconds on a 400 MHz. Pentium II, for a 50 frame query. Video sequences are processed in the compressed domain to extract the histograms of the images in the DCT sequence is implemented for matching video clips. The binds of the histograms of successive for comparison. This leads to efficient storage and transmission. The histogram representation can be compacted to 4.26 real numbers per frame, while achieving high matching accuracy. Multiple temporal resolution sampling of the videos to be matched is also supported and any key-frame-based matching scheme thus becomes a particular implementation of this scheme.

Paper Details

Date Published: 23 December 1999
PDF: 9 pages
Proc. SPIE 3972, Storage and Retrieval for Media Databases 2000, (23 December 1999); doi: 10.1117/12.373590
Show Author Affiliations
Milind Ramesh Naphade, Univ. of Illinois/Urbana-Champaign (United States)
Minerva M. Yeung, Intel Corp. (United States)
Boon-Lock Yeo, Intel Corp. (United States)


Published in SPIE Proceedings Vol. 3972:
Storage and Retrieval for Media Databases 2000
Minerva M. Yeung; Boon-Lock Yeo; Charles A. Bouman, Editor(s)

© SPIE. Terms of Use
Back to Top