Related Experiment Video
Updated: Jan 22, 2026

06:48
A Multimodal Wide-Field Fourier-Transform Raman Microscope
Published on: December 30, 2025
209
Defocused camera calibration with a conventional periodic target based on Fourier transform
Optics Letters
|July 2, 2019
Summary
This study introduces a new camera calibration method for defocused images using phase maps derived from periodic targets. This approach enables accurate feature detection and calibration even when images are not in focus.
Area of Science:
- Computer Vision
- Image Processing
- Metrology
Background:
- Accurate camera calibration is crucial for many computer vision applications.
- Traditional methods rely on sharp target images, limiting their use with defocused cameras.
- Defocus blur degrades image quality, hindering precise feature point extraction.
Purpose of the Study:
- To develop a novel camera calibration method robust to defocus blur.
- To enable accurate calibration using conventional periodic targets with defocused cameras.
- To extract features from the phase domain, overcoming intensity-based limitations.
Main Methods:
- Utilized a conventional periodic target for calibration.
- Applied Fourier transform to recover two crossed phase maps from the target image.
- Extracted feature points from the phase domain, rather than image intensity.
- Validated the method through simulations and experimental tests.
Main Results:
- Successfully recovered phase maps from periodic target images.
- Demonstrated feature point extraction robust to camera defocusing.
- Achieved accurate camera calibration using both focused and defocused images.
- Confirmed the efficacy of the phase-domain approach.
Conclusions:
- The proposed method offers accurate camera calibration for defocused systems.
- Phase-domain feature extraction provides robustness against defocus blur.
- This technique expands the applicability of camera calibration in challenging imaging conditions.
Related Concept Videos
Fast Fourier Transform
920
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...
920
Properties of Fourier Transform I
616
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...
616
Properties of Fourier Transform II
754
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...
754
Discrete Fourier Transform
864
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...
864
Basic signals of Fourier Transform
907
The Fourier Transform is a pivotal mathematical tool in signal processing, enabling the transformation of time-domain signals into their frequency-domain representations. Among the numerous elements within this domain, certain functions like the sinc function, delta function, and exponential signals hold significant importance due to their unique properties and implications.
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at...
The sinc function, defined as sinc(x) = sin(πx)/(πx), is particularly notable for its symmetry and behavior at...
907
Continuous -time Fourier Transform
853
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...
853

