Weighted Mean and Median graph Filters with Attenuation Factor for Sensor Network
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.
Code (0)
등록된 구현이 없습니다.
Tasks
DenoisingSimilar Papers 제목 키워드 기반
Adaptive Weight Modified Riesz Mean Filter For High-Density Salt and Pepper Noise Removal
This paper introduces a novel filter, the Adaptive Weight Modified Riesz Mean Filter (AWMRmF), designed for the effective removal of high-density salt and pepper noise (SPN). AWMRmF integrates a pixel weight function and…
Salt-And-Pepper Noise RemovalSSIMMultivariate Median Filters and Partial Differential Equations
Multivariate median filters have been proposed as generalisations of the well-established median filter for grey-value images to multi-channel images. As multivariate median, most of the recent approaches use the $L^1$ m…
Median activation functions for graph neural networks
Graph neural networks (GNNs) have been shown to replicate convolutional neural networks' (CNNs) superior performance in many problems involving graphs. By replacing regular convolutions with linear shift-invariant graph …
Convolutional Neural Network Pruning Using Filter Attenuation
Filters are the essential elements in convolutional neural networks (CNNs). Filters are corresponded to the feature maps and form the main part of the computational and memory requirement for the CNN processing. In filte…
image-classificationImage ClassificationNetwork PruningUniversal Graph Filter Design based on Butterworth, Chebyshev and Elliptic Functions
Graph filters are crucial tools in processing the spectrum of graph signals. In this paper, we propose to design universal IIR graph filters with low computational complexity by using three kinds of functions, which are …