This paper considers the problem of detecting the support (sparsity pattern) of a sparse vector from random noisy measurements. Conditional power of a component of the sparse vector is defined as the energy conditioned on the component being nonzero. Analysis of a simplified version of orthogonal matching pursuit (OMP) called sequential OMP (SequOMP) demonstrates the importance of knowledge of the rankings of conditional powers. When the simple SequOMP algorithm is applied to components in nonincreasing order of conditional power, the detrimental effect of dynamic range on thresholding performance is eliminated. Furthermore, under the most favorable conditional powers, the performance of SequOMP approaches maximum likelihood performance at ...
In this thesis, we develop a novel general framework that is capable of extracting a low-rank interf...
The use of sparsity has emerged in the last fifteen years as an important tool for solving many prob...
A well-known analysis of Tropp and Gilbert shows that orthogonal matching pursuit (OMP) can recover ...
The paper considers the problem of detecting the sparsity pattern of a k -sparse vector in \BBR n fr...
he paper considers the problem of detecting the sparsity pattern of a k -sparse vector in BBR n from...
This paper gives a precise characterization of the fundamental limits of adaptive sensing for divers...
This paper introduces a novel approach for recovering sparse signals using sorted L1/L2 minimization...
This paper addresses the problem of sparsity pattern detection for unknown k-sparse n-dimensional si...
We consider the orthogonal matching pursuit (OMP) algorithm for the recovery of a high-dimensional s...
A well-known analysis of Tropp and Gilbert shows that orthogonal matching pursuit (OMP) can recover ...
University of Minnesota Ph.D. dissertation. August 2012. Major: Electrical/Computer Engineering. Adv...
AbstractThe detection of sparse signals against background noise is considered. Detecting signals of...
This paper considers a simple on-off random multiple access channel, where n users communicate simul...
AbstractThis article considers nonuniform support recovery via Orthogonal Matching Pursuit (OMP) fro...
A vector or matrix is said to be sparse if the number of non-zero elements is significantly smaller ...
In this thesis, we develop a novel general framework that is capable of extracting a low-rank interf...
The use of sparsity has emerged in the last fifteen years as an important tool for solving many prob...
A well-known analysis of Tropp and Gilbert shows that orthogonal matching pursuit (OMP) can recover ...
The paper considers the problem of detecting the sparsity pattern of a k -sparse vector in \BBR n fr...
he paper considers the problem of detecting the sparsity pattern of a k -sparse vector in BBR n from...
This paper gives a precise characterization of the fundamental limits of adaptive sensing for divers...
This paper introduces a novel approach for recovering sparse signals using sorted L1/L2 minimization...
This paper addresses the problem of sparsity pattern detection for unknown k-sparse n-dimensional si...
We consider the orthogonal matching pursuit (OMP) algorithm for the recovery of a high-dimensional s...
A well-known analysis of Tropp and Gilbert shows that orthogonal matching pursuit (OMP) can recover ...
University of Minnesota Ph.D. dissertation. August 2012. Major: Electrical/Computer Engineering. Adv...
AbstractThe detection of sparse signals against background noise is considered. Detecting signals of...
This paper considers a simple on-off random multiple access channel, where n users communicate simul...
AbstractThis article considers nonuniform support recovery via Orthogonal Matching Pursuit (OMP) fro...
A vector or matrix is said to be sparse if the number of non-zero elements is significantly smaller ...
In this thesis, we develop a novel general framework that is capable of extracting a low-rank interf...
The use of sparsity has emerged in the last fifteen years as an important tool for solving many prob...
A well-known analysis of Tropp and Gilbert shows that orthogonal matching pursuit (OMP) can recover ...