Interesting faces: A graph-based approach for finding people in news

作者:

Highlights:

摘要

In this study, we propose a method for finding people in large news photograph and video collections. Our method exploits the multi-modal nature of these data sets to recognize people and does not require any supervisory input. It first uses the name of the person to populate an initial set of candidate faces. From this set, which is likely to include the faces of other people, it selects the group of most similar faces corresponding to the queried person in a variety of conditions. Our main contribution is to transform the problem of recognizing the faces of the queried person in a set of candidate faces to the problem of finding the highly connected sub-graph (the densest component) in a graph representing the similarities of faces. We also propose a novel technique for finding the similarities of faces by matching interest points extracted from the faces. The proposed method further allows the classification of new faces without needing to re-build the graph. The experiments are performed on two data sets: thousands of news photographs from Yahoo! news and over 200 news videos from TRECVid2004. The results show that the proposed method provides significant improvements over text-based methods.

论文关键词:Face finding,Graph representation,Densest component,Interest points,News photos and videos

论文评审过程:Received 10 September 2008, Revised 23 September 2009, Accepted 22 October 2009, Available online 24 November 2009.

论文官网地址:https://doi.org/10.1016/j.patcog.2009.10.015