Sciweavers

PAMI
2010
241views more  PAMI 2010»
12 years 11 months ago
Point Set Registration: Coherent Point Drift
We introduce Coherent Point Drift (CPD), a novel probabilistic method for nonrigid registration of point sets. The registration is treated as a Maximum Likelihood (ML) estimation ...
Andriy Myronenko, Xubo B. Song
MCS
2010
Springer
13 years 2 months ago
Resolution-stationary random number generators
Besides speed and period length, the quality of uniform random number generators is usually assessed by measuring the uniformity of their point sets, formed by taking vectors of s...
François Panneton, Pierre L'Ecuyer
COMGEO
2004
ACM
13 years 4 months ago
Convexity minimizes pseudo-triangulations
The number of minimum pseudo-triangulations is minimized for point sets in convex position. 2004 Elsevier B.V. All rights reserved.
Oswin Aichholzer, Franz Aurenhammer, Hannes Krasse...
GC
2007
Springer
13 years 4 months ago
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles
We propose a novel subdivision of the plane that consists of both convex polygons and pseudotriangles. This pseudo-convex decomposition is significantly sparser than either conve...
Oswin Aichholzer, Clemens Huemer, S. Kappes, Betti...
COMGEO
2006
ACM
13 years 4 months ago
Compatible triangulations and point partitions by series-triangular graphs
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...
Jeff Danciger, Satyan L. Devadoss, Don Sheehy
ICASSP
2010
IEEE
13 years 4 months ago
Shape matching based on graph alignment using hidden Markov models
We present a novel framework based on hidden Markov models (HMMs) for matching feature point sets, which capture the shapes of object contours of interest. Point matching algorith...
Xiaoning Qian, Byung-Jun Yoon
VMV
2003
170views Visualization» more  VMV 2003»
13 years 5 months ago
Performance Analysis of Nearest Neighbor Algorithms for ICP Registration of 3-D Point Sets
There are many nearest neighbor algorithms tailormade for ICP, but most of them require special input data like range images or triangle meshes. We focus on efficient nearest nei...
Timo Zinßer, Jochen Schmidt, Heinrich Nieman...
CCCG
2008
13 years 6 months ago
On distinct distances among points in general position and other related problems
A set of points in the plane is said to be in general position if no three of them are collinear and no four of them are cocircular. If a point set determines only distinct vector...
Adrian Dumitrescu
CCCG
2008
13 years 6 months ago
Competitive Search for Longest Empty Intervals
A problem arising in statistical data analysis and pattern recognition is to find a longest interval free of data points, given a set of data points in the unit interval. We use t...
Peter Damaschke
CCCG
2010
13 years 6 months ago
k-sets and continuous motion in R3
We prove several new results concerning k-sets of point sets on the 2-sphere (equivalently, for signed point sets in the plane) and k-sets in 3-space. Specific results include sph...
Marek Sulovský, Uli Wagner