International Journal of Computer Information Systems,

Vol. 3, No. 3, 2011

Image Enhancement Using Fast Splitting -Rooting
Method
P.Tejaswi
1
, K.Srinivasa Reddy
2

ECE, S.R Engineering College
JNTU, India
tejaswi.430@gmail.com
ksrmlgnlgap@yahoo.co.in



Abstract Digital image enhancement is necessary to expose
critical details that are essential but not clearly seen in the image
at hand. Image enhancement focuses on the improvement of
digital image quality. Applying splitting -rooting method on
approximation coefficients needs less number of points to modify
using -rooting and hence needs less no. of one Dimensional
Discrete Fourier Transform(1-D DFT) points .By using
operator we can darken or brighten any image, change its
dynamic range and make it much clearer to see all of its details.
In a splitting signal a 2 dimensional image is represented by a set
of 1 dimensional signal which carries the spectral information of
the image at specific frequency points.
In this paper we propose a fast implementation of
rooting method by using one splitting signal of tensor
representation with respect to DFT. The image enhancement is
thus reduced to processing splitting signals and such process
requires a modification of only a few spectral components of the
image for each signal. The proposed algorithm use two 1-D N
point DFTs instead of two 2-D N N point DFTs in the traditional
method of rooting. The implementation is described in
frequency domain. Experimental results are to be carried out for
image enhancement with different values of .

Keywords Image enhancement, Tensor representation,
Splitting signal, Fourier Transform
I. INTRODUCTION
Digital image enhancement is the improvement of the
visual appearance of the image or to provide better transform
representation for future automated image processing such as
image analysis, detection, segmentation and recognition [1]-
[2]. Image enhancement techniques can be classified into
spatial domain enhancement, which operate directly on pixels
and frequency domain enhancement, which operate on Fourier
Transform of an image.
Image enhancement is applied in every field where images
are to be understood and analysed. For example, medical
image analysis, analysis of images from satellites, industrial
and military applications etc. In medical imaging (e.g.,
computer tomography and magnetic resonance) three
dimensional images of different organs and tissues are
produced. Various sources of interference (e.g., movement of
patient, insufficient performance and noise of imaging devices)
make the quality of such images too poor. In such cases it is
necessary to use various image enhancement methods such as
enhancing edges, emphasizing the difference or reducing the
noise [3]-[10].
In this paper the image enhancement is based on Fourier
Transform, although the Hartley, Hadamard, cosine, and other
transforms are used for image enhancement as well [11]-[13].
-rooting was modified later on into log rooting, modified
unsharp masking and filtering [14]-[17] as well as wavelet
transform [18]-[22]. The main disadvantage in using -rooting
method is the difficulty in selecting parameter value. The
value should be chosen in an optimal way to enhance all
parts of the image very well. The selection of the optimal
parameter is accomplished in the frequency domain through
the calculation and analysis of the two dimensional Discrete
Fourier Transforms (2-D DFT) of the original and enhanced
images and this is thus the main steps that need to be
efficiently performed. To solve this problem tensor
representation was proposed. In the tensor representation, an
image is considered as a totality of one Dimensional (1-D)
signals that carry the spectral information of the 2-D DFT of
the image at specific frequency points. The problem of 2-D
image enhancement is thus reduced to the splitting -rooting
method. The splitting signals are processed separately with
their optimal parameters, to achieve high quality enhanced
images, even when processing only one such signal.
The totality { } o e T f
T
; is called tensor where
( )
s p
T
,
= o
,
p,s=0:(N-1). The transformation
{ } o _ e T f f
T
; :
is called a
tensor transformation.
The traditional method of rooting computes
discrete unitary transform of the image for instance the 2-D
Discrete Fourier Transform and manipulates the transform
coefficients by operator M. Then inverse 2-D DFT is
computed. The result gives the enhanced image.
{ }
m n
f
, is the
original image of size N N . s p
F
, is the 2-D DFT of the
image at frequency point (p,s) with magnitude s p
F
, and
phase s p,
0
. Operator M modifies the magnitude spectrum
as
| |
o
s p s p s p
F F M F
, , ,
=
. Thus the components of Fourier
September Issue Page 72 of 75 ISSN 2229 5208
International Journal of Computer Information Systems,
Vol. 3, No. 3, 2011
Transform
s p
F
,
are multiplied by coefficients
1
,
) , (

=
o
s p
F s p c . The
inverse 2-D DFT is performed for obtained data s p
G
, and the
enhanced image is denoted by m n
g
, .The disadvantage is total
spectrum should be modified.
The proposed algorithm uses two 1-D N point DFTs instead
of 2-D N N DFTs when compared with traditional method of
-rooting. Image enhancement is done by using one
coefficient for processing splitting signal rather than N
coefficients as was done in splitting -rooting method.
The rest of the paper is organized in the following way. In
section II splitting rooting method is presented. Section III
discusses about some experimental results. The last section
describes the concluding remarks.
II. SPLITTING
o
ROOTING METHOD
In this section we describe the splitting signal method of -
rooting and then we propose its fast realization. Instead of
processing the total image by the traditional method of -
rooting based on the Fourier transform which is time
consuming, we process separately one or a few splitting-
signals that achieve a high quality enhancement. The
enhancement is performed by few spectral components and
coefficients.
The 2-D DFT of the image
{ }
m n
f
, at each set of frequency
points s p
T
, becomes the 1-D DFT N
F
of a 1-D signal
s p
T
f
,
=
{ }
1 , , 1 , , 0 , ,
,.... ,
N s p s p s p
f f f
which carries the spectral
information of the image.
A splitting signal )} 1 ( : 0 ; {
, 0 , 0
= N t f
t s p
is selected and
processed by the operator M of the 1-D -rooting. Operator M
modifies only magnitude spectrum. The 1-D DFT,
k
F ,where
k=0 :(N-1), of splitting signal is calculated and placed at the
corresponding set
0 , 0 s p
T of frequency points in the 2-D
DFT. } {
,s p
G is the new 2-D DFT. The 2-D inverse DFT is
calculated and enhanced image is denoted by } {
,m n
g .The
process is repeated for different values of . The 2-D DFT of
the image is modified only at N selected frequency points and
that leads to enhancement of the image. Such method of
processing splitting signals is called the splitting -rooting
method of image enhancement. Each splitting signal can be
processed separately with a corresponding optimal value of
to achieve an optimal enhancement.


FAST ALGORITHM OF THE SPLITTING ROOTING
The original image m n
f
, is of size N N and M is an
operator of magnitude which has the form ( ) ) , (
,
s p c F F M
s p
= O ,
where c(p,s) is a positive function. The optimal parameter
lies close to 1. For each splitting signal the best value of can
be used. In the proposed method the enhancement can be
achieved by modifying the splitting signal by one coefficient
c(1)=c(1,1).
Image enhancement using fast splitting rooting method is
discussed by following scheme by processing splitting signals
t s p t s p
g f
, , , ,

{ } { } { } =
DFT D
t s p t s p t s p m n
f c g f f
1
, , , , , , ,
) 1 (

_

{ } { }
m n
IDFT D
ks kp ks kp
g F c G
,
2
, ,
) 1 (

=

(1)

Where
{ }
m n
f
, is the original image, _ is tensor
transformation,
{ }
t s p
f
, , is the splitting signal, c(1) is the
coefficient,
{ }
m n
g
, is the enhanced image.
The original image
{ }
m n
f
, is of size N N . By applying tensor
transformation the splitting signals are processed
as
t s p t s p
g f
, , , ,

. The 1-D DFT is computed for the splitting

signal. It contains both magnitude and phase. The magnitude
is modified by multiplying the components of Fourier
Transform ks kp
F
, with the coefficient c (1). Later the inverse 2-
D DFT is computed for ks kp
G
,

i.e. the enhanced image is

denoted by
{ }
m n
g
, .
The coefficient c (1) = 1
1 , 1
o F . The enhancement can be
fulfilled by one or few splitting signals
s p
T
g
,

that substitute the

splitting signals
s p
T
g
,
in the splitting rooting method. This
substitution means that the 2-D DFT of the image at frequency
points of the set s p
T
, is modified by one factor c(1). We call
this method of image enhancement the fast splitting rooting
algorithm. The time taken will be less when compared with
traditional method and splitting rooting method as it uses
only one coefficient.
The following are the main steps of this algorithm when
processing the splitting signal
0 , 0 s p
T
f
in the frequency domain.

ALGORITHM
Step1: Calculate the 2-D DFT, {F
p,s
}, of the original image
Step 2: Calculate coefficient c (1) =

Step 3: Calculate N new values of the 2-D DFT at frequency
points of the corresponding set T
po,so
by



Step 4: The enhanced image is calculated by the inverse 2-D
DFT of } {
,s p
G

Step 5: The above steps are repeated for different values of .
III. RESULTS
We have proposed a method of image enhancement using
fast splitting rooting method. This method is a powerful
method for image enhancement. The optimal image
enhancement is achieved by variable parameter to control
). 1 ( : 0 , ) 1 (
, ,
= = N k F c G
o
ks
o
kp
o
ks
o
kp
1
,
o
o o
ks kp
F
September Issue Page 73 of 75 ISSN 2229 5208
International Journal of Computer Information Systems,
Vol. 3, No. 3, 2011
the amount of enhancement. Simulation results are carried out
by considering different standard images using the proposed
method. The results show that the proposed method of image
enhancement provides better image quality. Experimental
results with different types of images show that a high quality
enhancement can be achieved by processing one or few
splitting signals. Fig. 1 shows the result of Fast splitting -
rooting method for =0.92 for kids image in Fig. 1 (a), =0.52
in Fig. 1(b) and =0.12 in Fig. 1(c). Fig. 2 shows the result
of Fast splitting -rooting method for =0.92 for trees image
in Fig. 2(a), =0.52 in Fig. 2(b) and =0.12 in Fig. 2(c).

Fig. 1(a) Result of Fast Splitting Rooting method for =0.92 for kids image.

Fig. 1(b) Result of Fast Splitting Rooting method for =0.52 for kids image.

Fig. 1(c) Result of Fast Splitting Rooting method for =0.12 for kids image.

Fig. 2(a) Result of Fast Splitting Rooting method for =0.92 for trees image.

Fig. 2(b) Result of Fast Splitting Rooting method for =0.52 for trees image.

Fig. 2(c) Result of Fast Splitting Rooting method for =0.12 for trees image.

IV. CONCLUSION
We have considered applications of the tensor form of
image representation for image enhancement by one or few
splitting signals. The splitting -rooting algorithms of image
enhancement have been described in the frequency domain.
We have focused on the effective implementation of the -
rooting method. In this paper, we propose a fast
implementation of the -rooting method by using one splitting
signal of the tensor representation with respect to the Discrete
Fourier Transform (DFT). As a result, the proposed algorithm
for image enhancement use two 1-D N-point DFTs instead of
two 2-D ) ( N N point DFT in the traditional method of -
rooting.
.

September Issue Page 74 of 75 ISSN 2229 5208
International Journal of Computer Information Systems,
Vol. 3, No. 3, 2011
REFERENCES
[1] A.Rosenfeld, A.C.Kak, Digital Picture Processing, Academic press,
San Diego, CA, 1976.
[2] R.C.Gonzalez, Richard E.Woods, Digital Image Processing,
Addision-Wesely, 2003K. Hwang, Computer Arithmetic, John Wiley,
1997.
[3] J. Harris, Constant variance enhancement: a digital processing
technique, Appl. Opt., vol. 16, pp. 12681271, 1977.
[4] D. Wang and A. H. Vagnucci, Digital image enhancement, Comput.
Vis., Graph. Image Process. vol. 24, pp. 363381, 1981.
[5] A. Rosenfeld and A. C. Kak, Digital Picture Processing. New York:
Academic, 1982, vol. 1.
[6] D. F. Elliot and K. R. Rao, Fast Transforms: Algorithms, Analyzes,
Applications. New York/Orlando: Academic, 1983.
[7] W. M. Morrow, R. B. Paranjape, R. M. Rangayyan, and J. E. L.
Desautels, Region-based contrast enhancement of mammograms,
IEEE Trans. Med. Imag., vol. 11, no. 3, pp. 392406, Sep. 1992.
[8] T. L. Ji, M. K. Sundareshan, and H. Roehrig, Adaptive image contrast
enhancement based on human visual properties, IEEE Trans. Med.
Imag., vol. 13, no. 4, pp. 573586, Dec. 1994.
[9] P. Zamperoni, Image enhancement, Adv. Image Electron Phys.,
vol.92, pp. 177, 1995.
[10] R. Gonzalez and Wintz, Digital Image Processing, Reading, 2nd
ed.Reading, MA: Addison-Wesley, 1987.
[11] R. P. Millane, Analytic properties of the Hartley transform and their
applications, Proc. IEEE, vol. 82, no. 3, pp. 413428, Mar. 1994.
[12] K. G. Beauchamp, Walsh Functions and Their Applications. London,
U.K.: Academic, 1975.
[13] O. Ersoy, Fourier-Related Transforms, Fast Algorithms and
Applications. Upper Saddle River,J: Prentice-Hall, 1997.
[14] J. H. McClellan, Artifacts in alpha-rooting of images, in Proc. IEEE
Int. Conf. Acoustics, Speech, Signal Processing, Apr. 1980, vol. 5, pp.
449452.
[15] S. Aghagolzadeh and O. K. Ersoy, Transform image enhancement,
Opt. Eng., vol. 31, no. 3, pp. 614626, 1992.
[16] G. Ramponi, N. Strobel, S. K. Mitra, and T. Yu, Nonlinear unsharp
masking methods for image contrast enhancement, J. Electron. Imag.,
vol. 5, pp. 353366, Jul. 1996.
[17] A. Polesel, G. Ramponi, and V. J. Mathews, Image enhancement via
adaptive unsharp masking, IEEE Trans. Image Process., vol. 9, no. 3,
pp. 505510, Mar. 2000.
[18] K. E. Prager and P. F. Singer, Image enhancement and ltering using
wavelets, Proc. 25th Asilomar Conf. Signals, Systems and Computers,
vol. 1, no. 3, pp. 169174, Nov. 1991.
[19] S. Mallat and S. Zhong, Characterisation of signals from multiscale
edges, IEEE Trans. Patetern Anal. Mach. Intell., vol. 14, no. 7,
pp.710732, Jul. 1992.
[20] A. Laine, J. Fan, and W. Yang, Wavelets for contrast enhancement of
mammography, IEEE Eng. Med. Biol, vol. 14, pp. 536550, 1995.
[21] G. Cincotti, G. Loi, and M. Pappalardo, Frequency decomposition
and compounding of ultrasound medical images with wavelet packets,
IEEE Trans. Med. Imag., vol. 20, no. 8, pp. 764771, Aug. 2001.
[22] D.-Y. Tsai, Y. Lee, M. Sekiya, S. Sakaguchi, and I. Yamada, A
method of medical image enhancement using wavelet analysis, in
Proc. ICSP, 2002, pp. 723726.


September Issue Page 75 of 75 ISSN 2229 5208