DISTRIBUTED ALGORITHM FOR GRAPH SIGNAL INPAINTING

被引：0
|
作者：
Chen, Siheng [1 ,2 ]
Sandryhaila, Aliaksei [3 ]
Kovacevic, Jelena [1 ,2 ,4 ]
机构：
[1] Carnegie Mellon Univ, Dept ECE, Pittsburgh, PA 15213 USA
[2] Carnegie Mellon Univ, Ctr Bioimage Informat, Pittsburgh, PA 15213 USA
[3] Carnegie Mellon Univ, HP Vert, Pittsburgh, PA 15213 USA
[4] Carnegie Mellon Univ, Dept BME, Pittsburgh, PA 15213 USA
来源：
2015 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH, AND SIGNAL PROCESSING (ICASSP) | 2015年
基金：
美国国家科学基金会;
关键词：
Signal processing on graphs; graph signal inpainting; distributed computing; REGULARIZATION; FRAMEWORK;
D O I：
暂无
中图分类号：
O42 [声学];
学科分类号：
070206 ; 082403 ;
摘要：
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.
引用
收藏
页码：3731 / 3735
页数：5
相关论文
共 50 条
  • [1] A DISTRIBUTED DEADLOCK DETECTION ALGORITHM - DISTRIBUTED GRAPH RECONSTRUCTION ALGORITHM
    SONG, GY
    PARK, DY
    LEE, DM
    PARK, KH
    KIM, MW
    INFORMATION PROCESSING LETTERS, 1989, 30 (05) : 245 - 252
  • [2] A distributed algorithm for knot detection in a distributed graph
    Manivannan, D
    Singhal, M
    2002 INTERNATIONAL CONFERENCE ON PARALLEL PROCESSING, PROCEEDING, 2002, : 485 - 492
  • [3] TIME-VARYING GRAPH SIGNAL INPAINTING VIA UNROLLING NETWORKS
    Chen, Siheng
    Eldar, Yonina C.
    2021 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP 2021), 2021, : 8092 - 8097
  • [4] Hearing the clusters of a graph: A distributed algorithm
    Sahai, Tuhin
    Speranzon, Alberto
    Banaszuk, Andrzej
    AUTOMATICA, 2012, 48 (01) : 15 - 24
  • [5] A DISTRIBUTED GRAPH ALGORITHM - KNOT DETECTION
    MISRA, J
    CHANDY, KM
    ACM TRANSACTIONS ON PROGRAMMING LANGUAGES AND SYSTEMS, 1982, 4 (04): : 678 - 686
  • [6] Distributed Correlation Detection in Streaming Graph Signal
    Sun, Xuandi
    Wang, Haiyan
    Shen, Xiaohong
    Hua, Fei
    2022 IEEE 12TH SENSOR ARRAY AND MULTICHANNEL SIGNAL PROCESSING WORKSHOP (SAM), 2022, : 410 - 414
  • [7] OPTIMIZED QUANTIZATION IN DISTRIBUTED GRAPH SIGNAL PROCESSING
    Nobre, Isabela Cunha Maia
    Frossard, Pascal
    2019 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2019, : 5376 - 5380
  • [8] Distributed Signal Processing with Graph Spectral Dictionaries
    Thanou, Dorina
    Frossard, Pascal
    2015 53RD ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2015, : 1391 - 1398
  • [9] An efficient distributed algorithm for detection of knots and cycles in a distributed graph
    Manivannan, D
    Singhal, M
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2003, 14 (10) : 961 - 972
  • [10] A better practical algorithm for distributed graph coloring
    Kubale, M
    Kuszner, L
    PAR ELEC 2002: INTERNATIONAL CONFERENCE ON PARALLEL COMPUTING IN ELECTRICAL ENGINEERING, 2002, : 72 - 75
12345