The alignment of a set of objects by means of transformations plays an important role in computer vision. Whilst the case for only two objects can be solved globally, when multiple objects are considered usually iterative methods are used. In practice the iterative methods perform well if the relative transformations between any pair of objects are free of noise. However, if only noisy relative transformations are available (e.g. due to missing data or wrong correspondences) the iterative methods may fail.Based on the observation that the underlying noise-free transformations can be retrieved from the null space of a matrix that can directly be obtained from pairwise alignments, this paper presents a novel method for the synchronisation of pairwise transformations such that they are transitively consistent.Simulations demonstrate that for noisy transformations, a large proportion of missing data and even for wrong correspondence assignments the method delivers encouraging results.
The Kuramoto model of a system of coupled phase oscillators describe synchronization phenomena in nature. We propose a generalization of the Kuramoto model where each oscillator state lives on the compact, real Stiefel manifold St(p, n). Previous work on high-dimensional Kuramoto models have largely been influenced by results and techniques that pertain to the original model. This paper uses optimization and control theory to prove that the generalized Kuramoto model on St(p, n) converges to a completely synchronized state for any connected graph from almost all initial conditions provided (p, n) satisfies p ≤ 2 3 n − 1 and all oscillator frequencies are equal. This result could not have been predicted based on knowledge of the Kuramoto model in complex networks on the circle with homogeneous oscillator frequencies. In that case, almost global synchronization is graph dependent; it applies if the network is acyclic or sufficiently dense. The problem of characterizing all such graphs is still open. This paper hence identifies a property that distinguishes many highdimensional generalizations of the Kuramoto model from the original model. It should therefore have important implications for modeling of synchronization phenomena in physics and control of multi-agent systems in engineering applications.
α = +[ PCA (global support) Our (local support) PCA (global support) Our (local support) PCA (global support)Our (local support)Global support factors of PCA lead to implausible body shapes, whereas the local support factors of our method give more realistic results. See our accompanying video for animated results. AbstractRepresenting 3D shape deformations by highdimensional linear models has many applications in computer vision and medical imaging. Commonly, using Principal Components Analysis a low-dimensional subspace of the high-dimensional shape space is determined. However, the resulting factors (the most dominant eigenvectors of the covariance matrix) have global support, i.e. changing the coefficient of a single factor deforms the entire shape. Based on matrix factorisation with sparsity and graph-based regularisation terms, we present a method to obtain deformation factors with local support. The benefits include better flexibility and interpretability as well as the possibility of interactively deforming shapes locally. We demonstrate that for brain shapes our method outperforms the state of the art in local support models with respect to generalisation and sparse reconstruction, whereas for body shapes our method gives more realistic deformations. 0 c 2015 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes, creating new collective works, for resale or redistribution to servers or lists, or reuse of any copyrighted component of this work in other works.
This paper addresses the consensus problem and the formation problem on SE(3) in multi-agent systems with directed and switching interconnection topologies. Several control laws are introduced for the consensus problem. By a simple transformation, it is shown that the proposed control laws can be used for the formation problem. The design is first conducted on the kinematic level, where the velocities are the control laws. Then, for rigid bodies in space, the design is conducted on the dynamic level, where the torques and the forces are the control laws. On the kinematic level, first two control laws are introduced that explicitly use Euclidean transformations, then separate control laws are defined for the rotations and the translations. In the special case of purely rotational motion, the consensus problem is referred to as consensus on SO(3) or attitude synchronization. In this problem, for a broad class of local representations or parameterizations of SO(3), including the Axis-Angle Representation, the Rodrigues Parameters and the Modified Rodrigues Parameters, two types of control laws are presented that look structurally the same for any choice of local representation. For these two control laws we provide conditions on the initial rotations and the connectivity of the graph such that the system reaches consensus on SO(3). Among the contributions of this paper, there are conditions for when exponential rate of convergence occur. A theorem is provided showing that for any choice of local representation for the rotations, there is a change of coordinates such that the transformed system has a well known structure.
This paper provides analytical solutions to the closed-loop kinematics of two almost globally exponentially stabilizing attitude control laws on the special orthogonal group SO(n). By studying the general case we give a uniform treatment to the cases of SO(2) and SO(3), which are the most interesting dimensions for application purposes. Working directly with rotation matrices in the case of SO(3) allows us to avoid certain complications which may arise when using local and global many-to-one parameterizations. The analytical solutions provide insight into the transient behaviour of the system and are of theoretical value since they can be used to prove almost global attractiveness of the identity matrix. The practical usefulness of analytical solutions in problems of continuous time actuation subject to piece-wise unavailable or discrete time sensing are illustrated by numerical examples.
The reconstruction of an object's shape or surface from a set of 3D points plays an important role in medical image analysis, e.g. in anatomy reconstruction from tomographic measurements or in the process of aligning intra-operative navigation and preoperative planning data. In such scenarios, one usually has to deal with sparse data, which significantly aggravates the problem of reconstruction. However, medical applications often provide contextual information about the 3D point data that allow to incorporate prior knowledge about the shape that is to be reconstructed. To this end, we propose the use of a statistical shape model (SSM) as a prior for surface reconstruction. The SSM is represented by a point distribution model (PDM), which is associated with a surface mesh. Using the shape distribution that is modelled by the PDM, we formulate the problem of surface reconstruction from a probabilistic perspective based on a Gaussian Mixture Model (GMM). In order to do so, the given points are interpreted as samples of the GMM. By using mixture components with anisotropic covariances that are "oriented" according to the surface normals at the PDM points, a surface-based fitting is accomplished. Estimating the parameters of the GMM in a maximum a posteriori manner yields the reconstruction of the surface from the given data points. We compare our method to the extensively used Iterative Closest Points method on several different anatomical datasets/SSMs (brain, femur, tibia, hip, liver) and demonstrate superior accuracy and robustness on sparse data.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.