|
|
|
|
LEADER |
01000naa a22002652 4500 |
001 |
NLM19969267X |
003 |
DE-627 |
005 |
20231223215136.0 |
007 |
cr uuu---uuuuu |
008 |
231223s2011 xx |||||o 00| ||eng c |
024 |
7 |
|
|a 10.1109/TIP.2010.2058811
|2 doi
|
028 |
5 |
2 |
|a pubmed24n0666.xml
|
035 |
|
|
|a (DE-627)NLM19969267X
|
035 |
|
|
|a (NLM)20643609
|
040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
041 |
|
|
|a eng
|
100 |
1 |
|
|a Yu, Zhou
|e verfasserin
|4 aut
|
245 |
1 |
0 |
|a Fast model-based X-ray CT reconstruction using spatially nonhomogeneous ICD optimization
|
264 |
|
1 |
|c 2011
|
336 |
|
|
|a Text
|b txt
|2 rdacontent
|
337 |
|
|
|a ƒaComputermedien
|b c
|2 rdamedia
|
338 |
|
|
|a ƒa Online-Ressource
|b cr
|2 rdacarrier
|
500 |
|
|
|a Date Completed 29.03.2011
|
500 |
|
|
|a Date Revised 09.04.2022
|
500 |
|
|
|a published: Print-Electronic
|
500 |
|
|
|a Citation Status MEDLINE
|
520 |
|
|
|a Recent applications of model-based iterative reconstruction (MBIR) algorithms to multislice helical CT reconstructions have shown that MBIR can greatly improve image quality by increasing resolution as well as reducing noise and some artifacts. However, high computational cost and long reconstruction times remain as a barrier to the use of MBIR in practical applications. Among the various iterative methods that have been studied for MBIR, iterative coordinate descent (ICD) has been found to have relatively low overall computational requirements due to its fast convergence. This paper presents a fast model-based iterative reconstruction algorithm using spatially nonhomogeneous ICD (NH-ICD) optimization. The NH-ICD algorithm speeds up convergence by focusing computation where it is most needed. The NH-ICD algorithm has a mechanism that adaptively selects voxels for update. First, a voxel selection criterion VSC determines the voxels in greatest need of update. Then a voxel selection algorithm VSA selects the order of successive voxel updates based upon the need for repeated updates of some locations, while retaining characteristics for global convergence. In order to speed up each voxel update, we also propose a fast 1-D optimization algorithm that uses a quadratic substitute function to upper bound the local 1-D objective function, so that a closed form solution can be obtained rather than using a computationally expensive line search algorithm. We examine the performance of the proposed algorithm using several clinical data sets of various anatomy. The experimental results show that the proposed method accelerates the reconstructions by roughly a factor of three on average for typical 3-D multislice geometries
|
650 |
|
4 |
|a Journal Article
|
650 |
|
4 |
|a Research Support, Non-U.S. Gov't
|
700 |
1 |
|
|a Thibault, Jean-Baptiste
|e verfasserin
|4 aut
|
700 |
1 |
|
|a Bouman, Charles A
|e verfasserin
|4 aut
|
700 |
1 |
|
|a Sauer, Ken D
|e verfasserin
|4 aut
|
700 |
1 |
|
|a Hsieh, Jiang
|e verfasserin
|4 aut
|
773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on image processing : a publication of the IEEE Signal Processing Society
|d 1992
|g 20(2011), 1 vom: 15. Jan., Seite 161-75
|w (DE-627)NLM09821456X
|x 1941-0042
|7 nnns
|
773 |
1 |
8 |
|g volume:20
|g year:2011
|g number:1
|g day:15
|g month:01
|g pages:161-75
|
856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TIP.2010.2058811
|3 Volltext
|
912 |
|
|
|a GBV_USEFLAG_A
|
912 |
|
|
|a SYSFLAG_A
|
912 |
|
|
|a GBV_NLM
|
912 |
|
|
|a GBV_ILN_350
|
951 |
|
|
|a AR
|
952 |
|
|
|d 20
|j 2011
|e 1
|b 15
|c 01
|h 161-75
|