English
Related papers

Related papers: On the Search for Tight Frames of Low Coherence

200 papers

For the unit sphere S^d in Euclidean space R^(d+1), we show that for d-1<s<d and any N>1, discrete N-point minimal Riesz s-energy configurations are well separated in the sense that the minimal distance between any pair of distinct points…

Mathematical Physics · Physics 2007-05-23 A. B. J. Kuijlaars , E. B. Saff , X. Sun

Unit norm finite frames are generalizations of orthonormal bases with many applications in signal processing. An important property of a frame is its coherence, a measure of how close any two vectors of the frame are to each other. Low…

Signal Processing · Electrical Eng. & Systems 2018-06-21 Cristian Rusu , Nuria Gonzalez-Prelcic , Robert W. Heath

Many problems in areas such as compressive sensing and coding theory seek to design a set of equal-norm vectors with large angular separation. This idea is essentially equivalent to constructing a frame with low coherence. The elements of…

Information Theory · Computer Science 2015-09-21 Matthew Thill , Babak Hassibi

In this paper, we study conditions under which a finite subset $Z$ of the unit sphere $S^{d-1}\subset \mathbb{R}^{d}$ becomes a spherical $t$-design, when $Z$ is constructed by the following procedure: starting from a finite set of…

Combinatorics · Mathematics 2026-01-27 Ryutaro Misawa

We study positive definiteness of kernels $K(x,y)$ on two-point homogeneous spaces. As opposed to the classical case, which has been developed and studied in the existing literature, we allow the kernel to have an (integrable) singularity…

Classical Analysis and ODEs · Mathematics 2024-10-30 Dmitriy Bilyk , Peter Grabner

A common criterion in the design of finite Hilbert space frames is minimal coherence, as this leads to error reduction in various signal processing applications. Frames that achieve minimal coherence relative to all unit-norm frames are…

Functional Analysis · Mathematics 2017-07-07 John I. Haas , Peter G. Casazza

Highly localized kernels constructed by orthogonal polynomials have been fundamental in recent development of approximation and computational analysis on the unit sphere, unit ball and several other regular domains. In this work we first…

Classical Analysis and ODEs · Mathematics 2021-09-09 Yuan Xu

The paper shows that under some mild conditions $n$-dimensional spherical wavelets derived from approximate identities build semi-continuous frames. Moreover, for sufficiently dense grids Poisson wavelets on $n$-dimensional spheres…

Classical Analysis and ODEs · Mathematics 2018-03-09 Ilona Iglewska-Nowak

We show that the spin wavelets on the sphere $S^2$, which were constructed by the first author and Marinucci in an earlier article, can be chosen so as to form a nearly tight frame. These spin wavelets can be applied to the study of the…

Functional Analysis · Mathematics 2009-07-22 D. Geller , A. Mayeli

We introduce and study the unconstrained polarization (or Chebyshev) problem which requires to find an $N$-point configuration that maximizes the minimum value of its potential over a set $A$ in $p$-dimensional Euclidean space. This problem…

Classical Analysis and ODEs · Mathematics 2021-06-30 Douglas P. Hardin , Mircea Petrache , Edward B. Saff

We produce precise estimates for the Kogbetliantz kernel for the approximation of functions on the sphere. Furthermore, we propose and study a new approximation kernel, which has slightly better properties.

Classical Analysis and ODEs · Mathematics 2017-06-30 Peter J. Grabner

Utilizing frameworks developed by Delsarte, Yudin and Levenshtein, we deduce linear programming lower bounds (as $N\to \infty$) for the Riesz energy of $N$-point configurations on the $d$-dimensional unit sphere in the so-called…

Mathematical Physics · Physics 2019-02-20 Douglas P. Hardin , Timothy J. Michaels , Edward B. Saff

We provide new answers about the placement of mass on spheres so as to minimize energies of pairwise interactions. We find optimal measures for the $p$-frame energies, i.e. energies with the kernel given by the absolute value of the inner…

Metric Geometry · Mathematics 2021-09-01 Dmitriy Bilyk , Alexey Glazyrin , Ryan Matzke , Josiah Park , Oleksandr Vlasiuk

Equiangular tight frames (ETFs) have found significant applications in signal processing and coding theory due to their robustness to noise and transmission losses. ETFs are characterized by the fact that the coherence between any two…

Information Theory · Computer Science 2018-04-10 Somantika Datta , Jesse Oldroyd

Despite the decomposition of convolutional kernels for lightweight CNNs being well studied, existing works that rely on tensor network diagrams or hyperdimensional abstraction lack geometry intuition. This work devises a new perspective by…

Computer Vision and Pattern Recognition · Computer Science 2023-12-18 Jason Chun Lok Li , Rui Lin , Jiajun Zhou , Edmund Yin Mun Lam , Ngai Wong

Wavelet bases and frames consisting of band limited functions of nearly exponential localization on Rd are a powerful tool in harmonic analysis by making various spaces of functions and distributions more accessible for study and…

Functional Analysis · Mathematics 2012-06-05 Thierry Coulhon , Gerard Kerkyacharian , Pencho Petrushev

Frame theory has been a popular subject in the design of structured signals and codes in recent years, with applications ranging from the design of measurement matrices in compressive sensing, to spherical codes for data compression and…

Information Theory · Computer Science 2015-10-28 Matthew Thill , Babak Hassibi

The paper introduces new sufficient conditions of strict positive definiteness for kernels on d-dimensional spheres which are not radially symmetric but possess specific coefficient structures. The results use the series expansion of the…

Numerical Analysis · Mathematics 2021-05-07 Martin Buhmann , Janin Jäger

Deep networks are nowadays becoming popular in many computer vision and pattern recognition tasks. Among these networks, deep kernels are particularly interesting and effective, however, their computational complexity is a major issue…

Computer Vision and Pattern Recognition · Computer Science 2018-12-24 Hichem Sahbi

Topological data analysis offers a rich source of valuable information to study vision problems. Yet, so far we lack a theoretically sound connection to popular kernel-based learning techniques, such as kernel SVMs or kernel PCA. In this…

Machine Learning · Statistics 2014-12-24 Jan Reininghaus , Stefan Huber , Ulrich Bauer , Roland Kwitt
‹ Prev 1 2 3 10 Next ›