ﻻ يوجد ملخص باللغة العربية
In the past decade, significant progress has been made to generalize classical tools from Fourier analysis to analyze and process signals defined on networks. In this paper, we propose a new framework for constructing Gabor-type frames for signals on graphs. Our approach uses general and flexible families of linear operators acting as translations. Compared to previous work in the literature, our methods yield the sharp bounds for the associated frames, in a broad setting that generalizes several existing constructions. We also examine how Gabor-type frames behave for signals defined on Cayley graphs by exploiting the representation theory of the underlying group. We explore how natural classes of translations can be constructed for Cayley graphs, and how the choice of an eigenbasis can significantly impact the properties of the resulting translation operators and frames on the graph.
The main purpose of the paper is to give a characterization of all compactly supported dual windows of a Gabor frame. As an application, we consider an iterative procedure for approximation of the canonical dual window via compactly supported dual wi
Given a locally compact abelian group $G$ and a closed subgroup $Lambda$ in $Gtimeswidehat{G}$, Rieffel associated to $Lambda$ a Hilbert $C^*$-module $mathcal{E}$, known as a Heisenberg module. He proved that $mathcal{E}$ is an equivalence bimodule b
This paper is a contribution to frame theory. Frames in a Hilbert space are generalizations of orthonormal bases. In particular, Gabor frames of $L^2(mathbb{R})$, which are made of translations and modulations of one or more windows, are often used i
We generalize Feichtinger and Kaiblingers theorem on linear deformations of uniform Gabor frames to the setting of a locally compact abelian group $G$. More precisely, we show that Gabor frames over lattices in the time-frequency plane of $G$ with wi
Partition of unity methods (PUMs) on graphs are simple and highly adaptive auxiliary tools for graph signal processing. Based on a greedy-type metric clustering and augmentation scheme, we show how a partition of unity can be generated in an efficien