Fast Low-Dose Reconstruction From Truncated Data in Dental CT
To reduce the radiation dose in dental computed tomography (CT), backprojection-filtration (BPF) algorithm is the preferred choice as it can reconstruct images from truncated data within limited scanning angle, thereby reducing radiation dose and avoiding irradiation to the brain. However, the integ...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on nuclear science 2013-02, Vol.60 (1), p.174-181 |
---|---|
Hauptverfasser: | , , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 181 |
---|---|
container_issue | 1 |
container_start_page | 174 |
container_title | IEEE transactions on nuclear science |
container_volume | 60 |
creator | Wang, Xianchao Hu, Guoen Yan, Bin Han, Yu Li, Lei Bao, Shanglian |
description | To reduce the radiation dose in dental computed tomography (CT), backprojection-filtration (BPF) algorithm is the preferred choice as it can reconstruct images from truncated data within limited scanning angle, thereby reducing radiation dose and avoiding irradiation to the brain. However, the integral interval of backprojection is variable for every PI-line which causes the calculation efficiency and parallel performance to be low. In this paper, the tent BPF method (T-BPF) was developed, which was performed by firstly rearranging the cone-beam data to tent-like parallel-beam data, and then applying the proposed BPF-type algorithm to reconstruct images from the rearranged data. T-BPF turns the variable integral interval of backprojection into fixed integral interval, which means the reconstruction efficiency and the parallel performance of T-BPF are improvements over those of the original BPF algorithm. The experiments of numerical simulation and real data reconstruction show that the reconstruction efficiency of T-BPF is faster than the original BPF algorithm and the FDK algorithm in the case of comparable reconstruction quality. The results demonstrate that the proposed T-BPF is good at achieving fast low-dose reconstruction from truncated projection data in dental CT. |
doi_str_mv | 10.1109/TNS.2012.2236653 |
format | Article |
fullrecord | <record><control><sourceid>crossref_RIE</sourceid><recordid>TN_cdi_crossref_primary_10_1109_TNS_2012_2236653</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>6423850</ieee_id><sourcerecordid>10_1109_TNS_2012_2236653</sourcerecordid><originalsourceid>FETCH-LOGICAL-c263t-2c1ab53ee143685a51eb4a1cc7d914a98cee0db4bc1c2c712ff08b80468c26da3</originalsourceid><addsrcrecordid>eNo9j01LxDAURYMoWEf3gpv8gda8fDVduJCpHYWioHVd0vQVKjOtJBnEf2-HGVxdLtxz4RByCywDYMV98_qRcQY841xorcQZSUApk4LKzTlJGAOTFrIoLslVCF9LlYqphDxUNkRazz9pOQek7-jmKUS_d3GcJ1r5eUcbv5-cjdjT0kZLx4mWOEW7pevmmlwMdhvw5pQr8lk9NevntH7bvKwf69RxLWLKHdhOCUSQQhtlFWAnLTiX9wVIWxiHyPpOdg4cdznwYWCmM0xqsxz0VqwIO_46P4fgcWi__biz_rcF1h7020W_Pei3J_0FuTsiIyL-z7Xkwigm_gD7YFXJ</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Fast Low-Dose Reconstruction From Truncated Data in Dental CT</title><source>IEEE Electronic Library (IEL)</source><creator>Wang, Xianchao ; Hu, Guoen ; Yan, Bin ; Han, Yu ; Li, Lei ; Bao, Shanglian</creator><creatorcontrib>Wang, Xianchao ; Hu, Guoen ; Yan, Bin ; Han, Yu ; Li, Lei ; Bao, Shanglian</creatorcontrib><description>To reduce the radiation dose in dental computed tomography (CT), backprojection-filtration (BPF) algorithm is the preferred choice as it can reconstruct images from truncated data within limited scanning angle, thereby reducing radiation dose and avoiding irradiation to the brain. However, the integral interval of backprojection is variable for every PI-line which causes the calculation efficiency and parallel performance to be low. In this paper, the tent BPF method (T-BPF) was developed, which was performed by firstly rearranging the cone-beam data to tent-like parallel-beam data, and then applying the proposed BPF-type algorithm to reconstruct images from the rearranged data. T-BPF turns the variable integral interval of backprojection into fixed integral interval, which means the reconstruction efficiency and the parallel performance of T-BPF are improvements over those of the original BPF algorithm. The experiments of numerical simulation and real data reconstruction show that the reconstruction efficiency of T-BPF is faster than the original BPF algorithm and the FDK algorithm in the case of comparable reconstruction quality. The results demonstrate that the proposed T-BPF is good at achieving fast low-dose reconstruction from truncated projection data in dental CT.</description><identifier>ISSN: 0018-9499</identifier><identifier>EISSN: 1558-1578</identifier><identifier>DOI: 10.1109/TNS.2012.2236653</identifier><identifier>CODEN: IETNAE</identifier><language>eng</language><publisher>IEEE</publisher><subject>Algorithm design and analysis ; Approximation algorithms ; Band pass filters ; BPF algorithm ; Computed tomography ; dental CT ; Dentistry ; Detectors ; Image reconstruction ; rebinning ; truncated data</subject><ispartof>IEEE transactions on nuclear science, 2013-02, Vol.60 (1), p.174-181</ispartof><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c263t-2c1ab53ee143685a51eb4a1cc7d914a98cee0db4bc1c2c712ff08b80468c26da3</citedby><cites>FETCH-LOGICAL-c263t-2c1ab53ee143685a51eb4a1cc7d914a98cee0db4bc1c2c712ff08b80468c26da3</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/6423850$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>315,781,785,797,27929,27930,54763</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/6423850$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Wang, Xianchao</creatorcontrib><creatorcontrib>Hu, Guoen</creatorcontrib><creatorcontrib>Yan, Bin</creatorcontrib><creatorcontrib>Han, Yu</creatorcontrib><creatorcontrib>Li, Lei</creatorcontrib><creatorcontrib>Bao, Shanglian</creatorcontrib><title>Fast Low-Dose Reconstruction From Truncated Data in Dental CT</title><title>IEEE transactions on nuclear science</title><addtitle>TNS</addtitle><description>To reduce the radiation dose in dental computed tomography (CT), backprojection-filtration (BPF) algorithm is the preferred choice as it can reconstruct images from truncated data within limited scanning angle, thereby reducing radiation dose and avoiding irradiation to the brain. However, the integral interval of backprojection is variable for every PI-line which causes the calculation efficiency and parallel performance to be low. In this paper, the tent BPF method (T-BPF) was developed, which was performed by firstly rearranging the cone-beam data to tent-like parallel-beam data, and then applying the proposed BPF-type algorithm to reconstruct images from the rearranged data. T-BPF turns the variable integral interval of backprojection into fixed integral interval, which means the reconstruction efficiency and the parallel performance of T-BPF are improvements over those of the original BPF algorithm. The experiments of numerical simulation and real data reconstruction show that the reconstruction efficiency of T-BPF is faster than the original BPF algorithm and the FDK algorithm in the case of comparable reconstruction quality. The results demonstrate that the proposed T-BPF is good at achieving fast low-dose reconstruction from truncated projection data in dental CT.</description><subject>Algorithm design and analysis</subject><subject>Approximation algorithms</subject><subject>Band pass filters</subject><subject>BPF algorithm</subject><subject>Computed tomography</subject><subject>dental CT</subject><subject>Dentistry</subject><subject>Detectors</subject><subject>Image reconstruction</subject><subject>rebinning</subject><subject>truncated data</subject><issn>0018-9499</issn><issn>1558-1578</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2013</creationdate><recordtype>article</recordtype><sourceid>RIE</sourceid><recordid>eNo9j01LxDAURYMoWEf3gpv8gda8fDVduJCpHYWioHVd0vQVKjOtJBnEf2-HGVxdLtxz4RByCywDYMV98_qRcQY841xorcQZSUApk4LKzTlJGAOTFrIoLslVCF9LlYqphDxUNkRazz9pOQek7-jmKUS_d3GcJ1r5eUcbv5-cjdjT0kZLx4mWOEW7pevmmlwMdhvw5pQr8lk9NevntH7bvKwf69RxLWLKHdhOCUSQQhtlFWAnLTiX9wVIWxiHyPpOdg4cdznwYWCmM0xqsxz0VqwIO_46P4fgcWi__biz_rcF1h7020W_Pei3J_0FuTsiIyL-z7Xkwigm_gD7YFXJ</recordid><startdate>20130201</startdate><enddate>20130201</enddate><creator>Wang, Xianchao</creator><creator>Hu, Guoen</creator><creator>Yan, Bin</creator><creator>Han, Yu</creator><creator>Li, Lei</creator><creator>Bao, Shanglian</creator><general>IEEE</general><scope>97E</scope><scope>RIA</scope><scope>RIE</scope><scope>AAYXX</scope><scope>CITATION</scope></search><sort><creationdate>20130201</creationdate><title>Fast Low-Dose Reconstruction From Truncated Data in Dental CT</title><author>Wang, Xianchao ; Hu, Guoen ; Yan, Bin ; Han, Yu ; Li, Lei ; Bao, Shanglian</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c263t-2c1ab53ee143685a51eb4a1cc7d914a98cee0db4bc1c2c712ff08b80468c26da3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2013</creationdate><topic>Algorithm design and analysis</topic><topic>Approximation algorithms</topic><topic>Band pass filters</topic><topic>BPF algorithm</topic><topic>Computed tomography</topic><topic>dental CT</topic><topic>Dentistry</topic><topic>Detectors</topic><topic>Image reconstruction</topic><topic>rebinning</topic><topic>truncated data</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Wang, Xianchao</creatorcontrib><creatorcontrib>Hu, Guoen</creatorcontrib><creatorcontrib>Yan, Bin</creatorcontrib><creatorcontrib>Han, Yu</creatorcontrib><creatorcontrib>Li, Lei</creatorcontrib><creatorcontrib>Bao, Shanglian</creatorcontrib><collection>IEEE All-Society Periodicals Package (ASPP) 2005-present</collection><collection>IEEE All-Society Periodicals Package (ASPP) 1998-Present</collection><collection>IEEE Electronic Library (IEL)</collection><collection>CrossRef</collection><jtitle>IEEE transactions on nuclear science</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Wang, Xianchao</au><au>Hu, Guoen</au><au>Yan, Bin</au><au>Han, Yu</au><au>Li, Lei</au><au>Bao, Shanglian</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Fast Low-Dose Reconstruction From Truncated Data in Dental CT</atitle><jtitle>IEEE transactions on nuclear science</jtitle><stitle>TNS</stitle><date>2013-02-01</date><risdate>2013</risdate><volume>60</volume><issue>1</issue><spage>174</spage><epage>181</epage><pages>174-181</pages><issn>0018-9499</issn><eissn>1558-1578</eissn><coden>IETNAE</coden><abstract>To reduce the radiation dose in dental computed tomography (CT), backprojection-filtration (BPF) algorithm is the preferred choice as it can reconstruct images from truncated data within limited scanning angle, thereby reducing radiation dose and avoiding irradiation to the brain. However, the integral interval of backprojection is variable for every PI-line which causes the calculation efficiency and parallel performance to be low. In this paper, the tent BPF method (T-BPF) was developed, which was performed by firstly rearranging the cone-beam data to tent-like parallel-beam data, and then applying the proposed BPF-type algorithm to reconstruct images from the rearranged data. T-BPF turns the variable integral interval of backprojection into fixed integral interval, which means the reconstruction efficiency and the parallel performance of T-BPF are improvements over those of the original BPF algorithm. The experiments of numerical simulation and real data reconstruction show that the reconstruction efficiency of T-BPF is faster than the original BPF algorithm and the FDK algorithm in the case of comparable reconstruction quality. The results demonstrate that the proposed T-BPF is good at achieving fast low-dose reconstruction from truncated projection data in dental CT.</abstract><pub>IEEE</pub><doi>10.1109/TNS.2012.2236653</doi><tpages>8</tpages></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 0018-9499 |
ispartof | IEEE transactions on nuclear science, 2013-02, Vol.60 (1), p.174-181 |
issn | 0018-9499 1558-1578 |
language | eng |
recordid | cdi_crossref_primary_10_1109_TNS_2012_2236653 |
source | IEEE Electronic Library (IEL) |
subjects | Algorithm design and analysis Approximation algorithms Band pass filters BPF algorithm Computed tomography dental CT Dentistry Detectors Image reconstruction rebinning truncated data |
title | Fast Low-Dose Reconstruction From Truncated Data in Dental CT |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-14T00%3A23%3A19IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-crossref_RIE&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Fast%20Low-Dose%20Reconstruction%20From%20Truncated%20Data%20in%20Dental%20CT&rft.jtitle=IEEE%20transactions%20on%20nuclear%20science&rft.au=Wang,%20Xianchao&rft.date=2013-02-01&rft.volume=60&rft.issue=1&rft.spage=174&rft.epage=181&rft.pages=174-181&rft.issn=0018-9499&rft.eissn=1558-1578&rft.coden=IETNAE&rft_id=info:doi/10.1109/TNS.2012.2236653&rft_dat=%3Ccrossref_RIE%3E10_1109_TNS_2012_2236653%3C/crossref_RIE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=6423850&rfr_iscdi=true |