Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “PROPOSALS”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 919 records · Page 51

Coordinated PEV Charging for Distribution System Management

Plug-in electric vehicles (PEVs) can help to reduce worldwide dependence on petroleum and carbon emissions. In the past a few years, PEVs have received considerable attention as an eco-friendly and cost-effective alternative to conventional gasoline vehicles. PEVs consume higher power from the grid during charging compared to conventional residential loads. Therefore, the emerging fleet of PEVs will introduce a considerable amount of additional load on power system. On the other hand, majority of PEVs are parked for more than 90% of the time, making them ideal for providing various services through Electric Vehicle Supply Equipment (EVSE), a.k.a. charging stations which are PEVs’ connection points to the power system. In this project, coordinated PEV charging are developed to provide distribution system services, considering PEV characteristics, realistic travel pattern, charging behaviors, and EVSE power rating and availability. The main efforts and contributions are summarized as follows. • Mobility models and EVSE charging capability/availability are indispensable for evaluating PEV charging coordination strategies and developing PEV charging control. Many existing studies utilize simplified mobility models assuming that the entire vehicle fleet returns home in the evening and is parked at home until the next morning. Some other PEV models better represent diversified home arrival and departure time, but cannot capture varying charging flexibility and capability at different locations, and therefore are not appropriate to study the impacts of public EVSE on PEV load and utilization. In this work, a mobility and charging flexibility model is proposed to better represent the temporal availability and varying charging capability from PEV onboard charger and EVSE. • Based on the mobility model, a generalized optimization method is proposed to evaluate different PEV charging coordination strategies. In existing literature, different algorithms and methods need to be designed to evaluate each charging strategy from both vehicle owners’ and system’s perspective. With the optimization method proposed in this work, different charging control strategies can be studied and compared by only updating objective functions. Moreover, optimization tricks are provided to convert the optimization problems to equivalent linear programming problems, which can be efficiently solved with existing solvers. • An innovative scheduling and control framework is proposed to enable smart PEV charging for grid services while meeting PEV owners’ travel needs. In the proposed framework, each set of EVSE is equipped with a controller that estimates charging power and energy flexibility based on vehicle characteristics, EVSE power rating, battery energy state, and upcoming trip information. With the simplified charging flexibility model received from each EVSE controller, the central coordinator determines the optimal power allocation for a look-ahead time window for the given grid services. The proposed charging control can help reduce the computational complexity and communication requirement compared with existing methods. It is also scalable to the expanding PEV fleet and robust to uncertainties in upcoming vehicle trips and future system condition. • The proposed charging strategy evaluation and smart charging control methods are applied to one of the prototypical feeders developed by the Pacific Northwest National Laboratory (PNNL) for case studies. Detailed trip information extracted from the National Household Travel Survey (NHTS) is used to represent travel and parking patterns. Different scenarios are simulated to evaluate the performance of the proposed methods and understand how PEV mobility and public EVSE availability affect PEV load and potential grid services.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Feature‐shared adaptive‐boost deep learning for invasiveness classification of pulmonary subsolid nodules in CT images

Purpose In clinical practice, invasiveness is an important reference indicator for differentiating the malignant degree of subsolid pulmonary nodules. These nodules can be classified as atypical adenomatous hyperplasia (AAH), adenocarcinoma in situ (AIS), minimally invasive adenocarcinoma (MIA), or invasive adenocarcinoma (IAC). The automatic determination of a nodule's invasiveness based on chest CT scans can guide treatment planning. However, it is challenging, owing to the insufficiency of training data and their interclass similarity and intraclass variation. To address these challenges, we propose a two‐stage deep learning strategy for this task: prior‐feature learning followed by adaptive‐boost deep learning. Methods The adaptive‐boost deep learning is proposed to train a strong classifier for invasiveness classification of subsolid nodules in chest CT images, using multiple 3D convolutional neural network (CNN)‐based weak classifiers. Because ensembles of multiple deep 3D CNN models have a huge number of parameters and require large computing resources along with more training and testing time, the prior‐feature learning is proposed to reduce the computations by sharing the CNN layers between all weak classifiers. Using this strategy, all weak classifiers can be integrated into a single network. Results Tenfold cross validation of binary classification was conducted on a total of 1357 nodules, including 765 noninvasive (AAH and AIS) and 592 invasive nodules (MIA and IAC). Ablation experimental results indicated that the proposed binary classifier achieved an accuracy of with an AUC of 81.3 . These results are superior compared to those achieved by three experienced chest imaging specialists who achieved an accuracy of , , and , respectively. About 200 additional nodules were also collected. These nodules covered 50 cases for each category (AAH, AIS, MIA, and IAC, respectively). Both binary and multiple classifications were performed on these data and the results demonstrated that the proposed method definitely achieves better performance than the performance achieved by nonensemble deep learning methods. Conclusions It can be concluded that the proposed adaptive‐boost deep learning can significantly improve the performance of invasiveness classification of pulmonary subsolid nodules in CT images, while the prior‐feature learning can significantly reduce the total size of deep models. The promising results on clinical data show that the trained models can be used as an effective lung cancer screening tool in hospitals. Moreover, the proposed strategy can be easily extended to other similar classification tasks in 3D medical images.

Wang, Jun↗

Data-driven high-fidelity 2D microstructure reconstruction via non-local patch-based image inpainting

Microstructure reconstruction problems are usually limited to the representation with finitely many number of phases, e.g. binary and ternary. However, images of microstructure obtained through experimental, for example, using microscope, are often represented as a RGB or grayscale image. Because the phase-based representation is discrete, more rigid, and provides less flexibility in modeling the microstructure, as compared to RGB or grayscale image, there is a loss of information in the conversion. In this paper, a microstructure reconstruction method, which produces images at the fidelity of experimental microscopy, i.e. RGB or grayscale image, is proposed without introducing any physics-based microstructure descriptor. Furthermore, the image texture is preserved and the microstructure image is represented with continuous variables (as in RGB or grayscale images), instead of binary or categorical variables, which results in a high-fidelity image of microstructure reconstruction. The advantage of the proposed method is its quality of reconstruction, which can be applied to any other binary or multiphase 2D microstructure. The proposed method can be thought of as a subsampling approach to expand the microstructure dataset, while preserving its image texture. Moreover, the size of the reconstructed image is more flexible, compared to other machine learning microstructure reconstruction method, where the size must be fixed beforehand. In addition, the proposed method is capable of joining the microstructure images taken at different locations to reconstruct a larger microstructure image. A significant advantage of the proposed method is to remedy the data scarcity problem in materials science, where experimental data is scare and hard to obtain. The proposed method can also be applied to generate statistically equivalent microstructures, which has a strong implication in microstructure-related uncertainty quantification applications. The proposed microstructure reconstruction method is demonstrated with the UltraHigh Carbon Steel micrograph DataBase (UHCSDB).

97 MATHEMATICS AND COMPUTING↗

Occupant Preference-Aware Load Scheduling for Resilient Communities

The load scheduling of resilient communities in the islanded mode is subject to many uncertainties such as weather forecast errors and occupant behavior stochasticity. To date, it remains unclear how occupant preferences affect the effectiveness of the load scheduling of resilient communities. This paper proposes an occupant thermal preference-aware load scheduler for resilient communities operating in the islanded mode. First, key resilience indicators are selected to quantify its impacts on the load scheduling of a resilient community. A deterministic model predictive control-based load scheduling framework is adopted as the baseline. Then, a chance-constrained controller is proposed to address the occupant-induced uncertainty in room temperature setpoints. Finally, the chance-constrained controller is compared with the deterministic controller on a virtual community testbed based on a real-world net-zero energy community in Florida, U.S. Results have shown that the proposed chance-constrained controller performs better in terms of serving occupants’ thermal preference and the required battery sizes compared to the deterministic controller with the presence of the assumed stochastic occupant behavior. This work indicates that it is necessary to consider the stochasticity of the occupant behavior when designing optimal load schedulers for resilient communities.

Wang, Jing↗

Multi-agent voltage control in distribution systems using GAN-DRL-based approach

Active distribution grids can experience voltage fluctuations and violations due to the high penetration of variable distributed energy resources (DERs). These problems might occur because of the uncertain and variable generation natures of these resources, especially solar photovoltaic resources, during panel shadowing scenarios. Volt-VAR control (VVC) is an efficient method that controls the reactive power set-points of the inverters to regulate the voltage of distribution grids. Although several VVC approaches have been proposed recently, the performance of these approaches degrades significantly if behind-the-meter solar generation data are unobservable/missing. Therefore, it is necessary to impute missing/unobservable PV data accurately to be utilized in VVC approaches. Further, this paper proposes a model-free, data-driven, centrally trained, and decentrally executed multi-agent deep reinforcement learning-based VVC architecture to regulate the voltage of distribution networks. A generative adversarial network (GAN) is incorporated to impute the unobservable PV data accurately, which improves the performance of the proposed control architecture. The proposed multi-agent-soft-actor–critic algorithm (MASAC)-based VVC technique utilizes the actual PV dataset as well as the imputed dataset from the GAN framework to learn the optimal coordinated control policy for controlling the optimal reactive power set-points of PV inverters. The effectiveness of the proposed approach is analyzed on a modified IEEE 34-bus test case with added PV inverters. The results are compared and analyzed with a base case model with no VVC and VVC with a local droop control approach, genetic algorithm optimization, and a centralized soft actor–critic-based approach. Moreover, the performance of the proposed approach is compared with that of a multi-agent VVC framework without using the PV generation data and load information as the system state. The results illustrate that the proposed method with more state input improves the voltage profile and reduces the power loss of the network across various loading and PV generation scenarios.

14 SOLAR ENERGY↗

On Anomaly Detection for Transactive Energy Systems with Competitive Market

Two anomaly-detection criteria are proposed for transactive energy systems with competitive markets. Participants of transactive energy systems seek an optimal power allocation through hybrid economic-control methods to facilitate the integration of various types of distributed energy resources to power distribution systems. In transactive energy systems, every participant is assumed to be a rational entity, and consumers have diminishing marginal utility and suppliers have increasing marginal cost. With the first proposed anomaly-detection criterion, the monotonicity of marginal cost and marginal utility are examined. The impact of line flow constraints is also taken into consideration. Then, the second anomaly-detection criterion is proposed for TESs with marginal cost and marginal utility which change faster than a certain rate. The second criterion is more accurate than the first one for TES with marginal cost and marginal utility which change faster than a certain rate, but it requires the knowledge of that rate. Neither criteria requires more data than those necessary to find the optimal power allocation and the market-clear price in a transactive energy system. Therefore, the proposed criteria do not disclose any more data than necessary. As the monotonicity of marginal cost and marginal utility in a TES with competitive markets results in convex objective functions in an optimization problem and strongly convex ones when marginal cost and marginal utility changes faster than a certain rate, the two detection criteria are also applicable to anomaly detection of general convex optimization problems. Simulations are carried out to show the efficacy of the proposed criteria to detect anomalies caused by cyberattacks.

Wang, Peng↗

Patterns of Local-Regional Failure in Completely Resected Stage IIIA(N2) Non-Small Cell Lung Cancer Cases: Implications for Postoperative Radiation Therapy Clinical Target Volume Design

Purpose: To analyze patterns of local-regional failure (LRF) for completely resected stage IIIA(N2) non-small cell lung cancer (NSCLC) patients treated in our hospital and to propose a clinical target volume (CTV) for postoperative radiation therapy (PORT) in these patients. Methods and Materials: From 2005 to 2011, consecutive patients with pT1-3N2 NSCLC who underwent complete resection in our hospital but who did not receive PORT were identified. The patterns of first LRF were assessed and evaluated as to whether these areas would be encompassed by our proposed PORT CTV. Results: With a median follow-up of 24 months, 173 of 250 patients (69.2%) experienced disease recurrence. Of the 54 patients with LRF as the first event, 48 (89%) had recurrence within the proposed PORT CTV, and 6 (11%) had failures occurring both within and outside the proposed CTV (all of which occurred in patients with right-lung cancer). Ninety-three percent of failure sites (104 of 112) would have been contained within the proposed PORT CTV. For left-sided lung cancer, the most common lymph node station failure site was 4R, followed by 7, 4L, 6, 10L, and 5. For right-sided lung cancer, the most common site was station 2R, followed by 10R, 4R, and 7. Conclusions: LRF following complete surgery was an important and potentially preventable pattern of failure in stage IIIA(N2) patients. Ipsilateral superior mediastinal recurrences dominated for right-sided tumors, whereas left-sided tumors frequently involved the bilateral superior mediastinum. Most of the LRF sites would have been covered by the proposed PORT CTV. A prospective investigation of patterns of failure after PORT (following our proposed CTV delineation guideline) is presently underway and will be reported in a separate analysis.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Selection of polynomial chaos bases via Bayesian model uncertainty methods with applications to sparse approximation of PDEs with stochastic inputs

Generalized polynomial chaos (gPC) expansions allow us to represent the solution of a stochastic system using a series of polynomial chaos basis functions. The number of gPC terms increases dramatically as the dimension of the random input variables increases. When the number of the gPC terms is larger than that of the available samples, a scenario that often occurs when the corresponding deterministic solver is computationally expensive, evaluation of the gPC expansion can be inaccurate due to over-fitting. We propose a fully Bayesian approach that allows for global recovery of the stochastic solutions, in both spatial and random domains, by coupling Bayesian model uncertainty and regularization regression methods. It allows the evaluation of the PC coefficients on a grid of spatial points, via (1) the Bayesian model average (BMA) or (2) the median probability model, and their construction as spatial functions on the spatial domain via spline interpolation. The former accounts for the model uncertainty and provides Bayes-optimal predictions; while the latter provides a sparse representation of the stochastic solutions by evaluating the expansion on a subset of dominating gPC bases. Moreover, the proposed methods quantify the importance of the gPC bases in the probabilistic sense through inclusion probabilities. We design a Markov chain Monte Carlo (MCMC) sampler that evaluates all the unknown quantities without the need of ad-hoc techniques. The proposed methods are suitable for, but not restricted to, problems whose stochastic solutions are sparse in the stochastic space with respect to the gPC bases while the deterministic solver involved is expensive. We demonstrate the accuracy and performance of the proposed methods and make comparisons with other approaches on solving elliptic SPDEs with 1-, 14- and 40-random dimensions.

97 MATHEMATICS AND COMPUTING↗

Contact angles from Young’s equation in molecular dynamics simulations

In this work, we propose a method to calculate the equilibrium contact angle of heterogeneous 3-phase solid/fluid/fluid systems using molecular dynamics simulations. The proposed method, which combines the phantom-wall method [F. Leroy and F. Müller-Plathe, J. Chem. Phys. 133, 044110 (2010)] and Bennett’s acceptance ratio approach [C. H. Bennett, J. Comput. Phys. 22, 245 (1976)], is able to calculate the solid/fluid surface tension relative to the solid surface energy. The calculated relative surface tensions can then be used in Young’s equation to estimate the equilibrium contact angle. A fluid droplet is not needed for the proposed method, in contrast to the situation for direct simulations of contact angles. In addition, while prior free-energy based methods for contact angles mainly focused on the wetting of fluids in coexistence with their vapor on solid surfaces, the proposed approach was designed to study the contact angles of fluid mixtures on solid surfaces above the fluid saturation pressures. Using the proposed approach, the contact angles of binary Lennard-Jones fluid mixtures on a non-polar solid substrate were calculated at various interaction parameters and the contact angle of water in equilibrium with CO 2 on a hydrophilic polar silica surface was obtained. For both non-polar and polar systems, the calculated contact angles from the proposed method were in agreement with those obtained from the geometry of a cylindrical droplet. The computational cost of the proposed method was found to be comparable to that of simulations that use fluid droplets, but the new method provides a way to calculate the contact angle directly from Young’s equation without ambiguity.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Modeling of gap conductance for LWR fuel rods applied in the BISON code

A new gap conductance model is proposed in this study as a combination of Toptan’s model and the Ross-Stoute model. A variance-based sensitivity analysis is performed to understand how simulation results depend on all input parameters of the proposed model. Additionally, new modeling options (e.g. fill gas thermal conductivity, temperature jump distance, thermal accommodation coefficient, etc.) are added into the nuclear fuel performance code, BISON. The need for further investigation of the gap heat transfer between fuel and cladding in BISON motivated this study to evaluate its impact on the code’s predictions. New gap conductance modeling is proposed. A series of integral-effects validation tests is performed: (1) to demonstrate the impact of the proposed model on the code’s fuel temperature predictions at the beginning of life and through the reactor’s life; (2) to ensure that the proposed model is capable of accurately modeling gap heat transfer characteristics in real-world problems; and (3) to investigate the impact of the estimation of fission gas release on the fuel temperature predictions with the proposed model. Overall, the results indicate that the proposed gap conductance model improves BISON’s predictions.

42 ENGINEERING↗

A novel digital pulse processing architecture for nuclear instrumentation

The field of nuclear instrumentation covers a wide range of applications, including counting, spectrometry, pulse shape discrimination and multi-channel coincidence. These applications are the topic of many researches, new algorithms and implementations are constantly proposed thanks to advances in digital signal processing. However, these improvements are not yet implemented in instrumentation devices. This is especially true for neutron-gamma discrimination applications which traditionally use charge comparison method while literature proposes other algorithms based on frequency domain or wavelet theory which show better performances. Another example is pileups which are generally rejected while pileup correction algorithms also exist. These processes are traditionally performed offline due to two issues. The first is the Poissonian characteristic of the signal, composed of random arrival pulses which requires to current architectures to work in data flow. The second is the real-time requirement, which implies losing pulses when the pulse rate is too high. Despite the possibility of treating the pulses independently from each other, current architectures paralyze the acquisition of the signal during the processing of a pulse. This loss is called dead-time. These two issues have led current architectures to use dedicated solutions based on re-configurable components like Field Programmable Gate Arrays (FPGAs) to overcome the need of performance necessary to deal with dead-time. However, dedicated hardware algorithm implementations on re-configurable technologies are complex and time-consuming. For all these reasons, a programmable Digital pulse Processing (DPP) architecture in a high level language such as Cor C++ which can reduce dead-time would be worthwhile for nuclear instrumentation. This would reduce prototyping and test duration by reducing the level of hardware expertise to implement new algorithms. However, today's programmable solutions do not meet the need of performance to operate online and not allow scaling with the increase in the number of measurement channel. That is why an innovative DPP architecture is proposed in this paper. This architecture is able to overcome dead-time while being programmable and is flexible with the number of measurement channel. Proposed architecture is based on an innovative execution model for pulse processing applications which can be summarized as follow. The signal is not composed of pulses only, consequently, pulses processing does not have to operate on the entire signal. Therefore, the first step of our proposal is pulse extraction by the use of dedicated components named pulse extractors. The triggering step can be achieved after the analog-to-digital conversion without any signal shaping or filtering stages. Pileup detection and accurate pulse time stamping are done at this stage. Any application downstream this step can work on adaptive variable-sized array of samples simplifying pulse processing methods. Then, once the data flow is broken, it is possible to distribute pulses on Functional Units (FUs) which perform processing. As the date of each pulse is known, they can be processed individually out-of-order to provide the results. To manage the pulses distribution, a scheduler and an interconnection network are used. pulses are distributed on the first FU which is not busy without congesting the interconnection network. For this reason, the process duration does not result anymore in dead-time if there are enough FUs. FUs are designed to be standalone and to comprises at least a programmable general purpose processor (ARM, Microblaze) allowing the implementation of complex algorithms without any modification of the hardware. An acquisition chain is composed of a succession of algorithms which lead to organize our FUs as a software macro-pipeline, A simple approach consists in assigning one algorithm per FU. Consequently, the global latency becomes the worst latency of algorithms execution on FU. Moreover, as algorithms are executed locally - i.e. on a FU - this approach limits shared memory requirement. To handle multichannel, we propose FUs sharing, this approach maximize the chance to find a non-busy FU to process an incoming pulse. This is possible since each channel receive random event independently, the pulse extractors associated to them do not necessarily need to access simultaneously to all Computing resources at the same time to distribute their pulses. The major contribution of this paper is the proposition of an execution model and its associated hardware programmable architecture for digital pulse processing that can handle multiple acquisition channels while maintaining the scalability thanks to the use of shared resources. This execution model and associated architecture are validated by simulation of a cycle accurate architecture SystemC model. Proposed architecture shows promising results in terms of scalability while maintaining zero dead-time. This work also permit the sizing of hardware resources requirement required for a predefined set of applications. Future work will focus on the interconnection network and a scheduling policy that can exploit the variable-length of pulses. Then, the hardware implementation of this architecture will be performed and tested for a representative set of application.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Inverse Segmented Motor Drive Using Dual ANPC Inverters for Common-Mode Voltage and Neutral-Point Current Cancellation

This article proposes an inverse segmented motor drive (SgMD) utilizing dual active neutral point clamped (ANPC) inverters. In the proposed configuration, the neutral point current and common-mode (CM) voltage is topologically canceled, achieving zero total neutral point current and CM voltage under ideal conditions. Also, the zero total neutral point current minimizes the neutral point voltage imbalance in ANPC inverters. The mechanisms behind neutral point current and CM voltage cancellation in the proposed inverse SgMD are first introduced. The modifications to the motor windings for implementing the inverse SgMD are explained, showing that a standard motor can be readily adapted for the proposed configuration. A space vector modulation (SVM) scheme tailored for the proposed topology is presented, along with a carrier-based implementation. Simulation results validate that the proposed topology can achieve zero total CM voltage and neutral point current. It is also shown that the proposed inverse SgMD can reduce neutral point voltage fluctuation by about 90% and RMS current stress in the dc-link capacitors by about 43% compared to the conventional SgMD.

Lee, Sangwhee [ORNL] (ORCID:0000000335490057)↗

Improving IMRT delivery efficiency with reweighted L1-minimization for inverse planning

Purpose: This study presents an improved technique to further simplify the fluence-map in intensity modulated radiation therapy (IMRT) inverse planning, thereby reducing plan complexity and improving delivery efficiency, while maintaining the plan quality.Methods: First-order total-variation (TV) minimization (min.) based on L1-norm has been proposed to reduce the complexity of fluence-map in IMRT by generating sparse fluence-map variations. However, with stronger dose sparing to the critical structures, the inevitable increase in the fluence-map complexity can lead to inefficient dose delivery. Theoretically, L0-min. is the ideal solution for the sparse signal recovery problem, yet practically intractable due to its nonconvexity of the objective function. As an alternative, the authors use the iteratively reweighted L1-min. technique to incorporate the benefits of the L0-norm into the tractability of L1-min. The weight multiplied to each element is inversely related to the magnitude of the corresponding element, which is iteratively updated by the reweighting process. The proposed penalizing process combined with TV min. further improves sparsity in the fluence-map variations, hence ultimately enhancing the delivery efficiency. To validate the proposed method, this work compares three treatment plans obtained from quadratic min. (generally used in clinic IMRT), conventional TV min., and our proposed reweighted TV min. techniques, implemented by a large-scale L1-solver (template for first-order conic solver), for five patient clinical data. Criteria such as conformation number (CN), modulation index (MI), and estimated treatment time are employed to assess the relationship between the plan quality and delivery efficiency.Results: The proposed method yields simpler fluence-maps than the quadratic and conventional TV based techniques. To attain a given CN and dose sparing to the critical organs for 5 clinical cases, the proposed method reduces the number of segments by 10-15 and 30-35, relative to TV min. and quadratic min. based plans, while MIs decreases by about 20%-30% and 40%-60% over the plans by two existing techniques, respectively. With such conditions, the total treatment time of the plans obtained from our proposed method can be reduced by 12-30 s and 30-80 s mainly due to greatly shorter multileaf collimator (MLC) traveling time in IMRT step-and-shoot delivery.Conclusions: The reweighted L1-minimization technique provides a promising solution to simplify the fluence-map variations in IMRT inverse planning. It improves the delivery efficiency by reducing the entire segments and treatment time, while maintaining the plan quality in terms of target conformity and critical structure sparing.

61 RADIATION PROTECTION AND DOSIMETRY↗

A unified statistical framework for material decomposition using multienergy photon counting x-ray detectors

Purpose: Material decomposition using multienergy photon counting x-ray detectors (PCXD) has been an active research area over the past few years. Even with some success, the problem of optimal energy selection and three material decomposition including malignant tissue is still on going research topic, and more systematic studies are required. This paper aims to address this in a unified statistical framework in a mammographic environment.Methods: A unified statistical framework for energy level optimization and decomposition of three materials is proposed. In particular, an energy level optimization algorithm is derived using the theory of the minimum variance unbiased estimator, and an iterative algorithm is proposed for material composition as well as system parameter estimation under the unified statistical estimation framework. To verify the performance of the proposed algorithm, the authors performed simulation studies as well as real experiments using physical breast phantom and ex vivo breast specimen. Quantitative comparisons using various performance measures were conducted, and qualitative performance evaluations for ex vivo breast specimen were also performed by comparing the ground-truth malignant tissue areas identified by radiologists.Results: Both simulation and real experiments confirmed that the optimized energy bins by the proposed method allow better material decomposition quality. Moreover, for the specimen thickness estimation errors up to 2 mm, the proposed method provides good reconstruction results in both simulation and real ex vivo breast phantom experiments compared to existing methods.Conclusions: The proposed statistical framework of PCXD has been successfully applied for the energy optimization and decomposition of three material in a mammographic environment. Experimental results using the physical breast phantom and ex vivo specimen support the practicality of the proposed algorithm.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A new method for tracking organ motion on diagnostic ultrasound images

Purpose: Respiratory-gated irradiation is effective in reducing the margins of a target in the case of abdominal organs, such as the liver, that change their position as a result of respiratory motion. However, existing technologies are incapable of directly measuring organ motion in real-time during radiation beam delivery. Hence, the authors proposed a novel quantitative organ motion tracking method involving the use of diagnostic ultrasound images; it is noninvasive and does not entail radiation exposure. In the present study, the authors have prospectively evaluated this proposed method. Methods: The method involved real-time processing of clinical ultrasound imaging data rather than organ monitoring; it comprised a three-dimensional ultrasound device, a respiratory sensing system, and two PCs for data storage and analysis. The study was designed to evaluate the effectiveness of the proposed method by tracking the gallbladder in one subject and a liver vein in another subject. To track a moving target organ, the method involved the control of a region of interest (ROI) that delineated the target. A tracking algorithm was used to control the ROI, and a large number of feature points and an error correction algorithm were used to achieve long-term tracking of the target. Tracking accuracy was assessed in terms of how well the ROI matched the center of the target. Results: The effectiveness of using a large number of feature points and the error correction algorithm in the proposed method was verified by comparing it with two simple tracking methods. The ROI could capture the center of the target for about 5 min in a cross-sectional image with changing position. Indeed, using the proposed method, it was possible to accurately track a target with a center deviation of 1.54 ± 0.9 mm. The computing time for one frame image using our proposed method was 8 ms. It is expected that it would be possible to track any soft-tissue organ or tumor with large deformations and changing cross-sectional position using this method. Conclusions: The proposed method achieved real-time processing and continuous tracking of the target organ for about 5 min. It is expected that our method will enable more accurate radiation treatment than is the case using indirect observational methods, such as the respiratory sensor method, because of direct visualization of the tumor. Results show that this tracking system facilitates safe treatment in clinical practice.

60 APPLIED LIFE SCIENCES↗

Interactive prostate segmentation using atlas-guided semi-supervised learning and adaptive feature selection

Purpose: Accurate prostate segmentation is necessary for maximizing the effectiveness of radiation therapy of prostate cancer. However, manual segmentation from 3D CT images is very time-consuming and often causes large intra- and interobserver variations across clinicians. Many segmentation methods have been proposed to automate this labor-intensive process, but tedious manual editing is still required due to the limited performance. In this paper, the authors propose a new interactive segmentation method that can (1) flexibly generate the editing result with a few scribbles or dots provided by a clinician, (2) fast deliver intermediate results to the clinician, and (3) sequentially correct the segmentations from any type of automatic or interactive segmentation methods. Methods: The authors formulate the editing problem as a semisupervised learning problem which can utilize a priori knowledge of training data and also the valuable information from user interactions. Specifically, from a region of interest near the given user interactions, the appropriate training labels, which are well matched with the user interactions, can be locally searched from a training set. With voting from the selected training labels, both confident prostate and background voxels, as well as unconfident voxels can be estimated. To reflect informative relationship between voxels, location-adaptive features are selected from the confident voxels by using regression forest and Fisher separation criterion. Then, the manifold configuration computed in the derived feature space is enforced into the semisupervised learning algorithm. The labels of unconfident voxels are then predicted by regularizing semisupervised learning algorithm. Results: The proposed interactive segmentation method was applied to correct automatic segmentation results of 30 challenging CT images. The correction was conducted three times with different user interactions performed at different time periods, in order to evaluate both the efficiency and the robustness. The automatic segmentation results with the original average Dice similarity coefficient of 0.78 were improved to 0.865–0.872 after conducting 55–59 interactions by using the proposed method, where each editing procedure took less than 3 s. In addition, the proposed method obtained the most consistent editing results with respect to different user interactions, compared to other methods. Conclusions: The proposed method obtains robust editing results with few interactions for various wrong segmentation cases, by selecting the location-adaptive features and further imposing the manifold regularization. The authors expect the proposed method to largely reduce the laborious burdens of manual editing, as well as both the intra- and interobserver variability across clinicians.

07 ISOTOPE AND RADIATION SOURCES↗

A general framework of noise suppression in material decomposition for dual-energy CT

Purpose: As a general problem of dual-energy CT (DECT), noise amplification in material decomposition severely reduces the signal-to-noise ratio on the decomposed images compared to that on the original CT images. In this work, the authors propose a general framework of noise suppression in material decomposition for DECT. The method is based on an iterative algorithm recently developed in their group for image-domain decomposition of DECT, with an extension to include nonlinear decomposition models. The generalized framework of iterative DECT decomposition enables beam-hardening correction with simultaneous noise suppression, which improves the clinical benefits of DECT. Methods: The authors propose to suppress noise on the decomposed images of DECT using convex optimization, which is formulated in the form of least-squares estimation with smoothness regularization. Based on the design principles of a best linear unbiased estimator, the authors include the inverse of the estimated variance–covariance matrix of the decomposed images as the penalty weight in the least-squares term. Analytical formulas are derived to compute the variance–covariance matrix for decomposed images with general-form numerical or analytical decomposition. As a demonstration, the authors implement the proposed algorithm on phantom data using an empirical polynomial function of decomposition measured on a calibration scan. The polynomial coefficients are determined from the projection data acquired on a wedge phantom, and the signal decomposition is performed in the projection domain. Results: On the Catphan{sup ®}600 phantom, the proposed noise suppression method reduces the average noise standard deviation of basis material images by one to two orders of magnitude, with a superior performance on spatial resolution as shown in comparisons of line-pair images and modulation transfer function measurements. On the synthesized monoenergetic CT images, the noise standard deviation is reduced by a factor of 2–3. By using nonlinear decomposition on projections, the authors’ method effectively suppresses the streaking artifacts of beam hardening and obtains more uniform images than their previous approach based on a linear model. Similar performance of noise suppression is observed in the results of an anthropomorphic head phantom and a pediatric chest phantom generated by the proposed method. With beam-hardening correction enabled by their approach, the image spatial nonuniformity on the head phantom is reduced from around 10% on the original CT images to 4.9% on the synthesized monoenergetic CT image. On the pediatric chest phantom, their method suppresses image noise standard deviation by a factor of around 7.5, and compared with linear decomposition, it reduces the estimation error of electron densities from 33.3% to 8.6%. Conclusions: The authors propose a general framework of noise suppression in material decomposition for DECT. Phantom studies have shown the proposed method improves the image uniformity and the accuracy of electron density measurements by effective beam-hardening correction and reduces noise level without noticeable resolution loss.

60 APPLIED LIFE SCIENCES↗

3D liver segmentation using multiple region appearances and graph cuts

Purpose: Efficient and accurate 3D liver segmentations from contrast-enhanced computed tomography (CT) images play an important role in therapeutic strategies for hepatic diseases. However, inhomogeneous appearances, ambiguous boundaries, and large variance in shape often make it a challenging task. The existence of liver abnormalities poses further difficulty. Despite the significant intensity difference, liver tumors should be segmented as part of the liver. This study aims to address these challenges, especially when the target livers contain subregions with distinct appearances. Methods: The authors propose a novel multiregion-appearance based approach with graph cuts to delineate the liver surface. For livers with multiple subregions, a geodesic distance based appearance selection scheme is introduced to utilize proper appearance constraint for each subregion. A special case of the proposed method, which uses only one appearance constraint to segment the liver, is also presented. The segmentation process is modeled with energy functions incorporating both boundary and region information. Rather than a simple fixed combination, an adaptive balancing weight is introduced and learned from training sets. The proposed method only calls initialization inside the liver surface. No additional constraints from user interaction are utilized. Results: The proposed method was validated on 50 3D CT images from three datasets, i.e., Medical Image Computing and Computer Assisted Intervention (MICCAI) training and testing set, and local dataset. On MICCAI testing set, the proposed method achieved a total score of 83.4 ± 3.1, outperforming nonexpert manual segmentation (average score of 75.0). When applying their method to MICCAI training set and local dataset, it yielded a mean Dice similarity coefficient (DSC) of 97.7% ± 0.5% and 97.5% ± 0.4%, respectively. These results demonstrated the accuracy of the method when applied to different computed tomography (CT) datasets. In addition, user operator variability experiments showed its good reproducibility. Conclusions: A multiregion-appearance based method is proposed and evaluated to segment liver. This approach does not require prior model construction and so eliminates the burdens associated with model construction and matching. The proposed method provides comparable results with state-of-the-art methods. Validation results suggest that it may be suitable for the clinical use.

60 APPLIED LIFE SCIENCES↗