OSA Imaging and Applied Optics Congress 2021 (3D, COSI, DH, ISA, pcAOP) 2021
DOI: 10.1364/dh.2021.dw5e.7
|View full text |Cite
|
Sign up to set email alerts
|

Fast Mapping of Double-Pixel Holograms using K-Nearest Neighbors

Abstract: We introduce an algorithm able to map arbitrary complex values into an arbitrary modulation curve using the K-Nearest Neighbor algorithm. The proposed algorithm is around 80 times faster than the conventional calculation.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(2 citation statements)
references
References 3 publications
0
2
0
Order By: Relevance
“…For instance, to generate a 768 Â 1024 pixels CGH, and since four pixels at the SLM plane provide one holographic cell, there are (768 Â 1024)/4 = 196,608 holographic cells that should be mapped among all accessible complex values. In [40], we presented a method using the k-NN classifier, which is able to generate DPHs 80 times faster than the conventional calculation.…”
Section: Fast Generating Dphs Using K-nnmentioning
confidence: 99%
“…For instance, to generate a 768 Â 1024 pixels CGH, and since four pixels at the SLM plane provide one holographic cell, there are (768 Â 1024)/4 = 196,608 holographic cells that should be mapped among all accessible complex values. In [40], we presented a method using the k-NN classifier, which is able to generate DPHs 80 times faster than the conventional calculation.…”
Section: Fast Generating Dphs Using K-nnmentioning
confidence: 99%
“…(7 -8). This realvalued distribution is introduced in the optical system using a computer generated hologram displayed on a liquid crystal device [61,62], as described in the next section (see Fig. 2c).…”
Section: Encoding Proceduresmentioning
confidence: 99%