Sciweavers

10 search results - page 1 / 2
» Digit-Recurrence Algorithm for Computing Euclidean Norm of a...
Sort
View
ARITH
1999
IEEE
13 years 9 months ago
Digit-Recurrence Algorithm for Computing Euclidean Norm of a 3-D Vector
A digit-recurrence algorithm for computing the Euclidean norm of a 3-dimensional vector is proposed. Starting from the vector component with the highest order of magnitude as the ...
Naofumi Takagi, Seiji Kuwahara
ISSAC
1998
Springer
101views Mathematics» more  ISSAC 1998»
13 years 9 months ago
Efficient Algorithms for Computing the Nearest Polynomial with Constrained Roots
Continuous changes of the coefficients of a polynomial move the roots continuously. We consider the problem finding the minimal perturbations to the coefficients to move a root to...
Markus A. Hitz, Erich Kaltofen
MICCAI
2006
Springer
14 years 5 months ago
A Log-Euclidean Framework for Statistics on Diffeomorphisms
In this article, we focus on the computation of statistics of invertible geometrical deformations (i.e., diffeomorphisms), based on the generalization to this type of data of the n...
Vincent Arsigny, Olivier Commowick, Xavier Pennec,...
ICCV
2005
IEEE
13 years 10 months ago
Mutual Information-Based 3D Surface Matching with Applications to Face Recognition and Brain Mapping
Face recognition and many medical imaging applications require the computation of dense correspondence vector fields that match one surface with another. In brain imaging, surfac...
Yalin Wang, Ming-Chang Chiang, Paul M. Thompson
IPMI
2005
Springer
14 years 5 months ago
Surface Matching via Currents
Abstract. We present a new method for computing an optimal deformation between two arbitrary surfaces embedded in Euclidean 3-dimensional space. Our main contribution is in buildin...
Marc Vaillant, Joan Glaunes