相关实验视频
Updated: Jul 17, 2025

11:23
Lensless Fluorescent Microscopy on a Chip
Published on: August 17, 2011
17.7K
通过自适应频率分解网络进行低光图像增强.
Xiwen Liang1, Xiaoyan Chen2, Keying Ren1
1School of Electronic Information and Automation, Tianjin University of Science and Technology, Tianjin, 300222, China.
Scientific reports
|August 29, 2023
概括
本研究介绍了适应频率分解网络 (AFDNet),用于增强低光图像. 通过自适应地分解图像频率,AFDNet提高了可见性和细节性,优于现有的方法.
科学领域:
- 计算机视觉 计算机视觉
- 图像处理 图像处理
- 深度学习 (Deep Learning) 是一种深度学习.
背景情况:
- 低光照射图像的可见性较差,噪音较大,细节模糊.
- 现有的卷积神经网络 (CNN) 方法往往会放大噪音和模糊细节,因为频率信息处理不足.
研究的目的:
- 开发一个新的网络,即自适应频率分解网络 (AFDNet),用于有效的低光图像增强.
- 通过更好地利用图像频率特征来解决当前基于CNN的方法的局限性.
主要方法:
- 提出了一个自适应频率分解 (AFD) 模块,以适应地提取不同颗粒度的低频和高频信息.
- 采用低频信息来增强对比度和降低噪音,以及高频信息来恢复细节.
- 引入了新的频率损失功能,以确保不同频率组件的稳健恢复.
主要成果:
- 与各种数据集的最先进方法相比,AFDNet表现出优越的定量和视觉性能.
- 该网络有效地提高了图像的可见性,恢复细节,并在低光条件下抑制噪音.
- 使用AFDNet预处理图像显著提高了面部检测任务的性能.
结论:
- 通过智能处理频率信息,AFDNet提供了一种有效的解决方案,用于在低光条件下进行图像增强.
- 提出的方法克服了现有技术的局限性,提供了更好的视觉质量和细节恢复.
- AFDNet具有实际应用,增强后续计算机视觉任务,如面部检测.
相关概念视频
Downsampling
183
When considering a sampled sequence with zero values between sampling instants, one can replace it by taking every N-th value of the sequence. At these integer multiples of N, the original and sampled sequences coincide. This process, known as decimation, involves extracting every N-th sample from a sequence, thereby creating a more efficient sequence.
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...
The Fourier transform of the decimated sequence reveals a combination of scaled and shifted versions of the original spectrum. This...
183
Deconvolution
186
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...
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...
186
Upsampling
261
Managing signal sampling rates is essential in digital signal processing to maintain signal integrity. A decimated signal, characterized by a reduced frequency range due to its lower sampling rate, can be upsampled by inserting zeros between each sample. This upsampling process expands the original spectrum and introduces repeated spectral replicas at intervals dictated by the new Nyquist frequency. To refine this zero-inserted sequence, it is passed through a lowpass filter with a cutoff...
261
Fast Fourier Transform
376
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)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
376
Super-resolution Fluorescence Microscopy
7.0K
Super-resolution fluorescence microscopy (SRFM) provides a better resolution than conventional fluorescence microscopy by reducing the point spread function (PSF). PSF is the light intensity distribution from a point that causes it to appear blurred. Due to PSF, each fluorescing point appears bigger than its actual size, and it is the PSF interference of nearby fluorophores that causes the blurred image. Various approaches to achieving higher resolution through SRFM have recently been...
7.0K
Discrete Fourier Transform
320
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...
320

