Sep 20, 2017 · In this paper, we propose a novel unsupervised method for person re-identification, termed as Robust Dictionary Learning with Graph ...

Most existing approaches for person re-identification are designed in a supervised way, undergoing a prohibitively high labeling cost and poor scalability.

Abstract:Unsupervised person re-identification (re-ID) aims to perform person retrieval in an unsupervised manner across multiple cameras. Most recent works ...

Robust dictionary learning with graph regularization for unsupervised person re-identification · List of references · Publications that cite this publication.

Robust dictionary learning with graph regularization for unsupervised person re-identification. Authors. Yan, Caixia; Luo, Minnan; Zheng, Qinghua; Liu, Wenhe.

Our model is based on a new graph regularised dictionary learning algorithm. By introducing a i1-norm graph Laplacian term, instead of the conven- tional ...

Jul 15, 2022 · We propose a graph regularization based dictionary learning for unsupervised re-ID. Specifically, in order to alleviate the difference between different ...

Person re-identification (re-ID) is an attractive task, while it has not yet reached the realistic applications. Most existing re-ID methods based on ...

Robust dictionary learning with graph regularization for unsupervised person re-identification. Caixia Yan; Minnan Luo; Qinghua Zheng. OriginalPaper 20 ...

Unsupervised person re-identification is a computer vision task that involves identifying and matching individuals across different non-overlapping cameras ...