506 search results - page 95 / 102 » Robust Registration of 2D and 3D Point Sets |
CSB
2004
IEEE
13 years 11 months ago
2004
IEEE
Ascertaining the similarity amongst molecules is a fundamental problem in biology and drug discovery. Since similar molecules tend to have similar biological properties, the notio...
CGF
2006
13 years 7 months ago
2006
We propose a new technique for quad-dominant remeshing which separates the local regularity requirements from the global alignment requirements by working in two steps. In the fir...
FOCS
2002
IEEE
14 years 13 days ago
2002
IEEE
Two decades ago, Megiddo and Dyer showed that linear programming in two and three dimensions (and subsequently any constant number of dimensions) can be solved in linear time. In ...
CVPR
2009
IEEE
15 years 2 months ago
2009
IEEE
In this paper, we introduce a novel algorithm to solve
global shape registration problems. We use gray-scale “images”
to represent source shapes, and propose a novel twocompo...
CVPR
2005
IEEE
14 years 9 months ago
2005
IEEE
In earlier work, we proposed treating wide baseline matching of feature points as a classification problem, in which each class corresponds to the set of all possible views of suc...