STEPWISE SUPERPOSITION-BASED FOURIER TRANSFORM DIFFERENTIAL METHOD
20240160688 ยท 2024-05-16
Assignee
Inventors
Cpc classification
International classification
Abstract
The invention relates to a stepwise superposition-based Fourier transform differentiation method, which comprises the following steps: S1, sampling an analytic signal in a finite time domain, converting the analytic signal into a discrete spectrum, and identifying spectral peak vertexes through a differential curve of the spectrum; S2, superposing the peak vertexes in the spectrum in a stepped manner according to the principle of superposition-based Fourier transform; and S3, differentiating the spectrum after the stepwise superposition to obtain a stepwise superposition-based Fourier transform differential spectrum or image. The invention not only potently improves the resolution and sensitivity, but also greatly saves computing time.
Claims
1. A stepwise superposition-based Fourier transform differential method, comprising: S1, sampling an analytic signal in a finite time domain, converting the analytic signal into a discrete spectrum, and identifying positions of spectral peak vertexes through a differential curve of the spectrum; S2, superposing the peak vertexes in the spectrum in a stepped manner according to the principle of superposition-based Fourier transform; and S3, differentiating the spectrum after the stepwise superposition to obtain a stepwise superposition-based Fourier transform differential spectrum or image.
2. The stepwise superposition-based Fourier transform differential method according to claim 1, wherein in the Step S1, the analytic signal s(t) is discretized in a measurement period so as to take N samples, s(0), s(1), s(2), . . . , s(N?1), N frequency spectral data S(0), S(1), S(2), . . . , S(N?1) are obtained by discrete Fourier transform, and the Fourier transform matrix is expressed as follows:
3. The stepwise superposition-based Fourier transform differential method according to claim 1, wherein in the Step S2, it is assumed that there are N overlapping peaks in the spectrum, that is, F.sub.1, F.sub.2, F.sub.3, . . . , F.sub.N, the first peak F.sub.1 is located on a zero step, whose peak intensity is multiplied by 2 according to a right superposition function, and the baseline is still the original spectral peak baseline 0; the peak intensity of the second peak F.sub.2 is multiplied by 4 to rise to a first step, the third peak F.sub.3 is multiplied by 6 to rise to a second step, . . . , the N.sup.th peak F.sub.N is multiplied by 2N to rise to a (N?1).sup.th step; when it comes to the last overlapping peak, returning to the zero step is conducted immediately, and then, the spectrum after the stepwise superposition is differentiated, so that the baseline of the superposition spectral line of the second peak returns to the first step after differentiation, which is marked as baseline 1; similarly, the remaining baselines are marked, and the baselines are connected to form a stepwise superposition-based Fourier transform differential spectrum.
4. The stepwise superposition-based Fourier transform differential method according to claim 1, wherein in the Step S3, it is assumed that a peak vertex of the k.sup.th overlapping peak is located at S(?.sub.k), which becomes 2k.sup.S(?.sup.
Description
BRIEF DESCRIPTION OF THE SEVERAL VIEWS OF THE DRAWINGS
[0028]
[0029]
[0030]
[0031]
[0032]
[0033]
[0034]
[0035]
[0036]
[0037]
[0038]
DETAILED DESCRIPTION OF THE INVENTION
[0039] The invention will be further described below with reference to the accompanying drawings and embodiments.
[0040] The invention provides a stepwise superposition-based Fourier transform differential method, comprising: [0041] S1, sampling an analytic signal in a finite time domain, converting the analytic signal into a discrete spectrum, and identifying spectral peak vertexes through a differential curve of the spectrum; [0042] S2, superposing the peak vertexes in the spectrum in a stepped manner according to the principle of superposition-based Fourier transform; and [0043] S3, differentiating the spectrum after the stepwise superposition to obtain a stepwise superposition-based Fourier transform differential spectrum or image.
[0044] In this embodiment, referring to
[0045] Preferably, in this embodiment, it is assumed that an analytic signal s(t) of one time domain t is intercepted to N separate signals [s(0), s(1), s(2), . . . , s(k), . . . , s(N?1)], a set of N frequency domain data S(?)=[S(0), S(1), S(2), . . . , S(k), . . . , S(N?1)] is obtained by Fourier transform, and the latter can be converted back into the time signal s(t) by inverse Fourier transform, which is mathematically simply expressed as:
[0046] Fourier transform spectroscopy and imaging have several wellborn characteristics: analytic signals suitable for Fourier transform are simple signals which vary periodically, such as interference signals generated by a laser light source of an infrared spectrometer, nuclear spin free induction decay signals excited by radio frequency waves in a nuclear magnetic resonance spectrometer, and hydrogen nuclear magnetic resonance signals of water molecules in human tissue measured through magnetic resonance medical imaging. The peak width of the Fourier transform spectrum is not relevant with the signal frequency, but mainly depends on the measurement time and attenuation coefficient of the analytic signals. Therefore, under the same circumstances, all peaks except the peak height should have the same peak shape; for example, the Fourier transform waveforms of resonance attenuation signals are all in the Lorentz shape.
[0047] The Fourier transform spectrum S(m) is multiplied by a diagonal matrix diag[a.sub.k]:
[0050] Peak vertexes ?.sub.1, ?.sub.2, w.sub.3 and w.sub.4, of the spectrum are easily located through discrimination of a second derivative (see
[0051] It is assumed that a peak vertex of the k.sup.th overlapping peak is located at S(?.sub.k), which becomes 2k.sup.S(?.sup.
[0053] Equations (5) and (6) indicate that all points of the spectrum except the peak vertexes are processed into a spectral backgroundby the differentiation, so that a spectral peak can be accurately determined by using as little as three stepwise superposition-based Fourier transform differential data points. Generally, in discrete Fourier transform algorithm, ??=1. These three points are composed of the last differential spectral point 2(k?1)?.sup.S(?.sup.
[0054] Referring to
[0055] Differential spectroscopy has high sensitivity and deconvolution capability for overlapping peaks. The stepwise superposition-based Fourier transform differential technique of the invention maintains these two merits, and makes up for the shortcomings of conventional differential spectroscopy: irregular peak shapes and complicated evaluation of peak value. The Lorentz peak shape and peak height can be replaced by peak width W.sub.1/2 at half peak height in calculation of theoretical resolution. If a distance between two Fourier transform spectral peaks is D, their resolution Rs can be simply written as:
Rs=D/(2W.sub.1/2)(7)
[0056] Taking an overlapping spectral band close to the Lorentz peak shape in
TABLE-US-00001 TABLE 1 Signal-to Intensity ratio Derivatives Resolution Noise ratio of 2 over- required for peak (Rs) (SNR) lapping peaks identification Rs ? 0.5 ?3 ?1% 1.sup.st & 2.sup.nd derivatives 0.35 ? ?9 ?5% 1.sup.st, 2.sup.nd & 3.sup.rd derivatives Rs < 0.5
[0057] The location of the Fourier transform spectral peaks needs to be supported by sufficient sampling data, and it is better to have more than 10 times of data points of Nyquist Criterion for semi-quantitative analysis. For overlapping spectral bands with resolution ?0.5, a convex stagnation point, i.e., the peak vertex, of the spectral curve can be accurately located based on the first and second derivatives of the commonly used differential spectrum method. When the resolution between spectral peaks is less than 0.5 but greater than 0.35, slope change points (convex stagnation point and concave stagnation point) of the first derivative can be found based on the usual second and third derivatives so as to locate the peak vertex of the secondary peak.
[0058] Of course, it is unnecessary to confine the parameters listed in Table 1. For example, better quantitative results can be obtained by analyzing the asymmetry of the peaks and the overlapping degree, suppressing the background noise, and adopting a sampling frequency greater than 20 times of Nyquist Criterion, all of which require more analyses and computing time.
Embodiment 1
[0059] The embodiment provides a method for quickly obtaining high-resolution and high-sensitivity an infrared spectrum based on a stepwise superposition-based Fourier transform differential technique. In this embodiment, a Nicolet Prot?g? 460 commercial Fourier transform infrared spectrometer was used, and a HeNe laser infrared light source with a wavelength of 632.8 nm (6.328?10.sup.?5 cm) was configured. A polystyrene Fourier transform infrared spectrum was obtained with a resolution of 16 cm.sup.?1 at wavenumber spacing of 3.85 cm.sup.?1 by moving an optical path of the interferometer in two directions by 3295 retardations and setting 709 wavenumber readings. The lower gray spectral line of
Embodiment 2
[0060] The embodiment provides a method for quickly obtaining a high-resolution and high-sensitivity nuclear magnetic resonance spectrum based on a stepwise superposition-based Fourier transform differential technique.
Embodiment 3
[0061] In this embodiment, although Fourier transform magnetic resonance imaging is based on the principle of two-dimensional or three-dimensional space nuclear magnetic resonance, there are several significant differences from the above Fourier transform nuclear magnetic resonance spectrum.
[0062] (1) Spatial positions of pixels of the image are determined according to a sequence of measurement time, equivalent to nominal time domain analytic signals.
[0063] (2) Magnetic resonance imaging measures the nuclear spin resonance frequency of the same kind of nuclei (such as hydrogen nuclei of water molecules) in a three-dimensional gradient magnetic field. These frequency signals are arranged and stored with gradient zero as the center, and are called k-space, which nominally belongs to a frequency domain space.
[0064] (3) Therefore, the magnetic resonance image is transformed from the k-space by inverse Fourier transform. However, inverse Fourier transform and (positive) Fourier transform have many commonalities, for example, common techniques such as zero filling, interpolation and apodization for time domain signal treatment, are still effective for the k-space.
[0065] (4) Every pixel of a measured body part in magnetic resonance imaging is a peak vertex (pixels outside the body part are the background), so the pixels in each dimension are equivalent to overlapping peaks arranged side by side.
[0066] In order to implement the stepwise superposition method of the invention, each pixel in magnetic resonance imaging needs to provide an additional pixel point next to it to form a step. The scale of the k-space can be doubled or more than doubled by using the simple zero filling technique in Embodiment 2 of the invention or the more complicated total variation constrained data extrapolation method.
[0067]
[0068]
[0069]
[0070] Those skilled in the art will appreciate that the embodiments of the invention may be provided as methods, systems, or computer program products. Therefore, the invention may take the form of a full hardware embodiment, a full software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product implemented on one or more computer usable storage media (including but not limited to magnetic disk memory, CD-ROM, optical memory, etc.) having computer usable program code embodied therein.
[0071] The invention is described with reference to flowcharts and/or block diagrams of the method, equipment (system), and computer program product according to the embodiments of the invention. It should be understood that each flow and/or block in the flowcharts and/or block diagrams, and combinations of flows and/or blocks in the flowcharts and/or block diagrams, may be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions executed by the processor of the computer or other programmable data processing apparatus produce a device for implementing the functions specified in one or more flows in the flowcharts and/or one or more blocks in the block diagrams.
[0072] These computer program instructions may also be stored in a computer-readable memory which can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including an instruction device which implements the functions specified in one or more flows in the flowcharts and/or one or more blocks in the block diagrams.
[0073] These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus such that a series of operational steps are performed on the computer or other programmable apparatus to produce a computer implemented process, such that the instructions executed on the computer or other programmable apparatus provide steps for implementing the functions specified in one or more flows in the flowcharts and/or one or more blocks in the block diagrams.
[0074] The above embodiments are only preferred embodiments of the invention, and are not intended to limit the invention in other forms. Any person familiar with this field can make changes or modifications to equivalent embodiments with equivalent changes by using the above-mentioned technical contents. However, any simple amendments, equivalent changes and modifications made to the above embodiments according to the technical essence of the invention without departing from the content of the technical scheme of the invention still belong to the protection scope of the technical scheme of the invention.