Contact
How to shop
Delivery
Shopping guide
Recursive Block Coding for Image Data Compression
English
249 b
Delivery to Austria
Up to 30 days for returns
Customers also purchased
/
Adobe ePub DRM
2.79
€
/
Paperback
35.90
€
/
Hardback
119.95
€
/
Paperback
18.99
€
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.
About the book
English
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Paperback
19.30
€
/
Hardback
27.99
€
/
Paperback
36.00
€
/
Paperback
17.59
€
Hi! I'm Libroamiko, your book advisor.
How can I help you?