论文标题
具有传感器网络衰减系数的加权平均值和中间图过滤器
Weighted Mean and Median graph Filters with Attenuation Factor for Sensor Network
论文作者
论文摘要
本文提出了加权衰减K-HOP图，该图描绘了空间邻居节点及其中央节点的啤酒花。基于此k-kop图，我们进一步提出了一个节点选择图，该图形选择了中央节点的多个实例的临时邻居节点。使用此节点选择图，我们提出了一个均值滤波器。此外，我们还将提出的节点选择图应用于中值滤波器。最后，实验结果表明，所提出的平均滤波器的性能要比白噪声污染的信号中的原始中值过滤器更好，并且使用节点选择图的中值过滤器的性能也比原始的中值滤镜更好。
This paper proposes a weighted attenuation k-hop graph, which depicts the spatial neighbor nodes with their hops from the central node. Based on this k-kop graph, we further propose a node selecting graph, which selects temporal neighbor nodes of multiple instances of the central node. With this node selecting graph, we propose a graph mean filter. In addition, we also apply the proposed node selecting graph to the median filter. Finally, the experimental results show that the proposed mean filter performs better than the original median filter in the signal denoising polluted by white noise and the median filter using node selecting graph also has better performance than the original median filter.
