Related Experiment Video
Updated: Mar 19, 2026

06:25
Time Multiplexing Super Resolving Technique for Imaging from a Moving Platform
Published on: February 12, 2014
8.9K
Inverse synthetic aperture Fourier ptychography
Optics Express
|March 18, 2026
Summary
Fourier ptychography (FP) generates high-resolution images using multiple low-resolution measurements. This new method uses sample tilt for diversity, simplifying the acquisition process and enabling advanced imaging without knowing the exact tilt angle.
Area of Science:
- Optical imaging
- Computational imaging
- Microscopy
Background:
- Fourier ptychography (FP) reconstructs high-resolution images from low-resolution measurements.
- Traditional FP methods require complex setups with changing illumination or camera positions.
- These conventional approaches increase cost and complexity in optical imaging systems.
Purpose of the Study:
- To introduce a novel Fourier ptychography approach using sample tilt for measurement diversity.
- To develop a learning-based method for estimating sample orientation from intensity measurements.
- To enable synthetic aperture imaging without prior knowledge of the tilt angle.
Main Methods:
- Developed inverse synthetic aperture Fourier ptychography (ISAFP) by utilizing sample tilt for measurement diversity.
- Introduced a novel learning-based algorithm to estimate sample orientation from dual plane intensity data.
- Experimentally validated the ISAFP method through simulations and tabletop optical experiments.
Main Results:
- Demonstrated that sample tilt can effectively generate measurement diversity in FP.
- Successfully reconstructed high-resolution images using ISAFP without explicit tilt angle information.
- Validated the robustness and feasibility of the proposed learning-based orientation estimation.
Conclusions:
- ISAFP offers a simplified and cost-effective alternative to traditional FP acquisition methods.
- The learning-based orientation estimation is crucial for enabling FP without explicit tilt angle knowledge.
- This work advances synthetic aperture imaging techniques for broader applications in microscopy and optical sciences.
Related Concept Videos
Fast Fourier Transform
1.1K
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...
1.1K
Trigonometric Fourier series
1.0K
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...
The trigonometric Fourier series specifically expresses a periodic function with a defined period T using sine...
1.0K
Continuous -time Fourier Transform
1.1K
The Fourier series is instrumental in representing periodic functions, offering a powerful method to decompose such functions into a sum of sinusoids. This technique, however, necessitates modification when applied to nonperiodic functions. Consider a pulse-train waveform consisting of a series of rectangular pulses. When these pulses have a finite period, they can be accurately represented by a Fourier series. Yet, as the period approaches infinity, resulting in a single, isolated pulse, the...
1.1K
Upsampling
684
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...
684
Discrete Fourier Transform
1.1K
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...
1.1K
Properties of Fourier Transform II
886
The Fourier Transform (FT) is an essential mathematical tool in signal processing, transforming a time-domain signal into its frequency-domain representation. This transformation elucidates the relationship between time and frequency domains through several properties, each revealing unique aspects of signal behavior.
The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...
The Frequency Shifting property of Fourier Transforms highlights that a shift in the frequency domain corresponds to a phase shift in the time domain. Mathematically, if x(t) has...
886

