An optimal algorithm for configuring delivery options of a one-dimensional intensity-modulated beam
The problem of generating delivery options for one-dimensional intensity-modulated beams (1D IMBs) arises in intensity-modulated radiation therapy. In this paper, we present an algorithm with the optimal running time, based on the 'rightmost-preference' method, for generating all distinct...
Uloženo v:
| Vydáno v: | Physics in medicine & biology Ročník 48; číslo 15; s. 2321 |
|---|---|
| Hlavní autoři: | , , , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
England
07.08.2003
|
| Témata: | |
| ISSN: | 0031-9155 |
| On-line přístup: | Zjistit podrobnosti o přístupu |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | The problem of generating delivery options for one-dimensional intensity-modulated beams (1D IMBs) arises in intensity-modulated radiation therapy. In this paper, we present an algorithm with the optimal running time, based on the 'rightmost-preference' method, for generating all distinct delivery options for an arbitrary 1D IMB. The previously best known method for generating delivery options for a 1D IMB with N left leaf positions and N right leaf positions is a 'brute-force' solution, which first generates all N! possible combinations of the left and right leaf positions and then removes combinations that are not physically allowed delivery options. Compared with the brute-force method, our algorithm has several advantages: (1) our algorithm runs in an optimal time that is linearly proportional to the total number of distinct delivery options that it actually produces. Note that for a 1D IMB with multiple peaks, the total number of distinct delivery options in general tends to be considerably smaller than the worst case N!. (2) Our algorithm can be adapted to generating delivery options subject to additional constraints such as the 'minimum leaf separation' constraint. (3) Our algorithm can also be used to generate random subsets of delivery options; this feature is especially useful when the 1D IMBs in question have too many delivery options for a computer to store and process. The key idea of our method is that we impose an order on how left leaf positions should be paired with right leaf positions. Experiments indicated that our rightmost-preference algorithm runs dramatically faster than the brute-force algorithm. This implies that our algorithm can handle 1D IMBs whose sizes are substantially larger than those handled by the brute-force method. Applications of our algorithm in therapeutic techniques such as intensity-modulated arc therapy and 2D modulations are also discussed. |
|---|---|
| AbstractList | The problem of generating delivery options for one-dimensional intensity-modulated beams (1D IMBs) arises in intensity-modulated radiation therapy. In this paper, we present an algorithm with the optimal running time, based on the 'rightmost-preference' method, for generating all distinct delivery options for an arbitrary 1D IMB. The previously best known method for generating delivery options for a 1D IMB with N left leaf positions and N right leaf positions is a 'brute-force' solution, which first generates all N! possible combinations of the left and right leaf positions and then removes combinations that are not physically allowed delivery options. Compared with the brute-force method, our algorithm has several advantages: (1) our algorithm runs in an optimal time that is linearly proportional to the total number of distinct delivery options that it actually produces. Note that for a 1D IMB with multiple peaks, the total number of distinct delivery options in general tends to be considerably smaller than the worst case N!. (2) Our algorithm can be adapted to generating delivery options subject to additional constraints such as the 'minimum leaf separation' constraint. (3) Our algorithm can also be used to generate random subsets of delivery options; this feature is especially useful when the 1D IMBs in question have too many delivery options for a computer to store and process. The key idea of our method is that we impose an order on how left leaf positions should be paired with right leaf positions. Experiments indicated that our rightmost-preference algorithm runs dramatically faster than the brute-force algorithm. This implies that our algorithm can handle 1D IMBs whose sizes are substantially larger than those handled by the brute-force method. Applications of our algorithm in therapeutic techniques such as intensity-modulated arc therapy and 2D modulations are also discussed.The problem of generating delivery options for one-dimensional intensity-modulated beams (1D IMBs) arises in intensity-modulated radiation therapy. In this paper, we present an algorithm with the optimal running time, based on the 'rightmost-preference' method, for generating all distinct delivery options for an arbitrary 1D IMB. The previously best known method for generating delivery options for a 1D IMB with N left leaf positions and N right leaf positions is a 'brute-force' solution, which first generates all N! possible combinations of the left and right leaf positions and then removes combinations that are not physically allowed delivery options. Compared with the brute-force method, our algorithm has several advantages: (1) our algorithm runs in an optimal time that is linearly proportional to the total number of distinct delivery options that it actually produces. Note that for a 1D IMB with multiple peaks, the total number of distinct delivery options in general tends to be considerably smaller than the worst case N!. (2) Our algorithm can be adapted to generating delivery options subject to additional constraints such as the 'minimum leaf separation' constraint. (3) Our algorithm can also be used to generate random subsets of delivery options; this feature is especially useful when the 1D IMBs in question have too many delivery options for a computer to store and process. The key idea of our method is that we impose an order on how left leaf positions should be paired with right leaf positions. Experiments indicated that our rightmost-preference algorithm runs dramatically faster than the brute-force algorithm. This implies that our algorithm can handle 1D IMBs whose sizes are substantially larger than those handled by the brute-force method. Applications of our algorithm in therapeutic techniques such as intensity-modulated arc therapy and 2D modulations are also discussed. The problem of generating delivery options for one-dimensional intensity-modulated beams (1D IMBs) arises in intensity-modulated radiation therapy. In this paper, we present an algorithm with the optimal running time, based on the 'rightmost-preference' method, for generating all distinct delivery options for an arbitrary 1D IMB. The previously best known method for generating delivery options for a 1D IMB with N left leaf positions and N right leaf positions is a 'brute-force' solution, which first generates all N! possible combinations of the left and right leaf positions and then removes combinations that are not physically allowed delivery options. Compared with the brute-force method, our algorithm has several advantages: (1) our algorithm runs in an optimal time that is linearly proportional to the total number of distinct delivery options that it actually produces. Note that for a 1D IMB with multiple peaks, the total number of distinct delivery options in general tends to be considerably smaller than the worst case N!. (2) Our algorithm can be adapted to generating delivery options subject to additional constraints such as the 'minimum leaf separation' constraint. (3) Our algorithm can also be used to generate random subsets of delivery options; this feature is especially useful when the 1D IMBs in question have too many delivery options for a computer to store and process. The key idea of our method is that we impose an order on how left leaf positions should be paired with right leaf positions. Experiments indicated that our rightmost-preference algorithm runs dramatically faster than the brute-force algorithm. This implies that our algorithm can handle 1D IMBs whose sizes are substantially larger than those handled by the brute-force method. Applications of our algorithm in therapeutic techniques such as intensity-modulated arc therapy and 2D modulations are also discussed. |
| Author | Chen, Danny Z Wu, Xiaodong Zhang, Li Yu, Cedric X Luan, Shuang |
| Author_xml | – sequence: 1 givenname: Shuang surname: Luan fullname: Luan, Shuang email: sluan.chen@cse.nd.edu organization: Department of Computer Science and Engineering, University of Notre Dame, Notre Dame, IN 46556, USA. sluan.chen@cse.nd.edu – sequence: 2 givenname: Danny Z surname: Chen fullname: Chen, Danny Z – sequence: 3 givenname: Li surname: Zhang fullname: Zhang, Li – sequence: 4 givenname: Xiaodong surname: Wu fullname: Wu, Xiaodong – sequence: 5 givenname: Cedric X surname: Yu fullname: Yu, Cedric X |
| BackLink | https://www.ncbi.nlm.nih.gov/pubmed/12953901$$D View this record in MEDLINE/PubMed |
| BookMark | eNo9kEtPwzAQhH0oog_4BUjIJ24h61caH6uKl1SJC5wj27GLUWKX2EHqvydA4TSr0ber2VmiWYjBInRF4JZAXZcAjBSSCFHyuiSiZFDN0OLfnaNlSu8AhNSUn6M5oVIwCWSBzCbgeMi-Vx1W3T4OPr_12MUBmxic34-DD3vc2s5_2uH4g8aQcHRY4SlC0frehjR5074P-XvOx6KP7dipbFusreov0JlTXbKXJ12h1_u7l-1jsXt-eNpudoXhIHLB1spKKrlxVoLSqlbaKEMNoSCVZppbY11F2rXjQARrJQMtOKNUcaXBSbpCN793D0P8GG3KTe-TsV2ngo1jatasAlFVMIHXJ3DUvW2bwzD9Pxybv1roFxKuZyo |
| CitedBy_id | crossref_primary_10_1118_1_1646471 |
| ContentType | Journal Article |
| DBID | CGR CUY CVF ECM EIF NPM 7X8 |
| DOI | 10.1088/0031-9155/48/15/306 |
| DatabaseName | Medline MEDLINE MEDLINE (Ovid) MEDLINE MEDLINE PubMed MEDLINE - Academic |
| DatabaseTitle | MEDLINE Medline Complete MEDLINE with Full Text PubMed MEDLINE (Ovid) MEDLINE - Academic |
| DatabaseTitleList | MEDLINE - Academic MEDLINE |
| Database_xml | – sequence: 1 dbid: NPM name: PubMed url: http://www.ncbi.nlm.nih.gov/entrez/query.fcgi?db=PubMed sourceTypes: Index Database – sequence: 2 dbid: 7X8 name: MEDLINE - Academic url: https://search.proquest.com/medline sourceTypes: Aggregation Database |
| DeliveryMethod | no_fulltext_linktorsrc |
| Discipline | Medicine Biology Physics |
| ExternalDocumentID | 12953901 |
| Genre | Validation Studies Research Support, U.S. Gov't, Non-P.H.S Comparative Study Evaluation Studies Research Support, Non-U.S. Gov't Journal Article |
| GroupedDBID | --- -DZ -~X 02O 123 1JI 1WK 29O 4.4 53G 5B3 5RE 5VS 5ZH 7.M 7.Q 9BW AAGCD AAJIO AAJKP AALHV AATNI ABJNI ABLJU ABVAM ACAFW ACGFS ACHIP AEFHF AENEX AERVB AFYNE AHSEE AKPSB ALMA_UNASSIGNED_HOLDINGS AOAED ARNYC ASPBG ATQHT AVWKF AZFZN BBWZM CGR CJUJL CRLBU CS3 CUY CVF DU5 EBS ECM EDWGO EIF EJD EQZZN F5P FEDTE HAK HVGLF IHE IJHAN IOP IZVLO KOT LAP M45 N5L N9A NPM NT- NT. P2P PJBAE Q02 R4D RIN RNS RO9 ROL RPA S3P SY9 TN5 UCJ XPP ZMT 7X8 AAGCF ABUFD ACARI ADEQX AEINN AGQPQ |
| ID | FETCH-LOGICAL-c405t-37ae9294cfe90aba8abcac2c1209ab3b4ecef61d7f40153d930b54322a4ab0f92 |
| IEDL.DBID | 7X8 |
| ISICitedReferencesCount | 7 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000185097400006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0031-9155 |
| IngestDate | Sun Nov 09 13:50:15 EST 2025 Wed Feb 19 02:33:03 EST 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 15 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c405t-37ae9294cfe90aba8abcac2c1209ab3b4ecef61d7f40153d930b54322a4ab0f92 |
| Notes | ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 ObjectType-Undefined-3 |
| PMID | 12953901 |
| PQID | 73605660 |
| PQPubID | 23479 |
| ParticipantIDs | proquest_miscellaneous_73605660 pubmed_primary_12953901 |
| PublicationCentury | 2000 |
| PublicationDate | 2003-08-07 |
| PublicationDateYYYYMMDD | 2003-08-07 |
| PublicationDate_xml | – month: 08 year: 2003 text: 2003-08-07 day: 07 |
| PublicationDecade | 2000 |
| PublicationPlace | England |
| PublicationPlace_xml | – name: England |
| PublicationTitle | Physics in medicine & biology |
| PublicationTitleAlternate | Phys Med Biol |
| PublicationYear | 2003 |
| SSID | ssj0011824 |
| Score | 1.7473356 |
| Snippet | The problem of generating delivery options for one-dimensional intensity-modulated beams (1D IMBs) arises in intensity-modulated radiation therapy. In this... |
| SourceID | proquest pubmed |
| SourceType | Aggregation Database Index Database |
| StartPage | 2321 |
| SubjectTerms | Computer Simulation Dose Fractionation, Radiation Radiometry - methods Radiotherapy Dosage Radiotherapy Planning, Computer-Assisted - methods Radiotherapy, Conformal - methods Reproducibility of Results Sensitivity and Specificity |
| Title | An optimal algorithm for configuring delivery options of a one-dimensional intensity-modulated beam |
| URI | https://www.ncbi.nlm.nih.gov/pubmed/12953901 https://www.proquest.com/docview/73605660 |
| Volume | 48 |
| WOSCitedRecordID | wos000185097400006&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8NAEB6qVfHio77qcw9el6bdvBYEKWLx0tKDQm9hn7XQJNVGof_e2aTRk3jwksOSDctmMvlm55v5AG4N411hgpj61tPUDzWn0piQSmsRjTOuAqZKsYloNIonEz5uwF1dC-NolbVPLB21zpU7I-9EDIF3GHr3izfqNKNcbnUtoLEBTYZAxhG6oslPDgGRc9WDmXWp64Je9xzCkO97rOPHnW7QYV74O8Is_zSD_f-t8QD21giT9CuTOISGyVqwXWlOrlqwM1xn03GwpH-q5RGofkZydB4pThTzKT61eE0J4lmC4bKdTctaRqLN3LE4VuWtaK0kt0SQPDNUO42Aqr8HmVWk-GJF01w7cTCjiTQiPYaXwePzwxNdyy9QhSiuQNcjDIInX1nDPSFFLKQSqqdcta2QTPpGGRt2dWQxRguY5syTgY8OQvhCepb3TmAzwzWcAWGx5zqleYpb5SCYjAKNQIH7xoWkvaANN_WGJmjeLmchMpN_LJN6S9twWr2TZFF14UgQqATuwOb8z7kXsFtS8BzRI7qEpsUP21zBlvosZsv369Jq8DoaD78ALNXMIQ |
| linkProvider | ProQuest |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=An+optimal+algorithm+for+configuring+delivery+options+of+a+one-dimensional+intensity-modulated+beam&rft.jtitle=Physics+in+medicine+%26+biology&rft.au=Luan%2C+Shuang&rft.au=Chen%2C+Danny+Z&rft.au=Zhang%2C+Li&rft.au=Wu%2C+Xiaodong&rft.date=2003-08-07&rft.issn=0031-9155&rft.volume=48&rft.issue=15&rft.spage=2321&rft_id=info:doi/10.1088%2F0031-9155%2F48%2F15%2F306&rft_id=info%3Apmid%2F12953901&rft_id=info%3Apmid%2F12953901&rft.externalDocID=12953901 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0031-9155&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0031-9155&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0031-9155&client=summon |