# A Photoacoustic Imaging Algorithm Based on Regularized Smoothed L0 Norm Minimization

Authors: Xueyan Liu; Limei Zhang; Yining Zhang; Lishan Qiao
Journal: Molecular Imaging
 (2021)

---

## Abstract

The recently emerging technique of sparse reconstruction has received much attention in the field of photoacoustic imaging (PAI). Compressed sensing (CS) has large potential in efficiently reconstructing high-quality PAI images with sparse sampling signal. In this article, we propose a CS-based error-tolerant regularized smooth L0 (ReSL0) algorithm for PAI image reconstruction, which has the same computational advantages as the SL0 algorithm while having a higher degree of immunity to inaccuracy caused by noise. In order to evaluate the performance of the ReSL0 algorithm, we reconstruct the simulated dataset obtained from three phantoms. In addition, a real experimental dataset from agar phantom is also used to verify the effectiveness of the ReSL0 algorithm. Compared to three L0 norm, L1 norm, and TV norm-based CS algorithms for signal recovery and image reconstruction, experiments demonstrated that the ReSL0 algorithm provides a good balance between the quality and efficiency of reconstructions. Furthermore, the PSNR of the reconstructed image calculated by the introduced method was better than the other three methods. In particular, it can notably improve reconstruction quality in the case of noisy measurement.


---

## Body

## 1. Introduction

Photoacoustic imaging (PAI) is a new noninvasive and nonionizing biomedical imaging method which gains rapid development in the last two decades [1–4]. As a hybrid technique, PAI attains the advantages of the contrast of optical imaging and high resolution of ultrasonic imaging. In particular, PAI has shown great potential in many applications, including living mouse brain vasculature imaging [3, 5, 6], human skin imaging [7, 8], and the treatment and diagnosis of cancer [9–11]. When the biological tissue is irradiated by nanosecond laser pulses, the photoacoustic signals will be generated in the tissue’s light absorption region and measured by ultrasonic transducers. Afterwards, the distribution of laser energy absorption can be calculated from the photoacoustic signals by using the analytical or iterative algorithms.The reconstruction algorithm is an important factor affecting the quality of PAI imaging, and the accurate and efficient reconstruction algorithms are of great significance. Analytic algorithms such as the filtered back-projection algorithm [12–14], the deconvolution reconstruction algorithm [15], and the time-reversal imaging algorithm [16] have already been used extensively owing to their accuracy and implementation convenience. However, the analytic algorithms can only reconstruct an accurate image with complete measurement data from all directions, which requires a long scan time or complex electronic equipment. When the data are insufficient, the analytic algorithms are no longer effective. In many PAI applications, such as breast imaging and ophthalmic imaging, only incomplete data can be accepted. There has not been accurate PAI reconstruction formula with incomplete data yet. Therefore, the development of high-speed and high-quality PAI image reconstruction algorithms based on incomplete data is an active research topic recently. The incomplete data may arise from various forms, but in this work, we only consider the sparse-view PAI reconstruction problem.Mathematically, image reconstruction with sparse-view incomplete data can be thought of as an underdetermined linear system. By making some constraints, the iterative reconstruction algorithm that gives a more accurate result at the expense of much more computing time has been developed for sparse-view PAI [17–19]. One type of them is based on the compressive sensing (CS) theory, which has drawn increasing attention due to its can recover sparse signals under sampling rate far lower than the Nyquist rate [20, 21]. By using the L1magic convex optimization algorithm and sparse-view data, Provost and Lesage applied CS to PAI [22, 23]. The problem of artifacts and loss of resolution in the case of insufficient measurements can be solved by using patterned excitation light via the SPGL1 algorithm [24]. Bayesian CS method was used to simplify the PAI system [25]. The experimental results indicated that the CS-based reconstruction method can reduce undersampling artifacts effectively through the nonlinear conjugate gradient descent algorithm [26]. The above studies indicated that the CS methods can reduce the number of ultrasonic transducers and get high-quality reconstruction results with sparse-view data.To date, most CS applications within sparse-view PAI imaging have centered on the L1 norm minimization problem [22, 24, 27] and the total variation (TV) minimization problem [28–31]. Encouraged by the advantages in edge preservation and finer structure recovering, the L0 regularizations were introduced to computed tomography (CT) [32–35], magnetic resonance imaging (MRI) [36], and PAI [37]. Bioucas-Dias and Figueiredo proposed a smoothed L0 norm (SL0) [38] algorithm that directly minimizes the L0 norm, which combines the advantages of the high precision of convex optimization and the rapidity of greedy algorithm. Mozaffarzadeh et al. have shown that the SL0 algorithm can provide a higher PAI image quality while a low number of transducers were [37]. However, the SL0 algorithm does not consider the noise in the measurement data. Based on the SL0 algorithm, Bu et al. have adopted a regularization term to tolerate errors which can achieve the same computational efficiency as the SL0 algorithm while having better noise robustness. This inspired us to apply the regularized smooth L0 (ReSL0) algorithm to reconstruct the sparse-view PAI image. In this paper, we studied the use of the ReSL0 for L0 norm minimization CS problems caused by sparse-view PAI reconstruction. The proposed algorithm is able to provide more accurate result under the sparse-view situation. For the purpose of verifying the capability of the ReSL0 algorithm, the ReSL0 algorithm compares with three L0 norm, L1 norm, and TV norm-based CS algorithms for signal recovery and image reconstruction.


## 2. Methods

### 2.1. Photoacoustic Theory

Based on the photoacoustic signal generation theory, the relationship between the acoustic pressurepr,t and the absorbed energy density Ar obeys the following wave equation [39].
(1)∂2∂t2−c2∇2pr,t=ΓrAr∂It∂t,where r means the pixel position, t indicates the time, c is the ultrasound speed, Γr denotes the Grueneisen parameter, and It is a temporal function of illumination that can be approximately regarded as a Dirac delta function δt in most practical cases. By solving the wave equation of Eq. (1), the pressure measured at locations r0 can be written as [40].
(2)pr0,t=Γr4πc2∭Ar∣r−r0∣δt−∣r−r0∣cd3r.With Fourier transform, the forward projection problem can be expressed in the time-frequency domain as
(3)p¯r0,k=ikΓ4πc∭Arexp−ik∣r0−r∣∣r0−r∣d3r.During the experiment, the frequency domain data can be obtained by applying fast Fourier transform to the time domain measurements. To numerically model the above forward problem, the unknown reconstruction image Ar is reshaped into one-dimensional long vector X∈RN, and a column vector Y∈RM can be used to represent all the temporal-frequency pressure p¯r0,k. According to Eq. (3), the temporal-frequency domain measurement matrix can be designed as [22].
(4)Km,ni,j=ickne−ikn∣rm−rij∣∣rm−rij∣,m=1,2,⋯,p,n=1,2,⋯,q,which is determined by the geometry and the grid shape of the unknown image. In Eq. (4), rm indicates the position of the transducer, rij denotes the pixel coordinates of the image, p is the number of ultrasonic sensors, and q indicates the number of sampling points, respectively. Then, Eq. (3) can be expressed as Y=KX. In PAI, the goal of image reconstruction is to reconstruct X through the pressure data Y.


### 2.2. Compress Sensing Application in PAI

According to the theory of compress sensing, an image can be reconstructed when it or its transformation is sparse. Fortunately, most medical images can be considered sparse with a sparse transform basisΨ:X=Ψθ, where θ∈RN indicates the sparse coefficient. Provost and Lesage have shown that there is a sparse transform basis in which the PAI image is compressible [22]. By denoting A=KΨ, the problem of PAI image reconstruction can be solved by the following optimization model.
(5)minXEXs.t.Y=KX=Aθ,where EX is the regularization function. Accroding to the literature [22], the matrix A obtained from the product between the forward operator K in the Fourier domain with a wavelets basis Ψ will be a CS-matrix. And the wavelet basis showed the best properties among generic bases that can represent sparsely images obtained via PAI.We note that most of the current CS-based reconstruction algorithms explore the prior knowledge that the PAI image is sparse or sparse in the transform domains. And the regularization term in Eq. (5) usually denoted by the L1 norm of the image’s sparsity transform coefficient, the total variation norm of the image, and so forth. For example, the constrained L1 norm minimization can be applied to reconstruct the PAI image.
(6)minθθ1s.t.Y−Aθ<δ.The subject of solving Eq. (6) has received considerable attention in PAI image reconstruction, such as the use of L1magic [22], SPGL1 [24], and ADM [27].If TV norm is selected as the regularization term, the TV-based CS reconstruction model can be defined as follows:(7)minXTVXs.t.Y−KX<δ,where TVX=∑i=1NDiX=∑i=1NΔihX2+ΔivX2 is the discrete form of TV for a grayscale image and Δih and Δiv denote the horizontal and vertical difference operators. In the field of PAI, the TV minimization optimization algorithm can reconstruct excellent image from few-view data [28–31]. In this work, the two-step iterative shrinkage thresholding (TwIST) algorithm is considered for image reconstruction [31, 38].


### 2.3. Regularized Smooth L0 Algorithm

In order to realize fast recovery of sparse signal, Mohimani et al. introduced the SL0 algorithm [41] to obtain sparse solution of underdetermined of linear equation Y=KX. The SL0 algorithm obtains the most sparse solution by solving the following optimization problem
(8)minθθ0s.t.Y=Aθ,where θ0 is the L0 norm of θ [37, 41]. In this algorithm, a continuous function was used to approximate θ0 instead of minimize the L0 norm directly, which can be written as follows: fσθ=exp−θ2/σ2. It should have a parameter σ which determines the quality of the approximation. Considering
(9)limσ→0fσθ=1;ifθ=0,0;ifθ≠0,and by defining Fσθ=∑i=1Nfσθ, the L0 norm of θ can be calculated by θ0≈N−Fσθ for small values of σ.Recently, Mozaffarzadeh et al. illustrate that SL0 offers higher-quality PAI images in comparison with L1 norm-based basis pursuit method while a low number of transducers were [37]. However, we can only observe inaccurate measurements Y=KX+e, which means there are errors between Y and KX. And the property of the SL0 decreases significantly due to the equality constraint Y=KX. In order to resolve this problem, we added observation noise to the forward model.
(10)Y=KX+e=Aθ+e,where e∈RM denotes a vector indicating the modeling transducer noise. And a regularized SL0 (ReSL0) method was used to solve the above problem mentioned in Eq. (10) [42, 43], which can be written as follows:
(11)maxθFσθs.t.Y‐Aθ2<δ.ReSL0 transforms the equality constraint in Eq. (8) into inequality constraint allowing certain error tolerance. The ReSL0 algorithm includes two nested iterations. The initial value σ0 is set to 4 times of the maximum absolute value of the sparse coefficients in the outer loop, and the next values σj=ρσj−1,j≥1, where ρ is chosen between 0.5 and 1 in the experiment [41]. For every σ, the internal circle is responsible for finding the maximum value of Fσθ on set θY‐Aθ2<δ. The internal loop consists of iterations of the form θ←θ+μσ2∇Fσθ, followed by solving the optimization problem:
(12)minθpθp−θ^s.t.Y‐Aθ2<δ.Using Lagrange multipliers, this minimization results in [42].
(13)θ^p=θ^−AHAAH+λ−1IM−1Aθ^−y,where λ is the regularized parameter that is fixed for the internal loop and adaptively computed for external loop. An adaptive regularized parameter selection approach [44] is used to solve objective function in Eq. (11), which generates a suitable regularization parameter in the iterative process to balance the fit of the sparsity and residual error in the objective function. Then, the regularized parameter during the internal loop can be written as
(14)λ=θ∇−θ^j−12AHAθ^j−1−y2,where θ∇ is the first solution of the internal loop for the value σ=σj. The step-by-step procedures of the ReSL0 algorithms are described in Algorithm 1. Other details of the scheme are described in [38, 42, 44] and their references.Algorithm 1:The ReSL0 algorithm.
Initialization1) SetJ,L,μ>0, and θ^0=AHAAH−1y.2) Set0.5<ρ<1,σ0, and σj=ρσj−1, where 1<j<J.Forj=1,2,⋯,J1) Letσ=σj.2) Initialization:θ=θ^j−1.Forl=1,2,⋯,La)θ←θ−μθ1exp−θ12/2σ2,⋯,θNexp−θN2/2σ2Tb)λ=θ∇−θ^j−12/AHAθ^j−1−y2c)θ←θ−AHAAH+λ−1IM−1Aθ−y.3) Setθ^j=θFinal answerθ=θ^j.


## 2.1. Photoacoustic Theory

Based on the photoacoustic signal generation theory, the relationship between the acoustic pressurepr,t and the absorbed energy density Ar obeys the following wave equation [39].
(1)∂2∂t2−c2∇2pr,t=ΓrAr∂It∂t,where r means the pixel position, t indicates the time, c is the ultrasound speed, Γr denotes the Grueneisen parameter, and It is a temporal function of illumination that can be approximately regarded as a Dirac delta function δt in most practical cases. By solving the wave equation of Eq. (1), the pressure measured at locations r0 can be written as [40].
(2)pr0,t=Γr4πc2∭Ar∣r−r0∣δt−∣r−r0∣cd3r.With Fourier transform, the forward projection problem can be expressed in the time-frequency domain as
(3)p¯r0,k=ikΓ4πc∭Arexp−ik∣r0−r∣∣r0−r∣d3r.During the experiment, the frequency domain data can be obtained by applying fast Fourier transform to the time domain measurements. To numerically model the above forward problem, the unknown reconstruction image Ar is reshaped into one-dimensional long vector X∈RN, and a column vector Y∈RM can be used to represent all the temporal-frequency pressure p¯r0,k. According to Eq. (3), the temporal-frequency domain measurement matrix can be designed as [22].
(4)Km,ni,j=ickne−ikn∣rm−rij∣∣rm−rij∣,m=1,2,⋯,p,n=1,2,⋯,q,which is determined by the geometry and the grid shape of the unknown image. In Eq. (4), rm indicates the position of the transducer, rij denotes the pixel coordinates of the image, p is the number of ultrasonic sensors, and q indicates the number of sampling points, respectively. Then, Eq. (3) can be expressed as Y=KX. In PAI, the goal of image reconstruction is to reconstruct X through the pressure data Y.


## 2.2. Compress Sensing Application in PAI

According to the theory of compress sensing, an image can be reconstructed when it or its transformation is sparse. Fortunately, most medical images can be considered sparse with a sparse transform basisΨ:X=Ψθ, where θ∈RN indicates the sparse coefficient. Provost and Lesage have shown that there is a sparse transform basis in which the PAI image is compressible [22]. By denoting A=KΨ, the problem of PAI image reconstruction can be solved by the following optimization model.
(5)minXEXs.t.Y=KX=Aθ,where EX is the regularization function. Accroding to the literature [22], the matrix A obtained from the product between the forward operator K in the Fourier domain with a wavelets basis Ψ will be a CS-matrix. And the wavelet basis showed the best properties among generic bases that can represent sparsely images obtained via PAI.We note that most of the current CS-based reconstruction algorithms explore the prior knowledge that the PAI image is sparse or sparse in the transform domains. And the regularization term in Eq. (5) usually denoted by the L1 norm of the image’s sparsity transform coefficient, the total variation norm of the image, and so forth. For example, the constrained L1 norm minimization can be applied to reconstruct the PAI image.
(6)minθθ1s.t.Y−Aθ<δ.The subject of solving Eq. (6) has received considerable attention in PAI image reconstruction, such as the use of L1magic [22], SPGL1 [24], and ADM [27].If TV norm is selected as the regularization term, the TV-based CS reconstruction model can be defined as follows:(7)minXTVXs.t.Y−KX<δ,where TVX=∑i=1NDiX=∑i=1NΔihX2+ΔivX2 is the discrete form of TV for a grayscale image and Δih and Δiv denote the horizontal and vertical difference operators. In the field of PAI, the TV minimization optimization algorithm can reconstruct excellent image from few-view data [28–31]. In this work, the two-step iterative shrinkage thresholding (TwIST) algorithm is considered for image reconstruction [31, 38].


## 2.3. Regularized Smooth L0 Algorithm

In order to realize fast recovery of sparse signal, Mohimani et al. introduced the SL0 algorithm [41] to obtain sparse solution of underdetermined of linear equation Y=KX. The SL0 algorithm obtains the most sparse solution by solving the following optimization problem
(8)minθθ0s.t.Y=Aθ,where θ0 is the L0 norm of θ [37, 41]. In this algorithm, a continuous function was used to approximate θ0 instead of minimize the L0 norm directly, which can be written as follows: fσθ=exp−θ2/σ2. It should have a parameter σ which determines the quality of the approximation. Considering
(9)limσ→0fσθ=1;ifθ=0,0;ifθ≠0,and by defining Fσθ=∑i=1Nfσθ, the L0 norm of θ can be calculated by θ0≈N−Fσθ for small values of σ.Recently, Mozaffarzadeh et al. illustrate that SL0 offers higher-quality PAI images in comparison with L1 norm-based basis pursuit method while a low number of transducers were [37]. However, we can only observe inaccurate measurements Y=KX+e, which means there are errors between Y and KX. And the property of the SL0 decreases significantly due to the equality constraint Y=KX. In order to resolve this problem, we added observation noise to the forward model.
(10)Y=KX+e=Aθ+e,where e∈RM denotes a vector indicating the modeling transducer noise. And a regularized SL0 (ReSL0) method was used to solve the above problem mentioned in Eq. (10) [42, 43], which can be written as follows:
(11)maxθFσθs.t.Y‐Aθ2<δ.ReSL0 transforms the equality constraint in Eq. (8) into inequality constraint allowing certain error tolerance. The ReSL0 algorithm includes two nested iterations. The initial value σ0 is set to 4 times of the maximum absolute value of the sparse coefficients in the outer loop, and the next values σj=ρσj−1,j≥1, where ρ is chosen between 0.5 and 1 in the experiment [41]. For every σ, the internal circle is responsible for finding the maximum value of Fσθ on set θY‐Aθ2<δ. The internal loop consists of iterations of the form θ←θ+μσ2∇Fσθ, followed by solving the optimization problem:
(12)minθpθp−θ^s.t.Y‐Aθ2<δ.Using Lagrange multipliers, this minimization results in [42].
(13)θ^p=θ^−AHAAH+λ−1IM−1Aθ^−y,where λ is the regularized parameter that is fixed for the internal loop and adaptively computed for external loop. An adaptive regularized parameter selection approach [44] is used to solve objective function in Eq. (11), which generates a suitable regularization parameter in the iterative process to balance the fit of the sparsity and residual error in the objective function. Then, the regularized parameter during the internal loop can be written as
(14)λ=θ∇−θ^j−12AHAθ^j−1−y2,where θ∇ is the first solution of the internal loop for the value σ=σj. The step-by-step procedures of the ReSL0 algorithms are described in Algorithm 1. Other details of the scheme are described in [38, 42, 44] and their references.Algorithm 1:The ReSL0 algorithm.
Initialization1) SetJ,L,μ>0, and θ^0=AHAAH−1y.2) Set0.5<ρ<1,σ0, and σj=ρσj−1, where 1<j<J.Forj=1,2,⋯,J1) Letσ=σj.2) Initialization:θ=θ^j−1.Forl=1,2,⋯,La)θ←θ−μθ1exp−θ12/2σ2,⋯,θNexp−θN2/2σ2Tb)λ=θ∇−θ^j−12/AHAθ^j−1−y2c)θ←θ−AHAAH+λ−1IM−1Aθ−y.3) Setθ^j=θFinal answerθ=θ^j.


## 3. Experiment and Result

Although the existing CS-based PAI reconstruction algorithms provide better results, the accuracy and efficiency of sparse-view PAI reconstruction still need further improvement. In this section, we provided a variety of simulations and in vitro applications to illustrate the advantages and efficiency of the ReSL0 method for sparse-view PAI reconstruction. The forward simulation and inverse reconstruction were conducted in 2D phantoms and images. The same iteration stopping criteriaδ=Xk+1−Xk/Xk<0.005 were used to be fair to compare the four algorithms. The simulation experiments were carried out using Matlab (version 7.8) on a PC with a 8 GHz CPU and 32 GB memory.By using the wavelet transform and different sparse regularization methods, the numerical simulations have been carried out on the Sheep-Logan phantom, the blood vessel phantom, and the standard General Electric resolution phantom (Figure1) with a 128×128 resolution corresponding simulation area of 30mm×30mm. During the simulation, the sound speed was 1500 m/s. A single ultrasonic transducer was used to receive the signals. To simulate the frequency response of the transducer, at every detection position, 128 randomly selected in the window [0.2, 3] MHz were used to define the projection matrix K. By adjusting the phantom gray values to 0,1, we obtained the ultrasonic pressure Y using the projection matrix K.Figure 1
The (a) Sheep-Logan phantom, (b) blood vessel phantom, and (c) standard General Electric resolution phantom employed in the 2D computer-simulation studies.
(a)(b)(c)


### 3.1. Reconstruction from Simulated Sparse-View Data

We compared ReSL0 for the solution model (10) with SPGL1 for the solution model (6), TwIST for the solution model (7), and SL0 for the solution model (8). Figure2 demonstrates the reconstruction results of the Sheep-Logan phantom by using these four methods. From the first row of Figure 2, we can see that the images of these four methods are strongly affected when 20 position samples are used. When the number of sampling is 35, the images reconstructed by the TwIST and SL0 methods contain artifacts and distortions, and the quality of the reconstructed images by the RESL0 and SPGL1 methods is better than these two methods. As the signal acquisition position reaches 50, the image reconstructed by the TwIST method still contains many noises, and the other three methods can reconstruct high-quality images. So we can conclude that the L0 norm and L1 norm-based CS algorithms can obtain more accurate image with sparse-view signals.Figure 2
Reconstruction results of the Sheep-Logan phantom. The first to the third rows are the reconstruction images with 20-view, 35-view, and 50-view that are uniformly distributed at a 360° curve. The first to the fourth columns show the results of TwIST, SPGL1, SL0, and ReSL0 individually.The quantitative evaluation of the reconstructed images including the CPU times, the peak signal-to-noise ratio (PSNR), and the normalized mean absolute error (NMAE) achieved by each of the algorithms is presented in Table1. The PSNR (in dB) is defined as 10log10N⋅MAXI2/X−X^22 and the NMAE is defined as 100×X^−X2/X2, where MAXI means the maximum pixel value of the image and X^ denotes the estimate of the original. The CPU running time was used to estimate time complexity. The PSNR and the NMAE were used for quality evaluation of the reconstructed image.Table 1
Numerical results of reconstructed images.
ExperimentalCPU time (seconds)PSNR (dB)NMAEPositionsTwISTSPGSL0ReSL0TwISTSPGSL0ReSL0TwISTSPGSL0ReSL050.6911.760.520.7711.811.9311.9512.11104.93103.34103.08101.25101.112.31.091.4512.5713.2712.6513.2196.0188.5895.1789.15151.9322.761.862.1813.3414.7814.1414.6887.8774.4880.1275.31202.5826.072.512.8114.6516.0415.616.1175.5364.3567.7763.84253.3228.673.363.7116.0117.3416.817.264.6155.475956.37303.951.924.044.4517.0318.9418.0518.9457.4646.0951.143.99352.6546.864.775.1418.3521.4520.2221.6649.3433.739.7931.63403.5930.225.415.7719.730.2323.930.2342.2612.5726.0611.66454.0429.036.446.821.342.6640.3160.9335.163.013.940.37503.0828.87.117.6124.561.3683.65113.524.30.350.030.001Average2.6928.843.714.0716.9324.8025.7331.8663.7548.1952.6147.36According to Table1, we can infer that there are great differences between the CPU times: TwIST is about 1.5 times faster than ReSL0, which itself can be roughly 7 times faster than SPGL1. And the SL0 has the same computational complexity as the ReSL0. From Table 1, we can see that those four methods achieve similar PSNRs and NMAEs when using signals at less than 35 locations. Table 1 also shows that the ReSL0 outperforms other three methods when using signals with more than 35 locations. Moreover, if we consider a method cannot reconstruct a high-quality image as the PSNR is less than 30, then we can conclude that the TwIST fails for all experiments, the SL0 fails when the number of sampling positions is less than 45, while the SPGL1 and ReSL0 algorithms fail when the number of sampling positions is less than 40. The numerical results in Table 1 indicate that the ReSL0 algorithm can reconstruct high-quality images with more than 40 sampling signals in a short time. From the results of simulations, we can see that the ReSL0 algorithm is more accurate than the other three algorithms in the sparse-view sampling condition.Considering the universality of the ReSL0 method, the blood vessel phantom was used as the initial energy density to additionally compare these four algorithms. The conditions of this experiment were the same as the Sheep-Logan experiment. Figure3 shows the reconstruction images of the blood vessel phantom with these four algorithms. It can be seen from Figure 3 that all these four algorithms can reconstruct accurate images by using photoacoustic signals from 40 sampling positions. When the signal of 30 sampling positions is used, all reconstructed images contain much noise, which has a certain influence on the identification of the blood vessel structure. Among these four algorithms, the ReSL0 algorithm has the best reconstruction quality, which can be observed by the middle extraction lines from the reconstructed images. However, when the sampling position is 20, none of the four algorithms can get good reconstructed image.Figure 3
Reconstruction results of the blood vessel phantom. The first to the third rows are the reconstruction images with 20-view, 30-view, and 40-view that are uniformly distributed at a 360° curve. The first to the fourth columns show the results of TwIST, SPGL1, SL0, and ReSL0 individually.Table2 shows the numerical results of the blood vessel for those four methods. Since the reconstructed image sizes of the two experiments are the same, the running time of the blood vessel experiment is similar to that of the Sheep-Logan experiment. From Table 2, we can see that the TwIST method can obtain a larger PSNR and a smaller NMAE when the number of samples is less than 30. However, the NMAE of the TwIST method is only slightly improved when the sampling position is greater than 30. And the ReSL0 method can achieve the largest PSNR and the smallest NMAE when the number of samples is greater than 30. According to Table 2, we can conclude that the TwIST method has better accuracy and efficiency when the signal number is small and the ReSL0 method obtains better quality PAI images with sufficient measurements.Table 2
Numerical results of reconstructed images.
ExperimentalCPU time (seconds)PSNR (dB)NMAEPositionsTwISTSPGSL0ReSL0TwISTSPGSL0ReSL0TwISTSPGSL0ReSL050.566.640.490.7214.5114.2814.314.41100.73103.39103.24101.96101.1917.671.021.4416.0615.8614.8715.5284.2586.2796.6189.68151.6521.681.762.0519.9418.5216.3917.7953.9363.581.1469.09202.5325.832.372.8234.1422.4319.922.2410.5140.4854.1641.38252.1819.713.293.537.8927.0125.5128.726.8323.928.419.63302.6528.073.874.1441.4231.4632.2435.794.5414.3113.088.7352.6534.984.474.8343.3539.0440.3345.643.645.985.162.8402.7318.225.225.7745.447.653.9465.242.882.231.080.29452.2921.715.856.4746.4765.387.61112.952.540.290.020.001502.488.456.817.1647.8881.64115.34115.712.160.040.0010.001Average2.0920.33.523.8934.7136.3142.0447.4027.234.0438.2933.35In order to further verify the effectiveness of the RESL0 algorithm, a more complex and challenging standard General Electric resolution phantom is also used for simulation. The reconstruction results of the four algorithms are shown in Figure4. In the first column of Figure 4, the images reconstructed by TwIST contain severe noises, which seriously affect the image quality. The second and third columns of Figure 4 are reconstructed by SPGL1 and SL0, respectively. It can be observed that both methods can suppress noise, but the quality of the reconstructed image can be further improved. The last column of Figure 4 shows the results of ReSL0, which obtain the best reconstruction quality among the four methods.Figure 4
Reconstruction results of the standard General Electric resolution phantom. The first to the third rows are the reconstruction images with 30-view, 40-view, and 50-view that are uniformly distributed at a 360° curve. The first to the fourth columns show the results of TwIST, SPGL1, SL0, and ReSL0 individually.Table3 shows the numerical results of the standard General Electric resolution phantom for those four methods. As can be seen from Table 3, the TwIST algorithm has the shortest CPU time and the CPU time of the ReSL0 algorithm is slightly slower than the SL0 algorithm, while the CPU time of the SPGL1 algorithm is always much bigger than the other three algorithms. The TwIST algorithm has the worst PSNR and the biggest NMAE, and the PSNR value of images reconstructed by the ReSL0 algorithm is the highest, and the NMAE value of images reconstructed by the ReSL0 algorithm is the lowest. From the above three experiments, we can arrive at the conclusion that the ReSL0 algorithm outperforms the other three algorithms under sparse sampling condition.Table 3
Numerical results of reconstructed images.
ExperimentalCPU time (seconds)PSNR (dB)NMAEPositionsTwISTSPGSL0ReSL0TwISTSPGSL0ReSL0TwISTSPGSL0ReSL050.378.040.450.7414.5814.4914.8114.9596.8797.5897.8993.45100.9712.471.081.514.7615.4615.415.7988.1784.3685.8680.16151.4821.621.782.0815.4316.3816.2916.6778.4974.9474.6868.14202.1531.962.552.8916.2717.3417.1817.7368.6263.5562.0554.09252.8337.573.213.481718.5718.1818.9260.9451.3649.3743.06303.3649.944.154.4817.9920.5519.9821.0251.7837.8534.5229.41353.1726.034.735.1518.9822.4322.2623.4744.3827.9322.8818.97403.0332.15.55.8520.225.0125.5226.4937.0919.3214.0411.8452.9252.296.186.8221.6427.2427.7629.1230.5113.319.16.96503.4353.996.757.1423.4930.1630.9932.9923.548.45.433.91Average2.3732.63.644.0118.0320.7620.8421.7258.0447.8645.5841


### 3.2. Comparison for Different Variances of the Noise

In order to quantify the influence of noise, the PSNR and NMAE of the reconstruction images of the Sheep-Logan phantom experiment are calculated and shown in Figure5. A good algorithm has a larger PSNR and a smaller NMAE. As can be seen from Figure 5, when there is weak noise of 50 dB and 40 dB, those four methods achieve similar PSNRs and NMAEs when using signals with less than 35 positions. Furthermore, the ReSL0 algorithm achieves the biggest PSNR and the smallest NMAE with sampling locations of more than 40 and improves PSNR faster than the other three algorithms. When there is strong noise of 30 dB and 20 dB, the SL0 algorithm and the TwIST algorithm have smaller PSNRs and larger NMAEs, but the ReSL0 algorithm can still achieve good reconstruction results with sufficient measurements. In other words, the ReSL0 algorithm achieves good reconstruction of PAI images in noisy environments.Figure 5
The PSNRs and NMAEs of reconstruction results of the Sheep-Logan phantom with different number of sampling points. (a–d) The quantitative results of noisy observation withSNR=50, 40, 30, and 20 dB, respectively.Figure6 provides the PSNR and NMAE tendency chart of the reconstruction results of the blood vessel phantom experiment with noisy observation. When the number of sampling locations is greater than 25, the ReSL0 method can achieve the largest PSNR and the smallest NMAE. These results are consistent with the results of the noiseless environment as shown in Table 2. However, the performance of the SL0 algorithm degrades rapidly due to the equality constraint in Eq. (8). According to the information gathered above, we may reach the conclusion that the ReSL0 algorithm can reconstruct high-quality PAI images regardless of noise. Besides, the SL0 algorithm that does not include noise regularization terms cannot be used in a strong noise environment. The inequality optimization constraint in Eq. (11) can provide the better performance in the noise environment.Figure 6
The PSNRs and NMAEs of reconstruction results of the blood vessel phantom with different number of sampling points. (a–d) The quantitative results of noisy observation withSNR=50, 40, 30, and 20 dB, respectively.


### 3.3. In Vitro Experiments

Besides the numerical phantom experiments, the in vitro experiments were used to demonstrate the ReSL0 algorithm’s performance. And the reconstruction results of the TwIST, SPGL1, and SL0 are also presented. A schematic diagram of the imaging system setup is displayed in Figure7(a), where an experimental coordinate system x,y,z is also described. A Q-switched Nd:YAG pumped at 532 nm was used as the light source. The laser frequency is 10 Hz, and the pulse width is 6-10 ns. A focused piezoelectric transducer (Panametrics V309) with a central frequency of 5 MHz was controlled by a precision stepper motor for photoacoustic signal acquisition. The rotation radius of the transducer is 40 mm, and the rotation step size is 2°. At each sampling location, the photoacoustic signals were first amplified by a signal amplifier, then captured and averaged 30 times by a Tektronix MSO4000B mixed signal oscilloscope, and finally transmitted to the computer for signal processing and imaging.Figure 7
(a) The schematic diagram of PAI imaging system. (b) A photograph of the imaging sample.
(a)(b)The imaging sample used in the experiment is a gelatin cylinder with one graphite rod and two hairs as optical absorbers. Figure7(b) is the photograph of the sample. The radius of the gelatin cylinder is 13 mm. The diameter of graphite rod is 0.5 mm, and the length of hair is 4 mm. In the phantom experiment, 60-view data and 90-view data are selected for reconstruction. The images are constructed by the TwIST, SPGL1, SL0, and ReSL0 algorithms, respectively.The in vitro experiment results are displayed in Figure8. The first and the second row show the reconstruction results from 60-view and 90-view experiment data. As can be seen from the first row of Figure 8, there will be a lot of noise in the reconstructed image and some low-contrast features will disappear when using 60-view experiment data. When the sampling data is sufficient, such as 90-view data, all four algorithms are able to construct good quality images. And the sizes and locations of the optical absorbers are well reconstructed. However, the resolution of reconstructed images using TwIST and SL0 algorithms is not as good as SPGL1 and ReSL0 algorithms. By comparing the results of numerical experiments and in vitro experiments, we can conclude that the quality of reconstructed images in vitro experiment is not as good as that of numerical experiments. Therefore, we need to collect more data to achieve exact reconstruction.Figure 8
The reconstruction results from 60-view and 90-view experiment data, respectively. (a–d) Results of TwIST, SPGL1, SL0, and ReSL0 individually.


## 3.1. Reconstruction from Simulated Sparse-View Data

We compared ReSL0 for the solution model (10) with SPGL1 for the solution model (6), TwIST for the solution model (7), and SL0 for the solution model (8). Figure2 demonstrates the reconstruction results of the Sheep-Logan phantom by using these four methods. From the first row of Figure 2, we can see that the images of these four methods are strongly affected when 20 position samples are used. When the number of sampling is 35, the images reconstructed by the TwIST and SL0 methods contain artifacts and distortions, and the quality of the reconstructed images by the RESL0 and SPGL1 methods is better than these two methods. As the signal acquisition position reaches 50, the image reconstructed by the TwIST method still contains many noises, and the other three methods can reconstruct high-quality images. So we can conclude that the L0 norm and L1 norm-based CS algorithms can obtain more accurate image with sparse-view signals.Figure 2
Reconstruction results of the Sheep-Logan phantom. The first to the third rows are the reconstruction images with 20-view, 35-view, and 50-view that are uniformly distributed at a 360° curve. The first to the fourth columns show the results of TwIST, SPGL1, SL0, and ReSL0 individually.The quantitative evaluation of the reconstructed images including the CPU times, the peak signal-to-noise ratio (PSNR), and the normalized mean absolute error (NMAE) achieved by each of the algorithms is presented in Table1. The PSNR (in dB) is defined as 10log10N⋅MAXI2/X−X^22 and the NMAE is defined as 100×X^−X2/X2, where MAXI means the maximum pixel value of the image and X^ denotes the estimate of the original. The CPU running time was used to estimate time complexity. The PSNR and the NMAE were used for quality evaluation of the reconstructed image.Table 1
Numerical results of reconstructed images.
ExperimentalCPU time (seconds)PSNR (dB)NMAEPositionsTwISTSPGSL0ReSL0TwISTSPGSL0ReSL0TwISTSPGSL0ReSL050.6911.760.520.7711.811.9311.9512.11104.93103.34103.08101.25101.112.31.091.4512.5713.2712.6513.2196.0188.5895.1789.15151.9322.761.862.1813.3414.7814.1414.6887.8774.4880.1275.31202.5826.072.512.8114.6516.0415.616.1175.5364.3567.7763.84253.3228.673.363.7116.0117.3416.817.264.6155.475956.37303.951.924.044.4517.0318.9418.0518.9457.4646.0951.143.99352.6546.864.775.1418.3521.4520.2221.6649.3433.739.7931.63403.5930.225.415.7719.730.2323.930.2342.2612.5726.0611.66454.0429.036.446.821.342.6640.3160.9335.163.013.940.37503.0828.87.117.6124.561.3683.65113.524.30.350.030.001Average2.6928.843.714.0716.9324.8025.7331.8663.7548.1952.6147.36According to Table1, we can infer that there are great differences between the CPU times: TwIST is about 1.5 times faster than ReSL0, which itself can be roughly 7 times faster than SPGL1. And the SL0 has the same computational complexity as the ReSL0. From Table 1, we can see that those four methods achieve similar PSNRs and NMAEs when using signals at less than 35 locations. Table 1 also shows that the ReSL0 outperforms other three methods when using signals with more than 35 locations. Moreover, if we consider a method cannot reconstruct a high-quality image as the PSNR is less than 30, then we can conclude that the TwIST fails for all experiments, the SL0 fails when the number of sampling positions is less than 45, while the SPGL1 and ReSL0 algorithms fail when the number of sampling positions is less than 40. The numerical results in Table 1 indicate that the ReSL0 algorithm can reconstruct high-quality images with more than 40 sampling signals in a short time. From the results of simulations, we can see that the ReSL0 algorithm is more accurate than the other three algorithms in the sparse-view sampling condition.Considering the universality of the ReSL0 method, the blood vessel phantom was used as the initial energy density to additionally compare these four algorithms. The conditions of this experiment were the same as the Sheep-Logan experiment. Figure3 shows the reconstruction images of the blood vessel phantom with these four algorithms. It can be seen from Figure 3 that all these four algorithms can reconstruct accurate images by using photoacoustic signals from 40 sampling positions. When the signal of 30 sampling positions is used, all reconstructed images contain much noise, which has a certain influence on the identification of the blood vessel structure. Among these four algorithms, the ReSL0 algorithm has the best reconstruction quality, which can be observed by the middle extraction lines from the reconstructed images. However, when the sampling position is 20, none of the four algorithms can get good reconstructed image.Figure 3
Reconstruction results of the blood vessel phantom. The first to the third rows are the reconstruction images with 20-view, 30-view, and 40-view that are uniformly distributed at a 360° curve. The first to the fourth columns show the results of TwIST, SPGL1, SL0, and ReSL0 individually.Table2 shows the numerical results of the blood vessel for those four methods. Since the reconstructed image sizes of the two experiments are the same, the running time of the blood vessel experiment is similar to that of the Sheep-Logan experiment. From Table 2, we can see that the TwIST method can obtain a larger PSNR and a smaller NMAE when the number of samples is less than 30. However, the NMAE of the TwIST method is only slightly improved when the sampling position is greater than 30. And the ReSL0 method can achieve the largest PSNR and the smallest NMAE when the number of samples is greater than 30. According to Table 2, we can conclude that the TwIST method has better accuracy and efficiency when the signal number is small and the ReSL0 method obtains better quality PAI images with sufficient measurements.Table 2
Numerical results of reconstructed images.
ExperimentalCPU time (seconds)PSNR (dB)NMAEPositionsTwISTSPGSL0ReSL0TwISTSPGSL0ReSL0TwISTSPGSL0ReSL050.566.640.490.7214.5114.2814.314.41100.73103.39103.24101.96101.1917.671.021.4416.0615.8614.8715.5284.2586.2796.6189.68151.6521.681.762.0519.9418.5216.3917.7953.9363.581.1469.09202.5325.832.372.8234.1422.4319.922.2410.5140.4854.1641.38252.1819.713.293.537.8927.0125.5128.726.8323.928.419.63302.6528.073.874.1441.4231.4632.2435.794.5414.3113.088.7352.6534.984.474.8343.3539.0440.3345.643.645.985.162.8402.7318.225.225.7745.447.653.9465.242.882.231.080.29452.2921.715.856.4746.4765.387.61112.952.540.290.020.001502.488.456.817.1647.8881.64115.34115.712.160.040.0010.001Average2.0920.33.523.8934.7136.3142.0447.4027.234.0438.2933.35In order to further verify the effectiveness of the RESL0 algorithm, a more complex and challenging standard General Electric resolution phantom is also used for simulation. The reconstruction results of the four algorithms are shown in Figure4. In the first column of Figure 4, the images reconstructed by TwIST contain severe noises, which seriously affect the image quality. The second and third columns of Figure 4 are reconstructed by SPGL1 and SL0, respectively. It can be observed that both methods can suppress noise, but the quality of the reconstructed image can be further improved. The last column of Figure 4 shows the results of ReSL0, which obtain the best reconstruction quality among the four methods.Figure 4
Reconstruction results of the standard General Electric resolution phantom. The first to the third rows are the reconstruction images with 30-view, 40-view, and 50-view that are uniformly distributed at a 360° curve. The first to the fourth columns show the results of TwIST, SPGL1, SL0, and ReSL0 individually.Table3 shows the numerical results of the standard General Electric resolution phantom for those four methods. As can be seen from Table 3, the TwIST algorithm has the shortest CPU time and the CPU time of the ReSL0 algorithm is slightly slower than the SL0 algorithm, while the CPU time of the SPGL1 algorithm is always much bigger than the other three algorithms. The TwIST algorithm has the worst PSNR and the biggest NMAE, and the PSNR value of images reconstructed by the ReSL0 algorithm is the highest, and the NMAE value of images reconstructed by the ReSL0 algorithm is the lowest. From the above three experiments, we can arrive at the conclusion that the ReSL0 algorithm outperforms the other three algorithms under sparse sampling condition.Table 3
Numerical results of reconstructed images.
ExperimentalCPU time (seconds)PSNR (dB)NMAEPositionsTwISTSPGSL0ReSL0TwISTSPGSL0ReSL0TwISTSPGSL0ReSL050.378.040.450.7414.5814.4914.8114.9596.8797.5897.8993.45100.9712.471.081.514.7615.4615.415.7988.1784.3685.8680.16151.4821.621.782.0815.4316.3816.2916.6778.4974.9474.6868.14202.1531.962.552.8916.2717.3417.1817.7368.6263.5562.0554.09252.8337.573.213.481718.5718.1818.9260.9451.3649.3743.06303.3649.944.154.4817.9920.5519.9821.0251.7837.8534.5229.41353.1726.034.735.1518.9822.4322.2623.4744.3827.9322.8818.97403.0332.15.55.8520.225.0125.5226.4937.0919.3214.0411.8452.9252.296.186.8221.6427.2427.7629.1230.5113.319.16.96503.4353.996.757.1423.4930.1630.9932.9923.548.45.433.91Average2.3732.63.644.0118.0320.7620.8421.7258.0447.8645.5841


## 3.2. Comparison for Different Variances of the Noise

In order to quantify the influence of noise, the PSNR and NMAE of the reconstruction images of the Sheep-Logan phantom experiment are calculated and shown in Figure5. A good algorithm has a larger PSNR and a smaller NMAE. As can be seen from Figure 5, when there is weak noise of 50 dB and 40 dB, those four methods achieve similar PSNRs and NMAEs when using signals with less than 35 positions. Furthermore, the ReSL0 algorithm achieves the biggest PSNR and the smallest NMAE with sampling locations of more than 40 and improves PSNR faster than the other three algorithms. When there is strong noise of 30 dB and 20 dB, the SL0 algorithm and the TwIST algorithm have smaller PSNRs and larger NMAEs, but the ReSL0 algorithm can still achieve good reconstruction results with sufficient measurements. In other words, the ReSL0 algorithm achieves good reconstruction of PAI images in noisy environments.Figure 5
The PSNRs and NMAEs of reconstruction results of the Sheep-Logan phantom with different number of sampling points. (a–d) The quantitative results of noisy observation withSNR=50, 40, 30, and 20 dB, respectively.Figure6 provides the PSNR and NMAE tendency chart of the reconstruction results of the blood vessel phantom experiment with noisy observation. When the number of sampling locations is greater than 25, the ReSL0 method can achieve the largest PSNR and the smallest NMAE. These results are consistent with the results of the noiseless environment as shown in Table 2. However, the performance of the SL0 algorithm degrades rapidly due to the equality constraint in Eq. (8). According to the information gathered above, we may reach the conclusion that the ReSL0 algorithm can reconstruct high-quality PAI images regardless of noise. Besides, the SL0 algorithm that does not include noise regularization terms cannot be used in a strong noise environment. The inequality optimization constraint in Eq. (11) can provide the better performance in the noise environment.Figure 6
The PSNRs and NMAEs of reconstruction results of the blood vessel phantom with different number of sampling points. (a–d) The quantitative results of noisy observation withSNR=50, 40, 30, and 20 dB, respectively.


## 3.3. In Vitro Experiments

Besides the numerical phantom experiments, the in vitro experiments were used to demonstrate the ReSL0 algorithm’s performance. And the reconstruction results of the TwIST, SPGL1, and SL0 are also presented. A schematic diagram of the imaging system setup is displayed in Figure7(a), where an experimental coordinate system x,y,z is also described. A Q-switched Nd:YAG pumped at 532 nm was used as the light source. The laser frequency is 10 Hz, and the pulse width is 6-10 ns. A focused piezoelectric transducer (Panametrics V309) with a central frequency of 5 MHz was controlled by a precision stepper motor for photoacoustic signal acquisition. The rotation radius of the transducer is 40 mm, and the rotation step size is 2°. At each sampling location, the photoacoustic signals were first amplified by a signal amplifier, then captured and averaged 30 times by a Tektronix MSO4000B mixed signal oscilloscope, and finally transmitted to the computer for signal processing and imaging.Figure 7
(a) The schematic diagram of PAI imaging system. (b) A photograph of the imaging sample.
(a)(b)The imaging sample used in the experiment is a gelatin cylinder with one graphite rod and two hairs as optical absorbers. Figure7(b) is the photograph of the sample. The radius of the gelatin cylinder is 13 mm. The diameter of graphite rod is 0.5 mm, and the length of hair is 4 mm. In the phantom experiment, 60-view data and 90-view data are selected for reconstruction. The images are constructed by the TwIST, SPGL1, SL0, and ReSL0 algorithms, respectively.The in vitro experiment results are displayed in Figure8. The first and the second row show the reconstruction results from 60-view and 90-view experiment data. As can be seen from the first row of Figure 8, there will be a lot of noise in the reconstructed image and some low-contrast features will disappear when using 60-view experiment data. When the sampling data is sufficient, such as 90-view data, all four algorithms are able to construct good quality images. And the sizes and locations of the optical absorbers are well reconstructed. However, the resolution of reconstructed images using TwIST and SL0 algorithms is not as good as SPGL1 and ReSL0 algorithms. By comparing the results of numerical experiments and in vitro experiments, we can conclude that the quality of reconstructed images in vitro experiment is not as good as that of numerical experiments. Therefore, we need to collect more data to achieve exact reconstruction.Figure 8
The reconstruction results from 60-view and 90-view experiment data, respectively. (a–d) Results of TwIST, SPGL1, SL0, and ReSL0 individually.


## 4. Conclusion

In this paper, we carried out and estimated a L0 norm-based ReSL0 algorithm for the PAI. The main motivation of it is to replace the equality constraint with inequality constraint that allows some errors and make use of a regularization parameter to achieve a balance between the sparsity and the residual of objective function. The effectiveness and universality of this algorithm are demonstrated through numerical and in vitro experiments. Both visual inspection and quantitative measure comparisons have manifested that the ReSL0 algorithm can reconstruct better images than L1 norm and TV norm-based CS algorithms. Furthermore, the ReSL0 algorithm has similar computational efficiency to the SL0 algorithm and at the same time has better immunity to noise. Finally, the ReSL0 algorithm can significantly reduce the number of ultrasonic sensors and scanning time required to reconstruct high-quality PAI images.



---

*Source: 6689194-2021-06-01.xml*