INTRODUCTION

The fundamental idea behind wavelets is to analyze according to scale.

Indeed, some researchers in the wavelet field feel that, by using
wavelets, one is adopting a whole new mindset or perspective in
processing data.

Wavelets are functions that satisfy certain mathematical requirements

and are used in representing data or other functions. This idea is not
new.

Approximation using superposition of functions has existed since the

early 1800's, when Joseph Fourier discovered that he could superpose
sines and cosines to represent other functions. However, in wavelet
analysis, the scale that we use to look at data plays a special role.
Wavelet algorithms process data at different scales or resolutions.

If we look at a signal with a large "window," we would notice gross

features. Similarly, if we look at a signal with a small "window," we
would notice small features. The result in wavelet analysis is to see both
the forest and the trees, so to speak.

This makes wavelets interesting and useful. For many decades, scientists
have wanted more appropriate functions than the sines and cosines
which comprise the bases of Fourier analysis, to approximate choppy
signals (1).

By their definition, these functions are non-local (and stretch out to

infinity).
They therefore do a very poor job in approximating sharp spikes. But
with wavelet analysis, we can use approximating functions that are
contained neatly in finite domains.

Wavelets are well-suited for approximating data with sharp

discontinuities.

The wavelet analysis procedure is to adopt a wavelet prototype function,

called an analyzing wavelet or mother wavelet.

Temporal analysis is performed with a contracted, high-frequency

version of the prototype wavelet, while frequency analysis is performed
with a dilated, low-frequency version of the same wavelet.

Because the original signal or function can be represented in terms of a

wavelet expansion (using coefficients in a linear combination of the
wavelet functions), data operations can be performed using just the
corresponding wavelet coefficients.

And if you further choose the best wavelets adapted to your data, or
truncate the coefficients below a threshold, your data is sparsely
represented.

This sparse coding makes wavelets an excellent tool in the field of data
compression.
 MODULES

 HISTOGRAM EQUALIZATION
 DISCRETE WAVELET TRANSFORM
 SINGULAR VALUE DECOMPOSITION

1.HISTOGRAM EQUALIZATION:

Histogram equalization is used for enhancing the contrasts in an intensity image.

This normally works quite well for smaller images or images where almost all of
the different intensity levels are represented.

For these situations, a different version of histogram equalization could be useful.

If you could do equalization over a portion of the image, too many intensity levels
in the image would less affect you. Of if you need to enhance the contrast more
than a global histogram equalizer can offer. However, this is very computer
intensive, as you would need to compute a histogram for each pixel in the image.
The workload will increase proportional with n to the power of 2, where n is the
number of pixels.

In order to do local histogram equalization, the user has to pass over the image
represented by a two dimensional array of short ints. The user also has to choose a
mask size, which describes the size of the portion of the image to equalize at a
time. The mask size has to be an odd number, because only the centre pixel of the
mask will be written to the new and equalized image.

The equalization begins with the mask being cantered on the upper left pixel. A
histogram will be calculated for all pixels covered by the mask. The pixel in the
centre of the mask will then be written to the resulting image. The mask is then
moved one pixel to the right and a new histogram be computed. This continues for
each pixel of each row in the image.

One of the tricks to lower the processing time is to reuse part of the previous
histogram. In this implementation, we create a single dimension array with length
equal to the number of possible intensity levels in the image. For an 8-bit greyscale
image, the length would be 256.

2.DISCRETE WAVELET TRANSFORM:

ABSTRACT
In this letter, a new satellite image contrast enhancement technique
based on the discrete wavelet transform (DWT) and singular value
decomposition has been proposed.
The technique decomposes the input image into the four frequency
subbands by using DWT and estimates the singular value matrix of the
low-low subband image, and, then, it reconstructs the enhanced image
by applying inverse DWT.
The technique is compared with conventional image equalization
techniques such as standard general histogram equalization and local
histogram equalization, as well as state-of-the-art techniques such as
brightness preserving dynamic histogram equalization and singular value
equalization.
The experimental results show the superiority of the proposed method
over conventional and state-of-the-art techniques.