Sub pixel registration methods?
Hi,
I'm doing some sub-pixel image registration algorithms at the moment. I've been using the classic FFT based convolution to get to pixel level accuracies.
I start with the two image extracts A and B. I then apply a weighting/masking/apodisation to soften the edges. The patches are then FFT'd adn each frequency component normalised to unity if it is above the base band noise (a known prior). I do the complex conjugate product (schurr/excel style) which creates the phase difference of each component. I can then do an inverse FFT to see where the phase correlation spike is located, which indicates the image shift. The shift value is obviously an integer number of pixels.
One method of increasing the resolution is to add a border of zeros around the FTT so as to produce an effective interpolation around the original peak, but this is 'expensive'
My question is does anyone know of any alternative (preferably fast) approaches to recovering the phase slope from the patch of phase values? The phase values are of the cos(t)+i.sin(t) type and the phase will wrap across the patch.
I'm looking for suggestions as to methods I can look up, rather than doing it directly in MathCAD. The main part I'm trying to find is that it should achive sub-pixel level accuracy and be at least as fast as the inverse FFT.
Philip

