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