Synthesis of three-dimensional light fields with binary spatial light modulators

Ulusoy, Erdem; Onural, Levent; Özaktaş, Haldun M.

doi:10.1364/josaa.28.001211

Cited by 8 publications

(6 citation statements)

References 64 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Here, U and a are vectors that have lengths T and N, respectively; G is a T × N matrix. Note that the total number of parallel Gaussian beams used in the decomposition is equal to N (the degree of freedom of the signal space), that is, MK N. We form the system matrix G as G g 11 r − s 11 jg 12 r − s 12 j…jg MK r − s MK (21) and the coefficients vector a as a a 11 ; a 12 ; …; a MK T :…”

Section: Simulation Resultsmentioning

confidence: 99%

See 1 more Smart Citation

Calculation of the scalar diffraction field from curved surfaces by decomposing the three-dimensional field into a sum of Gaussian beams

Şahin

Onural

2013

J. Opt. Soc. Am. A

Self Cite

View full text Add to dashboard Cite

We present a local Gaussian beam decomposition method for calculating the scalar diffraction field due to a two-dimensional field specified on a curved surface. We write the three-dimensional field as a sum of Gaussian beams that propagate toward different directions and whose waist positions are taken at discrete points on the curved surface. The discrete positions of the beam waists are obtained by sampling the curved surface such that transversal components of the positions form a regular grid. The modulated Gaussian window functions corresponding to Gaussian beams are placed on the transversal planes that pass through the discrete beam-waist position. The coefficients of the Gaussian beams are found by solving the linear system of equations where the columns of the system matrix represent the field patterns that the Gaussian beams produce on the given curved surface. As a result of using local beams in the expansion, we end up with sparse system matrices. The sparsity of the system matrices provides important advantages in terms of computational complexity and memory allocation while solving the system of linear equations.

show abstract

Section: Simulation Resultsmentioning

confidence: 99%

“…(24). The mentioned expression, which is based on the Rayleigh-Sommerfeld diffraction model, gives the scalar 3D field corresponding to a modulated Gaussian window function quite accurately even for nonparaxial cases [8,21].…”

Section: Simulation Resultsmentioning

confidence: 99%

Calculation of the scalar diffraction field from curved surfaces by decomposing the three-dimensional field into a sum of Gaussian beams

Şahin

Onural

2013

J. Opt. Soc. Am. A

Self Cite

View full text Add to dashboard Cite

show abstract

“…Thus, there is a limit to the degree of blurring we can tolerate. It is well known that the light field produced by a pixellated SLM consists of diffraction orders, which are shifted, modulated, and dispersed versions of each other, so they essentially carry the same information [15,29,30]. The order that has the lowest frequency content is called the central order.…”

Section: A Lsi System To Form the Weighted Superposition Of Binary Slmsmentioning

confidence: 99%

“…One approach is to devise coding methods such that the ideal complex-valued CGH that generates a desired light field is encoded in a CGH that is suitable for writing on the physical SLM [5,6]. Many different encoding methods for multilevel amplitude-only, multilevel phase-only, and binary SLMs have been proposed [7][8][9][10][11][12][13][14][15]. In these methods, when the observation region is considered, the actual SLM behaves like a lower-resolution full-complex SLM.…”

Section: Introductionmentioning

confidence: 99%

Full-complex amplitude modulation with binary spatial light modulators

2011

Self Cite

View full text Add to dashboard Cite

Imperfections and nonrobust behavior of practical multilevel spatial light modulators (SLMs) degrade the performance of many proposed full-complex amplitude modulation schemes. We consider the use of more robust binary SLMs for this purpose. We propose a generic method, by which, out of K binary (or 1 bit) SLMs of size M×N, we effectively create a new 2(K)-level (or K bit) SLM of size M×N. The method is a generalization of the well-known concepts of bit plane representation and decomposition for ordinary gray scale digital images and relies on forming a properly weighted superposition of binary SLMs. When K is sufficiently large, the effective SLM can be regarded as a full-complex one. Our method is as efficient as possible from an information theoretical perspective. A 4f system is discussed as a possible optical implementation. This 4f system also provides a means for eliminating the undesirable higher diffraction orders. The components of the 4f system can easily be customized for different production technologies.

show abstract

“…Many algorithms are proposed for various SLM types. [18,19] investigate the CGH computation for amplitude-only and amplitude mostly SLMs, while [20,21] explore the binary SLM case. Most algorithms, however, are proposed for phase-only SLMs, due to their superior light efficiency and multilevel modulation capability [22][23][24][25][26][27].…”

Section: Introductionmentioning

confidence: 99%

Non-iterative phase hologram computation for low speckle holographic image projection

Mengü¹,

Ulusoy²,

Ürey³

2016

Opt. Express

Self Cite

View full text Add to dashboard Cite

Phase-only spatial light modulators (SLMs) are widely used in holographic display applications, including holographic image projection (HIP). Most phase computer generated hologram (CGH) calculation algorithms have an iterative structure with a high computational load, and also are prone to speckle noise, as a result of the random phase terms applied on the desired images to mitigate the encoding noise. In this paper, we present a non-iterative algorithm, where simple Discrete Fourier Transform (DFT) relations are exploited to compute phase CGHs that exactly control half of the desired image samples (those on even - or odd - indexed rows - or columns) via a single Fast Fourier Transform (FFT) and trivial arithmetic operations. The encoding noise appearing on the uncontrolled half of the image samples is reduced by the application of structured, non-random initial phase terms so that speckle noise is also kept low. High quality reconstructions are obtained under temporal averaging of several SLM frames. Interlaced video within half of the addressable image area is readily deliverable without frame rate division. Our algorithm provides about 6X and 20X reduction in computational cost compared to IFTA and FIDOC algorithms, respectively. Simulations and experiments verify that the algorithm constitutes a promising option for real-time computation of phase CGHs.

show abstract

Synthesis of three-dimensional light fields with binary spatial light modulators

Cited by 8 publications

References 64 publications

Calculation of the scalar diffraction field from curved surfaces by decomposing the three-dimensional field into a sum of Gaussian beams

Calculation of the scalar diffraction field from curved surfaces by decomposing the three-dimensional field into a sum of Gaussian beams

Full-complex amplitude modulation with binary spatial light modulators

Non-iterative phase hologram computation for low speckle holographic image projection

Contact Info

Product

Resources

About