A graph based approach for naming faces in news photos

Simple item page
dc.citation.epage1482en_US
dc.citation.spage1477en_US
dc.citation.volumeNumber2en_US
dc.contributor.authorOzkan, D.en_US
dc.contributor.authorDuygulu, P.en_US
dc.date.accessioned2016-02-08T11:45:33Z
dc.date.available2016-02-08T11:45:33Z
dc.date.issued2006en_US
dc.departmentDepartment of Computer Engineeringen_US
dc.description.abstractWe propose a method to associate names and faces for querying people in large news photo collections. On the assumption that a person's face is likely to appear when his/her name is mentioned in the caption, first all the faces associated with the query name are selected. Among these faces, there could be many faces corresponding to the queried person in different conditions, poses and times, but there could also be other faces corresponding to other people in the caption or some non-face images due to the errors in the face detection method used. However, in most cases, the number of corresponding faces of the queried person will be large, and these faces will be more similar to each other than to others. In this study, we propose a graph based method to find the most similar subset among the set of possible faces associated with the query name, where the most similar subset is likely to correspond to the faces of the queried person. When the similarity of faces are represented in a graph structure, the set of most similar faces will be the densest component in the graph. We represent the similarity of faces using SIFT descriptors. The matching interest points on two faces are decided after the application of two constraints, namely the geometrical constraint and the unique match constraint. The average distance of the matching points are used to construct the similarity graph. The most similar set of faces is then found based on a greedy densest component algorithm. The experiments are performed on thousands of news photographs taken in real life conditions and, therefore, having a large variety of poses, illuminations and expressions. © 2006 IEEE.en_US
dc.identifier.doi10.1109/CVPR.2006.29en_US
dc.identifier.issn1063-6919
dc.identifier.urihttp://hdl.handle.net/11693/27134
dc.language.isoEnglishen_US
dc.publisherI E E E Computer Societyen_US
dc.relation.isversionofhttp://dx.doi.org/10.1109/CVPR.2006.29en_US
dc.source.titleIEEE Conference on Computer Vision and Pattern Recognition. Proceedingsen_US
dc.subjectFace detection methoden_US
dc.subjectGraph structureen_US
dc.subjectNews photo collectionsen_US
dc.subjectQueried personen_US
dc.subjectAlgorithmsen_US
dc.subjectConstraint theoryen_US
dc.subjectFace recognitionen_US
dc.subjectGeometryen_US
dc.subjectImage processingen_US
dc.subjectQuery languagesen_US
dc.subjectGraph theoryen_US
dc.titleA graph based approach for naming faces in news photosen_US
dc.typeArticleen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
A graph based approach for naming faces in news photos.pdf
Size:
598.12 KB
Format:
Adobe Portable Document Format
Description:
Full Printable Version
Download
Collections
Department of Computer Engineering