+ All Categories
Home > Documents > The content of these slides by John Galeotti, © 2012 - 2014 Carnegie Mellon University (CMU), was...

The content of these slides by John Galeotti, © 2012 - 2014 Carnegie Mellon University (CMU), was...

Date post: 04-Jan-2016
Category:
Upload: preston-baker
View: 214 times
Download: 2 times
Share this document with a friend
21
The content of these slides by John Galeotti, © 2012 - 2014 Carnegie Mellon University (CMU), was made possible in part by NIH NLM contract# HHSN276201000580P, and is licensed under a Creative Commons Attribution-NonCommercial 3.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nc/3.0/ or send a letter to Creative Commons, 171 2nd Street, Suite 300, San Francisco, California, 94105, USA. Permissions beyond the scope of this license may be available either from CMU or by emailing [email protected]. The most recent version of these slides may be accessed online via http://itk.galeotti.net/ Lecture 5 Image Characterization ch. 4 of Machine Vision by Wesley E. Snyder & Hairong Qi Spring 2014 BioE 2630 (Pitt) : 16-725 (CMU RI) 18-791 (CMU ECE) : 42-735 (CMU BME) Dr. John Galeotti
Transcript
Page 1: The content of these slides by John Galeotti, © 2012 - 2014 Carnegie Mellon University (CMU), was made possible in part by NIH NLM contract# HHSN276201000580P,

The content of these slides by John Galeotti, © 2012 - 2014 Carnegie Mellon University (CMU), was made possible in part by NIH NLM contract# HHSN276201000580P, and is licensed under a Creative Commons Attribution-NonCommercial 3.0 Unported License. To view a copy of this license, visit http://creativecommons.org/licenses/by-nc/3.0/ or send a letter to Creative Commons, 171 2nd Street, Suite 300, San Francisco, California, 94105, USA. Permissions beyond the scope of this license may be available either from CMU or by emailing [email protected] most recent version of these slides may be accessed online via http://itk.galeotti.net/

Lecture 5Image Characterization

ch. 4 of Machine Vision by Wesley E. Snyder & Hairong Qi

Spring 2014 BioE 2630 (Pitt) : 16-725 (CMU RI)

18-791 (CMU ECE) : 42-735 (CMU BME)

Dr. John Galeotti

Page 2: The content of these slides by John Galeotti, © 2012 - 2014 Carnegie Mellon University (CMU), was made possible in part by NIH NLM contract# HHSN276201000580P,

2

Digital ImagesHow are they formed?How can they be represented?

Page 3: The content of these slides by John Galeotti, © 2012 - 2014 Carnegie Mellon University (CMU), was made possible in part by NIH NLM contract# HHSN276201000580P,

3

Image Representation

HardwareStorageManipulation

HumanConceptualMathematical

Page 4: The content of these slides by John Galeotti, © 2012 - 2014 Carnegie Mellon University (CMU), was made possible in part by NIH NLM contract# HHSN276201000580P,

4

Iconic Representation

What you think of as an image, …CameraX-RayCTMRIUltrasound2D, 3D, …etc

Page 5: The content of these slides by John Galeotti, © 2012 - 2014 Carnegie Mellon University (CMU), was made possible in part by NIH NLM contract# HHSN276201000580P,

5

Iconic Representation

And what you might not

Images from CESAR lab at Oak Ridge National Laboratory,Sourced from the USF Range Image Database:http://marathon.csee.usf.edu/range/DataBase.htmlAcknowledgement thereof requested with redistribution.

Range ImageCorresponding Intensity Image

Page 6: The content of these slides by John Galeotti, © 2012 - 2014 Carnegie Mellon University (CMU), was made possible in part by NIH NLM contract# HHSN276201000580P,

6

Functional Representation

An EquationTypically continuous

Fit to the image dataSometimes the entire imageUsually just a small piece of it

Examples:BiquadraticQuardic

Page 7: The content of these slides by John Galeotti, © 2012 - 2014 Carnegie Mellon University (CMU), was made possible in part by NIH NLM contract# HHSN276201000580P,

7

Linear RepresentationUnwind the image

“Raster-scan” itEntire image is now a vector

Now we can do matrix operations on it!Often used in research papers

Probability & Graphs Discussed later (if at all)

Probabilistic & Relational Representations

Page 8: The content of these slides by John Galeotti, © 2012 - 2014 Carnegie Mellon University (CMU), was made possible in part by NIH NLM contract# HHSN276201000580P,

8

Think “Fourier Transform”

Multiple Dimensions!Varies greatly across

different image regionsHigh Freq. = Sharpness

Steven Lehar’s details: http://sharp.bu.edu/~slehar/fourier/fourier.html

Spatial Frequency Representation

Page 9: The content of these slides by John Galeotti, © 2012 - 2014 Carnegie Mellon University (CMU), was made possible in part by NIH NLM contract# HHSN276201000580P,

9

Image Formation

Sampling an analog signalResolution

# Samples per dimension, OR Smallest clearly discernable physical object

Dynamic Range# bits / pixel (quantization accuracy), ORRange of measurable intensities Physical meaning of min & max pixel values light, density, etc.

Page 10: The content of these slides by John Galeotti, © 2012 - 2014 Carnegie Mellon University (CMU), was made possible in part by NIH NLM contract# HHSN276201000580P,

10

Dynamic Range Example(A slice from a Renal Angio CT: 8 bits, 4 bits, 3 bits, 2 bits)

Page 11: The content of these slides by John Galeotti, © 2012 - 2014 Carnegie Mellon University (CMU), was made possible in part by NIH NLM contract# HHSN276201000580P,

11

FYI: Python Code for the Dynamic Range Slideimport SimpleITK as sitk

# a processed slice from http://pubimage.hcuge.ch:8080/DATA/CENOVIX.zipimg = sitk.ReadImage( “UpperChestSliceRenalAngioCT-Cenovix.tif" )out4 = sitk.Image(512,512,sitk.sitkUInt8)out3 = sitk.Image(512,512,sitk.sitkUInt8)out2 = sitk.Image(512,512,sitk.sitkUInt8)

y=0while y<512: x=0 while x<512: #print "img ",x,y,"=",img[x,y] out4[x,y] = (img[x,y] >> 4) << 4 out3[x,y] = (img[x,y] >> 5) << 5 out2[x,y] = (img[x,y] >> 6) << 6 x = x + 1 y = y + 1

Page 12: The content of these slides by John Galeotti, © 2012 - 2014 Carnegie Mellon University (CMU), was made possible in part by NIH NLM contract# HHSN276201000580P,

12

An Aside: The Correspondence ProblemMy Definition:

Given two different images of the same (or similar) objects,for any point in one imagedetermine the exact corresponding point in the other image

Similar (identical?) to registrationQuite possibly, it is THE problem in computer

vision

Page 13: The content of these slides by John Galeotti, © 2012 - 2014 Carnegie Mellon University (CMU), was made possible in part by NIH NLM contract# HHSN276201000580P,

13

Image Formation: Corruption

There is an ideal image It is what we are physically measuring

No measuring device is perfectMeasuring introduces noiseg(x,y) = D( f(x,y) ), where D is the distortion function

Often, noise is additive and independent of the ideal image

Camera, CT, MRI, …

Measuredg(x,y)

Idealf(x,y)

Page 14: The content of these slides by John Galeotti, © 2012 - 2014 Carnegie Mellon University (CMU), was made possible in part by NIH NLM contract# HHSN276201000580P,

14

Image Formation: Corruption

Noise is usually not the only distortionIf the other distortions are:

linear & space-invariant

then they can always be represented with the convolution integral!

Total corruption:

Page 15: The content of these slides by John Galeotti, © 2012 - 2014 Carnegie Mellon University (CMU), was made possible in part by NIH NLM contract# HHSN276201000580P,

15

The image as a surface

Intensity height In 2D case, but concepts extend to ND

z = f ( x, y )Describes a surface in space

Because only one z value for each x, y pairAssume surface is continuous (interpolate pixels)

Page 16: The content of these slides by John Galeotti, © 2012 - 2014 Carnegie Mellon University (CMU), was made possible in part by NIH NLM contract# HHSN276201000580P,

16

Isophote

“Uniform brightness”C = f ( x, y )A curve in space (2D) or surface (3D)Always perpendicular to image gradient

Why?

Page 17: The content of these slides by John Galeotti, © 2012 - 2014 Carnegie Mellon University (CMU), was made possible in part by NIH NLM contract# HHSN276201000580P,

17

Isophotes are like contour lines on a topography (elevation) map.

At any point, the gradient is always at a right angle to the isophote!

Isophotes & Gradient

Page 18: The content of these slides by John Galeotti, © 2012 - 2014 Carnegie Mellon University (CMU), was made possible in part by NIH NLM contract# HHSN276201000580P,

18

Ridges

One definition:Local maxima of the rate of change of gradient

directionSound confusing?Just think of ridge lines along a mountainIf you need it, look it up Snyder references Maintz

Page 19: The content of these slides by John Galeotti, © 2012 - 2014 Carnegie Mellon University (CMU), was made possible in part by NIH NLM contract# HHSN276201000580P,

19

Medial AxisSkeletal representationDefined for binary images

This includes segmented images!“Ridges in scale-space”

Details have to wait (ch. 9)

Image courtesy of TranscenData Europehttp://www.fegs.co.uk/motech.html

http://sog1.me.qub.ac.uk/Research/medial/medial.php

Page 20: The content of these slides by John Galeotti, © 2012 - 2014 Carnegie Mellon University (CMU), was made possible in part by NIH NLM contract# HHSN276201000580P,

20

Neighborhoods

Terminology4-connected vs. 8-connected Side/Face-connected vs. vertex-connectedMaximally-connected vs. minimally-

connected (ND)Connectivity paradox

Due to discretizationCan define other neighborhoods

Adjacency not necessarily required ?

Is thispixelconnectedto theoutside?

Is thisshapeclosed?

Page 21: The content of these slides by John Galeotti, © 2012 - 2014 Carnegie Mellon University (CMU), was made possible in part by NIH NLM contract# HHSN276201000580P,

21

Curvature

Compute curvature at every point in a (range) image (Or on a segmented 3D surface)

Based on differential geometryFormulas are in your book2 scalar measures of curvature that are invariant to

viewpoint, derived from the 2 principal curvatures, (K1, K2):Mean curvature (arithmetic mean)Gauss curvature (product) =0 if either K1=0 or K2=0


Recommended