Related papers: Gabor frame bound optimizations
The geometry of fundamental domains of lattices was used by Han and Wang to construct multivariate Gabor frames for separable lattices. We build upon their results to obtain Gabor frames with smooth and compactly supported window functions.…
For a class of compactly supported windows we characterize the frame property for a Gabor system $\mts,$ for translation parameters $a$ belonging to a certain range depending on the support size. We show that the obstructions to the frame…
The aim of this work is to study (Multi-window) Gabor systems in the space \(\ell^2(\mathbb{Z} \times \mathbb{Z}, \mathbb{H})\), denoted by $\mathcal{G}(g,L,M,N)$, and defined by: \[ \left\{ (k_1,k_2)\in \mathbb{Z}^2\mapsto e^{2\pi i…
This work developes a quantitative framework for describing the overcompleteness of a large class of frames. A previous paper introduced notions of localization and approximation between two frames $\mathcal{F} = \{f_i\}_{i \in I}$ and…
The topic of this paper are (multi-window) Gabor frames for signals over finite Abelian groups, generated by an arbitrary lattice within the finite time-frequency plane. Our generic approach covers simultaneously multi-dimensional signals…
A frame is scalable if each of its vectors can be rescaled in such a way that the resulting set becomes a Parseval frame. In this paper, we consider four different optimization problems for determining if a frame is scalable. We offer some…
We prove a sharp bound for the remainder term of the number of lattice points inside a ball, when averaging over a compact set of (not necessarily unimodular) lattices, in dimensions two and three. We also prove that such a bound cannot…
We consider optimization problems in Lebesgue spaces with pointwise box constraints and finitely many additional linear constraints. We prove that the existence of a Slater point which lies strictly between the pointwise bounds and which…
The construction of finite tight Gabor frames plays an important role in many applications. These applications include significant ones in signal and image processing. We explore when constant amplitude zero autocorrelation (CAZAC)…
We generalize three main concepts of Gabor analysis for lattices to the setting of model sets: Fundamental Identity of Gabor Analysis, Janssen's representation of the frame operator and Wexler-Raz biorthogonality relations. Utilizing the…
We discuss first order optimality conditions for geometric optimization problems with Neumann boundary conditions and boundary observation. The methods we develop here are applicable to large classes of state systems or cost functionals.…
We effectively bound T-singularities on non-rational projective surfaces with an arbitrary amount of T-singularities and ample canonical class. This fully generalizes the previous work for the case of one singularity, and illustrates the…
We study the upper and the lower densities of complete and minimal Gabor Gaussians systems. In contrast to the classical lattice case when they are both equal to $1$, we prove that the lower density may reach $0$ while the upper density may…
In this paper we investigate the computational aspects of some recently proposed iterative methods for approximating the canonical tight and canonical dual window of a Gabor frame (g,a,b). The iterations start with the window g while the…
We give an upper bound for the degree of rational curves in a family that covers a given birational ruled surface in projective space. The upper bound is stated in terms of the degree, sectional genus and arithmetic genus of the surface. We…
We show that every rationally sampled dilation-and-modulation system is unitarily equivalent with a multi-window Gabor system. As a consequence, frame theoretical results from Gabor analysis can be directly transferred to…
Counting integer points in large convex bodies with smooth boundaries containing isolated flat points is oftentimes an intermediate case between balls (or convex bodies with smooth boundaries having everywhere positive curvature) and cubes…
We discuss the concepts of pseudo-dual frames and approximately dual frames, and illuminate their relationship to classical frames. Approximately dual frames are easier to construct than the classical dual frames, and might be tailored to…
We study the space spanned by the integer shifts of a bivariate Gaussian function and the problem of reconstructing any function in that space from samples scattered across the plane. We identify a large class of lattices, or more generally…
In this paper we describe an algorithm that quickly computes a maximal a-valued lattice in an F-vector space equipped with a non-degenerate bilinear form, where a is a fractional ideal in a number field F. We then apply this construction to…