Distributed algorithm for graph signal inpainting

We present a distributed and decentralized algorithm for graph signal inpainting. The previous work obtained a closed-form solution with matrix inversion. In this paper, we ease the computation by using a distributed algorithm, which solves graph signal inpainting by restricting each node to communi...

Full description

Saved in:
Bibliographic Details
Published in:2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) pp. 3731 - 3735
Main Authors: Siheng Chen, Sandryhaila, Aliaksei, Kovacevic, Jelena
Format: Conference Proceeding
Language:English
Published: IEEE 01.04.2015
Subjects:
Blogs
Closed-form solutions
Convergence
Distributed algorithms
distributed computing
graph signal inpainting
Meteorology
Minimization
Signal processing
Signal processing on graphs
ISSN:1520-6149
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:We present a distributed and decentralized algorithm for graph signal inpainting. The previous work obtained a closed-form solution with matrix inversion. In this paper, we ease the computation by using a distributed algorithm, which solves graph signal inpainting by restricting each node to communicate only with its local nodes. We show that the solution of the distributed algorithm converges to the closed-form solution with the corresponding convergence speed. Experiments on online blog classification and temperature prediction suggest that the convergence speed of the proposed distributed algorithm is competitive with that of the centralized algorithm, especially when a graph tends to be regular. Since a distributed algorithm does not require to collect data to a center, it is more practical and efficient.
ISSN:1520-6149
DOI:10.1109/ICASSP.2015.7178668