| Home | Organizers | Proceedings Editors | Proceedings Contributors | Search | | ||
|
|
|
|||
|
|
||||
|
||||
|
|
||||
| Title: | ULTRA-FAST HOLOGRAPHIC RECORDING AND AUTOMATIC 3D SCAN MATCHING OF LIVING HUMAN FACES | |
| DOI No: | 10.1142/9789812702678_0007 | |
| Source: | PERSPECTIVE IN IMAGE-GUIDED SURGERY (pp 43-50) | |
| Author(s): | DOMINIK GIEL
caesar foundation, Ludwig Erhard Allee 2, D-53175 Bonn, Germany SUSANNE FREY caesar foundation, Ludwig Erhard Allee 2, D-53175 Bonn, Germany ANDREA THELEN caesar foundation, Ludwig Erhard Allee 2, D-53175 Bonn, Germany JENS BONGARTZ caesar foundation, Ludwig Erhard Allee 2, D-53175 Bonn, Germany PETER HERING caesar foundation, Ludwig Erhard Allee 2, D-53175 Bonn, Germany ANDREAS NÜCHTER Fraunhofer Institute for Autonomous Intelligent Systems (AIS), Schloss Birlinghoven, D-53754 Sankt Augustin, Germany HARTMUT SURMANN Fraunhofer Institute for Autonomous Intelligent Systems (AIS), Schloss Birlinghoven, D-53754 Sankt Augustin, Germany KAI LINGEMANN Fraunhofer Institute for Autonomous Intelligent Systems (AIS), Schloss Birlinghoven, D-53754 Sankt Augustin, Germany JOACHIM HERTZBERG Fraunhofer Institute for Autonomous Intelligent Systems (AIS), Schloss Birlinghoven, D-53754 Sankt Augustin, Germany |
|
| Abstract: | 3D models of the skin surface of patients are created by ultra-fast holography and automatic scan matching of synchronously recorded holograms. By recording with a pulsed laser and continuous-wave optical reconstruction of the holographic real image, motion artifacts are eliminated. Focal analysis of the real image yields a surface relief of the patient. To generate a complete 360° patient model, several synchronously recorded reliefs are registered by automatic scan matching. We find the transformation consisting of a rotation and a translation that minimizes a cost function containing the Euclidian distances between points pairs from two surface relief maps. A variant of the ICP (Iterative Closest Points) algorithm2 is used to compute such a minimum. We propose a new fast approximation based on kD-trees for the problem of creating the closest point pairs on which the ICP algorithm spends most of its time. | |
| Full Text: | View full text in PDF format (530KB) | |
| TOC: | Back to Table of Contents | |
|
||