Lecture # 17: Fundamentals of DIP

(Geometric Operations)
Bonus: 18

Muhammad Rzi Abbas Department of Mechatronics and Control Engineering

muhammadrziabbas@uet.edu.pk
Lecturer, Mechatronics Dept.
University of Engineering and Technology, Lahore
• Brightness Interpolation
• Assume that the planar transformation has been accomplished, and
new point co-ordinates (x', y') obtained. The position of the point
does not in general fit the discrete raster of the output image.
• Values on the integer grid are needed, and each pixel value in the
output image raster can be obtained by brightness interpolation of
some neighboring samples
• Brightness Interpolation
• Influences image quality
• The simpler the interpolation, the greater is the loss in geometric
and photometric accuracy
• The interpolation neighborhood is often reasonably small due to
computational load .
• The three most common interpolation methods are
• Nearest neighbor,
• Linear, and
• Bi-cubic
• Brightness Interpolation
• Output locations (x’,y’) are calculated
• Integer locations are found on output raster
• Inverse transformation is applied on the integer output raster.
• Inverse transformation will surely not map the output locations on to
the integer input raster.
• Some kind of interpolation is then applied to agree on the brightness
values of the non-integer input raster locations.
• Brightness Interpolation
• Nearest-neighborhood interpolation assigns to the point (x, y) the
brightness value of the nearest point in the discrete raster
• Problem: Steps are formed
• Brightness Interpolation
• Linear interpolation explores four points neighboring the point (x, y),
and assumes that the brightness function is linear in this
neighborhood
• Problem: Blurring
• Brightness Interpolation
• Bi-cubic interpolation improves the model of the brightness function
by approximating it locally by a bi-cubic polynomial surface; 16
neighboring points are used for interpolation.
• Brightness Interpolation
• Bi-cubic interpolation does not suffer from the step-like boundary
problem of nearest neighborhood interpolation, and copes with
linear interpolation blurring as well.
• Bi-cubic interpolation is often used when zooming is performed. If the
nearest-neighborhood method were used, areas of the same
brightness would increase.
• Bi-cubic interpolation preserves fine details in the image very well
• Image Processing, Analysis and Machine Vision by Milan Sonka,
Vaclav Hlavac and Roger Boyle, 3rd Edition, 2008.
• Chapter 5 (Section 5.2)
• Digital Image Processing by Rafael C. Gonzalez and Richard E. Woods,
3rd Edition.
• Chapter 2 (Section 2.6.5)