Related papers: Hamiltonian approach to geodesic image matching
Some positive answers to the problem of endowing a dynamical system with a Hamiltonian formulation are presented within the class of Poisson structures in a geometric framework. We address this problem on orientable manifolds and by using…
This paper addresses how to construct features for the problem of image correspondence, in particular, the paper addresses how to construct features so as to maintain the right level of invariance versus discriminability. We show that…
We propose a family of optimization methods that achieve linear convergence using first-order gradient information and constant step sizes on a class of convex functions much larger than the smooth and strongly convex ones. This larger…
Finding correspondences between 3D shapes is a crucial problem in computer vision and graphics, which is for example relevant for tasks like shape interpolation, pose transfer, or texture transfer. An often neglected but essential property…
The focus of the thesis is to obtain a universal formalism to evaluate the perturbations during inflation at all orders that can be applied to any theory of gravity and matter source in the early universe. We first look at the equivalence…
The compatibility between the conformal symmetry and the closure of conformal algebras is discussed on the nonlinear sigma model. The present approach, above the basis of field redefinition employed in the Hamiltonian scheme, attempts the…
Motivated by the wide-ranging applications of Hamiltonian decompositions in distributed computing, coded caching, routing, resource allocation, load balancing, and fault tolerance, our work presents a comprehensive design for Hamiltonian…
We present a new method for obtaining matched solutions of the rms envelope equations. In this approach, the envelope equations are first expressed in Hamiltonian form. The Hamiltonian defines a nonlinear mapping, $\cal M$, and for periodic…
Continuous image morphing is a classical task in image processing. The metamorphosis model proposed by Trouv\'e, Younes and coworkers casts this problem in the frame of Riemannian geometry and geodesic paths between images. The associated…
Geometric matching is a key step in computer vision tasks. Previous learning-based methods for geometric matching concentrate more on improving alignment quality, while we argue the importance of naturalness issue simultaneously. To deal…
In this paper, we study and build the Hamiltonian system attached to any $\mathfrak{gl}_2(\mathbb{C})$ meromorphic connection with an arbitrary number of non-ramified poles of arbitrary degrees. In particular, we propose the Lax pairs and…
We study the problem of diffeomorphometric geodesic landmark matching where the objective is to find a diffeomorphism that via its group action maps between two sets of landmarks. It is well-known that the motion of the landmarks, and…
Hamilton flows on K\"ahler manifold for which all trajectories are $H$-planar curves (complex analog of geodesics) are considered. These flows are called $H$-planar. The equation which has to obey the Hamiltonian of $H$-planar Hamilton flow…
This paper develops the metric theory of simultaneous inhomogeneous Diophantine approximation on a planar curve with respect to multiple approximating functions. Our results naturally generalize the homogeneous Lebesgue measure and Hausdor?…
We consider symmetries and perturbed symmetries of canonical Hamiltonian equations of motion. Specifically we consider the case in which the Hamiltonian equations exhibit a Lambda symmetry under some Lie point vector field. After a brief…
We implement the method developed in [1] to construct the most general parametrised action for linear cosmological perturbations of bimetric theories of gravity. Specifically, we consider perturbations around a homogeneous and isotropic…
We study three classical graph problems - Hamiltonian path, minimum spanning tree, and minimum perfect matching on geometric graphs induced by bichromatic (red and blue) points. These problems have been widely studied for points in the…
This article considers Hamiltonian mechanical systems with potential functions admitting jump discontinuities. The focus is on accurate and efficient numerical approximations of their solutions, which will be defined via the laws of…
A Hamiltonian decomposition of a regular graph is a partition of its edge set into Hamiltonian cycles. The problem of finding edge-disjoint Hamiltonian cycles in a given regular graph has many applications in combinatorial optimization and…
Using the methods of symplectic geometry, we establish the existence of a canonical transformation from potential model Hamiltonians of standard form in a Euclidean space to an equivalent geometrical form on a manifold, where the…