Correcting distortion in an imaging system using parametric motion estimation

Abstract

Distortion correction in an imaging system using parametric motion estimation. Parametric motion estimation is used to correct for geometric lens distortion and illumination changes. Models for geometric lens distortion and different illumination models are presented, as is a method for an iterative linearising method of solving the resulting sets of nonlinear equations.

Description

BACKGROUND OF THE INVENTION

1. Field of the Invention

The present invention deals with the correction of distortion in imaging systems, more particularly to systems such as scanners and in cameras used in applications such as image capture and video conferencing.

2. Art Background

With the advent of inexpensive imaging sensors, applications such as video conferencing and remote image capture are becoming more prevalent. As manufacturers provide imaging systems at lower and lower price points, compromises are made especially in the optics provided, leading to systems having geometric lens distortion. As these systems are placed in more locations, problems with illumination arise, both as a result of variations in lighting conditions, as well as the effect of automatic brightness controls in the imaging systems themselves.

The field of motion estimation deals with processing images for example to stitch together successive overlapping images to form a unified mosaic. These motion estimation techniques deal with arrays of pixels, and operate by deriving the motion between a group of pixels in one frame and the same pixels in a new position in a second frame. For motion estimation to succeed, the illumination levels and therefore pixel intensity between the two frames must be the same, and the frames must be relatively free of geometric distortion. What is needed is a way to correct for the effects of geometric lens distortion in motion estimation, and to correct for changes in illumination that effect pixel density.

SUMMARY OF THE INVENTION

Motion estimation techniques and the Optical Flow Equation (OFE) are applied to correct for distortion in an imaging system. Geometric lens distortion is corrected using a novel optical correction model. Illumination changes are corrected using both simple and Vignetting models. The solutions involve solving of a set of nonlinear equations. Typical solutions to these equations are computationally expensive. An iterative linearising solution is presented.

BRIEF DESCRIPTION OF THE DRAWINGS

The present invention is described with respect to particular exemplary embodiments thereof and reference is made to the drawings in which:

FIG. 1 is a block diagram of an imaging system,

FIG. 2 is a diagram showing geometric lens distortion, and

FIG. 3 is a flowchart of the linearized solution.

DETAILED DESCRIPTION

Inexpensive imaging sensors are enabling more applications of imaging technologies, such as video conferencing and image scanning. Compromises in sensor design, and in sensor placement lead to distortions in the resulting images.

Motion estimation techniques deal with processing images for example to stitch together successive overlapping images to form a unified mosaic; this technique us used for example in assembling scanned images of a large area using multiple passes of an imaging sensor. Motion estimation allows the overlaps to be recognized and the smaller images from each pass stitched together to form the larger unified mosaic. Similar techniques also arise in videoconferencing when the videoconferencing camera is moved, or a videoconferencing camera is used to scan a document.

To succeed, motion estimation presupposes the illumination and therefore pixel densities of overlapping image portions to be the same, and that the images are free from geometric distortion. Inexpensive optics introduce geometric distortion, and may also introduce illumination differences such as vignetting, the gradual fall off of illumination or image density away from the central axis of the image sensor. Additional illumination distortions are introduced by automatic brightness controls in image sensors, and by poor or uneven illumination in the environment.

Two dimensional motion estimation refers to determining the displacements or velocities of pixels from one frame to another. The motion is induced as the same physical point on the surface of an object in 3-D space is mapped to different locations within the imaging plane at different time. In the sampled image domain this results in different pixel indices. This difference in pixel indices taken relative to one of the frames is called the “motion vector” at that pixel between those two frames. Each pixel in the image has a motion vector of dimension two representing horizontal and vertical displacements. The collection of all motion vectors is sometimes called the “motion vector field”, or simply “motion field”. The term “field” should be understood in a broader sense, not in strict mathematical definition of “vector field”. Motion estimation from sequences of images is discussed for example in A. M. Tekalp, Digital Video Processing , Prentice Hall Signal Processing Series; M. I. Sezan and R. L. Lagendijk, Motion Analysis and Image Sequence Processing , Norwell, Mass.: Kluwer, 1993; and J. K. Aggarwal and N. Nandhakumar, “On the computation of motion from sequences of images- A review,” Proc. IEEE , vol. 76, pp. 917-935, August 1988.

FIG. 1 shows a system for performing motion estimation. Bus 100 interconnects image capture device 110 with central processing unit (CPU) 120 . Memory hierarchy 130 provides storage for instructions and data, including storage of frames if data from information capture device 110 , typically containing a mixture of RAM, ROM, and permanent disc storage. Not shown are other typical items such as displays and network connections. Image capture device 110 may be a device such as a television camera with appropriate frame capture hardware, or other imaging device such as a teleconferencing camera, CCD image sensor, scanner, or the like.

Optical Flow

In principle, all pixels within an image can be thought to follow a given trajectory through time. The trajectory of a given pixel can be parameterized via time, given an initial position at some reference time. If we take the reference time as t=t 1 , then

c ( t;x,y,t 1 )=( x ( t;x,y,t 1 ), y ( t;x,y,t 1 ), t ),

where c denotes the trajectory followed by a pixel originating at (x,y,t 1 ). For the development that follows, we abbreviate x(t;x,y,t 1 ) as x(t), and apply similar abbreviations for y(t) and c(t). Even though physical conditions generally limit the variation between trajectories of neighboring pixels, conditions such as occlusion and uncovered background can lead to arbitrary (independent) trajectories amongst neighboring pixels. In this treatment we neglect occlusion and uncovered background.

Assuming further the intensity/color value of a pixel does not change with time along the motion trajectory, then, with I(x,y,t) denoting the intensity function, $$ ⅆ I ⁡ ( c ⁡ ( t ) ) ⅆ t = 0. ( 1 )

Using the chain rule of vector calculus, Equation (1) can be written as $$ ⅆ I ⁡ ( c ⁡ ( t ) ) ⅆ t = ∂ I ⁡ ( x , y , t ) ∂ x ⁢ ⅆ x ⁡ ( t ) ⅆ t + ∂ I ⁡ ( x , y , t ) ∂ y ⁢ ⅆ y ⁡ ( t ) ⅆ t + ∂ I ⁡ ( x , y , t ) ∂ t ⁢ ⅆ t ⅆ t = 0. ( 2 )

Letting $$ I x ⁡ ( x , y , t ) = ∂ I ⁡ ( x , y , t ) ∂ x ⁢ ⁢ I y ⁡ ( x , y , t ) = ∂ I ⁡ ( x , y , t ) ∂ y ⁢ ⁢ I t ⁡ ( x , y , t ) = ∂ I ⁡ ( x , y , t ) ∂ t ( 3 )

results in

I x ( x,y,t ) x ′( t )+ I y ( x,y,t ) y ′( t )+ I t ( x,y,t )=0,  (4)

where I x and I y are the spatial image gradients, I t is the temporal image gradient, and where x′ and y′ are the horizontal and vertical velocity components respectively. Equation (4) is called the optic-flow-equation (OFE), sometimes abbreviated as:

I x x′+I y y′+I t =0.  (5)

We can proceed using (4) in two equivalent ways. In the first approach integrate both sides of (4) from t 1 to t 2 with respect to t, and assume both I x (x,y,t) and I y (x,y,t) are constant with respect to time to obtain:

I x ( x,y,t )( x (t 2 )− x ( t 1 ))+ I y ( x,y,t )( y ( t 2 )− y ( t 1 ))+( I ( x,y,t 2 )− I ( x,y,t 1 ))=0.  (6)

For convenience, define:

I 2 ( x,y )= I ( x,y,t 2 ), I 1 ( x,y )= I ( x,y,t 1 ), I 21 ( x,y )= I 2 ( x,y )− I 1 ( x,y )  ( 7 )

and

u ( x,y )= x ( t 2 )− x ( t 1 ), v ( x,y )= y ( t 2 )− y ( t 1 ),  (8)

to obtain

I x ( x,y ) u ( x,y )+ I y ( x,y ) v ( x,y )+ I 21 ( x,y )=0.  (9)

As a result of assuming I x and I y are constant with respect to time between t 1 and t 2 , we drop time dependence from the notation. Second, this assumption taken together with the continuity of intensity assumption and (1) implies that I t (x,y,t) is constant between t 1 and t 2 . This allows for trivial integration of I t (x,y,t) on this interval. Lastly, estimates of I x and I y can be obtained anywhere on [t 1 ,t 2 ]. This is important to note because if we begin with just two frames at t 1 and t 2 , we can discretely estimate I x and I y using either frame.

The second method of proceeding from (5) is to approximate the derivatives involved by first order differences and then multiply through by (t 2 −t 1 ). Then, once again, if we have just two frames at t 1 and t 2 , we can discretely estimate I x and I y using either frame, and the interpretation of this amounts to whether we employ a forward or backward approximation to estimate the derivatives.

In the development to this point it has been assumed that there is an explicit temporal evolution of the image intensity distribution. To enforce this assumption the chain rule has been applied to the intensity distribution temporal derivative. We can equivalently, however, begin from a completely discrete perspective and proceed instead by applying a 2-D spatial Taylor series approximation. To that end, assume from the onset that we have two captured frames at times t 1 and t 2 . Now, the notion of intensity invariance is expressed as (ignoring illumination change effects):

I 1 ( x 1 ,y 2 )= I 2 ( x 2 ,I y 2 ),  (10)

where I 1 (x 1 ,y 1 ) refers to the image intensity at the pixel (x 1 ,y 1 ) in the first frame captured at time t 1 , and I 2 (x 2 ,y 2 ) refers to the intensity at the point (x 2 ,y 2 ) in the second frame captured at time t 2 . Note that (x 1 ,y 1 ) are integer valued, but (x 2 ,y 2 ) are real-valued. Both I 1 and I 2 are assumed to be continuous and differentiable functions with respect to x and y. Using the definition of motion vectors, one can write

x 2 =x 1 +u ( x 1 ,y 1 )

y 2 =y 1 +v ( x 1 ,y 1 )  (11)

where u(.,.) and v(.,.) are the horizontal and vertical motion vectors, respectively. Combining Equations (10) and (11), and using a Taylor Series Expansion of differentiable functions,

I 1 ( x 1 , y 1 )= I 2 ( x 1 +u ( x 1 , y 1 ), y 1+v ( x 1 , y 1 ))

$$ I 1 ⁡ ( x 1 , y 1 ) =   ⁢ I 2 ⁡ ( x 1 + u ⁡ ( x 1 , y 1 ) , y 1 + v ⁡ ( x 1 , y 1 ) ) =   ⁢ I 2 ⁡ ( x 1 , y 1 ) + ∂ I 2 ⁡ ( x , y ) ∂ x ⁢ &LeftBracketingBar; x 1 , y 1 ⁢ u ⁡ ( x 1 , y 1 ) + ∂ I 2 ⁡ ( x , y ) ∂ y &RightBracketingBar; x 1 , y 1 ⁢ v ⁡ ( x 1 , y 1 ) + h . o . t ( 12 )

The Taylor series is expanded around the pixel (x 1 ,y 1 ). Assuming either that u(x 1 ,y 1 ) and v(x 1 ,y 1 ) are small quantities or that the higher order terms are all zero, we can disregard the higher order terms in Equation (12), and arrive at $$ ∂ I 2 ⁡ ( x , y ) ∂ x ⁢ &LeftBracketingBar; x 1 , y 1 ⁢ u ⁡ ( x 1 , y 1 ) + ∂ I 2 ⁡ ( x , y ) ∂ y &RightBracketingBar; x 1 , y 1 ⁢ v ⁡ ( x 1 , y 1 ) + ( I 2 ⁡ ( x 1 , y 1 ) - I 1 ⁡ ( x 1 , y 1 ) ) ≅ 0. ( 13 )

Note that by employing the same notation as in the previous development we write

I x ( x,y ) u ( x,y )+ I y ( x,y ) v ( x,y )+ I 21 ( x,y )=0,  (14)

which is the same result (9) previously arrived at.

Parametric Motion Models

In many realistic imaging scenarios a 2-D motion field is induced by either camera motion or objects in the 3-D world undergoing a rigid motion. Each of these effects produces a smoothly varying 2-D motion field (provided that the depth of the objects does not change swiftly in proportion to its distance to imaging device). Noting the fact that the motion field is smoothly varying, there have been attempts to describe it using a parametric model. Namely,the motion vector at any pixel needs to obey a model characterized by a few parameters. Therefore, the motion vector of a pixel is completely represented by the model parameters and its location.

Given a vector of model parameters a the motion is expressed as u(x,y)=f(x,y;a) and v(x,y)=g(x,y;a). In order to estimate the model parameters we define the following cost function, $$ Ψ = ∑ x , y ∈ I ⁢ { ( I x ⁢ u + I y ⁢ v + I 21 ) 2 } . ( 15 )

The parameter estimation procedure is to take derivatives of ψ with respect to each element of a, set those derivatives to zero, then solve the resulting set of equations. For non-linear models f and g a linearization step is typically employed.

In the following, we will examine the parametric motion models: 1) translational motion, 2) affine motion, 3) bilinear motion, and 4) perspective motion. These parametric motion models can be shown to be the projection of the motion of simple 3-D objects, such as a plane, under different projection models onto the 2-D imaging plane. Lastly, (15) is extended to include a-priori information and apply the result to estimate constrained global translational motion.

Translational Motion Estimation

One of the simplest models that can be imposed on the motion vector field is that all the motion vectors be the same, i.e. every pixel in the image is moving in the same direction by the same amount. This motion model is usually called “global translational motion”. However, it should be noted that translational motion does not necessarily mean that objects in the 3-D (real) world translate. 3-D translational motion could only be reduced to a 2-D translational model under the assumption that the 3-D object is a planar object, and an orthographic camera model is utilized. Additionally, global translational motion can be induced by a camera translation while a “distant” scene is being imaged. It may sound a very restrictive motion model, however there are applications to which this model perfectly fits. An example is multi-frame resolution enhancement technologies for scanner applications, where multiple scans of a flat page are taken such that a translational shift occurs between each scan.

The motion model constraints for this case are

u ( x,y )= u g v ( x,y )= v g   (16)

where u g and v g refer to global horizontal and vertical displacements. Then, taking the derivatives of (15)with respect to u and v, and setting them equal to zero yields $$ ∂ Ψ ∂ u = ∑ x , y ∈ I ⁢ 2 ⁢ ( I x ⁢ u g + I y ⁢ v g + I 21 ) ⁢ I x = 0 ⁢ ⁢ ∂ Ψ ∂ v = ∑ x , y ∈ I ⁢ 2 ⁢ ( I x ⁢ u g + I y ⁢ v g + I 21 ) ⁢ I y = 0 ( 17 )

Equation (17) can be re-written in the matrix form as follows: $$ [ ∑ x , y ∈ I ⁢ I x 2 ∑ x , y ∈ I ⁢ I x ⁢ I y ∑ x , y ∈ I ⁢ I x ⁢ I y ∑ x , y ∈ I ⁢ I y 2 ] ⁡ [ u g v g ] = [ - ∑ x , y ∈ I ⁢ I x ⁢ I 21 - ∑ x , y ∈ I ⁢ I y ⁢ I 21 ] ( 18 )

Equation (18) can be solved to estimate global displacement parameters.

Affine Motion

Affine motion is another commonly employed motion model. It can account for 2-D transformations such as global rotation, translation, zoom and skew. Physically, affine motion is generated between two images when the 3-D scene is planar and two images are acquired using different imaging plane positions under the orthogonal projection. The affine motion model is described by

u ( x,y )= a 1 x+a 2 y+a 3

i v( x,y )= a 4 x+a 5 y+a 6   (19)

where a 1 ,a 2 ,a 3 ,a 4 ,a 5 ,a 6 are model parameters (sometimes called “Affine Parameters”) and (x,y) is the pixel location. Note that global translational motion results when a 1 , a 2 , a 4 and a 5 are all zero.

To solve for optimal affine parameters in the Least Square sense, we expand (15) as $$ Ψ = ∑ x , y ∈ I ⁢ { I x ⁢ ( x , y ) ⁢ ( xa 1 + ya 2 + a 3 ) + I y ⁢ ( x , y ) ⁢ ( xa 4 + ya 5 + a 6 ) + I 21 ⁢ ( x , y ) } 2

As previously mentioned, ψ is minimized by taking the derivatives with respect to the affine parameters a 1 ,a 2 ,a 3 ,a 4 ,a 5 ,a 6 , and setting each derivative equal to zero. After carrying out the algebra, one can arrive at the following linear matrix equation. $$ [ ∑ x , y ∈ I ⁢ xI x ⁢ xI x ∑ x , y ∈ I ⁢ xI x ⁢ yI x ∑ x , y ∈ I ⁢ xI x ⁢ I x ∑ x , y ∈ I ⁢ xI x ⁢ xI y ∑ x , y ∈ I ⁢ xI x ⁢ yI y ∑ x , y ∈ I ⁢ xI x ⁢ I y ∑ x , y ∈ I ⁢ yI x ⁢ xI x ∑ x , y ∈ I ⁢ yI x ⁢ yI x ∑ x , y ∈ I ⁢ yI x ⁢ I x ∑ x , y ∈ I ⁢ yI x ⁢ xI y ∑ x , y ∈ I ⁢ yI x ⁢ yI y ∑ x , y ∈ I ⁢ yI x ⁢ I y ∑ x , y ∈ I ⁢ I x ⁢ xI x ∑ x , y ∈ I ⁢ I x ⁢ yI x ∑ x , y ∈ I ⁢ I x ⁢ I x ∑ x , y ∈ I ⁢ I x ⁢ xI y ∑ x , y ∈ I ⁢ I x ⁢ yI y ∑ x , y ∈ I ⁢ I x ⁢ I y ∑ x , y ∈ I ⁢ xI y ⁢ xI x ∑ x , y ∈ I ⁢ xI y ⁢ yI x ∑ x , y ∈ I ⁢ xI y ⁢ I x ∑ x , y ∈ I ⁢ xI y ⁢ xI y ∑ x , y ∈ I ⁢ xI y ⁢ yI y ∑ x , y ∈ I ⁢ xI y ⁢ I y ∑ x , y ∈ I ⁢ yI y ⁢ xI x ∑ x , y ∈ I ⁢ yI y ⁢ yI x ∑ x , y ∈ I ⁢ yI y ⁢ I x ∑ x , y ∈ I ⁢ yI y ⁢ xI y ∑ x , y ∈ I ⁢ yI y ⁢ yI y ∑ x , y ∈ I ⁢ yI y ⁢ I y ∑ x , y ∈ I ⁢ I y ⁢ xI x ∑ x , y ∈ I ⁢ I y ⁢ yI x ∑ x , y ∈ I ⁢ I y ⁢ I x ∑ x , y ∈ I ⁢ I y ⁢ xI y ∑ x , y ∈ I ⁢ I y ⁢ yI y ∑ x , y ∈ I ⁢ I y ⁢ I y ] ⁡ [ a 1 a 2 a 3 a 4 a 5 a 6 ] = [ - ∑ x , y ∈ I ⁢ xI x ⁢ I 21 - ∑ x , y ∈ I ⁢ yI x ⁢ I 21 - ∑ x , y ∈ I ⁢ I x ⁢ I 21 - ∑ x , y ∈ I ⁢ xI y ⁢ I 21 - ∑ x , y ∈ I ⁢ xI y ⁢ I 21 - ∑ x , y ∈ I ⁢ I y ⁢ I 21 ]

Bilinear Motion

The global bilinear transform is used to improve on the capabilities of the affine transform, yet still yield a linear estimation problem. In the case of an affine transformation parallel lines always remain parallel. This is not the case for motion induced by a perspective-projection imaging model. The perspective model, however, which will be treated next, yields a non-linear problem. The bilinear transform can be a good compromise in that it transforms horizontal and vertical straight lines into straight lines, but does not produce parallel lines for any given parallel pair lines. The potential problem in using a bilinear transform is that lines that are not horizontal or vertical will be transformed to have some degree of curvature. If the curvature becomes severe the transform may not be representative of the actual motion and imaging system.

The derivation of global bilinear motion model estimation is quite similar to affine motion model estimation. In particular, the motion field is governed by:

u ( x,y )=a 1 +a 2 x+a 3 y+a 4 xy

v ( x,y )= a 5 +a 6 x+a 7 y+a 8 xy   (20)

By substituting (20) into (15) and setting the derivatives with respect to model parameters equal to zero, we obtain, $$ [ ∑ x , y ∈ I ⁢ I x ⁢ I x ∑ x , y ∈ I ⁢ xI x ⁢ I x ∑ x , y ∈ I ⁢ yI x ⁢ I x ∑ x , y ∈ I ⁢ xyI x ⁢ I x ∑ x , y ∈ I ⁢ I y ⁢ I x ∑ x , y ∈ I ⁢ xI y ⁢ I x ∑ x , y ∈ I ⁢ yI y ⁢ I x ∑ x , y ∈ I ⁢ xyI y ⁢ I x ∑ x , y ∈ I ⁢ I x ⁢ xI x ∑ x , y ∈ I ⁢ xI x ⁢ xI x ∑ x , y ∈ I ⁢ yI x ⁢ xI x ∑ x , y ∈ I ⁢ xyI x ⁢ xI x ∑ x , y ∈ I ⁢ I y ⁢ xI x ∑ x , y ∈ I ⁢ xI y ⁢ xI x ∑ x , y ∈ I ⁢ yI y ⁢ xI x ∑ x , y ∈ I ⁢ xyI y ⁢ xI x ∑ x , y ∈ I ⁢ I x ⁢ yI x ∑ x , y ∈ I ⁢ xI x ⁢ yI x ∑ x , y ∈ I ⁢ yI x ⁢ yI x ∑ x , y ∈ I ⁢ xyI x ⁢ yI x ∑ x , y ∈ I ⁢ I y ⁢ yI x ∑ x , y ∈ I ⁢ xI y ⁢ yI x ∑ x , y ∈ I ⁢ yI y ⁢ yI x ∑ x , y ∈ I ⁢ xyI y ⁢ yI x ∑ x , y ∈ I ⁢ I x ⁢ xyI x ∑ x , y ∈ I ⁢ xI x ⁢ xyI x ∑ x , y ∈ I ⁢ yI x ⁢ xyI x ∑ x , y ∈ I ⁢ xyI x ⁢ xyI x ∑ x , y ∈ I ⁢ I y ⁢ xyI x ∑ x , y ∈ I ⁢ xI y ⁢ xyI x ∑ x , y ∈ I ⁢ yI y ⁢ xyI x ∑ x , y ∈ I ⁢ xyI y ⁢ xyI x ∑ x , y ∈ I ⁢ I x ⁢ I y ∑ x , y ∈ I ⁢ xI x ⁢ I y ∑ x , y ∈ I ⁢ yI x ⁢ I y ∑ x , y ∈ I ⁢ xyI x ⁢ I y ∑ x , y ∈ I ⁢ I y ⁢ I y ∑ x , y ∈ I ⁢ xI y ⁢ I y ∑ x , y ∈ I ⁢ yI y ⁢ I y ∑ x , y ∈ I ⁢ xyI y ⁢ I y ∑ x , y ∈ I ⁢ I x ⁢ xI y ∑ x , y ∈ I ⁢ xI x ⁢ xI y ∑ x , y ∈ I ⁢ yI x ⁢ xI y ∑ x , y ∈ I ⁢ xyI x ⁢ xI y ∑ x , y ∈ I ⁢ I y ⁢ xI y ∑ x , y ∈ I ⁢ xI y ⁢ xI y ∑ x , y ∈ I ⁢ yI y ⁢ xI y ∑ x , y ∈ I ⁢ xyI y ⁢ xI y ∑ x , y ∈ I ⁢ I x ⁢ yI y ∑ x , y ∈ I ⁢ xI x ⁢ yI y ∑ x , y ∈ I ⁢ yI x ⁢ yI y ∑ x , y ∈ I ⁢ xyI x ⁢ yI y ∑ x , y ∈ I ⁢ I y ⁢ yI y ∑ x , y ∈ I ⁢ xI y ⁢ yI y ∑ x , y ∈ I ⁢ yI y ⁢ yI y ∑ x , y ∈ I ⁢ xyI y ⁢ yI y ∑ x , y ∈ I ⁢ I x ⁢ xyI y ∑ x , y ∈ I ⁢ xI x ∑ x , y ∈ I ⁢ yI x ∑ x , y ∈ I ⁢ xyI x ∑ x , y ∈ I ⁢ I y ∑ x , y ∈ I ⁢ xI y ∑ x , y ∈ I ⁢ yI y ∑ x , y ∈ I ⁢ xyI y ] ⁡ [ a 1 a 2 a 3 a 4 a 5 a 6 a 7 a 8 ] = [ ∑ x , y ∈ I ⁢ I x ∑ x , y ∈ I ∑ x , y ∈ I ⁢ yI x ∑ x , y ∈ I ⁢ xyI x ∑ x , y ∈ I ∑ x , y ∈ I ∑ x , y ∈ I ⁢ yI y ∑ x , y ∈ I ]

Perspective Motion

The perspective motion model is the most versatile of the motion models used thus far. Physically,the perspective model takes into account the 2-D mapping induced among perspective projected images of a plane in 3-D under different focal plane positions. A complication is that the perspective model is nonlinear in its model parameters.

The motion field in global perspective model is governed by the following equations. $$ u ⁡ ( x , y ) = a 1 ⁢ x + a 2 ⁢ y + a 3 a 7 ⁢ x + a 8 ⁢ y + 1 - x ⁢ ⁢ v ⁡ ( x , y ) = a 4 ⁢ x + a 5 ⁢ y + a 6 a 7 ⁢ x + a 8 ⁢ y + 1 - y ( 21 )

Before using these model parameters in (15) they are first linearized around the default perspective parameter a=(1,0,0,0,1,0,0,0) to yield

u ( x,y )≅( a 1 −1) x+a 2 y+a 3 −a 7 x 2 −a 8 xy

v ( x,y )≅ a 4 x +( a 5 −1) y+a 6 −a 7

xy−a 8 y 2   (22)

To solve for optimal perspective motion model parameters in the Least Square sense, we apply (22) to (15) and obtain $$ Ψ = ∑ x , y ∈ I ⁢ { I x ⁡ ( x , y ) ⁢ ( ( a 1 - 1 ) ⁢ x + a 2 ⁢ y + a 3 - a 7 ⁢ x 2 - a 8 ⁢ xy ) + I y ⁡ ( x , y ) ⁢ ( a 4 ⁢ x + ( a 5 - 1 ) ⁢ y + a 6 - a 7 ⁢ xy - a 8 ⁢ y 2 ) + I 21 ⁡ ( x , y ) } 2

To minimize Ψ, we take the derivatives of Ψ with respect to perspective parameters a 1 , a 2 , a 3 , a 4 , a 5 , a 6 , a 7 , and a 8 and set them equal to zero. After carrying out the algebra, one can arrive at the following linear matrix equation. $$ [ ∑ x , y ∈ I ⁢ xI x ⁢ xI x ∑ x , y ∈ I ⁢ yI x ⁢ xI x ∑ x , y ∈ I ⁢ I x ⁢ xI x ∑ x , y ∈ I ⁢ xI y ⁢ xI x ∑ x , y ∈ I ⁢ yI y ⁢ xI x ∑ x , y ∈ I ⁢ I y ⁢ xI x ∑ x , y ∈ I ⁢ η ⁢   ⁢ xI x ∑ x , y ∈ I ⁢ μ ⁢   ⁢ xI x ∑ x , y ∈ I ⁢ xI x ⁢ yI x ∑ x , y ∈ I ⁢ yI x ⁢ yI x ∑ x , y ∈ I ⁢ I x ⁢ yI x ∑ x , y ∈ I ⁢ xI y ⁢ yI x ∑ x , y ∈ I ⁢ yI y ⁢ yI x ∑ x , y ∈ I ⁢ I y ⁢ yI x ∑ x , y ∈ I ⁢ η ⁢   ⁢ yI x ∑ x , y ∈ I ⁢ μ ⁢   ⁢ yI x ∑ x , y ∈ I ⁢ xI x ⁢ I x ∑ x , y ∈ I ⁢ yI x ⁢ I x ∑ x , y ∈ I ⁢ I x ⁢ I x ∑ x , y ∈ I ⁢ xI y ⁢ I x ∑ x , y ∈ I ⁢ yI y ⁢ I x ∑ x , y ∈ I ⁢ I y ⁢ I x ∑ x , y ∈ I ⁢ η ⁢   ⁢ I x ∑ x , y ∈ I ⁢ μ ⁢   ⁢ I x ∑ x , y ∈ I ⁢ xI x ⁢ xI y ∑ x , y ∈ I ⁢ yI x ⁢ xI y ∑ x , y ∈ I ⁢ I x ⁢ xI y ∑ x , y ∈ I ⁢ xI y ⁢ xI y ∑ x , y ∈ I ⁢ yI y ⁢ xI y ∑ x , y ∈ I ⁢ I y ⁢ xI y ∑ x , y ∈ I ⁢ η ⁢   ⁢ xI y ∑ x , y ∈ I ⁢ μ ⁢   ⁢ xI y ∑ x , y ∈ I ⁢ xI x ⁢ yI y ∑ x , y ∈ I ⁢ yI x ⁢ yI y ∑ x , y ∈ I ⁢ I x ⁢ yI y ∑ x , y ∈ I ⁢ xI y ⁢ yI y ∑ x , y ∈ I ⁢ yI y ⁢ yI y ∑ x , y ∈ I ⁢ I y ⁢ yI y ∑ x , y ∈ I ⁢ η ⁢   ⁢ yI y ∑ x , y ∈ I ⁢ μ ⁢   ⁢ yI y ∑ x , y ∈ I ⁢ xI x ⁢ I y ∑ x , y ∈ I ⁢ yI x ⁢ I y ∑ x , y ∈ I ⁢ I x ⁢ I y ∑ x , y ∈ I ⁢ xI y ⁢ I y ∑ x , y ∈ I ⁢ yI y ⁢ I y ∑ x , y ∈ I ⁢ I y ⁢ I y ∑ x , y ∈ I ⁢ η ⁢   ⁢ I y ∑ x , y ∈ I ⁢ μ ⁢   ⁢ I y ∑ x , y ∈ I ⁢ xI x ⁢ η ∑ x , y ∈ I ⁢ yI x ⁢ η ∑ x , y ∈ I ⁢ I x ⁢ η ∑ x , y ∈ I ⁢ xI y ⁢ η ∑ x , y ∈ I ⁢ yI y ⁢ η ∑ x , y ∈ I ⁢ I y ⁢ η ∑ x , y ∈ I ⁢ ηη ∑ x , y ∈ I ⁢ μη ∑ x , y ∈ I ⁢ xI x ⁢ μ ∑ x , y ∈ I ⁢ yI x ⁢ μ ∑ x , y ∈ I ⁢ I x ⁢ μ ∑ x , y ∈ I ⁢ xI y ⁢ μ ∑ x , y ∈ I ⁢ yI y ⁢ μ ∑ x , y ∈ I ⁢ I y ⁢ μ ∑ x , y ∈ I ⁢ ημ ∑ x , y ∈ I ⁢ μμ ] ⁡ [ a 1 - 1 a 2 a 3 a 4 a 5 - 1 a 6 a 7 a 8 ] = [ - ∑ x , y ∈ I ⁢ xI x ⁢ I t - ∑ x , y ∈ I ⁢ yI x ⁢ I 21 - ∑ x , y ∈ I ⁢ I x ⁢ I 21 - ∑ x , y ∈ I ⁢ xI y ⁢ I 21 - ∑ x , y ∈ I ⁢ yI y ⁢ I 21 - ∑ x , y ∈ I ⁢ I y ⁢ I 21 - ∑ x , y ∈ I ⁢ η ⁢   ⁢ I 21 - ∑ x , y ∈ I ⁢ μ ⁢   ⁢ I 21 ] ( 23 )

where

η=x 2 I x +xyI y

μ=xyI x +y 2 I y

Note that we have utilized the Taylor Series Approximation twice, in contrast to all previous derivations. Until this point, only linearization of the intensity function has been required. However, we had to additionally linearize the motion model to derive the Linear Matrix Equation form of Equation (23). Due to this added linearization step, perspective parameter estimation can be less accurate and stable.

In some applications, one may have a-priori information relating to the motion model parameters. Such information, for instance, could be a probability distribution of the model parameters. We take this additional information into account by modifying the cost function (15) such that $$ Ψ = ∑ x , y ∈ I ⁢ { ( I x ⁢ u + I y ⁢ v + I t ) 2 + φ ⁡ ( u , v ) } ( 24 )

Where the a-priori information is embodied using φ(u,v).

We will only derive the equations to estimate the global translational motion model parameters under such constraints. In this case we proceed as before and obtain $$ ∂ Ψ ∂ u = ∑ x , y ∈ I ⁢ { 2 ⁢ ( I x ⁢ u g + I y ⁢ v g + I 21 ) ⁢ I x + ∂ φ ∂ u } = 0 ⁢ ⁢ ∂ Ψ ∂ v = ∑ x , y ∈ I ⁢ { 2 ⁢ ( I x ⁢ u g + I y ⁢ v g + I 21 ) ⁢ I y + ∂ φ ∂ v } = 0 ( 25 )

At this point, assume that the constraint cost function is a quadratic function in u and v. This assumption is made to arrive at a linear matrix equation for optimal motion parameter estimation. Although any differentiable cost function would be acceptable, the model parameter solution may otherwise require costly non-linear optimization techniques. In particular, the constraint cost function is in the form

φ( u,v )=ξ 1 +ξ 2 u+ξ 3 v+ξ 4 uv+ξ 5 u 2 +ξ 6 v 2 .  (26)

Then, Equation (25) can be re-written as $$ [ ∑ x , y ∈ I ⁢ ( I x 2 + 2 ⁢ ξ 5 ) ∑ x , y ∈ I ⁢ ( I x ⁢ I y + ξ 4 ) ∑ x , y ∈ I ⁢ ( I x ⁢ I y + ξ 4 ) ∑ x , y ∈ I ⁢ ( I y 2 + 2 ⁢ ξ 6 ) ] ⁡ [ u g v g ] = [ - ∑ x , y ∈ I ⁢ ( I x ⁢ I 21 + ξ 2 ) - ∑ x , y ∈ I ⁢ ( I y ⁢ I 21 + ξ 3 ) ] ( 27 )

The solution of this simple 2 by 2 matrix equation yields the optimal translational motion model parameters u g and v g under the given quadratic constraint cost function. Of particular importance is the cost function

φ( u,v )=( u−u c ) 2 +( v−v c ) 2   (28)

where we know the expected translational parameters.

Intensity Changes

All methods above are derived under the premise that the intensity of a pixel does not change along the motion trajectory. As explained earlier, this may not always be true. The external illumination may change and the gain/offset of the image capture device may vary between captured frames. To take these effects into account, we modify Equation (10) such that

κ 1 I 1 ( x 1 ,y 1 )+κ 2 =I 2 ( x 2 ,y 2 )  (29)

From here, the optimization proceeds exactly as before, except that parameters κ 1 and κ 2 need to be estimated as well. We shall now derive the affine motion model parameter estimation equations under the assumption (29). Derivations for other motion models are not repeated since the outline of the derivation is very similar in each case.

Incorporating the affine motion model equations given by the Equation (19), into (29), we write:

κ 1 I 1 ( x,y )+κ 2 =I 2 ( x+a 1 x+a 2 y+a 3 , y+a 4 x+a 5 y+a 6 )  (30)

From which Taylor Series expansion results in:

I x ( x,y )( xa 1 +ya 2 +a 3 )+ I y ( x,y )( xa 4 +ya 5 +a 6 )+ I 2 ( x,y )−κ 1 I 1 ( x,y )−κ 2 ≅0  (31)

To solve for the unknown parameters, define a cost function Ψ as below: $$ Ψ = ∑ x 1 , y 1 ∈ I ⁢ { I x ⁡ ( x , y ) ⁢ ( xa 1 + ya 2 + a 3 ) + I y ⁡ ( x , y ) ⁢ ( xa 4 + ya 5 + a 6 ) + I 2 ⁡ ( x , y ) - κ 1 ⁢ I 1 ⁡ ( x , y ) - κ 2 } 2 ( 32 )

Now take the partial derivatives of Ψ with respect to the affine parameters a 1 ,a 2 ,a 3 ,a 4 ,a 5 ,a 6 and the illumination change model parameters κ 1 ,κ 2 , and set them equal to zero. After carrying out the algebraic steps, we obtain, $$ [ ∑ x , y ∈ I ⁢ xI x ⁢ xI x ∑ x , y ∈ I ⁢ yI x ⁢ xI x ∑ x , y ∈ I ⁢ I x ⁢ xI x ∑ x , y ∈ I ⁢ xI y ⁢ xI x ∑ x , y ∈ I ⁢ yI y ⁢ xI x ∑ x , y ∈ I ⁢ I y ⁢ xI x ∑ x , y ∈ I ⁢ - I 1 ⁢ xI x ∑ x , y ∈ I ⁢ - xI x ∑ x , y ∈ I ⁢ xI x ⁢ yI x ∑ x , y ∈ I ⁢ yI x ⁢ yI x ∑ x , y ∈ I ⁢ I x ⁢ yI x ∑ x , y ∈ I ⁢ xI y ⁢ yI x ∑ x , y ∈ I ⁢ yI y ⁢ yI x ∑ x , y ∈ I ⁢ I y ⁢ yI x ∑ x , y ∈ I ⁢ - I 1 ⁢ yI x ∑ x , y ∈ I ⁢ - yI x ∑ x , y ∈ I ⁢ xI x ⁢ I x ∑ x , y ∈ I ⁢ yI x ⁢ I x ∑ x , y ∈ I ⁢ I x ⁢ I x ∑ x , y ∈ I ⁢ xI y ⁢ I x ∑ x , y ∈ I ⁢ yI y ⁢ I x ∑ x , y ∈ I ⁢ I y ⁢ I x ∑ x , y ∈ I ⁢ - I 1 ⁢ I x ∑ x , y ∈ I ⁢ - I x ∑ x , y ∈ I ⁢ xI x ⁢ xI y ∑ x , y ∈ I ⁢ yI x ⁢ xI y ∑ x , y ∈ I ⁢ I x ⁢ xI y ∑ x , y ∈ I ⁢ xI y ⁢ xI y ∑ x , y ∈ I ⁢ yI y ⁢ xI y ∑ x , y ∈ I ⁢ I y ⁢ xI y ∑ x , y ∈ I ⁢ - I 1 ⁢ xI y ∑ x , y ∈ I ⁢ - xI y ∑ x , y ∈ I ⁢ xI x ⁢ yI y ∑ x , y ∈ I ⁢ yI x ⁢ yI y ∑ x , y ∈ I ⁢ I x ⁢ yI y ∑ x , y ∈ I ⁢ xI y ⁢ yI y ∑ x , y ∈ I ⁢ yI y ⁢ yI y ∑ x , y ∈ I ⁢ I y ⁢ yI y ∑ x , y ∈ I ⁢ - I 1 ⁢ yI y ∑ x , y ∈ I ⁢ - yI y ∑ x , y ∈ I ⁢ xI x ⁢ I y ∑ x , y ∈ I ⁢ yI x ⁢ I y ∑ x , y ∈ I ⁢ I x ⁢ I y ∑ x , y ∈ I ⁢ xI y ⁢ I y ∑ x , y ∈ I ⁢ yI y ⁢ I y ∑ x , y ∈ I ⁢ I y ⁢ I y ∑ x , y ∈ I ⁢ - I 1 ⁢ I y ∑ x , y ∈ I ⁢ - I y ∑ x , y ∈ I ⁢ xI x ⁢ I 1 ∑ x , y ∈ I ⁢ yI x ⁢ I 1 ∑ x , y ∈ I ⁢ I x ⁢ I 1 ∑ x , y ∈ I ⁢ xI y ⁢ I 1 ∑ x , y ∈ I ⁢ yI y ⁢ I 1 ∑ x , y ∈ I ⁢ I y ⁢ I 1 ∑ x , y ∈ I ⁢ - I 1 ⁢ I 1 ∑ x , y ∈ I ⁢ - 1 ⁢ I 1 ∑ x , y ∈ I ⁢ xI x ∑ x , y ∈ I ⁢ yI x ∑ x , y ∈ I ⁢ I x ∑ x , y ∈ I ⁢ xI y ∑ x , y ∈ I ⁢ yI y ∑ x , y ∈ I ⁢ I y ∑ x , y ∈ I ⁢ - I 1 ∑ x , y ∈ I ⁢ - 1 ] ⁡ [ a 1 a 2 a 3 a 4 a 5 a 6 κ 1 κ 2 ] = [ - ∑ x , y ∈ I ⁢ xI x ⁢ I 2 - ∑ x , y ∈ I ⁢ yI x ⁢ I 2 - ∑ x , y ∈ I ⁢ I x ⁢ I 2 - ∑ x , y ∈ I ⁢ xI y ⁢ I 2 - ∑ x , y ∈ I ⁢ yI y ⁢ I 2 - ∑ x , y ∈ I ⁢ I y ⁢ I 2 - ∑ x , y ∈ I ⁢ I 1 ⁢ I 2 - ∑ x , y ∈ I ⁢ I 2 ]

Lens Distortion

Inexpensive lens systems introduce geometric distortion into the imaging system. This is shown in FIG. 2 . Geometric distortion causes the point shown in undistorted first frame 210 to appear in a slightly different location in geometrically distorted image 220 . This same distortion causes the apparent motion of this point in undistorted second frame 230 to appear instead at the position shown in distorted second frame 240 .

In this section, we will develop methods of motion estimation between images captured with an imperfect lens that causes geometric distortions. The gamma factor and external illumination changes are also taken into account. A nonlinear optimization framework to solve for distortion parameters is introduced. Linearization of this model results in OFE-like equations.

The geometric lens distortions can be modeled as $$ x g = x 1 + κ 7 ⁡ ( x 2 + y 2 ) ( 33 ) y g = y 1 + κ 7 ⁡ ( x 2 + y 2 ) ( 34 )

where κ 7 is the lens geometric distortion parameter, (x g ,y g ) are the distorted pixel positions and (x,y) are the corrected pixel positions.

Using Equation (33) and (34), we write $$ x g y g = x y , ( 35 )

Putting Equation (35) into Equation (33) yields $$ y 2 ⁡ [ κ 7 ⁡ ( x g 2 y g 2 + 1 ) ] + y ⁡ ( - 1 y g ) + 1 = 0 ( 36 )

There are two solutions to this quadratic equation: $$ y = 1 ± 1 - 4 ⁢   ⁢ κ 7 ⁡ ( x g 2 + y g 2 ) 2 ⁢   ⁢ κ 7 ⁡ ( x g 2 + y g 2 ) ⁢ y g ,   ⁢ x = y ⁢ x g y g ( 37 )

As κ 7 goes to 0, y should approach y g . Since, $$ lim κ 7 → 0 ⁢ { 1 + 1 - 4 ⁢ κ 7 ⁢ ( x g 2 + y g 2 ) 2 ⁢ κ 7 ⁢ ( x g 2 + y g 2 ) ⁢   } ⁢ y g = ∞ ,

this can not be a solution. On the other hand, the second solution satisfies this requirement, hence it is the true solution. $$ lim κ 7 → 0 ⁢   ⁢ 1 - 1 - 4 ⁢ κ 7 ⁢ ( x g 2 + y g 2 ) 2 ⁢ κ 7 ⁢ ( x g 2 + y g 2 ) ⁢   ⁢ y g = y g

There are many parametric motion models that map pixels from one frame to another. The affine model is used for subsequent derivation in this section. The translational, bilinear, and perspective motion models follow exactly the same procedure, and are therefore not treated for the sake of space.

Using the geometric distortion model given by Equation (33), we write $$ x g ′ = ⁢ ( κ 1 , κ 2 , κ 3 , κ 4 , κ 5 , κ 6 , κ 7 , x g , y g ) = x ′ 1 + κ 7 ⁡ ( x ′2 + y ′2 ) ( 38 )

$$ y g ′ = ⁢ ( κ 1 , κ 2 , κ 3 , κ 4 , κ 5 , κ 6 , κ 7 , x g , y g ) = y ′ 1 + κ 7 ⁡ ( x ′2 + y ′2 ) ( 39 )

where

y′=κ 4 x ( x g ,y g )+κ 2 y ( x g ,y g )+κ 2 y ( x g ,y g )+κ 3 y=κ 4 x ( x g ,y g )+κ 5 y ( x g ,y g )+κ 6   (40)

where x(x g ,y g ) and y(x g ,y g ) are as given by Equation (37).

Therefore, we have a nonlinear mapping from one frame to another characterized by 7 parameters. With the assumption that intensity does not change along the motion trajectory, we write:

I 1 ( x g ,y g )= I 2 ( x′ g ,y′ g )  (41).

Nonlinear Geometric Correction

We can define a cost function given by $$ Ψ = ∑ x g , y g ∈ I 1 ⁢   ⁢ ( I 1 ⁡ ( x g , y g ) - I 2 ⁡ ( x g ′ , y g ′ ) ) 2 . ( 42 )

This is a function of the affine and lens-distortion parameters,

k=(κ 1 ,κ 2 ,κ 3 ,κ 4 , κ 5 ,κ 6 ,κ 7 )

A variant of Powell's method for multivariable nonlinear optimization is used to find the parameters that minimize the cost function. Other multivariable nonlinear optimization methods known in the art may also be used. To speed up the calculation, rather than summing over all x g ,y g ε I 1 , summation over several small rectangular regions in the image may be performed. The algorithm's performance depends on the size, location, and number of regions used. The accuracy of the estimate may be improved by choosing regions with features such as corners, rather than uniform regions, and by choosing regions towards the periphery of the image (where warping is more pronounced). Nonlinear optimization methods also benefit from a good initial guess. The affine-motion estimation method is used on the middle portions of the images (where the warping is relatively mild) for initial estimates of the affine parameters.

The widely used lens distortion model given by x g =x(1+κ 7 (x 2 +y 2 )) is not only a cruder approximation of the physics of the lens, but also give rise to more complicated equations, which requires the calculation of roots of a cubic polynomial.

A hybrid system that alternates between the affine-motion estimation method to estimate the six affine motion parameters, and a one-dimensional nonlinear optimization technique to estimate the lens-distortion parameter is used for optimization. For the one-dimensional optimization, the “Golden Search” method is used to minimize the cost function Ψ, here considered as a function of the single parameter κ 7 with the affine parameters (κ 1 ,κ 2 ,κ 3 ,κ 4 ,κ 5 ,κ 6 ) clamped.

Linearization in Geometric Correction

We may also use a Taylor Series approximation to get a set of linear equations with a closed-form solution. This process is shown in FIG. 3 . Once the nonlinear model is selected 310 , giving a system of nonlinear equations, an initial set of parameters is selected 320 . Given the set of parameters, the system of nonlinear equations is linearized around the set of parameters 330 , resulting in a linear system. This linear system of equations is solved 340 using standard techniques to reach a new set of parameters. The process of linearizing the system of nonlinear equations around the set of parameters and resolving the resulting linear solution is iterated 350 until our convergence criteria is met, or for a set number of steps. The linearization 330 is done as shown previously by Taylor Series expansion. If we were to center the Taylor Series around the parameter set k def =(1,0,0,0,1,0,0) as we have done in previous sections, we would get no information about the lens-distortion parameter κ 7 , since. $$ &AutoLeftMatch; ∂ ∂ κ 7 &RightBracketingBar; k def = 0 ⁢   ⁢ and ⁢   ⁢ &AutoLeftMatch;   ⁢ ∂ ∂ κ 7 &RightBracketingBar; k def = 0.

This is expected, since k def =(1,0,0,0,1,0,0) induces zero motion, and with no motion, both images are the same, so we have no hope of recovering the lens-distortion parameter. Likewise, a Taylor Series approximation around a parameter-set corresponding to rotation around the center of the image provides no information on the lens distortion, as the distortion is radial. But other affine-parameter sets (κ 1 ,κ 2 ,κ 3 ,κ 4 ,κ 5 ,κ 6 ) yield an observable system for the lens-distortion parameter. More precisely, a Taylor Series approximation of I 2 (x′ g ,y′ g ) around the parameters K w =(κ 1 ,κ 2 ,κ 3 ,κ 4 ,κ 5 ,κ 6 , 0) would yield $$ I 2 ⁡ ( x g ′ , y g ′ ) = I 2 ⁡ ( x g , y g ) + ∑ i = 1 7 ⁢ &AutoLeftMatch; ∂ I 2 ∂ x ⁢ ∂ ∂ κ i &RightBracketingBar; k w + ∑ i = 1 7 ⁢ &AutoLeftMatch; ∂ I 2 ∂ y ⁢ ∂ ∂ κ i &RightBracketingBar; k w ( 43 )

where $$ &AutoLeftMatch; ∂ ∂ κ 1 &RightBracketingBar; k w = x g &AutoLeftMatch; ∂ ∂ κ 2 &RightBracketingBar; k w = y g &AutoLeftMatch; ∂ ∂ κ 2 &RightBracketingBar; k w = 1 &AutoLeftMatch; ∂ ∂ κ 4 &RightBracketingBar; k w = 0 &AutoLeftMatch; ∂ ∂ κ 5 &RightBracketingBar; k w = 0 &AutoLeftMatch; ∂ ∂ κ 6 &RightBracketingBar; k w = 0 $$ &AutoLeftMatch; ∂ ∂ κ 7 &RightBracketingBar; k w =   ⁢ ( - k 1 3 + k 1 - k 1 ⁢ k 4 2 ) ⁢ x g 3 +   ⁢ ( - 2 ⁢ k 1 ⁢ k 4 ⁢ k 5 - 3 ⁢ k 1 2 ⁢ k 2 - k 2 ⁢ k 4 2 + k 2 ) ⁢ x g 2 ⁢ y g +   ⁢ ( - 3 ⁢ k 1 ⁢ k 2 2 + k 1 - 2 ⁢ k 2 ⁢ k 4 ⁢ k 5 - k 1 ⁢ k 5 2 ) ⁢ x g ⁢ y g 2 +   ⁢ ( - k 2 3 + k 2 - k 2 ⁢ k 5 2 ) ⁢ y g 3 + ( - 3 ⁢ k 1 2 ⁢ k 3 - 2 ⁢ k 1 ⁢ k 4 ⁢ k 6 - k 3 ⁢ k 4 2 ) ⁢ x g 2 +   ⁢ ( - 6 ⁢ k 1 ⁢ k 2 ⁢ k 3 - 2 ⁢ k 2 ⁢ k 4 ⁢ k 6 - 2 ⁢ k 3 ⁢ k 4 ⁢ k 5 - 2 ⁢ k 1 ⁢ k 5 ⁢ k 6 ) ⁢ x g ⁢ y g +   ⁢ ( - 2 ⁢ k 2 ⁢ k 5 ⁢ k 6 - k 3 ⁢ k 5 2 - 3 ⁢ k 2 2 ⁢   ⁢ k 3 ) ⁢ y g 2 +   ⁢ ( - 3 ⁢ k 1 ⁢ k 3 2 - k 1 ⁢ k 6 2 - 2 ⁢ k 3 ⁢ k 4 ⁢ k 6 ) ⁢ x g +   ⁢ ( - k 2 ⁢ k 6 2 - 3 ⁢ k 2 ⁢ k 3 2 - 2 ⁢ k 3 ⁢ k 5 ⁢ k 6 ) ⁢ y g + ( - k 3 3 - k 3 ⁢ k 6 2 ) $$ &AutoLeftMatch; ∂ ∂ κ 1 &RightBracketingBar; k w = 0 &AutoLeftMatch; ∂ ∂ κ 2 &RightBracketingBar; k w = 0 &AutoLeftMatch; ∂ ∂ κ 2 &RightBracketingBar; k w = 0 &AutoLeftMatch; ∂ ∂ κ 4 &RightBracketingBar; k w = x g &AutoLeftMatch; ∂ ∂ κ 5 &RightBracketingBar; k w = y g &AutoLeftMatch; ∂ ∂ κ 6 &RightBracketingBar; k w = 1 $$ &AutoLeftMatch; ∂ ∂ κ 7 &RightBracketingBar; k w =   ⁢ ( - k 4 ⁢ k 1 2 - k 4 3 + k 4 ) ⁢ x g 3 +   ⁢ ( - k 5 ⁢ k 1 2 - 3 ⁢ k 4 2 ⁢ k 5 - 2 ⁢ k 4 ⁢ k 1 ⁢ k 2 + k 5 ) ⁢ x g 2 ⁢ y g +   ⁢ ( - 2 ⁢ k 5 ⁢ k 1 ⁢ k 2 + k 4 - k 4 ⁢ k 2 2 - 3 ⁢ k 4 ⁢ k 5 2 ) ⁢ x g ⁢ y g 2 +   ⁢ ( - k 5 ⁢ k 2 2 - k 5 3 + k 5 ) ⁢ y g 3 + ( - k 6 ⁢ k 1 2 - 3 ⁢ k 4 2 ⁢ k 6 - 2 ⁢ k 4 ⁢ k 1 ⁢ k 3 ) ⁢ x g 2 +   ⁢ ( - 6 ⁢ k 4 ⁢ k 6 ⁢ k 5 - 2 ⁢ k 4 ⁢ k 3 ⁢ k 2 - 2 ⁢ k 5 ⁢ k 1 ⁢ k 3 - 2 ⁢ k 6 ⁢ k 1 ⁢ k 2 ) ⁢ x g ⁢ y g +   ⁢ ( - 2 ⁢ k 5 ⁢ k 3 ⁢ k 2 - k 6 ⁢ k 2 2 - 3 ⁢ k 6 ⁢ k 5 2 ) ⁢ y g 2 +   ⁢ ( - 2 ⁢ k 6 ⁢ k 1 ⁢ k 3 - 3 ⁢ k 4 ⁢ k 6 2 - k 4 ⁢ k 3 2 ) ⁢ x g +   ⁢ ( - 3 ⁢ k 6 2 ⁢ k 5 - 2 ⁢ k 6 ⁢ k 3 ⁢ k 2 - k 5 ⁢ k 3 2 ) ⁢ y g + ( - k 6 3 - k 6 ⁢ k 3 2 )

The method described earlier is used for an initial estimate of the affine parameters, which are then used as the center of the Taylor series expansion. If the initial estimate is almost entirely translational, one may expand the Taylor series around just the translational component of the initial estimate to simplify the computations, taking k w =(1,0,κ 3 , 0,1,κ 6 ,0). This gives $$ &AutoLeftMatch; ∂ ∂ κ 7 &RightBracketingBar; k w = –3k 3 ⁢ x g 2 - 2 ⁢ k 6 ⁢ x g ⁢ y g - k 3 ⁢ y g 2 - ( k 6 2 + 3 ⁢ k 3 2 ) ⁢ x g - 2 ⁢ k 3 ⁢ k 6 ⁢ y g - ( - k 3 3 + k 3 ⁢ k 6 2 ) ⁢ ⁢ and ⁢ ⁢ &AutoLeftMatch; ∂ ∂ κ 7 &RightBracketingBar; k w = - k 6 ⁢ x g 2 - 2 ⁢ k 3 ⁢ x g ⁢ y g - 3 ⁢ k 6 ⁢ y g 2 - 2 ⁢ k 6 ⁢ k 3 ⁢ x g - ( 3 ⁢ k 6 2 + k 3 2 ) ⁢ y g - ( k 6 3 + k 6 ⁢ k 3 2 )

but may give inaccurate results if there is a substantial non-translational aspect to the motion.

Substituting Equation (43) into Equation (42), and taking the derivatives and setting them equal to zero yields the following linear matrix equation: $$ [   ⁢ ∑ x , y ∈ I ⁢ xI x ⁢ xI x ∑ x , y ∈ I ⁢ yI x ⁢ xI x ∑ x , y ∈ I ⁢ I x ⁢ xI x ∑ x , y ∈ I ⁢ xI y ⁢ xI x ∑ x , y ∈ I ⁢ yI y ⁢ xI x ∑ x , y ∈ I ⁢ I y ⁢ xI x ∑ x , y ∈ I ⁢ μ ⁢   ⁢ xI x ∑ x , y ∈ I ⁢ xI x ⁢ yI x ∑ x , y ∈ I ⁢ yI x ⁢ yI x ∑ x , y ∈ I ⁢ I x ⁢ yI x ∑ x , y ∈ I ⁢ xI y ⁢ yI x ∑ x , y ∈ I ⁢ yI y ⁢ yI x ∑ x , y ∈ I ⁢ I y ⁢ yI x ∑ x , y ∈ I ⁢ μ ⁢   ⁢ yI x ∑ x , y ∈ I ⁢ xI x ⁢ I x ∑ x , y ∈ I ⁢ yI x ⁢ I x ∑ x , y ∈ I ⁢ I x ⁢ I x ∑ x , y ∈ I ⁢ xI y ⁢ I x ∑ x , y ∈ I ⁢ yI y ⁢ I x ∑ x , y ∈ I ⁢ I y ⁢ I x ∑ x , y ∈ I ⁢ μ ⁢   ⁢ I x ∑ x , y ∈ I ⁢ xI x ⁢ xI y ∑ x , y ∈ I ⁢ yI x ⁢ xI y ∑ x , y ∈ I ⁢ I x ⁢ xI y ∑ x , y ∈ I ⁢ xI y ⁢ xI y ∑ x , y ∈ I ⁢ yI y ⁢ xI y ∑ x , y ∈ I ⁢ I y ⁢ xI y ∑ x , y ∈ I ⁢ μ ⁢   ⁢ xI y ∑ x , y ∈ I ⁢ xI x ⁢ yI y ∑ x , y ∈ I ⁢ yI x ⁢ yI y ∑ x , y ∈ I ⁢ I x ⁢ yI y ∑ x , y ∈ I ⁢ xI y ⁢ yI y ∑ x , y ∈ I ⁢ yI y ⁢ yI y ∑ x , y ∈ I ⁢ I y ⁢ yI y ∑ x , y ∈ I ⁢ μ ⁢   ⁢ yI y ∑ x , y ∈ I ⁢ xI x ⁢ I y ∑ x , y ∈ I ⁢ yI x ⁢ I y ∑ x , y ∈ I ⁢ I x ⁢ I y ∑ x , y ∈ I ⁢ xI y ⁢ I y ∑ x , y ∈ I ⁢ yI y ⁢ I y ∑ x , y ∈ I ⁢ I y ⁢ I y ∑ x , y ∈ I ⁢ μ ⁢   ⁢ I y ∑ x , y ∈ I ⁢ xI x ⁢ μ ∑ x , y ∈ I ⁢ yI x ⁢ μ ∑ x , y ∈ I ⁢ I x ⁢ μ ∑ x , y ∈ I ⁢ xI y ⁢ μ ∑ x , y ∈ I ⁢ yI y ⁢ μ ∑ x , y ∈ I ⁢ I y ⁢ μ ∑ x , y ∈ I ⁢ μμ ⁢   ] [   ⁢ Δ ⁢   ⁢ k 1 Δ ⁢   ⁢ k 2 Δ ⁢   ⁢ k 3 Δ ⁢   ⁢ k 4 Δ ⁢   ⁢ k 5 Δ ⁢   ⁢ k 6 Δ ⁢   ⁢ k 7 ⁢   ] = [ - ∑ x , y ∈ I ⁢ xI x ⁢ I w - ∑ x , y ∈ I ⁢ yI x ⁢ I w - ∑ x , y ∈ I ⁢ I x ⁢ I w - ∑ x , y ∈ I ⁢ xI y ⁢ I w - ∑ x , y ∈ I ⁢ yI y ⁢ I w - ∑ x , y ∈ I ⁢ I y ⁢ I w - ∑ x , y ∈ I ⁢ μ ⁢   ⁢ I w ]

where $$ μ = &AutoLeftMatch; ∂ ∂ κ 7 &RightBracketingBar; k w ⁢ I x + &AutoLeftMatch; ∂ ∂ κ 7 &RightBracketingBar; k w

I y and I w =I 2 (x,y)−I 1 (x w ,y w ), with x w and y w the images of x and y under the transformation given by k w =(κ 1 ,κ 2 ,κ 3 ,κ 4 ,κ 5 ,κ 6 ,0).

Illumination Correction

With the incorporation of external illumination change and offset variation in capture devices as explained earlier, we modify Equation (41) as

κ 8 I 1 ( x g ,y g )+κ 9 =I 2 ( x′ g y′ g ),  (44)

and we redefine the cost function in terms of motion, lens distortion, and illumination change parameters as: $$ Ψ = ∑ x g , y g ∈ I 1 ⁢ ( κ 8 ⁢ I 1 ⁡ ( x g , y g ) + κ 9 - I 2 ⁡ ( x g ′ , y g ′ ) ) 2 ( 45 )

To account for vignetting effect, the vignetting correction function is introduced, and Equation (44) modified as $$ κ 8 ⁢ I 1 ⁡ ( x g , y g ) + κ 9 W ⁡ ( x g , y g ) = I 2 ⁡ ( x g ′ , y g ′ ) W ⁡ ( x g ′ , y g ′ ) ( 46 )

where $$ W ⁢ ( x g , y g ) = κ 10 ⁢ cos 4 ( arctan ( x w 2 + y w 2 f ) ) + ( 1 - κ 10 )

where f is the camera focal length, and (x w ,y w ) is the camera imaging plane coordinates of the pixel (x g ,y g ).

Then we can define a cost function in terms of (κ 1 ,κ 2 , κ 3 ,κ 4 , κ 5 ,κ 6 ,κ 7 ,κ 8 ,κ 9 ,κ 10 ) as $$ Ψ = ∑ x g , y g ∈ I 1 ⁢ ( κ 10 ⁢ I 1 ⁡ ( x g , y g ) + κ 11 W ⁡ ( x g , y g ) - I 2 ⁡ ( x g ′ , y g ′ ) W ⁡ ( x g ′ , y g ′ ) ) 2 ( 47 )

This cost function can again be minimized via non-linear optimization techniques, or we can perform Taylor Series approximation to arrive at a set of linear equations, which can easily be solved.

The foregoing detailed description of the present invention is provided for the purpose of illustration and is not intended to be exhaustive or to limit the invention to the precise embodiments disclosed. Accordingly the scope of the present invention is defined by the appended claims.

Claims

1. A method for correcting distortion in an imaging system, the method comprising:a) applying a motion estimation model to a first and a second image to generate a set of nonlinear equations representing distortion, wherein the motion estimation model accommodates a change in illumination along at least one motion trajectory between the first and second images; b) solving the set of nonlinear equations to produce a set of correction parameters; and c) correcting at least one of the first and second images using the correction parameters to remove distortion.

2. The method of claim 1 where the distortion includes geometric lens distortion.

3. The method of claim 2 wherein geometric lens distortion is modeled by the transform: xg=x1+κ7⁢(x2+y2)⁢ ⁢yg=y1+κ7⁢(x2+y2)where (x,y) are the corrected pixel locations, (xg,yg) are distorted pixel locations, and κ7 is a geometric lens distortion factor.

4. The method of claim 1 wherein the correction parameters correct a change in illumination along the at least one motion trajectory.

5. The method of claim 4 wherein illumination changes are modeled with a linear model.

6. The method of claim 4 wherein illumination changes are modeled with a Vignetting model.

7. The method of claim 1 where the method of solving the set of nonlinear equations is a multivariable nonlinear optimization method.

8. The method of claim 1 wherein step b) further comprises:a) selecting an initial set of solution parameters; b) linearizing the set of nonlinear equations around the set of solution parameters; c) solving the resulting linearized set of equations to reach an updated set of solution parameters; and d) repeating steps b) and c) until a condition defined by a selected one of a finite number of iterations and a predetermined convergence criteria is met.

9. The method of claim 8 where the set of nonlinear equations includes correction for geometric lens distortion.

10. The method of claim 8 where the set of nonlinear equations includes correction for illumination changes.

11. The method of claim 8 where the set of nonlinear equations includes correction for both geometric lens distortion and illumination changes.

12. The method of claim 11 where the model for illumination changes is a linear model.

13. The method of claim 11 where the model for illumination changes is a Vignetting model.

14. The method of claim 11 wherein geometric lens distortion is modeled by the transform: xg=x1+κ7⁢(x2+y2)⁢ ⁢yg=y1+κ7⁢(x2+y2)where (x,y) are the corrected pixel locations, (xg,yg) are distorted pixel locations, and κ7 is the distortion factor.

15. A computer storage medium having instructions stored therein for programming a computer to perform the method of claim 11.

16. The method of claim 1 wherein step a) further comprises the step of performing motion estimation modeling using at least one of a translational motion model, an affine motion model, a bilinear motion model, and a perspective motion model.