Dictionary Optimization for Block-Sparse Representations

DOI10.1109/TSP.2012.2187642MaRDI QIDQ4573690zbMATH OpenFDO

Authors Lihi Zelnik-Manor, Kevin Rosenblum, Y. C. Eldar

Publication date 18 July 2018

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

Full work available at URL https://doi.org/10.1109/TSP.2012.2187642

Mathematics Subject Classification ID

Numerical optimization and variational techniques (65K10) Sampling theory in information and communication theory (94A20)

Cited in

(7)

• An efficient algorithm for overcomplete sparsifying transform learning with signal denoising
• Structured overcomplete sparsifying transform learning with convergence guarantees and applications
• Efficient dictionary learning with sparseness-enforcing projections
• Block matching video compression based on sparse representation and dictionary learning
• Designing Structured Sparse Dictionaries for Sparse Representation Modeling
• FRIST-flipping and rotation invariant sparsifying transform learning and applications
• Learning a Gaussian mixture for sparsity regularization in inverse problems

This page was built for publication: Dictionary Optimization for Block-Sparse Representations

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