Optimal non-linear models for sparsity and sampling
From MaRDI portal
Approximation by other special function classes (41A30) General harmonic expansions, frames (42C15) Spaces of measurable functions ((L^p)-spaces, Orlicz spaces, Köthe function spaces, Lorentz spaces, rearrangement invariant spaces, ideal spaces, etc.) (46E30) Linear operators on special spaces (weighted shifts, operators on sequence spaces, etc.) (47B37) Sampling theory in information and communication theory (94A20)
Abstract: Given a set of vectors (the data) in a Hilbert space H, we prove the existence of an optimal collection of subspaces minimizing the sum of the square of the distances between each vector and its closest subspace in the collection. This collection of subspaces gives the best sparse representation for the given data, in a sense defined in the paper, and provides an optimal model for sampling in union of subspaces. The results are proved in a general setting and then applied to the case of low dimensional subspaces of R^N and to infinite dimensional shift-invariant spaces in L^2(R^d). We also present an iterative search algorithm for finding the solution subspaces. These results are tightly connected to the new emergent theories of compressed sensing and dictionary design, signal models for signals with finite rate of innovation, and the subspace segmentation problem.
Recommendations
- Optimal nonlinear models
- On the existence of optimal unions of subspaces for data modeling and clustering
- Unions of subspaces for data modeling and subspace clustering
- Nonlinear least squares in \(\mathbb R^{N}\)
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
Cites work
- scientific article; zbMATH DE number 937467 (Why is no real title available?)
- $rm K$-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation
- A Theory for Sampling Signals From a Union of Subspaces
- A simple proof of the restricted isometry property for random matrices
- An introduction to frames and Riesz bases
- Compressed Sensing and Redundant Dictionaries
- Compressed sensing
- Deterministic constructions of compressed sensing matrices
- Estimation of Subspace Arrangements with Applications in Modeling and Segmenting Mixed Data
- Foundations of time-frequency analysis
- Greed is Good: Algorithmic Results for Sparse Approximation
- Matrix Analysis
- Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies?
- Nonuniform sampling and reconstruction in shift-invariant spaces
- On the uniqueness of overcomplete dictionaries, and a practical way to retrieve them
- Optimal shift invariant spaces and their Parseval frame generators
- Quantitative robust uncertainty principles and optimally sparse decompositions
- Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
- Sampling Moments and Reconstructing Signals of Finite Rate of Innovation: Shannon Meets Strang–Fix
- Sampling and reconstruction of signals with finite rate of innovation in the presence of noise
- Sparse representations in unions of bases
- The art of frame theory
- The structure of shift-invariant subspaces of \(L^2(\mathbb{R}^n)\)
Cited in
(14)- On the Numerical Computation of Certain Eigenfunctions of Time and Multiband Limiting
- Applied harmonic analysis and sparse approximation. Abstracts from the workshop held June 10--16, 2012.
- Nonlinear least squares in \(\mathbb R^{N}\)
- A complete characterization of optimal dictionaries for least squares representation
- Robust recovery of multiple subspaces by geometric \(l_{p}\) minimization
- Subspaces with extra invariance nearest to observed data
- Reduced row echelon form and non-linear approximation for subspace segmentation and high-dimensional data clustering
- Optimal nonlinear models
- Similarity matrix framework for data from union of subspaces
- On the existence of optimal unions of subspaces for data modeling and clustering
- Frames of translates with prescribed fine structure in shift invariant spaces
- Exact reconstruction of signals in evolutionary systems via spatiotemporal trade-off
- Sampling in a union of frame generated subspace
- Unions of subspaces for data modeling and subspace clustering
This page was built for publication: Optimal non-linear models for sparsity and sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q734950)
