Nonparametric simultaneous sparse recovery: An application to source localization. Ollila, E. In 2015 23rd European Signal Processing Conference (EUSIPCO), pages 509-513, Aug, 2015.
Paper doi abstract bibtex We consider multichannel sparse recovery problem 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. Many popular greedy or convex algorithms perform poorly under non-Gaussian heavy-tailed noise conditions or in the face of outliers. In this paper, we propose the usage of mixed ℓp, q norms on data fidelity (residual matrix) term and the conventional ℓ0,2-norm constraint on the signal matrix to promote row-sparsity. We devise a greedy pursuit algorithm based on simultaneous normalized iterative hard thresholding (SNIHT) algorithm. Simulation studies highlight the effectiveness of the proposed approaches to cope with different noise environments (i.i.d., row i.i.d, etc) and outliers. Usefulness of the methods are illustrated in source localization application with sensor arrays.
@InProceedings{7362435,
author = {E. Ollila},
booktitle = {2015 23rd European Signal Processing Conference (EUSIPCO)},
title = {Nonparametric simultaneous sparse recovery: An application to source localization},
year = {2015},
pages = {509-513},
abstract = {We consider multichannel sparse recovery problem 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. Many popular greedy or convex algorithms perform poorly under non-Gaussian heavy-tailed noise conditions or in the face of outliers. In this paper, we propose the usage of mixed ℓp, q norms on data fidelity (residual matrix) term and the conventional ℓ0,2-norm constraint on the signal matrix to promote row-sparsity. We devise a greedy pursuit algorithm based on simultaneous normalized iterative hard thresholding (SNIHT) algorithm. Simulation studies highlight the effectiveness of the proposed approaches to cope with different noise environments (i.i.d., row i.i.d, etc) and outliers. Usefulness of the methods are illustrated in source localization application with sensor arrays.},
keywords = {compressed sensing;iterative methods;matrix algebra;nonparametric simultaneous multichannel sparse recovery problem;convex algorithms;greedy algorithms;nonGaussian heavy-tailed noise conditions;data fidelity term;signal matrix;simultaneous normalized iterative hard thresholding algorithm;SNIHT algorithm;source localization;compressed sensing;Yttrium;Signal processing algorithms;Robustness;Signal to noise ratio;Sparse matrices;Minimization;multichannel sparse recovery;compressed sensing;robustness;iterative hard thresholding},
doi = {10.1109/EUSIPCO.2015.7362435},
issn = {2076-1465},
month = {Aug},
url = {https://www.eurasip.org/proceedings/eusipco/eusipco2015/papers/1570096183.pdf},
}
Downloads: 0
{"_id":"6DCB4f4DFuq85QX9q","bibbaseid":"ollila-nonparametricsimultaneoussparserecoveryanapplicationtosourcelocalization-2015","authorIDs":[],"author_short":["Ollila, E."],"bibdata":{"bibtype":"inproceedings","type":"inproceedings","author":[{"firstnames":["E."],"propositions":[],"lastnames":["Ollila"],"suffixes":[]}],"booktitle":"2015 23rd European Signal Processing Conference (EUSIPCO)","title":"Nonparametric simultaneous sparse recovery: An application to source localization","year":"2015","pages":"509-513","abstract":"We consider multichannel sparse recovery problem 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. Many popular greedy or convex algorithms perform poorly under non-Gaussian heavy-tailed noise conditions or in the face of outliers. In this paper, we propose the usage of mixed ℓp, q norms on data fidelity (residual matrix) term and the conventional ℓ0,2-norm constraint on the signal matrix to promote row-sparsity. We devise a greedy pursuit algorithm based on simultaneous normalized iterative hard thresholding (SNIHT) algorithm. Simulation studies highlight the effectiveness of the proposed approaches to cope with different noise environments (i.i.d., row i.i.d, etc) and outliers. Usefulness of the methods are illustrated in source localization application with sensor arrays.","keywords":"compressed sensing;iterative methods;matrix algebra;nonparametric simultaneous multichannel sparse recovery problem;convex algorithms;greedy algorithms;nonGaussian heavy-tailed noise conditions;data fidelity term;signal matrix;simultaneous normalized iterative hard thresholding algorithm;SNIHT algorithm;source localization;compressed sensing;Yttrium;Signal processing algorithms;Robustness;Signal to noise ratio;Sparse matrices;Minimization;multichannel sparse recovery;compressed sensing;robustness;iterative hard thresholding","doi":"10.1109/EUSIPCO.2015.7362435","issn":"2076-1465","month":"Aug","url":"https://www.eurasip.org/proceedings/eusipco/eusipco2015/papers/1570096183.pdf","bibtex":"@InProceedings{7362435,\n author = {E. Ollila},\n booktitle = {2015 23rd European Signal Processing Conference (EUSIPCO)},\n title = {Nonparametric simultaneous sparse recovery: An application to source localization},\n year = {2015},\n pages = {509-513},\n abstract = {We consider multichannel sparse recovery problem 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. Many popular greedy or convex algorithms perform poorly under non-Gaussian heavy-tailed noise conditions or in the face of outliers. In this paper, we propose the usage of mixed ℓp, q norms on data fidelity (residual matrix) term and the conventional ℓ0,2-norm constraint on the signal matrix to promote row-sparsity. We devise a greedy pursuit algorithm based on simultaneous normalized iterative hard thresholding (SNIHT) algorithm. Simulation studies highlight the effectiveness of the proposed approaches to cope with different noise environments (i.i.d., row i.i.d, etc) and outliers. Usefulness of the methods are illustrated in source localization application with sensor arrays.},\n keywords = {compressed sensing;iterative methods;matrix algebra;nonparametric simultaneous multichannel sparse recovery problem;convex algorithms;greedy algorithms;nonGaussian heavy-tailed noise conditions;data fidelity term;signal matrix;simultaneous normalized iterative hard thresholding algorithm;SNIHT algorithm;source localization;compressed sensing;Yttrium;Signal processing algorithms;Robustness;Signal to noise ratio;Sparse matrices;Minimization;multichannel sparse recovery;compressed sensing;robustness;iterative hard thresholding},\n doi = {10.1109/EUSIPCO.2015.7362435},\n issn = {2076-1465},\n month = {Aug},\n url = {https://www.eurasip.org/proceedings/eusipco/eusipco2015/papers/1570096183.pdf},\n}\n\n","author_short":["Ollila, E."],"key":"7362435","id":"7362435","bibbaseid":"ollila-nonparametricsimultaneoussparserecoveryanapplicationtosourcelocalization-2015","role":"author","urls":{"Paper":"https://www.eurasip.org/proceedings/eusipco/eusipco2015/papers/1570096183.pdf"},"keyword":["compressed sensing;iterative methods;matrix algebra;nonparametric simultaneous multichannel sparse recovery problem;convex algorithms;greedy algorithms;nonGaussian heavy-tailed noise conditions;data fidelity term;signal matrix;simultaneous normalized iterative hard thresholding algorithm;SNIHT algorithm;source localization;compressed sensing;Yttrium;Signal processing algorithms;Robustness;Signal to noise ratio;Sparse matrices;Minimization;multichannel sparse recovery;compressed sensing;robustness;iterative hard thresholding"],"metadata":{"authorlinks":{}},"downloads":0},"bibtype":"inproceedings","biburl":"https://raw.githubusercontent.com/Roznn/EUSIPCO/main/eusipco2015url.bib","creationDate":"2021-02-13T17:31:52.310Z","downloads":0,"keywords":["compressed sensing;iterative methods;matrix algebra;nonparametric simultaneous multichannel sparse recovery problem;convex algorithms;greedy algorithms;nongaussian heavy-tailed noise conditions;data fidelity term;signal matrix;simultaneous normalized iterative hard thresholding algorithm;sniht algorithm;source localization;compressed sensing;yttrium;signal processing algorithms;robustness;signal to noise ratio;sparse matrices;minimization;multichannel sparse recovery;compressed sensing;robustness;iterative hard thresholding"],"search_terms":["nonparametric","simultaneous","sparse","recovery","application","source","localization","ollila"],"title":"Nonparametric simultaneous sparse recovery: An application to source localization","year":2015,"dataSources":["eov4vbT6mnAiTpKji","knrZsDjSNHWtA9WNT"]}