A low-complexity sparsity-based multi-target tracking algorithm for urban environments

Phani Chavali, Arye Nehorai

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations

Abstract

In this paper, we propose a low-complexity sparsity based multi-target tracking algorithm. We develop a finite dimensional representation of the received signal when the radar is operating in an urban environment. The dimensionality of the representation denotes the extra degrees of freedom that an urban environment offers. We employ spread-spectrum signaling to exploit the full diversity offered by the environment. We then develop a block-sparse measurement model by discretizing the delay-Doppler plane and prove that the dictionary of the block-sparse model exhibits a special structure under spread-spectrum signaling. This structure enables an efficient support recovery of the sparse vector, by projecting the measurement vector on the row space of the dictionary. Numerical simulations show that our tracking procedure takes significantly less time, while giving good tracking performance.

Original languageEnglish
Title of host publicationRadarCon'11 - In the Eye of the Storm
Subtitle of host publication2011 IEEE Radar Conference
Pages309-314
Number of pages6
DOIs
StatePublished - 2011
Event2011 IEEE Radar Conference: In the Eye of the Storm, RadarCon'11 - Kansas City, MO, United States
Duration: May 23 2011May 27 2011

Publication series

NameIEEE National Radar Conference - Proceedings
ISSN (Print)1097-5659

Conference

Conference2011 IEEE Radar Conference: In the Eye of the Storm, RadarCon'11
Country/TerritoryUnited States
CityKansas City, MO
Period05/23/1105/27/11

Keywords

  • low-complexity support recovery
  • Multi-target tracking
  • spread-spectrum signaling

Fingerprint

Dive into the research topics of 'A low-complexity sparsity-based multi-target tracking algorithm for urban environments'. Together they form a unique fingerprint.

Cite this