東華大學圖書館 |

Language: English

Help

回圖書館首頁

手機版館藏查詢

Back

Switch To: Labeled | MARC Mode | ISBD

Geometric algorithms for leaf sequen...

Luan, Shuang (Sean).

Linked to FindBook

Google Book

Amazon

博客來

Geometric algorithms for leaf sequencing problems in intensity modulated radiation therapy.

Record Type:	Electronic resources : Monograph/item
Title/Author:	Geometric algorithms for leaf sequencing problems in intensity modulated radiation therapy./
Author:	Luan, Shuang (Sean).
Description:	161 p.
Notes:	Source: Dissertation Abstracts International, Volume: 65-01, Section: B, page: 0291.
Contained By:	Dissertation Abstracts International65-01B.
Subject:	Computer Science. -
Online resource:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3120049
ISBN:	049667422X

Geometric algorithms for leaf sequencing problems in intensity modulated radiation therapy.
Luan, Shuang (Sean).

Geometric algorithms for leaf sequencing problems in intensity modulated radiation therapy. - 161 p.

Source: Dissertation Abstracts International, Volume: 65-01, Section: B, page: 0291.

Thesis (Ph.D.)--University of Notre Dame, 2004.

Intensity-modulated radiation therapy (IMRT) is a modern cancer treatment technique, aiming to deliver a lethal radiation dose to a targeted tumor while sparing the surrounding normal tissues and critical structures. A key to performing IMRT is the accurate and efficient delivery of discrete dose distributions using the linear accelerator (LINAC) and the multileaf collimator (MLC). In this thesis, we study the static leaf sequencing (SLS) problems that arise in IMRT delivery, whose goal is to compute a treatment plan that determines the delivery of prescribed dose distributions in the minimum amount of time.

ISBN: 049667422XSubjects--Topical Terms:

626642
Computer Science.

Geometric algorithms for leaf sequencing problems in intensity modulated radiation therapy.
LDR:03284nmm 2200289 4500 001 1841065
005 20050823122907.5
008 130614s2004 eng d
020 $a 049667422X
035 $a (UnM)AAI3120049
035 $a AAI3120049
040 $a UnM $c UnM
100 1 $a Luan, Shuang (Sean). $3 1929376
245 1 0 $a Geometric algorithms for leaf sequencing problems in intensity modulated radiation therapy.
300 $a 161 p.
500 $a Source: Dissertation Abstracts International, Volume: 65-01, Section: B, page: 0291.
500 $a Director: Danny Z. Chen.
502 $a Thesis (Ph.D.)--University of Notre Dame, 2004.
520 $a Intensity-modulated radiation therapy (IMRT) is a modern cancer treatment technique, aiming to deliver a lethal radiation dose to a targeted tumor while sparing the surrounding normal tissues and critical structures. A key to performing IMRT is the accurate and efficient delivery of discrete dose distributions using the linear accelerator (LINAC) and the multileaf collimator (MLC). In this thesis, we study the static leaf sequencing (SLS) problems that arise in IMRT delivery, whose goal is to compute a treatment plan that determines the delivery of prescribed dose distributions in the minimum amount of time.
520 $a Existing leaf sequencing algorithms, both in commercial planning systems and in medical literature, are all heuristics and do not guarantee any good quality of the computed treatment plans, which in many cases result in prolonged delivery time and compromised treatment quality. In this thesis, we present several new MLC leaf sequencing algorithms and software. Our new algorithms, based on a novel unified approach and geometric optimization techniques, are very efficient and guarantee the optimal quality of the output treatment plans. Our ideas include formulating the leaf sequencing problems as computing shortest paths, maximum matchings, and path covers in a weighted directed acyclic graph and building the graph by computing optimal bipartite matchings and minimum cost flows on various geometric objects. Specifically, we have developed algorithms for the SLS problem in one, two, and three dimensions, and with machine delivery error control and MLC model generalizations. We have also studied the impact of the various MLC mechanical constraints on the delivery time, which may provide insights into the design of future MLC systems. Comparisons between our SLS software and commercial treatment planning systems and well-known SLS algorithms in medical literature have shown significant improvements. The IMRT plans produced by our SLS software not only take significantly shorter delivery times (up to 75% less), but also have a much better treatment quality. This proves the clinical feasibility of our software and has led to its use for treating cancer patients in the Department of Radiation Oncology, University of Maryland Medical Center, Baltimore, MD and the Helen P. Denit Cancer Center, Montgomery General Hospital, Olney, MD.
590 $a School code: 0165.
650 4 $a Computer Science. $3 626642
650 4 $a Health Sciences, Radiology. $3 1019076
690 $a 0984
690 $a 0574
710 2 0 $a University of Notre Dame. $3 807615
773 0 $t Dissertation Abstracts International $g 65-01B.
790 1 0 $a Chen, Danny Z., $e advisor
790 $a 0165
791 $a Ph.D.
792 $a 2004
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3120049