Related Experiment Video
Updated: Aug 25, 2025

06:25
Time Multiplexing Super Resolving Technique for Imaging from a Moving Platform
Published on: February 12, 2014
8.5K
Batch-based alternating direction methods of multipliers for Fourier ptychography
Optics Express
|October 15, 2022
Summary
Fourier ptychography (FP) reconstruction is optimized using batch-based alternating direction methods of multipliers (ADMM). This approach reduces computational cost and dataset size, leading to faster convergence and higher-quality images compared to traditional methods.
Area of Science:
- Optics and Photonics
- Computational Imaging
- Image Reconstruction
Background:
- Fourier ptychography (FP) is a powerful imaging technique but suffers from large datasets and high computational costs due to data redundancy requirements for stable recovery.
- Existing methods like embedded pupil function recovery (EPRY) have limitations in efficiency.
Purpose of the Study:
- To develop a more efficient and computationally tractable method for Fourier ptychography reconstruction.
- To reduce the dataset size and computational burden associated with FP imaging.
Main Methods:
- Implementation of batch-based alternating direction methods of multipliers (ADMM) for FP reconstruction.
- Utilizing the additive property of optical pupils in FP recovery.
- Performing partial updates in sub-problems of the standard ADMM algorithm.
Main Results:
- The proposed batch-based ADMM algorithms demonstrate faster convergence compared to the EPRY algorithm.
- The new methods yield higher-quality reconstructed images.
- Validation performed using both simulated and experimental measurement data.
Conclusions:
- Batch-based ADMM offers a significant improvement in efficiency and image quality for Fourier ptychography.
- The developed scheme effectively addresses the computational challenges of FP reconstruction.
- This advancement enables broader applications of FP imaging by reducing resource demands.
More Related Videos
Related Concept Videos
Properties of DTFT II
246
In the study of discrete-time signal processing, understanding the properties of the Discrete-Time Fourier Transform (DTFT) is crucial for analyzing and manipulating signals in the frequency domain. Several properties, including frequency differentiation, convolution, accumulation, and Parseval's relation, offer powerful tools for signal analysis.
The frequency differentiation property is illustrated by considering a DTFT pair and differentiating both sides with respect to ω.
The frequency differentiation property is illustrated by considering a DTFT pair and differentiating both sides with respect to ω.
246
Fast Fourier Transform
433
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...
433
Properties of Fourier Transform II
290
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...
290
Properties of DTFT I
489
In signal processing, Discrete-Time Fourier Transforms (DTFTs) play a critical role in analyzing discrete-time signals in the frequency domain. Various properties of the DTFTs such as linearity, time-shifting, frequency-shifting, time reversal, conjugation, and time scaling help understand and manipulate these signals for different applications.
The linearity property of DTFTs is fundamental. If two discrete-time signals are multiplied by constants a and b respectively, and then combined to...
The linearity property of DTFTs is fundamental. If two discrete-time signals are multiplied by constants a and b respectively, and then combined to...
489
Double Resonance Techniques: Overview
268
Double resonance techniques in Nuclear Magnetic Resonance (NMR) spectroscopy involve the simultaneous application of two different frequencies or radiofrequency pulses to manipulate and observe two distinct nuclear spins. One important application of double resonance is spin decoupling, which selectively suppresses coupling with one type of nucleus while observing the NMR signal from another nucleus, simplifying the spectrum and enhancing resolution.
Spin decoupling is usually achieved by...
Spin decoupling is usually achieved by...
268
Upsampling
294
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...
294

