L06-07 Interpolation Geometry

Digital Image Processing, 3rd ed.
Gonzalez & Woods

www.ImageProcessingPlace.com
Chapter 2
Digital Image Fundamentals
Lecture 6
19922008 R. C. Gonzalez & R. E. Woods

Gonzalez & Woods
Chapter 2
What is image interpolation?

An image f(x,y) tells us the intensity values at the
integral lattice locations, i.e., when x and y are
both integers
Image interpolation refers to the guess of
intensity values at missing locations, i.e., x and y
can be arbitrary
Note that it is just a guess (Note that all sensors
have finite sampling distance)

Gonzalez & Woods
Chapter 2
Engineering Motivations
Why do we need image interpolation?
We want BIG images
When we see a video clip on a PC, we like to see it in
the full screen mode
We want GOOD images

If some block of an image gets damaged during the
transmission, we want to repair it
We want COOL images

Manipulate images digitally can render fancy artistic
effects as we often see in movies

Gonzalez & Woods
Chapter 2
Image Interpolation (Tool)
Zooming
Shrinking
Rotating
Geometric Correction
Zooming & Shrinking

Re-sampling

Gonzalez & Woods
Chapter 2
Image Interpolation (Tool)

Gonzalez & Woods
Chapter 2
Scenario I: Resolution Enhancement
Low-Res.
High-Res.

Gonzalez & Woods
Chapter 2
Scenario II: Image Inpainting
Non-damaged
Damaged

Gonzalez & Woods
Chapter 2
Scenario III: Image Wraping

Gonzalez & Woods
Chapter 2
Concept
Interpolation works by using known data to estimate values at unknown points.
The more temperature measurements you have which are close to noon, the
more sophisticated (and hopefully more accurate) your interpolation algorithm
can be.

Gonzalez & Woods
Chapter 2
Linear Interpolation Formula

Heuristic: the closer to a pixel, the higher weight is assigned
Principle: line fitting to polynomial fitting (analytical formula)
f(n)
f(n+a)
f(n+1)
1-a
f(n+a)=(1-a) f(n)+a f(n+1), 0<a<1

Note: when a=0.5, we simply have the average of two

Gonzalez & Woods
Chapter 2
Numerical Examples
f(n)=[0,120,180,120,0]
Interpolate at 1/2-pixel
f(x)=[0,60,120,150,180,150,120,60,0], x=n/2
Interpolate at 1/3-pixel
f(x)=[0,20,40,60,80,100,120,130,140,150,160,170,180,
], x=n/6

Gonzalez & Woods
Chapter 2
Image Interpolation Algorithms

Non-adaptive algorithms include: nearest neighbor, bilinear, bicubic,
spline, sinc, lanczos, etc.
Adaptive algorithms include many proprietary algorithms in licensed
software such as: Qimage, PhotoZoom Pro, Genuine Fractals, etc.
Depending on their complexity, these use anywhere from 0 to 256 (or
more) adjacent pixels when interpolating. The more adjacent pixels they
include, the more accurate they can become, but this comes at the expense
of much longer processing time. These algorithms can be used to both
distort and resize a photo.

Gonzalez & Woods
Chapter 2
Image Interpolation Algorithms

Nearest Neighbor Interpolation
Intensity of the closest pixel is assigned.
Bilinear Interpolation
Four nearest neighbors are used to estimate the
intensity.
Bicubic Interpolation
Sixteen nearest neighbors of point are used to assign
the intensity.

Gonzalez & Woods
Chapter 2
Use 4 nearest neighbor
Solve for 4 coefficients
Product of 2 linear functions

Gonzalez & Woods
Chapter 2
I20,14.5 = 150.5
I21,14.5 = 128.5
I20.2,14.5 = 146.1

Gonzalez & Woods
Chapter 2
Enlargement by 1.5 times
Image is 500 500

Imaginary Array: 750 750 (same pixel spacing)
Set value from the closest pixel in original image
Expand it to the original expanded size
This is Nearest Neighbor Interpolation
Produces artifacts (distortion of straight edge)

Gonzalez & Woods
Chapter 2

Gonzalez & Woods
Chapter 2
Nearest Neighbor Interpolation

Induces Voronoi Diagram

Gonzalez & Woods
Chapter 2

Gonzalez & Woods
Chapter 2
Bicubic Interpolation
The function values f and the derivatives fx, fy and
fxy are known at the four corners (0,0), (1,0), (0,1),
and (1,1) of the unit square. The interpolated
surface can then be written
Yields a surface p(x,y) on the unit square which is

continuous and with continuous derivatives

Gonzalez & Woods
Chapter 2
Bicubic Interpolation (Discrete)
Use 16 nearest neighbor

Solve for 16 coefficients
Used in Adobe Photoshop / Corel Photopaint
Used for image resampling over bilinear or nearest
neighbor method.

Gonzalez & Woods
Chapter 2
Interpolation Comparative

Gonzalez & Woods
Chapter 2

Gonzalez & Woods
Chapter 2

Gonzalez & Woods
Chapter 2
Limitation with bilinear/bicubic

Edge blurring
Jagged artifacts
Edge blurring
Jagged artifacts
Z
X
X

Gonzalez & Woods
Chapter 2
Limitation of Interpolation
Image details can be lost during Interpolation.
Rotate

Gonzalez & Woods
Chapter 2
Edge-Sensitive Interpolation
Step 1: interpolate the missing pixels along the diagonal
a
b
x
black or white?
Since |a-c|=|b-d|
x has equal probability
of being black or white
Step 2: interpolate the other half missing pixels

a
x
d
c
Since |a-c|>|b-d|
x=(b+d)/2=black

Gonzalez & Woods
Chapter 2
A common confusion

Gonzalez & Woods
Chapter 2
Lecture 7

Gonzalez & Woods
Chapter 2
Geometric Transformation
In the virtual space, you can have any kind of apple you want!
MATLAB functions: griddata, interp2, maketform, imtransform

Gonzalez & Woods
Chapter 2
Rotation
x'
cos
sin
y'
sin
cos

Gonzalez & Woods
Chapter 2
Scale
a=1/2
x'
y'
a 0 x
0 1/ a y

Gonzalez & Woods
Chapter 2
Affine Transform
parallelogram
square
x'
y'
a11 a12
a21 a22
x
y
dx
dy

Gonzalez & Woods
Chapter 2
x'
y'
Affine Transform
Example
.5
.5
1 x
2 y
0
1

Gonzalez & Woods
Chapter 2
Shear
parallelogram
square
x'
y'
1 0 x
s 1 y
dx
dy

Gonzalez & Woods
Chapter 2
x'
y'
1 0 x
.5 1 y
0
1
Shear Example

Gonzalez & Woods
Chapter 2
Extend you imagination

Gonzalez & Woods
Chapter 2
Free Form Deformation
Seung-Yong Lee et al., Image Metamorphosis Using Snakes and Free-Form Deformations,
SIGGRAPH 1985, Pages 439-448

Gonzalez & Woods
Chapter 2
Application into Image Metamorphosis


Gonzalez & Woods
Chapter 2
Which is good?
(1) Geometric Invariance: The interpolation method should preserve the
geometry and relative sizes of objects in an image. That is, the subject matter
should not change under interpolation.
(2) Contrast Invariance: The method should preserve the luminance values of
objects in an image and the overall contrast of the image.
(3) Noise: The method should not add noise or other artifacts to the image,
such as ringing artifacts near the boundaries.
(4) Edge Preservation: The method should preserve edges and boundaries,
sharpening them where possible.
(5) Aliasing: The method should not produce jagged or staircase edges.

Gonzalez & Woods
Chapter 2
Which is good? (contd.)

(6) Texture Preservation: The method should not blur or smooth textured regions.
(7) Over-smoothing: The method should not produce undesirable piecewise
constant or blocky regions.
(8) Application Awareness: The method should produce results appropriate to
the type of image and order of resolution. For example, the interpolated results
should appear realistic for photographic images, but for medical images the results
should have crisp edges and high contrast. If the interpolation is for general images,
the method should be independent of the type of image.
(9) Sensitivity to Parameters: The method should not be too sensitive to internal
parameters that may vary from image to image and thus increase computational
overhead.

Gonzalez & Woods
Chapter 2
Geometry

Gonzalez & Woods
Chapter 2
Neighbors of Pixels P = (x,y) in 2-D

4Neighbours
N4(P) = {(x1,y), (x+1,y) , (x,y1), (x,y+1)}
DiagonalNeighbours
ND(P) = {(x1,y1), (x1,y+1) , (x+1,y1), (x+1,y+1)}
8Neighbours
N8(P) = N4(P)
ND(P)

Gonzalez & Woods
Chapter 2
Neighbors of Voxels P = (x,y,z) in 3-D

6Neighbours (Face), 18Neighbours (Edge) &
26Neighbours (Corner)

Gonzalez & Woods
Chapter 2
Adjacency
V = Set of intensity values for adjacency
P & Q are considered adjacent iff g(P), g(Q)
V = {1} for binary
4adjacency: Q
8adjacency: Q
madjacency:
Q
Q
N4(P)
N8(P)
N4(P) OR
ND(P) and for all R
N4(P) N4(Q), g(R)

Gonzalez & Woods
Chapter 2

Gonzalez & Woods
Chapter 2
Path
Sequence of distinct pixels satisfying pair-wise
adjacency
Length of the path
Number of adjacencies
One less than the number of points
Shortest Path between two pixels can be nonunique

Closed Path: Same Start and End Points

Gonzalez & Woods
Chapter 2
2-D Path
Length of the path
Number of
adjacencies
One less than the
number of points
Shortest Path
between two pixels
can be non-unique

Gonzalez & Woods
Chapter 2
8-path
m-path

Gonzalez & Woods
Chapter 2
Connectivity
Let S represents a subset of pixels in an image. p, q
are said to be connected if there exists a path
between them consisting entirely of pixels in S.
For any pixel p S, the set of pixels that are
connected to it in S is called a connected
component
If S has only one connected component, then S is
called a connected set.

Gonzalez & Woods
Chapter 2
Connectivity
Let R be a subset of pixels in an image. R is said to
be a region of the image if R is a connected set.
Region Ri and Rj are adjacent if their union form a
connected set; disjoint otherwise.
If S has only one connected component, then S is
called a connected set.

Gonzalez & Woods
Chapter 2
Two regions are 8-adjacent; but not 4-adjacent

Gonzalez & Woods
Chapter 2
Foreground & Background

Foreground: Union of all disjoint Regions in an
Image
Background: Complement of Foreground
Boundary or Border or Contour

Inner Border
Set of points in R adjacent to complement of R
Outer Border
Set of points in complement of R adjacent to R

Gonzalez & Woods
Chapter 2
The circled point is part of the boundary of the 1-valued pixels only if 8adjacency between the region and the background is used.

Gonzalez & Woods
Chapter 2
The inner boundary of the 1-valued regions

does not form a closed path, but its outer
boundary does.
The distinction between inner and outer boundary is important for the
development of the border-following algorithm.
Such algorithms use outer boundary to guarantee a closed path.

Gonzalez & Woods
Chapter 2
If region R happens to be the entire image then

what is the boundary?
Reason why?

Gonzalez & Woods
Chapter 2
Boundary and edge are they same or different?
Lets assume Edges are intensity discontinuities.

Boundaries are closed path.

Gonzalez & Woods
Chapter 2
4 and 8Neighbours Dichotomy

Jordans Curve Theorem
Every simple closed curve divides the plane into an
"interior" region bounded by the curve and an "exterior"
region containing all far away points
Any continuous path connecting a point of one region to a
point of the other intersects that loop somewhere.

L06-07 Interpolation Geometry

Hochgeladen von

Dokumentinformationen

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

L06-07 Interpolation Geometry

Hochgeladen von

Copyright:

Verfügbare Formate

Digital Image Processing, 3rd ed.

Gonzalez & Woods

Digital Image Fundamentals

19922008 R. C. Gonzalez & R. E. Woods

Digital Image Processing, 3rd ed.

Digital Image Fundamentals

What is image interpolation?

Digital Image Processing, 3rd ed.

Digital Image Fundamentals

We want GOOD images

We want COOL images

Digital Image Processing, 3rd ed.

Digital Image Fundamentals

Image Interpolation (Tool)

Zooming & Shrinking

19922008 R. C. Gonzalez & R. E. Woods

Digital Image Processing, 3rd ed.

Digital Image Fundamentals

Image Interpolation (Tool)

19922008 R. C. Gonzalez & R. E. Woods

Digital Image Processing, 3rd ed.

Digital Image Fundamentals

Scenario I: Resolution Enhancement

19922008 R. C. Gonzalez & R. E. Woods

Digital Image Processing, 3rd ed.

Digital Image Fundamentals

Scenario II: Image Inpainting

19922008 R. C. Gonzalez & R. E. Woods

Digital Image Processing, 3rd ed.

Digital Image Fundamentals

Scenario III: Image Wraping

19922008 R. C. Gonzalez & R. E. Woods

Digital Image Processing, 3rd ed.

Digital Image Fundamentals

Digital Image Processing, 3rd ed.

Digital Image Fundamentals

Linear Interpolation Formula

f(n+a)=(1-a) f(n)+a f(n+1), 0<a<1

Digital Image Processing, 3rd ed.

Digital Image Fundamentals

19922008 R. C. Gonzalez & R. E. Woods

Digital Image Processing, 3rd ed.

Digital Image Fundamentals

Image Interpolation Algorithms

19922008 R. C. Gonzalez & R. E. Woods

Digital Image Processing, 3rd ed.

Digital Image Fundamentals

Image Interpolation Algorithms

19922008 R. C. Gonzalez & R. E. Woods

Digital Image Processing, 3rd ed.

Digital Image Fundamentals

19922008 R. C. Gonzalez & R. E. Woods

Digital Image Processing, 3rd ed.

Digital Image Fundamentals

Digital Image Processing, 3rd ed.

Digital Image Fundamentals

Enlargement by 1.5 times

Image is 500 500

19922008 R. C. Gonzalez & R. E. Woods

Digital Image Processing, 3rd ed.

Digital Image Fundamentals

19922008 R. C. Gonzalez & R. E. Woods

Digital Image Processing, 3rd ed.

Digital Image Fundamentals