Sciweavers

167 search results - page 6 / 34
» Constraints for closest point finding
Sort
View
ICMCS
2006
IEEE
227views Multimedia» more  ICMCS 2006»
14 years 1 months ago
Adaptive Dual AK-D Tree Search Algorithm for ICP Registration Applications
An algorithm for finding coupling points plays an important role in the Iterative Closest Point algorithm (ICP) which is widely used in registration applications in medical and 3-...
Jiann-Der Lee, Shih-Sen Hsieh, Chung-Hsien Huang, ...
ICIP
2005
IEEE
14 years 8 months ago
An efficient algorithm for informed embedding of dirty-paper trellis codes for watermarking
Dirty paper trellis codes are a form of watermarking with side information. These codes have the advantage of being invariant to valumetric scaling of the cover Work. However, the...
Gwenaël J. Doërr, Ingemar J. Cox, Lin Li...
3DIM
2007
IEEE
14 years 1 months ago
Predetermination of ICP Registration Errors And Its Application to View Planning
We present an analytical method to estimate the absolute registration error bounds if two surfaces were to be aligned using the ICP (Iterative Closest Point) algorithm. The estima...
Kok-Lim Low, Anselmo Lastra
CVPR
2003
IEEE
14 years 9 months ago
Implicit Meshes for Modeling and Reconstruction
Explicit surfaces, such as triangulations or wireframe models, have been extensively used to represent the deformable 3?D models that are used to fit 3?D point and 2?D silhouette ...
Slobodan Ilic, Pascal Fua
HICSS
2008
IEEE
107views Biometrics» more  HICSS 2008»
14 years 1 months ago
Research on Constraints in Anti-Money Laundering (AML) Business Process in China Based on Theory of Constraints
Anti-money laundering is a pressing issue in today’s economy. With the newly launched Chinese anti-money laundering regulation, this issue has drawn more and more attention from...
Xuan Liu, Pengzhu Zhang