Dual Linear Regression Based Classification for Face Cluster Recognition

We are dealing with the face cluster recognition problem where there are multiple images per subject in both gallery and probe sets. It is never guaranteed to have a clear spatio-temporal relation among the multiple images of each subject. Considering that the image vectors of each subject, either in gallery or in probe, span a subspace; an algorithm, Dual Linear Regression Classification (DLRC), for the face cluster recognition problem is developed where the distance between two subspaces is defined as the similarity value between a gallery subject and a probe subject. DLRC attempts to find a virtual face image located in the intersection of the subspaces spanning from both clusters of face images. The distance between the virtual face images reconstructed from both subspaces is then taken as the distance between these two subspaces. We further prove that such distance can be formulated under a single linear regression model where we indeed can find the distance without reconstructing the virtual face images. Extensive experimental evaluations demonstrated the effectiveness of DLRC algorithm compared to other algorithms.