{"title":"Maximum a posteriori estimation approach to sparse recovery","authors":"Mashud Hyder, K. Mahata","doi":"10.1109/ICDSP.2011.6004892","DOIUrl":null,"url":null,"abstract":"We adopt a maximum a posteriori (MAP) estimation based approach for recovering sparse signals from a small number of measurements formed by computing the inner products of the signal with rows of a matrix. We assume that each component of the sparse signal is independent and identically distributed (i.i.d) random variable drawn from a Gaussian mixture model. We then develop a suitable MAP formulation which results in an iterative algorithm. Simulations are performed to study the performance of the algorithm. We observe that our approach has a number of advantages over other sparse recovery techniques, including robustness to noise, increased performance with limited measurements and lower computation time.","PeriodicalId":360702,"journal":{"name":"2011 17th International Conference on Digital Signal Processing (DSP)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-07-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 17th International Conference on Digital Signal Processing (DSP)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDSP.2011.6004892","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3
Abstract
We adopt a maximum a posteriori (MAP) estimation based approach for recovering sparse signals from a small number of measurements formed by computing the inner products of the signal with rows of a matrix. We assume that each component of the sparse signal is independent and identically distributed (i.i.d) random variable drawn from a Gaussian mixture model. We then develop a suitable MAP formulation which results in an iterative algorithm. Simulations are performed to study the performance of the algorithm. We observe that our approach has a number of advantages over other sparse recovery techniques, including robustness to noise, increased performance with limited measurements and lower computation time.