Biomedical subjects

Danny Z Chen

Publications and source records attributed to Danny Z Chen.

5 recordsLinked to original sources

PubMed2006

Optimal surface segmentation in volumetric images--a graph-theoretic approach.

Efficient segmentation of globally optimal surfaces representing object boundaries in volumetric data sets is important and challenging in many medical image analysis applications. We have developed an optimal surface detection method capable of simultaneously detecting multiple interacting surfaces, in which the optimality is controlled by the cost functions designed for individual surfaces and by several geometric constraints defining the surface smoothness and interrelations. The method solves the surface segmentation problem by transforming it into computing a minimum s-t cut in a derived arc-weighted directed graph. The proposed algorithm has a low-order polynomial time complexity and is computationally efficient. It has been extensively validated on more than 300 computer-synthetic volumetric images, 72 CT-scanned data sets of different-sized plexiglas tubes, and tens of medical images spanning various imaging modalities. In all cases, the approach yielded highly accurate results. Our approach can be readily extended to higher-dimensional image segmentation.

Algorithms↗

PubMed2006

An improved MLC segmentation algorithm and software for step-and-shoot IMRT delivery without tongue-and-groove error.

We present an improved multileaf collimator (MLC) segmentation algorithm, denoted by SLS(NOTG) (static leaf sequencing with no tongue-and-groove error), for step-and-shoot intensity-modulated radiation therapy (IMRT) delivery. SLS(NOTG) is an improvement over the MLC segmentation algorithm called SLS that was developed by Luan et al. [Med. Phys. 31(4), 695-707 (2004)], which did not consider tongue-and-groove error corrections. The aims of SLS(NOTG) are (1) shortening the treatment times of IMRT plans by minimizing their numbers of segments and (2) minimizing the tongue-and-groove errors of the computed IMRT plans. The input to SLS(NOTG) is intensity maps (IMs) produced by current planning systems, and its output is (modified) optimized leaf sequences without tongue-and-groove error. Like the previous SLS algorithm [Luan et al., Med. Phys. 31(4), 695-707 (2004)], SLS(NOTG) is also based on graph algorithmic techniques in computer science. It models the MLC segmentation problem as a weighted minimum-cost path problem, where the weight of the path is the number of segments and the cost of the path is the amount of tongue-and-groove error. Our comparisons of SLS(NOTG) with CORVUS indicated that for the same intensity maps, the numbers of segments computed by SLS(NOTG) are up to 50% less than those by CORVUS 5.0 on the Elekta LINAC system. Our clinical verifications have shown that the dose distributions of the SLS(NOTG) plans do not have tongue-and-groove error and match those of the corresponding CORVUS plans, thus confirming the correctness of SLS(NOTG). Comparing with existing segmentation methods, SLS(NOTG) also has two additional advantages: (1) SLS(NOTG) can compute leaf sequences whose tongue-and-groove error is minimized subject to a constraint on the maximum allowed number of segments, which may be desirable in clinical situations where a treatment with the complete correction of tongue-and-groove error takes too much time, and (2) SLS(NOTG) can be used to minimize a more general type of error called the tongue-or-groove error.

Algorithms↗

PubMed2006

New developments in intensity modulated radiation therapy.

As intensity modulated radiation therapy (IMRT) becomes routine clinical practice, its advantages and limitations are better understood. With these new understandings, some new developments have emerged in an effort to alleviate the limitations of the current IMRT practice. This article describes a few of these efforts made at the University of Maryland, including: i) improving IMRT efficiency with direct aperture optimization; ii) broadening the scope of optimization to include the mode of delivery and beam angles; and iii) new planning methods for intensity modulated arc therapy (IMAT).

Humans↗

PubMed2004

A new MLC segmentation algorithm/software for step-and-shoot IMRT delivery.

We present a new MLC segmentation algorithm/software for step-and-shoot IMRT delivery. Our aim in this work is to shorten the treatment time by minimizing the number of segments. Our new segmentation algorithm, called SLS (an abbreviation for static leaf sequencing), is based on graph algorithmic techniques in computer science. It takes advantage of the geometry of intensity maps. In our SLS approach, intensity maps are viewed as three-dimensional (3-D) "mountains" made of unit-sized "cubes." Such a 3-D "mountain" is first partitioned into special-structured submountains using a new mixed partitioning scheme. Then the optimal leaf sequences for each submountain are computed by either a shortest-path algorithm or a maximum-flow algorithm based on graph models. The computations of SLS take only a few minutes. Our comparison studies of SLS with CORVUS (both the 4.0 and 5.0 versions) and with the Xia and Verhey segmentation methods on Elekta Linac systems showed substantial improvements. For instance, for a pancreatic case, SLS used only one-fifth of the number of segments required by CORVUS 4.0 to create the same intensity maps, and the SLS sequences took only 25 min to deliver on an Elekta SL 20 Linac system in contrast to the 72 min for the CORVUS 4.0 sequences (a three-fold improvement). To verify the accuracy of our new leaf sequences, we conducted film and ion-chamber measurements on phantom. The results showed that both the intensity distributions as well as dose distributions of the SLS delivery match well with those of CORVUS delivery. SLS can also be extended to other types of Linac systems.

Algorithms↗

PubMed2003

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 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.

Computer Simulation↗