Efficient sampling set selection for bandlimited graph signals using graph spectral proxies

A Anis, A Gadde, A Ortega - IEEE Transactions on Signal …, 2016 - ieeexplore.ieee.org
We study the problem of selecting the best sampling set for bandlimited reconstruction of
signals on graphs. A frequency domain representation for graph signals can be defined …

Graph spectral image processing

G Cheung, E Magli, Y Tanaka… - Proceedings of the IEEE, 2018 - ieeexplore.ieee.org
Recent advent of graph signal processing (GSP) has spurred intensive studies of signals
that live naturally on irregular data kernels described by graphs (eg, social networks …

Graph filters for signal processing and machine learning on graphs

E Isufi, F Gama, DI Shuman… - IEEE Transactions on …, 2024 - ieeexplore.ieee.org
Filters are fundamental in extracting information from data. For time series and image data
that reside on Euclidean domains, filters are the crux of many signal processing and …

Improving event-based non-intrusive load monitoring using graph signal processing

B Zhao, K He, L Stankovic, V Stankovic - IEEE Access, 2018 - ieeexplore.ieee.org
Large-scale smart energy metering deployment worldwide and integration of smart meters
within the smart grid will enable two-way communication between the consumer and energy …

Graph signal processing for geometric data and beyond: Theory and applications

W Hu, J Pang, X Liu, D Tian, CW Lin… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
Geometric data acquired from real-world scenes, eg, 2D depth images, 3D point clouds, and
4D dynamic point clouds, have found a wide range of applications including immersive …

Boosting of image denoising algorithms

Y Romano, M Elad - SIAM Journal on Imaging Sciences, 2015 - SIAM
In this paper we propose a generic recursive algorithm for improving image denoising
methods. Given the initial denoised image, we suggest repeating the following “SOS” …

Distributed non-convex first-order optimization and information processing: Lower complexity bounds and rate optimal algorithms

H Sun, M Hong - IEEE Transactions on Signal processing, 2019 - ieeexplore.ieee.org
We consider a class of popular distributed non-convex optimization problems, in which
agents connected by a network ς collectively optimize a sum of smooth (possibly non …

Graph signal denoising via trilateral filter on graph spectral domain

M Onuki, S Ono, M Yamagishi… - IEEE Transactions on …, 2016 - ieeexplore.ieee.org
This paper presents a graph signal denoising method with the trilateral filter defined in the
graph spectral domain. The original trilateral filter (TF) is a data-dependent filter that is …

Irregularity-aware graph fourier transforms

B Girault, A Ortega… - IEEE Transactions on …, 2018 - ieeexplore.ieee.org
In this paper, we present a novel generalization of the graph Fourier transform (GFT). Our
approach is based on separately considering the definitions of signal energy and signal …

Time-varying graph learning based on sparseness of temporal variation

K Yamada, Y Tanaka, A Ortega - ICASSP 2019-2019 IEEE …, 2019 - ieeexplore.ieee.org
We propose a method for graph learning from spatiotemporal measurements. We aim at
inferring time-varying graphs under the assumption that changes in graph topology and …