Compressive sensing with unknown parameters

Document Type

Conference Proceeding

Publication Date

12-1-2012

Abstract

This work addresses target detection from a set of compressive sensing radar measurements corrupted by additive white Gaussian noise. In previous work, we studied target localization using compressive sensing in the spatial domain, i.e., the use of an undersampled MIMO radar array, and proposed the Multi-Branch Matching Pursuit (MBMP) algorithm, which requires knowledge of the number of targets. Generalizing the MBMP algorithm, we propose a framework for target detection, which has several important advantages over previous methods: (i) it is fully adaptive; (ii) it addresses the general multiple measurement vector (MMV) setting; (iii) it provides a finite data records analysis of false alarm and detection probabilities, which holds for any measurement matrix. Using numerical simulations, we show that the proposed algorithm is competitive with respect to state-of-the-art compressive sensing algorithms for target detection. © 2012 IEEE.

Identifier

84876220950 (Scopus)

ISBN

[9781467350518]

Publication Title

Conference Record Asilomar Conference on Signals Systems and Computers

External Full Text Location

https://doi.org/10.1109/ACSSC.2012.6489041

ISSN

10586393

First Page

436

Last Page

440

This document is currently not available here.

Share

COinS