Who is the best !

Quick Recap
Issues
Let’s mimic!
 Goal
• How to produce good internal representations of the visual
world to support recognition...
• Detect and classify objects into categories, independently of
pose, scale, illumination, conformation, occlusion and clutter
• How could an artificial vision system learn appropriate
internal representations automatically, the way humans seem
to by simply looking at the world?
• previously in CV: hand-crafted feature extractor
• now in CV: learn suitable representations of images
• Convolution
• Non Linearity (ReLU)
• Pooling or Sub Sampling
• Classification (Fully Connected Layer)
 Extension of traditional Multi-layer
Perceptron, based on 3 ideas

1. Local receive fields

2. Shared weights
3. Spatial / temporal sub-sampling
 Multi-resolution Techniques
• Provide coarse-fine, fine-coarse and scale
invariant decomposition
• lower resolution provides a global view
• higher resolution provides the details
• At coarser resolutions only large, significant
objects => main targets of segmentation

1
 Need for MRA
• Pixel value alone does not give insight to
information content
• Change in intensity is more important than
the value of intensity itself
• Difficult to define a single optimal resolution
for image analysis as objects are of different
sizes in an image

2
 DFT Vs Wavelet
• Fourier basis functions: Complex exponentials
(most “continuous” functions !)
• It fails to provide localization property in both
the domains
• Fourier analysis doesn’t work well on
discontinuous, “bursty” data
– music, video, power, earthquakes,…
 DFT versus Wavelets
• DFT
– Loses time/space (location) coordinate completely
– Analyses the whole signal
– Short pieces lose “frequency” meaning

• Wavelets
– Localized time-frequency (space-scale) analysis
– Short signal pieces also have significance
– Scale = Frequency band
 Wavelet based MRA
• Mathematical algorithm used to describe
signals/images in multiple resolutions
• Allows a perfect reconstruction of the original
image
• Reduces noise (Low pass filtering is involved)
• Ability to perform local analysis
• Optimal for storage

5
 Basis Functions
• Scaling function  Provides information at a
resolution
 (t )   hn (2 t  n)
m

m controls dilation, n controls translation

• Wavelet function  Provides incremental
information OR information BETWEEN two
resolutions
 (t )   g n (2m t  n)
n
 Scaling Function

 j ,n ( x)  2  (2 x  n)
j /2 j
 j, n  Z

n determines the position of j,k(x) along x,

j signifies width or scale, and 2j/2—height or
amplitude.

The shape of j,n(x) change with j, (x) is called

scaling function
 Haar scaling function

Illustration of Scaling function

(Courtesy, Digital Image Processing, Rafael Gonzalez, 3rd Edition)
 Wavelet Functions

Illustration of Wavelet function

(Courtesy, Digital Image Processing, Rafael Gonzalez, 3rd Edition)
 Discrete Wavelet transform
signal
Coefficients hn Coefficients gn

lowpass highpass

filters

Approximation Details
(a) (d)
 Results of wavelet transform:
approximation and details
• Low frequency:
– approximation (a)

• High frequency
– Details (d)

• “Decomposition”
can be performed
iteratively
Levels of decomposition

• Successively decompose
the approximation

• Level 5 decomposition =
a5 + d5 + d4 + d3 + d2 + d1

• No limit to the number of

decompositions
performed