Sciweavers

1539 search results - page 26 / 308
» Fast and Simple Methods For Computing Control Points
Sort
View
ICPR
2002
IEEE
14 years 9 months ago
The Trimmed Iterative Closest Point Algorithm
The problem of geometric alignment of two roughly preregistered, partially overlapping, rigid, noisy 3D point sets is considered. A new natural and simple, robustified extension o...
Dmitry Chetverikov, D. Svirko, Dmitry Stepanov, Pa...
CW
2002
IEEE
14 years 1 months ago
Free-Form Deformation with Automatically Generated Multiresolution Lattices
Developing intuitive and efficient methods for shape editing is one of the most important areas in computer graphics, and free-form deformation (FFD), which is one of such methods...
Yutaka Ono, Bing-Yu Chen, Tomoyuki Nishita, Jieqin...
ICPR
2008
IEEE
14 years 3 months ago
Shape from self-calibration and Fast Marching Method
Shape-from-shading methods recover 3-D shape from intensity images. Often, Lambertian reflectance is assumed. The Lambertian assumption is attractive because it simplifies the a...
Yuji Iwahori, Takashi Nakagawa, Robert J. Woodham,...
PAMI
2000
127views more  PAMI 2000»
13 years 8 months ago
Geometric Camera Calibration Using Circular Control Points
Modern CCD cameras are usually capable of a spatial accuracy greater than 1/50 of the pixel size. However, such accuracy is not easily attained due to various error sources that c...
Janne Heikkilä
ICMCS
2006
IEEE
1179views Multimedia» more  ICMCS 2006»
14 years 2 months ago
A Simple and Accurate Color Face Detection Algorithm in Complex Background
Human face detection plays an important role in many applications such as video surveillance, face recognition, and face image database management. This paper describes a fast fac...
Yu-Ting Pai, Shanq-Jang Ruan, Mon-Chau Shie, Yi-Ch...