Analysis vs synthesis with structure -- an investigation of union of subspace models on graphs
From MaRDI portal
Publication:2155807
Abstract: We consider the problem of characterizing the `duality gap' between sparse synthesis- and cosparse analysis-driven signal models through the lens of spectral graph theory, in an effort to comprehend their precise equivalencies and discrepancies. By detecting and exploiting the inherent connectivity structure, and hence, distinct set of properties, of rank-deficient graph difference matrices such as the graph Laplacian, we are able to substantiate discrepancies between the cosparse analysis and sparse synthesis models, according to which the former constitutes a constrained and translated instance of the latter. In view of a general union of subspaces model, we conduct a study of the associated subspaces and their composition, which further facilitates the refinement of specialized uniqueness and recovery guarantees, and discover an underlying structured sparsity model based on the graph incidence matrix. Furthermore, for circulant graphs, we provide an exact characterization of underlying subspaces by deriving closed-form expressions as well as demonstrating transitional properties between equivalence and non-equivalence for a parametric generalization of the graph Laplacian.
Recommendations
- The cosparse analysis model and algorithms
- Sampling in the analysis transform domain
- Analysis versus synthesis in signal priors
- One condition for solution uniqueness and robustness of both \(\ell_1\)-synthesis and \(\ell_1\)-analysis minimizations
- A modified greedy analysis pursuit algorithm for the cosparse analysis model
Cites work
- scientific article; zbMATH DE number 3214560 (Why is no real title available?)
- A Simple Proof of the Fredholm Alternative and a Characterization of the Fredholm Operators
- A Theory for Sampling Signals From a Union of Subspaces
- An Optimal Circulant Preconditioner for Toeplitz Systems
- Analysis versus synthesis in signal priors
- Circulants and their connectivities
- Compact Support Biorthogonal Wavelet Filterbanks for Arbitrary Undirected Graphs
- Decay Rates for Inverses of Band Matrices
- Diffusion wavelets
- Discrete Green's functions
- Model-Based Compressive Sensing
- Optimally sparse representation in general (nonorthogonal) dictionaries via ℓ 1 minimization
- Pseudo-inverses of difference matrices and their application to sparse signal approximation
- Representer Theorems for Sparsity-Promoting <inline-formula> <tex-math notation="LaTeX">$\ell _{1}$ </tex-math> </inline-formula> Regularization
- Sampling Theorems for Signals From the Union of Finite-Dimensional Linear Subspaces
- Sampling and Reconstructing Signals From a Union of Linear Subspaces
- Sampling and reconstruction of sparse signals on circulant graphs. An introduction to graph-FRI
- Self-Similarity: Part I—Splines and Operators
- Splines and wavelets on circulant graphs
- The cosparse analysis model and algorithms
- Trend filtering on graphs
- Variational splines and Paley-Wiener spaces on Combinatorial graphs
- Wavelets on graphs via spectral graph theory
Cited in
(1)
This page was built for publication: Analysis vs synthesis with structure -- an investigation of union of subspace models on graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2155807)