Skip to Main Content
 

Global Search Box

 
 
 
 

Files

File List


osu1086185793.pdf (2.99 MB)

ETD Abstract Container

Abstract Header

Real-time 3D elastic image registration

Castro Pareja, Carlos Raul
http://rave.ohiolink.edu/etdc/view?acc_num=osu1086185793

Abstract Details

2004, Doctor of Philosophy, Ohio State University, Electrical Engineering.
Real-time elastic image registration is potentially an enabling technology for the effective and efficient use of many image-guided diagnostic and treatment procedures relying on multimodality image fusion or serial image comparison. Mutual information is currently the best-known image similarity measure for multimodality image registration. A well-known problem with elastic registration algorithms is their high computational cost, with common elastic registration times in the order of hours. This complexity is due both to the large number of image similarity calculations required to converge to the optimal transformation and the time required to calculate image similarity. This dissertation presents an algorithm for elastic image registration that is optimized to minimize the execution time, and a hardware architecture for algorithm acceleration. Novel features of the algorithm include the use of a priori information to limit the search space for possible transformations, linear bound-based grid folding prevention, and adaptive optimization algorithm tolerance. The hardware architecture accelerates mutual information calculation, which is a memory-intensive task that does not benefit from cache-based memory architecture in standard software implementations, but can be efficiently implemented in a pipeline using parallel memory access techniques. Its calculation is performed in two steps, namely mutual histogram calculation and entropy accumulation. The main focus of acceleration is on mutual histogram calculation, which corresponds to about 99% of the overall mutual information calculation time. The architecture employs parallel, independent access to the image and mutual histogram memories and includes a mutual histogram partitioning scheme that allows multiple parallel accesses to the mutual histogram memory. Entropy calculation and accumulation is performed using a novel variable segment size piecewise polynomial approximation implemented using look-up tables. A proof-of-concept implementation of the architecture achieved speedups of 30x for linear registration and 100x for elastic registration against a 3.2 GHz Pentium III Xeon workstation, achieving total elastic registration times in the order of minutes. The total speedup can be increased by using several modules in parallel, thus allowing real-time performance (in the order of seconds). The architecture presented in this dissertation will be a significant tool in enabling the use of elastic image registration outside of research environments.
Jogikal Jagadeesh (Advisor)
121 p.
Image registration; Mutual information; Digital systems; Entropy calculation; Image processing

Recommended Citations

Citations

  • Castro Pareja, C. R. (2004). Real-time 3D elastic image registration [Doctoral dissertation, Ohio State University]. OhioLINK Electronic Theses and Dissertations Center. http://rave.ohiolink.edu/etdc/view?acc_num=osu1086185793

    APA Style (7th edition)

  • Castro Pareja, Carlos. Real-time 3D elastic image registration. 2004. Ohio State University, Doctoral dissertation. OhioLINK Electronic Theses and Dissertations Center, http://rave.ohiolink.edu/etdc/view?acc_num=osu1086185793.

    MLA Style (8th edition)

  • Castro Pareja, Carlos. "Real-time 3D elastic image registration." Doctoral dissertation, Ohio State University, 2004. http://rave.ohiolink.edu/etdc/view?acc_num=osu1086185793

    Chicago Manual of Style (17th edition)

osu1086185793
2,751
© 2004, all rights reserved.
This open access ETD is published by The Ohio State University and OhioLINK.