In this paper we describe a solution to multi-target data association problem based on ℓ1-regularized sparse basis expansions. Assuming we have sufficient training samples per subject, our idea is to create a discriminative basis of observations that we can use to reconstruct and associate a new target. The use of ℓ1-regularized basis expansions allows our approach to exploit multiple instances of the target when performing data association rather than relying on an average representation of target appearance. Preliminary experimental results on the PETS dataset are encouraging and demonstrate that our approach is an accurate and efficient approach to multi-target data association. © 2013 Springer-Verlag.
CITATION STYLE
Bagdanov, A. D., Del Bimbo, A., Di Fina, D., Karaman, S., Lisanti, G., & Masi, I. (2013). Multi-target data association using sparse reconstruction. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8157 LNCS, pp. 239–248). https://doi.org/10.1007/978-3-642-41184-7_25
Mendeley helps you to discover research relevant for your work.