Upload
others
View
6
Download
0
Embed Size (px)
Citation preview
Computer Vision I -Algorithms and Applications:Basics of Image Processing
Carsten Rother
Computer Vision I: Basics of Image Processing
28/10/2013
Link to lectures
⢠Slides of Lectures and Exercises will be online:
http://www.inf.tu-Dresden/index.php?node_id=2091&ln=en
(on our webpage > teaching > Computer Vision)
28/10/2013Computer Vision I: Basics of Image Processing 2
Roadmap: Basics Digital Image Processing
⢠Images
⢠Point operators (ch. 3.1)
⢠Filtering: (ch. 3.2, ch 3.3, ch. 3.4) â main focus
⢠Linear filtering
⢠Non-linear filtering
⢠Fourier Transformation (ch. 3.4)
⢠Multi-scale image representation (ch. 3.5)
⢠Edges (ch. 4.2)
⢠Edge detection and linking
⢠Lines (ch. 4.3)
⢠Line detection and vanishing point detection
28/10/2013Computer Vision I: Basics of Image Processing 3
Roadmap: Basics Digital Image Processing
⢠Images
⢠Point operators (ch. 3.1)
⢠Filtering: (ch. 3.2, ch 3.3, ch. 3.4) â main focus
⢠Linear filtering
⢠Non-linear filtering
⢠Fourier Transformation (ch. 3.4)
⢠Multi-scale image representation (ch. 3.5)
⢠Edges (ch. 4.2)
⢠Edge detection and linking
⢠Lines (ch. 4.3)
⢠Line detection and vanishing point detection
28/10/2013Computer Vision I: Basics of Image Processing 4
What is an Image
⢠We can think of the image as a function:ðŒ ð¥, ðŠ , ðŒ: â à â ââ
⢠For every 2D point (pixel) it tells us the amount of light it receives
⢠The size and range of the sensor is limited:ðŒ ð¥, ðŠ , ðŒ: ð, ð à ð, ð â [0,ð]
⢠Colour image is then a vector-valued function:
ðŒ ð¥, ðŠ =
ðŒð ð¥, ðŠ
ðŒðº ð¥, ðŠ
ðŒðµ ð¥, ðŠ
, ðŒ: ð, ð à ð, ð â 0,ð 3
⢠Comment, in most lectures we deal with grey-valued images and extension to colour is âobviousâ
28/10/2013Computer Vision I: Image Formation Process 5
Digital Images
⢠We usually do not work with spatially continuous functions, since our cameras do not sense in this way.
⢠Instead we use (spatially) discrete images
⢠Sample the 2D domain on a regular grid (1D version)
⢠Intensity/color values usually also discrete. Quantize the values per channel (e.g. 8 bit per channel)
28/10/2013Computer Vision I: Basics of Image Processing 7
Comment on Continuous Domain / Range
28/10/2013Computer Vision I: Basics of Image Processing 8
⢠There is a branch of computer vision research (âvariationalmethodsâ), which operates on continuous domain for input images and output results
⢠Continuous domain methods are typically used for physics-based vision: segmentation, optical flow, etc. (we may consider this briefly in later lectures)
⢠Continues domain methods then use different optimization techniques, but still discretize in the end.
⢠In this lecture and other lectures we mainly operate in discrete domain and discrete or continuous range for output results
Roadmap: Basics Digital Image Processing
⢠Images
⢠Point operators (ch. 3.1)
⢠Filtering: (ch. 3.2, ch 3.3, ch. 3.4) â main focus
⢠Linear filtering
⢠Non-linear filtering
⢠Fourier Transformation (ch. 3.4)
⢠Multi-scale image representation (ch. 3.5)
⢠Edges (ch. 4.2)
⢠Edge detection and linking
⢠Lines (ch. 4.3)
⢠Line detection and vanishing point detection
28/10/2013Computer Vision I: Basics of Image Processing 9
Point operators
⢠Point operators work on every pixel independently:ðœ ð¥, ðŠ = â ðŒ ð¥, ðŠ
⢠Examples for h:
⢠Control contrast and brightness; â(ð§) = ðð§ + ð
28/10/2013Computer Vision I: Basics of Image Processing 10
Contrast enhancedoriginal
Example for Point operators: Gamma correction
28/10/2013Computer Vision I: Basics of Image Processing 11
Intensity range: [0,1]
In (old) CRT monitorsAn intensity ð§ was perceived as: â ð§ = ð§ðŸ (ðŸ = 2.2 typically)
Inside cameras:
â ð§ = ð§1/ðŸ where often ðŸ = 2.2 (called gamma correction)
Important: for many tasks in vision, e.g. estimation of a normal, it is good to run â ð§ = ð§ðŸ to get to a linear function
Today: even with âlinear mappingâ monitors, it is good to keep the gamma corrected image. Since human vision is more sensitive in dark areas.
Example for Point Operators: Alpha Matting
28/10/2013Computer Vision I: Basics of Image Processing 12
ð¶ ð¥, ðŠ = ðŒ ð¥, ðŠ ð¹ ð¥, ðŠ + 1 â ðŒ ð¥, ðŠ ðµ(ð¥, ðŠ)
Background ðµ
Composite ð¶Matte ðŒ
(amount of transparency)
Foreground ð¹
Roadmap: Basics Digital Image Processing
⢠Images
⢠Point operators (ch. 3.1)
⢠Filtering: (ch. 3.2, ch 3.3, ch. 3.4) â main focus
⢠Linear filtering
⢠Non-linear filtering
⢠Fourier Transformation (ch. 3.4)
⢠Multi-scale image representation (ch. 3.5)
⢠Edges (ch. 4.2)
⢠Edge detection and linking
⢠Lines (ch 4.3)
⢠Line detection and vanishing point detection
28/10/2013Computer Vision I: Basics of Image Processing 13
Linear Filters / Operators
⢠Properties:
⢠Homogeneity: ð[ðð] = ðð[ð]
⢠Additivity: ð[ð + ð] = ð[ð] + ð[ð]
⢠Superposition: ð[ðð + ðð] = ðð[ð] + ðð[ð]
⢠Example:
⢠Convolution
⢠Matrix-Vector operations
28/10/2013Computer Vision I: Basics of Image Processing 14
Convolution
⢠Replace each pixel by a linear combination of its neighbours and itself.
⢠2D convolution (discrete)
ð = ð â â
28/10/2013Computer Vision I: Basics of Image Processing 15
ð ð¥, ðŠ = ð,ð ð ð¥ â ð, ðŠ â ð â ð, ð = ð,ð ð ð, ð â ð¥ â ð, ðŠ â ð
ð ð¥, ðŠ â ð¥, ðŠ g ð¥, ðŠ
Centred at 0,0
Convolution
28/10/2013Computer Vision I: Basics of Image Processing 16
⢠Linear â â ð0 + ð1 = â â ð0 + â â ð1
⢠Associative ð â ð â â = ð â ð â â
⢠Commutative ð â â = â â ð
⢠Shift-Invariant ð ð¥, ðŠ = ð ð¥ + ð, ðŠ + ð â â â ð ð¥, ðŠ =(â â ð)(ð¥ + ð, ðŠ + ð)
(behaves everywhere the same)
⢠Can be written in Matrix form: g = H f
⢠Correlation (not mirrored filter):ð ð¥, ðŠ =
ð,ð
ð ð¥ + ð, ðŠ + ð â ð, ð
Examples
28/10/2013Computer Vision I: Basics of Image Processing 17
⢠Impulse function: ð = ð â ð¿
⢠Box Filter:
x
yð¿
Application: Noise removal
⢠Noise is what we are not interested in:sensor noise (Gaussian, shot noise), quantisation artefacts, light fluctuation, etc.
⢠Typical assumption is that the noise is not correlated between pixels
⢠Basic Idea:
neighbouring pixel contain information about intensity
28/10/2013Computer Vision: Algorithms and Applications --
- Carsten Rother18
The box filter does noise removal
⢠Box filter takes the mean in a neighbourhood
28/10/2013Computer Vision I: Basics of Image Processing 20
Filtered Image
Image Pixel-independent Gaussian noise added
Noise
Derivation of the Box Filter
⢠ðŠð is true gray value (color)
⢠ð¥ð observed gray value (color)
⢠Noise model: Gaussian noise:
ð ð¥ð ðŠð) = ð ð¥ð; ðŠð , ð ~ exp[âð¥ðâðŠð
2
2ð2]
28/10/2013Computer Vision I: Basics of Image Processing 21
ðŠð ð¥ð
Derivation of Box Filter
28/10/2013Computer Vision I: Basics of Image Processing 22
Further assumption: independent noise
Find the most likely solution the true signal ðŠMaximum-Likelihood principle (probability maximization):
ð(ð¥) is a constant (drop it out), assume (for now) uniform prior ð(ðŠ). So we get:
ð ð¥ ðŠ) ~ exp[âð¥ðâðŠð
2
2ð2]
ð
ðŠâ = ðððððð¥ðŠ ð ðŠ ð¥) = ðððððð¥ðŠð ðŠ ð ð¥ ðŠ
ð(ð¥)
the solution is trivial: ðŠð = ð¥ð for all ð
additional assumptions about the signal ð are necessary !!!
ð ðŠ ð¥) = ð ð¥ ðŠ ⌠exp[âð¥ð â ðŠð
2
2ð2]
ð
posterior
likelihoodprior
Derivation of Box Filter
28/10/2013Computer Vision I: Basics of Image Processing 23
Assumption: not uniform prior ð ðŠ but âŠin a small vicinity the âtrueâ signal is nearly constant
Maximum-a-posteriori:
ð ðŠ ð¥) ⌠exp[âð¥ðâ² â ðŠðâ²
2
2ð2]
ðŠðâ = ðððððð¥ðŠð exp[â
ð¥ðâ² â ðŠð2
2ð2]
ðŠðâ = ðððððððŠð ð¥ðâ² â ðŠð
2
Only one ðŠð in a window ð(ð)
ðFor one pixel ð :
take neg. logarithm:
Derivation of Box Filter
28/10/2013Computer Vision I: Basics of Image Processing 24
ðŠðâ = ðððððððŠð ð¥ðâ² â ðŠð
2
How to do the minimization:
Take derivative and set to 0:
(the average)ðŠðâ
Box filter optimal under pixel-independent Gaussian Noise and constant signal in window
ð¹ ðŠð = ð¥ðâ² â ðŠð2
Gaussian (Smoothing) Filters
⢠Nearby pixels are weighted more than distant pixels
⢠Isotropic Gaussian (rotational symmetric)
28/10/2013Computer Vision I: Basics of Image Processing 25
Gaussian Filter
28/10/2013Computer Vision I: Basics of Image Processing 26
Input: constant grey-value image
More noise needs larger sigma
Gaussian for Sharpening
28/10/2013Computer Vision I: Basics of Image Processing 28
Sharpen an image by amplifying what is smoothing removes:ð = ð + ðŸ (ð â âððð¢ð â ð)
How to compute convolution efficiently?
⢠Separable filters (next)
⢠Fourier transformation (see later)
⢠Integral Image trick (see exercise)
28/10/2013Computer Vision I: Basics of Image Processing 29
Important for later (integral Image trick):The Box filter (mean filter) can be computed in ð(ð). Naive implemettaioin would be ð(ðð€)where ð€ is the number of elements in box filter
Separable filters
28/10/2013Computer Vision I: Basics of Image Processing 30
For some filters we have: ð â â = ð â (âð¥ â âðŠ)
Where âð¥, âðŠ are 1D filters.
Example Box filter:
Now we can do two 1D convolutions: ð â â = ð â âð¥ â âðŠ = (ð â âð¥) â âðŠ
Naïve implementation for 3x3 filter: 9N operations versus 3N+3N operations
âð¥ â âðŠâð¥
âðŠ
Can any filter be made separable?
28/10/2013Computer Vision I: Basics of Image Processing 31
Apply SVD to the kernel matrix:
If all ðð are 0 (apart from ð0) then it is separable.
Note:
âð¥ â âðŠâð¥
âð¥âðŠâðŠ
Roadmap: Basics Digital Image Processing
⢠Images
⢠Point operators (ch. 3.1)
⢠Filtering: (ch. 3.2, ch 3.3, ch. 3.4) â main focus
⢠Linear filtering
⢠Non-linear filtering
⢠Fourier Transformation (ch, 3.4)
⢠Multi-scale image representation (ch. 3.5)
⢠Edges (ch. 4.2)
⢠Edge detection and linking
⢠Lines (ch. 4.3)
⢠Line detection and vanishing point detection
28/10/2013Computer Vision I: Basics of Image Processing 33
Non-linear filters
⢠There are many different non-linear filters. We look at a selection:
⢠Median filter
⢠Bilateral filter (Guided Filter)
⢠Morphological operations
28/10/2013Computer Vision I: Basics of Image Processing 34
Shot noise (Salt and Pepper Noise) - motivation
28/10/2013Computer Vision I: Basics of Image Processing 35
Original + shot noise
Gaussian filtered
Medianfiltered
Another example
28/10/2013Computer Vision I: Basics of Image Processing 36
Original
Mean Median
Noised
Median Filter
28/10/2013Computer Vision I: Basics of Image Processing 37
Replace each pixel with the median in a neighbourhood:
Used a lot for post processing of outputs (e.g. optical flow)
5 6 5
4 20 5
4 6 5
5 6 5
4 5 5
4 6 5
⢠No strong smoothing effect since values are not averaged⢠Very good to remove outliers (shot noise)
median
Median filter: order the values and take the middle one
Median Filter: Derivation
Reminder: for Gaussian noise we did solve the following ML problem
28/10/2013Computer Vision I: Basics of Image Processing 38
ðŠðâ = ðððððð¥ðŠð exp[â
ð¥ðâ² â ðŠð2
2ð2] = ðððððððŠð ð¥ðâ² â ðŠð = 1/ ð ð¥ð
Does not look like a Gaussian distribution
meanmedian
ðŠðâ = ðððððð¥ðŠð exp[â
ð¥ðâ² â ðŠð2ð2
] = ðððððððŠð |ð¥ðâ² â ðŠð| = ðððððð (ð ð )
2
For Median we solve the following problem:
Due to absolute norm it is more robust
ð ðŠ ð¥)
Median Filter Derivation
28/10/2013Computer Vision I: Basics of Image Processing 39
minimize the following: function:
Problem: not differentiable ,good news: it is convex
ð¹ ðŠð = |ð¥ðâ² â ðŠð|
Optimal solution is the mean of all values
Motivation â Bilateral Filter
28/10/2013Computer Vision I: Basics of Image Processing 40
Original + Gaussian noise Gaussian filtered Bilateral filtered
Bilateral Filter â in pictures
28/10/2013Computer Vision I: Basics of Image Processing 41
Bilateral Filter weights Output
Centre pixel
Gaussian Filter weights
Noisy input
Output (sketched)
Bilateral Filter â in equations
28/10/2013Computer Vision I: Basics of Image Processing 42
Filters looks at: a) distance of surrounding pixels (as Gaussian)b) Intensity of surrounding pixels
Problem: computation is slow ð ðð€ ; approximations can be done in ð(ð)Comment: Guided filter (see later) is similar and can be computed exactly in ð(ð)
See a tutorial on: http://people.csail.mit.edu/sparis/bf_course/
Similar to Gaussian filter Consider intensity
Linear combination
Application: Bilteral Filter
28/10/2013Computer Vision I: Basics of Image Processing 43
Cartoonization
HDR compression(Tone mapping)
Joint Bilteral Filter
28/10/2013Computer Vision I: Basics of Image Processing 44
Similar to Gaussian Consider intensity
f is the input image â which is processed
f is a guidance image â where we look for pixel similarity
~ ~
~
Application: combine Flash and No-Flash
28/10/2013Computer Vision I: Basics of Image Processing 45
[Petschnigg et al. Siggraph â04]
input image ð guidance image ð
We donât care about absolute colors
~ Joint Bilateral Filter
~ ~
Application: Cost Volume Filtering
28/10/2013Computer Vision I: Basics of Image Processing 46
Goal
Given z; derive binary x:
Algorithm to minimization: ðâ = ððððððð¥ ðž(ð)
ð = ð , ðº, ðµ ð x= 0,1 ð
Reminder from first Lecture: Interactive Segmentation
Model: Energy function ð¬ ð = ð ðð ð¥ð + ð,ð ððð(ð¥ð , ð¥ð)Unary terms Pairwise terms
Reminder: Unary term
28/10/2013Computer Vision I: Introduction 47
Optimum with unary terms onlyDark means likely
backgroundDark means likely
foreground
ðð(ð¥ð = 0)ðð(ð¥ð = 1)
New query image ð§ð
Cost Volumne for Binary Segmenation
28/10/2013Computer Vision I: Basics of Image Processing 48
ðð(ð¥ð = 0)
ðð(ð¥ð = 1)
Image (x,y)
Lab
el S
pac
e (h
ere
2)
For 2 Labels, we can also look at the ratio Image:ðŒð = ðð(ð¥ð = 1) / ðð(ð¥ð = 0)
Application: Cost Volumne Filtering
28/10/2013Computer Vision I: Basics of Image Processing 49
An alternative to energy minimization
Filtered cost volume
Energy minimization
Guidance Input Image ð(user brush strokes)
Winner takes all Result
Ratio Cost-volume is the Input Image ð
~
[C. Rhemann, A. Hosni, M. Bleyer, C. Rother, and M. Gelautz, Fast Cost-Volume Filtering for Visual Correspondence and Beyond, CVPR 11]
Application: Cost volume filtering for dense Stereo
28/10/2013Computer Vision I: Basics of Image Processing 50
Stereo result(winner takes all)
20-label cost volume ð
Box filter
True solution
Bilateral filter
Guided filter
Guidance Image ð
[C. Rhemann, A. Hosni, M. Bleyer, C. Rother, and M. Gelautz, Fast Cost-Volume Filtering for Visual Correspondence and Beyond, CVPR 11]
Stereo Image pair
~
Application: Cost volume filtering for dense Stereo
28/10/2013Computer Vision I: Basics of Image Processing 51
Very competative in terms of results for a fast methods(Middleburry Ranking)
[C. Rhemann, A. Hosni, M. Bleyer, C. Rother, and M. Gelautz, Fast Cost-Volume Filtering for Visual Correspondence and Beyond, CVPR 11]
Recent Trend: Guided Filter
28/10/2013Computer Vision I: Basics of Image Processing 52
Diferent pixel coordinates ð, ðlinear combination of image ð
Size of window ðð is fixed, e.g. 7x7.Sum over all windows ððwhich contain pixels: ð and ð
âDifferent to biltarel filter since a sum over small windowsâ
ðð7x7 pixels
ð
[He, Sun ECCV â10]
Recent Trend: Guided Filter
28/10/2013Computer Vision I: Basics of Image Processing 53
Diferent pixel cooridinates ð, ðlinear combination of image ð
A window ððwhich is centred exactly on the edge
Size of window ðð is fixed, e.g. 7x7.Sum over all windows ððwhich contain pixels: ð and ð
âDifferent to biltarel filter since a sum over small windowsâ
Case 1: ðŒð , ðŒð on the same side: ðð â ðð (ðð â ðð) have the same sign. Then ððð large
Case 2: ðŒð , ðŒð on the same side: ðð â ðð (ðð â ðð) have different sign. Then ððð small
variance in window ðð
mean in window ðð
ðð~
ðð~ ðð
~
~ ~
~~
Bilteral Filter and Guided Filter behave very similiarly
28/10/2013Computer Vision I: Basics of Image Processing 54
Bilteral Filter and Guided Filter behave very similiarly
28/10/2013Computer Vision I: Basics of Image Processing 55
Guided Filter Bilteral Filter
Guided Filter: Can be computed in O(N)
28/10/2013Computer Vision I: Basics of Image Processing 56
Can also be written as: (see paper for detail)
[He, Sun ECCV â10]
Integral Image trick
Applications: Matting
28/10/2013Computer Vision I: Basics of Image Processing 57
Guideanace Image ð~ Input Image ð Output Image ð
[He, Sun ECCV â10]
Morphological operations
28/10/2013Computer Vision I: Basics of Image Processing 58
⢠Perform convolution with a âstructural elementâ: binary mask (e.g. circle or square)
⢠Then perform thresholding to recover a binary image
black is 1
white is 1
Opening and Closing Operations
28/10/2013Computer Vision I: Basics of Image Processing 59
⢠Opening operation: ððððð¡ð ððððð ð, ð , ð
⢠Closing opertiaon: ððððð ððððð¡ð ð, ð , ð
closingopeningInput image
erode and dilate are not commutative
Application: Denoise Binary Segmentation
28/10/2013Computer Vision I: Basics of Image Processing 60
Note: nothing is commutative
Closing â than opening
Opening â than closing
Input Segmentation
Application: Binary Segmentation
28/10/2013Computer Vision I: Basics of Image Processing 61
[Criminisi, Sharp, Blake, GeoS: Geodesic Image Segmentation, ECCV 08]
Result: Edge preservingOpening and closing
Extend morphological operations to deal with cost volume and make it edge preserving (same idea as in joint bilateral filter)
Again: An alternative to energy minization
Ratio Cost-volume is the Input Image ð
Energy minimization
Energy minimization
ours
Related nonlinear operations on binary images
28/10/2013Computer Vision I: Basics of Image Processing 62
Distance transform
Binary Image
Skeleton
Binary Input Image Connected components
Roadmap: Basics Digital Image Processing
⢠Images
⢠Point operators (Ch. 3.1)
⢠Filtering: (ch. 3.2, ch 3.3, ch. 3.4) â main focus
⢠Linear filtering
⢠Non-linear filtering
⢠Fourier Transformation (ch. 3.4)
⢠Multi-scale image representation (ch. 3.5)
⢠Edges (Ch. 4.2)
⢠Edge detection and linking
⢠Lines (Ch 4.3)
⢠Line detection and vanishing point detection
28/10/2013Computer Vision I: Basics of Image Processing 63
Fourier Transformation ⊠to analyse Filters
28/10/2013Computer Vision I: Basics of Image Processing 64
Complex valued, continuous sinusoid for different frequency ð
ð ð¥ = â ð¥ â ð ð¥ = ðŽ ðð(ð€ð¥+ð) =ðŽ [ cos(ð ð¥ + ð) + ð ð ðð(ð ð¥ + ð) ]
Amplitude phase
Simply try all possible ð and record ðŽ, ð . The Fourier transformation of â(ð¥) is then:ð» ð = â ð¥ = ðŽ ððð = ðŽ (cos ð + ð sin ð )
Filter/Image
How does a sinusoid influences a given filter/Image â(ð¥) ?
Output signal
The output is also a sinusoid
Fourier Transform
28/10/2013Computer Vision I: Basics of Image Processing 65
Low-pass filter:
Band-pass filter:
Fourier Pair: Computation
28/10/2013Computer Vision I: Basics of Image Processing 66
â ð¥ â ð»(ð)
ð» ð = ââ
â
â ð¥ ðâððð¥ ðð¥ â ð¥ = ââ
â
ð» ð ðððð¥ ðÏ
ð» ð =1
ð
ð¥=0
ðâ1
â ð¥ ðâð2ððð¥ð
Discrete Fourier transformationN is the range of signal (image region)
â(ð¥) =1
ð
ð=0
ðâ1
ð» ð ðð2ððð¥ð
con
tin
uo
us
dis
cret
e
Inverse Discrete Fourier transformation
Discrete Inverse Fourier Transform: Visualization
28/10/2013Computer Vision I: Basics of Image Processing 67
h(x) =1
ð
ð=0
ðâ1
ð» ð ðð2ððð¥ð
For this signal a reconstruction with sinus function only is sufficient
Discrete Inverse Fourier Transform: Visualization
28/10/2013Computer Vision I: Basics of Image Processing 68
h(x) =1
ð
ð=0
ðâ1
ð» ð ðð2ððð¥ð
[from wikipedia]
Example: Discrete 2D
28/10/2013Computer Vision I: Basics of Image Processing 69
Original Amplitude Phase
Example: Discrete 2D
28/10/2013Computer Vision I: Basics of Image Processing 70
Original Amplitude Phase
Fast Fourier Transformation
28/10/2013Computer Vision I: Basics of Image Processing 72
⢠Important property: (ð ð¥ â â ð¥ ) = ðº(ð) ð»(ð)
⢠Fast computation:
ð ð¥ , â(ð¥)O(Nw)
convolutionð ð¥ â â(ð¥)
ð¹ ð ,ð»(ð)
O(N logN)fourier transform
O(N) multiplication
O(N logN)inverse fourier transform
ð¹ ð ð»(ð)
O(N log N)
Roadmap: Basics Digital Image Processing
⢠Images
⢠Point operators (Ch. 3.1)
⢠Filtering: (ch. 3.2, ch 3.3, ch. 3.4) â main focus
⢠Linear filtering
⢠Non-linear filtering
⢠Fourier Transformation (ch. 3.4)
⢠Multi-scale image representation (ch. 3.5)
⢠Edges (Ch. 4.2)
⢠Edge detection and linking
⢠Lines (Ch 4.3)
⢠Line detection and vanishing point detection
28/10/2013Computer Vision I: Basics of Image Processing 73
Reading for next class
This lecture:
⢠Chapter 3 (in particular: 3.2, 3.3) - Basics of Digital Image Processing
Next lecture:
⢠Chapter 3.5: multi-scale representation
⢠Chapter 4.2 and 4.3 - Edge and Line detection
⢠Chapter 2 (in particular: 2.1, 2.2) â Image formation process
⢠And a bit of Hartley and Zisserman â chapter 2
28/10/2013Computer Vision I: Introduction 74