.png){kind=icon}
返回
Distributed Graph Regularized Denoising via Constrained Chebyshev Polynomials
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2024.3421972.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
The problem of denoising signals, defined over graph domains, using a regularization framework, is considered here. Using the L-2 norm, the optimum denoising operator involves a matrix inverse. Approximation of the operator via matrix polynomial is commonly used to achieve an efficient distributed implementation. We first propose a modification to the fidelity term in the regularization framework. Based on the assumption of signal smoothness, weighting is applied to the frequency components of the noisy signal. We then propose an extension to the classical approximation using Chebyshev polynomials, by imposing linear constraints on the coefficients of the Chebyshev series. We will show that the constrained coefficients are related to the unconstrained coefficients via an affine transformation. Performance evaluation of the proposed distributed filters for denoising, using real-world datasets, is presented. Comparison with the classical filters is provided.
Keyword:
Filters
Chebyshev approximation
Noise reduction
Polynomials
Vectors
Symmetric matrices
Noise measurement
Chebyshev polynomial
graph filter
graph signal denoising
Tikhonov regularization
期刊
IF:
9.6
论文数:
1.1W
被引数:
1.7W
机构
引用论文
Composição florística de angiospermas no carste do Alto São Francisco, Minas Gerais, Brasil上 São Francisco 高原岩溶地区的被子植物区系组成，巴西米纳斯吉拉斯州.png)
Rodriguésia
OAAI
RodriguésiaIF0
OAAI分享收藏
Graph Signal Processing: Overview, Challenges, and Applications图信号处理: 概述、挑战与应用PROCEEDINGS OF THE IEEEOAAI
PROCEEDINGS OF THE IEEEIF25.9
OAAI分享收藏Minimax Design of Graph Filter Using Chebyshev Polynomial Approximation基于Chebyshev多项式逼近的图滤波器的Minimax设计
PREAI
分享收藏
查看更多内容