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)- Duality of nonconvex optimization with positively homogeneous functions
- An improved set-membership proportionate adaptive algorithm for a block-sparse system
- Recovery of block sparse signals under the conditions on block RIC and ROC by BOMP and BOMMP
- Sparse blind deconvolution and demixing through \(\ell_{1,2}\)-minimization
- Sparse support recovery using correlation information in the presence of additive noise
- A sharp recovery condition for block sparse signals by block orthogonal multi-matching pursuit
- Compressed sensing with structured sparsity and structured acquisition
- Recovery analysis for weighted mixed \(\ell_2 / \ell_p\) minimization with \(0 < p \leq 1\)
- Greedy subspace pursuit for joint sparse recovery
- Reducing effects of bad data using variance based joint sparsity recovery
- Stable recovery of low-dimensional cones in Hilbert spaces: one RIP to rule them all
- Robust group lasso: model and recoverability
- L_q-closest-point to affine subspaces using the generalized Weiszfeld algorithm
- Compressed sensing of color images
- Block orthogonal greedy algorithm for stable recovery of block-sparse signal representations
- Compressing sensing based source localization for controlled acoustic signals using distributed microphone arrays
- On recovery guarantees for one-bit compressed sensing on manifolds
- Hierarchical compressed sensing
- Hierarchical isometry properties of hierarchical measurements
- Sparse Bayesian learning for network structure reconstruction based on evolutionary game data
- The restricted isometry property of block diagonal matrices for group-sparse signal recovery
- Generalizing CoSaMP to signals from a union of low dimensional linear subspaces
- Block-sparse recovery of semidefinite systems and generalized null space conditions
- Group sparse recovery in impulsive noise via alternating direction method of multipliers
- A perturbation analysis of nonconvex block-sparse compressed sensing
- A perturbation analysis based on group sparse representation with orthogonal matching pursuit
- Discrete optimization methods for group model selection in compressed sensing
- Convergence and stability analysis of iteratively reweighted least squares for noisy block sparse recovery
- A parallel proximal splitting method for disparity estimation from multicomponent images under illumination variation
- Reduced row echelon form and non-linear approximation for subspace segmentation and high-dimensional data clustering
- An efficient Hessian based algorithm for solving large-scale sparse group Lasso problems
- A note on block-sparse signal recovery with coherent tight frames
- A simple Gaussian measurement bound for exact recovery of block-sparse signals
- Optimization problems involving group sparsity terms
- Sharp sufficient conditions for stable recovery of block sparse signals by block orthogonal matching pursuit
- Near oracle performance and block analysis of signal space greedy methods
- A new direction-of-arrival estimation method exploiting signal structure information
- A new bound on the block restricted isometry constant in compressed sensing
- Arbitrary block-sparse signal reconstruction based on incomplete single measurement vector
- On optimal wavelet reconstructions from Fourier samples: linearity and universality of the stable sampling rate
- Phase retrieval: stability and recovery guarantees
- Low-rank and joint-sparse signal recovery using sparse Bayesian learning in a WBAN
- On the strong convergence of forward-backward splitting in reconstructing jointly sparse signals
- Retraction-based first-order feasible methods for difference-of-convex programs with smooth inequality and simple geometric constraints
- A Compressive Sensing Based Analysis of Anomalies in Generalized Linear Models
- A perturbation analysis of block-sparse compressed sensing via mixed _2/_1 minimization
- Subspace Recovery From Structured Union of Subspaces
- On optimal estimate of the block orthogonal greedy algorithm for g-frames
- Sparsity based methods for overparameterized variational problems
- A survey of compressed sensing
- The quest for optimal sampling: computationally efficient, structure-exploiting measurements for compressed sensing
- Structured sparsity: discrete and convex approaches
- Block sparse recovery via mixed l₂/l₁ minimization
- Improved FOCUSS method for reconstruction of cluster structured sparse signals in radar imaging
- Robust visual tracking with structured sparse representation appearance model
- Compressive sensing of analog signals using discrete prolate spheroidal sequences
- Robust Recovery of Temporally Smooth Signals From Under-Determined Multiple Measurements
- Representation and coding of signal geometry
- Near-optimal estimation of simultaneously sparse and low-rank matrices from nested linear measurements
- An efficient matrix bi-factorization alternative optimization method for low-rank matrix recovery and completion
- Joint sparse recovery based on variances
- Distributed Robust Subspace Recovery
- A multiple measurement vector approach to synthetic aperture radar imaging
- On the null space property of \(l_q\)-minimization for \(0 < q \leq 1\) in compressed sensing
- Sparsity-Based MIMO Radars
- Robust width: a characterization of uniformly stable and robust compressed sensing
- Estimation of block sparsity in compressive sensing
- Difference-of-Convex Algorithms for a Class of Sparse Group \ell₀ Regularized Optimization Problems
- Composition-aware spectroscopic tomography
- TV-based reconstruction of periodic functions
- Two-stage approach to multivariate linear regression with sparsely mismatched data
- Dimensionality reduction with subgaussian matrices: a unified theory
- Image reconstruction using analysis model prior
- Stable Recovery of Structured Signals From Corrupted Sub-Gaussian Measurements
- Nonuniform recovery of fusion frame structured sparse signals
- Block-sparse compressed sensing: non-convex model and iterative re-weighted algorithm
- Surveying and comparing simultaneous sparse approximation (or group-lasso) algorithms
- Sparse learning of partial differential equations with structured dictionary matrix
- Weighted \(l_p- l_1\) minimization methods for block sparse recovery and rank minimization
- Local optimality for stationary points of group zero-norm regularized problems and equivalent surrogates
- Block sparse signal recovery via minimizing the block q-ratio sparsity
- Block-sparse recovery and rank minimization using a weighted \(l_p-l_q\) model
- Sequential edge detection using joint hierarchical Bayesian learning
- Maximum turn‐off control for discrete‐time linear systems
- Block sparse design of distributed controllers for dynamical network systems
- Improved stability conditions of BOGA for noisy block-sparse signals
- Pareto-efficient designs for multi- and mixed-level supersaturated designs
- Moving force identification based on group Lasso and compressed sensing
- Stable recovery of approximately block \(k\)-sparse signals with partial block support information via weighted \(\ell_2/\ell_p\) (\(0 < p \leq 1\)) minimization
- High-order block RIP for nonconvex block-sparse compressed sensing
- The stable reconstruction of strongly-decaying block sparse signals
- k block sparse vector recovery via block _1-_2 minimization
- Constrained mix sparse optimization via hard thresholding pursuit
- Iteratively reweighted least squares for block sparse signal recovery with unconstrained \(l_{2,p}\) minimization
- Group projected subspace pursuit for block sparse signal reconstruction: convergence analysis and applications
- Nonlinear frames and sparse reconstructions in Banach spaces
- An extended ADMM for 3-block nonconvex nonseparable problems with applications
- Levenberg-Marquardt hard thresholding pursuit for sparse bilinear inverse problems
- Adaptive sieving: a dimension reduction technique for sparse optimization problems
- Computing the proximal operator of the \(q\)-th power of the \(\ell_{1,q} \)-norm for group sparsity
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)
