Deep Constrained Dominant Sets For Person Re-identification

Abstract

In this work, we propose an end-to-end constrained clustering scheme to tackle the person re-identification (re-id) problem. Deep neural networks (DNN) have recently proven to be effective on person re-identification task. In particular, rather than leveraging solely a probe-gallery similarity, diffusing the similarities among the gallery images in an end-to-end manner has proven to be effective in yielding a robust probe-gallery affinity. However, existing methods do not apply probe image as a constraint, and are prone to noise propagation during the similarity diffusion process. To overcome this, we propose an intriguing scheme which treats person-image retrieval problem as a \{\em constrained clustering optimization\} problem, called deep constrained dominant sets (DCDS). Given a probe and gallery images, we re-formulate person re-id problem as finding a constrained cluster, where the probe image is taken as a constraint (seed) and each cluster corresponds to a set of images corresp

Stats

• citations16
• S2 citations—
• github stars0
• HF likes0
• heat score9.23
• arxiv keyalemu2019deep

Related papers

• Deep Co-attention Based Comparators For Relative Representation Learning In Person Re-identification (2018)13.34
• Adaptive Re-ranking Of Deep Feature For Person Re-identification (2018)0.00
• Structured Deep Hashing With Convolutional Neural Networks For Fast Person Re-identification (2017)12.87
• Person Re-identification With Deep Similarity-guided Graph Neural Network (2018)17.55
• Distribution Context Aware Loss For Person Re-identification (2019)3.58
• Ensemble Feature For Person Re-identification (2019)0.00
• Confidence-guided Centroids For Unsupervised Person Re-identification (2022)7.16
• Deep Group-shuffling Random Walk For Person Re-identification (2018)15.48