| Popis: |
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. |
