paper-with-me

홈 › Papers

Cross-View Kernel Similarity Metric Learning Using Pairwise Constraints for Person Re-identification

2019-09-25 · T M Feroz Ali, Subhasis Chaudhuri

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.

📄 PDF Abstract BibTeX arXiv:1909.11316

Code (3)

ferozalitm/Efficient-Kernel-XQDA-Matlab
ferozalitm/Efficient-Kernel-XQDA-Python
ferozalitm/Kernel-XQDA

Tasks

Metric LearningPerson Re-Identification

Similar Papers 제목 키워드 기반

On a Theory of Nonparametric Pairwise Similarity for Clustering: Connecting Clustering to Classification

2014-12-01 · NeurIPS 2014 12 · Yingzhen Yang, Feng Liang, Shuicheng Yan, Zhangyang Wang 외

Pairwise clustering methods partition the data space into clusters by the pairwise similarity between data points. The success of pairwise clustering largely depends on the pairwise similarity function defined over the d…

ClusteringDensity EstimationGeneral ClassificationMulti-class Classification

Generalized vec trick for fast learning of pairwise kernel models

2020-09-02 · Markus Viljanen, Antti Airola, Tapio Pahikkala

Pairwise learning corresponds to the supervised learning setting where the goal is to make predictions for pairs of objects. Prominent applications include predicting drug-target or protein-protein interactions, or custo…

Metric Learning

Boosting t-SNE Efficiency for Sequencing Data: Insights from Kernel Selection

2025-12-17 · Avais Jan, Prakash Chourasia, Sarwan Ali, Murray Patterson arxiv

Dimensionality reduction techniques are essential for visualizing and analyzing high-dimensional biological sequencing data. t-distributed Stochastic Neighbor Embedding (t-SNE) is widely used for this purpose, traditiona…

Dimensionality Reduction

Discriminative Similarity for Clustering and Semi-Supervised Learning

2017-09-05 · Yingzhen Yang, Feng Liang, Nebojsa Jojic, Shuicheng Yan 외

Similarity-based clustering and semi-supervised learning methods separate the data into clusters or classes according to the pairwise similarity between the data, and the pairwise similarity is crucial for their performa…

Clustering

Fully-Connected CRFs with Non-Parametric Pairwise Potential

2013-06-01 · CVPR 2013 6 · Neill D. F. Campbell, Kartic Subr, Jan Kautz

Conditional Random Fields (CRFs) are used for diverse tasks, ranging from image denoising to object recognition. For images, they are commonly defined as a graph with nodes corresponding to individual pixels and pairwise…

DenoisingDensity EstimationImage DenoisingObject Recognition