Documenti di Didattica
Documenti di Professioni
Documenti di Cultura
Chae-Bong Sohn
1
Lecture Information
l Textbook
– S.E. Umbaugh, Computer Imaging: Digital Image Analysis and Processing,
CRC Press Book
l Reference
– R.C. Gonzalez, Digital Image Processing 2nd Ed. Prentice Hall
l Class Hours
– Tue. 15:00 ~ 16:15, Thu. 09:00~10:15, #211 Bima-Kwan
l Professor
– Chae-Bong Sohn
– #628 Hwado-Kwan, 02-940-5767
2
Chapter 0. Introduction
3
Contents
4
What is Digital Image Processing?
5
What is Digital Image Processing
6
Structure of Image Processing
7
Example of Fields
8
Gamma Ray Imaging
tumor
• (a) & (b) : The patient is
given a radioactive isotope
that emits positrons as it
decays. When a positron
meets an electron, both are
annihilated and two gamma
rays are given off. These are
detected and a tomographic
image is created
• (c) & (d) : Using the natural
radiation of the object being
imaged
9
X-Ray Imaging
* aorta: 대동맥
10
Ultraviolet Imaging
11
Imaging in the Visible and Infrared Bands
12
Imaging in the Visible and Infrared Bands
13
Imaging in the Visible and Infrared Bands
14
Imaging in the Visible and Infrared Bands
15
Imaging in the Visible and Infrared Bands
16
Imaging in the Visible and Infrared Bands
17
Imaging in the Microwave Band
18
Imaging in the Radio Band : MRI
19
Ultrasound Imaging
20
Scanning Electron Microscope Imaging
21
Some Examples using DIP :
22
22
Some Examples using DIP :
23
23
Some Examples using DIP :
24
24
Fundamental Steps in DIP
25
25
Components of a General-Purpose IP System
26
26
Image Enhancement
27
27
Image Enhancement
28
28
Image Degradation/Restoration Process
29
29
Image Restoration
30
30
Image Restoration
31
31
Image Compression
32
32
Image Compression
33
33
Image Segmentation
34
34
Image Segmentation
35
35
Elements of Visual Perception
l Cornea (각막)
l Iris (홍채)
l Ciliary fibers/muscle/body
(모양체)
l Vitreous humor (유리질)
l Fovea (황반)
l Retina (망막)
l Sclera (공막)
l Choroid (맥락막)
l Anterior Chamber (전방)
36
36
Elements of Visual Perception
l 황반 (Fovea)
37
37
Elements of Visual Perception
l 맥락막 (Choroid )
– 망막의 표층에 영양 공급
38
38
Elements of Visual Perception
39
39
Elements of Visual Perception: 동시 대비 효과
40
40
Elements of Visual Perception: 동시 대비 효과
같은 휘도 다른 휘도
41
41
Elements of Visual Perception: 동시 대비 효과
DI / I
0.02
42
42
Elements of Visual Perception: 동시 대비 효과
43
43
Elements of Visual Perception: Mach band 효과
• 물체와 배경
휘도의 공간적
상호 작용으로
나타나는 현상
44
44
Elements of Visual Perception: Optical Illusions
45
45
Light and The Electromagnetic Spectrum
색상 자외선 적외선
l 색의 3가지 속성
l 영상 데이터: 빛의 파장에 의해 정의되는 색도, 빛의 양인 휘도 등과
같은 물리적인 양
l 감광신경: 이들의 자극을 뇌에 전달.
l 뇌는 색상(Hue), 명도(brightness), 채도(saturation)로 감지
l 명도(brightness) : 색의 밝기, 휘도
l 색상(hue) : 색의 종류
l 채도(saturation) : 색의 선명도, 포화도(백색광의 포함정도) %
46
46
Light and The Electromagnetic Spectrum
47
47
Image Sensing and Acquisition
48
48
Image Sensing and Acquisition
l Image : f(x,y)
– i(x,y) : illumination
The amount of source illumination incident on the scene being viewed
– r (x,y) : reflectance
The amount of illumination reflected by the objects in the scene
f ( x, y ) = i ( x, y ) r ( x, y )
where 0 < i ( x, y ) < ¥ and 0 < r ( x, y ) < 1
– Applicable to images formed via transmission of the illumination through a
medium (예: a chest X-ray)
• transmissivity instead of a reflective ft
49
49
Image Sampling and Quantization
50
50
Image Sampling and Quantization
51
51
Image Sampling and Quantization
52
52
Image Sampling and Quantization
L = 2k
b = M ´ N ´ k (= N 2 k when M = N )
53
53
Image Sampling and Quantization
l Spatial-Level Resolution
54
54
Image Sampling and Quantization
55
55
Image Sampling and Quantization
l Gray-Level Resolution
56
56
Spatial-Level Resolution
57
57
Image Sampling and Quantization
58
58
Image Sampling and Quantization
v An isopreference curve in the Nk-plane
l Points lying on the curve correspond to images of equal
subjective quality
l More vertical as the detail in the image
increases Only a few gray levels may
be needed for images w/ a large amount
of detail
l Perceived quality in the other two image
categories remained the same in some
intervals in which the spatial resolution
was increased, but the number of gray
levels actually decreased a decrease
in k tends to increase the apparent
contrast of an image
59
59
Image Sampling and Quantization
v Aliasing and Moire Patterns
60
60
Image Sampling and Quantization
v Moire Patterns
l If the function is undersampled, then aliasing corrupts the
sampled image.
l The corruption is in the form of additional frequency
components being introduced into the sampled function
aliased frequencies
l The sampling rate in images is the number of samples taken
per unit distance
l The principal approach for reducing the aliasing effects on an
image is to reduce its high-frequency components by blurring
the image prior to sampling
l However, aliasing is always present in a sampled image.
l The effect of aliased frequencies can be seen under the right
conditions in the form of so called Moire patterns.
61
61
Image Sampling and Quantization
v Moire Patterns (계속)
l Moire effect occurs when the display spot size is small
(compared to sampling distance) so that the reconstruction
filter cutoff extends far beyond the ideal low-pass filter cutoff.
l Then a signal at x x < x xs will interfere with a companion signal
2
at x xs - x x to create a beat pattern.
l A spatial case of this situation occurs when the input image is
a uniform gray field. Then if the reconstruction filter does not
have zero response at the sampling frequencies, scan lines
will appear, and the displayed image will exhibit stripes and
not a flat field.
http://mathworld.wolfram.com/MoirePattern.html
62
62
Image Sampling and Quantization
63
63
Basic Relationships between Pixels
v Some Basic Relationships Between Pixels
l Neighbors of a pixel
l N4(p) : 4-neighbors (x+1,y), (x -1, y), (x, y +1), (x, y -1)
l ND(p) : 4 diagonal neighbors ( x ± 1, y ± 1)
l N8(p) : N4(p) + ND(p)
l 3 types of Adjacency
l 4-adjacency : two pixels p and q with values from V are 4-
adjacency if q is in the set N4(p).
l 8-adjacency : two pixels p and q with values from V are 8-
adjacency if q is in the set N8(p).
l m-adjacency (mixed adjacency) : two pixels p and q with
values from V are m-adjacency if
§ q is in N4(p) or
§ q is in ND(p) and the set N 4 ( p ) Ç N 4 (q ) has no pixels
whose values are from V
64
64
Basic Relationships between Pixels
l m-adjacency is a modification of 8-adjacency
l It is introduced to eliminate the ambiguities that often arise
when 8-adjacency is used
65
65
Basic Relationships between Pixels
66
66
Basic Relationships between Pixels
v Let S represent a subset of pixels in an image
l p and q are said to be connected in S if there exists a path between
them consisting entirely of pixels in S.
l For any p in S, the set of pixels that are connected to it in S is called
a connected component of S.
l If it only has one connected component, then set S is called a
connected set.
67
67
Basic Relationships between Pixels
v Let R be a subset of pixels in an image
l R is called a region of the image if R is a connected set
l The boundary ( border or contour )of R is the set of pixels in the
region that have one or more neighbors that are not in R.
l If R happens to be an entire image, then its boundary is defined as
the set of pixels in the 1-st and last rows and columns of the image.
l Region : a subset of an image, and any pixels in the boundary of the
region that happen to coincide with the border of the image are
included implicitly as part of the region boundary
68
68
Basic Relationships between Pixels
v Distance Measures
l For pixels p, q and z with coordinates (x,y) , (s,t) and (v,w) ,
respectively, D is a distance function or metric if
D( p, q ) ³ 0 ( D( p, q ) = 0 iff p = q )
D( p, q ) = D(q, p ), and
D ( p, z ) £ D ( p, q ) + D ( q, z )
l The Euclidean distance
l D4 distance (city-block) [ 2
D e ( p, q ) = ( x - s ) + ( y -t ) 2
]
1/ 2
l D8 distance (chessboard) D 4 ( p, q ) = x - s + y - t
D8 ( p, q ) = max( x - s , y - t )
2 22222
212 21112
21012 21012
212 21112
2 22222
69
69
Basic Relationships between Pixels
p3 p4
p1 p2
p
l Suppose V={1}
l If p1 and p3 are 0, the length of the shortest m-path between p and
p4 is 2
l If p1 is 1, then p and p2 will no longer be m-adjacent and the length
of the shortest m-path is 3 ( p p1 p2 p4 )
l If p3 is 1 (and p1 is 0), the length of the shortest m-path is 3.
l If both p1 and p3 are 1, the length of the shortest m-path is 4. ( p p1
p2 p3 p4 )
0 p4 0 p4 p3 p4 p3 p4
0 p2 p1 p2 0 p2 p1 p2
p p p p
70
70