Universal Regularizers for Robust Sparse Coding and Modeling

DOI10.1109/TIP.2012.2197006MaRDI QIDQ5373035zbMATH OpenDBLPWikidataFDO

Authors Ignacio Ramírez, Guillermo Sapiro

Publication date 27 October 2017

Published in IEEE Transactions on Image Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1003.2941

Mathematics Subject Classification ID

Sampling theory in information and communication theory (94A20)

Abstract: 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.

Cited in

(4)

• Image restoration via simultaneous sparse coding: where structured sparsity meets Gaussian scale mixture
• scientific article; zbMATH DE number 6982332 (Why is no real title available?)
• A Bregman stochastic method for nonconvex nonsmooth problem beyond global Lipschitz gradient continuity
• A generalized inertial proximal alternating linearized minimization method for nonconvex nonsmooth problems

This page was built for publication: Universal Regularizers for Robust Sparse Coding and Modeling

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5373035)