<< Chapter < Page
  Image coding   Page 1 / 1
Chapter >> Page >
This module introduces the 2-dimensional DCT.

In the equation from our discussion of the Haar transform: y T x T and to invert: x T y T we saw how a 1-D transform could be extended to 2-D by pre- and post-multiplication of a square matrix x to give a matrix result y . Our example then used 2 2 matrices, but this technique applies to square matrices of any size.

Hence the DCT may be extended into 2-D by this method.

E.g. the 8 8 DCT transforms a subimage of 8 8 pels into a matrix of 8 8 DCT coefficients.

The 2-D basis functions, from which x may be reconstructed, are given by the n 2 separate products of the columns of T with the rows of T . These are shown for n 8 in (a) of as 64 subimages of size 8 8 pels.

The result of applying the 8 8 DCT to the Lenna image is shown in (b) of . Here each 8 8 block of pels x is replaced by the 8 8 block of DCT coefficients y . This shows the 8 8 block structure clearly but is not very meaningful otherwise.

Part(c) of shows the same data, reordered into 64 subimages of 32 32 coefficients each so that each subimage contains all the coefficients of a given type - e.g: the top left subimagecontains all the coefficients for the top left basis function from (a) of . The other subimages and basis functions correspond in the same way.

We see the major energy concentration to the subimages in the top left corner. (d) of is an enlargement of the top left 4 subimages of (c) of and bears a strong similarity to the group of third level Haar subimages in (b) of this figure . To emphasise this thehistograms and entropies of these 4 subimages are shown in .

Comparing with this figure , the Haar transform equivalent, we see that the Lo-Lo bands have identicalenergies and entropies. This is because the basis functions are identical flat surfaces in both cases. Comparing the other 3bands, we see that the DCT bands contain more energy and entropy than their Haar equivalents, which means less energy (and so hopefully less entropy) in the higher DCT bands (not shown) because the total energy isfixed (the transforms all preserve total energy). The mean entropy for all 64 subimages is 1.3622 bit/pel, which comparesfavourably with the 1.6103 bit/pel for the 4-level Haar transformed subimages using the same Q step 15 .

(a) Basis functions of the 8 8 DCT; (b) Lenna transformed by the 8 8 DCT; (c) reordered into subimages grouped by coefficient type; (d) top left 4 subimages from (c).
The probabilities p i and entropies h i for the 4 subimages from the top left of the 8 8 DCT ((d) of ).
(a) Mesh and (b) row plots of the entropies of the subimages of (c) of .
Lenna transformed by the 4 4 DCT (a) and 16 16 DCT (b).

What is the optimum dct size?

This is a similar question to: What is the optimum number of levels for the Haar transform?

We have analysed Lenna using DCT sizes from 2 2 to 16 16 to investigate this. shows the 4 4 and 16 16 sets of DCT subimages. The 2 2 DCT is identical to the level 1 Haar transform (so see (b) of ) and the 8 8 set is in (c) of .

and show the mesh plots of the entropies of the subimages in .

compares the total entropy per pel for the 4 DCT sizes with the equivalent 4 Haartransform sizes. We see that the DCT is significantly better than the rather simpler Haar transform.

As regards the optimum DCT size, from , the 16 16 DCT seems to be marginally better than the 8 8 DCT, but subjectively this is not the case since quantisation artefacts become more visible as the block sizeincreases. In practise, for a wide range of images and viewing conditions, 8 8 has been found to be the optimum DCT block size and is specified in most current coding standards.

(a) Mesh and (b) row plots of the entropies of the 4 4 DCT in (a) of .
(a) Mesh and (b) row plots of the entropies of the 16 16 DCT in (b) of .
Comparison of the mean entropies of the Haar transform of Lenna at levels 1 to 4, and of the DCT for sizes from 2 2 to 16 16 pels with Q step 15 .

Get Jobilize Job Search Mobile App in your pocket Now!

Get it on Google Play Download on the App Store Now




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