関連する実験動画

Updated: Jun 28, 2026

Conducting Hyperscanning Experiments with Functional Near-Infrared Spectroscopy
06:42

Conducting Hyperscanning Experiments with Functional Near-Infrared Spectroscopy

Published on: January 19, 2019

シャック・ハートマン超解像度波面再構築のための周波数域フィルタリングベースのニューラルネットワーク

Xu Hou, Fujia Du, Xiushan Pan

    Optics express
    |February 20, 2026
    PubMed
    まとめ

    超高解像度波長の再構築のために,新しいディープラーニング方法である周波数領域フィルターベースのニューラルネットワーク (FF-Net) を開発しました. FF-Netは,次世代望遠鏡の波線感知解像度を大幅に向上させ,稀少なセンサーデータでも従来の方法の性能を上回ります.

    さらに関連する動画

    Functional Near-Infrared Spectroscopy Hyperscanning Study in Psychological Counseling06:04

    Functional Near-Infrared Spectroscopy Hyperscanning Study in Psychological Counseling

    Published on: January 17, 2025

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

    A Multimodal Wide-Field Fourier-Transform Raman Microscope

    Published on: December 30, 2025

    関連する概念動画

    Discrete-Time Fourier Series01:20

    Discrete-Time Fourier Series

    The Discrete-Time Fourier Series (DTFS) is a fundamental concept in signal processing, serving as the discrete-time counterpart to the continuous-time Fourier series. It allows for the representation and analysis of discrete-time periodic signals in terms of their frequency components. Unlike its continuous counterpart, which utilizes integrals, the calculation of DTFS expansion coefficients involves summations due to the discrete nature of the signal.
    For a discrete-time periodic signal x[n]...
    Discrete-time Fourier transform01:26

    Discrete-time Fourier transform

    The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
    One of the notable...
    Discrete Fourier Transform01:15

    Discrete Fourier Transform

    The Discrete Fourier Transform (DFT) is a fundamental tool in signal processing, extending the discrete-time Fourier transform by evaluating discrete signals at uniformly spaced frequency intervals. This transformation converts a finite sequence of time-domain samples into frequency components, each representing complex sinusoids ordered by frequency. The DFT translates these sequences into the frequency domain, effectively indicating the magnitude and phase of each frequency component present...
    Reconstruction of Signal using Interpolation01:10

    Reconstruction of Signal using Interpolation

    Signal processing techniques are essential for accurately converting continuous signals to digital formats and vice versa. When a continuous signal is sampled with a period T, the resulting sampled signal exhibits replicas of the original spectrum in the frequency domain, spaced at intervals equal to the sampling frequency. To handle this sampled signal, a zero-order hold method can be applied, which creates a piecewise constant signal by retaining each sample's value until the next sampling...
    Aliasing01:18

    Aliasing

    Accurate signal sampling and reconstruction are crucial in various signal-processing applications. A time-domain signal's spectrum can be revealed using its Fourier transform. When this signal is sampled at a specific frequency, it results in multiple scaled replicas of the original spectrum in the frequency domain. The spacing of these replicas is determined by the sampling frequency.
    If the sampling frequency is below the Nyquist rate, these replicas overlap, preventing the original signal...
    Linear Approximation in Frequency Domain01:26

    Linear Approximation in Frequency Domain

    Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
    In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear.