Dictionary learning under global sparsity constraint

Details Dictionary learning under global sparsity constraint Dictionary learning under global sparsity constraint

2012-02-29

arxiv.org/abs/1202.6562v1

Computer Science

Data Structures and Algorithms

27 pages, 9 figures, 1 table

Scientific paper

A new method is proposed in this paper to learn overcomplete dictionary from training data samples. Differing from the current methods that enforce similar sparsity constraint on each of the input samples, the proposed method attempts to impose global sparsity constraint on the entire data set. This enables the proposed method to fittingly assign the atoms of the dictionary to represent various samples and optimally adapt to the complicated structures underlying the entire data set. By virtue of the sparse coding and sparse PCA techniques, a simple algorithm is designed for the implementation of the method. The efficiency and the convergence of the proposed algorithm are also theoretically analyzed. Based on the experimental results implemented on a series of signal and image data sets, it is apparent that our method performs better than the current dictionary learning methods in original dictionary recovering, input data reconstructing, and salient data structure revealing.

Affiliated with

Also associated with

No associations

Rating

Dictionary learning under global sparsity constraint does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Dictionary learning under global sparsity constraint, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Dictionary learning under global sparsity constraint will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-524249