Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithm selection”

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 1,531 records · Page 85

THINK OUTSIDE THE COLOR BOX: PROBABILISTIC TARGET SELECTION AND THE SDSS-XDQSOQUASAR TARGETING CATALOG

We present the SDSS-XDQSO quasar targeting catalog for efficient flux-based quasar target selection down to the faint limit of the Sloan Digital Sky Survey (SDSS) catalog, even at medium redshifts (2.5 {approx}< z {approx}< 3) where the stellar contamination is significant. We build models of the distributions of stars and quasars in flux space down to the flux limit by applying the extreme-deconvolution method to estimate the underlying density. We convolve this density with the flux uncertainties when evaluating the probability that an object is a quasar. This approach results in a targeting algorithm that is more principled, more efficient, and faster than other similar methods. We apply the algorithm to derive low-redshift (z < 2.2), medium-redshift (2.2 {le} z {le} 3.5), and high-redshift (z > 3.5) quasar probabilities for all 160,904,060 point sources with dereddened i-band magnitude between 17.75 and 22.45 mag in the 14,555 deg{sup 2} of imaging from SDSS Data Release 8. The catalog can be used to define a uniformly selected and efficient low- or medium-redshift quasar survey, such as that needed for the SDSS-III's Baryon Oscillation Spectroscopic Survey project. We show that the XDQSO technique performs as well as the current best photometric quasar-selection technique at low redshift, and outperforms all other flux-based methods for selecting the medium-redshift quasars of our primary interest. We make code to reproduce the XDQSO quasar target selection publicly available.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Algorithm for Establishing Safeguards Termination Concentration Limits

This paper presents an algorithm for estimating the maximum concentration limits for terminating safeguards on nuclear materials. These limits are important because such material is no longer subject to accounting, reporting or inspections after the International Atomic Energy Agency (IAEA) has approved the termination of safeguards on nuclear material declared by a State to be waste.Maximum concentration limits for different waste forms generated within nuclear fuel cycle facilities must be sufficiently conservative such that termination of safeguards does not become a weak link in the safeguards system. The concentration limits must also remain practical in order to ensure IAEA resources are used effectively and efficiently to implement safeguards in the State. These termination limits should be technically-based while remaining objective and reasonable to implement by the State. In support of the original IAEA guidance on concentration limits for termination of safeguards prepared in the early 1990s, the U.S. developed an algorithm to estimate concentrations that would make recovery of nuclear material from waste on which safeguards had been terminated at least as unattractive as undeclared production from uranium ore or diversion of similar nuclear material. In 2016, the IAEA sought technical advice from a meeting of experts from selected member States to support updating its internal guidance on termination of safeguards. Their recommendations included extending the guidance to consider additional waste forms. The experts in the 2016 meeting recommended that the IAEA limits should more clearly reflect the technical difficulty and level of effort required to recover nuclear material from the various waste forms. This paper identifies and assesses the most likely techniques a State might use to recover nuclear material from the waste forms identified by the experts and determines how the safeguards termination algorithm could be revised to more accurately reflect the difficulty of recovering one significant quantity of nuclear material from these waste forms.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Prediction of stability constants of metal–ligand complexes by machine learning for the design of ligands with optimal metal ion selectivity

The new LOGKPREDICT program integrates HostDesigner molecular design software with the machine learning (ML) program Chemprop. By supplying HostDesigner with predicted log K values, LOGKPREDICT enhances the computer-aided molecular design process by ranking ligands directly by metal–ligand binding strength. Harnessing reliable experimental data from a historic National Institute of Standards and Technology (NIST) database and data from the International Union of Pure and Applied Chemistry (IUPAC), we train message passing neural net algorithms. The multi-metal NIST-based ML model has a root mean square error (RMSE) of 0.629 ± 0.044 (R 2 of 0.960 ± 0.006), while two versions of lanthanide-only IUPAC-based ML models have, respectively, RMSE of 0.764 ± 0.073 (R 2 of 0.976 ± 0.005) and 0.757 ± 0.071 (R 2 of 0.959 ± 0.007). For relative log K predictions on an out-of-sample set of six ligands, demonstrating metal ion selectivity, the RMSE value reaches a commendably low 0.25. Here we showcase the use of LOGKPREDICT in identifying ligands with high selectivity for lanthanides in aqueous solutions, a finding supported by recent experimental evidence. We also predict new ligands yet to be verified experimentally. Therefore, our ML models implemented through LOGKPREDICT and interfaced with the ligand design software HostDesigner pave the way for designing new ligands with predetermined selectivity for competing metal ions in an aqueous solution.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

TU-AB-BRA-03: Atlas-Based Algorithms with Local Registration-Goodness Weighting for MRI-Driven Electron Density Mapping

Purpose: To develop image-analysis algorithms to synthesize CT with accurate electron densities for MR-only radiotherapy of head & neck (H&N) and pelvis anatomies. Methods: CT and 3T-MRI (Philips, mDixon sequence) scans were randomly selected from a pool of H&N (n=11) and pelvis (n=12) anatomies to form an atlas. All MRIs were pre-processed to eliminate scanner and patient-induced intensity inhomogeneities and standardize their intensity histograms. CT and MRI for each patient were then co-registered to construct CT-MRI atlases. For more accurate CT-MR fusion, bone intensities in CT were suppressed to improve the similarity between CT and MRI. For a new patient, all CT-MRI atlases are deformed onto the new patients’ MRI initially. A newly-developed generalized registration error (GRE) metric was then calculated as a measure of local registration accuracy. The synthetic CT value at each point is a 1/GRE-weighted average of CTs from all CT-MR atlases. For evaluation, the mean absolute error (MAE) between the original and synthetic CT (generated in a leave-one-out scheme) was computed. The planning dose from the original and synthetic CT was also compared. Results: For H&N patients, MAE was 67±9, 114±22, and 116±9 HU over the entire-CT, air and bone regions, respectively. For pelvis anatomy, MAE was 47±5 and 146±14 for the entire and bone regions. In comparison with MIRADA medical, an FDA-approved registration tool, we found that our proposed registration strategy reduces MAE by ∼30% and ∼50% over the entire and bone regions, respectively. GRE-weighted strategy further lowers MAE by ∼15% to ∼40%. Our primary dose calculation also showed highly consistent results between the original and synthetic CT. Conclusion: We’ve developed a novel image-analysis technique to synthesize CT for H&N and pelvis anatomies. Our proposed image fusion strategy and GRE metric help generate more accurate synthetic CT using locally more similar atlases (Support: Philips Healthcare). The research is supported by Philips HealthCare.

60 APPLIED LIFE SCIENCES↗

Search for non-resonant Higgs boson pair production in the $2b+2\ell +{E}_{\textrm{T}}^{\textrm{miss}}$ final state in pp collisions at $\sqrt{s}$ = 13 TeV with the ATLAS detector

A search for non-resonant Higgs boson pair (HH) production is presented, in which one of the Higgs bosons decays to a b-quark pair ($b\bar{b}$) and the other decays to WW * , ZZ * , or τ + τ – , with in each case a final state with ℓ + ℓ – + neutrinos (ℓ = e, μ). The analysis targets separately the gluon-gluon fusion and vector boson fusion production modes. Data recorded by the ATLAS detector in proton-proton collisions at a centre-of-mass energy of 13 TeV at the Large Hadron Collider, corresponding to an integrated luminosity of 140 fb –1 , are used in this analysis. Events are selected to have exactly two b-tagged jets and two leptons with opposite electric charge and missing transverse momentum in the final state. These events are classified using multivariate analysis algorithms to separate the HH events from other Standard Model processes. No evidence of the signal is found. The observed (expected) upper limit on the cross-section for non-resonant Higgs boson pair production is determined to be 9.7 (16.2) times the Standard Model prediction at 95% confidence level. The Higgs boson self-interaction coupling parameter κ λ and the quadrilinear coupling parameter κ 2V are each separately constrained by this analysis to be within the ranges [–6.2, 13.3] and [–0.17, 2.4], respectively, at 95% confidence level, when all other parameters are fixed.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Root identification in minirhizotron imagery with multiple instance learning

In this study, multiple instance learning (MIL) algorithms to automatically perform root detection and segmentation in minirhizotron imagery using only image-level labels are proposed. Root and soil characteristics vary from location to location, and thus, supervised machine learning approaches that are trained with local data provide the best ability to identify and segment roots in minirhizotron imagery. However, labeling roots for training data (or otherwise) is an extremely tedious and time-consuming task. This paper aims to address this problem by labeling data at the image level (rather than the individual root or root pixel level) and train algorithms to perform individual root pixel level segmentation using MIL strategies. Three MIL methods (multiple instance adaptive cosine coherence estimator, multiple instance support vector machine, multiple instance learning with randomized trees) were applied to root detection and compared to non-MIL approaches. The results show that MIL methods improve root segmentation in challenging minirhizotron imagery and reduce the labeling burden. In our results, multiple instance support vector machine outperformed other methods. The multiple instance adaptive cosine coherence estimator algorithm was a close second with an added advantage that it learned an interpretable root signature which identified the traits used to distinguish roots from soil and did not require parameter selection.

59 BASIC BIOLOGICAL SCIENCES↗

Quasiclassical sampling and Wigner sampling of initial vibrational coordinates and momenta for polyatomic molecules in Monte Carlo molecular dynamics simulations

In a quasiclassical trajectory simulation, the vibrational modes are initialised with quantised vibrational energies, but vibrational phases are sampled by Monte Carlo. This requires an algorithm to assign coordinates and momenta to the various atoms. In this work, we present two methods for implementing this for nonrotating polyatomic molecules, namely, fixed-energy vibrational-state-selected initial conditions and thermal initial conditions. We also present a method for initiating classical trajectories with a ground-state Wigner distribution. These vibrational treatments are sufficient to initialise trajectories for unimolecular processes, and we also show how they can be applied to simulate bimolecular collision processes. The treatments of unimolecular and bimolecular collision processes are available in two Python codes called wigner_state_selected.py and bimolecular_collision.py, respectively, which will generate initial condition files that are recognisable by the SHARC and SHARC-MN computer programs for dynamics calculations. Both codes are available as standalone programs, as well as being included in SHARC-MN, and they will be included in future versions of SHARC. Here, the methods implemented in these codes are mostly also available in the ANT computer program, and those that are not available in ANT will be incorporated in future versions of ANT.

Wigner distribution↗

Precisely computing phonons via irreducible derivatives

Computing phonons from first principles is typically considered a solved problem, yet inadequacies in existing techniques continue to yield deficient results in systems with sensitive phonons. Here, in this study, we circumvent this issue using the lone irreducible derivative (LID) and bundled irreducible derivative (BID) approaches to computing phonons via finite displacements, where the former optimizes precision via energy derivatives and the latter provides the most efficient algorithm using force derivatives. A condition number optimized basis for BID is derived which guarantees the minimum amplification of error. Additionally, a hybrid LID-BID approach is formulated, in which select irreducible derivatives computed using LID replace BID results. We illustrate our approach on two prototypical systems with sensitive phonons: the shape memory alloy AuZn and metallic lithium. Comparing our resulting phonons in the aforementioned crystals to calculations in the literature reveals nontrivial inaccuracies. Our approaches can be fully automated, making them well suited for both niche systems of interest and high-throughput approaches.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Degradation Mechanisms and Lifetime Prediction for Lithium-Ion Batteries -- A Control Perspective: Preprint

Predictive models of Li-ion battery lifetime must consider a multiplicity of electrochemical, thermal, and mechanical degradation modes experienced by batteries in application environments. To complicate matters, Li-ion batteries can experience different degradation trajectories that depend on storage and cycling history of the application environment. Rates of degradation are controlled by factors such as temperature history, electrochemical operating window, and charge/discharge rate. We present a generalized battery life prognostic model framework for battery systems design and control. The model framework consists of trial functions that are statistically regressed to Li-ion cell life datasets wherein the cells have been aged under different levels of stress. Degradation mechanisms and rate laws dependent on temperature, storage, and cycling condition are regressed to the data, with multiple model hypotheses evaluated and the best model down-selected based on statistics. The resulting life prognostic model, implemented in state variable form, is extensible to arbitrary real-world scenarios. The model is applicable in real-time control algorithms to maximize battery life and performance. We discuss efforts to reduce lifetime prediction error and accommodate its inevitable impact in controller design.

25 ENERGY STORAGE↗

Electron efficiency measurements with the ATLAS detector using 2012 LHC proton–proton collision data

This paper describes the algorithms for the reconstruction and identification of electrons in the central region of the ATLAS detector at the Large Hadron Collider (LHC). These algorithms were used for all ATLAS results with electrons in the final state that are based on the 2012 pp collision data produced by the LHC at s = 8 TeV. The efficiency of these algorithms, together with the charge misidentification rate, is measured in data and evaluated in simulated samples using electrons from Z→ ee, Z→ eeγ and J/ ψ→ ee decays. For these efficiency measurements, the full recorded data set, corresponding to an integrated luminosity of 20.3 fb - 1 , is used. Based on a new reconstruction algorithm used in 2012, the electron reconstruction efficiency is 97% for electrons with E T = 15 GeV and 99% at E T = 50 GeV. Combining this with the efficiency of additional selection criteria to reject electrons from background processes or misidentified hadrons, the efficiency to reconstruct and identify electrons at the ATLAS experiment varies from 65 to 95%, depending on the transverse momentum of the electron and background rejection.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Scalable/Secure Cooperative Algorithms and Framework for Extremely-high Penetration Solar Integration (SolarExPert) (Final Technical Report)

This SolarExPert project has developed a Sustainable Grid Platform (SGP) with scalable architecture of distributed control and optimization. The SGP consists of the following major functions: 1) an advanced grid architecture with hierarchical and distributed communication and control, combined with the OpenFMB standard and implemented on the Multi-Agent OpenDSS (MA-OpenDSS) platform; 2) an online distributed stochastic optimal power flow; 3) an online distributed system state estimation algorithm; 4) the distributed Volt/VAR optimization and frequency control algorithms; 5) the distributed distribution system restoration strategy. The developed SGP together with advanced functions are tested in 1 million (1M)-node distribution system on the MA-OpenDSS platform. Furthermore, the models and algorithms are tested in 100,000-node system HiL simulation, and also in P-HiL implementation with 100 physical devices. The developed functions haven been validated and tested on the selected actual distribution feeder with the data collected from the field of Maui Meadows in Hawaii. The distributed PV hosting capacities with cooperative Volt/VAR and Volt/VAR/Watt control are estimated and compared to provide recommendations for customers and the utility company.

14 SOLAR ENERGY↗

An Explainable Machine-Learning Model for Compensatory Reserve Measurement: Methods for Feature Selection and the Effects of Subject Variability

Tracking vital signs accurately is critical for triaging a patient and ensuring timely therapeutic intervention. The patient’s status is often clouded by compensatory mechanisms that can mask injury severity. The compensatory reserve measurement (CRM) is a triaging tool derived from an arterial waveform that has been shown to allow for earlier detection of hemorrhagic shock. However, the deep-learning artificial neural networks developed for its estimation do not explain how specific arterial waveform elements lead to predicting CRM due to the large number of parameters needed to tune these models. Alternatively, we investigate how classical machine-learning models driven by specific features extracted from the arterial waveform can be used to estimate CRM. More than 50 features were extracted from human arterial blood pressure data sets collected during simulated hypovolemic shock resulting from exposure to progressive levels of lower body negative pressure. A bagged decision tree design using the ten most significant features was selected as optimal for CRM estimation. This resulted in an average root mean squared error in all test data of 0.171, similar to the error for a deep-learning CRM algorithm at 0.159. By separating the dataset into sub-groups based on the severity of simulated hypovolemic shock withstood, large subject variability was observed, and the key features identified for these sub-groups differed. This methodology could allow for the identification of unique features and machine-learning models to differentiate individuals with good compensatory mechanisms against hypovolemia from those that might be poor compensators, leading to improved triage of trauma patients and ultimately enhancing military and emergency medicine.

60 APPLIED LIFE SCIENCES↗

Toward Accurate Modeling of Galaxy Clustering on Small Scales: Constraining the Galaxy-halo Connection with Optimal Statistics

Applying halo models to analyze the small-scale clustering of galaxies is a proven method for characterizing the connection between galaxies and their host halos. Such works are often plagued by systematic errors or limited to clustering statistics that can be predicted analytically. In this work, we employ a numerical mock-based modeling procedure to examine the clustering of Sloan Digital Sky Survey DR7 galaxies. We apply a standard halo occupation distribution (HOD) model to dark matter only simulations with a ΛCDM cosmology. To constrain the theoreStical models, we utilize a combination of galaxy number density and selected scales of the projected correlation function, redshift-space correlation function, group multiplicity function, average group velocity dispersion, mark correlation function, and counts-in-cells statistics. We design an algorithm to choose an optimal combination of measurements that yields tight and accurate constraints on our model parameters. Compared to previous work using fewer clustering statistics, we find a significant improvement in the constraints on all parameters of our halo model for two different luminosity-threshold galaxy samples. Most interestingly, we obtain unprecedented high-precision constraints on the scatter in the relationship between galaxy luminosity and halo mass. However, our best-fit model results in significant tension (>4σ) for both samples, indicating the need to add second-order features to the standard HOD model. To guarantee the robustness of these results, we perform an extensive analysis of the systematic and statistical errors in our modeling procedure, including a first of its kind study of the sensitivity of our constraints to changes in the halo mass function due to baryonic physics.

79 ASTRONOMY AND ASTROPHYSICS↗

Learning planar Ising models

Inference and learning of graphical models are both well-studied problems in statistics and machine learning that have found many applications in science and engineering. However, exact inference is intractable in general graphical models, which suggests the problem of seeking the best approximation to a collection of random variables within some tractable family of graphical models. In this paper, we focus on the class of planar Ising models, for which exact inference is tractable using techniques of statistical physics. Based on these techniques and recent methods for planarity testing and planar embedding, we propose a greedy algorithm for learning the best planar Ising model to approximate an arbitrary collection of binary random variables (possibly from sample data). Given the set of all pairwise correlations among variables, we select a planar graph and optimal planar Ising model defined on this graph to best approximate that set of correlations. Finally, we demonstrate our method in simulations and for two applications: modeling senate voting records and identifying geo-chemical depth trends from Mars rover data.

97 MATHEMATICS AND COMPUTING↗

Angular clustering properties of the DESI QSO target selection using DR9 Legacy Imaging Surveys

ABSTRACT The quasar target selection for the upcoming survey of the Dark Energy Spectroscopic Instrument (DESI) will be fixed for the next 5 yr. The aim of this work is to validate the quasar selection by studying the impact of imaging systematics as well as stellar and galactic contaminants, and to develop a procedure to mitigate them. Density fluctuations of quasar targets are found to be related to photometric properties such as seeing and depth of the Data Release 9 of the DESI Legacy Imaging Surveys. To model this complex relation, we explore machine learning algorithms (random forest and multilayer perceptron) as an alternative to the standard linear regression. Splitting the footprint of the Legacy Imaging Surveys into three regions according to photometric properties, we perform an independent analysis in each region, validating our method using extended Baryon Oscillation Spectroscopic Survey (eBOSS) EZ-mocks. The mitigation procedure is tested by comparing the angular correlation of the corrected target selection on each photometric region to the angular correlation function obtained using quasars from the Sloan Digital Sky Survey (SDSS) Data Release 16. With our procedure, we recover a similar level of correlation between DESI quasar targets and SDSS quasars in two-thirds of the total footprint and we show that the excess of correlation in the remaining area is due to a stellar contamination that should be removed with DESI spectroscopic data. We derive the Limber parameters in our three imaging regions and compare them to previous measurements from SDSS and the 2dF QSO Redshift Survey.

79 ASTRONOMY AND ASTROPHYSICS↗

ECP Milestone Report: Identify initial kernels, bake-off problems (benchmarks) and miniapps (CEED-MS6)

The CEED co-design center is developing a number of kernels, bake-off / benchmark problems (BPs) and mini-applications (miniapps) that capture the unique requirements of high-order finite element algorithms and use them to influence standards, best practices and vendors to generate more portable, better performing code across diverse hardware designs. This is a main activity in CEED’s Hardware, Applications and Finite Element thrusts. CEED’s miniapps, a.k.a. CEEDlings, are small, standalone applications - surrogates for sub-components of interest from the selected first wave of applications (the MARBL/LLNLApp and ExaSMR projects). The BPs are even smaller standalone programs that solve a simple physical problem, including discretization, linear and/or nonlinear solve, and potentially a relatively small number of time steps. A BP may be a proxy/surrogate for part of a miniapp or another problem of general interest. In CEED, both miniapps and BPs will be used extensively in the project to evaluate and compare the performance of algorithms in specific contexts. The parts of the miniapps and BPs that play an important role in their overall performance will be identified and separated as standalone kernels. These kernels and their interaction inside BPs, miniapps and the actual applications, will be the main focus of our optimization efforts. All three standalone pieces of software (miniapps, BPs, and kernels) will serve as a basis for engaging and collaborating with hardware vendors and software technologies (ST) projects. These partners can start at the bottom of the hierarchy, e.g. with the kernels, and easily transition to BPs and miniapps as all three families will be produced in the same CEED environment. In this milestone we identified the initial kernels, bake-off problems and miniapps and delivered software and documentation for them through the new CEED website, http://ceed.exascaleproject.org. We specifically identified the Nekbone miniapp for the ExaSMR application and developed a new miniapp, Laghos, for the MARBL/LLNLApp application. We also formulated four initial benchmark problems (BP1- BP4) with clearly defined performance metrics and performed an initial bake-off comparison between the Nek5000 (spectral element) and MFEM (high-order finite element) technologies. As part of the milestone, we also engaged vendors (AMD) and ST projects (MPICH, STRUMPACK). In this document we are reporting some details and results from these R&D activities, as well as additional project-wide activities performed in Q3 of FY17, including: making CEED software available on GitHub, developing the project website, and the preparation of CEED’s first annual meeting.

97 MATHEMATICS AND COMPUTING↗

Scaling up to address data science challenges

Statistics and Data Science provide a variety of perspectives and technical approaches for exploring and understanding Big Data. Partnerships between scientists from different fields such as statistics, machine learning, computer science, and applied mathematics can lead to innovative approaches for addressing problems involving increasingly large amounts of data in a rigorous and effective manner that takes advantage of advances in computing. Here, this article will explore various challenges in Data Science and will highlight statistical approaches that can facilitate analysis of large-scale data including sampling and data reduction methods, techniques for effective analysis and visualization of large-scale simulations, and algorithms and procedures for efficient processing.

97 MATHEMATICS AND COMPUTING↗

A block matching-based registration algorithm for localization of locally advanced lung tumors

Purpose: To implement and evaluate a block matching-based registration (BMR) algorithm for locally advanced lung tumor localization during image-guided radiotherapy. Methods: Small (1 cm{sup 3}), nonoverlapping image subvolumes (“blocks”) were automatically identified on the planning image to cover the tumor surface using a measure of the local intensity gradient. Blocks were independently and automatically registered to the on-treatment image using a rigid transform. To improve speed and robustness, registrations were performed iteratively from coarse to fine image resolution. At each resolution, all block displacements having a near-maximum similarity score were stored. From this list, a single displacement vector for each block was iteratively selected which maximized the consistency of displacement vectors across immediately neighboring blocks. These selected displacements were regularized using a median filter before proceeding to registrations at finer image resolutions. After evaluating all image resolutions, the global rigid transform of the on-treatment image was computed using a Procrustes analysis, providing the couch shift for patient setup correction. This algorithm was evaluated for 18 locally advanced lung cancer patients, each with 4–7 weekly on-treatment computed tomography scans having physician-delineated gross tumor volumes. Volume overlap (VO) and border displacement errors (BDE) were calculated relative to the nominal physician-identified targets to establish residual error after registration. Results: Implementation of multiresolution registration improved block matching accuracy by 39% compared to registration using only the full resolution images. By also considering multiple potential displacements per block, initial errors were reduced by 65%. Using the final implementation of the BMR algorithm, VO was significantly improved from 77% ± 21% (range: 0%–100%) in the initial bony alignment to 91% ± 8% (range: 56%–100%;p < 0.001). Left-right, anterior-posterior, and superior-inferior systematic BDE were 3.2, 2.4, and 4.4 mm, respectively, with random BDE of 2.4, 2.1, and 2.7 mm. Margins required to include both localization and delineation uncertainties ranged from 5.0 to 11.7 mm, an average of 40% less than required for bony alignment. Conclusions: BMR is a promising approach for automatic lung tumor localization. Further evaluation is warranted to assess the accuracy and robustness of BMR against other potential localization strategies.

62 RADIOLOGY AND NUCLEAR MEDICINE↗