Proceedings of the International Conference on Distributed Smart Cameras 2014
DOI: 10.1145/2659021.2659036
|View full text |Cite
|
Sign up to set email alerts
|

Matching People across Camera Views using Kernel Canonical Correlation Analysis

Abstract: Matching people across views is still an open problem in computer vision and in video surveillance systems. In this paper we address the problem of person re-identification across disjoint cameras by proposing an efficient but robust kernel descriptor to encode the appearance of a person. The matching is then improved by applying a learning technique based on Kernel Canonical Correlation Analysis (KCCA) which finds a common subspace between the proposed descriptors extracted from disjoint cameras, projecting t… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
82
0

Year Published

2017
2017
2019
2019

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 102 publications
(83 citation statements)
references
References 26 publications
1
82
0
Order By: Relevance
“…Then, all five features are concatenated together. Similarly, DenseSIFT, SILTP, and HOG are extracted according to the settings in [46], [11], and [47], respectively, and are concatenated together. Dimension of color and texture features after concatenation become large, and since Re-ID data is multiview we have used CCA [48] to reduce dimension.…”
Section: Methodsmentioning
confidence: 99%
“…Then, all five features are concatenated together. Similarly, DenseSIFT, SILTP, and HOG are extracted according to the settings in [46], [11], and [47], respectively, and are concatenated together. Dimension of color and texture features after concatenation become large, and since Re-ID data is multiview we have used CCA [48] to reduce dimension.…”
Section: Methodsmentioning
confidence: 99%
“…We compare the state-of-the-art semisupervised baselines kCCA [41], kLFDA [39], XQDA [40], and Null-semi [38] on PRID2011 with access to the implementation codes using the same LOMO features. It can be seen that (see Table 2) (1) except result at rank@10, rank@1, and rank@5, matching rate of our method is the best result compared with baselines, and there is only 0.2% margin below Null-semi that takes the best performance at rank@10.…”
Section: Experiments On Prid2011mentioning
confidence: 99%
“…It is also possible to learn verification decision function together with a distance metric to improve performance compared with a fixed verification threshold [38]. Another method that can be used to learn a distance metric is Canonical Correlation Analysis (CCA) [40]. CCA is used in conjunction with reference descriptors in [2], to achieve highly accurate re-identification given only simple features.…”
Section: B Metric Learningmentioning
confidence: 99%
“…Although other methods have been proposed that can achieve higher performance on VIPeR, such as [55], [60], [24], [40], our proposed multi-task learning approach is complementary to these methods and could therefore contribute to further performance improvements. Additionally, several of the above mentioned methods use ensembles of re-identification systems [55], [60] to achieve high performance on VIPeR, and use hand-designed features [24], [40].…”
Section: Analysis Of Feature Representationmentioning
confidence: 99%
See 1 more Smart Citation