DCTTransforandItsIpleentation.ppt

* * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * * ME DCT 2008 VCLab ME DCT 2008 VCLab DCT Transform and Its Implementation * ME DCT 2008 VCLab * Discrete Cosine Transform The most efficient suboptimum transform the elements of the kth basis vector: cos(k?(2n+1)/2N)s It has the advantage over all other suboptimum transforms in that its basis vectors resemble closely the basis vectors of the KLT for smoothly varying video inputs. (for a first-order Markov source model) The n-point DCT can be computed as a 2n-point DFT * ME DCT 2008 VCLab * Transform Coding System Forward transform Quantizer Binary encoder Inverse transform Inverse quantizer Binary decoder Network Input samples Output samples ÷10 ×10 e.g. zip, RAR Huffman coding * ME DCT 2008 VCLab * Representation of An Image How to code an image? Spatial domain (pixel-based) Transform domain * ME DCT 2008 VCLab * Use cosine function as its basis function Performance approaches KLT Fast algorithm exists Most popular in image compression applications Why Use DCT? Properties of DCT * ME DCT 2008 VCLab * Does Transform Really Make Sense ? Energy compaction De-correlation: dependency elimination * ME DCT 2008 VCLab * An Example 8 8 139 148 150 149 155 164 165 168 98 115 130 135 143 146 142 147 89 110 125 128 129 121 104 106 96 116 128 132 134 132 113 109 111 125 127 131 137 137 120 110 122 126 126 131 133 131 126 112 13