Future Generation Computer Systems 126 (2022) 289–294

Contents lists available at ScienceDirect

Future Generation Computer Systems

journal homepage: www.elsevier.com/locate/fgcs

A fast-iterative reconstruction algorithm for sparse angle CT based on

compressed sensing
Jia Wu
School of Medical Information and Engineering, Southwest Medical University, Luzhou 646000, China

article info a b s t r a c t

Article history: When conducting computed tomography (CT) image reconstruction, the existing algorithms do not
Received 30 October 2020 analyze the physical and mathematical bases of CT image reconstruction, which leads to the lack
Received in revised form 11 August 2021 of detailed information of reconstructed images and the problem of poor reconstruction effect. In
Accepted 18 August 2021
this research, compressed sensing theory is applied in the process of fast-iterative CT reconstruction.
Available online 20 August 2021
The physical and mathematical basis for CT reconstruction is analyzed. A fast-iterative reconstruction
Keywords: algorithm for sparse angle CT images is proposed. Combined with algebraic iterative algorithm
Compressed sensing theory and gradient total variation minimization algorithm, CT reconstruction problem is transformed into
Sparse angle gradient optimal solution problem, to complete the fast-iterative reconstruction of sparse angle CT
CT image reconstruction images. Experimental results show that the proposed algorithm has high signal-to-noise ratio for CT
Iterative reconstruction image reconstruction, small reconstruction error, and good reconstruction effect for sparse angle CT
Gradient total variation minimization images.
algorithm
© 2021 Elsevier B.V. All rights reserved.

1. Introduction related research focuses on using the projection data obtained

CT technology has been extensively used in the field of medical
diagnosis and industrial detection [1]. After years of development,
CT technology has shortened the scanning time, increased the
speed of reconstruction, and has continuously improved its sta-
tus in clinical diagnosis. The working principle of fast-iterative
CT reconstruction is to obtain target cross-sectional data and
information through multi-directional ray projection measure-
ment. It is a non-destructive testing method, and provides an
effective method for the damage and pathological analysis of
objects of interest. In the process of medical diagnosis, exces-
sive radiation dose will cause great harm to the human body.
When collecting signals for medical diagnosis, the compressed
sensing theory should compress the data appropriately, and the
sampling method must follow the sampling theorem, where the
amount of sampled data is large, and then the sampled data is
compressed. Compressed sensing theory is aimed at sparsely rep-
resented signals, and data acquisition and data compression are
a good method. The key is to accurately restore the original high-
dimensional data from the compressed low-dimensional data of
CT images, which is of great significance for verifying the accuracy
of the sampling process [2]. In recent years, with the improve-
ment of people’s self-health awareness and the development of
radiology, people hope to reduce the radiation dose as much as
possible on the premise of ensuring the quality of CT imaging, and
E-mail address: wujia@swmu.edu.cn.
from sparse angles to reconstruct high-quality CT images.
The algorithm in reference [3] improved the FDK algorithm
on the basis of the periodic characteristics of the trigonometric
function, and realized the CT reconstruction through the CPU se-
rial processing the projection data. The algorithm did not analyze
the physical basis of the CT image reconstruction, resulting in the
lack of detailed information in the reconstructed CT image, which
reduced the quality of CT image reconstruction. The algorithm
in reference [4] processed the CT image by edge refinement,
obtained the structure tensor of the image, and extracted the
structure data and direction data of the CT image. They used
the total variation method to update the weight and direction.
In the threshold algorithm, the alternating direction multiplier
algorithm was introduced to realize the reconstruction of CT
images. The algorithm did not analyze the mathematical basis of
CT image reconstruction, resulting in a larger normalized average
absolute distance and normalized mean square distance of the
reconstructed CT image, and also caused poor reconstruction
effect. The method in reference [5] replaced the CT reconstruction
problem with the optimization problem. They set the fidelity item
and the constraint item, selected the least square function and
the L1 norm dictionary respectively to establish the image re-
construction objective function, and finally completed the image
reconstruction. In the worst case, the reconstructed CT image
by the algorithm had a large distance. Reference [6] proposed a
fast 4D cone-beam CT image reconstruction algorithm based on
the OSC-TV algorithm. The 4D cone-beam computed tomography

https://doi.org/10.1016/j.future.2021.08.013
0167-739X/© 2021 Elsevier B.V. All rights reserved.
J. Wu Future Generation Computer Systems 126 (2022) 289–294

allowed time-resolved imaging to have a good application in
radiotherapy, but it posed special challenges in terms of image
quality and calculation time. Using GPU accelerated ordered sub-
set convex algorithm, combined with total variation minimization
regularization technology, a fast and accurate 4D algorithm was
proposed. Different initialization schemes were investigated to
make the OSC-TV algorithm suitable for 4D reconstruction. The
reconstruction algorithm was tested on dynamic digital models
and clinical data sets. All methods could fully display the breath-
ing movement. Compared with the McKinnon–Bates algorithm
and the adaptive steepest descent convex set projection algo-
rithm, 4D reconstruction could obtain better image quality. The
OSC-TV reconstruction method combined the FDK reconstruction
and 4dcosc-TV reconstruction, and the reconstruction time was
4.5 min. This relatively short reconstruction time is conducive
to clinical applications. By reducing the data acquisition angle,
reducing the X-ray intensity, and reducing the scanning time, this
method can reduce the X-ray radiation measurement, thereby
solving the radiation problem. However, the integrity of the pro-
jection data will be affected by the above operations, resulting
in a lower quality of reconstruction of CT images. Therefore,
it is necessary to analyze and research the CT reconstruction
algorithm.
In order to solve the problems in the above algorithms, a
fast-iterative reconstruction algorithm for sparse angle CT images
based on compressed sensing is proposed in this research. The
proposed reconstruction algorithm is suitable for sparse angle
CT image reconstruction, and has a strong reconstruction ability
for interested regions, which lays a foundation for medical CT
reconstruction, industrial non-destructive testing and other fields.
2. Bases of CT reconstruction
The fast-iterative reconstruction of sparse angle CT images
includes the following two bases:
It is assumed that µ1 , µ2 , . . . , µn represent the attenuation
coefficients of each element body in the X-ray propagation di-
rection, and the attenuation corresponding to the X-ray after
the first element body is described by I1 = I0 e−µ1 d . Then the
corresponding attenuation of the X-ray after passing through the
−µ d
element body is obtained in the same way as In = In−1n . At this
time, we have:
I = I0 e−(µ1 ,µ2 ,...,µn )d (2)
If the object belongs to an inhomogeneous medium in the
2D plane, that is, the value of d is close to zero. Then the total
attenuation value p corresponding to the ray in the path L can be
calculated by:
∫
I0
p= µ(l)dl = ln (3)
L I
where p represents the measured value obtained by the detector
for the ray intensity; µ(l) represents the attenuation coefficient
corresponding to the object to be measured in the 2D plane.
From the above analysis, it can be seen that the line integral
p is the essence of CT reconstruction.
The attenuation coefficient µw of water has a small difference
from that of human tissues (µ), so the difference between human
tissues cannot be clearly reflected only by linear attenuation
coefficient [10]. In order to solve the above problems, a fast-
iterative reconstruction algorithm for sparse angle CT images
based on compressed sensing uses a function H to replace the
linear attenuation in the CT reconstruction process:
µt − µw
H= × 1000 (4)
µw
where µt represents the attenuation coefficient corresponding to
the tissue.
2.2. Mathematical basis

2.1. Physical basis It is supposed that f (x, y) represents the function density cor-
responding to the 2D real space R2 . In the 2D space R2 , the Radon
When an X-ray is projected on the surface of an object, the transformation of the function density f (x, y) along a straight line
ray is divided into two different parts. The object will scatter and s = x cos θ + y sin θ [11] can be described:
absorb the projected X-ray, causing a part of the ray to gradually ∫ ∞
attenuate, and the other part to continue to propagate along the p(s, θ ) = δ sdxdy (5)
propagation path. Different objects have different atomic compo- −∞
sition, density and thickness, so there is a gap in the degree of where δ represents the Dirac function.
radiation absorption [7]. The test objects are sparse angle CT images, and the region
It is supposed that the thickness of the projected object is x, of interest in the sparse angle CT image is reconstructed. The test
and µ is used to describe the attenuation coefficient of the object images come from an authoritative image library, and the test set
in the ray attenuation process. The X-ray source and detector are contains 100 sparse angle CT images.
placed in front of and behind the object, the main purpose of The steps of the fast-iterative reconstruction algorithm for
which is to receive X-rays [8,9]. sparse-angle CT images based on compressed sensing are sum-
When an X-ray with an intensity of I0 is incident on an object, marized as follows:
the output intensity I obtained by the detector from detecting the Step 1: Obtain the global mean and global variance of the
object at this time satisfies: sparse-angle CT images according to the statistical matrix.
I0 m
µ = ln (1) ∑
I JC = Ri (6)
The projected medium is usually a non-uniform medium, and i=0
∑
the medium in the propagation path l is set to be uniform. In FC2 = [Ri − M]2 (7)
the propagation path, the medium through which the X-ray is
transmitted is divided to obtain a number of small squares to where Ri represents the data value of the area to be measured in
ensure that the thickness of the square is d, the size is the same, the sparse angle CT image, and M represents the prediction data.
and the medium existing in the block can be described by the Step 2: Obtain the local mean and local variance of the pixel
uniform medium. The attenuation coefficients corresponding to (x, y) in the sparse angle CT image.
the small squares obtained at this time are all µ. If the ray passes m
∑
through the same fault of the human body, the small square
( )
WE = Ri × u re,t (8)
belongs to the element body at this time. i=0

290
J. Wu Future Generation Computer Systems 126 (2022) 289–294
∑
[Ri − M]2 × u re,t
( )
RJH = (9) where xi,j describes the gray value corresponding to the pixel in
the ith row and jth column of the CT image.
Step 3: Whether the pixel (x, y) meets the requirements of
In the CT reconstruction process, after one iteration is com-
sparse angle CT image enhancement can be determined by:
pleted by the algebraic iteration method and the total variation
WE ≤ k0 RJH (10) minimization method, the total variation of the CT image is
adjusted by the gradient descent method [17]:
Step 4: The pixel gray scale when the enhancement require-
ments are met can be calculated by: ∂ TVx(i,nj )
(n+1)
xi,j = x(i,nj ) − (16)
G1 (x, y) = P × f (x, y) (11) ∂ x(i,nj )
where P represents the enhancement factor. The problem of compressed sensing solving can usually be
3. Iterative reconstruction algorithm transformed into the problem of convex optimization optimal
solution [18,19]. In the process of compressed sensing solving,
Based on the above research, the use of compressed sensing trilinear interpolation and access operations must be repeated,
can effectively reduce the radiation dose of sparse angle CT rays and texture memory can be considered for buffering. The data
to the patient, and has a higher signal-to-noise ratio compared is bound to the 3D texture memory. The texture memory has a
with the low-dose strategy. However, the reconstruction result caching mechanism. We can select several adjacent coordinates
of the CT fast-iterative reconstruction algorithm under the sparse at one time to increase the texture cache hit rate and its access
angle view often produces a large number of striped artifacts, requirements are not as strict as the global memory. In addition,
which leads to shadows during the reconstruction and seriously hardware-accelerated linear interpolation operation can be used.
affects the quality of the reconstructed image. The reconstruc- In 1D case, two pixels on both sides of texture coordinates are
tion algorithm effectively improves the reconstruction effect by used for linear interpolation, and in 2D case, four pixels around
introducing prior knowledge into the objective function. texture coordinates are used for bilinear interpolation. The above-
According to the bases of CT reconstruction, the compressed mentioned characteristics of texture storage enable the kernel
sensing theory is applied to the fast-iterative reconstruction pro- function to complete the compressed sensing texture extraction
cess of sparse angle CT images [12].
operation in a faster manner, effectively reducing the impact of
When the original signal of the CT image meets the sparsity
storage delay on the execution efficiency of the kernel function.
constraint, the image is transformed into a low-dimensional ob-
Through the above analysis, the objective function of sparse angle
servation space by performing correlation projection processing
through the measurement matrix. The important information in CT image reconstruction can be described by:
the original CT image signal usually exists in the projection, so min ∥Ψ µ∥pp
{
the problem of high-dimensional signal reconstruction in the µ
(17)
original CT image can be transformed into a sparse optimization s. t . Φµ = y
problem [13].
Assuming that x represents the original signal of CT image, The fast-iterative reconstruction algorithm for sparse angle
Φ represents the projection matrix, and Ψ represents the sparse CT based on compressed sensing obtains the optimal solution
transformation, then y = Φ x can be used to describe the obser- through the gradient descent method, and the image Lp norm
vation values obtained through compressed sensing [14,15]. The TVp (x) can be calculated by:
objective function of reconstructing CT image using compressed ⎛ ⎞1/p
sensing theory is as follows: ∑
{
min ∥Ψ µ∥0 TVp (x) = ⎝ |∇ xi,j |p ⎠ (18)
µ i,j
(12)
s.t . Φµ = y By deriving the point xi,j in the CT image through TVp (x):
where µ describes the reconstructed CT image. The above for- ∂ TVp (xi,j ) ∂ TVp (xi,j ) ∂|xi,j |
mula belongs to an NP-Hard problem, and the solution process = · (19)
is complicated. Therefore, the fast-iterative reconstruction algo- ∂ xi,j ∂|∇ xi,j | ∂ xi,j
rithm for sparse angle CT based on compressed sensing replaces The specific process of the proposed algorithm for fast-iterative
the signal recovery problem with the problem of minimizing the reconstruction of sparse angle CT is as follows:
L1 norm. The above formula can be transformed into: (1) Set the number of gradient descent method and algebraic
min ∥Ψ µ∥1 iteration to Ngrad and N respectively, and set the corresponding
{
µ
(13) relaxation factors to α and λ, respectively, and initialize the CT
s.t . Φµ = y image as x(0) = 0.
(2) Use the algebraic iteration method to complete an iteration
When reconstructing a CT image, the gradient model is gen-
through the following formula, and obtain an iteration result xiART :
erally sparse [16], so the proposed algorithm can achieve CT
reconstruction by minimizing the total variation based on the
compressed sensing theory: αi xiART
−1
(n)
xiART (n + 1) = xiART
−1
(n) + λ αi (20)
min ∥Ψ µ∥TV αi2
{
µ
(14)
where αi represents the data element in the ith row of the
s.t . Φµ = y
system matrix; i = 1, 2, . . . , M describes the ray number; n =
where TV represents the total variation corresponding to the 1, 2, . . . , N represents the number of iterations.
original CT image x, and its calculation formula is as follows: (3) Introduce non-negative constraints in the iteration results:
⎧ ∑
⎨TV (x) =
⎪ |∇ xi,j |
xM xM
{
i,j
(15) ART (n) ART (n) ≥ 0
xART (n) = (21)
√
ART (n) < 0
⎩∇ xi,j = (xi,j+1 − xi,j )2 + (xi+1,j − xi,j )2
⎪
0 xM
291
J. Wu
Fig. 1. Process of the proposed fast-iterative reconstruction algorithm.
(4) The iterative result obtained by using the gradient descent
method is x1TVM [20]:
x1TVM (n) = xM
ART (n)
Set step factor dA :
dA = ∥x0ART (n) − xM
ART (n)∥
(5) The fast-iterative reconstruction algorithm for sparse angle
CT based on compressed sensing along the Lp norm of the image
gradient performs related iterations through the gradient descent
method [21,22]:
xiTVM (n) = xiART
−1
(n) − α dA
(6) Set the conditions for stopping iterations as the number of
iterations is higher than the maximum number of iterations, or
the step factor dA is at the minimum. Fast-iterative reconstruction
of sparse angle CT is completed, and the reconstructed CT image
is output.
The fast-iterative reconstruction algorithm for sparse angle CT
based on compressed sensing is illustrated in Fig. 1.
4. Experiments and results
In order to verify the overall effectiveness of the proposed fast-
iterative reconstruction algorithm, experiments were performed
using the proposed algorithm, reference [3] algorithm and ref-
erence [4] algorithm. The reconstruction results are shown in
Fig. 2.
It can be seen from Fig. 2 that the CT image reconstructed by
the proposed algorithm was basically consistent with the actual
CT image, and that the image reconstructed by reference [3]
algorithm and reference [4] algorithm missed some information
compared with the original CT image. After testing, it could be
seen that the proposed algorithm could effectively complete the
CT image reconstruction, because the proposed algorithm ana-
lyzed the bases of CT reconstruction. In the proposed algorithm,
Future Generation Computer Systems 126 (2022) 289–294
Fig. 2. Reconstruction results of different algorithms.
(22)
the compressed sensing theory was used to complete the fast-
iterative reconstruction of sparse angle CT based on the physical
and mathematical bases, which improved the completeness of CT
(23)
image reconstruction.
The normalized average absolute distance r is sensitive to the
error of the reconstructed image. Therefore, r can be used to
compare the closeness of the reconstructed image to the original
image. The smaller the value of r, the closer the reconstructed
image is to the original image. r can be calculated by:
(24) ∑N ′
i=1 |xi − xi |
r = ∑N (25)
i=1 |xi |
where xi and x′i represent the pixel values corresponding to the
original CT image and the reconstructed CT image, respectively.
The test results of normalized average absolute distance of
the proposed algorithm, reference [3] algorithm and reference [4]
algorithm are shown in Fig. 3.
According to the data in Fig. 3, as the number of CT images
increased, the normalized average distance of the three algo-
rithms also increased, but the normalized average distance of
the proposed algorithm was always within 0.10. Comparing test
results of the proposed algorithm, reference [3] algorithm and ref-
erence [4] algorithm, it can be found that the normalized average
distance of the proposed algorithm was the smallest, indicating
that the CT image reconstructed by the proposed algorithm was
the closet to the original image.
The smaller the value of the normalized mean square distance
d, the higher the signal-to-noise ratio of the reconstructed CT
image, and the smaller the reconstruction error. The normalized
mean square distance d can be calculated by:
[∑ ]1/2
N
i=1 (xi− x′i )2
d= N
(26)
∑
i=1 (xi − x)
292
J. Wu
Table 1
The worst-case distance of different algorithms.
Experiment Worst case distance
number
The proposed
algorithm
1 0.418
2 0.406
3 0.411
4 0.419
5 0.417
Fig. 3. Normalized average distance of different algorithms.
Fig. 4. Test results of normalized mean square distance.
where x represents the average value of pixels.
The normalized mean square distance of the proposed al-
gorithm, reference [3] algorithm and reference [4] algorithm is
shown in Fig. 4.
Fig. 4 shows that the proposed algorithm had the smallest nor-
malized mean square distance in multiple iterations, followed by
reference [4] algorithm and reference [3] algorithm. According to
the test results, the CT image reconstructed by the proposed algo-
rithm had a high signal-to-noise ratio and a small reconstruction
error.
The worst-case distance was used as the test index, and the
reconstruction effect of the proposed algorithm, reference [3]
algorithm and reference [4] algorithm was further tested. The
smaller the worst-case distance, the shorter the reconstruction
time and the better the reconstruction effect. The test results of
the proposed algorithm, reference [3] algorithm and reference [4]
algorithm are shown in Table 1.
293
Future Generation Computer Systems 126 (2022) 289–294
Reference [3] Reference [4]
algorithm algorithm
0.489 0.499
0.477 0.486
0.498 0.485
0.492 0.483
0.485 0.490
According to the data in Table 1, in the process of multiple CT
reconstruction tests, the worst-case distance obtained by the pro-
posed algorithm was below 0.420, which was much lower than
that by reference [3] algorithm and reference [4] algorithm. This
indicated that the proposed algorithm could efficiently complete
the fast-iterative reconstruction of sparse angle CT, because it an-
alyzed the relevant reconstruction bases before CT reconstruction,
which also improved the reconstruction efficiency.
5. Conclusion
CT imaging technology is widely used in the medical field.
This technology can scan and collect projection data at multiple
angles, and reconstruct images based on the acquired data. CT
technology is widely used in computer graphics, remote sensing
radar, geological survey, radiation physics and other academic
fields, and has now become an important detection tool. Tra-
ditional reconstruction methods have poor performance when
reconstructing images. In this research, the compressed sensing
theory is applied to the process of CT image reconstruction, and
the fast-iterative reconstruction for sparse angle CT is completed
according to the physical and mathematical bases of CT image
reconstruction, which improves the quality of CT image recon-
struction. This research has solved the problems in the existing
algorithm, which lays a solid foundation for the application and
development of CT imaging technology.
The fast-iterative reconstruction algorithm for sparse angle CT
is still under development. Among them, the parameters are the
key to the reconstruction results, and the selection of optimiza-
tion or sub-optimization parameters requires a lot of experimen-
tal research. For large-scale reconstruction scenes, using a GPU
may cost a long time or storage capacity, which cannot meet
the demand. The programming method of multi-GPU platform
can be constructed to accelerate the fast-iterative reconstruction
for sparse angle CT. Because the calculation of this algorithm is
relatively complicated, it is not suitable for 3D reconstruction, and
the future research can analyze the time complexity.
Declaration of competing interest
The authors declare that they have no known competing finan-
cial interests or personal relationships that could have appeared
to influence the work reported in this paper.
References
[1] Marc, Dewey, Peter, et al., Deep learning and medical diagnosis, Lancet
394 (10210) (2019) 1710–1711.
[2] J.A. Seibert, Projection X-ray imaging: Radiography, mammography,
fluoroscopy, Health Phys. 116 (2) (2019) 148–156.
[3] B. Zhang, Z.Q. Zhang, Wang. Hongkai, Wang hongkai research on GPU-
accelerated cone beam CT reconstruction algorithm, Comput. Eng. Appl.
55 (04) (2019) 208–213.
[4] M. Zhang, Y.X. Liang, Y. Chen, et al., Adaptive sparse angle CT reconstruc-
tion algorithm based on structure tensor, J. Northwest Univ. Nat. Sci. 41
(03) (2020) 261–266.
J. Wu
[5] J.F. Wu, X.Q. Mou, L_1 norm dictionary constraint region of interest CT
image reconstruction algorithm, J. Xi’an Jiaotong Univ. 53 (02) (2019)
163–169.
[6] J. Mascolofortin, D. Matenine, L. Archambault, et al., A fast 4D cone beam
CT reconstruction method based on the OSC-TV algorithm, J. Xray Sci.
Technol. 26 (2) (2018) 1–20.
[7] W. Wu, F. Liu, Y. Zhang, et al., Non-local low-rank cube-based tensor
factorization for spectral CT reconstruction, IEEE Trans. Med. Imaging 38
(4) (2019) 1079–1093.
[8] A. Ghazanfari, S. Marasini, T. Tegafaw, et al., X-ray attenuation properties of
ultra small Yb2 O3 nanoparticles as a high-performance CT contrast agent,
J. Korean Phys. Soc. 74 (3) (2019) 286–291.
[9] P. Jagdale, M. Rovere, R. Ronca, et al., Determination of the X-ray attenua-
tion coefficient of bismuth oxychloride nanoplates in polydimethylsiloxane,
J. Mater. Sci. 55 (16) (2020) 7095–7105.
[10] E.E. Ermis, C. Celiktas, A different method to determine the gamma-ray
linear attenuation coefficient, Instrum. Exp. Tech. 64 (2) (2021) 318–320.
[11] S. Kolouri, X. Yin, Rohde G.K., Neural networks, hypersurfaces, and the
generalized radon transform [Lecture notes], IEEE Signal Process. Mag. 37
(4) (2020) 123–133.
[12] L. Vinas, J. Scholey, M. Descovich, et al., Improved contrast and noise
of megavoltage computed tomography (MVCT) through cycle-consistent
generative machine learning, Med. Phys. 48 (2) (2020) 1–9.
[13] Y. Tian, X. Zhang, C. Wang, et al., An evolutionary algorithm for large-scale
sparse multi objective optimization problems, IEEE Trans. Evol. Comput. 24
(2) (2020) 380–393.
294
Future Generation Computer Systems 126 (2022) 289–294
[14] Y. Ding, L. Su, D. Jin, New fast multi-user beam training scheme based
on compressed sensing theory for millimetre-wave communication, IET
Commun. 13 (6) (2019) 642–648.
[15] B. Bernstein, S. Liu, C. Papadaniil, et al., Sparse recovery beyond com-
pressed sensing: Separable nonlinear inverse problems, IEEE Trans. Inform.
Theory 1 (4) (2020) 5904–5926.
[16] B.N. Patro, M. Lunayach, V.P. Namboodiri, Uncertainty class activation map
(U-CAM) using gradient certainty method, IEEE Trans. Image Process. 8 (1)
(2021) 1910–1924.
[17] J. Chen, D. Liu, X. Li, Nonconvex rectangular matrix completion via gradient
descent without 2, ∞ regularization, IEEE Trans. Inform. Theory 4 (4)
(2020) 5806–5841.
[18] M. Abedi, B. Sun, Z. Zheng, A sinusoidal-hyperbolic family of transforms
with potential applications in compressive sensing, IEEE Trans. Image
Process. 7 (5) (2019) 1057–7149.
[19] Z. Chen, K. Fan, S. Wang, et al., Intermediate deep feature compression:
Toward intelligent sensing, IEEE Trans. Image Process. 25 (9) (2019)
2230–2243.
[20] Y. Cui, D. Wu, J. Huang, Optimize TSK fuzzy systems for classification
problems: Mini-batch gradient descent with uniform regularization and
batch normalization, IEEE Trans. Fuzzy Syst. 17 (1) (2020) 3065–3075.
[21] C. Ma, Y. Li, Y. Chi, Beyond procrustes: Balancing-free gradient descent
for asymmetric low-rank matrix sensing, IEEE Trans. Signal Process. 30 (3)
(2021) 13–20.
[22] S. Ye, S. Ravishankar, Y. Long, et al., SPULTRA: Low-dose CT image
reconstruction with joint statistical and learned image models, IEEE Trans.
Med. Imaging 27 (8) (2019) 1–10.