Universal Regularizers For Robust Sparse Coding and Modeling

Details Universal Regularizers For Robust Sparse Coding and Modeling Universal Regularizers For Robust Sparse Coding and Modeling

2010-03-15

arxiv.org/abs/1003.2941v2

Computer Science

Information Theory

Scientific paper

Sparse data models, where data is assumed to be well represented as a linear combination of a few elements from a dictionary, have gained considerable attention in recent years, and their use has led to state-of-the-art results in many signal and image processing tasks. It is now well understood that the choice of the sparsity regularization term is critical in the success of such models. Based on a codelength minimization interpretation of sparse coding, and using tools from universal coding theory, we propose a framework for designing sparsity regularization terms which have theoretical and practical advantages when compared to the more standard l0 or l1 ones. The presentation of the framework and theoretical foundations is complemented with examples that show its practical advantages in image denoising, zooming and classification.

Affiliated with

Also associated with

No associations

Rating

Universal Regularizers For Robust Sparse Coding and Modeling 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 Universal Regularizers For Robust Sparse Coding and Modeling, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Universal Regularizers For Robust Sparse Coding and Modeling will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-214562