Skip to main content

Parallel Image Compression Algorithms

  • Chapter
  • First Online:
Lossy Image Compression

Part of the book series: SpringerBriefs in Computer Science ((BRIEFSCOMPUTER))

  • 786 Accesses

Abstract

This Chapter presents parallel version of domain decomposition algorithms on different architectures like Concurrent Read Exclusive Write (CREW) Parallel Random Access Machine (PRAM), Hypercube, 2D Mesh, and Sparse Mesh. Time complexities of these algorithms are also derived. Implementation of the domain decomposition algorithm on Parallel Virtual Machine (PVM) environment using Master–slave paradigm has been described. Parallel program profiles and speed up measurements are given.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. http://www.nas.nasa.gov/pubs/techsum/9495/final31398.html

  2. Stauffer LM (1997) Dictionary compression on PRAM. Parallel Process Lett 7(3):297–308

    Article  MathSciNet  Google Scholar 

  3. http://www.npac.syr/edu/education/pub/demos/paralleljpeg.html

  4. Jacson Dj, Mohmoud W (1996) Parallel pipelined fractal image compression using quadtree decomposition. Comput J 39(1):1–13

    Article  Google Scholar 

  5. Jiang W, Bruton L (1998) Lossless color image compression using chromatic correlation. In: IEEE proceedings of data compression conference

    Google Scholar 

  6. Patterson DA, Hennessy JL (1990) Computer architecture: a quantitative approach. Morgan Kaufman Publishers, San Mateo

    Google Scholar 

  7. Cook GW, Delp J (1994) An investigation of JPEG image and video compression using parallel processing. In: Proceedings Of ICASSP, pp 437–440

    Google Scholar 

  8. Cook GW, Delp DJ (1996) An investigation of scalable SIMD I/O techniques with application to parallel JPEG compression. J Parallel Distrib Comput 53:111–128

    Google Scholar 

  9. Sibeyn JF (2000) Solving fundamental problems on sparse-meshes. IEEE Trans Parallel Distrib Sys 11(12):1324–1332

    Article  Google Scholar 

  10. Shen K, Cook GW, Jamieson LH, Delp EJ (1994) An overview of parallel processing approach to image and video compression. In: Proceedings of SPIE, pp 197–208

    Google Scholar 

  11. Lee SS, Tanaka HT (2000) Parallel image segmentation with adaptive mesh. In: Proceedings of the international conference on pattern recognition (ICPR), pp 1635–1639

    Google Scholar 

  12. Lee S, Omachiand S, Aso H (2000) A parallel architecture for quadtree based fractal image compression. In: Proceedings of international conference on parallel processing (ICPP), pp 15–24

    Google Scholar 

  13. Jacson DJ, Blom T (1995) A parallel fractal image compression algorithm for hypercube multiprocessors. In: Proceedings of 27th southeastern symposium on system theory, pp 274–278

    Google Scholar 

  14. Miguet S, Pierson JM (2000) Quality and complexity bounds of load balancing algorithms for parallel image processing. Int J Pattern Recognit Artif Intell 14(4):463–476

    Article  Google Scholar 

  15. Selim G. Akl (1989) The design and analysis of parallel algorithms. Prentice Hall Inc, Upper Saddle River, pp 26–98

    Google Scholar 

  16. http://www.netlib.org/pvm3/book/pvm-book.html

  17. Miyahara M, Kotani K, Ralph Algazi V (1998) Objective picture quality scale (PQS) for image coding. IEEE Trans image process 46(5):1215–1225

    Google Scholar 

  18. Jackson DJ, Humphres CW (1997) A simple yet effective load balancing to the PVM software system. Parallel Comput 22:1647–1660

    Article  MATH  Google Scholar 

  19. Agastino SD (2001) Parallelism and dictionary based data compression. Inf Sci 135:43–56

    Article  Google Scholar 

  20. Giolmas N, Watson DW, Chelberg DM, Henstock PV, Yi JH, Siegel H (1999) Aspects of computational mode and data distribution for parallel range image segmentation. Parallel Comput 25:499–523

    Article  MATH  Google Scholar 

  21. Redford J (2003) Parallelizing JPEG, In: SPC Proceedings, Dallas, 21 March–3 April 2003

    Google Scholar 

  22. Lee SS, Tanaka HT (2000) Parallel image segmentation with adaptive mesh. In: Proceedings of the international conference on pattern recognition (ICPR), pp 1635–1639

    Google Scholar 

  23. Lee S, Omachiand S, Aso H (2000) A parallel architecture for quadtree based fractal image compression. In: Proceedings of international conference on parallel processing (ICPP), pp 15–24

    Google Scholar 

  24. Prasad MVNK, Mishra VN, Shukla KK (2002) Implementation of BTTC image compression algorithm on parallel virtual machine. J Comput Soc India 32(3):1–8, ISSN 0254-7813

    Google Scholar 

  25. Akl SG (1989) The design and analysis of parallel algorithms. Prentice Hall Inc., Englewood Cliffs, pp 26–98

    Google Scholar 

  26. Prasad MVNK, Mishra VN, Shukla KK (2002) Implementation of BTTC image compression algorithm on parallel virtual machine (PVM). J Comput Soc India 32(3):31–38

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to K. K. Shukla .

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag London Limited

About this chapter

Cite this chapter

Shukla, K.K., Prasad, M.V. (2011). Parallel Image Compression Algorithms. In: Lossy Image Compression. SpringerBriefs in Computer Science. Springer, London. https://doi.org/10.1007/978-1-4471-2218-0_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-4471-2218-0_4

  • Published:

  • Publisher Name: Springer, London

  • Print ISBN: 978-1-4471-2217-3

  • Online ISBN: 978-1-4471-2218-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics