Title
Compressive sensing with unknown parameters
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.
Year
DOI
Venue
2012
10.1109/ACSSC.2012.6489041
Signals, Systems and Computers
Keywords
DocType
ISSN
AWGN,MIMO radar,compressed sensing,iterative methods,probability,radar detection,radar signal processing,radar tracking,target tracking,MBMP algorithm,MMV,additive white Gaussian noise,compressive sensing radar measurement,detection probability,false alarm probability,finite data records analysis,measurement matrix,multibranch matching pursuit,multiple measurement vector,numerical simulation,spatial domain,target detection,target localization,undersampled MIMO radar array
Conference
1058-6393
ISBN
Citations 
PageRank 
978-1-4673-5050-1
4
0.55
References 
Authors
4
3
Name
Order
Citations
PageRank
Marco Rossi1532.81
Alexander M. Haimovich261869.28
Y.C. Eldar3101763.15