Compressive Sensing (Q2789803)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	Compressive Sensing	scientific article

Statements

scholarly article

Compressive Sensing (English)

Massimo Fornasier

Handbook of Mathematical Methods in Imaging

publication date

2 March 2016

describes a project that uses

MaRDI profile type

MaRDI publication profile

full work available at URL

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

Random projections of regular simplices

On signal reconstruction without phase

A simple proof of the restricted isometry property for random matrices

A Fast Iterative Shrinkage-Thresholding Algorithm for Linear Inverse Problems

Phase transitions for greedy sparse approximation algorithms

Iterative hard thresholding for compressed sensing

Explicit constructions of RIP matrices and related problems

A Singular Value Thresholding Algorithm for Matrix Completion

The restricted isometry property and its implications for compressed sensing

Exact matrix completion via convex optimization

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

Stable signal recovery from incomplete and inaccurate measurements

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

Atomic Decomposition by Basis Pursuit

An introduction to frames and Riesz bases

Rate of Convergence of Lawson's Algorithm

Compressed sensing and best 𝑘-term approximation

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

Iteratively reweighted least squares minimization for sparse recovery

Compressed sensing

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

High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension

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

Uncertainty principles and ideal atomic decomposition

Signal Recovery and the Large Sieve

Neighborliness of randomly projected simplices in high dimensions

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

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

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

Least angle regression. (With discussion)

A generalized uncertainty principle and sparse representation in pairs of bases

On compressive sensing applied to radar

Compressed Remote Sensing of Sparse Objects

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

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

A convergent overlapping domain decomposition method for total variation minimization

Low-rank Matrix Recovery via Iteratively Reweighted Least Squares Minimization

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

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

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

On Sparse Representations in Arbitrary Redundant Bases

NORMS OF RANDOM MATRICES AND WIDTHS OF FINITE-DIMENSIONAL SETS

Convergence of fixed-point continuation algorithms for matrix rank minimization

Sparse representations in unions of bases

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

Remote sensing via \(\ell_1\)-minimization

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

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

Matching pursuits with time-frequency dictionaries

Sparse Approximate Solutions to Linear Systems

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

A new approach to variable selection in least squares problems

Sparsity in time-frequency representations

The restricted isometry property for time-frequency structured random matrices

Random sampling of sparse trigonometric polynomials

Stability Results for Random Sampling of Sparse Trigonometric Polynomials

Restricted isometries for partial random circulant matrices

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

Compressive Sensing by Random Convolution

On sparse reconstruction from Fourier and Gaussian measurements

Nonlinear total variation based noise removal algorithms

Linear Inversion of Band-Limited Reflection Seismograms

Grassmannian frames with applications to coding and communication

Selecting a proportion of characters

Greed is Good: Algorithmic Results for Sparse Approximation

CoSaMP: Iterative signal recovery from incomplete and inaccurate samples

Probing the Pareto Frontier for Basis Pursuit Solutions

Widths of embeddings in function spaces

Identifiers

Sitelinks

Mathematics(1 entry)

mardi Publication:2789803

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