<p><p>Good quality digital images have high storage and bandwidth requirements. In modern times, with increasing user expectation for image quality, efficient compression is necessary to keep memory and transmission time within reasonable limits.</p><p>Image compression is concerned with minimizatio
Lossy Image Compression: Domain Decomposition-Based Algorithms
โ Scribed by K.K. Shukla, M.V. Prasad (auth.)
- Publisher
- Springer-Verlag London
- Year
- 2011
- Tongue
- English
- Leaves
- 98
- Series
- SpringerBriefs in Computer Science
- Edition
- 1
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
Good quality digital images have high storage and bandwidth requirements. In modern times, with increasing user expectation for image quality, efficient compression is necessary to keep memory and transmission time within reasonable limits.
Image compression is concerned with minimization of the number of information carrying units used to represent an image. Lossy compression techniques incur some loss of information which is usually imperceptible. In return for accepting this distortion, we obtain much higher compression ratios than is possible with lossless compression.
Salient features of this book include:
- Four new image compression algorithms and implementation of these algorithms
- Detailed discussion of fuzzy geometry measures and their application in image compression algorithms
- New domain decomposition based algorithms using image quality measures and study of various quality measures for gray scale image compression
- Compression algorithms for different parallel architectures and evaluation of time complexity for encoding on all architectures
- Parallel implementation of image compression algorithms on a cluster in Parallel Virtual Machine (PVM) environment.
This book will be of interest to graduate students, researchers and practicing engineers looking for new image compression techniques that provide good perceived quality in digital images with higher compression ratios than is possible with conventional algorithms.
โฆ Table of Contents
Front Matter....Pages i-xii
Introduction....Pages 1-11
Tree Triangular Coding Image Compression Algorithms....Pages 13-41
Image Compression Using Quality Measures....Pages 43-64
Parallel Image Compression Algorithms....Pages 65-86
Conclusions and Future Directions....Pages 87-89
โฆ Subjects
Image Processing and Computer Vision
๐ SIMILAR VOLUMES
<p><p>Good quality digital images have high storage and bandwidth requirements. In modern times, with increasing user expectation for image quality, efficient compression is necessary to keep memory and transmission time within reasonable limits.</p><p>Image compression is concerned with minimizatio
<p><P>From the reviews of the first edition:</P><P></P><P>"This book unifies the results from a number of papers by the authors and their coworkers over the past two decades, and complements them by new insights and some background. The distinguishing feature of this book is a comprehensive and rigo
<p><P>From the reviews of the first edition:</P><P></P><P>"This book unifies the results from a number of papers by the authors and their coworkers over the past two decades, and complements them by new insights and some background. The distinguishing feature of this book is a comprehensive and rigo
<p>Digital image business applications are expanding rapidly, driven by recent advances in the technology and breakthroughs in the price and performance of hardware and firmware. This ever increasing need for the storage and transmission of images has in turn driven the technology of image compressi