Edge-Based Robust Image Registration for Incomplete and Partly Erroneous Data
In image registration it is vital to perform matching of those points in a pair of images which actually match each other, and to postpone those which do not match. It is not always known in advance, however, which points have their counterparts, and where are they located. To overcome this, we propose to use the Hausdorff distance function modified by using a voting scheme as a fitting quality function. This known function performs very well in guiding the matching process and supports stable matches even for low quality data. It also makes it possible to speed up the algorithms in various ways. An application to accuracy assessment of oncological radiotherapy is presented. Low contrast of images used to perform this task makes this application a challenging test.
Keywordsimage restoration Hausdorff distance
- 1.Aaltonen-Brahme, P., Brahme, A. et al.: Specification of dose delivery in radiation therapy. Acta Oncologica, 36(Supplementum 10) (1977)Google Scholar
- 3.Borgefors, G.: Hierarchical chamfer matching: A parametric edge matching algorithm. IEEE Trans. PAMI 10(6) (1988) 849–865Google Scholar
- 7.Chetverikov, D., Khenokh, Y.: Matching for shape defect detection. Proc. Conf. Computer Analysis of Images and Patterns (CAIP’99, Ljubljana, Slovenia). Lecture Notes on Computer Science, vol. 1689. Springer Verlag (Sept 1999) 367–374Google Scholar
- 14.Huttenlocher, D.P., Rucklidge, W.J.: A multi-resolution technique for comparing images using the Hausdorff distance. Proc. IEEE Conf. on Computer Vision and Pattern Recognition. New York (Jun 1993) 705–706Google Scholar