Graph signal processing: Overview, challenges, and applications

A Ortega, P Frossard, J Kovačević… - Proceedings of the …, 2018 - ieeexplore.ieee.org
Research in graph signal processing (GSP) aims to develop tools for processing data
defined on irregular graph domains. In this paper, we first provide an overview of core ideas …

The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains

DI Shuman, SK Narang, P Frossard… - IEEE signal …, 2013 - ieeexplore.ieee.org
In applications such as social, energy, transportation, sensor, and neuronal networks, high-
dimensional data naturally reside on the vertices of weighted graphs. The emerging field of …

Spectral networks and locally connected networks on graphs

J Bruna, W Zaremba, A Szlam, Y LeCun - arXiv preprint arXiv:1312.6203, 2013 - arxiv.org
Convolutional Neural Networks are extremely efficient architectures in image and audio
recognition tasks, thanks to their ability to exploit the local translational invariance of signal …

Discrete differential-geometry operators for triangulated 2-manifolds

M Meyer, M Desbrun, P Schröder, AH Barr - … and mathematics III, 2003 - Springer
This paper proposes a unified and consistent set of flexible tools to approximate important
geometric attributes, including normal vectors and curvatures on arbitrary triangle meshes …

[PDF][PDF] As-rigid-as-possible surface modeling

O Sorkine, M Alexa - Symposium on Geometry processing, 2007 - Citeseer
Modeling tasks, such as surface deformation and editing, can be analyzed by observing the
local behavior of the surface. We argue that defining a modeling operation by asking for …

Implicit fairing of irregular meshes using diffusion and curvature flow

M Desbrun, M Meyer, P Schröder, AH Barr - Proceedings of the 26th …, 1999 - dl.acm.org
In this paper, we develop methods to rapidly remove rough features from irregularly
triangulated data intended to portray a smooth surface. The main task is to remove …

Fast resampling of three-dimensional point clouds via graphs

S Chen, D Tian, C Feng, A Vetro… - IEEE Transactions on …, 2017 - ieeexplore.ieee.org
To reduce the cost of storing, processing, and visualizing a large-scale point cloud, we
propose a randomized resampling strategy that selects a representative subset of points …

Laplacian surface editing

O Sorkine, D Cohen-Or, Y Lipman, M Alexa… - Proceedings of the …, 2004 - dl.acm.org
Surface editing operations commonly require geometric details of the surface to be
preserved as much as possible. We argue that geometric detail is an intrinsic property of a …

Graph moving object segmentation

JH Giraldo, S Javed… - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
Moving Object Segmentation (MOS) is a fundamental task in computer vision. Due to
undesirable variations in the background scene, MOS becomes very challenging for static …

Bilateral mesh denoising

S Fleishman, I Drori, D Cohen-Or - ACM SIGGRAPH 2003 Papers, 2003 - dl.acm.org
We present an anisotropic mesh denoising algorithm that is effective, simple and fast. This is
accomplished by filtering vertices of the mesh in the normal direction using local …