Parametric Dictionary Design for Sparse Coding

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dictionary Learning for L1-Exact Sparse Coding

We have derived a new algorithm for dictionary learning for sparse coding in the l1 exact sparse framework. The algorithm does not rely on an approximation residual to operate, but rather uses the special geometry of the l1 exact sparse solution to give a computationally simple yet conceptually interesting algorithm. A self-normalizing version of the algorithm is also derived, which uses negati...

متن کامل

Non-Parametric Bayesian Dictionary Learning for Sparse Image Representations

Non-parametric Bayesian techniques are considered for learning dictionaries for sparse image representations, with applications in denoising, inpainting and compressive sensing (CS). The beta process is employed as a prior for learning the dictionary, and this non-parametric method naturally infers an appropriate dictionary size. The Dirichlet process and a probit stick-breaking process are als...

متن کامل

A Convergent Incoherent Dictionary Learning Algorithm for Sparse Coding

Recently, sparse coding has been widely used in many applications ranging from image recovery to pattern recognition. The low mutual coherence of a dictionary is an important property that ensures the optimality of the sparse code generated from this dictionary. Indeed, most existing dictionary learning methods for sparse coding either implicitly or explicitly tried to learn an incoherent dicti...

متن کامل

[Supplementary Material] Submodular Dictionary Learning for Sparse Coding

1. Proofs of the Monotonicity and Submodu-larity Properties of Entropy Rate H(A) Recall our definition of H(A): H(A) = − i µ i j P i,j (A) log P i,j (A) (1) where µ i is the stationary probability of v i in the stationary distribution µ and P i,j (A) is the transition probability from v i to v j with respect to A. We prove that H(A) is monotonically increasing by showing H(A ∪ {a}) ≥ H(A), for ...

متن کامل

Sparse coding and dictionary learning for image understanding

Sparse coding---that is, modeling data vectors as sparse linear combinations of dictionary elements---is widely used in machine learning, neuroscience, signal processing, and statistics. This talk addresses the problem of learning the dictionary, adapting it to specific data and image understanding tasks. In particular, I will present a fast on-line approach to unsupervised dictionary learning ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Signal Processing

سال: 2009

ISSN: 1053-587X,1941-0476

DOI: 10.1109/tsp.2009.2026610