Signal Recovery on Graphs: Variation Minimization

DOI10.1109/TSP.2015.2441042MaRDI QIDQ4580774zbMATH OpenOpenAlexWikidataFDO

Authors Siheng Chen, Aliaksei Sandryhaila, José M. F. Moura, Jelena Kovačević

Publication date 22 August 2018

Published in IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1411.7414

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Abstract: We consider the problem of signal recovery on graphs as graphs model data with complex structure as signals on a graph. Graph signal recovery implies recovery of one or multiple smooth graph signals from noisy, corrupted, or incomplete measurements. We propose a graph signal model and formulate signal recovery as a corresponding optimization problem. We provide a general solution by using the alternating direction methods of multipliers. We next show how signal inpainting, matrix completion, robust principal component analysis, and anomaly detection all relate to graph signal recovery, and provide corresponding specific solutions and theoretical analysis. Finally, we validate the proposed methods on real-world recovery problems, including online blog classification, bridge condition identification, temperature estimation, recommender system, and expert opinion combination of online blog classification.

Recommendations

• Non-Bayesian Estimation Framework for Signal Recovery on Graphs
• Guarantees of total variation minimization for signal recovery
• M-Channel Perfect Recovery of Coarsened Graphs and Graph Signals With Spectral Invariance and Topological Preservation
• Sparse Recovery With Graph Constraints
• Structured sampling and fast reconstruction of smooth graph signals
• Kernel-Based Reconstruction of Graph Signals
• Sampling and reconstruction of sparse signals on circulant graphs. An introduction to graph-FRI
• Distributed reconstruction of time-varying graph signals via a modified Newton's method
• Reconstruction of Graph Signals Through Percolation from Seeding Nodes

Cited in

(14)

• A Local Search Framework for Experimental Design
• Data Analytics on Graphs Part II: Signals on Graphs
• Data Analytics on Graphs Part III: Machine Learning on Graphs, from Graph Topology to Applications
• Near-optimal discrete optimization for experimental design: a regret minimization approach
• Fractional spectral graph wavelets and their applications
• Polynomial graph filters of multiple shifts and distributed implementation of inverse filtering
• Sampling and reconstruction of sparse signals on circulant graphs. An introduction to graph-FRI
• Time-varying graph signal recovery using high-order smoothness and adaptive low-rankness
• Mumford-Shah functionals on graphs and their asymptotics
• Random space-time sampling and reconstruction of sparse bandlimited graph diffusion field
• Graphmax for text generation
• Quantile-based fitting for graph signals
• Signal Processing on Simplicial Complexes
• Local measurement and diffusion reconstruction for signals on a weighted graph

This page was built for publication: Signal Recovery on Graphs: Variation Minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4580774)