2015/04/16 by Esa Ollila, Ollila, Esa · 1 citation
Computer Science · Engineering · Mathematics · #Blind Source Separation Techniques #Distributed Sensor Networks and Detection Algorithms #Sparse and Compressive Sensing Techniques #cs.IT #math.IT #stat.CO #stat.ML
paper · pdf · doi:10.48550/arxiv.1504.04184
To appear in CoSeRa'15 (Pisa, Italy, June 16-19, 2015). arXiv admin note: text overlap with arXiv:1502.02441
arxiv created 2015/04/16 · arxiv updated 2015/04/17
In this paper, we generalize Huber's criterion to multichannel sparse recovery problem of complex-valued measurements where the objective is to find good recovery of jointly sparse unknown signal vectors from the given multiple measurement vectors which are different linear combinations of the same known elementary vectors. This requires careful characterization of robust complex-valued loss functions as well as Huber's criterion function for the multivariate sparse regression problem. We devise a greedy algorithm based on simultaneous normalized iterative hard thresholding (SNIHT) algorithm. Unlike the conventional SNIHT method, our algorithm, referred to as HUB-SNIHT, is robust under heavy-tailed non-Gaussian noise conditions, yet has a negligible performance loss compared to SNIHT under Gaussian noise. Usefulness of the method is illustrated in source localization application with sensor arrays.