Paper Info
Title
Distributed Algorithm For Graph Signal Inpainting
Abstract
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.
Year
Venue
Keywords
2015
2015 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING (ICASSP)
Signal processing on graphs, graph signal inpainting, distributed computing
Field
DocType
ISSN
Convergence (routing),Signal processing,Matrix (mathematics),Computer science,Inpainting,Theoretical computer science,Distributed algorithm,Minification,Graph bandwidth,Computation
Conference
1520-6149
Citations 
PageRank 
References 
9
0.52
9
Authors
3
Name
Order
Citations
PageRank
Siheng Chen132427.85
Aliaksei Sandryhaila260328.39
Jelena Kovacevic380295.87