Efficient illumination angle self-calibration in Fourier ptychography.

Applied Optics
|August 18, 2018
PubMed
Summary

Fourier ptychography is a technique that combines multiple low-resolution images taken from different angles to create a single, high-quality, large-scale image. However, the quality of the final result depends heavily on knowing the exact angle of the light source for each shot. This paper introduces a new, automated method to determine these angles directly from the captured image data. By first estimating brightfield angles and then refining both brightfield and darkfield measurements, the algorithm corrects misalignment errors without requiring extra calibration steps. This approach works across various hardware setups, including LED arrays and laser systems, improving image clarity in both two-dimensional and three-dimensional imaging tasks.

Frequently Asked Questions

Related Concept Videos

Glassware Calibration01:11

Glassware Calibration

Accurate calibration of glassware, such as volumetric flasks, pipettes, and burettes, is essential to ensure accurate measurements in the analytical laboratory. Calibration helps maintain consistency across measurements and prevents errors arising from inaccurate volumes.
Volumetric flasks: Volumetric flasks are designed to prepare aqueous solutions of precise volumes accurately with a calibration line on the neck. To calibrate a volumetric flask, it is important to fill it with distilled...
1.5K
Instrument Calibration01:12

Instrument Calibration

Instrument calibration is essential for ensuring that instruments produce accurate and consistent results. It is vital in manufacturing, healthcare, testing laboratories, and scientific research. Calibration processes are specific to each instrument and help enhance data accuracy. Each instrument has a unique calibration process tailored to its design and function to improve data accuracy.
Analytical Balance Calibration
An analytical balance measures mass and requires regular calibration to...
756
Contact Angle01:13

Contact Angle

When a solid is dipped inside a liquid, the liquid surface becomes curved near the contact. For some solid–liquid interfaces, the liquid is pulled up along the solid, while for others, the liquid surface is convex or depressed near the solid surface. This phenomenon can be explained using the concept of cohesive and adhesive forces.
The adhesive force is the molecular force between molecules of different materials, that is, between the molecules of the solid and the liquid. The cohesive...
21.5K
Trigonometric Fourier series01:17

Trigonometric Fourier series

Fourier series is a foundational mathematical technique that decomposes periodic functions into an infinite series of sinusoidal harmonics. This method enables the representation of complex periodic signals as sums of simple sine and cosine functions, facilitating their analysis and interpretation in various fields, including signal processing, acoustics, and electrical engineering.
The trigonometric Fourier series specifically expresses a periodic function with a defined period T using sine...
809
Convergence of Fourier Series01:21

Convergence of Fourier Series

The Fourier series is a powerful mathematical tool for representing periodic signals as an infinite sum of complex exponentials. In practice, this infinite series is truncated to a finite number of terms, yielding a partial sum. This truncation makes the approximation of the signal feasible but introduces certain challenges, particularly near discontinuities, known as the Gibbs phenomenon.
The Gibbs phenomenon refers to the persistent oscillations and overshoots that occur near discontinuities...
426
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...
952