Theoretical guarantees for graph sparse coding
type: Item
instance of: scholarly article
title: Theoretical guarantees for graph sparse coding
zbMATH Open document ID: 1448.94155
author: Yael Yankelevsky
author: Michael Elad
published in: Applied and Computational Harmonic Analysis
publication date: 2020-06-30T00:00:00Z
Mathematics Subject Classification ID: 94A29
Mathematics Subject Classification ID: 65F50
Mathematics Subject Classification ID: 90C31
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 7216390
zbMATH Keywords: sparse representations
zbMATH Keywords: graph sparse coding
zbMATH Keywords: graph regularization
zbMATH Keywords: manifold learning
zbMATH Keywords: signal recovery
zbMATH Keywords: orthogonal matching pursuit
zbMATH Keywords: basis pursuit
describes a project that uses: PDCO
MaRDI profile type: Publication
full work available at URL: j.acha.2019.03.003
OpenAlex ID: W2931006236
cites work: Image Deblurring and Super-Resolution by Adaptive Sparse Domain Selection and Adaptive Regularization
cites work: Image Super-Resolution Via Sparse Representation
cites work: Learning with Structured Sparsity
cites work: Robust Recovery of Signals From a Structured Union of Subspaces
cites work: Structured Compressed Sensing: From Theory to Applications
cites work: Theoretical Results on Sparse Representations of Multiple-Measurement Vectors
cites work: Algorithms for simultaneous sparse approximation. I: Greedy pursuit
cites work: Algorithms for simultaneous sparse approximation. II: Convex relaxation
cites work: Atoms of all channels, unite! Average case analysis of multi-channel sparse recovery using greedy algorithms
cites work: Laplacian Eigenmaps for Dimensionality Reduction and Data Representation
cites work: Diffusion maps
cites work: Local and nonlocal discrete regularization on weighted graphs for image and mesh processing
cites work: Graph Regularized Sparse Coding for Image Representation
cites work: A General Framework for Regularized, Similarity-Based Image Restoration
cites work: Progressive Image Denoising Through Hybrid Graph Laplacian Regularization: A Unified Framework
cites work: Prediction of Partially Observed Dynamical Processes Over Networks via Dictionary Learning
cites work: Finding GEMS: Multi-Scale Dictionaries For High-Dimensional Graph Signals
cites work: Distributed Optimization and Statistical Learning via the Alternating Direction Method of Multipliers
cites work: Decoding by Linear Programming
cites work: RIP-Based Near-Oracle Performance Guarantees for SP, CoSaMP, and IHT
cites work: On Lebesgue-type inequalities for greedy approximation
cites work: Sparse and Redundant Representations
cites work: Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
cites work: Compressed Sensing: How Sharp Is the Restricted Isometry Property?
cites work: Atomic decomposition by basis pursuit
cites work: Working Locally Thinking Globally: Theoretical Guarantees for Convolutional Sparse Coding
cites work: Stable recovery of sparse overcomplete representations in the presence of noise
cites work: Just relax: convex programming methods for identifying sparse signals in noise
cites work: Greed is Good: Algorithmic Results for Sparse Approximation
cites work: An iterative thresholding algorithm for linear inverse problems with a sparsity constraint
cites work: A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems
cites work: From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
cites work: Convergence Properties of the Spline Fit
Wikidata QID: Q128102175
DOI: 10.1016/J.ACHA.2019.03.003
description: scientific article; zbMATH DE number 7216390