AFM tip characterization by using FFT filtered images of step structures

Yongda Yan1, Bo Xue1, Zhenjiang Hu2

  • 1Key Laboratory of Micro-systems and Micro-structures Manufacturing of Ministry of Education, Harbin Institute of Technology, Harbin, Heilongjiang 150001, PR China; Center For Precision Engineering, Harbin Institute of Technology, Harbin, Heilongjiang 150001, PR China.

Ultramicroscopy
|October 31, 2015
PubMed

Related Concept Videos

Atomic Force Microscopy01:08

Atomic Force Microscopy

Atomic force microscopy (AFM) is a type of scanning probe microscopy that can analyze topographic details of various specimens like ceramics, glass, polymers, and biological samples. AFM offers over 1000 times more resolution than the optical imaging system. Images generated from AFM are three-dimensional surface profiles, offering an advantage over the flat, two-dimensional images from other imaging techniques.
The AFM Probe
The probe is regarded as the heart of any AFM setup and comprises the...
4.7K
Discrete Fourier Transform01:15

Discrete Fourier Transform

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
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...
1.2K