Performance Guarantees of the Thresholding Algorithm for the Cosparse Analysis Model

DOI10.1109/TIT.2012.2226924zbMath1364.94152arXiv1203.2769MaRDI QIDQ2989384

Tomer Peleg, Michael Elad

Publication date: 8 June 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (9)

Image recovery via geometrically structured approximation ⋮ Sparsity Based Methods for Overparameterized Variational Problems ⋮ Compressive Sensing with Redundant Dictionaries and Structured Measurements ⋮ Cosparsity in Compressed Sensing ⋮ Greedy-like algorithms for the cosparse analysis model ⋮ Analysis sparse representation for nonnegative signals based on determinant measure by DC programming ⋮ A modified greedy analysis pursuit algorithm for the cosparse analysis model ⋮ Greedy signal space methods for incoherence and beyond ⋮ Multi-Layer Sparse Coding: The Holistic Way

This page was built for publication: Performance Guarantees of the Thresholding Algorithm for the Cosparse Analysis Model