Lossy image compression : domain decomposition-based algorithms / K.K. Shukla, M.V. Prasad.
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 num...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Ebook |
| Language: | English |
| Published: |
London ; New York :
Springer,
[2011]
|
| Series: | SpringerBriefs in computer science.
|
| Subjects: | |
| Online Access: | Springer eBooks |
| Summary: | 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. |
|---|---|
| Physical Description: | 1 online resource (xii, 89 pages) : illustrations. |
| Bibliography: | Includes bibliographical references. |