lecture #22 - case western reserve...

EECS490: Digital Image Processing

Lecture #22

• “Gold Standard” project images

• Otsu thresholding

• Local thresholding

• Region segmentation

• Watershed segmentation

• Frequency-domain techniques

Project Images 1

Project Images 2

Project Images 3

Project Images 4

Project Images 5

Project Images 6

Optimum Thresholding

Simple bimodal distributionwith two homogeneousclasses

Class 1

Class 2 If there is no valley onemethod of determining T is tominimize the total variancewithin both classes.

intensityprob

intensity

Image Thresholding

• Otsu method minimizes the overall within-classvariance by minimizing the weighted sum of classvariances

w2 t( ) = q1 t( ) 1

2 t( ) + q2 t( ) 22 t( )

q1 t( ) = P i( )i=0

q2 t( ) = P i( )i= t

12 t( ) =

q1 t( )i μ1 t( )

2P i( )

22 t( ) =

q2 t( )i μ2 t( )

2P i( )

i= t+1

Class 1

Class 2

Standard deviation of the intensitieswithin each class normalized by theprobability of that class

CDF for eachclass

Image Thresholding

1. Compute the histogram of the image. Let each gray level haveprobability pi.

2. Compute the cumulative sum P1(k) for k=0,…,L-1

3. Compute the cumulative mean m(k) for k=0,…,L-1

4. Compute the global intensity mean mG

5. Compute the between class variance B2(k) for k=0,…,L

6. Compute the Otsu threshold k* as the value of k for which B2(k)

is maximum7. Obtain the separability measure *

P1 k( ) = pii=0

m1 k( ) =1

P1 k( )ipi

mG = ipii=0

B2= P1 k( ) m1 k( ) mG( )

2+ P2 k( ) m2 k( ) mG( )

* = B2 k *( )

The farther apartthe means the largerwill be B

This is a measure of howeasily separable theclasses are. Uniformdistribution is 0 and aclear, bimodal is 1

http://www.mathworks.com/matlabcentral/fileexchange/loadFile.do?objectId=16205

Image Thresholding

Original image.

GlobalthresholdingcalculatingT=0.5*( 1+ 2)until T less thansome

Globalthresholdingusing Otsualgorithm

Image Thresholding

Noisyimage

Smoothednoisyimage

Averaginggreatly improvesseparability

Global thresholdingusing Otsu algorithm

Image Thresholding

Noisyimage

Smoothednoisyimage

Averaging doesnot improveseparability

Global thresholdingusing Otsu algorithm

Image Thresholding

Noisyimage

Thresholdedgradientimage (veryhighthreshold)

Edge masking uses onlypixels near edges to formhistogram

GlobalthresholdingofORIGINALimage usingOtsualgorithm onhistogram ofmaskedimage

Produce ofthresholdedgradientimage andoriginalimage

Basic idea is to look at the histogram of pixels only near edges

Image Thresholding

Noisy image ofyeast cells —want to findbright spots

Otsuthresholdingof noisyimagehistogram

Edge masking uses only pixelsnear edges to form histogram

Globalthresholding ofORIGINALimage using Otsualgorithm onhistogram ofmasked image

Product ofthresholdedLaplacian(highthreshold)image andoriginal image

Image Thresholding

Global thresholding of ORIGINAL imageusing Otsu algorithm on histogram ofmasked image. Only difference fromprevious slide is that lower threshold forabsolute Laplacian was used.

Image Thresholding

Modify Otsu global thresholding by adding a third class

B2= P1 m1 mG( )

2+ P2 m2 mG( )

2+ P3 m3 mG( )

Compute the between class variance B2(k1,k2) for

k1=0,…,L-1 and k2=0,…,L-1Otsu optimum thresholds k1,k2 when B

2 (k1,k2) is maximum

Image Thresholding

Originaldark, noisyimage

GlobalthresholdingcalculatingT=0.5*( 1+ 2)until T lessthan some

Globalthresholdingusing Otsualgorithm

Subdivide original image into sixsubimages and apply Otsu algorithmto histogram of each subimage(next page)

Subimagethresholdingusing Otsualgorithm

Image Thresholding

Originalimage

Globalthresholdingusing dualthresholdOtsu method

Local standarddeviationscomputed for amoving 3x3 mask

Local thresholding

g x, y( ) =1 if f x, y( ) > 30 x, y( ) AND f x, y( ) > 1.5mG

0 otherwise

Predicate (true or false)using local (3x3) std dev

Image Thresholding

Original imagewith spotillumination

Globalthresholdingusing Otsumethod

Localthresholdingusing n=20movingaverage

g x, y( ) =1 if f x, y( ) > 0.5mxy

0 otherwise

mxy = m k +1( ) =1

nzi = m k( )

i= k+2 n

nzk+1 zk n( )Use local moving average where m(1)=z1/n

zk is the intensity point at scanning sequence k (wraps around image)

zk zk+1zk n

Image Thresholding

Original imagewith spotillumination

Globalthresholdingusing Otsumethod

Local thresholding usingn=20 moving average

g x, y( ) =1 if f x, y( ) > 0.5mxy

0 otherwise

mxy = m k +1( ) =1

nzi = m k( )

i= k+2 n

nzk+1 zk n( )Use local moving average where m1=z1/n

Region Segmentation

• Let f(x,y) be the image, S(x,y) is a binary seedimage with 1’s at the location of seed points, andQ(x,y) is a predicate function

• Find all connected components in S(x,y) and erodeeach connected component to one pixel.

• Form an image fQ such that at each point f(x,y)=1if Q(x,y) is true, else f(x,y)=0

• Let g be an image formed by appending to eachseed point in S all 1-valued points in fQ that are 8-connected to that seed point

• Label each connected component in g with a uniquelabel (e.g., 1, 2, 3, …) This is the segmented image

Region Segmentation

Original image 1. Seed imagefrom highpercentilethresholding

2. Erode seedimage

3. |original-seed|difference image

4. Differenceimage using dualthresholdsT1=68, T2=126

5. Difference imageusing only the lowestthreshold.

6. Region growingfrom seed image(single threshold)using differenceimage and 8-connectivity

Quadtree Segmentation

An alternative to having a seed image and region growing is to partition an imageinto sub-images. This process continues until each region has a uniformpredicate. The process then merges adjacent regions with similar predicates.This is sometimes called quadtree segmentation.

Quadtree Segmentation

Quadtree segmentation of image using minimum region sizes of 32x32, 16x16,and 8x8 pixels. Predicate is TRUE if >a and 0<m<b

566x566 pixel image

Watershed Segmentation

Original grayscale image

Topographicalplot of originalimage

Punch holes inbottom of eachregion andflood.

Punch anotherregion andcontinueflooding.

Start buildingdam betweenregions

Continue buildingdams between regions

Final watershed

• Mi is the set of coordinates of points in the regional minimaof an image g(x,y)

• T[n]={(s,t)|g(s,t)<n} is the set of all points lying below the nplane

• Cn(Mi) denotes the set of coordinates of points associatedwith minimum Mi that are flooded at stage n.

• Cn(Mi) T[n] restricts the points associated with Mi to thoseless than n at that stage of the flooding

• The union of flooded catchment basements is• Let q be in connected component in C[n].

– If q C[n-1] is empty do nothing– If q C[n-1] contains one connected component of C[n-1] then

incorporate into C[n-1]– If q C[n-1] is contains two or more connected components of

C n[ ] = Cn Mi( )i=1

Image Segmentation

Dilating from lowest points atstage n-1

Dam constructionbegins when dilationsoverlap at stage n

Dam constructedbetween basins

Image Segmentation

Original image Gradient image

Watershed lines ingradient image

Watershed lineson top oforiginal image

Image Segmentation

Direct application ofwatershed segmentationtypically results inoversegmentation, i.e., toomany regions

Image Segmentation

Internalmarkers (lightgray regions)define startingpoints andexternalmarkers (graylines) limitsegmentation.

We can useothersegmentationtechniques todefine markerswhich willcontrol thesegmentation.

Resultingsegmentedimage.

10.57(b)

Motion Segmentation

Accumulative Difference Image(ADI) for a moving rectangle.

Ak x, y( ) =Ak 1 x, y( ) +1 if R x, y( ) f x, y,k( ) > T

Ak 1 x, y( ) otherwise

The accumulator is incremented if the absolute difference between the referenceframe and each successive frame is above a threshold. We can also have positiveand negative accumulator images.

Pk x, y( ) =Pk 1 x, y( ) +1 if R x, y( ) f x, y,tk( ) > TPk 1 x, y( ) otherwise

Nk x, y( ) =Nk 1 x, y( ) +1 if R x, y( ) f x, y,tk( ) T

Nk 1 x, y( ) otherwise

Positive ADI Negative ADI

Image Segmentation

There is a small movingobject with a 9 pixel Gaussiandistribution moving withvx=0.5 and vy=0.5 pixel/frame.This is one of 32 frames.

Basic concept: Single one pixel object moving against a uniform background. vx=1pixel/frame1. Project image onto x-axis (sum columns)2. At t=0 multiply columns of projection array by ej2 ax t, x=0,1,2,… where a is a positiveinteger and t is the time interval between frames3. At t=1 do the same thing except object has moved to x’+1This gives a accumulator array of zeroes except for the moving object projection.If the velocity is constant the projection is ej2 a(x’+t) t=cos[2 a(x’+t) t]+jsin[2 a(x’+t) t],i.e., projections of moving objects give single frequency sinusoids (for constant velocity)

Image Segmentation

Moving object

Intensity plot of single frame.

Image Segmentation

u1=3 x-velocity of unknown object isv1 =u1/a1=3/6=0.5 pixel/frame

The a’s are selected toprevent aliasing in thefrequency domain. A ruleof thumb is to select a asthe integer closest toumax/vmax where vmax is themaximum velocity and umaxis related to the maximumnumber of frames/second.

Image Segmentation

y-velocity of moving object is thenv2 =u2/a2=4/4=1 pixel/frame

lecture #22 - case western reserve...

Documents

engr.case.eduengr.case.edu/merat_francis/eecs 490...

c a s eengr.case.edu/merat_francis/ugrecruit/case...

eecs 490 image...

13 addressing modes - case western reserve...

lecture #25 - case western reserve...

case western reserve university case …engr.case.edu ›...

senior project final report - case western reserve...

exam #3 'f97 - case western reserve...

p&p review notes - case western reserve...

lecture #19 - case western reserve...

pe review pt2 04 - case western reserve...

case western reserve...

lecture...

lecture #21 - case western reserve...

image resizing by seam carving in python and matched...

03 number systems v - case western reserve...

ip-over-usb gateway - case western reserve...

algorithm for detecting and counting tightly bundled axons...

lecture #2 - case western reserve...

lecture #26 - case western reserve...