DocumentCode
2721640
Title
Leveraging social network information to recognize people
Author
Dikmen, Mert ; Huang, Thomas S.
Author_Institution
Dept. of Electr. & Comput. Eng., Univ. of Illinois at Urbana, Urbana, IL, USA
fYear
2011
fDate
20-25 June 2011
Firstpage
68
Lastpage
73
Abstract
Correctly identifying the observed subjects is an important problem camera networks. Prior art[1, 5] has demonstrated that this data association problem is indeed very difficult when working solely with visual information provided by the cameras, because the appearance of the subjects are highly variable. Visual data provided by surveillance cameras are in general noisy, low resolution, prone to degradation due to lighting and other adverse effects. We hypothesize that knowing the social associations of people can improve the recognition performance of a given visual-only matching metric. We cast the problem as bipartite graph matching problem between the observed people in the camera network and a database of identities and appearance models with an additional pairwise configuration cost on the set of identities. The effectiveness of our claim is demonstrated on a dataset synthesized from UC Irvine Pedestrian Recognition Dataset (VIPeR[3]) (for visual data) and Enron Email Dataset (for social network data).
Keywords
face recognition; graph theory; image matching; social networking (online); UC Irvine Pedestrian Recognition Dataset; bipartite graph matching problem; data association problem; pairwise configuration; people recognition; social network information; visual data; visual information; visual only matching metric; Bipartite graph; Cameras; Electronic mail; Measurement; Social network services; Tin; Visualization;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer Vision and Pattern Recognition Workshops (CVPRW), 2011 IEEE Computer Society Conference on
Conference_Location
Colorado Springs, CO
ISSN
2160-7508
Print_ISBN
978-1-4577-0529-8
Type
conf
DOI
10.1109/CVPRW.2011.5981783
Filename
5981783
Link To Document