Markov speckle for efficient random bit generation
Abstract
Optical speckle is commonly observed in measurements using coherent radiation. While lacking experimental validation, previous work has often assumed that speckle's random spatial pattern follows a Markov process. Here, we present a derivation and experimental confirmation of conditions under which this assumption holds true. We demonstrate that a detected speckle field can be designed to obey the first-order Markov property by using a Cauchy attenuation mask to modulate scattered light. Creating Markov speckle enables the development of more accurate and efficient image post-processing algorithms, with applications including improved de-noising, segmentation and super-resolution. To show its versatility, we use the Cauchy mask to maximize the entropy of a detected speckle field with fixed average speckle size, allowing cryptographic applications to extract a maximum number of useful random bits from speckle images.
Additional Information
© 2012 Optical Society of America. Original Manuscript: October 1, 2012. Revised Manuscript: October 30, 2012. Manuscript Accepted: October 31, 2012. Published: November 8, 2012. RH was supported in part by the National Defense Science and Engineering Graduate Fellowship Program. RYC was supported by Joel A. Tropp under AFOSR award FA9550-09-1-0643.Attached Files
Published - oe-20-24-26394.pdf
Files
Name | Size | Download all |
---|---|---|
md5:ba91e78e234006e18695662a3729f933
|
3.6 MB | Preview Download |
Additional details
- Eprint ID
- 36486
- Resolver ID
- CaltechAUTHORS:20130118-151818356
- Air Force Office of Scientific Research (AFOSR)
- FA9550-09-1-0643
- National Defense Science and Engineering Graduate (NDSEG) Fellowship
- Created
-
2013-01-18Created from EPrint's datestamp field
- Updated
-
2021-11-09Created from EPrint's last_modified field