Cross-View Kernel Similarity Metric Learning Using Pairwise Constraints for Person Re-identification
원문 초록
Person re-identification is the task of matching pedestrian images across non-overlapping cameras. In this paper, we propose a non-linear cross-view similarity metric learning for handling small size training data in practical re-ID systems. The method employs non-linear mappings combined with cross-view discriminative subspace learning and cross-view distance metric learning based on pairwise similarity constraints. It is a natural extension of XQDA from linear to non-linear mappings using kernels, and learns non-linear transformations for efficiently handling complex non-linearity of person appearance across camera views. Importantly, the proposed method is very computationally efficient. Extensive experiments on four challenging datasets shows that our method attains competitive performance against state-of-the-art methods.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
GSSF: Generalized Structural Sparse Function for Deep Cross-modal Metric Learning
Keypoint Promptable Re-Identification
Image Retrieval Methods in the Dissimilarity Space
Time-Frequency Analysis of Variable-Length WiFi CSI Signals for Person Re-Identification
Why and How: Knowledge-Guided Learning for Cross-Spectral Image Patch Matching
Try Harder: Hard Sample Generation and Learning for Clothes-Changing Person Re-ID
토론
이 논문과 연결된 포럼 글이 아직 없습니다.