| 000 | 03260nam a22004935i 4500 | ||
|---|---|---|---|
| 001 | 978-1-4471-2218-0 | ||
| 003 | DE-He213 | ||
| 005 | 20140220083731.0 | ||
| 007 | cr nn 008mamaa | ||
| 008 | 110826s2011 xxk| s |||| 0|eng d | ||
| 020 |
_a9781447122180 _9978-1-4471-2218-0 |
||
| 024 | 7 |
_a10.1007/978-1-4471-2218-0 _2doi |
|
| 050 | 4 | _aTA1637-1638 | |
| 050 | 4 | _aTA1637-1638 | |
| 072 | 7 |
_aUYT _2bicssc |
|
| 072 | 7 |
_aUYQV _2bicssc |
|
| 072 | 7 |
_aCOM012000 _2bisacsh |
|
| 072 | 7 |
_aCOM016000 _2bisacsh |
|
| 082 | 0 | 4 |
_a006.6 _223 |
| 082 | 0 | 4 |
_a006.37 _223 |
| 100 | 1 |
_aShukla, K.K. _eauthor. |
|
| 245 | 1 | 0 |
_aLossy Image Compression _h[electronic resource] : _bDomain Decomposition-Based Algorithms / _cby K.K. Shukla, M.V. Prasad. |
| 264 | 1 |
_aLondon : _bSpringer London, _c2011. |
|
| 300 |
_aXII, 89p. 54 illus., 4 illus. in color. _bonline resource. |
||
| 336 |
_atext _btxt _2rdacontent |
||
| 337 |
_acomputer _bc _2rdamedia |
||
| 338 |
_aonline resource _bcr _2rdacarrier |
||
| 347 |
_atext file _bPDF _2rda |
||
| 490 | 1 |
_aSpringerBriefs in Computer Science, _x2191-5768 |
|
| 505 | 0 | _aIntroduction -- Tree Triangular Coding Image Compression Algorithms -- Image Compression Using Quality Measures -- Parallel Image Compression Algorithms -- Conclusions and Future Directions. | |
| 520 | _aGood 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. | ||
| 650 | 0 | _aComputer science. | |
| 650 | 0 | _aComputer vision. | |
| 650 | 1 | 4 | _aComputer Science. |
| 650 | 2 | 4 | _aImage Processing and Computer Vision. |
| 700 | 1 |
_aPrasad, M.V. _eauthor. |
|
| 710 | 2 | _aSpringerLink (Online service) | |
| 773 | 0 | _tSpringer eBooks | |
| 776 | 0 | 8 |
_iPrinted edition: _z9781447122173 |
| 830 | 0 |
_aSpringerBriefs in Computer Science, _x2191-5768 |
|
| 856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/978-1-4471-2218-0 |
| 912 | _aZDB-2-SCS | ||
| 999 |
_c106179 _d106179 |
||