GPU Acceleration of Robust Point Matching

Abstract. Robust Point Matching (RPM) is a common image registration algo-rithm, yet its large computational complexity prohibits registering large point sets in a timely manner. With recent advances in General Purpose Graphical Process-ing Units (GPGPUs), commodity hardware is capable of greatly reducing the execution time of RPM when non-rigidly aligning thousands of data points. In this paper, we identify areas where parallelism can be exploited in the RPM algo-rithm, and investigate a GPU-based approach to accelerate the implementation. Other common RPM implementations are compared with our solution. Experi-ments on synthetic and real data sets show that our approach achieves close to linear speed-up with respect to total computational power over the widely used Matlab implementation. Our tests indicate that utilizing our implementation on current state of the art GPU technology would enable the use of vastly greater point set sizes.