Related papers: Hodgelets: Localized Spectral Representations of F…
Wavelets have proven to be highly successful in several signal and image processing applications. Wavelet design has been an active field of research for over two decades, with the problem often being approached from an analytical…
In graph learning, maps between graphs and their subgraphs frequently arise. For instance, when coarsening or rewiring operations are present along the pipeline, one needs to keep track of the corresponding nodes between the original and…
The scale and complexity of modern data sets and the limitations associated with testing large numbers of hypotheses underline the need for feature selection methods. Spectral techniques rank features according to their degree of…
Recently, neural network architectures have been developed to accommodate when the data has the structure of a graph or, more generally, a hypergraph. While useful, graph structures can be potentially limiting. Hypergraph structures in…
Wavelet theory has been well studied in recent decades. Due to their appealing features such as sparse multiscale representation and fast algorithms, wavelets have enjoyed many tremendous successes in the areas of signal/image processing…
We consider geodesic flows between hypersurfaces in $\R^n$. However, rather than consider using geodesics in $\R^n$, which are straight lines, we consider an induced flow using geodesics between the tangent spaces of the hypersurfaces…
Determining whether two graphs are isomorphic is a fundamental problem with practical applications in areas such as molecular chemistry or social network analysis, yet it remains a challenging task, with exact solutions often being…
We construct and analyze an explicit basis for the homology of the boolean complex of a Coxeter system. This gives combinatorial meaning to the spheres in the wedge sum describing the homotopy type of the complex. We assign a set of…
We investigate wavelet-like localized solutions in nonlinear waveguides, enabled by complementary propagation constants embedded in domains of anomalous dispersion. They are carrier-envelope-phase stable and independent of fine details of…
We introduce an unsupervised graph embedding that trades off local node similarity and connectivity, and global structure. The embedding is based on a generalized graph Laplacian, whose eigenvectors compactly capture both network structure…
Let $\mathbb{H}$ be the three-dimensional Heisenberg group. We introduce a structure on the Heisenberg group which consists of the biregular representation of $\mathbb{H\times H}$ restricted to some discrete subset of $\mathbb{H\times H}$…
We propose a flexible framework for defining the 1-Laplacian of a hypergraph that incorporates edge-dependent vertex weights. These weights are able to reflect varying importance of vertices within a hyperedge, thus conferring the…
In the general context of complex data processing, this paper reviews a recent practical approach to the continuous wavelet formalism on the sphere. This formalism notably yields a correspondence principle which relates wavelets on the…
We construct spherical wavelets based on approximate identities that are directional, i.e. not rotation-invariant, and have an adaptive angular selectivity. The problem of how to find a proper representation of distinct kinds of details of…
Flow equation methods, more generally known as Similarity Renormalization Group (SRG) techniques, were developed to address multiscale problems where multiple length or energy scales contribute simultaneously. In this Thesis, we formulate…
We develop a general notion of orthogonal wavelets `centered' on an irregular knot sequence. We present two families of orthogonal wavelets that are continuous and piecewise polynomial. We develop efficient algorithms to implement these…
We consider the problem of classifying trajectories on a discrete or discretised 2-dimensional manifold modelled by a simplicial complex. Previous works have proposed to project the trajectories into the harmonic eigenspace of the Hodge…
Node embeddings map graph vertices into low-dimensional Euclidean spaces while preserving structural information. They are central to tasks such as node classification, link prediction, and signal reconstruction. A key goal is to design…
This paper investigates the potential applications of a parametric family of polynomial wavelets that has been recently introduced starting from de la Vall\'ee Poussin (VP) interpolation at Chebyshev nodes. Unlike classical wavelets, which…
In continuous-time wavelet analysis, most wavelet present some kind of symmetry. Based on the Fourier and Hartley transform kernels, a new wavelet multiresolution analysis is proposed. This approach is based on a pair of orthogonal wavelet…