Читать книгу Graph Spectral Image Processing - Gene Cheung - Страница 16

Biyikoglu, T., Leydold, J., Stadler, P.F. (2005). Nodal domain theorems and bipartite subgraphs. Electronic Journal of Linear Algebra, 13, 344–351.

Chen, S., Sandryhaila, A., Moura, J., Kovacevic, J. (2015). Signal recovery on graphs: Variation minimization. IEEE Transactions on Signal Processing, 63(17), 4609–4624.

Cheung, G., Su, W.-T., Mao, Y., Lin, C.-W. (2018). Robust semisupervised graph classifier learning with negative edge weights. IEEE Transactions on Signal and Information Processing over Networks, 4(4), 712–726.

Chung, F. (1997). Spectral graph theory. CBMS Regional Conference Series in Mathematics, 92.

Dörfler, F. and Bullo, F. (2013). Kron reduction of graphs with applications to electrical networks. IEEE Transactions on Circuits and Systems I: Regular Papers, 60(1), 150–163.

Lezoray, O. and Grady, L. (2012). Image Processing and Analysis with Graphs: Theory and Practice, CRC Press, Boca Raton, Florida.

Liu, X., Cheung, G., Wu, X., Zhao, D. (2017). Random walk graph Laplacian based smoothness prior for soft decoding of JPEG images. IEEE Transactions on Image Processing, 26(2), 509–524.

Milanfar, P. (2013a). Symmetrizing smoothing filters. SIAM Journal on Imaging Sciences, 6(1), 263–284.

Milanfar, P. (2013b). A tour of modern image filtering. IEEE Signal Processing Magazine, 30(1), 106–128.

Pang, J. and Cheung, G. (2017). Graph Laplacian regularization for image denoising: Analysis in the continuous domain. IEEE Transactions on Image Processing, 26(4), 1770–1785.

Romano, Y., Elad, M., Milanfar, P. (2017). The little engine that could: Regularization by denoising (RED). SIAM Journal on Imaging Sciences, 10(4), 1804–1844.

Shuman, D.I., Narang, S.K., Frossard, P., Ortega, A., Vandergheynst, P. (2013), The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains. IEEE Signal Processing Magazine, 30(3), 83–98.

Su, W.-T., Cheung, G., Lin, C.-W. (2017). Graph Fourier transform with negative edges for depth image coding. IEEE International Conference on Image Processing, Beijing.

Tomasi, C. and Manduchi, R. (1998), Bilateral filtering for gray and color images. IEEE International Conference on Computer Vision, 839–846.

Vemulapalli, R., Tuzel, O., Liu, M.-Y. (2016). Deep Gaussian conditional random field network: A model-based deep network for discriminative denoising. Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, 4801–4809.

Zhang, K., Zuo, W., Chen, Y., Meng, D., Zhang, L. (2017). Beyond a Gaussian denoiser: Residual learning of deep CNN for image denoising. IEEE Transactions on Image Processing, 26(7), 3142–3155.

1 1 If a graph node represents a pixel in an image, each pixel would typically have three color components: red, green and blue. For simplicity, one can treat each color component separately as a different graph signal.

2 2 One can prove that a graph G with positive edge weights has PSD graph Laplacian L via the Gershgorin circle theorem: each Gershgorin disc corresponding to a row in L is located in the non-negative half-space, and since all eigenvalues reside inside the union of all discs, they are non-negative.