SUBJECT:

Digital Image Processing

Subject Code: BEC613C
SEM.: VI

MODULE – 4

Frequency Domain: Basics of Filtering in the Frequency Domain, Image

Smoothing and Image Sharpening Using Frequency Domain Filters.
Color Image Processing: Color Fundamentals, Color Models, Pseudo-
color Image Processing.

[Text 1: Chapter 4: Sections 4.7 to 4.9 and Chapter 6: Sections 6.1 to

6.3]

Dr Suresh D, Professor, RNSIT

 Enhancement in Frequency Domain

 T he freq uency d omain r efer s t o t he plane o f t he t wo dimens io na l

discr et e Four ier transfo r m o f an image.
 Funct io ns t hat ar e not per io dic, but who se ar ea under t he cur ve is
finit e, can be expr essed as t he int egr al o f sines and/or co sines
mu lt ip lied by a weight ing funct io n ( Fo ur ier tr ansfor m) .
 T he purpo se o f t he Four ier t r ansform is t o r epr esent a signa l as a
linear co mbinat io n o f sinuso idal signals o f var io us fr equencies.

the sum of t he top fo ur

funct io ns

Introduction to the Fourier Transform and the Frequency Domain

1-D DFT and its Inverse

M 1
1
F (u) 
M
 f ( x)e
x 0
 j 2ux / M
for u  0,1,2,..., M  1

M 1
f ( x)   F (u )e j 2ux / M for x  0,1,2,..., M  1
u 0

F(u) can be expressed in polar coordinates:

F (u )  F (u ) e j (u )

 
1
where F (u )  R (u )  I (u )
2 2 2 (magnitude or spectrum)
 I (u ) 
 (u )  tan 1   (phase angle or phase spectrum)
 R(u ) 
◦ R(u): the real part of F(u)
◦ I(u): the imaginary part of F(u)
 Power spectrum:

P(u )  F (u )  R 2 (u )  I 2 (u),
2
 Discrete space and discrete frequency: The two dimensional Discrete Fourier
Transform (2-D DFT)
If f ( x, y) is an M  N array, such as that obtained by sampling a continuous function of two
dimensions at dimensions M and N on a rectangular grid, then its two dimensional Discrete
Fourier transform (DFT) is the array given by

M 1 N 1
1
F (u, v) 
MN
 f ( x, y)e
x 0 y 0
 j 2 ( ux / M  vy / N )

for u  0,1,2,..., M  1, v  0,1,2,..., N  1

and the inverse DFT (IDFT) is
M 1 N 1
f ( x, y )   F (u, v)e j 2 (ux / M vy / N )
u 0 v 0

for x  0,1,2,..., M  1, y  0,1,2,..., N  1

u, v : the transform or frequency variables

x, y : the spatial or image variables

 We define the Fourier spectrum, phase angle, and power spectrum as follows:

 
1
F (u, v)  R (u, v)  I (u, v)
2 2 2 ( spectrum)
 I (u, v) 
 (u, v)  tan 1   (phase angle)
 R (u , v ) 
P(u,v)  F (u, v)  R 2 (u, v)  I 2 (u, v) (power spectrum)
2
◦ R(u,v): the real part of F(u,v)

◦ I(u,v): the imaginary part of F(u,v)

Properties of the 2-D DFT

Most of them are straightforward extensions of the properties of the 1-D Fourier
Transform. Advise any introductory book on Image Processing.
1. Completeness

The discrete Fourier transform is an invertible, linear transformation with C denoting the set of
complex numbers. In other words, for any N > 0, an N- dimensional complex vector has a DFT
and an IDFT which are in turn N-dimensional complex vectors.

2. DC component (Average)
M 1 N 1
1
F (0,0) 
MN
 f ( x, y)
x 0 y 0

F(0,0) is the average of f(x,y)

3. Orthogonality

The vectors form an orthogonal basis over the set of N dimensional complex vectors:

where is the Kronecker delta. This orthogonality condition can be used to derive the
formula for the IDFT from the definition of the DFT, and is equivalent to the unitarity property
below.

4. Relationship between samples in the spatial and frequency domains

1 1
u  v 
M x N y
5. If f(x,y) is real, F(u,v) is conjugate symmetric

F (u , v)  F * (u ,v)

F (u, v)  F (u,v)  spectrum is symmetric

6. The Plancherel theorem and Parseval's theorem
If Xk and Yk are th DFTs of xn and yn respectively then the Plancherel theorem states:
where the star denotes complex conjugation. Parseval's theorem is a special case of the
Plancherel theorem and states:

These theorems are also equivalent to the unitary condition below.

7. Periodicity
If the expression that defines the DFT is evaluated for all integers k instead of just for
, then the resulting infinite sequence is a periodic extension of
the DFT, periodic with period N.

F (u, v)  F (u  M , v)  F (u, v  N )
 F (u  M , v  N )
Similarly IDFT formula leads to a periodic extension.

f ( x, y)  f ( x  M , y)  f ( x, y  N )
 f (x  M , y  N )

8. Translation
f ( x, y) e j 2 (u0 x / M v0 y / N )  F (u  u0 , v  v0 )
9. Distributivity
 f1 ( x, y)  f 2 ( x, y)   f1 ( x, y)   f 2 ( x, y)
10. Scaling
1
af ( x, y )  aF (u, v), f (ax, by)  F (u / a, v / b)
ab
11. Rotation
 x  r cos , y  r sin  , u  w cos , v  w sin 
f ( x, y )  f ( r ,  ), F (u , v)  F ( w,  )
f (r ,   0 )  F ( w,    0 )
12. Separability

M 1
1 1 N 1
F (u, v) 
M
e
x 0
 j 2ux / M

N y 0
f ( x, y )e  j 2vy / N

M 1
1

M
 F ( x, v )e
x 0
 j 2ux / M

Where
N 1
1
F ( x, v ) 
N
 f ( x, y ) e
y 0
 j 2vy / N

13. The convolution and correlation

M 1 N 1
1
f ( x, y ) * h( x, y ) 
MN
 f (m, n)h( x  m, y  n)
m 0 n 0

M 1 N 1
1
f ( x, y)  h( x, y) 
MN
 f
m 0 n 0
*
(m, n)h( x  m, y  n)

f ( x, y )  h( x, y )  F * (u, v) H (u, v)
f * ( x, y )h( x, y )  F (u, v)  H (u, v)

IMAGE ENHANCEMENT IN FREQUENCY DOMAIN

A Common practice is to multiply the input image function by

(  1) x y
to shift the origin to
(M/2, N/2).

 
 f ( x, y) e j 2 (u0 x / M v0 y / N )  F (u  u0 , v  v0 )
Let : u0  M / 2, v0  N / 2
 j 2 ( x / M  y / N ) 
M N
 f ( x, y )e 2 2
  F (u  M / 2, v  N / 2)
 
 
 f ( x, y )e j ( x  y )  F (u  M / 2, v  N / 2)
 f ( x, y )(1)   F (u  M / 2, v  N / 2)
( x y )

Filtering in the Frequency Domain

Filtering is computationally efficient and is more intuitive in the frequency domain.

Some basic properties of the frequency domain

• low frequency : slowly varying components of image
• high frequency : faster gray level changes such as noise and edges of objects

• Basic Steps of Filtering in the Frequency domain

– Multiply the input image by

(  1) x y
to center the transform
– Compute F(u,v), the DFT of the above image
– Multiply F(u,v) by a filter function H(u,v)
– Compute the inverse DFT of the result
– Obtain the real part of the above result

– Multiply by
(1) x y
SMOOTHING FREQUENCY-DOMAIN FILTERS
– Regions of relatively uniform gray values in an image contribute to low-frequency content
of its Fourier transform.
– Image can be smoothed in the Frequency domain by attenuating the high-frequency content
of its Fourier transform.
– This would be a low-pass filter!!!! Which would preserves low frequency component

IDEAL LOW-PASS FILTER:

Cuts off all high-frequency components at a distance greater than a certain distance from
origin (cutoff frequency).
H (u,v) = 1, if D(u,v) ≤ D0
0, if D(u,v) > D0
Where D0 is a positive constant, is the cut-off frequency and D(u,v) is the distance
between a point (u,v) in the frequency domain and the center of the frequency rectangle; that
is

D(u,v) = [(u-M/2)2 + (v-N/2)2] 1/2

Where as P and Q are the padded sizes from the basic equations
VISUALIZATION: IDEAL LOW PASS FILTER:

Fig: Ideal low pass filter 3-D view and 2-D view and line graph.
Property of Ideal LPF
– ideal
– can be implemented in a computer
– nonphysical = non-actual = non-real
The Set of standard cutoff frequency
M 1 N 1
PT   P(u, v)
u 0 v 0

 
 %  100 P(u, v) / PT 
 u v 
EFFECT OF DIFFERENT CUTOFF FREQUENCIES:
Fig.(a) below is a test pattern of size 688x688 pixels, and (b) its Fourier spectrum. The spectrum
is double the image size due to padding but is shown in half size so that it fits in the page. The
superimposed circles have radii equal to 10, 30, 60, 160 and 460 with respect to the full- size
spectrum image. These radii enclose 87.0, 93.1, 95.7, 97.8 and 99.2% of the padded image
power respectively.

Fig: (a) Test pattern of size 688x688 pixels (b) its Fourier spectrum

Ringing Effect

Fig: (a) original image, (b)-(f) Results of filtering using ILPFs with cut-off frequencies set at
radii values 5,15, 30, 80 and 230 as shown in fig. The power removed by these filters was 8,
5.4, 3.6, 2 and 0.5% of the total, respectively.
As the cutoff frequency decreases,
 image becomes more blurred
 Noise becomes increases
 Analogous to larger spatial filter sizes
The severe blurring in this image is a clear indication that most of the sharp detail
information in the picture is contained in the 13% power removed by the filter. As the filter
radius is increases less and less power is removed, resulting in less blurring. Fig. (c ) through
(e) are characterized by “ringing” , which becomes finer in texture as the amount of high
frequency content removed decreases.
WHY IS THERE RINGING?
Ideal low-pass filter function is a rectangular function
The inverse Fourier transform of a rectangular function is a sinc function.

Fig. Spatial representation of ILPFs of order 1 and 20 and corresponding intensit y

profiles through the center of the filters( the size of all cases is 1000x1000 and the cutoff
frequency is 5), observe how ringing increases as a function of filter order.

BUTTERWORTH LOW-PASS FILTER:

Transfer funtion of a Butterworth lowpass filter (BLPF) of order n, and with cutoff
frequency at a distance D0 from the origin, is defined as
 -

Transfer function does not have sharp discontinuity establishing cutoff between passed
and filtered frequencies.
Cut off frequency D0 defines point at which H(u,v) = 0.5

Fig. (a) perspective plot of a Butterworth lowpass-filter transfer function. (b) Filter
displayed as an image. (c)Filter radial cross sections of order 1 through 4.
Unlike the ILPF, the BLPF transfer function does not have a sharp discontinuity that
gives a clear cutoff between passed and filtered frequencies.
BUTTERWORTH LOW-PASS FILTERS OF DIFFEREN T FREQUENCIES:

Fig. (a) Original image.(b)-(f) Results of filtering using BLPFs of order 2, with
various cutoff frequencies at the radii D0= 5, 15, 30, 80, 230
 Fig. shows the results of applying the BLPF of eq. to fig.(a), with n=2 and D0 equal to
the five radii in fig.(b) for the ILPF, we note here a smooth transition in blurring as a function
of increasing cutoff frequency. Moreover, no ringing is visible in any of the images
processed with this particular BLPF, a fact attributed to the filter‟s smooth transition
between low and high frequencies.
A BLPF of order 1 has no ringing in the spatial domain. Ringing generally is
imperceptible in filters of order 2, but can become significant in filters of higher order.
[Link] a comparison between the spatial representation of BLPFs of various
orders (using a cutoff frequency of 5 in all cases). Shown also is the intensity profile along a
horizontal scan line through the center of each filter. The filter of order 2 does show mild
ringing and small negative values, but they certainly are less pronounced than in the ILPF. A
butter worth filter of order 20 exhibits characteristics similar to those of the ILPF (in the
limit, both filters are identical).

Fig.2.2.7 (a)-(d) Spatial representation of BLPFs of order 1, 2, 5 and 20 and

corresponding intensity profiles through the center of the filters (the size in all cases is 1000 x
1000 and the cutoff frequency is 5) Observe how ringing increases as a function of filter
order.
GAUSSIAN LOWPASS FILTERS:
The form of these filters in two dimensions is given by
( u ,v ) / 2 2
H (u, v)  e  D
2

where
, is the distance from
the origin in the frequency plane. The parameter σ measures the spread or dispersion
of the Gaussian curve. Larger the value of σ, larger the cutoff frequency and milder
the filtering.
 H(u,v) is the transfer function is smooth, like Butterworth filter.
 Gaussian in frequency domain remains a Gaussian in spatial domain
 Advantage: No ringing artifacts.

If (  D0 )
,
Where D0 is the cutoff frequency. When D(u,v) = D0, the GLPF is down to 0.607 of its
maximum value. This means that a spatial Gaussian filter, obtained by computing the IDFT
of above equation., will have no ringing. Fig..shows a perspective plot, image display and
radial cross sections of a GLPF function.

Fig. (a) Perspective plot of a GLPF transfer function. (b) Filter displayed as an image. (c).
Filter radial cross sections for various values of D0

Fig.(a) Original image. (b)-(f) Results of filtering using GLPFs with cutoff
frequencies at different radii
Applications
1. character recognition

Although humans fill these gaps visually without difficulty, A machine recognition system has real
difficulties reading Broken characters. GLPF fills the gap.

2. Printing and Publishing Industry

Fig. (a) Original image (784x 732 pixels). (b) Result of filtering using a GLPF with
D0 = 100. (c) Result of filtering using a GLPF with D0 = 80. Note the reduction in fine skin
lines in the magnified sections in (b) and (c).
Fig. shows an application of lowpass filtering for producing a smoother, softer- looking result
from a sharp original. For human faces, the typical objective is to reduce the sharpness of fine
skin lines and small blemished.

IMAGE SHARPENING USING FREQUENCY DOMAIN FILTERS:

Edges and other abrupt changes in intensities are associated with high-frequency components.
Image sharpening can be achieved in the frequency domain by high pass filtering, which
 attenuates the low-frequency components without disturbing high- frequency information in
the Fourier transform.
The filter function H(u,v) are understood to be discrete functions of size PxQ; that is the discrete
frequency variables are in the range u = 0,1,2,…….P-1 and v = 0,1,2,…….Q-1.
The meaning of sharpening is
 Edges and fine detail characterized by sharp transitions in image intensity
 Such transitions contribute significantly to high frequency components of
Fourier transform
 Intuitively, attenuating certain low frequency components and preserving high
frequency components result in sharpening.
A high pass filter is obtained from a given low pass filter using the equation.

H hp (u,v) = 1- Hlp (u,v)

Where Hlp (u,v) is the transfer function of the low-pass filter. That is when the low-
pass filter attenuates frequencies, the high-pass filter passed them, and vice-versa.
We consider ideal, Butter-worth, and Gaussian high-pass filters. Fig.. shows typical
3-D plots, image representations and cross sections for these filters. As before, we see that the
Butter-worth filter represents a transition between the sharpness of the ideal filter and the broad
smoothness of the Gaussian filter. [Link] in the sections the follow, illustrates what
these filters look like in the spatial domain. The spatial filters were obtained and displayed
by using the procedure used.

Fig: Top row: Perspective plot, image representation, and cross section of a typical ideal
high-pass filter. Middle and bottom rows: The same sequence for typical butter-worth and
Gaussian high-pass filters.
 IDEAL HIGH-PASS FILTER:
A 2-D ideal high-pass filter (IHPF) is defined as
H (u,v) = 0, if D(u,v) ≤ D0
1, if D(u,v) ˃ D0
Where D0 is the cutoff frequency and D(u,v) is given by eq. As intended, the IHPF is the opposite
of the ILPF in the sense that it sets to zero all frequencies inside a circle of radius D0 while
passing, without attenuation, all frequencies outside the circle. As in case of the ILPF, the IHPF
is not physically realizable.
SPATIAL REPRESENTATION OF HIGHPASS FILTERS:

Fig.. Spatial representation of typical (a) ideal (b) Butter-worth and (c) Gaussian
frequency domain high-pass filters, and corresponding intensity profiles through their centers.
We can expect IHPFs to have the same ringing properties as ILPFs. This is demonstrated
clearly in Fig.. which consists of various IHPF results using the original image in Fig.(a) with
D0 set to 30, 60,and 160 pixels, respectively. The ringing in Fig. (a) is so severe that it produced
distorted, thickened object boundaries (e.g.,look at the large letter “a”). Edges of the top three
circles do not show well because they are not as strong as the other edges in the image (the
intensity of these three objects is much closer to the background intensity, giving discontinuities
of smaller magnitude).
FILTERED RESULTS: IHPF:

Fig.. Results of high-pass filtering the image in Fig.(a) using an IHPF with D0 =
30,60, and 160.
The situation improved somewhat with D0 = 60. Edge distortion is quite evident still, but now
we begin to see filtering on the smaller objects. Due to the now familiar inverse relationship
between the frequency and spatial domains, we know that the spot size of this filter is smaller
than the spot of the filter with D0 = 30. The result for D0 = 160 is closer to what a high-pass
filtered image should look like. Here, the edges are much cleaner and less distorted, and the
smaller objects have been filtered properly.
Of course, the constant background in all images is zero in these high-pass filtered images
because highpass filtering is analogous to differentiation in the spatial domain.

BUTTER-WORTH HIGH-PASS FILTERS:

A 2-D Butter-worth high-pass filter (BHPF) of order n and cutoff frequency D0 is defined as

H(u,v) = 0.5, when D9u,v) = D0

Where D(u,v) is given by Eq.(3). This expression follows directly from Eqs.(3) and (6). The
middle row of Fig.2.2.11. shows an image and cross section of the BHPF function.
Butter-worth high-pass filter to behave smoother than IHPFs. [Link] the performance
of a BHPF of order 2 and with D0 set to the same values as in Fig.2.2.13. The boundaries are
much less distorted than in Fig.2.2.13. even for the smallest value of cutoff frequency.
FILTERED RESULTS: BHPF:

Fig. Results of high-pass filtering the image in Fig.2.2.2(a) using a BHPF of order 2
with D0 = 30, 60, and 160 corresponding to the circles in Fig.2.2.2(b). These results are much
smoother than those obtained with an IHPF.
GAUSSIAN HIGH-PASS FILTERS:
The transfer function of the Gaussian high-pass filter(GHPF) with cutoff frequency
locus at a distance D0 from the center of the frequency rectangle is given by
 H (u, v)  1  e  D ( u ,v ) / 2 D0 2
2

The results obtained are more gradual than with the previous two filters.
FILTERED RESULTS:GHPF:

Fig. Results of high-pass filtering the image in fig.(a) using a GHPF with D0 =
30, 60 and 160, corresponding to the circles in Fig.(b).

Laplacian in Frequency Domain

 d n f ( x) 
   ( j 2u ) F (u )
n
n
We know that  dx 

Laplacian is defined as
  2 f ( x, y )  2 f ( x, y ) 
    ( j 2u ) F (u, v )  ( j 2v) F (u, v)
2 2

 x y
2 2


 
  2 f ( x, y )  4 2 (u 2  v 2 ) F (u, v)

H (u, v)  4 2 (u 2  v 2 )
With respect to center of frequency rectangle

H (u, v)  4 2 (u  M / 2)2  (v  N / 2)2 
H(u,v)= - 4π2D2(u,v)
Laplacian image is obtained as
Enhancement is achieved using equation
g(x,y)= f(x,y) +c
C=-1 as H(u,v) is negative
In frequency domain it is written as

2 2
{[1+4π D (u,v)]F(u,v)}

 
Laplacian in the spatial domain

h( x, y )  1  4 2 (u  M / 2)2  (v  N / 2)2
Enhanced image
 2 f ( x, y )
  M N  
 1  4 2  (u  )2  (v  )2  F (u , v)
  2 2  
g ( x, y )  f ( x, y )   2 f ( x, y )
g ( x, y )
  M 2 N  
 1 1  4 2  (u  )  (v  )2  F (u, v)
  2 2  

Unsharp Masking, High-Boost Filtering and High-Frequency Emphasis Filtering

  High boost filtering in the frequency domain
f hb ( x, y)  ( A 1) f ( x, y)  f hp ( x, y)
Homomorphic Filtering
Homomorphic filters are widely used in image processing for compensating the effect of no
uniform illumination in an image. Pixel intensities in an image represent the light reflected
from the corresponding points in the objects. As per as image model, image f(z,y) may be
characterized by two components: (1) the amount of source light incident on the scene
being viewed, and (2) the amount of light reflected by the objects in the scene. These
portions of light are called the illumination and reflectance components, and are denoted i (
x , y) and r ( x , y) respectively. The functions i ( x , y) and r ( x , y) combine
multiplicatively to give the image function f ( x , y):
f ( x , y) = i ( x , y).r(x, y) ----------------(1)
where 0 < i ( x , y ) < a and 0 < r( x , y ) < 1. Homomorphic filters are used in such
situations where the image is subjected to the multiplicative interference or noise as
depicted in Eq. 1.
We cannot easily use the above product to operate separately on the frequency components
of illumination and reflection because the Fourier transform of f ( x , y) is not separable;
that is
F[f(x,y)) not equal to F[i(x, y)].F[r(x, y)].
We can separate the two components by taking the logarithm of the two sides
Z(x,y) = ln f(x,y) = ln i(x, y) + ln r(x, y).
Taking Fourier transforms on both sides we get,
F [z(x,y)]=F[ln f(x,y)} = F[ln i(x, y)} + F[ln r(x, y)].

ln i ( x, y )  Fi (u, v), ln r ( x, y )  Fr (u, v)

Let
Z (u, v)  Fi (u, v)  Fr (u, v)
S (u, v)  H (u, v) Z (u, v)  H (u, v) Fi (u, v)  H (u, v) Fr (u, v)
s( x, y)  1H (u, v) Fi (u, v) 1H (u, v) Fr (u, v)
s ( x, y )  i ' ( x, y )  r ' ( x, y )
Where
i ' ( x, y)  1H (u, v) Fi (u, v),
r ' ( x, y )  1H (u, v) Fr (u, v),
g ( x, y )  e s ( x , y )  ei ( x , y )  e r ( x , y )  i0 ( x, y )r0 ( x, y )
' '

i0 ( x, y )  e i ( x , y ) , r0 ( x, y )  e r ( x , y )
' '
 g ( x, y)  e i' ( x, y )
e r ' ( x, y )

The homomorphic filter function H(u,v) can then operate on these components
separately,
S (u, v)  H (u, v) Fi (u, v)  H (u, v) Fr (u, v)
 Color Inag1 Promin

to princhst faoto.

Lduteatan d trstiny frun aewse

or eolor
eh a celaY TVe m a

Deaer

i) Peudo estor reeirg: mmochremeitauity

celor t a þartelar
Ce a anguing a

color Fundlamutad

ingtaal a Coctiusu

YOmgeng
) Ract ouer ,
t gt ourc, dit i tually

Colers varcah Con binathis tt ommy

bamol om tki
Csto Yecl CR), 9vecm Ca). AuH lun CB). This i

bau frequwu cu ttu alactrm a gutie nhtrt

GAMMA T-V RADIO

X-RAS 'RED WAYE
RAS |00n
|nm

VSBLE SPECTUM INFRAREJ

LTRA rIOLET

Eeomagncic o e e t r m

Lusnm S3S nm 545nm

BlL Gey Rad

Gr.a8n 650
Ked f'sz:AbGotti gt
by tta rad, gracu,A hlue
 2

Th inmoy celay eu be odd d cuen tt ueondary

Lohite glt
Maguta
B
white
Cy ay
GYeem

Prmany awel eowday olouy

eelor
nd sotracty.
Brcghtng,h r

b notatn for intünty ad raoteeally eumnot be

Brgtnn

a ku.
mikesl w t
Lght chromatety
Huod Aoturatom tokwtuer ore calld

Cster ar callecd trestiul valuy aud are denotal X,4 aul

X
 Color Moduls

ca tti RaB (acl, grean,

magat,yllas, Lkae) dls for ealor orenti

Chae, actrtim, tnoty)modl,keh cerahone, cle
sly t t tta
Lsy h u y cslrbe ad intmd CoBor

Jhin model iy banel

the Cerns; Cy ay, mAgutt,

Oadyellw areat ttre ottr
Cornurs, black ¿ at tt ong;
Auel ohte at tk corner
farthest frou tta orgin. white

Th gray aeala Cpents Mogut

(o, I,0) G
Gem

Thu detwut stsurs u

Red

Vals RAB axe amudt be iu tt rauq ytem

(3 cnog lane tiy th, nmb bt hr la).
T to m fal estor imag ed ojtu to dmit a 24bit

(2': 16,117,213
RED

CoLoR RaB
MONITOR

BLUE

F's:

-ttu noveds Comonut magy

Ta CMy awct cNYk coor Modl

frm t acr
 to tte ramge Ce,iJ.

gir'g rcse to th CmYK elor uoddl. Fowr cster ariutig

TLe HSI csfor mocll:

tot ra hraeted or humau tur hrataton

dscbin csly ia try
nstedfor kndrdra imhlemutathoy.
cly
Than coov nystum arn celr moal denltt
cctratn, lunty)
Th HsI (hu,
earyg antornatin (hee cwl
newncty Conbont frm ti eolr

algontybad en Cetoy chstptou

cuntng
frrcvaleog nage

whit
whit

nt
Cyn
Cy an Rac.

Red
Black

batuca tt RaBA thst

Fg: Cantufptel relachahi
celer models
 Htt oiutr eallbd iutenty

Rac.
Cyan

Hells
S
S Racd
Cyum Cyan
Racl
eyan
Mguta
Racd Rad
Magnta
Nogute

colos are nþarittal by (2o.

a tnt tt frimany
Jn ttin p l , be

dituuey frm tt
l ue n,c t t
Shthin lau ttt ncctura duu
uttnty akic has beu tucrncd

lane st Vrteela s .
havL to ntect the
he,
 whit Whita

/Cy
H

Magauta
Kel
J=05- Cyun Magwt

Black Black
(6) Civeular color laey

Mode. th Triavgl ud erelu ara

Fes.: HSI color
intuuty aoö.
hurhukeulor to tt erteeal
mols
CmvrfCm batwcen esur

eonyrtey cotors frm

RaB to HsI;
i)

360 -0 4 B>G.

(R-G)(G-6)]2

ICRtG+6).
 ave giu by
B 1Ct- s)
S Ces t
R I Cos (6o-)

G= 3I -(R+6)

H= H- 120°
thu ti RCB Cenmuth an
R I C -s)
SeosH
Cos(60'- ) J

B= 31 - (R+G)

H= H-240°

G=1Ci-s)
S Costt
Cos(66- 4)

R= 31- (G+B)

(R, a, e) = (o- 68 3, 0-1608, o1922). Convat ttis nta

HsI melel. S o[(R-G)+6-8)]

(340-e BG

Satrat'on; 3 (mn(R,c,e) Intonoty:

Cons dey KGB- (0- 683, o1608, 6 1922)
Convent ths to SI moclel
063. = I609
R
ß= 0: 19 22.
;[CR-G)+CR- B))

683-0922)
0l6o)+ (o
693-
=Cos
0-192) 61kO3 -0-192)|
683- 0-16 o&)(0 693-

O o s t 0 r 2 2 2
+o+908
-

= Cos-!
-001St|2
0 27 26 1 28t
0-o 6 3.073
ICos
360-3-073

3G0 - =
H +3s6.93
 3

YO/6og

3
019 22
O68 3+ 0 l608t

0S34
1608+0 1922
O-683+6

3
3
Þ34s3
 Pseudocefor IMage Procming

Intawaty sceng
nuhodeou bre
1! au mage tatrattd as a 3o fuut:ou, tta

Blsckto)y

Feg: utesity &ciny teclnigue

feny þi bala
absve ta la will be Codad kott one Celor, uct

botray nd gusel ou )the turo

celot.
(tls may be
Cntbola
 rayutaton of tka irtewaty
Fog: Aw altrnative
akecg tekngiu
ramfomatten
Gvay wal to color
Tha k more

into t rad,gen
mraty
ranti n fd
aa ttlevntm
Th tia mentr

Racl
trawjemahnfala,3)

Gheen
trawfomate

flas)

fe (x)
trmformahn

for fuda eelov imoge

block cagran
Fy: fowetnal
au RaG Ceto monitor
al blu cnhuts
grieom,
 Fellntg kg- akantk trauitowatim fuwnetens tid. Thene

frequeucy,tk cudfut ina becm montchvone.

th name phase amd

eorrasþmad to eok in tk
tte chkange in bcals oe s greuy evals
tta
sonunod. pckas atitt tt gay bval valn in tte ntesh seticn

L-\
Rad

L-L

Gukeen

L-\

Blue
VGryst
Tramtmad'm fuuetny ised to obtan
Fes:
tt imag.