Vector quantisation compression of digital holograms of three-dimensional objects

Alison E. Shortt; Thomas J. Naughton; Bahram Javidi

doi:10.1117/12.605410

8 June 2005 Vector quantisation compression of digital holograms of three-dimensional objects

Alison E. Shortt, Thomas J. Naughton, Bahram Javidi

Proceedings Volume 5827, Opto-Ireland 2005: Photonic Engineering; (2005) https://doi.org/10.1117/12.605410
Event: OPTO-Ireland, 2005, Dublin, Ireland

Abstract

Digital holograms of real-world three-dimensional objects have been captured using phase-shift digital holography. These holograms have complex-valued pixels and a white noise appearance. Uniform and nonuniform scalar quantisation compression have already been applied to the hologram data with some success. Although each complex-valued pixel can itself be treated as a vector of length two, we extend the analysis using a multidimensional vector quantisation technique based on k-means clustering. This involves an a-by-b blockwise decomposition of the data and mapping it to an ab-dimensional space. Degradation due to lossy compression is measured in the reconstruction domain.

Citation Download Citation

Alison E. Shortt, Thomas J. Naughton, and Bahram Javidi "Vector quantisation compression of digital holograms of three-dimensional objects", Proc. SPIE 5827, Opto-Ireland 2005: Photonic Engineering, (8 June 2005); https://doi.org/10.1117/12.605410

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available