The ordinary DCT coding techniques always classify the image into 4 classes, then select suitable bitmaps for the 4 classes. This is not enough for complicated images. In order to encode the image in more detail, the authors classify the image into 16 classes. This classification can reduce the artifacts which are caused by the ordinary coding scheme. However, it will take a lot of time to generate the 16 bitmaps for the 16-class classification. Besides, it will take a very large overhead to transmit the 16 bitmaps. In order to solve the deficiency, the authors developed the concept of global bitmaps of 16 classes which can be used for all the images. As to the side information of the classification, the authors use the idea of the finite state machine to predict the current class from the previously classes. Thus, the overhead of the class will be reduced. The experimental results show that the performance of the coding system is very good and the prediction correct ratio can be over 70% in the Lena image.<>
Finite state DCT with global bitmap image coding
01.01.1994
346271 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
Finite State DCT with Global Bitmap Image Coding
British Library Conference Proceedings | 1994
|Bitmap Index-Based Decision Trees
British Library Conference Proceedings | 2005
|Bitmap-Oriented Approach to Character Recognition
British Library Online Contents | 2003
|Bitmap-Oriented Approach to Character Recognition
British Library Online Contents | 2003
|Resampling detection aided steganalysis of heterogeneous bitmap images
British Library Online Contents | 2013
|