Abstract
Even for reasonably sized three-dimensional (3D) images, image registration becomes a computationally intensive task. Here, we introduce and explore the concept of octrees for registration which drastically reduces the amount of processed data and thus the computational costs. We show how to map the registration problem onto an octree and present a suitable optimization technique. Furthermore, we demonstrate the performance of the new approach by academic (twodimensional) as well as real life (3D) examples. These examples indicate that the computational time can be reduced by a factor of 3-4 compared with standard approaches.
Original language | English |
---|---|
Journal | SIAM Journal on Scientific Computing |
Volume | 29 |
Issue number | 5 |
Pages (from-to) | 2008-2023 |
Number of pages | 16 |
ISSN | 1064-8275 |
DOIs | |
Publication status | Published - 01.12.2007 |