Recovery of Sparse Representations by Polytope Faces Pursuit
نویسنده
چکیده
We introduce a new greedy algorithm to find approximate sparse representations s of x = As by finding the Basis Pursuit (BP) solution of the linear program min{‖s‖ 1 | x = As}. The proposed algorithm is based on the geometry of the polar polytope P ∗ = {c | à c ≤ 1} where à = [A,−A] and searches for the vertex c ∈ P ∗ which maximizes x c using a path following method. The resulting algorithm is in the style of Matching Pursuits (MP), in that it adds new basis vectors one at a time, but it uses a different correlation criterion to determine which basis to add and can switch out basis vectors as necessary. The algorithm complexity is of a similar order to Orthogonal Matching Pursuits (OMP). Experimental results show that this algorithm, which we call Polytope Faces Pursuit, produces good results on examples that are known to be hard for MP, and it is faster than the interior point method for BP.
منابع مشابه
Group Polytope Faces Pursuit for Recovery of Block-Sparse Signals
Polytope Faces Pursuit is an algorithm that solves the standard sparse recovery problem. In this paper, we consider the case of block structured sparsity, and propose a novel algorithm based on the Polytope Faces Pursuit which incorporates this prior knowledge. The so-called Group Polytope Faces Pursuit is a greedy algorithm that adds one group of dictionary atoms at a time and adopts a path fo...
متن کاملKernel Polytope Faces Pursuit
Polytope Faces Pursuit (PFP) is a greedy algorithm that approximates the sparse solutions recovered by 1 regularised least-squares (Lasso) [4,10] in a similar vein to (Orthogonal) Matching Pursuit (OMP) [16]. The algorithm is based on the geometry of the polar polytope where at each step a basis function is chosen by finding the maximal vertex using a path-following method. The algorithmic comp...
متن کاملGeometry and homotopy for l1 sparse representations
We explore the geometry of l1 sparse representations in both the noiseless (Basis Pursuit) and noisy (Basis Pursuit De-Noising) case using a homotopy method. We will see that the concept of the basis vertex c, which has unit inner product with active basis vectors, is a useful geometric concept, both for visualization and for algorithm construction. We derive an explicit homotopy continuation a...
متن کاملPolar Polytopes and Recovery of Sparse Representations
Suppose we have a signal y which we wish to represent using a linear combination of a number of basis atoms ai, y = ∑ i xiai = Ax. The problem of finding the minimum l0 norm representation for y is a hard problem. The Basis Pursuit (BP) approach proposes to find the minimum l1 norm representation instead, which corresponds to a linear program (LP) that can be solved using modern LP techniques, ...
متن کاملRecovery of Block-Sparse Representations from Noisy Observations via Orthogonal Matching Pursuit
We study the problem of recovering the sparsity pattern of block-sparse signals from noise-corrupted measurements. A simple, efficient recovery method, namely, a block-version of the orthogonal matching pursuit (OMP) method, is considered in this paper and its behavior for recovering the block-sparsity pattern is analyzed. We provide sufficient conditions under which the block-version of the OM...
متن کامل