arrow
返回

Efficient ADMM-Based Algorithms for Convolutional Sparse Coding

delete2022-01-01
delete13
delete
OA
AI
F
Farshad G. Veshki
S
Sergiy A. Vorobyov *
DOI:10.1109/LSP.2021.3135196delete
delete原文链接
delete原文求助
delete分享
delete收藏
摘要

摘要

En 中文
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 between these methods is how they approach a convolutional least-squares fitting subproblem. In this letter, we present a novel solution for this subproblem, which improves the computational efficiency of the existing algorithms. The same approach is also used to develop an efficient dictionary learning method. In addition, we propose a novel algorithm for convolutional sparse coding with a constraint on the approximation error. Source codes for the proposed algorithms are available online.
Keyword:
Convolution
Signal processing algorithms
Dictionaries
Convolutional codes
Approximation algorithms
Optimization
Image coding
Convolutional sparse coding
constrained sparse approximation
dictionary learning
alternating direction method of multipliers

期刊

IEEE Signal Processing Magazine 封面图
IEEE Signal Processing Magazine
IF:
9.6
论文数:
1.1W
被引数:
1.7W

机构

A
Aalto University
学者数:
1.6W
论文数: 1.5W
被引数: 2.1W
引用论文

引用论文

Sparse Signal Processing Concepts for Efficient 5G System Design
err2015-01-01
err130
errOAAI
errWunder, Gerhard; Boche, Holger; Strohmer, Thomas; Jung, Peter
err分享
err收藏
Piano Transcription With Convolutional Sparse Lateral Inhibition
err2017-04-01
err13
errOAAI
errCogliati, Andrea; Duan, Zhiyao; Wohlberg, Brendt
err分享
err收藏
学者 查看更多内容