相关实验视频

Updated: Sep 16, 2025

Lensless Fluorescent Microscopy on a Chip
11:23

Lensless Fluorescent Microscopy on a Chip

Published on: August 17, 2011

17.8K

里埃卷积解码器:通过深度学习重建太阳耀斑图像

Merve Selcuk-Simsek1, Paolo Massa1, Hualin Xiao1

  • 1Institute for Data Science, School of Computer Science, University of Applied Sciences and Arts Northwestern Switzerland FHNW, Bahnhofstrasse 6, 5210 Windisch, Switzerland.

Neural computing & applications
|July 10, 2025
PubMed
概括

我们开发了一种快速的里埃卷积解码器 (FCD) 用于天文图像重建. 这种人工智能模型显著加速图像处理,在模拟和真实太阳能数据上表现优于传统方法.

关键词:
自动编码器自动编码器深度学习是一种深度学习.图像重建 图像重建太阳耀斑成像 太阳耀斑成像在X射线成像中使用X射线成像.

更多相关视频

Time-Lapse Imaging of Neuronal Arborization using Sparse Adeno-Associated Virus Labeling of Genetically Targeted Retinal Cell Populations13:13

Time-Lapse Imaging of Neuronal Arborization using Sparse Adeno-Associated Virus Labeling of Genetically Targeted Retinal Cell Populations

Published on: March 19, 2021

3.0K
Live Images of GLUT4 Protein Trafficking in Mouse Primary Hypothalamic Neurons Using Deconvolution Microscopy08:47

Live Images of GLUT4 Protein Trafficking in Mouse Primary Hypothalamic Neurons Using Deconvolution Microscopy

Published on: December 7, 2017

9.9K

相关概念视频

Deconvolution01:20

Deconvolution

Deconvolution, also known as inverse filtering, is the process of extracting the impulse response from known input and output signals. This technique is vital in scenarios where the system's characteristics are unknown, and they must be inferred from the observable signals.
Deconvolution involves several mathematical techniques to derive the impulse response. One common approach is polynomial division. In this method, the input and output sequences are treated as coefficients of...
262
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...
479
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...
351
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...
418
Convolution: Math, Graphics, and Discrete Signals01:24

Convolution: Math, Graphics, and Discrete Signals

In any LTI (Linear Time-Invariant) system, the convolution of two signals is denoted using a convolution operator, assuming all initial conditions are zero. The convolution integral can be divided into two parts: the zero-input or natural response and the zero-state or forced response, with t0 indicating the initial time.
To simplify the convolution integral, it is assumed that both the input signal and impulse response are zero for negative time values. The graphical convolution process...
429
Convolution Properties II01:17

Convolution Properties II

The important convolution properties include width, area, differentiation, and integration properties.
The width property indicates that if the durations of input signals are T1 and T2, then the width of the output response equals the sum of both durations, irrespective of the shapes of the two functions. For instance, convolving two rectangular pulses with durations of 2 seconds and 1 second results in a function with a width of 3 seconds.
The area property asserts that the area under the...
292