ALGORITHMS FOR SIMULTANEOUS SPARSE APPROXIMATION

By Joel A. Tropp. 2006

558 citations recorded by the source corpus.

View Paper: https://www.semanticscholar.org/paper/8951be0ab677d2eafb0360f1aacb580b4f74053a

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Rank Awareness in Joint Sparse Recovery (2010, methodology): “gnals [19], [20], [21], [22], [23]. As with the single measurement vector problem (SMV) several suboptimal methods for ﬁnding a sparse matrix have been proposed, that have polynomial complexity [24], [25], [26], [10], [11], [12], [16], [15], [13]. These approaches are generally straightforward exten”
Average Case Analysis of Multichannel Sparse Recovery Using Convex Relaxation (2009, methodology): “, mixed l2,1-minimization [45], [22], [21], [20].”
A unified framework for high-dimensional analysis of $M$-estimators with decomposable regularizers (2009, unknown): “, [3, 5, 28, 32, 69, 70, 78, 80]), among them the group Lasso based on 1/ 2-regularization.”
Non-local sparse models for image restoration (2009, methodology): “We propose to extend and combine these two approaches by using simultaneous sparse coding [28] [29] [31] to impose that similar patches share the same dictionary elements in their sparse decomposition .”
Sparse Bayesian multi-task learning for predicting cognitive outcomes from neuroimaging measures in Alzheimer's disease (2012, methodology): “They are the Mixed l2/l1 Program [7], M-FOCUSS [5], Simultaneous Orthogonal Matching Pursuit (S-OMP) [16], Multi-Task Compressive Sensing (MT-CS) [10], and Ridge Regression [9].”
Optimization with Sparsity-Inducing Penalties (2011, methodology): “For instance, they are used in the context of non-convex group-sparsity in [117], or with structured sparsity formulations [15, 53].”
Pixel-level image fusion with simultaneous orthogonal matching pursuit (2012, methodology): “The SOMP per, the SOMP technique is employed to solve this problem [33].”
Unsupervised learning of compositional sparse code for natural image representation (2013, background): “However, perturbations of selected basis functions are not considered in [4, 32].”
Handbook of Blind Source Separation: Independent Component Analysis and Applications (2010, methodology): “Similar results for the multi-channel case [102] show that, when the same assumptions are made, the ` and ` criteria essentially lead to the same representations.”