By Topic

Fast face clustering using similar shots for face navigation of TV programs

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Yamamoto, K. ; Corp. R&D Center, Toshiba Corp., Kawasaki, Japan ; Yamaguchi, O. ; Aoki, H.

In this paper, we propose a new approach for clustering faces of characters in a recorded television title. The clustering results are used to catalog video clips based on subjects' faces for quick scene access. The main goal is to obtain a reasonable result for cataloging in a short time as soon as the recording phase is over. To enable high-speed processing, similarities of shots where the characters appear are used to estimate corresponding faces instead of calculating distance between each face feature. Two kinds of experiments are conducted to evaluate the method. With the fastest method, processing time is less than 1 second per hour of video clips, which is 1000 times faster than in the case of using rigorous face verification with facial feature extraction. The difference between these methods when used to catalog video clips was within allowable error.

Published in:

Consumer Electronics, 2009. ISCE '09. IEEE 13th International Symposium on

Date of Conference:

25-28 May 2009