No abstract

A simple algorithm is presented for planar image registration and the method is applied to the simulator and portal image registration for patient setup verification in radiation therapy. Basically, the algorithm follows the concept proposed by Balter et al. [Med. Phys. 19, 329-334 (1992)], which converts the problem of open curve registration into matching a series of points along the curves. Balter's algorithm consists of three steps: (1) to determine a common starting point for each curve pair, (2) acquire two corresponding point sets along each curve, and (3) obtain a global transform matrix by matching two point sets. We integrate all three steps into one simple procedure which fits the sampled points along the intended curve pair by taking the relative path length shift as an independent fitting parameter. After being modified, the algorithm is able to take the different magnification factors of images into account, and it avoids curvature calculations. Numerical simulation as well as clinical and phantom images have been utilized to test the accuracy of the algorithm. The typical errors are less than 1 mm in translation and 1 degree in rotation. We also made a comparison study with the chamfer method. The results of the two methods agree to within 0.5 mm in translation and 0.5 degree in rotation.

The conventional method for source localization in an interstitial ribbon implant by means of biplane radiographs can be difficult, especially when a large number of seeds are involved. We present a new algorithm for more efficient source localization with the same conventional biplane radiographs. The method does not require a one-to-one source correspondence between two radiographs. The user needs only to digitize several points, following the shape of each ribbon from both films. The points that are digitized do not need to be the location of the seeds, and they do not have to correspond to the same points on both films. The algorithm uses the multidimensional minimization method to reconstruct the three-dimensional locus of the ribbon. The location of each seed is then determined by its pathlength relative to the corresponding starting point. We have used phantom experiments and clinical cases to test the reliability of the algorithm. The results show that the errors in the determination of seed locations are less than 2 mm, and the efficiency in source digitization for data entry can be increased by a factor up to 5. © 1997 American Association of Physicists in Medicine. ͓S0094-2405͑97͒01608-8͔