IEEE Transactions on image processing

To be published
Massimo Fierro, Ho-Gun Ha, Yeong-Ho Ha
Presented by Massimo Fierro
Noise reduction based on partial-reerence,
dual-tree comple! "a#elet transorm shrin$age
2012 9 11
2/38
%ummary

Noise in digital images

Noise ampliied by image enhancement

Noise introduced by image enhancement

&a#eles

'iscrete "a#elet transorm

'ual-tree comple! "a#elet tranorm

Proposed noise reduction approach

Traditional methods #s proposed one

E!ploiting the non-enhanced image

'irectional analysis( the 'ual-Tree )omple! &a#elet Transorm

'ata dri#en shrin$age in &a#elet domain

2012 9 11
3/38
Noise in digital images
%ources o noise

%ensing noise

*mpliier +thermal,( Gaussian

'igital errors +'*), comm-,( salt and pepper

Photon shot( Poissonian

'ar$ current( sensing element dependent

.uanti/ation( uniorm distribution

Image enhancement

Enhancement o latent noise

Introduction o ne" noise

2012 9 11
4/38
Noise in digital images
Noise ampliied by image enhancement
Input image Histogram equalization
Noise amplified by image
enhancement
2012 9 11
5/38
Noise in digital images
Noise introduced by image enhancement
0andom %pray %ampling
* 0andom %pray is a collection o points characteri/ed
by a certain spatial distribution
* point in a spray is deined as
"here
j=( f ()cos() , f ()sin())
=rand(0,1) and =rand(0,2)
2012 9 11
6/38
Noise in digital images
0andom %pray, e!amples
f ()= f ()=

2012 9 11
/38
Noise in digital images
0andom %prays Image Enhancement
Three methods e!ploit 0andom %prays(

0andom %pray 0etine! +0%0,

1ocal "hite-patch

%pray *utomatic )olor E2uali/ation +*)E,

1ocal gray-"orld

0*)E

Mi!ture o 0%0 and *)E "ithin a more general

rame"or$
2012 9 11
8/38
Noise in digital images
0%0, *)E, 0*)E
I
n
p
u
t

i
m
a
g
e
R
S
R

e
n
h
a
n
c
e
d
R
A
C
E

e
n
h
a
n
c
e
d
A
C
E

e
n
h
a
n
c
e
d
2012 9 11
9/38
Noise in digital images
Noise and 0andom %pray methods
Noise in 0andom %pray image enhancement methods is
3special4, it depends on(

%pray characteristics +locality, number o points,

*lgorithm parameters

Image contents +local,

2012 9 11
10/38
&a#elets
The "a#elet transorm

The &T is a multi-resolution signal analysis method

The &T re2uires particular unctions called 3"a#elets4

+band-pass, and 3scaling unctions4 +lo"-pass,

The discrete &T re2uires discrete "a#elets and

scaling unctions

The typical '&T implementation re2uires a high-pass

ilter deri#ed rom the "a#elet unction and a lo"-pass
ilter deri#ed rom the scaling unction, the ilters orm a
2uadrature pair
2012 9 11
11/38
&a#elets
&a#elets

&a#elets ha#e a compact

support

The FT o a "a#elet at /ero

re2uency must be 5 6 a#erage
o#er 3time4 is 5 6 unction
oscillates

&a#elets are scaled

along the 3time4 a!is to encode higher re2uencies

%caled "a#elets are translated to encode dierent

parts o the signal
3Me!ican hat4 "a#elet
2012 9 11
12/38
&a#elets
%caling unctions

%caling unctions are lo"-pass unctions

*lias a#eraging unctions

7sed to limit the lo"er re2uency o the signal and stop

the analysis
2012 9 11
13/38
&a#elets
The Haar "a#elet

The simplest orm o "a#elet

!caling f"nction# (t )=
{
1, 0t <1
0, o$%$
(t )=
{
1, 0t1/ 2
1, 1/ 2t <1
0, other%ise
2012 9 11
14/38
&a#elets
The discrete "a#elet trasnorm
&here h8n9 is a high-pass ilter deri#ed rom the "a#elet
unction and g8n9 is a lo"-pass iler deri#ed rom the scaling
unction
1#l- Fre2- %amples
:
85,
n
;<9
=
8
n
;<,
n
;=9
=
>
8
n
;=,
n
;>9
<
?
8
n
;>,
n
9
?@
2012 9 11
15/38
&a#elets
>' '&T

Implemented using separable ilters

2012 9 11
16/38
&a#elets
>' '&T e!ample
2012 9 11
1/38
&a#elets
>' '&T problem( the chec$erboard eect
Typical "a#elets or >' &T
+a, "a#elets in space
domain
+b, ideali/ed support o the
re2uency spectrum
'iagonal content is not
properly distinguished
2012 9 11
18/38
&a#elets
'ual-Tree &a#elet Transorm
Typical "a#elets or >'
dual-tree &T
+a, "a#elets in space
domain
+b, ideali/ed support o the
re2uency spectrum
No chec$erboard pattern
2012 9 11
19/38
&a#elets
'irectional analysis
'ual-Tree )omple! &a#elet Transorm
'T)&T( "hat it is and "hat it does

Ane o many 3tools4 or multi-resolution data analysis

0elati#ely simple and ast implementation

?> coeicients per pi!el +@ directions, 3comple!4,

Filters orm a 2uasi-Hilbert pair 6 energy is easy to

compute

Impulse response energy is isotropic

Enables proper analysis o data directionality

2012 9 11
20/38
Proposed method
'irectional analysis
'ual-Tree )omple! &a#elet Transorm
+Top, impulse response o e#en 'T)&T ilters
+Bottom, impulse response o odd 'T)&T ilters
2012 9 11
21/38
Proposed method
Traditional noise reduction
#s proposed approach
Traditional denoising
Proposed method
'enoise
'enoise
Input img-
+noisy,
Input img-
+noisy,
Auput img-
+noise ree,
Auput img-
+noise ree,
'enoise
'enoise
Enhance
Enhance
Input img-
+noise ree,
Input img-
+noise ree,
Auput img-
+noise ree,
Auput img-
+noise ree,
Enhanced
img- +noisy,
Enhanced
img- +noisy,
&' dealing %ith sensing noise or
noise %ith (no%n distrib"tion$
!ome methods can deal %ith
"n(no%n distrib"tions as %ell$
)eals %ith noise %ith "n(no%n
distrib"tion$ *+ploits data from
the non,enhanced image and
-.! feat"res$
2012 9 11
22/38
Proposed method
Idea and assumptions
Assumptions
Input image is

Noise ree OR

)ontaminated by non-percei#able noise

Idea
I assumptions hold

Input image has clean inormation about +most, edges

E!ploit edge inormation and Human Cisual %ystem

characteristics to reduce noise in enhanced image
2012 9 11
23/38
Proposed method
Flo"chart
2012 9 11
24/38
Proposed method
Flo"chart +contDd,
*nergy meas"re treats e/"ally
e0en,phase str"ct"res 1lines2,
odd,phase str"ct"res 1edges2, and
anything in bet%een 1conto"rs2$
mm( x , , )=
x

is the median 0al"e

is determined per le0el
3rray of coefficients4 indices,
sorted by coefficient magnit"de$
3llo%s "s to determine the dat"m
preferential orientation$
E>
E>
F
-
-
-
E>
E>
F
stdde#
Energy map
Michaelis-Menten
k=0
k=6
E
W

&eight map
i
j , k
I
sort abs
b
j , k
I
c
j , k
I
id!
Non,normali5ed map of
local data directionality
2012 9 11
25/38
Proposed method
Flo"chart( noise reduction
G
b
j , k
E
mi!er
b
j , k
O
W
b
j , k
I
1W
G
F
i
j , k
I

b
j , k
E
!hr"n( coefficients from the
enhanced image
6oefficients from the non,enhanced
image
b
j , k
O
=
{

b
j , k
E
if i
j , k
I
{1,2}
b
j , k
I
if i
j , k
I
{3,4,5,6}
&"tp"t coefficients shr"n(
according to local data directionality
7he same proced"re is
repeated for odd coefficients
2012 9 11
26/38
Proposed method
E!perimental setup

Full-reerence comparison "ith #arying noise

: images rom the %IPI 'atabase +1enna, %plash and

Mandrill,

Gaussian, Poissonian and %pec$le noise

Full reerence comparison "ith Fo#eated N1-means,

Gaussian noise only

: images rom the %IPI 'atabase +1enna, Barbara and

Boats,

Gaussian noise "ith changing #ariance

)omparison measures( %%IM and P%N0

2012 9 11
2/38
Proposed method
E!perimental setup +contHd,

No-reerence image 2uality e#aluation

Carious images

%ubIecti#e measure

Test "ith histogram e2uali/ed images

%ubIecti#e measure

7ser panel test

Carious images

Test noise, sharpness, and preerred image

2012 9 11
28/38
Proposed method
'ierent noise distributions results
Noisy 'enoised
Noise type Image P%N0 %%IM P%N0 %%IM
Gaussian
1enna >J-=: 5-K< :K-J< 5-LK
%plash >J-@< 5-=L :@-:J 5-L:
Mandrill >J-=K 5-J: :=-J< 5-L<
Poissonian
1enna :5-:: 5-<= :K-J< 5-LK
%plash :5-L> 5-<> :@-:J 5-L:
Mandrill :5-?@ 5-L? :=-J< 5-L<
%pec$le
1enna >J-5J 5-KK ::-L@ 5-L=
%plash >J-KK 5-K: ::-<= 5-L=
Mandrill >@-L@ 5-@L ::-<J 5-LJ
2012 9 11
29/38
Proposed method
'ierent noise distributions results
E!ample
Gaussian noise Poissonian noise %pec$le noise
N
o
i
s
y
D
e
n
o
i
s
e
d
2012 9 11
30/38
Proposed method
)omparison "ith Fo#eated N1-means
P%N ratios
?5 >5 :5 =5 K5 @5 J5 <5 L5 ?55
>5
>K
:5
:K
=5
=K
K5
KK
Barbara FN1M
Barbara, Aur
Boats, FN1M
Boats, Aur
1enna, FN1M
1enna, Aur
Gaussian noise sigma
P
%
N
0
2012 9 11
31/38
Proposed method
)omparison "ith Fo#eated N1-means
%%IM scores
?5 >5 :5 =5 K5 @5 J5 <5 L5 ?55
5-K
5-KK
5-@
5-@K
5-J
5-JK
5-<
5-<K
5-L
5-LK
?
Barbara FN1M
Barbara Aur
Boats FN1M
Boats Aur
1enna FN1M
1enna Aur
Gaussian noise sigma
%
%
I
M
2012 9 11
32/38
Proposed method
)omparison "ith Fo#eated N1-means
E!ample
Noise ree image Gaussian noise, sigma M ?55
Fo#eated N1-means
denoised image
Proposed method
2012 9 11
33/38
Proposed method
No-reerence images
E!ample
Non-enhanced
noise-ree image
Enhanced noisy
image +*)E,
Noise reduced image
+NM>,
2012 9 11
34/38
Proposed method
No-reerence images
E!ample +contHd,
Non-enhanced
noise-ree image
Enhanced noisy
image +*)E,
Noise reduced image
+NM:,
2012 9 11
35/38
Proposed method
Histogram e2uali/ed images
E!ample
Input image H- e2uali/ed image N- reduced image +NM>,
2012 9 11
36/38
Proposed method
7ser panel test
2012 9 11
3/38
)onclusions

'ata in the original image can be used to impro#e

output o image enhancement methods

T"o parameters, one determined empirically, one let

or the user to set

Proposed approach sho"s good perormance in both

synthetic and non-synthetic tests as "ell as user
preerence tests

Main dra"bac$s(

Need or t"o input images +non-enhanced, enhanced,

Iterati#e 6 relati#ely slo" processing

2012 9 11
38/38
Future "or$

Impro#e speed o the algorithm by a#oiding iteration

Further study the 'T)&T as a tool or other acti#ities

such as image 2uality measures