Multi-target data association using sparse reconstruction

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

Abstract

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.

References Powered by Scopus

The pascal visual object classes (VOC) challenge

15534Citations
4401Readers
Get full text

Robust face recognition via sparse representation

8994Citations
1456Readers
Get full text
4405Citations
1579Readers
Get full text

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Cite

CITATION STYLE

APA

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

Readers over time

‘14‘17‘2000.751.52.253

Readers' Seniority

Tooltip

Researcher 2

50%

Professor / Associate Prof. 1

25%

PhD / Post grad / Masters / Doc 1

25%

Readers' Discipline

Tooltip

Computer Science 4

80%

Agricultural and Biological Sciences 1

20%

Save time finding and organizing research with Mendeley

Sign up for free
0