Shengjie
Ma
abc,
Shilong
Xu
*abc,
Congyuan
Pan
d,
Jiajie
Fang
abc,
Fei
Han
abc,
Xi
Wang
a,
Yuhao
Xia
abc,
Wanying
Ding
abc and
Yihua
Hu
*abc
aState Key Laboratory of Pulsed Power Laser Technology, National University of Defense Technology, Hefei 230037, People's Republic of China. E-mail: xushi1988@nudt.edu.cn; skl_hyh@163.com
bKey Laboratory of Electronic Restriction of Anhui Province, National University of Defense Technology, Hefei 230037, People's Republic of China
cAdvanced Laser Technology Laboratory of Anhui Province, National University of Defense Technology, Hefei 230037, People's Republic of China
dAnhui Province Hefei GStar Intelligent Control Technical Co.Ltd., Hefei, Anhui 230037, China
First published on 9th May 2025
Laser-induced breakdown spectroscopy (LIBS) technology has been widely applied across various fields due to its rapid and straightforward analytical capabilities. However, this technology is susceptible to noise interference during the detection process, which will seriously affect the quantitative analysis accuracy. To mitigate the influence of noise and improve the analysis accuracy, we propose a Gradient Histogram Constraint Truncated Weighted Nuclear Norm Minimization (GHCTWNNM) algorithm for LIBS spectra denoising. Here, we innovatively convert the denoising problem of 1D spectra data into a 2D image denoising problem, where we can take advantage of the superior image denoising technology to enhance the denoising effect of LIBS spectra. On the basis of the traditional WNNM algorithm, we introduce the truncation threshold and gradient histogram constraints, which not only improve the computational efficiency but also prevent distortion issues caused by excessive smoothing of image texture details. Subsequently, we derived the solution of the GHCTWNNM algorithm using the Alternating Direction Method of Multipliers (ADMM) method. The experimental results demonstrate that the GHCTWNNM algorithm achieves a remarkable improvement in denoising performance, with an increase of approximately 6 dB in ΔSNR compared to the WNNM algorithm. Moreover, in comparison with nine other image denoising algorithms, GHCTWNNM not only delivers superior denoising capabilities but also exhibits greater adaptability to different noise environments, especially in a high background noise environment. Additionally, the R2 of the Al element quantitative analysis result has increased by 0.26 after applying the GHCTWNNM denoising method. In summary, the LIBS denoising method based on the GHCTWNNM algorithm can effectively enhance the spectra SNR and significantly reduce the errors in quantitative analysis caused by noise, thereby enhancing the accuracy and reliability of LIBS. This provides a strong basis for its wide application and further development in various related fields.
During the interaction of lasers with matter, a series of complex processes such as ablation, excitation, and ionization will take place. This may result in a substantial amount of noise interfering with the spectral acquisition process. In ref. 14, Tognoni et al. summarized the noise sources into four categories. The first one is known as source noise, which is caused by fluctuations in the interaction between the laser and the sample or the laser and the plasma. The second is the shot noise, which is due to the number of photons reaching the detector. And the other two are detector noise and instrument (thermal) drift. The interference from these sources of noise can significantly affect the spectra quality as well as the quantitative analysis accuracy. Consequently, denoising in spectral analysis is a critical component of LIBS, playing a significant role in improving spectral quality and quantitative analysis accuracy.
Methods to improve the Signal-to-Noise Ratio (SNR) of the LIBS spectrum include experimental-based and algorithm-based techniques. The experimental-based technique mainly focuses on optimizing the LIBS experimental parameters, including laser energy,15 spectrometer delay time,16 integration time,17 and so on. For example, we can effectively avoid the interference of continuous background noise by selecting an appropriate value of delay time. The parameters preset in the experimental-based method are usually based on existing experience. In addition, to ensure the best experiment outcomes, these parameters must be further adjusted according to the specific conditions and experiment environment. It is worth noting that while the aforementioned methods of optimizing parameters can significantly reduce the influence of background noise, the spectra acquisition process may still be subjected to noise from other sources. Under these circumstances, it is advisable to consider algorithm-based methods to denoise LIBS spectra. Algorithm-based methods can be categorized into the moving window smoothing algorithms, the power spectrum estimation, and the deep learning-based algorithms.18 Common moving window smoothing and power spectrum estimation methods include the Savitzky–Golay (SG) filter19 and Wavelet Transform (WT).20–22 The WT method is widely used for denoising in various types of data, including LIBS spectra, Raman spectra, near-infrared spectra, and so on. Xie et al. proposed an improved WT method and derived the optimal parameters to eliminate noise interference.20 The results showed that the relative standard deviation values of all trace elements after denoising were reduced, effectively improving the quantitative analysis accuracy in aluminum alloys. Lu et al. combined the recursive feature elimination with cross-validation method with WT.21 This approach overcomes the threshold smoothing issue present in traditional WT methods and can effectively remove noise from the spectra, which can enhance the precision of LIBS quantitative analysis. Additionally, it also facilitates feature selection in the denoised LIBS spectra. Xu et al. introduced the entropy analysis theory and proposed two improved threshold analysis theories.22 The results indicated that when the threshold function was selected as a double exponential function and the modulation transfer function, the quantitative analysis accuracy of Mn, Cr, and Mg elements in aluminum alloys can be significantly improved. However, the robustness and adaptability of WT is poor due to the need for manual parameter selection, and current research is essentially focused on the improvement of the WT method. In addition, the spectra sequences usually have complex characteristics and high dimensions, which makes traditional denoising methods face many challenges.
To address these challenges, the use of deep learning for data denoising has also been researched in recent years. Existing studies predominantly train the deep learning models by the simulated data, and then apply the well-trained models to denoise actual measured signals.23–25 Although the deep learning-based denoising methods have shown excellent performance, they also require a large amount of data with labels for model training. For LIBS spectra, samples may contain a variety of elements, and there are very rich characteristic spectral lines, which will make it quite complex and challenging to simulate LIBS spectra. Taking the steel slag samples studied in this paper as an example, they contain nine elements such as Fe, Mn, Al, Si, and so on, and the spectral lines of these elements may add up to hundreds. When directly employing the actually measured LIBS spectra for the training of the deep model, issues such as the variable experiment environment, the poor reproducibility of LIBS, and the difficulty in directly measuring the noise will result in inaccurate labels or even make it impossible to assign them directly. Consequently, it is seldom seen that the deep learning method is utilized to directly denoise the LIBS spectra.
In this paper, we introduce a novel approach for spectral denoising. In view of the numerous advanced achievements that have been made in the field of image denoising, we attempt to convert the LIBS signal denoising task into an image-based denoising task. The aim is to take advantage of the inherent strengths of image denoising to enhance the denoising performance. Based on the above analysis, we proposed a Gradient Histogram Constraint Truncated Weighted Nuclear Norm Minimization (GHCTWNNM) denoising algorithm for LIBS with spectrum-to-image conversion. As shown in Fig. 1, the denoising method mainly consists of four steps: sample preparation and spectra acquisition, spectrum dimension conversion, denoising for the 2D LIBS image, and denoising performance evaluation. We firstly propose a new method for converting the spectra sequence into a 2D image, where the characteristic spectral line information of various elements can be effectively preserved. This approach allows for a more comprehensive representation of spectral characteristics in the image. On this basis, for image denoising algorithms, to address the issue of long computation time, as well as to avoid distortion caused by excessive smoothing of image texture details, we introduce the method of truncation points and gradient histogram constraints to improve the WNNM algorithm. Then, we derived the solution of the GHCTWNNM algorithm using the Alternating Direction Method of Multipliers (ADMM) method. To verify the feasibility of our proposed method, we first conducted a comparative analysis of the GHCTWNNM algorithm with nine other image denoising algorithms, and the GHCTWNNM algorithm demonstrates significant advantages, which are reflected in its outstanding performance in LIBS denoising, as well as its greater adaptability to various noise conditions. Subsequently, we also conducted a quantitative analysis of the LIBS spectra before and after denoising. After denoising, the R2 of the Al element quantitative analysis results increased by approximately 0.26. Additionally, we compared our method with the WT method, and the GHCTWNNM algorithm also demonstrated excellent performance. In summary, the GHCTWNNM algorithm has provided a new denoising idea for LIBS spectra, and it is also expected to be applied in multiple fields such as Raman spectroscopy, near-infrared spectroscopy and so on.
The single-pulse LIBS system used in the experiment is depicted in Fig. 2. The laser beam was reflected and focused vertically onto the sample surface through a lens with a focal length of 75 mm. The prepared samples are mounted on a 3D rotation stage that can spin uniformly to ensure the LIBS spectra data can be collected from different surfaces of the sample. Under the interaction of a high-energy laser with matter, the sample surface is ionized to produce plasma, which is then received by a probe and transmitted to a spectrometer to form the LIBS spectrum. A three-channel Avantes spectrometer is used in our experiment, covering a wavelength range from 216 nm to 942 nm. The positions of the laser source and the probe remain stationary throughout the experiment. Finally, the synchronization between the laser emission and the spectrometer's delay time was maintained with a DG645, and the delay time is set to 2 μs, and the integration time of the spectrometer is set to 1 ms. In this manner, 300 sets of spectrum data are collected for each sample. Table S2† gives the detailed model and parameters of the experimental instruments.
It is worth noting that if N is odd, the position of the N-th point in the 2D image is LIBSimage(n,n). And if N is even, its position is LIBSimage(n,1). For the method shown in Fig. 3(b), we only need to use the flip(.) function to reverse the data in the even rows.
Of course, N may not be square rooted in most cases. For this situation, we need to pad the LIBS spectrum sequence to make , where M is the number of padded pixel points. In this paper, the number of sampling points of the spectrometer is N = 16
375, and we can set M = 9 to make n = 128. As shown in Fig. 3, there are no obvious characteristic peaks at the end of the LIBS spectrum sequence, so we can set the value of the padding pixel points yN+1 − yN+M to the value of yN. We summarize the aforementioned steps in Algorithm 1.
By using this new method, we can convert the 1D LIBS spectrum signal into a 2D grayscale image with the size of n × n. Then we can transform the 1D spectra signal denoising problem to 2D image processing. Ultimately, we can apply various image denoising techniques to enhance the noise reduction performance.
Taking sample no. 1 as an example, the 2D LIBS images obtained by different methods are shown in Fig. 4. We also employed the Gramian Angular Field (GAF) method27 to convert the 1D LIBS spectrum into 2D images. The GAF can be divided into the Gramian Angular Summation/Difference Field (GASF/GADF). The conversion principle can be found in the supplementary. It is worth noting that the size of the 2D LIBS images obtained using the GASF and GADF method is N × N. Finally, to better evaluate the denoising performance of different methods, we conducted the quantitative analysis of the LIBS spectrum, where the inverse conversion is involved here, and the 2D image needs to be restored to a 1D spectra signal. We simply need to perform steps 7–13 in Algorithm 1 and then flatten the LIBS image matrix. For the GAF method, we have also described the inverse conversion process in the ESI.†
![]() | ||
Fig. 4 The 2D LIBS images of sample no. 1 obtained by different methods. (a) The raw LIBS spectrum, and (b)–(e) the 2D LIBS images obtained using the methods in Fig. 3(a) and (b), GASF, and GADF, respectively. (The images we used for denoising are grayscale images, and to better observe the image details, we are displaying non-grayscale images here. The grayscale images can be found in Fig. S2.†). |
Y = X + N | (1) |
![]() | (2) |
![]() | (3) |
![]() | (4) |
![]() | (5) |
![]() | (6) |
![]() | (7) |
Although the WNNM algorithm addresses the issue of singular value weighting, there are still two problems. The first one is that the WNMM algorithm performs an SVD decomposition on y during each iteration, which is a time-consuming process. And the second one is that the WNNM algorithm may cause image texture details to be distorted due to excessive smoothing, which will reduce the visual quality of the image. In response to the aforementioned two issues, we propose the GHCTWNNM algorithm. The GHCTWNNM algorithm primarily aims to improve the two main problems mentioned.
For the first problem, as previously stated, smaller singular values correspond to noise. Therefore, a truncation method can be used to remove the smaller singular values. Here we define as the truncated weighted nuclear norm, where T is the truncation point. From the definition of the truncated weighted nuclear norm, we can perform soft thresholding starting from the T + 1-th singular value, and the first T singular values remain unchanged. Therefore, the optimization objective of the truncated WNNM method can be rewritten as:
![]() | (8) |
For the second problem, we employ a gradient histogram matching prior model to preserve the texture details in the image. Generally, the closer the gradients of the denoised image are to those of the original image, the better the denoising performance tends to be. Therefore, we first need to find the gradient histogram hr of the original image to obtain the matching prior. Our goal is to make the gradient histogram of the denoised image hf as close as possible to hr. Finally, after introducing the regularization term R(x) and adding the gradient histogram constraint, eqn (8) can be rewritten as:
![]() | (9) |
![]() | (10) |
Subsequently, we can solve eqn (9) in conjunction with eqn (10). We first introduce two parameters u and v, where u and v have the same dimensions as hf and R(x). And eqn (9) can be rewritten as
![]() | (11) |
The corresponding augmented Lagrangian function of eqn (11) can be expressed as
![]() | (12) |
Then, the solution of eqn (9) can be expressed as
![]() | (13) |
(a) Updating x. To update x, we should solve the following optimization problem
![]() | (14) |
We can employ the gradient descent method combined with soft thresholding operations to solve eqn (14). It should be noted that in the process of calculating the gradient of L(x,u,v,û,), the truncated nuclear norm term μ‖x(l)‖Tw,∗ is the non-smooth part to x, and its gradient requires special treatment. Here, we use the soft thresholding operation to handle its update. We define
, and its gradient can be calculated as follows
![]() | (15) |
Since the truncated nuclear norm is not differentiable at points where the singular values are zero, here we need to compute the sub-gradient of μ‖x(l)‖Tw,∗. The sub-gradient of the nuclear norm is the sign of the corresponding singular values, and it can be expressed as
![]() | (16) |
Then, we use the gradient descent method to update x(l)
![]() | (17) |
![]() | (18) |
Finally, we can reconstruct x(l+1) as
x(l+1) = UΣ'VT | (19) |
(b) Updating v. Given a fixed x, the v sub-problem becomes
![]() | (20) |
For eqn (20), under the constraint of v = hr, we can have v(l+1) = hr.
(c) Updating u. If we have a fixed x and v, the u sub-problem becomes
![]() | (21) |
This is a standard quadratic programming problem, where the objective function is a summation of a linear term and a quadratic term to u. Here, we can solve it using an analytical solution method. The derivative of eqn (21) with u is
![]() | (22) |
Setting eqn (21) to zero and we can have
![]() | (23) |
(d) Updating the dual variable. The update equations for the dual variable are
û(l+1) = û(l) + u(l+1) − hf | (24) |
![]() ![]() | (25) |
(e) Updating function f. Once x is fixed, we can determine the function f by solving eqn (26).
![]() | (26) |
We can solve eqn (26) using the standard histogram normalization operators method33 to make hf close to hr.
Combining the above analysis, we summarize the proposed GHCTWNNM algorithm in Algorithm 2. Here, we set the condition for terminating the algorithm iterations to ‖x(l+1) − x(l)‖22 < ε.
![]() | (27) |
Additionally, to more comprehensively analyze the denoising performance, we also carried out the quantitative analysis and spectra stability analysis on the LIBS spectra before and after denoising. The Partial Least Squares Regression (PLSR) and Support Vector Regression (SVR) methods are the two most common methods for quantitative analysis.34–37 In this paper, we combine the Particle Swarm Optimization (PSO) algorithm with SVR for multivariate analysis, where the PSO algorithm is used to solve for two parameters in SVR: the penalty factor c and the radial basis kernel function γ. The Correlation Coefficient (R2) is often used to evaluate the accuracy of the quantitative analysis model. And the Relative Standard Deviation (RSD) can be used to evaluate the spectral stability. The smaller the RSD, the higher the LIBS stability.
![]() | (28) |
![]() | (29) |
Take the characteristic spectral line at Al: 396.14 nm as an example, we have fitted the baselines of the spectra in Fig. 5(a)–(d) and marked them with red lines in Fig. 5(e)–(h). Here the Asymmetric Penalty Least Squares (AsPLS) method38 is employed to fit the baseline. The parameters are set as follows: an asymmetric factor of 10−5, a threshold of 0.05, a smoothing factor of 4, and a total of 50 iterations. Based on the aforementioned definition, we calculated the SNR of four characteristic spectral lines of the Al element with different laser energies, and the results are shown in Fig. 6. According to the results in Fig. 6, we can observe that with the increase of laser energy, the SNR of all the four characteristic spectral lines has significantly improved. It should be noted here that while increasing the laser energy, the intensity of the background noise will also increase. As shown in Fig. 5(e) and (f), when the laser energy is increased from 70 mJ to 100 mJ, the intensity of the background noise at the spectral line of Al: 396.14 nm increases from 207.91 to 444.2. Nevertheless, increasing the laser energy will enhance the SNR, and this is because the enhancement of laser energy on the signal is greater than that on the noise.39
Based on the conclusions in Fig. 5 and 6, we can significantly enhance the spectrum SNR and reduce the interference of background noise by increasing the laser energy. However, the LIBS spectra we collect may still be subject to noise interference from other sources. In such cases, it is essential to directly analyze the spectrum itself in order to achieve effective noise reduction. In the subsequent section, we will apply the proposed GHCTWNNM algorithm to denoise LIBS spectra.
Subsequently, we selected samples no. 1, 6, 11, 16, 21, 26, 31, and 36 to generate the corresponding 2D LIBS images, and compared the denoising performance with WNNM. The ΔSNR results of the two algorithms are shown in Fig. 9. Compared to the WNNM algorithm, the GHCTWNNM algorithm shows an approximate 6 dB improvement in ΔSNR for the denoising results. This is mainly related to the two-point optimization of the algorithm, which significantly improves the denoising performance, especially in the aspect of preserving image details and edge information.
Furthermore, we compared the denoising performance of the GHCTWNNM algorithm with other algorithms; the ΔSNR results are shown in Table 2. The results indicate that our proposed GHCTWNNM algorithm consistently outperforms other algorithms across all samples, with an average ΔSNR of 14.42 dB. Additionally, the Self-Organizing Map Algorithm (SOMA) also achieves relatively satisfactory denoising performance, with an average ΔSNR of 10.57 dB. However, the performance of some traditional denoising methods is not satisfactory, such as mean filtering and median filtering. It is worth noting that the DnCNN model in Table 2 is derived from ref. 40. Zhang et al. trained the DnCNN model (https://github.com/cszn/DnCNN) using the Berkeley Segmentation Dataset (BSD68), and we directly applied the pre-trained model for LIBS image denoising. However, the experimental results demonstrate that the training effect of the DnCNN model is far from satisfactory. A possible reason may be the differences in the data used to train the model, which also reflects the drawbacks of deep learning, that is, the need for a large amount of sample data for model training. When equipped with a sufficient amount of labeled data, deep learning methods may be a superior solution.
Sample no | Denoising algorithm | |||||||||
---|---|---|---|---|---|---|---|---|---|---|
AF | MF | NLM | BM3D | DnCNN | PM | SOMA | kSVD | WNNM | GHCTWNNM | |
1 | 3.43 | 3.16 | 4.01 | 4.95 | 3 | 4.06 | 10.35 | 7.28 | 7.95 | 14.17 |
6 | 3.57 | 3.41 | 4.11 | 5.11 | 3.01 | 4.11 | 10.26 | 7.27 | 8.11 | 14.28 |
11 | 3.69 | 4.09 | 4.26 | 5.26 | 3.16 | 4.26 | 10.37 | 7.74 | 8.19 | 14.51 |
16 | 3.4 | 3.82 | 3.91 | 5.9 | 3.3 | 3.91 | 10.74 | 7.64 | 8.25 | 14.89 |
21 | 3.69 | 4.02 | 4.49 | 5.65 | 3.11 | 4.64 | 10.85 | 7.33 | 8.37 | 14.44 |
26 | 3.98 | 4.05 | 4.45 | 5.44 | 2.87 | 4.44 | 10.46 | 8.02 | 8.74 | 14.17 |
31 | 4.24 | 4.4 | 4.42 | 5.42 | 3.31 | 4.41 | 10.91 | 7.51 | 8.05 | 14.14 |
36 | 3.63 | 4.01 | 4.56 | 5.55 | 3.51 | 4.56 | 10.62 | 7.23 | 8.94 | 14.72 |
Avg. | 3.70 | 3.87 | 4.27 | 5.41 | 3.16 | 4.30 | 10.57 | 7.50 | 8.33 | 14.42 |
In addition, we conducted a comparative analysis of the computational complexity of different algorithms, and Table 3 presents the time and space complexities. Among them, the time complexity of AF and MF is related to the size of the convolution kernel k. A large value of k can significantly enhance denoising capability, and it will also cause the time complexity to increase exponentially. Similarly, the time complexity of NLM and BM3D algorithms is also affected by the search window S and block size P. The time complexity of DnCNN is affected by the number of network layers L and channels C. By comparing GHCTWNNM and WNNM, we find that GHCTWNNM has significantly lower time complexity than WNNM, especially for large images. The truncation in GHCTWNNM greatly reduces the computational load of SVD. Thus, GHCTWNNM is more efficient for large-scale image data processing. Regarding space complexity, DnCNN's memory-intensive nature primarily stems from its backpropagation mechanism during training, which requires storing a large number of weight parameters across multiple convolutional layers.
Denoising algorithm | Algorithmic complexity | |
---|---|---|
Time complexity | Space complexity | |
AF | O(n2k2) | O(n2) |
MF |
O(n2k2![]() |
O(n2) |
NLM | O(n2·S2·P2) | O(n2) |
BM3D | O(n2·S2·P2) | O(n2) |
DnCNN | O(L·C·n2) | O(L·C·n2) |
WNNM | O(l·n3) | O(n2) |
GHCTWNNM | O(l·T·n2) | O(n2) |
Since the results of LIBS experiments are easily affected by environmental factors, we further analyzed the anti-noise performance of different algorithms. Taking sample no. 1 as an example, we normalized the LIBS spectrum and then added extra Gaussian noise to the measured LIBS spectrum, and the noise levels can be reflected by the value of σ2. According to the results in Fig. 10, we observed that the GHCTWNNM algorithm shows obvious advantages in all levels of noise. When σ2 = 0, the GHCTWNNM algorithm shows an improvement of nearly 4 dB over the second-best SOMA algorithm. In addition, as the added noise increases, the ΔSNR of all algorithms decreases. Despite this, the GHCTWNNM algorithm has demonstrated the best performance when σ2 ranges from 0 to 1. It particularly maintains a high value of ΔSNR in high-noise environments. Table S3† gives the SNR value of characteristic spectral lines at Al396.15 nm after adding noise with different variances. When the variance of the added noise is 0.8 and 1, the SNR value is lower than 10 dB. Under severe noise conditions with additive noise variances of 1 (SNR < 10 dB), our proposed GHCTWNNM algorithm achieves a nearly 5 dB enhancement in ΔSNR, indicating its excellent robustness and noise adaptability. However, the traditional approaches (e.g., average/median filtering) perform poorly under high-noise conditions due to excessive smoothing or edge loss.
Then we conducted quantitative analysis of LIBS before and after denoising. For the 40 groups of the steel slag samples shown in Table S1,† we randomly divided them into the train set and the test set in a ratio of 3:
1, and the samples of the test set are marked with #. Table 4 presents the quantitative results for the Mn and Al elements before and after denoising. Here, we employ the PSO-SVR algorithm for multivariate quantitative analysis, and the penalty factor c and the radial basis kernel function γ are also displayed. Additionally, we select the WT denoising algorithm with four different wavelet thresholding strategies for comparison. The detail information of these four strategies can be found in the ESI.† According to the results in Table 4, we can conclude that the multivariate quantitative analysis results have been significantly improved after spectrum denoising by the GHCTWNNM algorithm. The R2 for the concentration prediction results for Mn and Al elements increased by approximately 0.12 and 0.26 on both the train and test set, respectively. Compared to the WT method, the GHCTWNNM algorithm has achieved an obvious increase in R2. This confirms that our proposed GHCTWNNM algorithm not only performs well in LIBS image denoising but also effectively enhances the quantitative analysis accuracy.
Denoising algorithm | Mn | Al | |||||||
---|---|---|---|---|---|---|---|---|---|
Train | Test | c | γ | Train | Test | c | γ | ||
Without denoising | 0.8484 | 0.8616 | 75.96 | 0.156 | 0.7079 | 0.7271 | 2.42 | 0.120 | |
WT | Sqtwolog | 0.8651 | 0.8732 | 85.25 | 0.151 | 0.7474 | 0.7858 | 99.65 | 0.001 |
MiniMaxi | 0.8754 | 0.8833 | 75.23 | 0.001 | 0.7510 | 0.7823 | 74.26 | 0.001 | |
Heursure | 0.9042 | 0.9134 | 87.55 | 0.347 | 0.8190 | 0.8499 | 37.23 | 0.412 | |
Birge Massart | 0.9285 | 0.9342 | 100 | 0.001 | 0.8629 | 0.8922 | 16.59 | 0.741 | |
GHCTWNNM | 0.9642 | 0.9899 | 77.99 | 0.001 | 0.9641 | 0.9831 | 44.49 | 0.280 |
Finally, we compared the stability of the LIBS before and after denoising. We selected the four characteristic spectral lines: Mn 354.779 nm, Mn 356.98 nm, Al 308.215 nm, and Al 309.284 nm. The RSD results of these lines are shown in Fig. 12. Overall, the RSD values of the denoised spectrum are all lower than those of the raw spectrum, and the reduction is about 2–3%. Taking the spectral line at Mn 356.98 nm as an example, after spectrum denoising, the RSD is reduced from 7.63% to 4.08%. These results fully demonstrate that our proposed GHCTWNNM algorithm can not only reduce spectrum noise but also effectively enhance the stability and reliability.
Footnote |
† Electronic supplementary information (ESI) available. See DOI: https://doi.org/10.1039/d5ja00057b |
This journal is © The Royal Society of Chemistry 2025 |