Lossy Image Compression: Domain Decomposition-Based Algorithms: SpringerBriefs in Computer Science
Autor K K Shukla, M. V. Prasaden Limba Engleză Paperback – 28 aug 2011
Din seria SpringerBriefs in Computer Science
- 20% Preț: 290.23 lei
- Preț: 466.24 lei
- 20% Preț: 319.07 lei
- Preț: 437.49 lei
- 20% Preț: 166.97 lei
- 20% Preț: 120.62 lei
- 20% Preț: 335.65 lei
- 20% Preț: 398.70 lei
- 20% Preț: 316.51 lei
- 20% Preț: 316.32 lei
- 20% Preț: 315.87 lei
- 20% Preț: 315.37 lei
- Preț: 367.91 lei
- 20% Preț: 227.94 lei
- 20% Preț: 316.51 lei
- 20% Preț: 317.65 lei
- 20% Preț: 315.69 lei
- 20% Preț: 316.01 lei
- 20% Preț: 316.83 lei
- 20% Preț: 317.65 lei
- 20% Preț: 316.96 lei
- 20% Preț: 315.69 lei
- 20% Preț: 315.55 lei
- 20% Preț: 316.96 lei
- Preț: 366.58 lei
- Preț: 341.50 lei
- 20% Preț: 317.97 lei
- Preț: 337.56 lei
- Preț: 369.23 lei
- Preț: 369.62 lei
- 20% Preț: 317.65 lei
- 20% Preț: 345.18 lei
- 20% Preț: 314.87 lei
- 20% Preț: 315.69 lei
- 20% Preț: 317.65 lei
- 20% Preț: 315.55 lei
- Preț: 366.95 lei
- 20% Preț: 313.76 lei
- 20% Preț: 316.83 lei
- 20% Preț: 317.65 lei
- 20% Preț: 227.12 lei
- 20% Preț: 294.95 lei
- 20% Preț: 316.01 lei
- Preț: 400.02 lei
- 20% Preț: 315.05 lei
- 20% Preț: 316.83 lei
- 20% Preț: 316.51 lei
- 20% Preț: 317.29 lei
- 20% Preț: 317.29 lei
Preț: 316.51 lei
Preț vechi: 395.64 lei
-20% Nou
Puncte Express: 475
Preț estimativ în valută:
60.57€ • 62.92$ • 50.32£
60.57€ • 62.92$ • 50.32£
Carte tipărită la comandă
Livrare economică 01-15 februarie 25
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9781447122173
ISBN-10: 1447122178
Pagini: 138
Ilustrații: XII, 89 p. 54 illus., 4 illus. in color.
Dimensiuni: 155 x 235 x 10 mm
Greutate: 0.16 kg
Ediția:2011
Editura: SPRINGER LONDON
Colecția Springer
Seria SpringerBriefs in Computer Science
Locul publicării:London, United Kingdom
ISBN-10: 1447122178
Pagini: 138
Ilustrații: XII, 89 p. 54 illus., 4 illus. in color.
Dimensiuni: 155 x 235 x 10 mm
Greutate: 0.16 kg
Ediția:2011
Editura: SPRINGER LONDON
Colecția Springer
Seria SpringerBriefs in Computer Science
Locul publicării:London, United Kingdom
Public țintă
ResearchCuprins
Introduction.- Tree Triangular Coding Image Compression Algorithms.- Image Compression Using Quality Measures.- Parallel Image Compression Algorithms.- Conclusions and Future Directions.
Recenzii
From the reviews:
“The book is devoted to lossy image compression domain decomposition-based algorithms. In the book five such algorithms, based on different triangulation methods, are presented and their performance on sequential and parallel computers is evaluated. … It is presented in an accessible fashion with many illustrations and algorithms. It is suitable for researchers interested in modern methods of lossy image compression on both sequential and parallel architectures and for all who are interested in recent research in domain based lossy image compression.” (Agnieszka Lisowska, Zentralblatt MATH, Vol. 1235, 2012)
“The book is devoted to lossy image compression domain decomposition-based algorithms. In the book five such algorithms, based on different triangulation methods, are presented and their performance on sequential and parallel computers is evaluated. … It is presented in an accessible fashion with many illustrations and algorithms. It is suitable for researchers interested in modern methods of lossy image compression on both sequential and parallel architectures and for all who are interested in recent research in domain based lossy image compression.” (Agnieszka Lisowska, Zentralblatt MATH, Vol. 1235, 2012)
Textul de pe ultima copertă
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:
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.
Caracteristici
Introduces new image compression algorithms and their implementation Provides a detailed discussion of fuzzy geometry measures and their application in image compression algorithms Describes parallel implementation of image compression algorithms on a cluster in Parallel Virtual Machine environment