Recursive Block Coding for Image Data Compression

This title is printed to order. This book may have been self-published. If so, we cannot guarantee the quality of the content. In the main most books will have gone through the editing process however some may not. We therefore suggest that you be aware of this before ordering this book. If in doubt check either the author or publisher’s details as we are unable to accept any returns unless they are faulty. Please contact us if you have any questions.

Recursive Block Coding, a new image data compression technique that has its roots in noncausal models for 1d and 2d signals, is the subject of this book. The underlying theory provides a multitude of compression algorithms that encompass two course coding, quad tree coding, hybrid coding and so on. Since the noncausal models provide a fundamentally different image representation, they lead to new approaches to many existing algorithms, including useful approaches for asymmetric, progressive, and adaptive coding techniques. On the theoretical front, the basic result shows that a random field (an ensemble of images) can be coded block by block such that the interblock redundancy can be completely removed while the individual blocks are transform coded. On the practical side, the artifact of tiling, a block boundary effect, present in conventional block by block transform coding techniques has been greatly suppressed. This book contains not only a theoretical discussion of the algorithms but also exhaustive simulation and suggested methodologies for ensemble design techniques. Each of the resulting algorithms has been applied to twelve images over a wide range of image data rates and the results are reported using subjective descriptions, photographs, mathematical MSE values, and h-plots, a recently proposed graphical representation showing a high level of agreement with image quality as judged subjectively.