Robust registration of two 3-D point sets is a common problem in computer vision. The Iterative Closest Point (ICP) algorithm is undoubtedly the most popular algorithm for solving...
We propose a novel technique for tract-based comparison of DTI-indices between groups, based on a representation that is estimated while matching fiber tracts. The method involves ...
Matthan Caan, Lucas J. van Vliet, Charles B. L. ...
We propose a method that computes a conformal mapping from a multiply connected mesh to the so-called slit domain, which consists of a canonical rectangle or disk in which 3D curve...
Yalin Wang, Xianfeng Gu, Tony F. Chan, Paul M. ...
The puzzle assembly problem has many application areas such as restoration and reconstruction of archeological findings, repairing of broken objects, solving jigsaw type puzzles, ...
In this paper we address the problem of multimodal registration of coronary vessels by developing a 3D parametrical model of vessel trees from computer tomography data and registe...
Georg Langs, Petia Radeva, David Rotger, Francesc ...