Related papers: Redundancy for localized and Gabor frames

We introduce a differentiable, end-to-end trainable framework for solving pixel-level grouping problems such as instance segmentation consisting of two novel components. First, we regress pixels into a hyper-spherical embedding space so…

Frame theory provides a robust method for recovering vectors in a Hilbert space from inner product data, though the associated decomposition formula can be computationally demanding. We relax the frame condition by studying sequences that…

We consider the reversible exclusion process with reservoirs on arbitrary networks. We characterize the spectral gap, mixing time, and mixing window of the process, in terms of certain simple statistics of the underlying network. Among…

There are several ideal boundaries and completions in General Relativity sharing the topological property of being sequential, i.e., determined by the convergence of its sequences and, so, by some limit operator $L$. As emphasized in a…

The functional linear model extends the notion of linear regression to the case where the response and covariates are iid elements of an infinite dimensional Hilbert space. The unknown to be estimated is a Hilbert-Schmidt operator, whose…

We investigate vector-valued Gabor frames (sometimes called Gabor superframes) based on Hermite functions $H_n$. Let $h= (H_0, H_1, ..., H_n)$ be the vector of the first $n+1$ Hermite functions. We give a complete characterization of all…

Overparametrization is a key factor in the absence of convexity to explain global convergence of gradient descent (GD) for neural networks. Beside the well studied lazy regime, infinite width (mean field) analysis has been developed for…

We show that any two frames in a separable Hilbert space that are dual to each other have the same excess. Some new relations for the analysis resp. synthesis operators of dual frames are also derived. We then prove that pseudo-dual frames…

A subset $M$ of a separable Hilbert space $H$ is $\ell^1$-bounded if there exists a Riesz basis $\mathcal{F} = \{e_n\}_{n \in \mathbb{N}}$ for $H$ such that $\sup_{x \in M} \sum_{n \in \mathbb{N}} |\langle x, e_n\rangle| < \infty.$ A…

For a class $F$ of complex-valued functions on a set $D$, we denote by $g_n(F)$ its sampling numbers, i.e., the minimal worst-case error on $F$, measured in $L_2$, that can be achieved with a recovery algorithm based on $n$ function…

The duality principle states that a Gabor system is a frame if and only if the corresponding adjoint Gabor system is a Riesz sequence. In general Hilbert spaces and without the assumption of any particular structure, Casazza, Kutyniok and…

This paper demonstrates that random, independently chosen equi-dimensional subspaces with a unitarily invariant distribution in a real Hilbert space provide nearly tight, nearly equiangular fusion frames. The angle between a pair of…

A finite-dimensional Hilbert space is usually described in terms of an orthonormal basis, but in certain approaches or applications a description in terms of a finite overcomplete system of vectors, called a finite tight frame, may offer…

In 2016 Aldroubi et al. constructed the first class of frames having the form $\{T^k\varphi \}_{k=0}^\infty$ for a bounded linear operator on the underlying Hilbert space. In this paper we show that a subclass of these frames has a number…

We prove that an overcomplete Gabor frame in $ \ell^2(\mathbf Z)$ by a finitely supported sequence is always linearly dependent. This is a particular case of a general result about linear dependence versus independence for Gabor systems in…

Stopping sets play a crucial role in failure events of iterative decoders over a binary erasure channel (BEC). The $\ell$-th stopping redundancy is the minimum number of rows in the parity-check matrix of a code, which contains no stopping…

The analysis sparsity model is a very effective approach in modern Compressed Sensing applications. Specifically, redundant analysis operators can lead to fewer measurements needed for reconstruction when employing the analysis…

We consider frames F in a given Hilbert space, and we show that every F may be obtained in a constructive way from a reproducing kernel and an orthonormal basis in an ambient Hilbert space. The construction is operator-theoretic, building…

The problem of detecting and removing redundant constraints is fundamental in optimization. We focus on the case of linear programs (LPs) in dictionary form, given by $n$ equality constraints in $n+d$ variables, where the variables are…

We show that many perception tasks, from visual recognition, semantic segmentation, optical flow, depth estimation to vocalization discrimination, are highly redundant functions of their input data. Images or spectrograms, projected into…