2011
DOI: 10.1007/978-3-642-24088-1_15
|View full text |Cite
|
Sign up to set email alerts
|

A Multiple Component Matching Framework for Person Re-identification

Abstract: Abstract. Person re-identification consists in recognizing an individual that has already been observed over a network of cameras. It is a novel and challenging research topic in computer vision, for which no reference framework exists yet. Despite this, previous works share similar representations of human body based on part decomposition and the implicit concept of multiple instances. Building on these similarities, we propose a Multiple Component Matching (MCM) framework for the person reidentification prob… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
72
0

Year Published

2013
2013
2016
2016

Publication Types

Select...
7
1
1

Relationship

4
5

Authors

Journals

citations
Cited by 44 publications
(72 citation statements)
references
References 11 publications
0
72
0
Order By: Relevance
“…In order to improve the performance of these representations in the context of person re-identification, several papers have proposed to use discriminative classifiers on top of them: these classifiers can be based on Adaboost [16,17], Rank SVM [15], Partial Least Squares (PLS), multi-feature learning [26] or multiple instance learning [27,28].…”
Section: Related Workmentioning
confidence: 99%
“…In order to improve the performance of these representations in the context of person re-identification, several papers have proposed to use discriminative classifiers on top of them: these classifiers can be based on Adaboost [16,17], Rank SVM [15], Partial Least Squares (PLS), multi-feature learning [26] or multiple instance learning [27,28].…”
Section: Related Workmentioning
confidence: 99%
“…Therefore, to generate EoC-STUS (Algorithm 2), first the non-target trajectories are sorted based on their proximity to the target class using Hausdorff distance [Edgar, 2007]. It measures the distance between two sets of samples as the maximum of the minimum distances between pairs of elements from the two sets [Satta et al, 2011]. The Hausdroff distance between all non-target trajectories and target trajectory is calculated as: …”
Section: Sorted Trajectory Under-sampling (Stus)mentioning
confidence: 99%
“…Similarly, in [47], a high-dimensional signature composed by texture, gradient and color information is projected into a low-dimensional discriminant latent space by Partial Least Squares (PLS) reduction. Multiple Component Learning is casted into the re-id scenario, dubbing it a Multiple Component Matching and exploiting SDALF as a descriptor, in [46]. The descriptor proposed in [54] uses contextual visual knowledge coming from the surrounding people that form a group, assuming that groups can be detected.…”
Section: Related Workmentioning
confidence: 99%