82 (IJCNS) International Journal of Computer and Network Security,

Vol. 1, No. 3, December 2009

Progressive Image Compression with Ridgelets and

Vector Quantization
A.Vasuki1, P.T.Vanathi2
1
Department of Electronics and Communication Engineering,
Kumaraguru College of Technology, Coimbatore – 641006. Tamilnadu. India.
avasuki@hotmail.com
2
Department of Electronics and Communication Engineering,
PSG College of Technology, Coimbatore – 641004. Tamilnadu. India.
ptvani@yahoo.com

Abstract: Wavelets are good at isolating discontinuities at edge
points, but cannot capture the smoothness of edge segments.
The Finite Ridgelet Transform (FRIT) has been proposed to
provide a sparse expansion for functions that have line
singularities in 2D. It is based on the Finite Radon Transform
(FRAT) that maps a line singularity into a point singularity.
The Discrete Wavelet Transform (DWT) is applied on the Radon
domain to capture the point singularity. The resulting FRIT is
orthonormal, non-redundant and invertible. The multilevel
FRIT (MLFRIT) is a variation of the conventional FRIT that
divides the input image into blocks and applies the orthonormal
FRIT on each block to produce approximations and details.
This process can be iteratively done on the approximations to
produce a subband decomposition similar to DWT. The
resulting data structure shows that MLFRIT is suitable for
progressive compression of images. Based on MLFRIT and
Vector Quantization (VQ), a novel progressive image
compression algorithm has been proposed. In this method, the
orthonormal MLFRIT is performed on the input images and the
resulting ridgelet coefficients are grouped appropriately and
subjected to vector quantization. The proposed compression
algorithm results have been presented extensively for a two level
MLFRIT.
Keywords: Image Compression, Progressive, Ridgelets,
Vector Quantization
1. Introduction
In the human visual system, the receptive fields in the visual
cortex are characterized as being localized, oriented, and
bandpass. Therefore, a computationally efficient image
representation should be based on a local, directional, multi-
resolution expansion. Natural images contain intrinsic
geometrical structures that are key features in visual
information. The geometry of natural surfaces is complex
and multi-scale. Image representation using separable,
orthonormal bases are not optimized since they do not
account for geometric regularity of images. Moreover, a
major challenge in capturing geometry and directionality in
images comes from the discrete nature of the data; typically
the input is sampled images defined on rectangular grids.
Non-linear wavelet transforms are flexible in representing
images since they change the filtering directions according
to the image features, thus achieving more energy
compaction for sharp features. An efficient transform must
be able to capture the essential features of the image with
few coefficients. The transform must be shift-invariant and
account for geometrical structure in the image. The basis
elements should contain elongated shapes with different
aspect ratios and they must be oriented along different
directions. The representation must have negligible
redundancy. Wavelets in two dimensions that are separable
are good at isolating the discontinuities at edge points, but
cannot capture the smoothness of the edge segments. In
addition, wavelets can capture only limited directional
information. Therefore, more powerful representations are
needed in higher dimensions.
The FRIT has been proposed to overcome the weakness of
wavelets in higher dimensions and captures edges in images
with few coefficients. The FRIT provides a sparse expansion
for functions that have line singularities in 2D. It is based
on the FRAT that maps a line singularity into a point
singularity. The DWT is applied on the Radon domain to
capture the point singularity. The resulting FRIT is
orthonormal, non-redundant and invertible. The FRAT
gives projection sequences along different directions and the
DWT is applied on these projections, leading to ridglet
coefficients.
The multilevel FRIT is a variation of the FRIT [1] that is
suitable for progressive compression of images. MLFRIT
divides the input image into blocks and applies the
orthonormal FRIT on each block to produce approximations
and details. This process can be iteratively done on the
coarse image (approximations) to produce a subband
decomposition similar to DWT. Based on MLFRIT and VQ
[2][3], a novel progressive image compression algorithm has
been proposed. In this method, the orthonormal MLFRIT is
performed on the images and the resulting ridgelet
coefficients are grouped appropriately and subjected to VQ.
The proposed compression algorithm results have been
presented extensively for a two level MLFRIT. This
algorithm can be extended for images with larger size and
higher levels of decomposition greater than two. Since,
ridgelet compression is inherently suitable for images with
straight edge segments it results in sparser representation
for those types of images. Ridgelets take advantage of the
image geometry, thus paving the path for efficient
compression.
D.L.Donoho [4] has produced a sparse representation for
data compression by a non-linear approximation method

using orthornormal ridge functions. The same author [5]
has explored the relationship between orthonormal ridgelets
and true ridge functions in another paper. M. Do and M.
Vetterli [6] have presented a finite implementation of the
orthonormal ridgelet transform and numerical results as
applied to representation of images and have shown that
ridgelets are specially adapted for straight line singularities.
In their paper, E.J. Candes and D. L. Donoho [7] present a
review of the work on continuous ridgelet transform,
ridgelet frames, orthonormal ridgelet bases, ridgelets and
edges. The paper by F. Matus and J. Flusser [8] makes
simple computational studies of the finite Radon transform
and its application to image compression. In the work by
A.J.Flesia et al, [9] a large family of orthonormal bases have
been constructed using ridgelet packets and they have been
applied to images. D.L.Donoho and A.J.Flesia [10] have
applied ridgelet transform for digital data. They have made
a study of the analysis and synthesis using true ridge
functions.
E.J.Candes [11] has made a quantitative study of the
properties of estimation by finite linear combination of
ridgelets. The representation of arbitrary functions as ridge
functions has been extensively studied and numerical
experiments have been conducted to illustrate their practical
performance. Zhen Yao and Nasir Rajpoot [12] have
developed a novel content-based image signature for
authentication using ridgelet transform that is robust to
content-preserving manipulations like compression and
allows progressive authentication. A comparative study of
image compression using curvelet, ridgelet and wavelet
transforms has been done by M.S. Joshi , R.R. Manthalkar
and Y.V. Joshi [13].
Section 2 enumerates the basics of finite ridgelet
transform and Section 3 deals with the concepts of
multilevel FRIT. Section 4 elaborately explains the
proposed compression algorithm and discusses the results
obtained. Section 5 gives the conclusion and future work.
2. Finite Ridgelet Transform
The FRAT is applied on the input image to produce
projection sequences along different directions. The DWT
is applied on these projections leading to finite ridgelet
coefficients. The continuous Radon transform is given by:
R f (θ , t ) = ∫ f ( x)δ ( x1 cos(θ ) + x2 sin(θ ) − t )dx
R2
The FRAT is adapted from the continuous Radon transform
for application to discrete images. The FRAT is defined as
summations of image pixels over certain sets of lines. Let
Zp = {0, 1, 2, ….p-1} be a finite field with modulo-p
operations defined on the set; ‘p’ is a prime number. The
FRAT of a real function ‘f’ on the finite lattice Zp2 is
defined as:
1 The wavelets and ridgelets are related by,
r (k , l ) = FRAT f (k , l ) = ∑ f (i , j ) (2)
p (i, j )∈Lk ,l
where Lk,l denotes the set of points that make up a line in the
Z 2p lattice. FRAT treats the input image as one period of a
periodic image; therefore it exhibits a wrap-around effect.
In the FRAT domain, energy is best compacted if the mean
(IJCNS) International Journal of Computer and Network Security, 83
Vol. 1, No. 3, December 2009
is subtracted from the image before taking the transform.
1
The factor is used for normalization. In Euclidean
p
geometry, a line in the Z 2p plane is uniquely represented by
its slope or direction ‘k’ and its intercept ‘l’. There are
(p2+p) lines defined in this way and every line contains ‘p’
points. Moreover, two lines of different slopes intersect at
exactly one point. For any given slope there are ‘p’ parallel
lines that completely cover the plane Z 2p . Therefore, the
FRAT is redundant, as given by the equation below:
p −1 1
∑ r (k , l ) = ∑ f (i , j ) = 0 (3)
l =0 p (i , j )∈Z 2p
In each direction, there are only (p-1) independent FRAT
coefficients. Those coefficients at (p+1) directions together
with the mean value total (p+1)(p-1)+1 = p2 independent
coefficients in the finite Radon domain. The Finite Back-
Projection operator (FBP) is defined as the sum of the Radon
coefficients that pass through a given point.
1
FBPr (i , j ) = ∑ r (k , l ), (i , j ) ∈ Z 2p
p ( k , l )∈Pi , j
(4)
The back propagation operator computes the inverse of
FRAT; the transform matrices of FRAT and FBP are
transpose of each other.
The FRAT, the basic building block in FRIT, has a wrap-
around effect that is eliminated by a special ordering of the
coefficients. The FRIT is the application of the DWT on the
slices of the FRAT that have been ordered:
CRT f (a, b, θ ) = ∫ ψ a ,b (t ) R f (θ , t )dt (5)
R2
The continuous ridgelet transform of the integrable,
bivariate function f(x)is given by:
CRT f (a, b, θ ) = ∫ ψ a , b,θ ( x) f ( x )dx (6)
R2
where the ridgelets in 2D are defined from a
wavelet-type function in 1D as,
−1 / 2  x1 cos θ + x2 sin θ − b 
ψ a,b,θ ( x ) = a ψ   (7)
 a 
where ‘a’ is the scaling factor and ‘b’ is the shift parameter.
The ridgelet function is constant along the lines,
x1 cos θ + x2 sin θ = cons tan t (8)
(1) The separable continuous wavelet transform is given by,
CWT f ( a1 , a2 , b1 , b2 ) = ∫ ψ a1 a 2 b1b2 ( x ) f ( x )dx (9)
R2
where the 2D wavelets are tensor products of 1D wavelets as
specified below:
ψ a1a 2 b1b2 ( x ) = ψ a1b1 ( x1 )ψ a2 b2 ( x2 ) and,
t −b
ψ a ,b ( t ) = a −1 / 2ψ 
 (10)
 a 
Wavelets → ψ scale, po int − position
Ridgelets → ψ scale, line − position
Therefore, wavelets are effective for point singularities and
ridgelets are effective for line singularities. In 2D, points
and lines are related via the Radon transform; thus the
84
wavelet and ridgelet transforms are linked via the Radon
transform. The FRIT is suitable for images with straight
edges but not optimal for images with curves. It can be
implemented with fast algorithms.
3. Multilevel FRIT
In the conventional FRIT, the number of directions is nearly
equal to the size of the input image and the basis functions
have long support extending over the entire image. In
MLFRIT, the basis functions have smaller support and the
number of directions is also reduced. Let the input image be
of size n x n, where n = p1.p2.p3…..pJ.q and the ‘pi ’ are prime
numbers. The input image of size n x n is divided into non-
overlapping subimages of size p1 x p1. The number of
subimages obtained is n1 x n1, where n1 = n/p1 and also
n1 = p2.p3.…..pJ.q. The FRIT of each subimage produces one
mean value and (p12 – 1) detail coefficients. The number
of mean values produced is equal to the number of
subimages; therefore, the mean values form a coarse
approximation of the original image of size n1 x n1.
The above decomposition can be applied again on the
coarse image (mean values of first decomposition). At the
second level, the subimage size is p2 x p2 and the number of
subimages produced is n2 x n2, where n2 = p3…..pJ.q or
n2 = n1/p2. This decomposition can be done iteratively up
to level ‘J’. The basis functions are orthogonal within their
block, and also orthogonal with the constant function of the
block as well as with other blocks. Therefore, MLFRIT is
an orthonormal transform. The MLFRIT coefficients can be
grouped based on their scales and directions to obtain a
subband-like decomposition. The results of progressive
compression with MLFRIT, decomposing the image into
two levels is presented in Table 1 for the test image ‘object’.
The results show that level 1 (L1) detail coefficients are
required for picking up the straight edges in the images.
The level 2 (L2) mean gives the average value of all the
blocks at the second level decomposition. The level 2 detail
coefficients are responsible for reconstruction of the smooth
regions of the image. The PSNR values of the reconstructed
images reflect the percentage of coefficients included for the
reconstruction and the subband in which the coefficients are
present. Including details at level 1 is sufficient for
reproducing the edges in the image and details at level 2 for
the smooth regions of the image. It is obvious that a small
percentage of coefficients are only required to pick up edge
information in images. Adding more details to the
reconstruction improves the PSNR and visual quality of the
image progressively.
4. Proposed Algorithm
A progressive image compression algorithm is proposed
based on the concept of MLFRIT and VQ. The FRIT is
applied on the input image whose size is chosen as
255 x 255, i.e., n = 255. The parameter ‘n’ is factored as,
n = p1.p2.q (11)
(IJCNS) International Journal of Computer and Network Security,
Vol. 1, No. 3, December 2009
where p1 = 17, p2 = 5 and q = 3. The input image is divided
into subimages of size 17 x 17, with a total of 15 x 15 non-
overlapping blocks, as shown in Figure 1.
17x17 17x17 … 17x17
17x17 17x17 … 17x17
. . … .
. . .
. . .
17x17 17x17 … 17x17
Figure 1. Input image of size 255x255 divided into
subimages of size 17x17, with a total of 15x15 subimages
The FRIT is applied on each 17 x 17 block producing one
mean value and 16 x 18 detail coefficients for each
subimage. This first level of decomposition produces a
coarse approximation of size 15 x 15 and detail coefficients
of size 240 x 270, shown in Figure 2(a) and (b). Within
each 17 x 17 block, the directional projections are
transformed using a one dimensional wavelet transform,
with four levels of decomposition for each direction. The
second level of MLFRIT is applied on the coarse
approximation by dividing it into blocks of size 5 x 5, shown
in Figure 3, with a total of 3 x 3 non-overlapping blocks.
The second level decomposition produces an approximation
of the original image of size 3 x 3 (one mean value for each
block), shown in Figure 4(a). Each block is transformed
into 4 x 6 detail coefficients, with a total size of 12 x 18
coefficients for the second level details (Figure 4(b)). The
wavelet decomposition can be done up to a maximum of 2
levels for each block of 5 x 5.
15 270
15 240
… …
(a) (b)
Figure 2. First Level Decomposition, (a) Approximation
coefficients, one mean value for each block, 15x15 values
(b) Detail coefficients, 16x18 coefficients for one block,
15x15 detail blocks, 240x270 coefficients
 (IJCNS) International Journal of Computer and Network Security, 85
Vol. 1, No. 3, December 2009

Table 1: Progressive Reconstruction of Images in MLFRIT

Coefficients PSNR Reconstructed Coefficients PSNR Reconstructed

included (dB) Images included (dB) Images

L2 Mean L2 Mean
L2 Details 0% 1.93 L2 Details 100% 30.35
L1 Details 0% L1 Details 40%

L2 Mean
L2 Mean L2 Details 100% 36.59
L2 Details 0% 2.67 L1 Details 60%
L1 Details 100%

L2 Mean
L2 Mean L2 Details 100%
L2 Details 20%
46.41
9.87 L1 Details 80%
L1 Details 100%

L2 Mean
L2 Mean
L2 Details 20% 6.91
L2 Details 40% 14.76 L1 Details 0%
L1 Details 100%

L2 Mean
L2 Mean
L2 Details 40% 8.73
L2 Details 60% 21.23 L1 Details 0%
L1 Details 100%

L2 Mean
L2 Mean
L2 Details 60% 9.66
L2 Details 80% 30.62 L1 Details 0%
L1 Details 100%

L2 Mean
L2 Mean
L2 Details 80% 9.93
L2 Details 100% 241.27 L1 Details 0%
L1 Details 100%

L2 Mean
L2 Mean
L2 Details 100% 9.97
L2 Details 100% 25.01 L1 Details 0%
L1 Details 20%

The coefficients of MLFRIT can be grouped into three: (i)
mean values of level 2 decomposition representing the
coarse approximation of the input image, (ii) detail
coefficients of level 2 and (iii) detail coefficients of level 1.
VQ is appliedon each group of coefficients by designing
separate codebooks for each of them. The number of images
in the training set used for codebook design is 10. In the
proposed compression algorithm, the mean values of level 2
are grouped into vectors of size 1 x 1, since it contains the
average value of the input image which is the most
important information.
The number of coefficients produced is a total of 3 x 3 = 9.
The codebook size used for level 2 mean is 64. Four
codebooks h ave been designed for level 1 details, one
codebook for each subband, as shown in Figure 5. In
every block, each subband is divided into three vectors of the
respective size. Each codebook has been designed for a size
of 1024, requiring 10 bits for the index. Figure 6 shows the
level 2 codebook, code vectors of size 1 x 6 in each
subband, with two subcodebooks. The subcodebook size is
128 with a total codebook size of 256, requiring 8 bits for
each vector. Similarly, the design has been carried out for
86 (IJCNS) International Journal of Computer and Network Security,
Vol. 1, No. 3, December 2009

vector sizes of 1 x 3 and 1 x 2. But, for codevector sizes of 6

1 x 3 and 1 x 2, the number of subcodebooks is 4, with two
subcodebooks for each subband. This will lead to an 1x6
Subcodebook 2
improvement in quality of the reconstructed image as shown
4 1x6
in Figure 7.
1x6 Subcodebook 1
1x6

5x5 5x5 5x5

Figure 6. Level 2 codebook and vectors

5x5 5x5 5x5 The reconstructed images with level 2 mean and
progressively including level 1 details (level 2 details not
included) is shown in Figure 8. The results show that level
5x5 5x5 5x5 1 details are sufficient for picking up the edges in images,
even though the PSNR values are low. Figure 9 shows the
reconstructed images with level 2 mean and details, not
Figure 3. First Level Approximation, 15x15 block divided including level 1 details. The reconstructed images show
into subblocks of size 5x5, total of 3x3 subblocks that level 2 details are required for the smooth regions of the
image. Figure 10 shows the results of progressive image
reconstruction including level 2 mean, level 2 details and
3 18 progressively including level 1 details. Similarly, Figure 11
shows the reconstruction by progressively including level 2
details, with level 2 mean and level 1 details included.
3 12

(a) (b)

Figure 4. Second Level Decomposition,

(a) Approximation coefficients, one mean value for each (a) (b) (c)
block, 3x3 values (b) Detail coefficients, 4x6 coefficients
for one block, 3x3 detail blocks, total of 12x18 coefficients Figure 7. Reconstructed images, codebook size - level 2
mean : 64, level 1 details : 1024 x 4, (a) level 2 details –
code vector size = 1x6, codebook size : 256, bpp = 0.4052,
18 PSNR = 17.26 dB (b) level 2 details - code vector size 1x3,
codebook size : 512, bpp = 0.4108, PSNR = 22.07 dB (b)
1x6 vector level 2 details - code vector size 1x2, codebook size : 1024,
Codebook 4 bpp = 0.4168, PSNR = 23.12 dB
1x6 vector
2x6 vector Codebook 3
16
4x6 vector Codebook 2

(a) (b) (b) (d)

8x6 vector Codebook 1
Figure 8. Image reconstruction with level 2 mean included,
level 2 details not included, subbands of level 1 details
Figure 5. Level 1 codebooks and vectors progressively included : (a) Subband 4, bpp = 0.1, PSNR =
2.32 dB, (b) Subband 4 & 3, bpp = 0.2, PSNR = 2.45 dB,
(c) Subband 4, 3 & 2, bpp = 0.3, PSNR = 2.56 dB, (d)
Subband 4, 3, 2 &1, bpp = 0.4, PSNR = 2.63 dB, Codebook
for mean of level 2 (size : 64), details of level 2 (size : 256)
and details of level 1 (size : 1024x4) are kept constant
 (IJCNS) International Journal of Computer and Network Security, 87
Figure 9. Image reconstruction by progressively including
level 2 details, level 1 not included (a) Reconstruction with
Mean and Subband 2 of level 2 details, bpp = 0.003, PSNR
= 5.39 dB, (b) Reconstruction with Mean, Subband 2 and 1
of level 2 details, bpp = 0.005, PSNR = 9.39 dB, Codebook
for mean of level 2 (size : 64), details of level 2 (size : 256)
and details of level 1 (size : 1024x4) are kept constant.
(a) (b) (c) (d)
Figure 10. Image reconstruction with mean and level 2
details included, progressively including subbands of level 1
details, (a) Subband 4, bpp = 0.1, PSNR = 12.29 dB, (b)
Subband 4 & 3, bpp = 0.2, PSNR = 13.72 dB, (c) Subband
4, 3 & 2, bpp = 0.3, PSNR = 15.53 dB, (d) Subband 4, 3, 2
&1, bpp = 0.4, PSNR = 17.26 dB, Codebook for mean of
level 2 (size : 64), details of level 2 (size : 256) and details
of level 1 (size : 1024x4) are kept constant.
(a) (b)
Figure 11. Image reconstruction with mean and level 1
details included, progressively including subbands of level 2
details, (a) Subband 2, bpp = 0.4030, PSNR = 7.15 dB, (b)
Subband 2 & 1, bpp = 0.4052, PSNR = 4.30 dB, Codebook
for mean of level 2 (size : 64), details of level 2 (size : 256)
and details of level 1 (size : 1024x4) are kept constant.
5. Conclusion and Future Work
The Multilevel FRIT decomposes the input image into
approximations and details iteratively in a manner similar to
DWT. Based on MLFRIT and VQ, a novel progressive
compression algorithm has been proposed for efficient lossy
compression of images. The ridgelet coefficients resulting
from different levels of MLFRIT are subjected to vector
quantization based on the level and subband in which they
Vol. 1, No. 3, December 2009
are present. The proposed algorithm results for a two level
MLFRIT validates the suitability of the algorithm for
progressive compression at low bit rates. This algorithm
can be extended to images with larger size and higher levels
of decomposition greater than two. The codebook size also
determines the quality of the reconstruction. The overhead
resulting from the storage required for codebooks is the
disadvantage of this method. Since, ridgelet compression is
inherently suitable for certain types of images, especially for
images with straight edge segments, it results in sparser
image representation compared to other transforms. This
work can be extended further by applying multistage VQ
with channel coding for packet-based transmission of
images through communication channels.
References
[1] Minh N. Do, Martin Vetterli, “The Finite Ridgelet
Transform for Image Representation”, IEEE
Transactions on Image Processing, 12 (1), pp. 16-28,
2003.
[2] Robert M. Gray, “Vector Quantization”,
IEEE
Acoustics, Speech and Signal
Processing
Magazine, 1(2), pp. 4-29, 1984.
[3] Y. Linde, A. Buzo, R.M. Gray, “An Algorithm for
Vector Quantizer Design”, IEEE Transactions on
Communications, COM-28 (1), pp. 84 – 95, 1980.
[4] D.L. Donoho, “Orthonormal Rdigelets and Linear
Singularities”, SIAM Journal of Mathematical
Analysis, 31 (5), pp.1062 – 1099, 2000.
[5] D.L. Donoho, “Ridge Functions and Orthonormal
Ridgelets”, Journal of Approximation Theory, 111 (2),
pp. 143 – 179, 2001.
[6] Minh N. Do, Martin Vetterli, “Orthonormal Finite
Ridgelet Transform for Image Compression”, In
Proceedings of IEEE International Conference on
Image Processing (ICIP), pp. 367 – 370, 2000.
[7] E.J. Candes, D.L. Donoho, “Ridgelets: a key to
higher-dimensional intermittency”, Phil. Trans. R. Soc.
Lond. A., 357(1760), pp.2495-2509, 1999.
[8] F. Matus, J. Flusser, “Image Representations via Finite
Radon Transform”, IEEE Transactions on Pattern
Analysis and Machine Intelligence, 15 (10), pp. 996 –
1006, 1993.
[9] A.J. Flesia, H. Hel-Or, A. Averbuch, E.J. Candes,
R.R. Coifman, D.L. Donoho, Digital Implementation of
Ridgelet Packets, Beyond Wavelets, J. Stoeckler and
G.V.Welland eds. Academic Press, 2001.
[10] D.L. Donoho, A.J. Flesia, “Digital Ridgelet Transform
Based on True Ridge Functions”, Beyond Wavelets, 10,
pp. 1 – 30, 2003.
[11] E.J. Candes, “Ridgelets : Estimating with Ridge
Functions”, Annals of Statistics, 31(5), pp. 1561 –
1599, 2003.
[12] Zhen Yao, Nasir Rajpoot, “Radon / Ridgelet Signature
For Image Authentication”, In Proceedings of IEEE
International Conference on Image Processing (ICIP),
pp. 43 – 46, 2004.
88 (IJCNS) International Journal of Computer and Network Security,
Vol. 1, No. 3, December 2009

[13] M.S. Joshi, R.R. Manthalkar, Y.V. Joshi, “Image

Compression Using Curvelet, Ridgelet and Wavelet
Transform, A Comparative Study”, ICGST
International Journal on Graphics, Vision and Image
Processing, 8 (3), pp. 25 - 34, 2008.

Authors Profile

A.Vasuki She obtained her B.E. degree in

Electronics and Communication Engineering
from PSG College of Technology in the year
1989. She obtained her Master’s degree in
Applied Electronics from Coimbatore Institute
of Technology in 1991. She has published over
25 papers in journals and conferences and her
research interest is in the field of Image Compression. She is
currently working as Asst. Professor in the Dept. of ECE,
Kumaraguru College of Technology, Coimbatore, India.

P.T.Vanathi She obtained her Bachelor’s

degree in Electronics and Communication
Engineering and Master’s degree in Computer
Science from PSG College of Technology in
the year 1985 and 1991 respectively. She has
a Ph.D in the area of Speech Coding and has
so far published over 30 papers in Journals
and 60 papers in National and International Conferences. Her
areas of interest are VLSI Design and Speech Recognition and she
has over 23 years of teaching experience. She is currently working
as Asst. Professor in the Dept. of ECE, PSG College of
Technology, Coimbatore, India.