Related Experiment Video
Updated: Jul 15, 2026

13:44
Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
Published on: August 30, 2013
[Discussion about the prediction accuracy for dynamic spectrum by partial FFT].
Gang Li1, Qiu-xia Li, Ling Lin
1College of Precision Instrument and Opto-Electronics Engineering, Tianjin University, Tianjin 300072, China.
Guang Pu Xue Yu Guang Pu Fen Xi = Guang Pu
|March 17, 2007
Summary
Near-infrared spectroscopy shows promise for noninvasive blood analysis. Optimizing dynamic spectrum extraction using FFT methods improves accuracy for potential clinical applications.
Area of Science:
- Biomedical Optics
- Spectroscopy
- Physiological Monitoring
Context:
- Noninvasive blood analysis is crucial for clinical diagnostics.
- Current near-infrared (NIR) techniques are limited in clinical application beyond blood oxygen saturation.
- Individual variability and complex measurement conditions pose significant challenges.
Purpose:
- To introduce and validate the dynamic spectrum (DS) approach for noninvasive blood component analysis.
- To investigate methods for accurately extracting DS, focusing on the Fast Fourier Transform (FFT) and its associated leakage.
- To analyze the impact of various experimental parameters on DS extraction accuracy.
Summary:
- The study explores the dynamic spectrum (DS) method, derived from photoplethysmography, for noninvasive blood analysis.
- It addresses challenges in DS extraction accuracy by analyzing the Fast Fourier Transform (FFT) method, including spectral leakage.
- Emulating experiments reveal that optimizing sampling speed, signal periodicity, window functions, and interpolation significantly enhances DS accuracy.
Impact:
- This research provides a foundation for the clinical implementation of NIR-based noninvasive blood analysis.
- Improved accuracy in DS extraction is a critical step towards real-world medical applications.
- The findings offer practical guidelines for refining NIR spectroscopic techniques for physiological monitoring.
More Related Videos
Related Concept Videos
Determination of Expected Frequency
Suppose one wants to test independence between the two variables of a contingency table. The values in the table constitute the observed frequencies of the dataset. But how does one determine the expected frequency of the dataset? One of the important assumptions is that the two variables are independent, which means the variables do not influence each other. For independent variables, the statistical probability of any event involving both variables is calculated by multiplying the individual...
Discrete-time Fourier transform
The Discrete-Time Fourier Transform (DTFT) is an essential mathematical tool for analyzing discrete-time signals, converting them from the time domain to the frequency domain. This transformation allows for examining the frequency components of discrete signals, providing insights into their spectral characteristics. In the DTFT, the continuous integral used in the continuous-time Fourier transform is replaced by a summation to accommodate the discrete nature of the signal.
One of the notable...
One of the notable...
Properties of DTFT II
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 ω. Multiplying by j...
The frequency differentiation property is illustrated by considering a DTFT pair and differentiating both sides with respect to ω. Multiplying by j...
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...
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)log2N multiplications, offering a much faster performance.
The computational efficiency of the FFT becomes...
The computational efficiency of the FFT becomes...
Linear Approximation in Frequency Domain
Linear systems are characterized by two main properties: superposition and homogeneity. Superposition allows the response to multiple inputs to be the sum of the responses to each individual input. Homogeneity ensures that scaling an input by a scalar results in the response being scaled by the same scalar.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear.
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear.

