Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
×
The recurrence relation calculates a CGH 7 or 8 times faster than the conventional CGH formula on a CPU and graphics processing unit (GPU). In addition, there ...
We proposed a fast CGH calculation method using an RLE based recurrence relation. Our method eliminates the need for random memory access in the sequence of ...
The recurrence relation calculates a CGH 7 or 8 times faster than the conventional CGH formula on a CPU and graphics processing unit (GPU). In addition, there ...
This study proposes a simple and fast cosine function approximation method for CGH calculation and succeeded in creating CGH with sufficient quality and ...
This paper presents a fast recurrence algorithm for a computer-generated-hologram (CGH). The recurrence algorithm based on Taylor expansion can reduce the ...
Missing: relation | Show results with:relation
In this study, we propose a fast CGH generation algorithm without random memory access using run-length encoding (RLE) based recurrence relation ...
In this study, we propose a fast CGH generation algorithm without random memory access using run-length encoding (RLE) based recurrence relation. As a ...
People also ask
This study proposes a fast CGH generation algorithm without random memory access using run-length encoding (RLE) based recurrence relation and succeeds in ...
A method for accelerating the synthesis of computer-generated three-dimensional 共3-D兲 holograms, based on conventional ray tracing, is proposed.
Sep 11, 2013 · Abstract. We report fast computation of computer-generated holograms (CGHs) using Xeon Phi coproces- sors, which have massively x86-based ...