2013
DOI: 10.1109/tcsvt.2013.2255413
|View full text |Cite
|
Sign up to set email alerts
|

Person Re-Identification by Regularized Smoothing KISS Metric Learning

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
86
0

Year Published

2017
2017
2022
2022

Publication Types

Select...
4
3

Relationship

0
7

Authors

Journals

citations
Cited by 158 publications
(86 citation statements)
references
References 55 publications
0
86
0
Order By: Relevance
“…Zheng et al [23] learned a Mahalanobis distance metric with a probabilistic relative distance comparison method. Kostinger et al [24] introduced a simpler metric function (KISSME) to fit pairwise samples based on Gaussian distribution hypothesis, and Tao et al [25] got better estimation of the covariance matrices of KISS metric learning by seamlessly integrating smoothing and regularization. Mignon et al [26] learn distance metric from sparse pairwise similarity/dissimilarity constraints in high dimensional space called pairwise constrained component analysis.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Zheng et al [23] learned a Mahalanobis distance metric with a probabilistic relative distance comparison method. Kostinger et al [24] introduced a simpler metric function (KISSME) to fit pairwise samples based on Gaussian distribution hypothesis, and Tao et al [25] got better estimation of the covariance matrices of KISS metric learning by seamlessly integrating smoothing and regularization. Mignon et al [26] learn distance metric from sparse pairwise similarity/dissimilarity constraints in high dimensional space called pairwise constrained component analysis.…”
Section: Related Workmentioning
confidence: 99%
“…(ii) Subspace and metric learning aims at seeking a proper subspace or distance measure by Mahalanobis-like metric learning [21][22][23][24][25][26][27][28][29][30]. Given a set of person image pairs, metric learning based methods are to learn an optimal positive semidefinite matrix for the validity of metric that maximizes the probability of true matches pair having smaller distance than wrong match pairs.…”
Section: Introductionmentioning
confidence: 99%
“…According to the Re-ID taxonomy summarized by Vezzani et al [1], local features and pedestrian body model-based features are very common because they capture detailed and localized information for matching. Among local features, it is very popular to use combination features of color and texture histograms, for example, color histograms (from HSV color space) and scale invariant local ternary pattern (SILTP) histograms [5], color histograms (from RGB, YUV, and HSV color spaces) and local binary pattern (LBP) histograms [6,7], color histograms (from RGB and HSV color spaces) and LBP histograms [8], color histograms (from RGB, YCbCr, and HS color spaces) and texture histograms of Gabor filters and Schmid filters [9], and color histograms (from HSV and Lab color spaces) and LBP histograms [10,11]. The implementation details of these color and texture histograms might be different.…”
Section: Related Workmentioning
confidence: 99%
“…Köstinger et al [15] presented KISS classification metric learned from equivalence constraints based on statistical inference rather than computational complex optimization. However, this classification metric learning could be unstable under a small-sized training set, mentioned in [10]. Thus, Tao et al [10] integrated smoothing and regularization techniques in KISS for robust estimation of covariance matrices and stable performance and proposed regularized smoothing KISS.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation