Name
Abstract | ||
|---|---|---|
Current alignment algorithms for registering range data captured from a 3D scanner assume that the range data depicts identical geometry taken from different views. However, in the presence of scanner calibration errors, the data will be slightly warped. These warps often cause current alignment algorithms to converge slowly, find the wrong alignment, or even diverge. In this paper, we present a method for aligning warped range data represented by polygon meshes. Our strategy can be characterized as a coarse-to-fine hierarchical approach, where we assume that since the warp is global, we can compensate for it by treating each mesh as a collection of smaller piecewise rigid sections, which can translate and rotate with respect to each other. We split the meshes subject to several constraints, in order to ensure that the resulting sections converge reliably. |
Year | DOI | Venue |
|---|---|---|
2003 | 10.1109/IM.2003.1240279 | 3DIM |
Keywords | Field | DocType |
computational geometry,image registration,image scanners,rendering (computer graphics),3D scanners,alignment algorithms,computational geometry,hierarchical method,polygon meshes,range data registration,warped meshes alignment | Computer vision,Polygon,Rotation,Polygon mesh,Computer science,Computational geometry,Volume mesh,Scanner,Artificial intelligence,Image registration,Piecewise | Conference |
ISBN | Citations | PageRank |
0-7695-1991-1 | 24 | 1.88 |
References | Authors | |
11 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Leslie Ikemoto | 1 | 842 | 33.73 |
| Natasha Gelfand | 2 | 1236 | 67.99 |
| Marc Levoy | 3 | 10273 | 1073.33 |