Loading [MathJax]/extensions/MathMenu.js
Graph Signal Denoising Using Nested-Structured Deep Algorithm Unrolling | IEEE Conference Publication | IEEE Xplore

Graph Signal Denoising Using Nested-Structured Deep Algorithm Unrolling


Abstract:

In this paper, we propose a deep algorithm unrolling (DAU) based on a variant of the alternating direction method of multiplier (ADMM) called Plug-and-Play ADMM (PnP-ADMM...Show More

Abstract:

In this paper, we propose a deep algorithm unrolling (DAU) based on a variant of the alternating direction method of multiplier (ADMM) called Plug-and-Play ADMM (PnP-ADMM) for denoising of signals on graphs. DAU is a trainable deep architecture realized by unrolling iterations of an existing optimization algorithm which contains trainable parameters at each layer. We also propose a nested-structured DAU: Its submodules in the unrolled iterations are also designed by DAU. Several experiments for graph signal denoising are performed on synthetic signals on a community graph and U.S. temperature data to validate the proposed approach. Our proposed method outperforms alternative optimization- and deep learning-based approaches.
Date of Conference: 06-11 June 2021
Date Added to IEEE Xplore: 13 May 2021
ISBN Information:

ISSN Information:

Conference Location: Toronto, ON, Canada
References is not available for this document.

1. Introduction

Many sensing devices capture and store various signals. Since observed signals via such devices frequently suffer from noise or missing values as a consequence of the sensing process, signal restoration methods have been intensively studied in signal processing. The goal of signal restoration is to recover the original signal from observation(s) by solving an inverse problem which includes blind deconvolution [1], denoising [2], and interpolation [3].

Select All
1.
D. Ramírez, A. G. Marques and S. Segarra, "Graph-signal reconstruction and blind deconvolution for diffused sparse inputs", Proc. IEEE Int. Conf. Acoust. Speech. Signal Process., pp. 4104-4108, 2017.
2.
C. Tomasi and R. Manduchi, "Bilateral filtering for gray and color images", Proc. IEEE Int. Conf. Comput. Vis., pp. 839-846, 1998.
3.
X. Zhang and X. Wu, "Image interpolation by adaptive 2-d autoregressive modeling and soft-decision estimation", IEEE Trans. Image Process., vol. 17, no. 6, pp. 887-896, 2008.
4.
D. I. Shuman, S. K. Narang, P. Frossard, A. Ortega and P. Vandergheynst, "The emerging field of signal processing on graphs: extending high-dimensional data analysis to networks and other irregular domains", IEEE Signal Process. Mag., vol. 30, no. 3, pp. 83-98, 2013.
5.
A. Ortega, P. Frossard, J. Kovačević, J. M. F. Moura and P. Vandergheynst, "Graph signal processing: overview challenges and applications", Proc. IEEE, vol. 106, no. 5, pp. 808-828, 2018.
6.
A. Sandryhaila and J. M. F. Moura, "Discrete signal processing on graphs", IEEE Trans. Signal Process., vol. 61, no. 7, pp. 1644-1656, 2013.
7.
W. Hu, G. Cheung, A. Ortega and O. C. Au, "Multiresolution graph fourier transform for compression of piecewise smooth images", IEEE Trans. on Image Process., vol. 24, no. 1, pp. 419-433, 2015.
8.
S. Chen, R. Varma, A. Sandryhaila and J. Kovačević, "Discrete signal processing on graphs: sampling theory", IEEE Trans. Signal Process., vol. 63, no. 24, pp. 6510-6523, 2015.
9.
A. Anis, A. Gadde and A. Ortega, "Efficient sampling set selection for bandlimited graph signals using graph spectral proxies", IEEE Trans. Signal Process., vol. 64, no. 14, pp. 3775-3789, 2016.
10.
Y. Tanaka, Y. C. Eldar, A. Ortega and G. Cheung, "Sampling signals on graphs: From theory to applications", IEEE Signal Process. Mag., vol. 37, no. 6, pp. 14-30, Nov. 2020.
11.
A. Sakiyama, K. Watanabe, Y. Tanaka and A. Ortega, "Two-channel critically-sampled graph filter banks with spectral domain sampling", IEEE Trans. Signal Process., vol. 67, no. 6, pp. 1447-1460, Mar. 2019.
12.
S. Chen, A. Sandryhaila, J. M. F. Moura and J. Kovačević, "Signal recovery on graphs: variation minimization", IEEE Trans. Signal Process., vol. 63, no. 17, pp. 4609-4624, 2015.
13.
M. Onuki, S. Ono, M. Yamagishi and Y. Tanaka, "Graph signal denoising via trilateral filter on graph spectral domain", IEEE Trans. on Signal and Inf. Process. over Networks, vol. 2, no. 2, pp. 137-148, 2016.
14.
Y. Tanaka and A. Sakiyama, "M-channel oversampled graph filter banks", IEEE Trans. Signal Process., vol. 62, no. 14, pp. 3578-3590, 2014.
15.
T. H. Do, D. Minh Nguyen and N. Deligiannis, "Graph autoencoder for graph signal denoising", Proc. IEEE Int. Conf. Acoust. Speech. Signal Process., pp. 3322-3326, 2020.
16.
S. Ono, I. Yamada and I. Kumazawa, "Total generalized variation for graph signals", Proc. IEEE Int. Conf. Acoust. Speech. Signal Process., pp. 5456-5460, 2015.
17.
A. Gadde, S. K. Narang and A. Ortega, "Bilateral filter: graph spectral interpretation and extensions", Proc. IEEE Int. Conf. Image Process., 2013.
18.
J. Xie, L. Xu and E. Chen, "Image denoising and inpainting with deep neural networks", Proc. Int. Conf. Neural Inf. Process. Syst, pp. 341-349, 2012.
19.
I. Daubechies, M. Defrise and C. De Mol, "An iterative thresholding algorithm for linear inverse problems with a sparsity constraint", Comm. Pure Appl. Math., vol. 57, no. 11, pp. 1413-1457, 2004.
20.
A. Beck and M. Teboulle, "A fast iterative shrinkage-thresholding algorithm for linear inverse problems", SIAM J. Imaging Sci., vol. 2, no. 1, pp. 183-202, 2009.
21.
K. Gregor and Y. LeCun, "Learning fast approximations of sparse coding", Proc. Int. Conf. Mach. Learn, pp. 399-406, 2010.
22.
S. Chen, Y. C. Eldar and L. Zhao, "Graph unrolling networks: Interpretable neural networks for graph signal denoising", IEEE Trans. Signal Process., Jun. 2020.
23.
Y. Li, M. Tofighi, J. Geng, V. Monga and Y. C. Eldar, "Efficient and interpretable deep blind image deblurring via algorithm unrolling", IEEE Trans. Comput. Imaging, vol. 6, pp. 666-681, 2020.
24.
M. Henaff, J. Bruna and Y. LeCun, "Deep convolutional networks on graph-structured data", 2015.
25.
M. Defferrard, X. Bresson and P. Vandergheynst, "Convolutional neural networks on graphs with fast localized spectral filtering", Proc. Int. Conf. Neural Inf. Process. Syst, pp. 3844-3852, 2016.
26.
T. N. Kipf and M. Welling, "Semi-Supervised classification with graph convolutional networks", Int. Conf. on Learn. Representations, 2017.
27.
S. H. Chan, X. Wang and O. A. Elgendy, "Plug-and-play ADMM for image restoration: fixed-point convergence and applications", IEEE Trans. Comput. Imaging, vol. 3, no. 1, pp. 84-98, 2017.
28.
Y. Yazaki, Y. Tanaka and S. H. Chan, "Interpolation and denoising of graph signals using plug-and-play ADMM", Proc. IEEE Int. Conf. Acoust. Speech. Signal Process., pp. 5431-5435, 2019.
29.
S. Boyd, "Distributed optimization and statistical learning via the alternating direction method of multipliers", FNT in Machine Learning, vol. 3, no. 1, pp. 1-122, 2010.
30.
K. Bredies, K. Kunisch and T. Pock, "Total generalized variation", SIAM J. Imaging Sci., vol. 3, no. 3, pp. 492-526, 2010.
Contact IEEE to Subscribe

References

References is not available for this document.