Sampling in the analysis transform domain (Q900778)

From MaRDI portal

Revision as of 06:36, 11 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Sampling in the analysis transform domain	scientific article

Statements

scholarly article

0 references

Sampling in the analysis transform domain (English)

0 references

0 references

Applied and Computational Harmonic Analysis

0 references

publication date

22 December 2015

0 references

full work available at URL

https://arxiv.org/abs/1410.6558

0 references

zbMATH Keywords

sparse representations

0 references

compressed sensing

0 references

synthesis

0 references

analysis

0 references

transform domain

0 references

describes a project that uses

0 references

0 references

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images

0 references

Modern statistical estimation via oracle inequalities

0 references

Adaptive greedy approximations

0 references

Sparse and Redundant Representations

0 references

A mathematical introduction to compressive sensing

0 references

Matching pursuits with time-frequency dictionaries

0 references

Decoding by Linear Programming

0 references

Stable recovery of sparse overcomplete representations in the presence of noise

0 references

Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?

0 references

CoSaMP: Iterative signal recovery from incomplete and inaccurate samples

0 references

Subspace Pursuit for Compressive Sensing Signal Reconstruction

0 references

Iterative hard thresholding for compressed sensing

0 references

Hard Thresholding Pursuit: An Algorithm for Compressive Sensing

0 references

Sparse Recovery With Orthogonal Matching Pursuit Under RIP

0 references

A simple proof of the restricted isometry property for random matrices

0 references

Analysis versus synthesis in signal priors

0 references

The cosparse analysis model and algorithms

0 references

Compressed sensing with coherent and redundant dictionaries

0 references

Compressed Sensing With General Frames via Optimal-Dual-Based $\ell _{1}$-Analysis

0 references

Greedy-like algorithms for the cosparse analysis model

0 references

Stable Image Reconstruction Using Total Variation Minimization

0 references

Near-Optimal Compressed Sensing Guarantees for Total Variation Minimization

0 references

Stable and Robust Sampling Strategies for Compressive Imaging

0 references

Compressed Sensing and Redundant Dictionaries

0 references

Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ <sup>1</sup> minimization

0 references

Signal Space CoSaMP for Sparse Recovery With Redundant Dictionaries

0 references

Greedy signal space methods for incoherence and beyond

0 references

Approximation-Tolerant Model-Based Compressive Sensing

0 references

The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).

0 references

Simultaneous analysis of Lasso and Dantzig selector

0 references

Coherence-Based Performance Guarantees for Estimating a Sparse Vector Under Random Noise

0 references

RIP-Based Near-Oracle Performance Guarantees for SP, CoSaMP, and IHT

0 references

Efficient and Robust Compressed Sensing Using Optimized Expander Graphs

0 references

On the Reconstruction of Block-Sparse Signals With an Optimal Number of Measurements

0 references

Robust Recovery of Signals From a Structured Union of Subspaces

0 references

Algorithms for simultaneous sparse approximation. I: Greedy pursuit

0 references

Model-Based Compressive Sensing

0 references

Analysis Operator Learning and its Application to Image Reconstruction

0 references

Graph Implementations for Nonsmooth Convex Programs

0 references

Fixed-Point Continuation for $\ell_1$-Minimization: Methodology and Convergence

0 references

Bregman Iterative Algorithms for $\ell_1$-Minimization with Applications to Compressed Sensing

0 references

Sparse Reconstruction by Separable Approximation

0 references

Probing the Pareto Frontier for Basis Pursuit Solutions

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

Alternating Direction Algorithms for $\ell_1$-Problems in Compressive Sensing

0 references

NESTA: A Fast and Accurate First-Order Method for Sparse Recovery

0 references

Optimization with Sparsity-Inducing Penalties

0 references

A Multilevel Iterated-Shrinkage Approach to $l_{1}$ Penalized Least-Squares Minimization

0 references

Smoothing and Decomposition for Analysis Sparse Recovery

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.acha.2015.04.004

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:900778

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q900778&oldid=36220033"