0 views

Uploaded by contulluialex

Scientific article 202-7201

save

- The Usefulness of Wavelet Transform to Reduce Noise in the SEMG Signal
- Abstract
- analisis en frecuencia del electro-oculografo
- 112
- Wavelet Families and Properties - MATLAB & Simulink - MathWorks India
- Implementation of Digital Image Steganography Using ADSP BF532 Processor
- 11
- swaraj
- Photoshop Tricks, Volume 4
- Tile Boundary Artifacts Reduction of JPEG2000 Compressed Images
- vit-mat
- Application of Wavelet analysis.pdf
- A General Approach to Derivative Calculation Using Wavelet
- Main Paper
- Performance analysis of Coiflet-type wavelets for a fingerprint image compression by using wavelet and wavelet packet transform
- 3.Imdad Jpeg
- Wave Let Intro
- eNGINEERING
- A Color Image Compression Using Pixel Correlation and Its Comparison with Existing Algorithms
- Voluson 730 Exp Datasheet
- Analysis and Implementation of Different Digital Image Watermarking Techniques for Secure Data Transmission
- Biorthogonal wavelets
- PDTools - a Toolbox of Partial Discharge (PD) Signal Analysis for Transformer Condition Assessment
- A New Method for License Plate Location Based on Top-hat Transform and Wavelet Transform.pdf
- P1151036290
- 1
- scientific paper
- Neural Network Based Image Compression With Lifting Scheme and Rlc
- Steganography
- Tech Report NWU-EECS-11-02: Elastic Fidelity: Trading-off Computational Accuracy for Energy Reduction
- Dispatches from Pluto: Lost and Found in the Mississippi Delta
- Elon Musk: Tesla, SpaceX, and the Quest for a Fantastic Future
- The Innovators: How a Group of Hackers, Geniuses, and Geeks Created the Digital Revolution
- Sapiens: A Brief History of Humankind
- The Unwinding: An Inner History of the New America
- Yes Please
- A Heartbreaking Work Of Staggering Genius: A Memoir Based on a True Story
- Grand Pursuit: The Story of Economic Genius
- This Changes Everything: Capitalism vs. The Climate
- The Emperor of All Maladies: A Biography of Cancer
- The Prize: The Epic Quest for Oil, Money & Power
- John Adams
- Devil in the Grove: Thurgood Marshall, the Groveland Boys, and the Dawn of a New America
- The World Is Flat 3.0: A Brief History of the Twenty-first Century
- Rise of ISIS: A Threat We Can't Ignore
- Smart People Should Build Things: How to Restore Our Culture of Achievement, Build a Path for Entrepreneurs, and Create New Jobs in America
- The Hard Thing About Hard Things: Building a Business When There Are No Easy Answers
- Team of Rivals: The Political Genius of Abraham Lincoln
- The New Confessions of an Economic Hit Man
- How To Win Friends and Influence People
- Angela's Ashes: A Memoir
- Steve Jobs
- Bad Feminist: Essays
- You Too Can Have a Body Like Mine: A Novel
- The Incarnations: A Novel
- The Light Between Oceans: A Novel
- Leaving Berlin: A Novel
- The Silver Linings Playbook: A Novel
- The Sympathizer: A Novel (Pulitzer Prize for Fiction)
- Extremely Loud and Incredibly Close: A Novel
- A Man Called Ove: A Novel
- Bel Canto
- The Master
- The First Bad Man: A Novel
- We Are Not Ourselves: A Novel
- The Blazing World: A Novel
- The Rosie Project: A Novel
- Brooklyn: A Novel
- The Flamethrowers: A Novel
- Life of Pi
- The Love Affairs of Nathaniel P.: A Novel
- The Perks of Being a Wallflower
- Lovers at the Chameleon Club, Paris 1932: A Novel
- The Bonfire of the Vanities: A Novel
- A Prayer for Owen Meany: A Novel
- The Cider House Rules
- The Art of Racing in the Rain: A Novel
- Wolf Hall: A Novel
- The Wallcreeper
- Interpreter of Maladies
- Beautiful Ruins: A Novel
- The Kitchen House: A Novel
- Good in Bed

You are on page 1of 4

Cosma / Carpathian Journal of Electronic and Computer Engineering 7/2 (2014) 7-10

7

**A Method for Improving the Progressive
**

Image Coding Algorithms

Ovidiu COSMA

Department of Mathematics and Computer Science

North University Center

Baia Mare, Roumania

e-mail: ovidiu.cosma@yahoo.com

**Abstract—This article presents a method for increasing the
**

performance of the progressive coding algorithms for the

subbands of images, by representing the coefficients with a code

that reduces the truncation error.

Keywords—image compression; subband coding

I.

INTRODUCTION

**The progressive image coding algorithms have the
**

advantage that they produce an embedded code that has the

property that all the representations of the same image at lower

bit rates are embedded in the beginning of the bit stream

corresponding to the target bit rate. Thus the coding and the

decoding processes can be interrupted after producing

respectively processing a certain amount of data.

This type of algorithms usually process the transformed

image in several passes in which a bit from each of the

coefficients that exceed a certain threshold is inserted in the

output stream. All the bits processed at the same pass form a bit

plane. The best-known algorithms of this kind are the

progressive coding variant of JPEG [7], EZW (Embedded

image coding using Zerotrees of Wavelet coefficients) [5] and

SPIHT (Set Partitioning In Hierarchical Trees) [4]. The last

two were developed for coding the subbands of images,

computed with the DWT (Discrete Wavelet Transform) [3],

[1], and perform the cuantization and codification of the

coefficients in an integrated manner.

The SPIHT algorithm [4] codes an image in several passes,

each of which having an associated threshold. At each of the

passes, the coefficients whose absolute value exceeds the

threshold are moved in a List of Significant Coefficients

(LSC), the threshold is halved and the next bit from all the

coefficients in LSP is inserted in the output stream of the

encoder. The process is ended when the bit rate reaches a

certain value. For an efficient speculation of the correlations

between different subbands, a special data structure called

zerotree is used. A zerotree is a quadtree with all the nodes

smaller or equal with the root. A whole zerotree that contains

insignificant coefficients is represented with a single symbol.

ISSN 1844 - 9689

**The existing algorithms are focused on the efficient
**

specification of the bit planes. The decoder completes the bits

in the planes that it has no information about with zeroes. Thus

the coefficients are truncated at the bit that corresponds to the

last of the bit planes, and the approximation improves with

each new pass.

This article presents a new numeric code that reduces the

truncation error of the transform coefficients and implicitly

improves the quality of the reconstructed images.

II.

THE HIA CODE

**HIA (Half Interval Approximation) is a new numeric
**

code, which allows a more advantageous representation of the

coefficients in image subbands. Even if there are certain

values for which the arithmetic representation is more

accurate, in the majority of the situations, the HIA code

reduces the truncation error.

Let’s consider a positive value x ∈ [ p, a ⋅ p ) , where

a > 1 and p = a n . The first non – zero bit in the HIA code of

x, is placed at position n, and indicates that x is situated in the

above interval. Each of the following bits of the HIA code,

halves this interval. The longer the code, the shorter the

interval and the value is usually decoded with better precision.

The algorithm presented in Fig.1 can be used for

generating the HIA code of the positive value x, with the

precision determined by ε . The result will be placed in

variable c.

The decoding algorithm is presented in Fig. 2. The HIA

x HIA

code is taken from variable c and the result is placed in ~

which represents the reconstructed value of x.

III.

THE TRUNCATION ERROR

**Let’s consider a value x ∈ [ p, 2 ⋅ p ) , where p = 2n .
**

If a = 2, the HIA code is similar to the binary arithmetic

representation. The differences appear only at decoding. The

first non – zero bit of x is placed at position n.

http://cjece.ubm.ro

2 p ) . The only exceptions are the values situated at the middle of the intervals [a n . more precisely if | x − m |< (r − l ) / 8 . The second drawback refers to the fact that most of the arithmetic values cannot be exactly represented on a finite number of bits. c = 0 set the bit at position n of c while ( r − l > ε and n > the position of the least significant bit of c) n = n − 1 .9689 8 THE EVALUATION OF THE HIA CODE The application whose block scheme is presented in Fig. n = 3 p / 2 . Cosma / Carpathian Journal of Electronic and Computer Engineering 7/2 (2014) 7-10 n = ⎣log a x ⎦ l = a n . the arithmetic representation is more accurate for the values in the interval [ p. m = (l + r ) / 2 if ( the bit at position n of c = 1 ) then l=m else r=m HIA ~ x = (l + r ) / 2 Fig. r ] interval. this situation appears in 25% of the cases. n = x − ~ x HIA.3. the decoder will place the reconstructed value at the middle of x HIA. where k > 0 . There are a few drawbacks related to the HIA code. a lower truncation error is obtained. and the comparator module outputs the PSNR [6] ~ computed for the reconstructed luminance component Y . 2. The resulting coefficients are coded at different bit rates with the SPIHT algorithm. In the first place. For the field of image compression there is no need to exactly represent the transform coefficients. n = the position of the first non-zero bit of c. PSNR (Peak Signal-to-Noise Ratio) and RMSE (Root Mean Square Error) are two of the most common quality measures used in image compression [6]. It is obvious that in the case of truncation at bit n. where m is the middle of the [l . truncated at bit n. HIA coding algorithm Because the interval of the coefficients for which the HIA coding is advantageous is three times longer. Then the Discrete Wavelet Transform (DWT) of Y is computed using the Villasenor 18/10 digital filter [9]. 5 p / 4) . n = x − 3 p / 2 ∈ [− p / 2. Constant a = 2 was chosen for the evaluation of the HIA code. The remaining blocks perform the inverse transforms. HIA decoding algorithm In the case of the arithmetic representation. the probability that the coefficients that become significant at the pass corresponding to the threshold p are more precise represented is 3/4 in the case of the HIA code. 1. where ~ HIA . This unwanted effect appears only if x is close enough to the middle of the interval. The truncation error e HIA. One of this x HIA. | e HIA. If a certain value is exactly represented on n bits.O.5 was built for the evaluation of the HIA code. a n +1 ) . (1) p) IV. r = a n +1 while ( n > the position of the least significant bit of c ) n = n − 1 . n is in the interval: ~ this case: e HIA. ( e n ) is: en = x − ~ x n = x − p ∈ [0. where ~ x n is the value of x.4. n is represented are indicated by l and r. l = a n . the truncation error at bit n. http://cjece. This aspect is illustrated in Fig. n and situations is presented in Fig. where N is the total number of pixels. p / 2] p / 2) (2) Relations (1) and (2) indicate that the HIA coding halves the upper limit of the truncation error for the coefficients that became significant at the pass corresponding to the threshold p. xi are the pixels in the original image and ~ xi are those in the reconstructed one. ISSN 1844 . If the coefficients are uniformly distributed. and the HIA code has the advantage that on average. The first module extracts the luminance component Y from the test images that are represented in the RGB colour space [2]. respectively n-1. r = a n +1 . and 1/4 in the case of the arithmetic representation. for the entire set of coefficients that represent a transformed image.ubm. In the case that the HIA code is truncated at the same bit. The ends of the interval through which ~ x HIA. than it will never again be exactly represented on n + k bits. there are situations in which the precision decreases by adding an extra bit to the code. m = (l + r ) / 2 if ( x ≥ m ) then l=m set the bit at position n of c else r=m Fig. n − 1 ~ x represent the reconstructed values of x when the HIA code is truncated at the bits n.ro . These are defined in relations (3) and (4). n | ∈ [0. and the HIA coding for the ones in the interval (5 p / 4.

n ~ xn Fig. The interval of values for which the HIA code is advantageous.9689 http://cjece. 3. Fig. Interval of values for which the precision decreases by adding the bit at position n-1 ~ x HIA. Cosma / Carpathian Journal of Electronic and Computer Engineering 7/2 (2014) 7-10 9 ~ x HIA.ro .n = m Fig. ISSN 1844 .n −1 x ~ x HIA.O. The performance evaluating application’s block scheme. 5. Values for which the precision will decrease at the next pass. 4.ubm.

W. and the thick one represents a polynomial regression curve.1991 Signal and Image Processing Group. the original SPIHT algorithm generates an image representation that is longer on average with 20 – 25% ISSN 1844 . “Embedded Image Coding Using Zerotrees of Wavelet Coefficients”. EXPERIMENTAL RESULTS A set of 20 test images with various amounts of details and smooth regions was used in the evaluation process. “Multiresolution and Wavelets”. “The JPEG Still Picture Compression Standard”. CONCLUSIONS [7] When used in combination with the SPIHT algorithm. 1996 J.5 3. Cosma. SMPTE Advanced Television and Electronic Imaging Conf. SIGGRAPH’95 Course Notes G.9689 http://cjece. 41 no. University of Bath.0 4.5 10 4. Communications of the ACM.5 0.5 1.0 1.0 5. Wallace.O. Said.ubm.5 2. vol. M.0 bit rate [bpp] Fig.0 3.5 3. 34.5 – 4. Cosma / Carpathian Journal of Electronic and Computer Engineering 7/2 (2014) 7-10 PSNR gain [dB] 0.6. In the particular case that was evaluated. Reissell. “Wavelet Transform application in image compression”. 6. depending on the bit rate. 04. A.bath. Shapiro. 6.1993 W. Buletinul Ştiinţific al Universităţii din Baia Mare seria B.5 5.5 2.ro . and the decoding process requires a few simple operations. [2] [3] [4] [5] [6] VI. IEEE Transactions on Circuits and Systems for Video Technology. SIGGRAPH’95 Course Notes A. vol. because in those cases there are more coefficients to benefit from the HIA code. vol.5 1. IEEE Transactions on Signal Processing. The thin line represents the average computed for the entire set of images.7 dB.uk For obtaining images of similar qualities.0 2. 2000 C. RMSE = 1 N N ∑ ( x −~x ) i 2 i than in the case of using the HIA code. K. 12.0 1. The results expressed by the increase of the PSNR are presented in Fig. 12.0 0. The computing effort required for performing the HIA coding and decoding is negligible. Pearlman. the HIA code is similar to the binary arithmetic representation of the coefficients. Poynton. (3) i =1 PSNR = 20 log10 max i xi RMSE (4) REFERENCES [1] V. PSNR gain with the HIA code. “A New Fast and Efficient Image Codec Based on Set Partitioning in Hierarchical Trees”.5 4. and at low compression ratios. “A Guided Tour of Color Space”. “Signal Compression and Image Processing”. issue 4. the HIA code increases the PSNR computed for the reconstructed images on average with 0.0 3. Wavelets. http://dmsun4. M.0 0. 1995 L.0 2.ac. Sweldens. The best results were obtained for images reach in details. [8] O.

- The Usefulness of Wavelet Transform to Reduce Noise in the SEMG SignalUploaded byAngkoon Phinyomark
- AbstractUploaded bylegy86
- analisis en frecuencia del electro-oculografoUploaded byDario Emanuel Ripa Carrasco
- 112Uploaded byFardy Efendi
- Wavelet Families and Properties - MATLAB & Simulink - MathWorks IndiaUploaded byAtul Mani
- Implementation of Digital Image Steganography Using ADSP BF532 ProcessorUploaded byseventhsensegroup
- 11Uploaded byspasp91
- swarajUploaded byjaraws
- Photoshop Tricks, Volume 4Uploaded byTony Laidig
- Tile Boundary Artifacts Reduction of JPEG2000 Compressed ImagesUploaded byCS & IT
- vit-matUploaded byJagadeesh Ramayanam
- Application of Wavelet analysis.pdfUploaded byRahul Pandey
- A General Approach to Derivative Calculation Using WaveletUploaded byDinesh Zanwar
- Main PaperUploaded byswati
- Performance analysis of Coiflet-type wavelets for a fingerprint image compression by using wavelet and wavelet packet transformUploaded byijcses
- 3.Imdad JpegUploaded bysamadazad
- Wave Let IntroUploaded byeeppwk
- eNGINEERINGUploaded byMansoor Companywala
- A Color Image Compression Using Pixel Correlation and Its Comparison with Existing AlgorithmsUploaded byseventhsensegroup
- Voluson 730 Exp DatasheetUploaded bySaba Rahman
- Analysis and Implementation of Different Digital Image Watermarking Techniques for Secure Data TransmissionUploaded byseventhsensegroup
- Biorthogonal waveletsUploaded byNavaneeth Payyanur
- PDTools - a Toolbox of Partial Discharge (PD) Signal Analysis for Transformer Condition AssessmentUploaded bysulemankhalid
- A New Method for License Plate Location Based on Top-hat Transform and Wavelet Transform.pdfUploaded byBasil
- P1151036290Uploaded byChaitanya Dvsk
- 1Uploaded byZarina Laurin
- scientific paperUploaded byapi-316734972
- Neural Network Based Image Compression With Lifting Scheme and RlcUploaded byInternational Journal of Research in Engineering and Technology
- SteganographyUploaded byJaya Prakash
- Tech Report NWU-EECS-11-02: Elastic Fidelity: Trading-off Computational Accuracy for Energy ReductionUploaded byeecs.northwestern.edu