High-resolution Mesh-based Computer-generated Hologram Synthesis using Fast Fourier Transform with Graphics Processing Unit

Author(s):  
Han-Ju Yeom ◽  
Sanghoon Cheon ◽  
Keehoon Hong ◽  
Seoungbae Cho ◽  
Seungtaik Oh ◽  
...  
2012 ◽  
Vol 51 (30) ◽  
pp. 7303 ◽  
Author(s):  
Naoki Takada ◽  
Tomoyoshi Shimobaba ◽  
Hirotaka Nakayama ◽  
Atsushi Shiraki ◽  
Naohisa Okada ◽  
...  

2021 ◽  
Vol 20 (3) ◽  
pp. 1-22
Author(s):  
David Langerman ◽  
Alan George

High-resolution, low-latency apps in computer vision are ubiquitous in today’s world of mixed-reality devices. These innovations provide a platform that can leverage the improving technology of depth sensors and embedded accelerators to enable higher-resolution, lower-latency processing for 3D scenes using depth-upsampling algorithms. This research demonstrates that filter-based upsampling algorithms are feasible for mixed-reality apps using low-power hardware accelerators. The authors parallelized and evaluated a depth-upsampling algorithm on two different devices: a reconfigurable-logic FPGA embedded within a low-power SoC; and a fixed-logic embedded graphics processing unit. We demonstrate that both accelerators can meet the real-time requirements of 11 ms latency for mixed-reality apps. 1


2017 ◽  
Vol 29 (3) ◽  
Author(s):  
Simon Lucas Winberg ◽  
Moeko Ramone ◽  
Khagendra Naidoo

The Cape Floristic Kingdom (CFK) is the most diverse floristic kingdom in the world and has been declared an international heritage site. However, it is under threat from wild fires and invasive species. Much of the work of managing this natural resource, such as removing alien vegetation or fighting wild fires, is done by volunteers and casual workers. Many fynbos species, for which the Table Mountain National Park is known, are difficult to identify, particularly by non-expert volunteers. Accurate and fast identification of plant species would be beneficial in these contexts. The Fynbos Leaf Optical Recognition Application (FLORA) was thus developed to assist in the recognition of plants of the CFK. The first version of FLORA was developed as a rapid prototype in MATLAB; it utilized sequential algorithms to identify plant leaves, and much of this code was interpreted M files. The initial implementation suffered from slow performance, though, and could not run as a lightweight standalone executable, making it cumbersome. FLORA was thus re-developed as a standalone C++ version that was subsequently enhanced further by accelerating critical routines, by running them on a graphics processing unit (GPU). This paper presents the design and testing of both the C++ version and the GPU-accelerated version of FLORA. Comparative testing was done on all three versions of FLORA, viz., the original MATLAB prototype, the C++ non-accelerated version, and the C++ GPU-accelerated version to show the performance and accuracy of the different versions. The accuracy of the predictions remained consistent across versions. The C++ version was noticeable faster than the original prototype, achieving an average speed-up of 8.7 for high-resolution 3456x2304 pixel images. The GPU-accelerated version was even faster, saving 51.85 ms on average for high-resolution images. Such a time saving would be perceptible for batch processing, such as rebuilding feature descriptors for all the leaves in the leaf database. Further work on this project involves testing the system with a wider variety of leaves and trying different machine learning algorithms for the leaf prediction routines.


Geophysics ◽  
2019 ◽  
Vol 84 (1) ◽  
pp. A13-A17 ◽  
Author(s):  
Fredrik Andersson ◽  
Johan Robertsson

We have developed simple, fast, and accurate algorithms for the linear Radon ([Formula: see text]-[Formula: see text]) transform and its inverse. The algorithms have an [Formula: see text] computational complexity in contrast to the [Formula: see text] cost of a direct implementation in 2D and an [Formula: see text] computational complexity compared to the [Formula: see text] cost of a direct implementation in 3D. The methods use Bluestein’s algorithm to evaluate discrete nonstandard Fourier sums, and they need, apart from the fast Fourier transform (FFT), only multiplication of chirp functions and their Fourier transforms. The computational cost and accuracy are thus reduced to that inherited by the FFT. Fully working algorithms can be implemented in a couple of lines of code. Moreover, we find that efficient graphics processing unit (GPU) implementations could achieve processing speeds of approximately [Formula: see text], implying that the algorithms are I/O bound rather than compute bound.


Sign in / Sign up

Export Citation Format

Share Document