Accelerating Feature Based Registration Using the Johnson-Lindenstrauss Lemma [chapter]

Ayelet Akselrod-Ballin, Davi Bock, R. Clay Reid, Simon K. Warfield
2009 Lecture Notes in Computer Science  
We introduce an efficient search strategy to substantially accelerate feature based registration. Previous feature based registration algorithms often use truncated search strategies in order to achieve small computation times. Our new accelerated search strategy is based on the realization that the search for corresponding features can be dramatically accelerated by utilizing Johnson-Lindenstrauss dimension reduction. Order of magnitude calculations for the search strategy we propose here
more » ... ate that the algorithm proposed is more than a million times faster than previously utilized naive search strategies, and this advantage in speed is directly translated into an advantage in accuracy as the fast speed enables more comparisons to be made in the same amount of time. We describe the accelerated scheme together with a full complexity analysis. The registration algorithm was applied to large transmission electron microscopy (TEM) images of neural ultrastructure. Our experiments demonstrate that our algorithm enables alignment of TEM images with increased accuracy and efficiency compared to previous algorithms.
doi:10.1007/978-3-642-04268-3_78 fatcat:3ow5ygeolfauldoyw5a43xmaxm