Results 1 - 10 of 142

Subpixel Registration of Images

by Harold Stone, Michael Orchard, Ee-chien Chang - Proceedings of the 1999 Asilomar Conference on Signals, Systems, and Computers , 1999
"... Phase correlation has been studied as a tool for registering pairs of images to subpixel resolution. Shekarforoush et al investigated an algorithm that works well for when observed data are samples of ideally bandlimited images. In fact, images of real scenes captured by modern optics are not ideall ..."
Abstract - Cited by 9 (0 self) - Add to MetaCart
are not ideally bandlimitedimages. This paper examines how aliasing in sampled images effects the ideal phase relationships between continuous images undergoing translational shifts. We show that the performance of standard phase correlation methods for subpixel image registration can be severely degraded

Extension of phase correlation to subpixel registration

by Hassan Foroosh (shekarforoush, Josiane B. Zerubia, Senior Member, Marc Berthod - IEEE Trans. on Image Processing , 2002
"... Abstract—In this paper, we have derived analytic expressions for the phase correlation of downsampled images. We have shown that for downsampled images the signal power in the phase correlation is not concentrated in a single peak, but rather in several coherent peaks mostly adjacent to each other. ..."
Abstract - Cited by 2 (0 self) - Add to MetaCart
. These coherent peaks correspond to the polyphase transform of a filtered unit impulse centered at the point of registration. The analytic results provide a closed-form solution to subpixel translation estimation, and are used for detailed error analysis. Excellent results have been obtained for subpixel

Class of Algorithms for Realtime Subpixel Registration

by Robert W. Frischholz, Klaus P. Spinnler - Proceedings of SPIE, Vol
"... In 1972, Barnea and Silverman presented a new approach to the wide field of template matching, the SSD--algorithm. Further work has been done to adapt the method to gain subpixel accuracy. Intense investigation of the proposed algorithms led to our new approach: by interpolating the template instead ..."
Abstract - Cited by 10 (0 self) - Add to MetaCart
be expected. Depending on the kind of image, mean square errors range from 0.4% to 4%. INTRODUCTION In 1972, Barnea and Silverman presented the SSD--algorithm, a fast way to solve the problem of image registration [1]. Extending it to subpixel accuracy ([2],[3]), nevertheless, increased the computational

Subpixel Registration in renal perfusion MR image sequence

by Ying Sun, José M. F. Moura, Chien Ho - in Proc. 2004 IEEE Int. Symp. Biomedical Imaging, Arlington,VA , 2004
"... We propose a subpixel registration algorithm to deal with the motion induced by breathing for renal perfusion MR image sequences. Our approach minimizes an energy functional that integrates a motion model and temporal smoothness constraints. We then present a multistage level set method that segment ..."
Abstract - Cited by 5 (1 self) - Add to MetaCart
We propose a subpixel registration algorithm to deal with the motion induced by breathing for renal perfusion MR image sequences. Our approach minimizes an energy functional that integrates a motion model and temporal smoothness constraints. We then present a multistage level set method

Subpixel Registration Directly from the Phase Difference

by Murat Balci, Hassan Foroosh , 2006
"... This paper proposes a new approach to subpixel registration, under local/global shifts or rotation, using the phase-difference matrix. We establish the exact relationship between the continuous and the discrete phase difference of two shifted images and show that their discrete phase difference is a ..."
Abstract - Add to MetaCart
This paper proposes a new approach to subpixel registration, under local/global shifts or rotation, using the phase-difference matrix. We establish the exact relationship between the continuous and the discrete phase difference of two shifted images and show that their discrete phase difference

Multiresolution Approach to Subpixel Registration by Linear Approximation of PSF

by unknown authors
"... Abstract—Linear approximation of point spread function (PSF) is a new method for determining subpixel translations between images. The problem with the actual algorithm is the inability of determining translations larger than 1 pixel. In this paper a multiresolution technique is proposed to deal wit ..."
Abstract - Add to MetaCart
Abstract—Linear approximation of point spread function (PSF) is a new method for determining subpixel translations between images. The problem with the actual algorithm is the inability of determining translations larger than 1 pixel. In this paper a multiresolution technique is proposed to deal

Multiresolution Approach to Subpixel Registration by Linear Approximation of PSF

by Erol Seke, Kemal Özkan
"... Abstract—Linear approximation of point spread function (PSF) is a new method for determining subpixel translations between images. The problem with the actual algorithm is the inability of determining translations larger than 1 pixel. In this paper a multiresolution technique is proposed to deal wit ..."
Abstract - Add to MetaCart
Abstract—Linear approximation of point spread function (PSF) is a new method for determining subpixel translations between images. The problem with the actual algorithm is the inability of determining translations larger than 1 pixel. In this paper a multiresolution technique is proposed to deal

A fast direct Fourier-based algorithm for subpixel registration of images

by Harold S. Stone, Michael T. Orchard, Ee-chien Chang, Stephen A. Martucci, Senior Member - IEEE Transactions on Geoscience and Remote Sensing , 2001
"... Abstract—This paper presents a new direct Fourier-based algorithm for performing image-to-image registration to subpixel accuracy, where the image differences are restricted to translations and uniform changes of illumination. The algorithm detects the Fourier components that have become unreliable ..."
Abstract - Cited by 43 (1 self) - Add to MetaCart
Abstract—This paper presents a new direct Fourier-based algorithm for performing image-to-image registration to subpixel accuracy, where the image differences are restricted to translations and uniform changes of illumination. The algorithm detects the Fourier components that have become unreliable

A Pyramid Approach to Sub-Pixel Registration Based on Intensity

by Philippe Thevenaz, Urs Ruttiman, Michal Unser , 1998
"... We present an automatic sub-pixel registration algorithm that minimizes the mean square intensity difference between a reference and a test data set, which can be either images (2-D) or volumes (3-D). It uses an explicit spline representation of the images in conjunction with spline processing, and ..."
Abstract - Cited by 237 (18 self) - Add to MetaCart
We present an automatic sub-pixel registration algorithm that minimizes the mean square intensity difference between a reference and a test data set, which can be either images (2-D) or volumes (3-D). It uses an explicit spline representation of the images in conjunction with spline processing

Subpixel Image Registration Using Circular Fiducials

by Alon Efrat, Craig Gotsman , 1994
"... The design of fiducials for precise image registration is of major practical importance in computer vision, especially in automatic inspection applications. We analyze the subpixel registration accuracy that can, and cannot, be achieved by some rotation-invariant fiducials, and present and analyze e ..."
Abstract - Cited by 12 (0 self) - Add to MetaCart
The design of fiducials for precise image registration is of major practical importance in computer vision, especially in automatic inspection applications. We analyze the subpixel registration accuracy that can, and cannot, be achieved by some rotation-invariant fiducials, and present and analyze
Results 1 - 10 of 142