KECE471 Computer Vision
Binary Image Analysis
Chang-Su Kim
Chapter 3, Computer Vision by Shapiro and Stockman
Binary Images
Binary image B
B[r, c]: binary value of the pixel at row r
and column c
B[r, c] = 1 : [r, c] is a foreground (or black) pixel
B

2.7. A linear 53%.th S has; the relationship
1C
m1 = Z Iiklgln m
h:- :-o
hetwemits input x[n] and ita autput lm, when: u] = uEn] [n H 4].
cfw_a Determin: u] when 11:1] 2 Hr: I].
cfw_I1 Detcmnc u] when .1:[n] = '51: 2].
cfw_It 15 S L'IT?
[till Determine.

Chapters 1
7:00 ~ 7:40 PM, 10 MAR 2014
Write your answer as compactly as possible in this question sheet. For example, in a proof, I will give no
mark if the proof is unnecessarily long, although the idea is reasonable. You may wish to use extra paper
for

4.]. Use 1116 Fourier transfonn analys equalinn cfw_4.9) to calculate the Fourier transforms
of:
[a] f altHm _ l) 1-) eZI: - E|
Sketch and label me magnitude of each Fourier transform.
#1. h) be! gm . Elli-1).: . 1), Then the Fourier Irma: Xb'w) 01' in) i

3. N.
Chapters 3
Duration 30min, 24 MAR 2014
Write your answer as compactly as possible in this question sheet. For example, in a proof, I will give no
mark if the proof is unnecessarily long, although the idea is reasonable. You may wish to use extra

KECE471 Computer Vision
Pattern Recognition Concepts
Chang-Su Kim
Chapter 4, Computer Vision by Shapiro and Stockman
Pattern Recognition
Recognition
To know that
is an
apple from our knowledge
Computer vision
To make useful decision based on sensed
im

KECE471 Computer Vision
Introduction
Chang-Su Kim
Some figures are excerpted from the book Computer Vision Algorithms and Applications by R. Szeliski
Course Outline
Pre-requisites
Signals and Systems
High School Math
or Common Sense
Course Homepage

12!. A signal 9:3] with Fouer transfunn Xijwiundergms impulsetrain sampling re
generate
item = Z TiHTJ
PIEWI
where T = 161:. Fer each fth: fellewing sets ef constraints em xii) andim Xijui).
does the 53111ng theorem [see Semi-en 1'. 1.1] gmrantee that I)

- 9.9.2.0, Name-r as;
06:. seal 343 l=.
Final Exam
19:00-21:00, 9 JUN 2014
Write your answer as compactly as possible in this question sheet. For example, in a proof, I will give no
mark if the proof is unnecessarily long, although the idea is reasonable.

Assignment #1: Decision
tree
2012170352
According to the table in the assign ment paper, there are 7 elements to classify
classes: lake_num, bay_num, lid_num, bay_above_bay, lid_rightof_bay,
bay_above_lake, lid_bottomof_image.
First of all, I arranged al