Fully-Deformable 3D Image Registration in Two Seconds
We present a highly parallel method for accurate and efficient variational deformable 3D image registration on a consumer-grade graphics processing unit (GPU). We build on recent matrix-free variational approaches and specialize the concepts to the massively-parallel manycore architecture provided by the GPU. Compared to a parallel and optimized CPU implementation, this allows us to achieve an average speedup of 32:53 on 986 real-world CT thorax-abdomen follow-up scans. At a resolution of approximately 2563 voxels, the average runtime is 1:99 seconds for the full registration. On the publicly available DIR-lab benchmark, our method ranks third with respect to average landmark error at an average runtime of 0:32 seconds.
Unable to display preview. Download preview PDF.
- 1.König L, Rühaak J. A fast and accurate parallel algorithm for non-linear image registration using normalized gradient fields. Proc ISBI. 2014; p. 580-583.Google Scholar
- 3.Meike M. GPU-basierte nichtlineare Bildregistrierung [mathesis]. 2016;.Google Scholar
- 4.Modersitzki J. FAIR: Flexible Algorithms for Image Registration. Proc SIAM; 2009.Google Scholar
- 7.Wilt N. The CUDA Handbook: A Comprehensive Guide to GPU Programming. Addison-Wesley; 2013.Google Scholar