Analysis vs Synthesis with Structure - An Investigation of Union of Subspace Models on Graphs

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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/11/2018

Analysis vs Synthesis - An Investigation of (Co)sparse Signal Models on Graphs

In this work, we present a theoretical study of signals with sparse repr...
research
07/25/2019

Theory of Spectral Method for Union of Subspaces-Based Random Geometry Graph

Spectral Method is a commonly used scheme to cluster data points lying c...
research
03/06/2017

Generalizing CoSaMP to Signals from a Union of Low Dimensional Linear Subspaces

The idea that signals reside in a union of low dimensional subspaces sub...
research
07/17/2018

Phase Retrieval for Signals in Union of Subspaces

We consider the phase retrieval problem for signals that belong to a uni...
research
03/09/2023

Characterizing bearing equivalence in directed graphs

In this paper, we study bearing equivalence in directed graphs. We first...
research
07/29/2013

Union of Low-Rank Subspaces Detector

The problem of signal detection using a flexible and general model is co...

Please sign up or login with your details

Forgot password? Click here to reset