Title
Design of weighted median graph filters
Abstract
The success of linear (graph) filters lies in the combination of mathematical tractability and applicability; however, a number of meaningful problems cannot be satisfactorily addressed within the linear domain. This paper generalizes the classical concept of weighted median filters to operate on graph signals. Two definitions for nonlinear weighted median graph filters (MGF) are introduced. The first definition diffuses locally the values of the input across the graph using a nonlinear weighted median, and then combines the values generated using a linear mapping. The second definition starts by linearly combining the values of the input within graph neighborhoods and then generates the output by implementing a nonlinear weighted median. The behavior and robustness of these filters is then discussed, and results on the design of MGF are presented.
Year
DOI
Venue
2017
10.1109/CAMSAP.2017.8313120
2017 IEEE 7th International Workshop on Computational Advances in Multi-Sensor Adaptive Processing (CAMSAP)
Keywords
Field
DocType
Weighted median graph filters,Nonlinear graph signal processing,Nonlinear diffusion
Graph,Signal processing,Nonlinear system,Algorithm,Weighted median,Robustness (computer science),Linear map,Mathematics
Conference
ISBN
Citations 
PageRank 
978-1-5386-1252-1
0
0.34
References 
Authors
11
4
Name
Order
Citations
PageRank
Santiago Segarra18815.28
Antonio G. Marqués225433.71
Gonzalo R. Arce31061134.94
Alejandro Ribeiro42817221.08