Abstract
Recently, Local Fisher Discriminant Analysis (LFDA) has achieved impressive performance in person re-identification. However, the classic LFDA method pays little attention to the intrinsic geometrical structure of the complex person re-identification data. Due to large appearance variance, two images of the same person may be far away from each other in feature space while images of different people may be quite close to each other. The linear topology exploited in LFDA is not sufficient to describe this nonlinear data structure. In this paper, we assume that the data reside on a manifold and propose an effective method termed Geometric Preserving Local Fisher Discriminant Analysis (GeoPLFDA). The method integrates discriminative framework of LFDA with geometric preserving method which approximates local manifold utilizing a nearest neighbor graph. LFDA provides discriminative information by separating different labeled samples and pulling the same labeled samples together. The geometric preserving projection provides local manifold structure of the nonlinear data induced by graph topology. Taking advantage of the complementary between them, the proposed method achieves significant improvement over state-of-the-art approaches. Furthermore, a kernel extension of the GeoPLFDA method is proposed to handle the complex nonlinearity more effectively and to further improve re-identification accuracy. Experiments on the challenging iLIDS, VIPeR, CAVIAR and 3DPeS datasets demonstrate the effectiveness of the proposed method.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.