13,145 research outputs found
Affine matching of two sets of points in arbitrary dimensions
In many applications of computer vision, image processing, and remotely sensed data processing, an appropriate matching of two sets of points is required. Our approach assumes one-to-one correspondence between these sets and finds the optimal global affine transformation that matches them. The suggested method can be used in arbitrary dimensions. A sufficient existence condition for a unique transformation is given and proven
A Solution for Multi-Alignment by Transformation Synchronisation
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.Comment: Accepted for CVPR 2015 (please cite CVPR version
Maximal admissible faces and asymptotic bounds for the normal surface solution space
The enumeration of normal surfaces is a key bottleneck in computational
three-dimensional topology. The underlying procedure is the enumeration of
admissible vertices of a high-dimensional polytope, where admissibility is a
powerful but non-linear and non-convex constraint. The main results of this
paper are significant improvements upon the best known asymptotic bounds on the
number of admissible vertices, using polytopes in both the standard normal
surface coordinate system and the streamlined quadrilateral coordinate system.
To achieve these results we examine the layout of admissible points within
these polytopes. We show that these points correspond to well-behaved
substructures of the face lattice, and we study properties of the corresponding
"admissible faces". Key lemmata include upper bounds on the number of maximal
admissible faces of each dimension, and a bijection between the maximal
admissible faces in the two coordinate systems mentioned above.Comment: 31 pages, 10 figures, 2 tables; v2: minor revisions (to appear in
Journal of Combinatorial Theory A
- …