Özkan, DeryaDuygulu, Pınar2016-02-082016-02-082006http://hdl.handle.net/11693/27192Date of Conference: 17-19 April 2006We 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. When the similarities of faces are represented in a graph structure, the set of most similar faces will be the densest component in the graph. 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. © 2006 IEEE.TurkishDensest componentsGraph-based methodPhoto collectionsErrorsGraph theoryGraphic methodsQuery languagesSet theoryFace recognitionConference Paper10.1109/SIU.2006.1659879