Image registration finds a variety of applications in computer vision. Unfortunately, traditional image registration techniques tend to be costly. We present a new image registration technique that makes use of the spatial intensity gradient of the images to find a good match using a type of Newton-Raphson iteration. Our technique is faster because it examines far fewer potential matches between the images than existing techniques. Furthermore, this registration technique can be generalized to handle rotation, scaling and shearing. We show show our technique can be adapted for use in a stereo vision system. 1. Introduction Image registration finds a variety of applications in computer vision, such as image matching for stereo vision, pattern recognition, and motion analysis. Untortunately, existing techniques for image registration tend to be costly. Moreover, they generally fail to deal with rotation or other distortions of the images. In this paper we present a new image registratio...

Image registration finds a variety of applications in computer vision. Unfortunately, traditional image registration techniques tend to be costly. We present a new image registration technique that makes use of the spatial intensity gradient of the images to find a good match using a type of Newton-Raphson iteration. Our technique is faster because it examines far fewer potential matches between the images than existing techniques. Furthermore, this registration technique can be generalized to handle rotation, scaling and shearing. We show show our technique can be adapted for use in a stereo vision system. 1. Introduction Image registration finds a variety of applications in computer vision, such as image matching for stereo vision, pattern recognition, and motion analysis. Untortunately, existing techniques for image registration tend to be costly. Moreover, they generally fail to deal with rotation or other distortions of the images. In this paper we present a new image registra...

A recursive filter or parameterized curve fitting technique is usually used in a three-dimensional variational data assimilation (3DVAR) scheme to approximate the background error covariance, which can only represent the errors of an ocean field over a predetermined scale. Without an accurate flow-dependent error covariance that is also local and time dependent, a 3DVAR system may not provide good analyses because it is optimal only under the assumption of an accurate covariance. In this study, a sequential 3DVAR (S3DVAR) is formulated in model grid space to examine if there is useful information that can be extracted from the observation. This formulation is composed of a series of 3DVARs, each of which uses recursive filters with different length scales. It can provide an inhomogeneous and anisotropic analysis for the wavelengths that can be resolved by the observation network, just as with the conventional Barnes analysis or successive corrections. Being a variational formulation, S3DVAR can deal with data globally with an explicit specification of the observation errors; explicit physical balances or constraints; and advanced datasets, such as satellite and radar. Even though the S3DVAR analysis can be viewed as a set of isotropic functions superpositioned together, this superposition is not prespecified as in a single 3DVAR approach but is determined by the information that can be resolved by observation. The S3DVAR is adopted in a