Related Experiment Video

Updated: Mar 26, 2026

Recording Ultra-Realistic Full-Color Analog Holograms for Use in a Moving Hologram Display
09:04

Recording Ultra-Realistic Full-Color Analog Holograms for Use in a Moving Hologram Display

Published on: January 14, 2020

10.4K

Fast calculation method of computer generated hologram animation for viewpoint parallel shift and rotation using

Ryosuke Watanabe, Kazuhiro Yamaguchi, Yuji Sakamoto

    Applied Optics
    |February 3, 2016
    PubMed
    Summary

    A new method significantly speeds up computer-generated hologram (CGH) animations for viewpoint movement. This technique offers over six times faster calculations with minimal impact on hologram quality.

    More Related Videos

    Transmission of Multiple Signals through an Optical Fiber Using Wavefront Shaping09:43

    Transmission of Multiple Signals through an Optical Fiber Using Wavefront Shaping

    Published on: March 20, 2017

    10.4K
    A Multimodal Wide-Field Fourier-Transform Raman Microscope06:48

    A Multimodal Wide-Field Fourier-Transform Raman Microscope

    Published on: December 30, 2025

    733

    Related Concept Videos

    Relative Motion Analysis using Rotating Axes01:25

    Relative Motion Analysis using Rotating Axes

    Consider a component AB undergoing a linear motion. Along with a linear motion, point B also rotates around point A. To comprehend this complex movement, position vectors for both points A and B are established using a stationary reference frame.
    However, to express the relative position of point B relative to point A, an additional frame of reference, denoted as x'y', is necessary. This additional frame not only translates but also rotates relative to the fixed frame, making it...
    1.1K
    Fast Fourier Transform01:10

    Fast Fourier Transform

    The Fast Fourier Transform (FFT) is a computational algorithm designed to compute the Discrete Fourier Transform (DFT) efficiently. By breaking down the calculations into smaller, manageable sections, the FFT significantly reduces the computational complexity involved. Direct computation of an N-point DFT requires N2 complex multiplications, whereas the FFT algorithm needs only (N/2)log⁡2N multiplications, offering a much faster performance.
    The computational efficiency of the FFT becomes...
    1.2K
    Relative Motion Analysis using Rotating Axes-Problem Solving01:29

    Relative Motion Analysis using Rotating Axes-Problem Solving

    Consider a crane whose telescopic boom rotates with an angular velocity of 0.04 rad/s and angular acceleration of 0.02 rad/s2. Along with the rotation, the boom also extends linearly with a uniform speed of 5 m/s. The extension of the boom is measured at point D, which is measured with respect to the fixed point C on the other end of the boom. For the given instant, the distance between points C and D is 60 meters.
    Here, in order to determine the magnitude of velocity and acceleration for point...
    832
    Continuous -time Fourier Transform01:11

    Continuous -time Fourier Transform

    The Fourier series is instrumental in representing periodic functions, offering a powerful method to decompose such functions into a sum of sinusoids. This technique, however, necessitates modification when applied to nonperiodic functions. Consider a pulse-train waveform consisting of a series of rectangular pulses. When these pulses have a finite period, they can be accurately represented by a Fourier series. Yet, as the period approaches infinity, resulting in a single, isolated pulse, the...
    1.1K
    Relative Motion Analysis using Rotating Axes - Acceleration01:22

    Relative Motion Analysis using Rotating Axes - Acceleration

    Consider a component AB undergoing a linear motion. Along with a linear motion, point B also rotates around point A. To comprehend this complex movement, position vectors for both points A and B are established using a stationary reference frame. The absolute velocity of point B is determined by adding the absolute velocity of point A, the relative velocity of point B in the rotating frame, and the effects caused by the angular velocity within the rotating frame.
    Time differentiation is...
    996
    Parseval's Theorem for Fourier transform01:15

    Parseval's Theorem for Fourier transform

    Parseval's theorem is a fundamental principle in signal processing that enables the calculation of a signal's energy in either the time domain or the frequency domain. This theorem is pivotal in demonstrating energy conservation between these two domains, ensuring that the computed energy value remains consistent regardless of the domain of analysis.
    To understand Parseval's theorem, it is essential to first comprehend how signal energy is typically calculated. When considering a...
    2.5K