Robust Recovery of Signals From a Structured Union of Subspaces
From MaRDI portal
Abstract: Traditional sampling theories consider the problem of reconstructing an unknown signal from a series of samples. A prevalent assumption which often guarantees recovery from the given measurements is that lies in a known subspace. Recently, there has been growing interest in nonlinear but structured signal models, in which lies in a union of subspaces. In this paper we develop a general framework for robust and efficient recovery of such signals from a given set of samples. More specifically, we treat the case in which lies in a sum of subspaces, chosen from a larger set of possibilities. The samples are modelled as inner products with an arbitrary set of sampling functions. To derive an efficient and robust recovery algorithm, we show that our problem can be formulated as that of recovering a block-sparse vector whose non-zero elements appear in fixed blocks. We then propose a mixed program for block sparse recovery. Our main result is an equivalence condition under which the proposed convex algorithm is guaranteed to recover the original signal. This result relies on the notion of block restricted isometry property (RIP), which is a generalization of the standard RIP used extensively in the context of compressed sensing. Based on RIP we also prove stability of our approach in the presence of noise and modelling errors. A special case of our framework is that of recovering multiple measurement vectors (MMV) that share a joint sparsity pattern. Adapting our results to this context leads to new MMV recovery methods as well as equivalence conditions under which the entire set can be determined efficiently.
Cited in
(only showing first 100 items - show all)- A perturbation analysis of nonconvex block-sparse compressed sensing
- Hierarchical isometry properties of hierarchical measurements
- Stable Recovery of Structured Signals From Corrupted Sub-Gaussian Measurements
- A note on block-sparse signal recovery with coherent tight frames
- Moving force identification based on group Lasso and compressed sensing
- Image reconstruction using analysis model prior
- Computing the proximal operator of the \(q\)-th power of the \(\ell_{1,q} \)-norm for group sparsity
- A new bound on the block restricted isometry constant in compressed sensing
- Difference-of-Convex Algorithms for a Class of Sparse Group \ell₀ Regularized Optimization Problems
- Block orthogonal greedy algorithm for stable recovery of block-sparse signal representations
- Near-optimal estimation of simultaneously sparse and low-rank matrices from nested linear measurements
- Stable recovery of approximately block \(k\)-sparse signals with partial block support information via weighted \(\ell_2/\ell_p\) (\(0 < p \leq 1\)) minimization
- The analysis of block joint sparse recovery using block signal space matching pursuit
- Nonlinear frames and sparse reconstructions in Banach spaces
- Block-sparse compressed sensing: non-convex model and iterative re-weighted algorithm
- Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
- Compressing sensing based source localization for controlled acoustic signals using distributed microphone arrays
- Compressed sensing of color images
- Hierarchical compressed sensing
- L_q-closest-point to affine subspaces using the generalized Weiszfeld algorithm
- Linearization of Lipschitz framings for Banach spaces
- Sparse learning of partial differential equations with structured dictionary matrix
- Reduced row echelon form and non-linear approximation for subspace segmentation and high-dimensional data clustering
- Block-sparse recovery of semidefinite systems and generalized null space conditions
- Sparsity based methods for overparameterized variational problems
- Dimensionality reduction with subgaussian matrices: a unified theory
- On optimal wavelet reconstructions from Fourier samples: linearity and universality of the stable sampling rate
- Greedy subspace pursuit for joint sparse recovery
- Recovery analysis for weighted mixed \(\ell_2 / \ell_p\) minimization with \(0 < p \leq 1\)
- Reducing effects of bad data using variance based joint sparsity recovery
- Block-sparse recovery and rank minimization using a weighted \(l_p-l_q\) model
- Duality of nonconvex optimization with positively homogeneous functions
- Joint sparse recovery based on variances
- Robust width: a characterization of uniformly stable and robust compressed sensing
- The quest for optimal sampling: computationally efficient, structure-exploiting measurements for compressed sensing
- A perturbation analysis based on group sparse representation with orthogonal matching pursuit
- Discrete optimization methods for group model selection in compressed sensing
- Composition-aware spectroscopic tomography
- High-order block RIP for nonconvex block-sparse compressed sensing
- Sparse Bayesian learning for network structure reconstruction based on evolutionary game data
- Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit
- Stable recovery of low-dimensional cones in Hilbert spaces: one RIP to rule them all
- Convergence and stability analysis of iteratively reweighted least squares for noisy block sparse recovery
- scientific article; zbMATH DE number 7306893 (Why is no real title available?)
- Gelfand numbers related to structured sparsity and Besov space embeddings with small mixed smoothness
- Similarity matrix framework for data from union of subspaces
- Regularised estimation for ARMAX process with measurements subject to outliers
- On recovery guarantees for one-bit compressed sensing on manifolds
- The stable reconstruction of strongly-decaying block sparse signals
- Near oracle performance and block analysis of signal space greedy methods
- Local optimality for stationary points of group zero-norm regularized problems and equivalent surrogates
- Nonuniform recovery of fusion frame structured sparse signals
- Estimation of block sparsity in compressive sensing
- A Compressive Sensing Based Analysis of Anomalies in Generalized Linear Models
- On optimal estimate of the block orthogonal greedy algorithm for g-frames
- Weighted \(l_p- l_1\) minimization methods for block sparse recovery and rank minimization
- Compressive sensing of analog signals using discrete prolate spheroidal sequences
- Block sparse design of distributed controllers for dynamical network systems
- Maximum turn‐off control for discrete‐time linear systems
- Block sparse signal recovery via minimizing the block q-ratio sparsity
- Optimization problems involving group sparsity terms
- A new direction-of-arrival estimation method exploiting signal structure information
- Multiple regression for matrix and vector predictors: models, theory, algorithms, and beyond
- k block sparse vector recovery via block _1-_2 minimization
- A randomized algorithm for model-based sparse signal recovery
- An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion
- Structured sparsity: discrete and convex approaches
- The restricted isometry property of block diagonal matrices for group-sparse signal recovery
- Low-rank and joint-sparse signal recovery using sparse Bayesian learning in a WBAN
- An improved set-membership proportionate adaptive algorithm for a block-sparse system
- Auto-calibration and biconvex compressive sensing with applications to parallel MRI
- An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
- Distributed Robust Subspace Recovery
- A multiple measurement vector approach to synthetic aperture radar imaging
- A perturbation analysis of block-sparse compressed sensing via mixed _2/_1 minimization
- An extended ADMM for 3-block nonconvex nonseparable problems with applications
- Robust group lasso: model and recoverability
- Levenberg-Marquardt hard thresholding pursuit for sparse bilinear inverse problems
- Sampling in the analysis transform domain
- A parallel proximal splitting method for disparity estimation from multicomponent images under illumination variation
- Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP
- A sharp recovery condition for block sparse signals by block orthogonal multi-matching pursuit
- TV-based reconstruction of periodic functions
- Constrained mix sparse optimization via hard thresholding pursuit
- Improved stability conditions of BOGA for noisy block-sparse signals
- The \(\ell_{2,q}\) regularized group sparse optimization: lower bound theory, recovery bound and algorithms
- Theoretical guarantees for graph sparse coding
- Block sparse recovery via mixed l₂/l₁ minimization
- Generalizing CoSaMP to signals from a union of low dimensional linear subspaces
- Sparsity-Based MIMO Radars
- Iteratively reweighted least squares for block sparse signal recovery with unconstrained \(l_{2,p}\) minimization
- A survey of compressed sensing
- Representation and coding of signal geometry
- On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing
- On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals
- Improved FOCUSS method for reconstruction of cluster structured sparse signals in radar imaging
- Compressed sensing with structured sparsity and structured acquisition
- Group projected subspace pursuit for block sparse signal reconstruction: convergence analysis and applications
- Pareto-efficient designs for multi- and mixed-level supersaturated designs
- Uniform recovery of fusion frame structured sparse signals
This page was built for publication: Robust Recovery of Signals From a Structured Union of Subspaces
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4974079)
