Share Email Print
cover

Proceedings Paper

Structuring continuous video recordings of everyday life using time-constrained clustering
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

As personal wearable devices become more powerful and ubiquitous, soon everyone will be capable to continuously record video of everyday life. The archive of continuous recordings need to be segmented into manageable units so that they can be efficiently browsed and indexed by any video retrieval systems. Many researchers approach the problem in two-pass methods: segmenting the continuous recordings into chunks, followed by clustering chunks. In this paper we propose a novel one-pass algorithm to accomplish both tasks at the same time by imposing time constraints on the K-Means clustering algorithm. We evaluate the proposed algorithm on 62.5 hours of continuous recordings, and the experiment results show that time-constrained clustering algorithm substantially outperforms the unconstrained version.

Paper Details

Date Published: 16 January 2006
PDF: 9 pages
Proc. SPIE 6073, Multimedia Content Analysis, Management, and Retrieval 2006, 60730D (16 January 2006); doi: 10.1117/12.642009
Show Author Affiliations
Wei-Hao Lin, Carnegie Mellon Univ. (United States)
Alexander Hauptmann, Carnegie Mellon Univ. (United States)


Published in SPIE Proceedings Vol. 6073:
Multimedia Content Analysis, Management, and Retrieval 2006
Edward Y. Chang; Alan Hanjalic; Nicu Sebe, Editor(s)

© SPIE. Terms of Use
Back to Top