Algorithms for simultaneous sparse approximation. II: Convex relaxation
From MaRDI portal
Publication:1027255
DOI10.1016/j.sigpro.2005.05.031zbMath1163.94395WikidataQ59750785 ScholiaQ59750785MaRDI QIDQ1027255
Publication date: 1 July 2009
Published in: Signal Processing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.sigpro.2005.05.031
combinatorial optimization; convex relaxation; multiple measurement vectors; simultaneous sparse approximation
94A12: Signal theory (characterization, reconstruction, filtering, etc.)
Related Items
Wavelet compressive sampling signal reconstruction using upside-down tree structure, Sparse reconstruction for bioluminescence tomography based on the semigreedy method, The null space property for sparse recovery from multiple measurement vectors, Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms, A Bayesian lasso via reversible-jump MCMC, Iterative thresholding algorithms, Adaptive iterative thresholding algorithms for magnetoencephalography (MEG), Coorbit theory, multi-\(\alpha \)-modulation frames, and the concept of joint sparsity for medical multichannel data analysis, Input selection and shrinkage in multiresponse linear regression, The application of joint sparsity and total variation minimization algorithms to a real-life art restoration problem
