1 / 37

# Image Registration ? Mapping of Evolution - PowerPoint PPT Presentation

Image Registration  Mapping of Evolution. Registration Goals. I 2 (x,y)=g(I 1 (f(x,y)) f() – 2D spatial transformation g() – 1D intensity transformation. Assume the correspondences are known Find such f() and g() such that the images are best matched. Spatial Transformations. Rigid

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## PowerPoint Slideshow about 'Image Registration ? Mapping of Evolution' - jackie

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

### Image Registration Mapping of Evolution

I2(x,y)=g(I1(f(x,y))f() – 2D spatial transformationg() – 1D intensity transformation

• Assume the correspondences are known

• Find such f() and g() such that the images are best matched

• Rigid

• Affine

• Projective

• Perspective

• Global Polynomial

• Spline

• Rotation(R)

• Translation(t)

• Similarity(scale)

• Rotation

• Translation

• Scale

• Shear

No more preservation of lengths and angles

Parallel lines are preserved

• (xo,yo,zo)  world coordinates

• (xi,yi)  image coordinates

• Flat plane tilted with respect to the camera requires Projective Transformation

• (xp,yp)  Plane Coordinates

• (xi,yi)  Image Coordinates

• amn coefficients from the equations of the scene and the image planes

Global Polynomial Transformation(splines)

• Correlation

• Fourier

• Point Mapping

Given a two images T & I, 2D normalized correlation function measures the similarity for each translation in an image patch

Correlation must be normalized to avoid contributions from local image intensities.

• Fourier transform of the correlation of two images is the product of the Fourier transform of one image and the complex conjugate of the Fourier transform of the other.

• Phase-Correlation

• Cross power spectrum

• Power cepstrum

All Fourier based methods are very efficient, only only work in cases of rigid transformation

• Control Points

• Point Mapping with Feedback

• Global Polynomial

Intrinsic

Markers within

the Image

Extrinsic

Manually or Automatically selected

After the control points have been

determined, cross correlation, convex hull

edges and other common methods are used

to register the sets of control points

• Clustering example: determine the optimal spatial transformation between images by an evaluation of all possible pairs of feature matches.

• Initialize a point in cluster space for each transformation

• Use the transformation that is closest to the best cluster

• Too many points, thus use a subset

• Use a set of patched points to generate a single optimal transformation

• Bi-Variate transformation:

(x,y) – reference image

(u,v) – working image

• When is polynomial transformation bad?

• Splines approximate polynomial transformations(B-spline, TP-spline)

• Feature Space

• Similarity Metrics

• Search Strategy

Irani & Anandan

Direct Method(vs. Feature Based)

EO IR

Find features

Loss of important information

Original Image (Intensity Map)

Assume global statistical correlation

Often violated

• Same Modality Camera Sensors  enough correlated structure at all resolution levels

• Different Modality Camera Sensors  primary correlation only in high resolution levels

Goal: Suppress non-common information & capture the common scene details

Solution: High pass energy images

• Apply the Laplacian high pass filter to the original images

• Square the results  NO contrast reversal

BUT

The Laplacian is directionally invariant

• Filter with Gaussian

• Apply directional derivative filter to the original image in 4 directions

• Square the resultant images

• Do not assume global correlation, use only local correlation information

• Use Normalized Correlation as a similarity measure

• Thus, no assumptions about the original data

• NC=1

Two images are linearly related

• NC<1(high)

Two images are not linearly related, yet local fluctuations are low

• NC<1(low)≈0

Incorrect displacements

a, b – original images

{ai,bi} – directional derivatives (i=1..4)

p=(p1…p6)Taffine

(u,v) – shift from one image to another

Si(x,y)(u,v) – correlation surface at a pixel(x,y)

Goal: Find the parametric transformation p, which maximizes the sum of all normalized correlation values. global similarity M(p)

Newton’s method is used to solve for M(p)

• The quadratic approximation of M around p is obtained by combining the quadratic approximations of each of the local correlation surfaces S around local displacement.

• Construct a Laplacian resolution pyramid

• Compute a local normalized-correlation surface around a given displacement

• Compute the parametric refinement

• Update p

• Start over(process terminates at the highest resolution level of the last image)

Due to the different modalities of the

sensors, the number of outliers may be very

large

• Accept pixels based on concavity of the correlation surface

• Weigh the contribution of a pixel by det|H(u)|

EO image

IR image

Composite before Alignment

Composite after Alignment

IR image

• I would like to thank Compaq for making awful computers

• Professor Belongie for reviewing the slides