Medical Imaging

Techniques

Dr. K. Adalarasu
KA – MIT – Unit I – Dec, 2019, Sastra Deemed University
 2
Textbook and Materials
Rafael C. Gonzalez, Richard E. Woods,
“Digital Image Processing”, 2nd Edition,
Pearson Education, 2003
Digital Image Processing by Jayaraman,
Veerakumar, 2012
Khandpur R.S, Handbook of Biomedical
Instrumentation, 3/e, Tata McGraw
Hill,New Delhi, 2014

KA – MIT – Unit I – Dec, 2019, Sastra Deemed University

 3
Reference
William K. Pratt, “Digital Image Processing” ,
John Willey ,2001
Steve Webb, The physics of medical imaging,
Adam Hilger, Bristol, England, Philadelphia,
USA, 1988
Jain A.K., “Fundamentals of Digital Image
Processing”, PHI, 1995.

KA – MIT – Unit I – Dec, 2019, Sastra Deemed University

 4

Digital Image
Fundamentals and
Transforms

KA – MIT – Unit I – Dec, 2019, Sastra Deemed University

 5

Spatial and Gray-Level Resolution

Most common number is 8 bits
If enhancement of specific gray-level ranges
is necessary
16 bits being used
Digitize gray levels of an image with 10 or 12
bits of accuracy

KA – MIT – Unit I – Dec, 2019, Sastra Deemed University

 6

Spatial and Gray-Level Resolution

256*256 image was generated by

deleting every other row and column
in 512*512 image
Number of allowed gray levels was
kept at 256

KA – MIT – Unit I – Dec, 2019, Sastra Deemed University

KA – MIT – Unit I – Dec, 2019, Sastra Deemed University
 8
Spatial and Gray-Level Resolution
Example
Keep number of samples constant
Reduce number of gray levels from
256 to 2
In integer powers of 2
452*374 CAT projection image
Displayed with k=8(256 gray
levels)
KA – MIT – Unit I – Dec, 2019, Sastra Deemed University
 9

(a) 452*374,
256-level image.
(b)–(d) Image
displayed in 128,
64, and 32 gray
levels, while
keeping the
spatial resolution
constant

KA – MIT – Unit I – Dec, 2019, Sastra Deemed University

 10
Spatial and Gray-Level Resolution
Obtained by reducing number of bits
from k=7to k=1
While keeping spatial resolution
constant at 452*374 pixels
256, 128, and 64-level images are
visually identical for all practical
purposes

KA – MIT – Unit I – Dec, 2019, Sastra Deemed University

 11

(e)–(g)
Image
displayed in
16, 8,
4, and 2
gray
levels

KA – MIT – Unit I – Dec, 2019, Sastra Deemed University

 12

Questions

Define Image?
What is the need for digital Image
processing ?
What do you mean by sampling and
quantization ?

KA – MIT – Unit I – Dec, 2019, Sastra Deemed University

 13

Aliasing and Moiré Patterns

Function is under-sampled
Then a phenomenon called aliasing corrupts
sampled image
Corruption is in form of “additional frequency
components” being introduced into sampled
function
Sampling rate in images is number of
samples taken (in both spatial directions) per
unit distance

KA – MIT – Unit I – Dec, 2019, Sastra Deemed University

 14

Aliasing and Moiré Patterns

Principal approach for reducing aliasing
effects on an image
To reduce its high-frequency components
by blurring image prior to sampling

KA – MIT – Unit I – Dec, 2019, Sastra Deemed University

 15

Aliasing in Digital Images

KA – MIT – Unit I – Dec, 2019, Sastra Deemed University

 Zooming and Shrinking Digital 16

Images
Zooming
Viewed as oversampling
Shrinking
Viewed as under-sampling
Zooming and shrinking are applied to a digital
image
Zooming requires two steps
Creation of new pixel locations
Assignment of gray levels to those new locations

KA – MIT – Unit I – Dec, 2019, Sastra Deemed University

 17
Zooming and Shrinking Digital
Images
Example
Image of size 500*500 pixels
Want to enlarge it 1.5 times to 750*750
pixels
Laying an imaginary 750*750 grid over
original image
Spacing in grid would be less than one
pixel
We are fitting it over a smaller image
KA – MIT – Unit I – Dec, 2019, Sastra Deemed University
 18
Zooming and Shrinking Digital
Images
To perform gray-level assignment for
any point in overlay
Look for closest pixel in original image
Assign its gray level to new pixel in grid
This method of gray-level assignment is
called nearest neighbor interpolation
Pixel neighborhoods

KA – MIT – Unit I – Dec, 2019, Sastra Deemed University

 19
Zooming and Shrinking Digital
Images
Pixel replication
Applicable when we want to increase size
of an image an integer number of times
Double size of an image
Can duplicate each column
Doubles image size in horizontal
direction

KA – MIT – Unit I – Dec, 2019, Sastra Deemed University

 20

Top row: images zoomed from 128*128, 64*64, and 32*32

pixels to 1024*1024 pixels, using nearest neighbor gray-level
interpolation. Bottom row: same sequence, but using bilinear
interpolation
KA – MIT – Unit I – Dec, 2019, Sastra Deemed University
 21
Zooming and Shrinking Digital
Images
Duplicate each row of enlarged image to
double the size in vertical direction
Same procedure is used to enlarge image
by any integer number of times (triple,
quadruple, and so on)
Gray-level assignment of each pixel is
predetermined by fact that new locations are
exact duplicates of old locations

KA – MIT – Unit I – Dec, 2019, Sastra Deemed University

 22
Zooming and Shrinking
Nearest neighbor interpolation is fast
Undesirable feature that it produces a
checkerboard effect
Particularly objectionable at high factors of
magnification
More sophisticated way of accomplishing gray-
level assignments
Bilinear interpolation using four nearest neighbors
of a point
To reduce possible aliasing effects
It is a good idea to blur an image slightly before
shrinking it
KA – MIT – Unit I – Dec, 2019, Sastra Deemed University
 23

Basic Relationships between Pixels

Objective
 To study relationships
between pixels in an image

KA – MIT – Unit I – Dec, 2019, Sastra Deemed University

 24
Neighborhood of a Pixel
Given a pixel p in center of 9

4-neighbors of p = b, d, e, g;
8-neighbors of p = a, b, c, d, e, f, g, h;
Diagonal neighbors of p = a, c, f, h;

KA – MIT – Unit I – Dec, 2019, Sastra Deemed University

 25
Neighbors of a Pixel
There are three kinds of neighbors of a pixel

KA – MIT – Unit I – Dec, 2019, Sastra Deemed University

 26

Neighbors of a Pixel
4-neighbors of p

8-neighbors of p

Diagonal neighbors of p

KA – MIT – Unit I – Dec, 2019, Sastra Deemed University

 27
Adjacency
Adjacency
Two pixels that are neighbors and have
same grey-level (or some other
specified similarity criterion) are
adjacent
Three types of adjacency
4-adjacency
8-adjacency
m-adjacency (mixed adjacency)
KA – MIT – Unit I – Dec, 2019, Sastra Deemed University
 28
Adjacency
4-adjacency
Two pixels p and q with values from V are 4-
adjacent if q is in set N4(p)
8-adjacency
Two pixels p and q with values from V are 8-
adjacent if q is in the set N8(p)
m-adjacency (mixed adjacency)
(i).q is in N4(p), or
 (ii).p and q are diagonally adjacent and do not
have any common 4-adjacent neighbors
They cannot be both (i) and (ii)
KA – MIT – Unit I – Dec, 2019, Sastra Deemed University
 29

Adjacency
Mixed adjacency is a modification of 8-
adjacency
Introduced to eliminate ambiguities that often
arise when 8-adjacency is used
For example, pixel arrangement shown in Fig

KA – MIT – Unit I – Dec, 2019, Sastra Deemed University

 30

Adjacency
For V={1}
Three pixels at top show multiple (ambiguous) 8-
adjacency, as indicated by dashed lines

KA – MIT – Unit I – Dec, 2019, Sastra Deemed University

 31

Adjacency
Ambiguity is removed by using m-
adjacency

KA – MIT – Unit I – Dec, 2019, Sastra Deemed University

 32

Adjacency

KA – MIT – Unit I – Dec, 2019, Sastra Deemed University

 33

Distance Measures
D4 and D8 distances between p and q are
independent of any paths that might exist
between points
Because these distances involve only
coordinates of points
Dm distance between two points is defined
as shortest m-path between point
Distance between two pixels will depend on
values of pixels along path
As well as values of their neighbors

KA – MIT – Unit I – Dec, 2019, Sastra Deemed University

 34
Distance Measures
Following arrangement of pixels
Assume that p, p2 and p4 have value 1
p1and p3 can have a value of 0 or 1

KA – MIT – Unit I – Dec, 2019, Sastra Deemed University

 35

Distance Measures
Suppose that we consider adjacency of
pixels valued 1 (i.e., V={1})
Case 1
If p1 and p3 = 0
Length of shortest path between p and p4 = 2
Case 2
If p1 = 1 and p3 = 0
Length of shortest path between p and p4 = 3
Path p p1 p2 p4

KA – MIT – Unit I – Dec, 2019, Sastra Deemed University

 36

Distance Measures
Case 3
If p1 = 0 and p3 = 1
Length of shortest path between p and p4
=3
Path p p2 p3 p4
Case 4
If p1 = 1 and p3 = 1
Length of shortest path between p and p4
=4
Path p p1 p2 p3 p4
KA – MIT – Unit I – Dec, 2019, Sastra Deemed University
 37

Problem

KA – MIT – Unit I – Dec, 2019, Sastra Deemed University

 38

Solution

KA – MIT – Unit I – Dec, 2019, Sastra Deemed University

 39

Problem 2

KA – MIT – Unit I – Dec, 2019, Sastra Deemed University