Compressive Sensing (Q2789803)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Compressive Sensing	scientific article

Statements

scholarly article

0 references

Compressive Sensing (English)

0 references

Massimo Fornasier

0 references

0 references

Handbook of Mathematical Methods in Imaging

0 references

publication date

2 March 2016

0 references

describes a project that uses

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-1-4939-0790-8_6

0 references

Random projections of regular simplices

0 references

On signal reconstruction without phase

0 references

A simple proof of the restricted isometry property for random matrices

0 references

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

0 references

Phase transitions for greedy sparse approximation algorithms

0 references

Iterative hard thresholding for compressed sensing

0 references

Explicit constructions of RIP matrices and related problems

0 references

0 references

A Singular Value Thresholding Algorithm for Matrix Completion

0 references

The restricted isometry property and its implications for compressed sensing

0 references

Exact matrix completion via convex optimization

0 references

Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information

0 references

Stable signal recovery from incomplete and inaccurate measurements

0 references

A first-order primal-dual algorithm for convex problems with applications to imaging

0 references

Atomic Decomposition by Basis Pursuit

0 references

An introduction to frames and Riesz bases

0 references

Rate of Convergence of Lawson's Algorithm

0 references

Compressed sensing and best 𝑘-term approximation

0 references

An iterative thresholding algorithm for linear inverse problems with a sparsity constraint

0 references

Iteratively reweighted least squares minimization for sparse recovery

0 references

Compressed sensing

0 references

For most large underdetermined systems of linear equations the minimal 𝓁<sub>1</sub>‐norm solution is also the sparsest solution

0 references

High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension

0 references

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

0 references

Uncertainty principles and ideal atomic decomposition

0 references

Signal Recovery and the Large Sieve

0 references

Neighborliness of randomly projected simplices in high dimensions

0 references

Counting faces of randomly projected polytopes when the projection radically lowers dimension

0 references

Fast Solution of $\ell _{1}$-Norm Minimization Problems When the Solution May Be Sparse

0 references

On the Numerical Solution of Heat Conduction Problems in Two and Three Space Variables

0 references

Least angle regression. (With discussion)

0 references

A generalized uncertainty principle and sparse representation in pairs of bases

0 references

On compressive sensing applied to radar

0 references

Compressed Remote Sensing of Sparse Objects

0 references

Restoration of Color Images by Vector Valued BV Functions and Variational Calculus

0 references

The application of joint sparsity and total variation minimization algorithms to a real-life art restoration problem

0 references

A convergent overlapping domain decomposition method for total variation minimization

0 references

Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization

0 references

A note on guaranteed sparse recovery via \(\ell_1\)-minimization

0 references

Sparsest solutions of underdetermined linear systems via \( \ell _q\)-minimization for \(0<q\leqslant 1\)

0 references

The Gelfand widths of \(\ell_p\)-balls for \(0 < p \leq 1\)

0 references

On Sparse Representations in Arbitrary Redundant Bases

0 references

0 references

0 references

NORMS OF RANDOM MATRICES AND WIDTHS OF FINITE-DIMENSIONAL SETS

0 references

Convergence of fixed-point continuation algorithms for matrix rank minimization

0 references

Sparse representations in unions of bases

0 references

Convergence Analysis of Primal-Dual Algorithms for a Saddle-Point Problem: From Contraction Perspective

0 references

0 references

Remote sensing via \(\ell_1\)-minimization

0 references

0 references

DIAMETERS OF SOME FINITE-DIMENSIONAL SETS AND CLASSES OF SMOOTH FUNCTIONS

0 references

0 references

New and Improved Johnson–Lindenstrauss Embeddings via the Restricted Isometry Property

0 references

0 references

0 references

Matching pursuits with time-frequency dictionaries

0 references

Sparse Approximate Solutions to Linear Systems

0 references

Optimal recovery and \(n\)-widths for convex classes of functions

0 references

A new approach to variable selection in least squares problems

0 references

Sparsity in time-frequency representations

0 references

The restricted isometry property for time-frequency structured random matrices

0 references

Random sampling of sparse trigonometric polynomials

0 references

Stability Results for Random Sampling of Sparse Trigonometric Polynomials

0 references

Restricted isometries for partial random circulant matrices

0 references

Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization

0 references

Compressive Sensing by Random Convolution

0 references

On sparse reconstruction from Fourier and Gaussian measurements

0 references

Nonlinear total variation based noise removal algorithms

0 references

Linear Inversion of Band-Limited Reflection Seismograms

0 references

Grassmannian frames with applications to coding and communication

0 references

Selecting a proportion of characters

0 references

0 references

0 references

Greed is Good: Algorithmic Results for Sparse Approximation

0 references

CoSaMP: Iterative signal recovery from incomplete and inaccurate samples

0 references

Probing the Pareto Frontier for Basis Pursuit Solutions

0 references

Widths of embeddings in function spaces

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-1-4939-0790-8_6

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2789803

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