Computing and analyzing recoverable supports for sparse reconstruction (Q269197)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	Computing and analyzing recoverable supports for sparse reconstruction	scientific article

Statements

scholarly article

Computing and analyzing recoverable supports for sparse reconstruction (English)

Christian Kruschel

Advances in Computational Mathematics

publication date

18 April 2016

full work available at URL

https://arxiv.org/abs/1309.2460

zbMATH Keywords

sparse recovery

hypercube sections

phase transition

compressed sensing

describes a project that uses

MaRDI profile type

MaRDI publication profile

The minimum number of vertices of a simple polytope

On Projection Algorithms for Solving Convex Feasibility Problems

Diagrams for centrally symmetric polytopes

High-dimensional centrally symmetric polytopes with neighborliness proportional to dimension

Breakdown of equivalence between the minimal \(\ell^1\)-norm solution and the sparsest solution

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

A numerical exploration of compressed sampling recovery

A mathematical introduction to compressive sensing

On Sparse Representations in Arbitrary Redundant Bases

Convex Polytopes

Uncertainty principles and ideal atomic decomposition

Grassmannian frames with applications to coding and communication

Cutting the d-cube

On random sections of the cube

Constructing Test Instances for Basis Pursuit Denoising

Borsuk's theorem and the number of facets of centrally symmetric polytopes

Equiangular tight frames

The maximum numbers of faces of a convex polytope

Sparse representations in unions of bases

Hyperplane cuts of an n-cube

On Polar Polytopes and the Recovery of Sparse Representations

Atomic Decomposition by Basis Pursuit

Random projections of regular simplices

Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing

Recovery of Short, Complex Linear Combinations Via&lt;tex&gt;$ell _1$&lt;/tex&gt;Minimization

Lectures on Polytopes

Identifiers

Sitelinks

Mathematics(1 entry)

mardi Publication:269197

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