Sampling and Reconstructing Signals From a Union of Linear Subspaces
From MaRDI portal
Publication:5273562
DOI10.1109/TIT.2011.2146550zbMath1365.94173arXiv0911.3514OpenAlexW2100875869MaRDI QIDQ5273562
Publication date: 12 July 2017
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0911.3514
Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Numerical solutions of ill-posed problems in abstract spaces; regularization (65J20) Sampling theory in information and communication theory (94A20)
Related Items
Cosparsity in Compressed Sensing, Analysis vs synthesis with structure -- an investigation of union of subspace models on graphs, Reconstruction of sparse signals in impulsive disturbance environments, Generalizing CoSaMP to signals from a union of low dimensional linear subspaces, Time for dithering: fast and quantized random embeddings via the restricted isometry property, Compressive sensing of analog signals using discrete prolate spheroidal sequences, Stable recovery of low-dimensional cones in Hilbert spaces: one RIP to rule them all, Nonlinear frames and sparse reconstructions in Banach spaces, Dimensionality reduction with subgaussian matrices: a unified theory, Reduced row echelon form and non-linear approximation for subspace segmentation and high-dimensional data clustering, Dictionary-sparse recovery via thresholding-based algorithms, CoverBLIP: accelerated and scalable iterative matched-filtering for magnetic resonance fingerprint reconstruction*, Uniform recovery of fusion frame structured sparse signals, Jointly low-rank and bisparse recovery: Questions and partial answers, Greedy approximate projection for magnetic resonance fingerprinting with partial volumes, The basins of attraction of the global minimizers of the non-convex sparse spike estimation problem, Near oracle performance and block analysis of signal space greedy methods, Greedy signal space methods for incoherence and beyond
