Salient feature based graph matching for person re-identification

• Computational symmetry and structure modeling for people re-identification.
• A new feature detector and descriptor based on ASIFT enriched by local symmetries.
• ASIFT locations properly selected in agreement with the distance from the symmetry axis.
• A new graph representation to catch structural relations.
• Results and comparisons with state-of-the-art methods experienced on the i-LIDS MCTS dataset.

We propose a person re-identification non-learning based approach that uses symmetry principles, as well as structural relations among salient features. The idea comes from the consideration that local symmetries, at different scales, also enforced by texture features, are potentially more invariant to large appearance changes than lower-level features such as SIFT, ASIFT. Finally, we formulate the re-identification problem as a graph matching problem, where each person is represented by a graph aimed not only at rejecting erroneous matches but also at selecting additional useful ones.Experimental results on public dataset i-LIDS provide good performance compared to state-of-the-art results.