<< Chapter < Page Chapter >> Page >

Only Size needs to be Huffman coded in the above scheme, since, within a given Size, all the input values havesufficiently similar probabilities for there to be little gain from entropy coding the Additional Bits (hence they are codedin simple binary as listed). Each coded Size is followed by the appropriate number of Additional Bits (equal to Size) todefine the sign and magnitude of the coefficient difference exactly.

There are only 12 Sizes to be Huffman coded, so specifying the code table can be very simple and require relatively few bitsin the header.

In JPEG all Huffman code tables are defined in the image header. Each table requires 16 n bytes, where n is the number of codewords in the table.

The first 16 bytes list the number of codewords of each length from 1 to 16 bits (codewords longer than 16 bits areforbidden). The remaining n bytes list the decoded output values of the n codewords in ascending codeword order ( n 256 ).

Hence 16 12 28 bytes are needed to specify the code table for DC coefficients.

The jpeg run-amplitude code

The remaining 63 coefs (the AC coefs) of each 64-element vector usually contain many zeros and so are coded with acombined run-amplitude Huffman code.

The codeword represents the run-length of zeros before a non-zero coef and the Size of that coef. This is then followed by the Additional Bits whichdefine the coef amplitude and sign precisely. Size and Additional Bits are defined just as for DC coefs.

This 2-dimensional Huffman code (Run, Size) is efficient because there is a strong correlation between the Size of acoef and the expected Run of zeros which precedes it - small coefs usually follow long runs; larger coefs tend to followshorter runs. No single 2-D event is so probable that the Huffman code becomes inefficient.

In order to keep the code table size n below 256, only the following Run and Size values are coded: Run 0 15 Size 1 10 These require 160 codes. Two extra codes, corresponding to (Run,Size) = (0,0) and (15,0) are used for EOB (End-of-block)and ZRL (Zero run length).

EOB is transmitted after the last non-zero coef in a 64-vector. It is the most efficient way of coding the finalrun of zeros. It is omitted in the rare case that the final element of the vector is non-zero.

ZRL is transmitted whenever Run 15 , and represents a run of 16 zeros (15 zeros and a zero amplitude coef) which can be part of a longer run of anylength. Hence a run of 20 zeros followed by -5 would be coded as

(ZRL) (4,3) 010

When the code tables are defined in the image header, each codeword is assigned to a given (Run,Size) pair by making thedecoded output byte Code Byte equal to ( 16 Run Size ).

The default JPEG code for (Run,Size) of AC luminance DCT coefficients is summarised below in order of decreasing codeprobability:

(Run,Size) Code Byte (hex) Code Word (binary) (Run,Size) Code Byte (hex) Code Word (binary)
(0,1) 01 00 (0,6) 06 1111000
(0,2) 02 01 (1,3) 13 1111001
(0,3) 03 100 (5,1) 51 1111010
(EOB) 00 1010 (6,1) 61 1111011
(0,4) 04 1011 (0,7) 07 11111000
(1,1) 11 1100 (2,2) 22 11111001
(0,5) 05 11010 (7,1) 71 11111010
(1,2) 12 11011 (1,4) 14 111110110
(2,1) 21 11100
(3,1) 31 111010 (ZRL) F0 11111111001
(4,1) 41 111011

As an example, let us code the following 8 8 block: -13 -3 2 0 0 0 1 0 6 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 -1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 Concerting this to (DC Size) or (Run,Size) and values for the Additional Bits gives:

(4) -13 (0,2) -3 (0,3) 6 (2,2) 2 (3,1) -1 (ZRL) (1,1) 1 (EOB) 101 0010 01 00 100 110 11111001 10 111010 0 11111111001 1100 1 1010

The compressed bitstream for this block is listed on the lower line, assuming that the default Huffman code tables, givenabove, are used.

shows the histogram of probabilities for the (Run,Size) codewords used to code Lennausing the Q lum quantisation matrix. The bin number represents the decoded byte value.

shows the equivalent histogram when the quantisation matrix is 2 Q lum .

Histogram of the (Run,Size) codewords for the DCT of Lenna, quantised using Q lum .
Histogram of the (Run,Size) codewords for the DCT of Lenna, quantised using 2 Q lum .

Note the strong similarity between these histograms, despite the fact that represents only 2 3 as many events. Only the EOB probability changes significantly, because its probability goes up as the number of events (non-zero coefs) per block goes down.

It turns out that the (Run,Size) histogram remains relatively constant over a wide range of image material and acrossdifferent regions of each image. This is because of the strong correlation between the run lengths and expected coefsizes. The number of events per block varies considerably depending on the local activity in the image, but theprobability distribution of those events (except for EOB) changes much less.

and also give the mean bit rates to code Lenna for the two quantisation matrices. Comparingthese with the theoretical entropies from this figure (lower row) we get:

Q matrix Mean Entropy (b/pel) JPEG Bit Rate (b/pel) JPEG efficiency
Q lum 0.8595 0.8709 98.7%
2 Q lum 0.5551 0.5595 99.21%

Hence we see the high efficiency of the (Run,Size) code at two quite different compression factors. This tends to apply overa wide range of images and compression factors and is an impressive achievement.

There is even very Little efficiency lost if a single code table is used for many images, which can avoid the need totransmit the 16 n (168 bytes) of code definition in the header of each image. Using the recommended JPEG default luminance tables(Annex K.3.3) the above efficiencies drop to 97.35% and 95.74% respectively.

Questions & Answers

find the 15th term of the geometric sequince whose first is 18 and last term of 387
Jerwin Reply
I know this work
salma
The given of f(x=x-2. then what is the value of this f(3) 5f(x+1)
virgelyn Reply
hmm well what is the answer
Abhi
how do they get the third part x = (32)5/4
kinnecy Reply
can someone help me with some logarithmic and exponential equations.
Jeffrey Reply
sure. what is your question?
ninjadapaul
20/(×-6^2)
Salomon
okay, so you have 6 raised to the power of 2. what is that part of your answer
ninjadapaul
I don't understand what the A with approx sign and the boxed x mean
ninjadapaul
it think it's written 20/(X-6)^2 so it's 20 divided by X-6 squared
Salomon
I'm not sure why it wrote it the other way
Salomon
I got X =-6
Salomon
ok. so take the square root of both sides, now you have plus or minus the square root of 20= x-6
ninjadapaul
oops. ignore that.
ninjadapaul
so you not have an equal sign anywhere in the original equation?
ninjadapaul
hmm
Abhi
is it a question of log
Abhi
🤔.
Abhi
I rally confuse this number And equations too I need exactly help
salma
But this is not salma it's Faiza live in lousvile Ky I garbage this so I am going collage with JCTC that the of the collage thank you my friends
salma
Commplementary angles
Idrissa Reply
hello
Sherica
im all ears I need to learn
Sherica
right! what he said ⤴⤴⤴
Tamia
hii
Uday
hi
salma
what is a good calculator for all algebra; would a Casio fx 260 work with all algebra equations? please name the cheapest, thanks.
Kevin Reply
a perfect square v²+2v+_
Dearan Reply
kkk nice
Abdirahman Reply
algebra 2 Inequalities:If equation 2 = 0 it is an open set?
Kim Reply
or infinite solutions?
Kim
The answer is neither. The function, 2 = 0 cannot exist. Hence, the function is undefined.
Al
y=10×
Embra Reply
if |A| not equal to 0 and order of A is n prove that adj (adj A = |A|
Nancy Reply
rolling four fair dice and getting an even number an all four dice
ramon Reply
Kristine 2*2*2=8
Bridget Reply
Differences Between Laspeyres and Paasche Indices
Emedobi Reply
No. 7x -4y is simplified from 4x + (3y + 3x) -7y
Mary Reply
how do you translate this in Algebraic Expressions
linda Reply
Need to simplify the expresin. 3/7 (x+y)-1/7 (x-1)=
Crystal Reply
. After 3 months on a diet, Lisa had lost 12% of her original weight. She lost 21 pounds. What was Lisa's original weight?
Chris Reply
what's the easiest and fastest way to the synthesize AgNP?
Damian Reply
China
Cied
types of nano material
abeetha Reply
I start with an easy one. carbon nanotubes woven into a long filament like a string
Porter
many many of nanotubes
Porter
what is the k.e before it land
Yasmin
what is the function of carbon nanotubes?
Cesar
I'm interested in nanotube
Uday
what is nanomaterials​ and their applications of sensors.
Ramkumar Reply
what is nano technology
Sravani Reply
what is system testing?
AMJAD
preparation of nanomaterial
Victor Reply
Yes, Nanotechnology has a very fast field of applications and their is always something new to do with it...
Himanshu Reply
good afternoon madam
AMJAD
what is system testing
AMJAD
what is the application of nanotechnology?
Stotaw
In this morden time nanotechnology used in many field . 1-Electronics-manufacturad IC ,RAM,MRAM,solar panel etc 2-Helth and Medical-Nanomedicine,Drug Dilivery for cancer treatment etc 3- Atomobile -MEMS, Coating on car etc. and may other field for details you can check at Google
Azam
anybody can imagine what will be happen after 100 years from now in nano tech world
Prasenjit
after 100 year this will be not nanotechnology maybe this technology name will be change . maybe aftet 100 year . we work on electron lable practically about its properties and behaviour by the different instruments
Azam
name doesn't matter , whatever it will be change... I'm taking about effect on circumstances of the microscopic world
Prasenjit
how hard could it be to apply nanotechnology against viral infections such HIV or Ebola?
Damian
silver nanoparticles could handle the job?
Damian
not now but maybe in future only AgNP maybe any other nanomaterials
Azam
Hello
Uday
I'm interested in Nanotube
Uday
this technology will not going on for the long time , so I'm thinking about femtotechnology 10^-15
Prasenjit
can nanotechnology change the direction of the face of the world
Prasenjit Reply
At high concentrations (>0.01 M), the relation between absorptivity coefficient and absorbance is no longer linear. This is due to the electrostatic interactions between the quantum dots in close proximity. If the concentration of the solution is high, another effect that is seen is the scattering of light from the large number of quantum dots. This assumption only works at low concentrations of the analyte. Presence of stray light.
Ali Reply
the Beer law works very well for dilute solutions but fails for very high concentrations. why?
bamidele Reply
how did you get the value of 2000N.What calculations are needed to arrive at it
Smarajit Reply
Privacy Information Security Software Version 1.1a
Good
Got questions? Join the online conversation and get instant answers!
QuizOver.com Reply

Get the best Algebra and trigonometry course in your pocket!





Source:  OpenStax, Image coding. OpenStax CNX. Jan 22, 2004 Download for free at http://cnx.org/content/col10206/1.3
Google Play and the Google Play logo are trademarks of Google Inc.

Notification Switch

Would you like to follow the 'Image coding' conversation and receive update notifications?

Ask