Searcharxiv⌕ Search

arXiv subjects

Kasso A. Okoudjou

Publications and source records attributed to Kasso A. Okoudjou.

At least 37 records · Page 2Linked to original sources
arXiv2018

Extension and restriction principles for the HRT conjecture

The HRT (Heil-Ramanathan-Topiwala) conjecture asks whether a finite collection of time-frequency shifts of a non-zero square integrable function on $\mathbb{R}$ is linearly independent. This longstanding conjecture remains largely open even in the case when the function is assumed to be smooth. Nonetheless, the conjecture has been proved for some special families of functions and/or special sets of points. The main contribution of this paper is an inductive approach to investigate the HRT conjecture based on the following question. Suppose that the HRT is true for a given set of ($N$) points and a given function. We characterize the set of all new points such that the conjecture remains true for the same function and the set of $N+1$ points obtained by adding one of these new points to the original set. To achieve this we introduce a real-valued function whose global maximizers describe when the HRT is true. To motivate this new approach we re-derive the HRT for sets of $3$ points. Subsequently, we establish new results for points in $(1,n)$ configurations, and for a family of symmetric $(2,3)$ configurations. Furthermore, we use these results and the refinements of other known ones to prove that the HRT holds for certain families of $4$ points. In particular, we show that the HRT holds for any set of $4$ points and any real-valued Schwartz function.

math.CA↗
arXiv2018

Bimodal Wilson systems in $L^2(\mathbb R)$

Given a window $ϕ\in L^2(\mathbb R),$ and lattice parameters $α, β>0,$ we introduce a bimodal Wilson system $\mathcal{W}(ϕ, α, β)$ consisting of linear combinations of at most two elements from an associated Gabor $\mathcal{G}(ϕ, α, β)$. For a class of window functions $ϕ,$ we show that the Gabor system $\mathcal{G}(ϕ, α, β)$ is a tight frame of redundancy $β^{-1}$ if and only if the Wilson system $\mathcal{W}(ϕ, α, β)$ is Parseval system for $L^2(\mathbb R).$ Examples of smooth rapidly decaying generators $ϕ$ are constructed. In addition, when $3\leq β^{-1}\in \mathbb N$, we prove that it is impossible to renormalize the elements of the constructed Parseval Wilson frame so as to get a well-localized orthonormal basis for $L^2(\mathbb R)$.

math.FA↗
arXiv2018

On a problem by Hans Feichtinger

In this paper, we solve a spectral problem about positive semi-definite trace-class pseudodifferential operators on modulation spaces which was posed by H. Feichtinger. Later, C. Heil and D. Larson rephrased the problem in the broader setting of positive semi-definite trace-class operators on a separable Hilbert space. Our solution consists in constructing a counterexample that solves Hans Feichtinger's problem by first solving this second problem.

math.CA↗
arXiv2018

Equiangular quantum key distribution in more than two dimensions

We extend the spherical code based key distribution protocols to qudits with dimensions 4 and 16 by constructing equiangular frames and their companions. We provide methods for equiangular frames in arbitrary dimensions for Alice to use and the companion frames, that has one antipode to eliminate one of the possibilities, made up of qudits with $N=4,16$ as part of Bob's code. Non-orthogonal bases that form positive operator valued measures can be constructed using the tools of frames (overcomplete bases of a Hilbert space) and here we apply them to key distribution that are robust due to large size of the bases making it hard for eavesdropping. We demonstrate a method to construct a companion frame for an equiangular tight frame for $\complexes^{p-1}$ generated from the discrete Fourier transform, where $p$ is any odd prime. The security analysis is based on the assumption restricting possible attacks to intercept/resend scenario highlighting the advantages of a qudit over qubit-based protocols.

quant-ph↗
arXiv2018

Frame sets for generalized $B$-splines

The frame set of a function $g\in L^2(\mathbb{R})$ is the subset of all parameters $(a, b)\in \mathbb{R}^2_+$ for which the time-frequency shifts of $g$ along $a\mathbb{Z}\times b\mathbb{Z}$ form a Gabor frame for $L^2(\mathbb{R}).$ In this paper, we investigate the frame set of a class of functions that we call \emph{generalized $B-$splines} and which includes the $B-$splines. In particular, we add many new points to the frame sets of these functions. In the process, we generalize and unify some recent results on the frame sets for this class of functions.

math.FA↗
arXiv2017

Optimal properties of the canonical tight probabilistic frame

A probabilistic frame is a Borel probability measure with finite second moment whose support spans $\mathbb{R}^d$. A Parseval probabilistic frame is one for which the associated matrix of the second moments is the identity matrix in $\mathbb{R}^d$. Each probabilistic frame is canonically associated to a Parseval probabilistic frame. In this paper, we show that this canonical Parseval probabilistic frame is the closest Parseval probabilistic frame to a given probabilistic frame in the $2-$Wasserstein distance. Our proof is based on two main ingredients. On the one hand, we show that a probabilistic frame can be approximated in the $2-$Wasserstein metric with (compactly supported) finite frames whose bounds can be controlled. On the other hand, we establish some fine continuity properties of the function that maps a probabilistic frame to its canonical Parseval probabilistic frame. Our results generalize similar ones for finite frames and their associated Parseval frames.

math.CA↗
arXiv2017

On Wilson bases in L2(R^d)

A Wilson system is a collection of finite linear combinations of time frequency shifts of a square integrable function. In this paper we use the fact that a Wilson system is a shift-invariant system to explore its relationship with Gabor systems. It is well known that, starting from a tight Gabor frame for $L^{2}(\mathbb{R})$ with redundancy $2$, one can construct an orthonormal Wilson basis for $L^{2}(\mathbb{R})$ whose generator is well localized in the time-frequency plane. In this paper, we show that one can construct multi-dimensional orthonormal Wilson bases starting from tight Gabor frames of redundancy $2^k$ where $k=1, 2, ..., d$. These results generalize most of the known results about the existence of orthonormal Wilson bases.

math.FA↗
arXiv2017

Invertibility of graph translation and support of Laplacian Fiedler vectors

The graph Laplacian operator is widely studied in spectral graph theory largely due to its importance in modern data analysis. Recently, the Fourier transform and other time-frequency operators have been defined on graphs using Laplacian eigenvalues and eigenvectors. We extend these results and prove that the translation operator to the $i$'th node is invertible if and only if all eigenvectors are nonzero on the $i$'th node. Because of this dependency on the support of eigenvectors we study the characteristic set of Laplacian eigenvectors. We prove that the Fiedler vector of a planar graph cannot vanish on large neighborhoods and then explicitly construct a family of non-planar graphs that do exhibit this property.

math.FA↗
arXiv2016

Optimization methods for frame conditioning and application to graph Laplacian scaling

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 algorithms to solve these problems. We then apply and extend our methods to the problem of reweighing (finite) graph so as to minimize the condition number of the resulting Laplacian.

math.FA↗
arXiv2016

Scalable Probabilistic Frames

We consider the problem of rescaling the lengths of a finite frame thereby transforming it into a tight one. Such frames are called scalable and have received a lot of attention in recent years. In this note we investigate the question in terms of probabilistic frames and give conditions under which a (discrete) probabilistic frame is scalable.

math.NA↗
arXiv2016

Preconditioning techniques in frame theory and probabilistic frames

In this chapter we survey two topics that have recently been investigated in frame theory. First, we give an overview of the class of scalable frames. These are (finite) frames with the property that each frame vector can be rescaled in such a way that the resulting frames are tight. This process can be thought of as a preconditioning method for finite frames. In particular, we: (1) describe the class of scalable frames; (2) formulate various equivalent characterizations of scalable frames, and relate the scalability problem to the Fritz John ellipsoid theorem. Next, we discuss some results on a probabilistic interpretation of frames. In this setting, we: (4) define probabilistic frames as a generalization of frames and as a subclass of continuous frames; (5) review the properties of certain potential functions whose minimizers are frames with certain optimality properties. The chapter is based on a lecture given by the author at the AMS 2015 Short Course on Finite Frame Theory: A Complete Introduction to Overcompleteness.

math.FA↗
arXiv2015

Boundedness of multilinear pseudo-differential operators on modulation spaces

Boundedness results for multilinear pseudodifferential operators on products of modulation spaces are derived based on ordered integrability conditions on the short-time Fourier transform of the operators' symbols. The flexibility and strength of the introduced methods is demonstrated by their application to the bilinear and trilinear Hilbert transform.

math.FA↗
arXiv2015

Scaling Laplacian Pyramids

Laplacian pyramid based Laurent polynomial (LP$^2$) matrices are generated by Laurent polynomial column vectors and have long been studied in connection with Laplacian pyramidal algorithms in Signal Processing. In this paper, we investigate when such matrices are scalable, that is when right multiplication by Laurent polynomial diagonal matrices results in paraunitary matrices. The notion of scalability has recently been introduced in the context of finite frame theory and can be considered as a preconditioning method for frames. This paper significantly extends the current research on scalable frames to the setting of polyphase representations of filter banks. Furthermore, as applications of our main results we propose new construction methods for tight wavelet filter banks and tight wavelet frames.

math.FA↗
arXiv2015

On Optimal Frame Conditioners

A (unit norm) frame is scalable if its vectors can be rescaled so as to result into a tight frame. Tight frames can be considered optimally conditioned because the condition number of their frame operators is unity. In this paper we reformulate the scalability problem as a convex optimization question. In particular, we present examples of various formulations of the problem along with numerical results obtained by using our methods on randomly generated frames.

math.NA↗
arXiv2014

Measures of scalability

Scalable frames are frames with the property that the frame vectors can be rescaled resulting in tight frames. However, if a frame is not scalable, one has to aim for an approximate procedure. For this, in this paper we introduce three novel quantitative measures of the closeness to scalability for frames in finite dimensional real Euclidean spaces. Besides the natural measure of scalability given by the distance of a frame to the set of scalable frames, another measure is obtained by optimizing a quadratic functional, while the third is given by the volume of the ellipsoid of minimal volume containing the symmetrized frame. After proving that these measures are equivalent in a certain sense, we establish bounds on the probability of a randomly selected frame to be scalable. In the process, we also derive new necessary and sufficient conditions for a frame to be scalable.

math.FA↗
arXiv2014

Scalable Frames and Convex Geometry

The recently introduced and characterized scalable frames can be considered as those frames which allow for perfect preconditioning in the sense that the frame vectors can be rescaled to yield a tight frame. In this paper we define $m$-scalability, a refinement of scalability based on the number of non-zero weights used in the rescaling process, and study the connection between this notion and elements from convex geometry. Finally, we provide results on the topology of scalable frames. In particular, we prove that the set of scalable frames with "small" redundancy is nowhere dense in the set of frames.

math.NA↗
arXiv2013

Multi-window Gabor frames in amalgam spaces

We show that multi-window Gabor frames with windows in the Wiener algebra $W(L^{\infty}, \ell^{1})$ are Banach frames for all Wiener amalgam spaces. As a byproduct of our results we positively answer an open question that was posed by [Krishtal and Okoudjou, Invertibility of the Gabor frame operator on the Wiener amalgam space, J. Approx. Theory, 153(2), 2008] and concerns the continuity of the canonical dual of a Gabor frame with a continuous generator in the Wiener algebra. The proofs are based on a recent version of Wiener's $1/f$ lemma.

math.FA↗