Sampling signals on graphs: From theory to applications

Y Tanaka, YC Eldar, A Ortega… - IEEE Signal Processing …, 2020 - ieeexplore.ieee.org
The study of sampling signals on graphs, with the goal of building an analog of sampling for
standard signals in the time and spatial domains, has attracted considerable attention …

Gershgorin circle theorem-based feature extraction for biomedical signal analysis

SA Patel, RJ Smith, A Yildirim - Frontiers in Neuroinformatics, 2024 - frontiersin.org
Recently, graph theory has become a promising tool for biomedical signal analysis, wherein
the signals are transformed into a graph network and represented as either adjacency or …

Point cloud sampling via graph balancing and Gershgorin disc alignment

C Dinesh, G Cheung, IV Bajić - IEEE Transactions on Pattern …, 2022 - ieeexplore.ieee.org
Point cloud (PC)—a collection of discrete geometric samples of a 3D object's surface—is
typically large, which entails expensive subsequent operations. Thus, PC sub-sampling is of …

Overcoming Dimensionality Constraints: A Gershgorin Circle Theorem-Based Feature Extraction for Weighted Laplacian Matrices in Computer Vision Applications

SA Patel, A Yildirim - Journal of Imaging, 2024 - mdpi.com
In graph theory, the weighted Laplacian matrix is the most utilized technique to interpret the
local and global properties of a complex graph structure within computer vision applications …

Fast sampling and reconstruction for linear inverse problems: From vectors to tensors

F Wang, G Cheung, T Li, Y Du… - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
Signals typical in the real world have different modes, expressed as vectors, matrices, or
higher-order tensors. In practice, a target signal is commonly assumed to be linear in the …

Fast MSE-Based Sampling of Bandlimited Graph Signals via Low-Pass Impulse Responses

F Wang, G Cheung, M Ye, T Li… - IEEE Transactions on …, 2023 - ieeexplore.ieee.org
Sampling is a fundamental problem in graph signal processing that selects a node subset to
collect samples, so that data in the remaining nodes can be well recovered. Existing eigen …

Learning sparse graph Laplacian with K eigenvector prior via iterative glasso and projection

S Bagheri, G Cheung, A Ortega… - ICASSP 2021-2021 IEEE …, 2021 - ieeexplore.ieee.org
Learning a suitable graph is an important precursor to many graph signal processing (GSP)
pipelines, such as graph signal compression and denoising. Previous graph learning …

Global Reachability of Heterogeneous Multiagent Systems Under Collaborative Interaction Topology and Unknown Delays

S De, SR Sahoo, P Wahi - IEEE Transactions on Automatic …, 2023 - ieeexplore.ieee.org
The multiagent rendezvous problem for single-and double-integrator agents in the presence
of unknown constant input and communication delays is investigated in this article. Existing …

Multimodal graph signal denoising via twofold graph smoothness regularization with deep algorithm unrolling

M Nagahama, Y Tanaka - ICASSP 2022-2022 IEEE …, 2022 - ieeexplore.ieee.org
We propose a denoising method of multimodal graph signals with twofold smoothness
regularization. Graph signal processing assumes that a signal has an underlying structure …

Fast Sampling for Linear Inverse Problems of Vectors and Tensors using Multilinear Extensions

H Li, D Liang, Z Zhou, Z Xie - arXiv preprint arXiv:2312.01574, 2023 - arxiv.org
Sampling vector and tensor signals is the process of choosing sites in vectors and tensors to
place sensors in order to effectively recover the whole signals from a limited number of …