TY - GEN
T1 - Beyond Mahalanobis distance
T2 - 2012 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, CVPRW 2012
AU - Li, Zhen
AU - Cao, Liangliang
AU - Chang, Shiyu
AU - Smith, John R.
AU - Huang, Thomas S
PY - 2012/8/20
Y1 - 2012/8/20
N2 - People verification is a challenging and important task which finds many applications in modern surveillance and video retrieval systems. In this problem, metric learning approaches have played an important role by trying to bridge the semantic gap between image features and people's identities. However, we believe that the traditional Mahalanobis distance is limited in capturing the diversity of visual phenomenon, and hence insufficient for complicated tasks such as people verification. In this paper, we introduce a novel discriminant function which generalizes the classical Mahalanobis distance. Our approach considers a quadratic function directly on the space of image pairs. The resulting decision boundary is therefore in a general shape and not limited to ellipsoids enforced by Mahalanobis distance. To achieve computational efficiency, we develop a generalized SVM-type solver in dual space. Experimental results on the "Labeled Faces in the Wild" dataset show that our method outperforms the classical Mahalanobis distance in the people verification problem.
AB - People verification is a challenging and important task which finds many applications in modern surveillance and video retrieval systems. In this problem, metric learning approaches have played an important role by trying to bridge the semantic gap between image features and people's identities. However, we believe that the traditional Mahalanobis distance is limited in capturing the diversity of visual phenomenon, and hence insufficient for complicated tasks such as people verification. In this paper, we introduce a novel discriminant function which generalizes the classical Mahalanobis distance. Our approach considers a quadratic function directly on the space of image pairs. The resulting decision boundary is therefore in a general shape and not limited to ellipsoids enforced by Mahalanobis distance. To achieve computational efficiency, we develop a generalized SVM-type solver in dual space. Experimental results on the "Labeled Faces in the Wild" dataset show that our method outperforms the classical Mahalanobis distance in the people verification problem.
UR - http://www.scopus.com/inward/record.url?scp=84864968110&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84864968110&partnerID=8YFLogxK
U2 - 10.1109/CVPRW.2012.6239342
DO - 10.1109/CVPRW.2012.6239342
M3 - Conference contribution
AN - SCOPUS:84864968110
SN - 9781467316118
T3 - IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops
SP - 45
EP - 50
BT - 2012 IEEE Computer Society Conference on Computer Vision and Pattern Recognition Workshops, CVPRW 2012
Y2 - 16 June 2012 through 21 June 2012
ER -