通过通过简单的搜索来最大限度地投射在里埃域的轴外全息的快速和准确的载波频率估计
Optics letters
|November 4, 2025
概括
准确的载波频率估计对于离轴数字全息学至关重要. 一种新的福里埃域简单载体估计 (FDSCE) 方法提高了实时全息成像的准确性和效率.
科学领域:
- 光学和光子学 在光学和光子学.
- 数字全息图 (Digital Holography) 是一个数字全息图.
- 图像处理 图像处理
背景情况:
- 离轴数字全息需要精确的载波频率估计,以进行相位重建.
- 目前的方法与子像素频率和计算需求作斗争,阻碍了实时应用.
研究的目的:
- 开发一个更准确,更有效的载波频率估计方法,用于数字全息.
- 克服传统技术在子像素频率估计和计算复杂性的局限性.
主要方法:
- 提出了一个里埃域简单载体估计 (FDSCE) 方法.
- 作为一个连续的2D优化问题,重构估计.
- 利用一个三顶点的simplex初始化在FFT峰值附近的代改进.
主要成果:
- FDSCE 在连续频域中直接运行,避免了密集的光谱采样.
- 实现了精确的子像素频率估计,显著降低了计算成本.
- 在模拟和实验中证明了提高准确性和效率.
结论:
- FDSCE为实时全息成像提供了一个有效的解决方案.
- 该方法提高了载波频率估计的准确性和效率.
- 为高分辨率,实时全息应用提供了有价值的工具.
相关概念视频
Aliasing
547
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...
If the sampling frequency is below the Nyquist rate, these replicas overlap, preventing the original...
547
Linear Approximation in Frequency Domain
341
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....
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....
341
Linear Approximation in Time Domain
334
Nonlinear systems often require sophisticated approaches for accurate modeling and analysis, with state-space representation being particularly effective. This method is especially useful for systems where variables and parameters vary with time or operating conditions, such as in a simple pendulum or a translational mechanical system with nonlinear springs.
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length,...
334
Reconstruction of Signal using Interpolation
679
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...
679
Properties of Fourier Transform I
594
The application of Fourier Transform properties in radio broadcasting is multifaceted, enabling significant advancements in the way signals are transmitted and received. Key areas where these properties are utilized include simultaneous multi-channel transmission, audio clip speed adjustments, live broadcast delays for different time zones, audio frequency adjustments, and signal demodulation.
In radio broadcasting, multiple audio signals often need to be transmitted simultaneously. The Fourier...
In radio broadcasting, multiple audio signals often need to be transmitted simultaneously. The Fourier...
594
Fast Fourier Transform
873
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...
873


