Robust dictionary learning with graph regularization for unsupervised person re-identification
- Publication Type:
- Journal Article
- Citation:
- Multimedia Tools and Applications, 2018, 77 (3), pp. 3553 - 3577
- Issue Date:
- 2018-02-01
Closed Access
| Filename | Description | Size | |||
|---|---|---|---|---|---|
| Yan2018_Article_RobustDictionaryLearningWithGr.pdf | Published Version | 3.51 MB |
Copyright Clearance Process
- Recently Added
- In Progress
- Closed Access
This item is closed access and not available.
© 2017, Springer Science+Business Media, LLC. Most existing approaches for person re-identification are designed in a supervised way, undergoing a prohibitively high labeling cost and poor scalability. Besides establishing effective similarity distance metrics, these supervised methods usually focus on constructing discriminative and robust features, which is extremely difficult due to the significant viewpoint variations. To overcome these challenges, we propose a novel unsupervised method, termed as Robust Dictionary Learning with Graph Regularization (RDLGR), which can guarantee view-invariance through learning a dictionary shared by all the camera views. To avoid the significant degradation of performance caused by outliers, we employ a capped l2,1-norm based loss to make our model more robust, addressing the problem that traditional quadratic loss is known to be easily dominated by outliers. Considering the lack of labeled cross-view discriminative information in our unsupervised method, we further introduce a cross-view graph Laplacian regularization term into the framework of dictionary learning. As a result, the geographical structure of original data space can be preserved in the learned latent subspace as discriminative information, making it possible to further boost the matching accuracy. Extensive experimental results over four widely used benchmark datasets demonstrate the superiority of the proposed model over the state-of-the-art methods.
Please use this identifier to cite or link to this item: