Sparse approximation

About: Sparse approximation is a research topic. Over the lifetime, 18037 publications have been published within this topic receiving 497739 citations. The topic is also known as: Sparse approximation.

Compressive Sensing Based Separation of Nonstationary and Stationary Signals Overlapping in Time-Frequency

Abstract: A compressive sensing (CS) approach for nonstationary signal separation is proposed. This approach is motivated by challenges in radar signal processing, including separations of micro-Doppler and main body signatures. We consider the case where the signal of interest assumes sparse representation over a given basis. Other signals present in the data overlap with the desired signal in the time and frequency domains, disallowing conventional windowing or filtering operations to be used for desired signal recovery. The proposed approach uses linear time-frequency representations to reveal the data local behavior. Using the L-statistics, only the time-frequency (TF) points that belong to the desired signal are retained, whereas the common points and others pertaining only to the undesired signals are deemed inappropriate and cast as missing samples. These samples amount to reduced frequency observations in the TF domain. The linear relationship between the measurement and sparse domains permits the application of CS techniques to recover the desired signal without significant distortion. We focus on sinusoidal desired signals with sparse frequency-domain representation but show that the analysis can be straightforwardly generalized to nonsinusoidal signals with known structures. Several examples are provided to demonstrate the effectiveness of the proposed approach.

Approximate Orthogonal Sparse Embedding for Dimensionality Reduction

Abstract: Locally linear embedding (LLE) is one of the most well-known manifold learning methods. As the representative linear extension of LLE, orthogonal neighborhood preserving projection (ONPP) has attracted widespread attention in the field of dimensionality reduction. In this paper, a unified sparse learning framework is proposed by introducing the sparsity or $L_{1}$ -norm learning, which further extends the LLE-based methods to sparse cases. Theoretical connections between the ONPP and the proposed sparse linear embedding are discovered. The optimal sparse embeddings derived from the proposed framework can be computed by iterating the modified elastic net and singular value decomposition. We also show that the proposed model can be viewed as a general model for sparse linear and nonlinear (kernel) subspace learning. Based on this general model, sparse kernel embedding is also proposed for nonlinear sparse feature extraction. Extensive experiments on five databases demonstrate that the proposed sparse learning framework performs better than the existing subspace learning algorithm, particularly in the cases of small sample sizes.

Fast L1-Minimization Algorithms For Robust Face Recognition

Abstract: L1-minimization refers to finding the minimum L1-norm solution to an underdetermined linear system b=Ax. Under certain conditions as described in compressive sensing theory, the minimum L1-norm solution is also the sparsest solution. In this paper, our study addresses the speed and scalability of its algorithms. In particular, we focus on the numerical implementation of a sparsity-based classification framework in robust face recognition, where sparse representation is sought to recover human identities from very high-dimensional facial images that may be corrupted by illumination, facial disguise, and pose variation. Although the underlying numerical problem is a linear program, traditional algorithms are known to suffer poor scalability for large-scale applications. We investigate a new solution based on a classical convex optimization framework, known as Augmented Lagrangian Methods (ALM). The new convex solvers provide a viable solution to real-world, time-critical applications such as face recognition. We conduct extensive experiments to validate and compare the performance of the ALM algorithms against several popular L1-minimization solvers, including interior-point method, Homotopy, FISTA, SESOP-PCD, approximate message passing (AMP) and TFOCS. To aid peer evaluation, the code for all the algorithms has been made publicly available.

Convolutional Dictionary Learning: A Comparative Review and New Algorithms

Abstract: Convolutional sparse representations are a form of sparse representation with a dictionary that has a structure that is equivalent to convolution with a set of linear filters. While effective algorithms have recently been developed for the convolutional sparse coding problem, the corresponding dictionary learning problem is substantially more challenging. Furthermore, although a number of different approaches have been proposed, the absence of thorough comparisons between them makes it difficult to determine which of them represents the current state of the art. The present work both addresses this deficiency and proposes some new approaches that outperform existing ones in certain contexts. A thorough set of performance comparisons indicates a very wide range of performance differences among the existing and proposed methods, and clearly identifies those that are the most effective.