Working Locally Thinking Globally: Theoretical Guarantees for Convolutional Sparse Coding

DOI10.1109/TSP.2017.2733447zbMath1414.94462arXiv1707.06066OpenAlexW2464641472MaRDI QIDQ4621924

Vardan Papyan, Jeremias Sulam, Michael Elad

Publication date: 8 February 2019

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

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

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Source coding (94A29)

Related Items (9)

Convergence of slice-based block coordinate descent algorithm for convolutional sparse coding ⋮ Adversarial noise attacks of deep learning architectures: stability analysis via sparse-modeled signals ⋮ First- and Second-Order Methods for Online Convolutional Dictionary Learning ⋮ Solving inverse problems using data-driven models ⋮ A Greedy Approach to $\ell_{0,\infty}$-Based Convolutional Sparse Coding ⋮ Theoretical guarantees for graph sparse coding ⋮ Unnamed Item ⋮ Maximal Function Pooling with Applications ⋮ Multi-Layer Sparse Coding: The Holistic Way

This page was built for publication: Working Locally Thinking Globally: Theoretical Guarantees for Convolutional Sparse Coding