Efficient Dictionary Learning via Very Sparse Random Projections
Performing signal processing tasks on compressive measurements of data has received great attention in recent years. In this paper, we extend previous work on compressive dictionary learning by showing that more general random projections may be used, including sparse ones. More precisely, we examine compressive K-means clustering as a special case of compressive dictionary learning and give theoretical guarantees for its performance for a very general class of random projections. We then propose a memory and computation efficient dictionary learning algorithm, specifically designed for analyzing large volumes of high-dimensional data, which learns the dictionary from very sparse random projections. Experimental results demonstrate that our approach allows for reduction of computational complexity and memory/data access, with controllable loss in accuracy.
Code (0)
등록된 구현이 없습니다.
Tasks
ClusteringDictionary LearningMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Optimal Projections for Discriminative Dictionary Learning using the JL-lemma
Dimensionality reduction-based dictionary learning methods in the literature have often used iterative random projections. The dimensionality of such a random projection matrix is a random number that might not lead to a…
Dictionary LearningDimensionality ReductionFace RecognitionLEMMA+1Dictionary Learning Based on Sparse Distribution Tomography
We propose a new statistical dictionary learning algorithm for sparse signals that is based on an $\alpha$-stable innovation model. The parameters of the underlying model—that is, the atoms of the dictionary, the sp…
DenoisingDictionary LearningImage DenoisingDictionary and Image Recovery from Incomplete and Random Measurements
This paper tackles algorithmic and theoretical aspects of dictionary learning from incomplete and random block-wise image measurements and the performance of the adaptive dictionary for sparse image recovery. This proble…
compressed sensingDictionary LearningDiversityEfficient Dictionary Learning with Sparseness-Enforcing Projections
Learning dictionaries suitable for sparse coding instead of using engineered bases has proven effective in a variety of image processing tasks. This paper studies the optimization of dictionaries on image data where the …
DenoisingDictionary LearningRobust method for finding sparse solutions to linear inverse problems using an L2 regularization
We analyzed the performance of a biologically inspired algorithm called the Corrected Projections Algorithm (CPA) when a sparseness constraint is required to unambiguously reconstruct an observed signal using atoms from …
L2 Regularization