Wavelet transform on manifolds: old and new approaches
Graph Chatbot
Chat with Graph Search
Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
A magnet is a pair u, v of adjacent vertices such that the proper neighbours of u are completely linked to the proper neighbours of v. It has been shown that one can reduce the graph by removing the two vertices u, v of a magnet and introducing a new verte ...
We analyse the relations between several graph transformations that were introduced to be used in procedures determining the stability number of a graph. We show that all these transformations can be decomposed into a sequence of edge deletions and twin de ...
This paper brings together two fundamental topics: polyhedral projection and parametric linear programming. First, it is shown that, given a parametric linear program (PLP), a polyhedron exists whose projection provides the solution to the PLP. Second, the ...
We review the coherent state or group-theoretical construction of the continuous wavelet transform (CWT) on the two-sphere. Next we describe the construction of a CWT on the upper sheet of a two-sheeted hyperboloid, emphasizing the similarities between the ...
This paper describes a two-sweep control design method to stabilize the acrobot, an input-affine under-actuated system, at the upper equilibrium point. In the forward sweep, the system is successively reduced, one dimension at a time, until a two-dimensiona ...
We show that every graph G with maximum degree three has a straight-line drawing in the plane using edges of at most five different slopes. Moreover, if G is connected and has at least one vertex of degree less than three, then four directions suffice. ...
We review the known construction of the continuous wavelet transform (CWT) on the two-sphere. Next we describe the construction of a CWT on the upper sheet of a two- sheeted hyperboloid, emphasizing the similarities between the two cases. Finally we give s ...
Routing packets is a central function of multi-hop wireless networks. Traditionally, there have been two paradigms for routing, either based on the geographical coordinates of the nodes (geographic routing), or based on the connectivity graph (topology-bas ...
We review the construction of the continuous wavelet transform (CWT) on the two-sphere by two methods, the group-theoretical approach and the geometrical method based on conformal invariance. Then we discuss the discretization of the spherical CWT, obtaini ...
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 plane and on the sph ...