Partial Least-Squares Point Matching under Translations
نویسنده
چکیده
We consider the problem of translating a given pattern set B of size m, and matching every point of B to some point of a larger ground set A of size n in an injective way, minimizing the sum of the squared distances between matched points. We show that when B can only be translated along a line, there can be at most m(n − m) + 1 different matchings as B moves along the line, and hence the optimal translation can be found in polynomial time.
منابع مشابه
A Method to Register Multiple Range Images from Unknown Viewing Directions
This paper presents a total system to register multiple range images to obtain complete object shape in the case where their relative viewing positions are unknown. To determine the relative position of. each viewpoint with respect to a common world coordinate system, the correspondences of the object's planar faces are used. For non-polyhedral objects, we produce a three dimensional convex hul...
متن کاملBottleneck Partial-Matching Voronoi Diagrams and Applications
Given two point sets in the plane, we study the minimization of the bottleneck distance between a point set B and an equallysized subset of a point set A under translations. We relate this problem to a Voronoi-type diagram and derive polynomial bounds for its complexity that are optimal in the size of A. We devise efficient algorithms for the construction of such a diagram and its lexicographic...
متن کاملRobust Image Matching under Partial Occlusion and Spatially Varying Illumination Change
Image matching is one of the most important tasks in computer vision. Most existing methods cannot achieve precise pattern matching under spatially varying illumination variations and partial occlusions. In this paper, we explicitly model spatial illumination variations as low-order polynomial functions in an energy minimization framework. Data constraints for the alignment and illumination par...
متن کاملAutomatic Post-Editing based on SMT and its selective application by Sentence-Level Automatic Quality Evaluation
In the computing assisted translation process with machine translation (MT), postediting costs time and efforts on the part of human. To solve this problem, some have attempted to automate post editing. Post-editing isn’t always necessary, however, when MT outputs are of adequate quality for human. This means that we need to be able to estimate the translation quality of each translated sentenc...
متن کاملMatching of 3D surfaces and their intensities
3D surface matching would be an ill conditioned problem when the curvature of the object surface is either homogenous or isotropic, e.g. for plane or spherical types of objects. A reliable solution can only be achieved if supplementary information or functional constraints are introduced. In a previous paper, an algorithm for the least squares matching of overlapping 3D surfaces, which were dig...
متن کامل