2017
DOI: 10.1155/2017/4850317
|View full text |Cite
|
Sign up to set email alerts
|

Relaxation Factor Optimization for Common Iterative Algorithms in Optical Computed Tomography

Abstract: Optical computed tomography technique has been widely used in pathological diagnosis and clinical medicine. For most of optical computed tomography algorithms, the relaxation factor plays a very important role in the quality of the reconstruction image. In this paper, the optimal relaxation factors of the ART, MART, and SART algorithms for bimodal asymmetrical and three-peak asymmetrical tested images are analyzed and discussed. Furthermore, the reconstructions with Gaussian noise are also considered to evalua… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1

Citation Types

0
3
0

Year Published

2018
2018
2023
2023

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(3 citation statements)
references
References 36 publications
0
3
0
Order By: Relevance
“…This was due to characteristics of the ML-EM and MART algorithms being disadvantageous. As a result of these characteristics, ML-EM has a slow convergence [28][29][30][31], which means that a relatively large number of iterations is required to obtain an acceptable value of the objective function, and MART is more susceptible to noise [32,33], which may result in an increase of the convergence rate with increasing iterative steps due to the noisy projection, as typically seen at = 0 and 1 in Figure 3, respectively.…”
Section: Resultsmentioning
confidence: 99%
“…This was due to characteristics of the ML-EM and MART algorithms being disadvantageous. As a result of these characteristics, ML-EM has a slow convergence [28][29][30][31], which means that a relatively large number of iterations is required to obtain an acceptable value of the objective function, and MART is more susceptible to noise [32,33], which may result in an increase of the convergence rate with increasing iterative steps due to the noisy projection, as typically seen at = 0 and 1 in Figure 3, respectively.…”
Section: Resultsmentioning
confidence: 99%
“…3. Eigenvalue and eigenvector of this cell are used to estimate the magnitude and phase of the new source in the scene [21, 27–32]ψfalse(SMARTfalse)=][1em4ptψxxψxyψxzψyxψyyψyzψzxψzyψzz Vi=γiui In (21), ui,γi are the eigenvectors and eigenvalues for each cell of the vector image defined by (18). Vi, is the pixel vector representation.…”
Section: Suppression Algorithmmentioning
confidence: 99%
“…They also focus on other parameters, such as operating frequency, number of TXs and RXs and their geometry. Improving the capability of the RFT systems to detect and reconstruct the image of weak returns that are surrounded by strong scatterers is established by the authors in [19–21]. They have considered ways to improve laser object detection when surrounded by strong scatterers in measurement domain.…”
Section: Introductionmentioning
confidence: 99%