Lossy Image Compression Domain Decomposition-Based Algorithms /

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...

Πλήρης περιγραφή

Λεπτομέρειες βιβλιογραφικής εγγραφής
Κύριοι συγγραφείς: Shukla, K.K (Συγγραφέας), Prasad, M.V (Συγγραφέας)
Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
Γλώσσα:English
Έκδοση: London : Springer London, 2011.
Σειρά:SpringerBriefs in Computer Science,
Θέματα:
Διαθέσιμο Online:Full Text via HEAL-Link
LEADER 03274nam a22004935i 4500
001 978-1-4471-2218-0
003 DE-He213
005 20151204163042.0
007 cr nn 008mamaa
008 110826s2011 xxk| s |||| 0|eng d
020 |a 9781447122180  |9 978-1-4471-2218-0 
024 7 |a 10.1007/978-1-4471-2218-0  |2 doi 
040 |d GrThAP 
050 4 |a TA1637-1638 
050 4 |a TA1634 
072 7 |a UYT  |2 bicssc 
072 7 |a UYQV  |2 bicssc 
072 7 |a COM012000  |2 bisacsh 
072 7 |a COM016000  |2 bisacsh 
082 0 4 |a 006.6  |2 23 
082 0 4 |a 006.37  |2 23 
100 1 |a Shukla, K.K.  |e author. 
245 1 0 |a Lossy Image Compression  |h [electronic resource] :  |b Domain Decomposition-Based Algorithms /  |c by K.K. Shukla, M.V. Prasad. 
264 1 |a London :  |b Springer London,  |c 2011. 
300 |a XII, 89 p. 54 illus., 4 illus. in color.  |b online resource. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
347 |a text file  |b PDF  |2 rda 
490 1 |a SpringerBriefs in Computer Science,  |x 2191-5768 
505 0 |a Introduction -- Tree Triangular Coding Image Compression Algorithms -- Image Compression Using Quality Measures -- Parallel Image Compression Algorithms -- Conclusions and Future Directions. 
520 |a 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. 
650 0 |a Computer science. 
650 0 |a Image processing. 
650 1 4 |a Computer Science. 
650 2 4 |a Image Processing and Computer Vision. 
700 1 |a Prasad, M.V.  |e author. 
710 2 |a SpringerLink (Online service) 
773 0 |t Springer eBooks 
776 0 8 |i Printed edition:  |z 9781447122173 
830 0 |a SpringerBriefs in Computer Science,  |x 2191-5768 
856 4 0 |u http://dx.doi.org/10.1007/978-1-4471-2218-0  |z Full Text via HEAL-Link 
912 |a ZDB-2-SCS 
950 |a Computer Science (Springer-11645)