GVIP Journal, Volume 5, Issue 9, Dec.

2005

Efficient Secured Lossless Coding of Medical Images – using Region Based

Modified SPIHT and Modified Runlength Coding for Character Representation

P.Geetha (1) and Dr. S.Annadurai (2)

1: Research Scholar, Department of CSE & IT , Govt. College of Technology,
Coimbatore, India.
Email: geetha_akp@yahoo.co.in Ph:0422 2437210
2: Principal , Government College of Engineering ,
Tirunelvelli-627 007, India
Email:anna_prof@yahoo.co.in

Abstract data, and efficient compression of these data is crucial.

Lossless compression schemes with secure transmission
play a key role in telemedicine applications that help in
accurate diagnosis and research. Traditional
cryptographic algorithms for data security are not fast
enough to process vast amount of data. Hence a novel
Secured lossless compression approach proposed in this
paper is based on reversible integer wavelet transform,
region based modified SPIHT algorithm , new modified
runlength coding for character representation and
selective bit scrambling. The use of the lifting scheme
allows to generate truly lossless integer-to-integer
wavelet transforms. Images are
compressed/decompressed by region based modified
SPIHT algorithm and the proposed modified runlength
coding greatly improves the compression performance
and also increases the security level. This work
employs scrambling method which is fast, simple to
implement and it also provides security. Lossless
compression ratios and distortion performance of this
proposed method are found to be better than other
lossless techniques.
Keywords: Region based modified SPIHT algorithm,
lifting scheme, lossless compression, reversible integer
wavelet transform, secure transmission, selective bit
scrambling, modified runlength coding.
1. Introduction
Clinical picture archiving and communication systems
(PACS), and telemedicine networks require the storage
and transmission of a large amount of medical image
Applying Image compression reduces the storage
requirements, reduces network traffic, and therefore
improves efficiency. Several techniques have been
proposed for image compression [16]. These can be
classified into lossy and lossless techniques. Lossless
compression techniques allow exact reconstruction of
the original, but the achievable compression ratios are
only of the order approximately 2:1. This paper
addresses the following combined problem: (1)
obtaining high compression ratio for the lossless coding
of images, comparable to other methods [13,17] (2)
achieving this in an embedded fashion, i.e. in such a
way that all lower rate codes of an image are embedded
at the beginning of the bitstream generated for the
lossless coding, and (3) secured transmission of the
embedded bitstream . Solving this problem is
important for many application domains.
In medical area one cannot afford information loss
due to compact coding, because lossy compression may
destroy some of the information required during
processing, or add artifacts that lead to erroneous
interpretations. So lossless compression has been
widely preferred by medical professionals [16], because
it facilitates accurate diagnosis.
The standard wavelet compression techniques, even
if loss-less in principle, do not reconstruct exactly the
original image because of the rounding of the floating-
point wavelet coefficients to integers. The use of the
lifting scheme allows to generate truly loss-less integer-
to-integer wavelet transforms. In recent years, new

41
 GVIP Journal, Volume 5, Issue 9, Dec. 2005
reversible integer wavelet transforms [2, 6, 10] can be
developed using lifting scheme, have grown in
popularity for lossless image compression. The
compression systems [1], comprising a wavelet
transform followed by SPIHT (set partitioning in
hierarchical trees) is an embedded image compression
algorithm with coding efficiency comparable to
EBCOT, which is employed in JPEG 2000. The lower
complexity and computation requirement of SPIHT is
particularly attractive and also it is a successful method
in the field of image compression. In this paper new
region based modified SPIHT coding scheme together
with new modified runlength coding is used to encode
the subband coefficients. Modified runlength coding
(MRLE) increases the compression ratios of the
proposed approach.
Lossless image compression coder, such as context
based predictive coding (CALIC) [17] and universal
context modeling based coding[14], the lack of a
progressive transmission capability makes them
unsuitable for interactive applications like telematics
over large networks. Embedded coding permits the
progressive transmission of the compressed data,
starting with an economical initial transmission of a
rough image followed by gradual transmission of the
refinement details, needed for the final reconstruction.
Embedded progressive coding becomes quite important
in terms of compressing medical images, because an
image may be stored without any loss.
In addition to compression, secured transmission
helps in accurate diagnosis and medical research.
Changes in data bits by the intruder make accurate
diagnosis a difficult task. Medical researchers will be
reluctant to provide their valuable contents if they are
not assured that their contents are securely protected.
Hence several technologies have been developed for
information protection [7]. One is through encryption.
Traditional cryptographic algorithms such as Digital
Encryption Standard (DES) [3] are not fast enough to
42
meet the real-time delivery requirement [8] , because
they usually add a large amount of processing overhead.
Because of this the compression ratio achieved is also
limited to 1.5 to 2. To reduce the amount of
processing overhead in this paper selective bit
scrambling method is applied. In addition to this in the
proposed approach to make the computation easier
integer wavelet transform is used. The digital image
will be scrambled before it is distributed and only
authorized users who have the proper key for
decryption can access the clear content. This technique
does not introduce additional bits which in turn reduce
the compression ratio.
Hence in this paper, a secured lossless image
compression framework is proposed in which image
data are scrambled without significantly affecting the
compression efficiency. The rest of paper is organized
as follows. Overview of the proposed framework is
discussed in section II, Experiments and Results are
presented in section III , the paper is concluded in
section IV.
2. Overview of the Proposed Framework
Secured Lossless Image Compression can be obtained
by Integer wavelet transform followed by region based
modified SPIHT algorithm and selective bit scrambling.
Scrambling is a disordered mixture of data. A digital
image scrambling scheme should have a relatively
simple implementation, low-cost and low-delay
operation for real-time interactive applications. It
should have a minimum adverse impact on the
compressibility of the image. Digital image scrambling
method aims to meet the objectives outlined earlier.
Fig1. shows a general architecture of the proposed
system. The Secured image compression and
reconstruction addressed in this paper involves the
following steps.
Step 1: The given image is decomposed using Integer
wavelet transform. Integer wavelet transform can be
developed using lifting scheme.
 GVIP Journal, Volume 5, Issue 9, Dec. 2005

Step 2: Region based modified SPIHT coding technique prediction and update steps. At the conclusion of these
is applied to the data obtained in the previous step. In lifting steps, the even and odd samples have been
the implementation of region based modified SPIHT the replaced by high pass (1) and low pass (2) coefficients
significant information is stored in three ordered lists as respectively.
in SPIHT – list of insignificant sets (LIS), List of
insignificant pixels (LIP) and list of significant pixels
(LSP). The algorithm consists of 2 main passes to
encode an image - Sorting pass and Refinement pass.
The LIS and LIP entries are encoded in the
sorting pass while the LSP entries are
encoded in the refinement pass.
Step 3: Scramble the encoded bits based on the key to
encrypt an image data.
Step 4: Modified runlength coding of the scrambled
coefficients. Transmit the output via transmission line.
Receiver applied the reverse procedure, obtained a d( i )[n] = d( i-1 )[n] – ( ∑ p( i ) [k] s( i-1 )[n-k] )+1/2 (1)
sequence of bits k
Step 5: The encoded coefficients are reformed by
descrambling the bits using the same key . s( i )[n] = s( i-1 )[n] – ( ∑u( i ) [k] d( i )[n-k] ) + 1/2 (2)
Step 6: The Inverse Region based modified SPIHT k
method is applied to find the positions of the decoded
symbols and decompress the wavelet coefficients of It should be noted that although integers are
the significant map. Go to step 2, run the algorithm transformed to integers, the coefficients p(i) [k] and u(i) [k]
sequentially and stops whenever a target rate is met are not necessarily integers. Thus, computing the integer
exactly. transform coefficients requires floating point operations.
Step 7: Inverse Integer wavelet transform is applied to More detailed information on lifting can be found in
the decompressed data obtained in the previous step to [5,14,15]. In this work, the following reversible integer
reconstruct the original image. The above said steps wavelet transforms of [5] based on the lifting scheme have
are explained in the forthcoming sections. been used with the notation (M,N) where M and N
represent the number of vanishing moments of the
analysis and synthesis high pass filters, respectively and
Lifting and Reversible Integer Wavelet Transforms are described in the remainder of this section. In each case
In most cases, the wavelet transform produces x[n] refers to the original signal and s[n] refer to the low
1
floating-point coefficients and although this allows pass coefficient and, d[n] and d [n] refer to the high pass
perfect reconstruction of the original image in theory, coefficients.
the use of finite-precision arithmetic, together with
quantization, results in a lossy scheme. Recently, new a . The (2,2) Transform
Integer wavelet transform, i.e. wavelet transforms that The (2, 2) is an interpolating transform designed to
transform integer to integer have been introduced [5, 12, have two vanishing moments for both the analyzing and
13]. In [5], it was shown that an integer version of every synthesizing high pass filters. It is defined by the
wavelet transform with finite filters can be obtained following lifting steps:
using the lifting scheme of [14]. Lifting allows a
wavelet transform to be computed quickly through a d[n]=x[2n+1]- ½ (x[2n]+x[2n+2] ) + 1/2 (3)
series of individual lifting steps and fully in place
calculation. Integer wavelet transform is used to reduce s[n]= x[2n] + ¼ (d[n-1] + d[n] ) + 1/2 (4)
the memory demands of the compression algorithm as
integers are used instead of real numbers. b . The (4,2) Transform
Fig.2 depicts the forward wavelet transform using The (4,2) is an interpolating transform designed to have
lifting. For the forward transform, the data set x is four vanishing moments for the analyzing high pass
split into two disjoint subsets. There is no restriction on filters and two vanishing moments for synthesizing high
how the data should be split, nor on the relative size of pass filters. It is defined by the following lifting steps:
each of the subsets. The only thing we need is some
procedure to join the subsets back into the original data d[n]= x[2n+1] 9/16 (x[2n]+x[2n+2] )  1/16(x[2n – 2]
set x. The easiest possibility is split the data x into even + x[2n+4] )+ 1/2 (5)
and odd samples. Next is a series of dual lifting and
primal lifting steps, alternatively referred to as s[n]= x[2n] + ¼ (d[n -1] + d[n] ) +1/2 (6)

43
 GVIP Journal, Volume 5, Issue 9, Dec. 2005
c. The (2,4) Transform
It is defined by the following lifting steps:
d[n]=x[2n+1]- ½ (x[2n]+x[2n+2] ) + /2 (7)
s[n]= x[2n] + 19/64 (d[n-1] + d[n] )  3/64(d[n -2]
+d[n+1] ) + ½ (8)
d . The (6,2) Transform
It is defined by the following lifting steps:
d[n]=x[2n+1] 75/128 (x[2n]+x[2n+2] )  25/256
(x[2n-2] +x[2n+4] )+ 3/256 (x[2n-4]
+ x[2n + 6] ) +1/2 (9)
s[n]= x[2n] + ¼ (d[n -1] + d[n] ) +1/2 (10)
e . The (2+2,2) Transform
d1[n]=x[2n+1]  ½ (x[2n]+x[2n+2] ) + 1/2 (11)
s[n]= x[2n] + ¼ (d1[n-1] + d1[n] ) + 1/2 (12)
d[n]=d1[n]1/16(-s[n-1]+s[n]-s[n+1]-s[n+2])+1/2 (13)
f. The S Transform
d[n]=x[2n+1] x[2n] (14)
s[n]= x[2n] + ½ d[n] (15)
The image is decomposed by the above transforms. It
is compressed by SPIHT algorithm, compression of
significant map using set partitioning tree coding is
discussed in the next step.
Region based modified SPIHT Algorithm
After the wavelet transform, the region based
modified SPIHT algorithm is applied to encode the
wavelet coefficients. The SPIHT algorithm has received
widespread recognition for its notable success in image
coding [20]. The principles of the SPIHT algorithm are
partial ordering of the transform coefficients by
magnitude with a set partitioning sorting algorithm,
ordered bit plane transmission and exploitation of self-
similarity across different layers. By following these
principles, the encoder always transmits the most
significant bit to the decoder. After applying the
transforms, the first quadrant or LL subband has many
positive significant coefficients and few negative
coefficients. If we analyze the decomposition results of
various transforms, most of the negative coefficients are
found to be insignificant in the first quadrant. Based on
the decomposition results, in region based modified
SPIHT, coefficients in the first quadrant are always
assumed to be positive. Since no sign bit is needed only
one bit is used to encode the coefficient, 1 representing
significant coefficient and 0 representing insignificant
44
coefficient. Coefficients in the other quadrants are
coded in the same way as SPIHT.
In the implementation of the algorithm, the
following three lists are used: list of insignificant
sets(LIS), List of insignificant pixels(LIP) and list of
significant pixels(LSP). Two passes are needed to
encode the coefficients of significant map : Sorting pass
and Refinement pass. In all the lists each entry is
identified by a coordinate (i, j) which in the LIP and
LSP represents individual pixels, and in the LIS
represents either the set D(i, j) or L(i, j). D(i, j)
represents LIS entries of type A and L(i, j) represents
LIS entries of type B . O(i, j) represents the child of the
coordinates(i, j). S(i, j) gives the significant
information. If the Coefficient C(i, j) is significant with
respect to the threshold then S(i, j)=1 else S(i, j)=0.
The outline of the full coding algorithm is as follows:
1. Initialization: output n=⎣log2(image(i,j)‫׀‬c i,j ‫⎦) ׀‬
Set the list of significant points (LSP) as empty and the
coordinates ( i , j ) ε H to the LIP, and only those with
descendants also to the LIS , as type A entries.
2. Sorting pass.
Using the set partitioning algorithm distribute the
appropriate indices of the coefficients to the LIP, LIS,
and LSP.
2.1) for each entry (i, j) in the LIP do:
2.1.1) output S(i, j);
2.1.2) if S(i, j)=1 then move (i, j) to the LSP .
if (i, j) is not in first quadrant output the sign
of (i, j);
2.2) for each entry (i, j) in the LIS do:
2.2.1) if the entry is of type A then
• output S(D(i, j)) ;
• if S(D(i, j))=1 then
for each (k ,l) ε O(i, j) do:
• output S(k, j);
• if S(k, j)=1 then add (k ,l) to the LSP
and if (i, j) is not in first quadrant
output the sign of C(i, j);
• if S(k, j)=0 then add (k ,l) to the end of
LIP;
• if L(i, j) ≠ Ø then move (i, j) to the end
of the LIS, as an entry of type B and
goto 2.2.2);
otherwise remove entry (i, j) from the
LIS;
2.2.2) if the entry is of type B then
• output S(L(i,j)) ;
• if S(L(i, j))=1 then
• add each (k, l) ε O(i, j) to the end
of the LIS as an entry of type A.
• remove (i, j) from the LIS.
 GVIP Journal, Volume 5, Issue 9, Dec. 2005
3. Refinement pass:
For each entry in the LSP significant for higher n, send
the nth most significant bit to the decoder.
4. Decrement n by one and return to step 2 until the
specified bit rate is reached. In SPIHT, during encoding
each significant coefficients sign in the set is checked
for transmission, whereas in Region based Modified
SPIHT, only the region of the set is checked. So in
Region based Modified SPIHT the number of
comparisons are reduced and also computational
complexity is slightly reduced. Scrambling of the
encoded bits to ensure security is discussed in the next
step.
Selective bit scrambling of encoded coefficients
Several scrambling systems [5, 18] rely on methods
of directly distorting the visual image data such that,
without descrambling, the image appears unintelligible
to the viewer. The proposed approach, Scramble the
encoded bits based on the key to encrypt an image. To
increase the level of security block shuffling and block
rotation is used, discussed in [15]. For the encryption of
the bits, if a codebreaker is to recover the encoded bits,
an exhaustive search is required. Selective bit
scrambling approach, scrambles selected bits of
encoded coefficient obtained in the previous step to
encrypt an image data. Applying new modified coding
improves the compression performance and also it
increases the security level, is explained in the next
step.
Modified Runlength coding and decoding
Modified runlength coding algorithm has the following
form.
Algorithm 1
0) Read the output file of SPIHT algorithm 8 bits at a
time and convert it into character and store the
character in result file.
1) Compute threshold values. (given below)
2) Choose a separator character such that it is not
present in the result file.
3) Scan the characters of the result file one by one and
count the repeated occurrence of the same character.
i) if count < threshold , print character in the
output file
ii) if count >= threshold , print the separator
followed by count and that character.
MRLE representation takes 4 bytes(separator (S)-1byte,
Number of characters (Count)-2, Character-1).
Threshold = S+ Count+ Character
So more than four consecutive occurrence of the same
character is replaced by 4 bytes representation of
MRLE. If the number of consecutive occurrence is less
than 4 the MRLE is not applied and each character
45
occupies just a byte. Whereas in RLE [19] even a single
occurrence of a character is replaced by 3 byte (count,
char) representation which is not efficient for a file
having more non repeated character. When MRLE is
applied it gives better results for all monochrome
images and as well as some gray scale images
compared to arithmetic coding. In decoding, the
symbols are decoded sequentially by applying the
reverse procedure. The receiver with a proper key can
descramble the bits is given in the next step.
Descrambling the encoded coefficients
The encoded coefficients can be descrambled by the
user with the same key. Without this key, it is difficult
to reconstruct the decoded symbols and also it is hard to
find the position of the decoded symbols.
Inverse region based modified SPIHT decoding
method
At the decoder end it is possible to retrace the coding
path and retrieve the significance map transmitted.
Based on this, appropriate values can be allocated to
each pixel position, noting that the centroid of the
significance range( ‫ ׀‬2 n+1 - 2 n ‫ ׀‬/ 2 ) is added to every
significant pixel. In this manner an approximation of the
subband-decomposed image is reconstructed. The
procedure to obtain the original image is explained in
the next step
Inverse Integer Wavelet Transform
Lifting allows simple inverse transform, of the same
complexity as the forward one – Reversible integer
wavelet transform being composed of the elementary
operations of the forward one, taken in reversed order.
Inverse integer wavelet transform is applied to the
decompressed data to get the integer data of the image.
Experimental results are given in the next section.
3. Experiments and Results
The proposed secured Lossless Compression
algorithm is applied to various images of size 128 ×
128 which is digitized to 8 bits/pixel is shown in Figures
3(a),4(a),5(a). Figures (b) and (c) are decomposed and
reconstructed images. This algorithm is tested for
various images and the CR (Compression Ratio ) of
other lossless compression techniques such as Low
complexity, content based lossless compression
(LOCO-I) [13], Context based image adaptive lossless
image codec (CALIC) [17] ,EZW and arithmetic coding
,SPIHT and arithmetic coding, SPIHT and Modified
runlength coding are compared and shown in Table 1.
These results show that the proposed algorithm offers
excellent compression ratio and also high computational
speed. After analyzing the decomposition results of
various wavelet transforms, in most of the transforms all
the coefficient in the first quadrant are found to be
 GVIP Journal, Volume 5, Issue 9, Dec. 2005

positive. So in region based modified SPIHT, the first
quadrant is always assumed to be positive. Hence the
PSNR ratio of both SPIHT and Region based Modified
SPIHT are same with a significant increase of
compression ratio by 0.4 to 0.6 in Region based
Modified SPIHT and it is shown in Table1. But in some
wavelet transforms very few no of negative significant
14
COMPRESSION RATIO
quadrant are found to be positive. The average PSNR
for this work is roughly 3dB or 4dB better than
CALIC[17] and LOCO-I [13]. There was no single
transform that performed best over the entire data set.
Compared to arithmetic coding, proposed MRLE
algorithm gives better results for most of the images.
4. Conclusions
Medical imaging generates vast amount of data . To
preserve these data, lossless compression is widely
preferred, because it allows the exact reconstruction of

12

10
the original image. In secured lossless image
8
compression, the proposed Region based Modified
6
SPIHT produces a lossless compressed embedded data
4
stream and the data stream is scrambled based on the
2
key to encrypt an image. The image scrambling scheme
0
51.58 60.44 53.38 54.14 52.14 58.91 38.13 36.14
has relatively simple implementation, low cost and low
PSNR in DB
delay operations which are highly desirable
characteristics for real time interactive applications. The
E Z W- A rit hC o de S P IH T - A rit hC scrambled data is further compressed by Modified
Runlength coding which is simple and a faster
S P IH T - M R LE P ro po s e d A p
technique. It not only compresses the image but also
increases the security level. Secured transmission helps
Figure 6. Comparison of various coding techniques in accurate diagnosis and research. The proposed
MRLE and Region based Modified SPIHT increases the
coefficients are found in first quadrant which decreases compression performance in secured lossless image
the PSNR ratio by a negligible factor between 0.0 DB compression. An excellent compression ratio is
and 0.0002 DB. achieved and also the quality of the image is found to be
good. MRLE is a fast, simple, lossless compression
Compression ratio of various images in table1 and its technique. It increases the compression performance
PSNR is shown in Fig 6. If we analyze the with an increase in security level.
decomposition results of (2,2) Daubechies transform
and S transform almost all the coefficients in first

(a ) Original Image b) Decomposed Image (c) Reconstructed image

Figure 3. Scrambled Lossless compression and Reconstruction of WILLIS Image result of (2,4) transform
CR=11.92

Figure 4. Scrambled Lossless compression and Reconstruction of Lena Image result of (2,4) transform CR=10.42

46
 GVIP Journal, Volume 5, Issue 9, Dec. 2005

Hence the low cost faster and simpler implementation
highly satisfies the good candidate for telemedicine
applications and also retains the option of secured
lossless transmission and archiving of the image. So
it is highly suitable for fast consultation and
transmission of losslessly archived large medical
images. I have implemented the algorithm for 2D
images and I propose to extend this approach to 3D
images.

Figure 5. Scrambled Lossless compression and Reconstruction of Brain cora result of (2,4) transform CR=11.8

TABLE 1. Comparison on CR of different Integer wavelet transform of the proposed approach with other methods

Monocrome Image LOCO-I CALIC EZW(2,4) SPIHT SPIHT Proposed approach

(256 X256X8) [13] [17] Arith.code (2,4) (2,4)
(2,2) (2,4) (4,2) (6,2) (2+2, S
Arith.code MRLE
2)
Willis 2.91 3.11 6.83 11.28 11.8 11.41 12.41 11.7 11.51 11.65 11.19

Lena_gray 2.45 2.98 8.55 10.10 10.42 10.35 10.82 10.58 10.71 10.54 10.10

Blood cell 3.10 3.51 7.02 8.09 8.56 8.38 9.06 8.81 8.89 8.98 8.23

CT_skull 2.85 2.97 4.24 7.16 7.77 7.51 8.18 7.96 7.89 7.86 7.13

CT_wrist 4.80 4.79 5.88 8.41 8.83 9.08 9.33 9.49 9.21 9.30 8.52

Thorax 2.53 2.73 7.98 9.52 9.98 10.03 10.56 10.11 10.05 10.18 9.89

Spinal-gray scale 2.42 2.49 5.21 6.44 7.84 6.83 8.28 8.36 7.58 7.76 6.71

XRAY-grayscale 2.32 2.64 4.91 7.44 6.72 6.51 7.32 6.70 6.68 6.74 6.20

REFERENCES [6] Jun Wang, H.K.Haung, “Medical Image

[1] Amir said and William A. Pearlman,” An Image
multiresolution Representation for lossy and
lossless compression”, IEEE Transactions on
Image processing, vol.5,pp.1303-1310,Sept.1996.
[2] R.Calderbank, I.Daubechies, W.Sweldens, and B-
L.Yeo , ” Wavelet transforms that map integers to
integers,” submitted to Journal of Applied and
Computational Harmonics Analysis.
[3] Data Encryption standard, FIPS PUB 46,Jan.1977.
[4] I.Daubechies and W.Sweldens, “Factoring wavelet
transforms into lifting steps,” preprint, Bell
Laboratories, Lucent Technologies,1996.
[5] G.L.Hobbs, “ Video Scrambling”, U.S.Patent 5815
572,Sep.29,1998.
Compression by Using Three Dimensional Wavelet
Transformation”, IEEE Transactions on Medical
Imaging,vol.15,pp.547-554,Aug.1996.
[7] B.Macq and J.Quisquater, ” Cryptology for digital
TV broadcasting”, Proc.IEEE,vol.83,pp.944-957,
June 1995.
[8] J.Meyer and F.Gadegast, ”Security Mechanisms for
Multimedia Data with the Example MPEG-1
Video,”http://www.cs.tuberlin.de/phade/phade/sec
m-peg.html,1995.
[9] J.Shapiro, “ Embedded Image coding using
zerotrees of wavelet coefficients”, IEEE
Transactions on Signal Processing, vol.41,pp.3445-
3462, Dec.1993.

47
 GVIP Journal, Volume 5, Issue 9, Dec. 2005

[10] Steven Dewritte , Jan Cornelis, Member, “Lossless

Integer Wavelet Transform”, IEEE Signal
Processing Letters, vol.4.pp.158-160, June 1997

[11] W.Sweldens, “The Lifting scheme: A custom-

design construction of biorthogonal wavelets,”
Journal of Applied and Computational Harmonic
Analysis,vol.3(2),pp.186-200,1996.

[12] G.K.Wallace,” The JPEG still picture compression

standard ,” Comm.ACM,34,1991,30-44 .

[13] M.J.Weinberger, G.seroussi, and

G.Shapiro,”LOCO-I:Alow complexity, context-
based lossless image compression algorithm,” in
Proc.of 1996 Data Compression
Conference,1996,pp.140-149.

[14] M.J.Weinberger, J.J.Rissanen and

R.B.Arps,”Applications of universal context
modeling to lossless compression of gray-scale
images,” IEEE Trans. Image
Processing,5,1996,575-586.

[15] Wenjun Zeng,Shawmin Lei, ”Efficient Frequency

Domain Selective Scrambling of Digital Video”,
IEEE Transaction on multimedia,vol5,March 2003.

[16] S.Wong, L.Zaremba,D.Gooden, and H.K.Huang,

“Radiologic image compression –A review,”
Proc.of the IEEE , vol.83,pp.194-219,Feb.1995.

[17] X.Wu and N.Menon,”CALIC-A context based

adaptive lossless image codec,” in Proc.of 1996
International Conference on Acoustics,Speech,and
Signal Processing, 1996,pp.1890-1893

[18] D.Zeidler and J.Griffin, “Method and Apparatus

for Television Signal Scrambling using Block
Shuffling,” U.S. Patent 5 321 748, June 14,1994.

[19] Rafael C.Gonzalez “ Digital Image Processing”

p343-362.

[20] A. Said and W. A. Pearlman, “A New, Fast and

Efficient Image Codec Based on Set Partitioning in
Hierarchical Trees,” IEEE Trans. on Circuits and
Systems for Video Technology, Vol. 6, pp. 243–
250, June 1996.

48