Efficient ADMM-Based Algorithms for Convolutional Sparse Coding

Convolutional sparse coding improves on the standard sparse approximation by incorporating a global shift-invariant model. The most efficient convolutional sparse coding methods are based on the alternating direction method of multipliers and the convolution theorem. The only major difference betwee...

Full description

Saved in:

Bibliographic Details
Published in:	IEEE signal processing letters Vol. 29; pp. 389 - 393
Main Authors:	Veshki, Farshad, Vorobyov, Sergiy
Format:	Journal Article
Language:	English
Published:	New York IEEE 2022 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Algorithms alternating direction method of multipliers Approximation Approximation algorithms Coding constrained sparse approximation Convolution Convolutional codes Convolutional sparse coding Dictionaries dictionary learning Image coding Machine learning Mathematical analysis Optimization Signal processing algorithms
ISSN:	1070-9908, 1558-2361
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!