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,495 records · Page 83

Model Order Reduction of Nonviscously Damped Structural Dynamic Models

A reduced order modeling capability has been developed to reduce the computational burden associated with time-domain solutions of structural dynamic models with linear viscoelastic materials. The discretized equations-of-motion produce convolution integrals resulting in a linear system with nonviscous damping forces. The challenge associated with the reduction of nonviscously damped, linear systems is the selection and computation of the appropriate modal basis to perform modal projection. The system produces a nonlinear eigenvalue problem that is challenging to solve and requires use of specialized algorithms not readily available in commercial finite element packages. This SAND report summarizes the LDRD discoveries of a reduction scheme developed for monolithic finite element models and provides preliminary investigations to extensions of the method using component mode synthesis. In addition, this report provides a background overview of structural dynamic modeling of structures with linear viscoelastic materials, and provides an overview of a new code capability in Sierra Structural Dynamics to output the system level matrices computed on multiple processors.

97 MATHEMATICS AND COMPUTING↗

Hyperspectral imaging of microalgae using two-photon excitation.

A considerable amount research is being conducted on microalgae, since microalgae are becoming a promising source of renewable energy. Most of this research is centered on lipid production in microalgae because microalgae produce triacylglycerol which is ideal for biodiesel fuels. Although we are interested in research to increase lipid production in algae, we are also interested in research to sustain healthy algal cultures in large scale biomass production farms or facilities. The early detection of fluctuations in algal health, productivity, and invasive predators must be developed to ensure that algae are an efficient and cost-effective source of biofuel. Therefore we are developing technologies to monitor the health of algae using spectroscopic measurements in the field. To do this, we have proposed to spectroscopically monitor large algal cultivations using LIDAR (Light Detection And Ranging) remote sensing technology. Before we can deploy this type of technology, we must first characterize the spectral bio-signatures that are related to algal health. Recently, we have adapted our confocal hyperspectral imaging microscope at Sandia to have two-photon excitation capabilities using a chameleon tunable laser. We are using this microscope to understand the spectroscopic signatures necessary to characterize microalgae at the cellular level prior to using these signatures to classify the health of bulk samples, with the eventual goal of using of LIDAR to monitor large scale ponds and raceways. By imaging algal cultures using a tunable laser to excite at several different wavelengths we will be able to select the optimal excitation/emission wavelengths needed to characterize algal cultures. To analyze the hyperspectral images generated from this two-photon microscope, we are using Multivariate Curve Resolution (MCR) algorithms to extract the spectral signatures and their associated relative intensities from the data. For this presentation, I will show our two-photon hyperspectral imaging results on a variety of microalgae species and show how these results can be used to characterize algal ponds and raceways.

09 BIOMASS FUELS↗

Diagnostic Models for Wind Turbine Gearbox Components Using SCADA Time Series Data: Preprint

This paper presents a scalable, autonomous framework for diagnostics of wind turbine gearbox failures using a multi-feature supervisory control and data acquisition data set spanning multiple years. Because of the size of the data set studied, all algorithms were constructed to be scalable using a Spark-Hadoop data framework. An unsupervised approach was used to detect significant failures based on predetermined criteria. The initial criteria selected were an abnormal spike in turbine component temperature followed by a turbine power off, which helps reduce the number of potential false alarms. To detect abnormal spikes in component temperature, a model was introduced to adjust the temperature data for effects caused by ambient temperature and normal temperature increases when loaded. This study evaluates methods for normalizing temperature sensor data to identify anomalies. The models that performed the best were a linear regression and a multivariate polynomial regression. The proposed process for finding failures has tunable parameters that can be adjusted to be more or less sensitive. The combination of sensor data normalization and application of these criteria is successful in finding turbine failures resulting in downtime. The proposed methods can operate without failure or maintenance logs and can be utilized for offline analysis of large high-resolution data sets.

17 WIND ENERGY↗

Extraction and applications of skeletons in finite element mesh generation.

This paper focuses on the extraction of skeletons of CAD models and its applications in finite element (FE) mesh generation. The term 'skeleton of a CAD model' can be visualized as analogous to the 'skeleton of a human body'. The skeletal representations covered in this paper include medial axis transform (MAT), Voronoi diagram (VD), chordal axis transform (CAT), mid surface, digital skeletons, and disconnected skeletons. In the literature, the properties of a skeleton have been utilized in developing various algorithms for extracting skeletons. Three main approaches include: (1) the bisection method where the skeleton exists at equidistant from at least two points on boundary, (2) the grassfire propagation method in which the skeleton exists where the opposing fronts meet, and (3) the duality method where the skeleton is a dual of the object. In the last decade, the author has applied different skeletal representations in all-quad meshing, hex meshing, mid-surface meshing, mesh size function generation, defeaturing, and decomposition. A brief discussion on the related work from other researchers in the area of tri meshing, tet meshing, and anisotropic meshing is also included. This paper concludes by summarizing the strengths and weaknesses of the skeleton-based approaches in solving various geometry-centered problems in FE mesh generation. The skeletons have proved to be a great shape abstraction tool in analyzing the geometric complexity of CAD models as they are symmetric, simpler (reduced dimension), and provide local thickness information. However, skeletons generally require some cleanup, and stability and sensitivity of the skeletons should be controlled during extraction. Also, selecting a suitable application-specific skeleton and a computationally efficient method of extraction is critical.

99 GENERAL AND MISCELLANEOUS↗

[Skeleton extractions and applications].

This paper focuses on the extraction of skeletons of CAD models and its applications in finite element (FE) mesh generation. The term 'skeleton of a CAD model' can be visualized as analogous to the 'skeleton of a human body'. The skeletal representations covered in this paper include medial axis transform (MAT), Voronoi diagram (VD), chordal axis transform (CAT), mid surface, digital skeletons, and disconnected skeletons. In the literature, the properties of a skeleton have been utilized in developing various algorithms for extracting skeletons. Three main approaches include: (1) the bisection method where the skeleton exists at equidistant from at least two points on boundary, (2) the grassfire propagation method in which the skeleton exists where the opposing fronts meet, and (3) the duality method where the skeleton is a dual of the object. In the last decade, the author has applied different skeletal representations in all-quad meshing, hex meshing, mid-surface meshing, mesh size function generation, defeaturing, and decomposition. A brief discussion on the related work from other researchers in the area of tri meshing, tet meshing, and anisotropic meshing is also included. This paper concludes by summarizing the strengths and weaknesses of the skeleton-based approaches in solving various geometry-centered problems in FE mesh generation. The skeletons have proved to be a great shape abstraction tool in analyzing the geometric complexity of CAD models as they are symmetric, simpler (reduced dimension), and provide local thickness information. However, skeletons generally require some cleanup, and stability and sensitivity of the skeletons should be controlled during extraction. Also, selecting a suitable application-specific skeleton and a computationally efficient method of extraction is critical.

99 GENERAL AND MISCELLANEOUS↗

A Novel Protection Scheme for Unbalanced Faults in Inverter Dominated Networks: A Computationally Efficient Algorithm for Entry-Level Relays

Microgrids are now a common practice in distribution systems to increase resilience and reliability. However, microgrid protection remains a critical challenge, considering its requirement to operate in both grid connected and islanded, and the variability in fault characteristics under each mode of operation. This paper presents unbalanced power (S unb ) based fault detection algorithm, which considers local voltage and current unbalances to determine faults in the system. S unb is a computationally efficient fault detection algorithm that is suitable for implementation in the programmable logic of entry level protective relays. In addition, the difference in current and voltage unbalance (D n ) is used to determine the fault type. The proposed method demonstrates high sensitivity and selectivity for line-to-ground (LG), line-to-line (LL), and double line-to-ground (LLG) faults, representing the most common faults in distribution systems. It also allows relay coordination with upstream and downstream protection devices in both island and grid connected operation, while preserving grading margins. The same pickup and time multiplier settings of a particular relay for both modes of operation eliminates the need for adaptive settings, which rely on communication networks. Validation was performed with a hardware-in-the-loop (HIL) setup using Typhoon HIL real time simulator interfaced with three entry-level, SEL 751 relays. Results confirmed the algorithm’s ability to discriminate fault conditions, and determine the fault type under both operating modes, maintain fast detection times, and ensure proper protection coordination.

fault classification↗

WE-G-BRD-04: BEST IN PHYSICS (JOINT IMAGING-THERAPY): An Integrated Model-Based Intrafractional Organ Motion Tracking Approach with Dynamic MRI in Head and Neck Radiotherapy

Purpose: In-treatment dynamic cine images, provided by the first commercially available MRI-guided radiotherapy system, allow physicians to observe intrafractional motion of head and neck (H&N) internal structures. Nevertheless, high anatomical complexity and relatively poor cine image contrast/resolution have complicated automatic intrafractional motion evaluation. We proposed an integrated model-based approach to automatically delineate and analyze moving structures from on-board cine images. Methods: The H&N upper airway, a complex and highly deformable region wherein severe internal motion often occurs, was selected as the target-to-be-tracked. To reliably capture its motion, a hierarchical structure model containing three statistical shapes (face, face-jaw, and face-jaw-palate) was first built from a set of manually delineated shapes using principal component analysis. An integrated model-fitting algorithm was then employed to align the statistical shapes to the first to-be-detected cine frame, and multi-feature level-set contour propagation was performed to identify the airway shape change in the remaining frames. Ninety sagittal cine MR image sets, acquired from three H&N cancer patients, were utilized to demonstrate this approach. Results: The tracking accuracy was validated by comparing the results to the average of two manual delineations in 20 randomly selected images from each patient. The resulting dice similarity coefficient (93.28+/−1.46 %) and margin error (0.49+/−0.12 mm) showed good agreement with the manual results. Intrafractional displacements of anterior, posterior, inferior, and superior airway boundaries were observed, with values of 2.62+/−2.92, 1.78+/−1.43, 3.51+/−3.99, and 0.68+/−0.89 mm, respectively. The H&N airway motion was found to vary across directions, fractions, and patients, and highly correlated with patients’ respiratory frequency. Conclusion: We proposed the integrated computational approach, which for the first time allows to automatically identify the H&N upper airway and quantify in-treatment H&N internal motion in real-time. This approach can be applied to track other structures’ motion, and provide guidance on patient-specific prediction of intra-/inter-fractional structure displacements.

60 APPLIED LIFE SCIENCES↗

Graph Neural Networks for Parameterized Quantum Circuits Expressibility Estimation (Rev.1)

Parameterized quantum circuits (PQCs) are fundamental to quantum machine learning (QML), quantum optimization, and variational quantum algorithms (VQAs). The expressibility of PQCs is a measure that determines their capability to harness the full potential of the quantum state space. It is thus a crucial guidepost to know when selecting a particular PQC ansatz. However, the existing technique for expressibility computation through statistical estimation requires a large number of samples, which poses significant challenges due to time and computational resource constraints. This paper introduces a novel approach for expressibility estimation of PQCs using Graph Neural Networks (GNNs). We demonstrate the predictive power of our GNN model with a dataset consisting of 25,000 samples from the noiseless IBM QASM Simulator and 12,000 samples from three distinct noisy quantum backends. The model accurately estimates expressibility, with root mean square errors (RMSE) of 0.05 and 0.06 for the noiseless and noisy backends, respectively. We compare our model’s predictions with reference circuits from Sim et al. and IBM Qiskit’s hardwareefficient ansatz sets to further evaluate our model’s performance. Our experimental evaluation in noiseless and noisy scenarios reveals a close alignment with ground truth expressibility values, highlighting the model’s efficacy. Moreover, our model exhibits promising extrapolation capabilities, predicting expressibility values with low RMSE for out-of-range qubit circuits trained solely on only up to 5-qubit circuit sets. This work thus provides a reliable means of efficiently evaluating the expressibility of diverse PQCs on noiseless simulators and hardware.

97 MATHEMATICS AND COMPUTING↗

Improved Sampling Algorithms in the Risk-Informed Safety Margin Characterization Toolkit

The RISMC approach is developing advanced set of methodologies and algorithms in order to perform Probabilistic Risk Analyses (PRAs). In contrast to classical PRA methods, which are based on Event-Tree and Fault-Tree methods, the RISMC approach largely employs system simulator codes applied to stochastic analysis tools. The basic idea is to randomly perturb (by employing sampling algorithms) timing and sequencing of events and internal parameters of the system codes (i.e., uncertain parameters) in order to estimate stochastic parameters such as core damage probability. This approach applied to complex systems such as nuclear power plants requires to perform a series of computationally expensive simulation runs given a large set of uncertain parameters. These types of analysis are affected by two issues. Firstly, the space of the possible solutions (a.k.a., the issue space or the response surface) can be sampled only very sparsely, and this precludes the ability to fully analyze the impact of uncertainties on the system dynamics. Secondly, large amounts of data are generated and tools to generate knowledge from such data sets are not yet available. This report focuses on the first issue and in particular employs novel methods that optimize the information generated by the sampling process by sampling unexplored and risk-significant regions of the issue space: adaptive (smart) sampling algorithms. They infer system response from surrogate models constructed from existing samples and predict the most relevant location of the next sample. It is therefore possible to understand features of the issue space with a small number of carefully selected samples. In this report, we will present how it is possible to perform adaptive sampling using the RISMC toolkit and highlight the advantages compared to more classical sampling approaches such Monte-Carlo. We will employ RAVEN to perform such statistical analyses using both analytical cases but also another RISMC code: RELAP-7.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

On the adaptivity and complexity embedded into differential evolution

This research deals with the comparison of the two modern approaches for evolutionary algorithms, which are the adaptivity and complex chaotic dynamics. This paper aims on the investigations on the chaos-driven Differential Evolution (DE) concept. This paper is aimed at the embedding of discrete dissipative chaotic systems in the form of chaotic pseudo random number generators for the DE and comparing the influence to the performance with the state of the art adaptive representative jDE. This research is focused mainly on the possible disadvantages and advantages of both compared approaches. Repeated simulations for Lozi map driving chaotic systems were performed on the simple benchmark functions set, which are more close to the real optimization problems. Obtained results are compared with the canonical not-chaotic and not adaptive DE. Results show that with used simple test functions, the performance of ChaosDE is better in the most cases than jDE and Canonical DE, furthermore due to the unique sequencing in CPRNG given by the hidden chaotic dynamics, thus better and faster selection of unique individuals from population, ChaosDE is faster.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Quantitative cone-beam CT imaging in radiation therapy using planning CT as a prior: First patient studies

Purpose: Quantitative cone-beam CT (CBCT) imaging is on increasing demand for high-performance image guided radiation therapy (IGRT). However, the current CBCT has poor image qualities mainly due to scatter contamination. Its current clinical application is therefore limited to patient setup based on only bony structures. To improve CBCT imaging for quantitative use, we recently proposed a correction method using planning CT (pCT) as the prior knowledge. Promising phantom results have been obtained on a tabletop CBCT system, using a correction scheme with rigid registration and without iterations. More challenges arise in clinical implementations of our method, especially because patients have large organ deformation in different scans. In this paper, we propose an improved framework to extend our method from bench to bedside by including several new components. Methods: The basic principle of our correction algorithm is to estimate the primary signals of CBCT projections via forward projection on the pCT image, and then to obtain the low-frequency errors in CBCT raw projections by subtracting the estimated primary signals and low-pass filtering. We improve the algorithm by using deformable registration to minimize the geometry difference between the pCT and the CBCT images. Since the registration performance relies on the accuracy of the CBCT image, we design an optional iterative scheme to update the CBCT image used in the registration. Large correction errors result from the mismatched objects in the pCT and the CBCT scans. Another optional step of gas pocket and couch matching is added into the framework to reduce these effects. Results: The proposed method is evaluated on four prostate patients, of which two cases are presented in detail to investigate the method performance for a large variety of patient geometry in clinical practice. The first patient has small anatomical changes from the planning to the treatment room. Our algorithm works well even without the optional iterations and the gas pocket and couch matching. The image correction on the second patient is more challenging due to the effects of gas pockets and attenuating couch. The improved framework with all new components is used to fully evaluate the correction performance. The enhanced image quality has been evaluated using mean CT number and spatial nonuniformity (SNU) error as well as contrast improvement factor. If the pCT image is considered as the ground truth, on the four patients, the overall mean CT number error is reduced from over 300 HU to below 16 HU in the selected regions of interest (ROIs), and the SNU error is suppressed from over 18% to below 2%. The average soft-tissue contrast is improved by an average factor of 2.6. Conclusions: We further improve our pCT-based CBCT correction algorithm for clinical use. Superior correction performance has been demonstrated on four patient studies. By providing quantitative CBCT images, our approach significantly increases the accuracy of advanced CBCT-based clinical applications for IGRT.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Pattern-matching indexing of Laue and monochromatic serial crystallography data for applications in materials science

Serial crystallography data can be challenging to index, as each frame is processed individually, rather than being processed as a whole like in conventional X-ray single-crystal crystallography. An algorithm has been developed to index still diffraction patterns arising from small-unit-cell samples. The algorithm is based on the matching of reciprocal-lattice vector pairs, as developed for Laue microdiffraction data indexing, combined with three-dimensional pattern matching using a nearest-neighbors approach. As a result, large-bandpass data (e.g. 5–24 keV energy range) and monochromatic data can be processed, the main requirement being prior knowledge of the unit cell. Furthermore, angles calculated in the vicinity of a few theoretical and experimental reciprocal-lattice vectors are compared, and only vectors with the highest number of common angles are selected as candidates to obtain the orientation matrix. Global matching on the entire pattern is then checked. Four indexing options are available, two for the ranking of the theoretical reciprocal-lattice vectors and two for reducing the number of possible candidates. Furthermore, the algorithm has been used to index several data sets collected under different experimental conditions on a series of model samples. Additionally, knowing the crystallographic structure of the sample and using this information to rank the theoretical reflections based on the structure factors helps the indexing of large-bandpass data for the largest-unit-cell samples. For small-bandpass data, shortening the candidate list to determine the orientation matrix should be based on matching pairs of reciprocal-lattice vectors instead of triplet matching.

36 MATERIALS SCIENCE↗

Risk-based Multiobjective Optimization Model for Bridge Maintenance Planning

Determining the optimal maintenance plan is essential for successful bridge management. The optimization objectives are defined in the forms of minimizing life-cycle cost and maximizing performance indicators. Previous bridge maintenance models assumed the process of bridge deterioration and the estimate of maintenance cost are deterministic, i.e., known with certainty. This assumption, however, is invalid especially with estimates over a long time horizon of bridge life. In this study, we consider the risks associated with bridge deterioration and maintenance cost in determining the optimal maintenance plan. The decisions variables include the strategic choice of essential maintenance (such as silane treatment and cathodic protection), and the intervals between periodic maintenance. A epsilon-constrained Particle Swarm Optimization algorithm is used to approximate the tradeoff between life-cycle cost and performance indicators. During stochastic search for optimal solutions, Monte-Carlo simulation is used to evaluate the impact of risks on the objective values, at an acceptance level of reliability. The proposed model can facilitate decision makers to select the compromised maintenance plan with a group of alternative choices, each of which leads to a different level of performance and life-cycle cost. A numerical example is used to illustrate the proposed model.

97 MATHEMATICS AND COMPUTING↗

SU-E-T-179: Exploring Appropriate Offset Values for Pencil Beam and Monte Carlo Dose Optimization in Lung Stereotactic Body Radiotherapy Encompassing the Effects of Respiration and Tumor Location

Purpose: Exploring appropriate offset values in dose optimization with pencil beam (PB) algorithm to minimize dosimetric differences with plans calculated with Monte Carlo (MC) for lung cancer treatment with Stereotactic Body Radiotherapy (SBRT). Methods: 20 cases of Non-Small Cell Lung Cancer, treated with gated full motion range SBRT were selected. According to the proximity of the Gross Tumor Volume (GTV) to the chest wall, two groups are defined: peripherally located when GTV merges with the chest wall for at least 50% of the lesion diameter, and centrally located when the GTV is surrounded by lung tissue. Treatment plans were created on 4D average intensity projection (AIP) CT set with Brainlab iPlanDose 4.1.2 planning system. The D97 of PTV was normalized to 50Gy using the fast PB and compared with MC. The optimized plan was then recomputed over each 4D respiratory phase, and compared with MC using the same plan MU's. Results: The mean difference in the PB and MC D97 of the ITV was 10.5% (±0.8%) of the prescription dose (50Gy). PB algorithm showed 2.3–2.4% less overestimation to the D97 of the ITV, when comparing to MC, in the maximum exhalation phase than in the maximal inhalation phase. Significantly smaller dose difference between PB and MC is also shown in plans for peripheral lesions (7.7 ± 0.7%) versus for central lesions (12.7±0.8%) (p< 0.01). Conclusion: The dosimetric differences between PB and MC can be reasonably predicted depending on the location of lesion in the lung, and may be used as offset value in dose optimization with PB. Since the maximal exhalation phase demonstrates less dose discrepancy between the two algorithms than that in maximal inhalation phase, caution is suggested when the latter is included as a major phase portion in the respiration gated lung SBRT.

60 APPLIED LIFE SCIENCES↗

Graphical User Interface Software for Gross Defect Detection at the Atucha-I Plant

At the Atucha-I pressurized heavy water reactor in Argentina, fuel assemblies in the spent fuel pools are stored by suspending them in two vertically stacked layers. This introduces the unique problem of verifying the presence of fuel in either layer without physically moving the fuel assemblies. Movement of fuel, especially from the lower layer, would involve a major effort on the part of the operator. Given that the facility uses both natural uranium and slightly enriched uranium at 0.85 w% {sup 235}U, and has been in operation since 1974, a wide range of burnups and cooling times can exist in any given pool. Additionally, while fuel assemblies are grouped together in a uniform fashion, the packing density from group to group can vary within a single pool. A tool called the Spent Fuel Neutron Counter (SFNC) was developed and successfully tested at the site to verify, in an in-situ condition, the presence of fuel up to burnups of 8,000 MWd/t. Since the neutron source term becomes a nonlinear function of burnup beyond this burnup, a new algorithm was developed to predict expected response from the SFNC at measurement locations covering the entire range of burnups, cooling times, and initial enrichments. With the aid of a static database of parameters including intrinsic sources and energy group-wise detector response functions, as well as explicit spent fuel information including burnups, cooling times, enrichment types, and spacing between fuel assemblies, an expected response for any given location can be calculated by summing the contributions from the relevant neighboring fuel assemblies. Thus, the new algorithm maps the expected responses across the various pools providing inspectors with a visual aid in verifying the presence of the spent fuel assemblies. This algorithm has been fully integrated into a standalone application built in LabVIEW. The GUI uses a step-by-step approach to allow the end-user to first calibrate the predicted database against a set of measurements with SFNC at selected locations where spent fuel is present. Once the database is calibrated it can be used to detect gross defects by comparing the measured signal to the one predicted by the database with differences beyond a set tolerance indicating missing fuel.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

THE CHOICE OF OPTIMAL STRUCTURE OF ARTIFICIAL NEURAL NETWORK CLASSIFIER INTENDED FOR CLASSIFICATION OF WELDING FLAWS

Nondestructive testing and evaluation are under continuous development. Currently researches are concentrated on three main topics: advancement of existing methods, introduction of novel methods and development of artificial intelligent systems for automatic defect recognition (ADR). Automatic defect classification algorithm comprises of two main tasks: creating a defect database and preparing a defect classifier. Here, the database was built using defect features that describe all geometrical and texture properties of the defect. Almost twenty carefully selected features calculated for flaws extracted from real radiograms were used. The radiograms were obtained from shipbuilding industry and they were verified by qualified operator. Two weld defect's classifiers based on artificial neural networks were proposed and compared. First model consisted of one neural network model, where each output neuron corresponded to different defect group. The second model contained five neural networks. Each neural network had one neuron on output and was responsible for detection of defects from one group. In order to evaluate the effectiveness of the neural networks classifiers, the mean square errors were calculated for test radiograms and compared.

42 ENGINEERING↗

WE-G-204-07: Automated Characterization of Perceptual Quality of Clinical Chest Radiographs: Improvements in Lung, Spine, and Hardware Detection

Purpose: To develop and validate more robust methods for automated lung, spine, and hardware detection in AP/PA chest images. This work is part of a continuing effort to automatically characterize the perceptual image quality of clinical radiographs. [Y. Lin et al. Med. Phys. 39, 7019–7031 (2012)] Methods: Our previous implementation of lung/spine identification was applicable to only one vendor. A more generalized routine was devised based on three primary components: lung boundary detection, fuzzy c-means (FCM) clustering, and a clinically-derived lung pixel probability map. Boundary detection was used to constrain the lung segmentations. FCM clustering produced grayscale- and neighborhood-based pixel classification probabilities which are weighted by the clinically-derived probability maps to generate a final lung segmentation. Lung centerlines were set along the left-right lung midpoints. Spine centerlines were estimated as a weighted average of body contour, lateral lung contour, and intensity-based centerline estimates. Centerline estimation was tested on 900 clinical AP/PA chest radiographs which included inpatient/outpatient, upright/bedside, men/women, and adult/pediatric images from multiple imaging systems. Our previous implementation further did not account for the presence of medical hardware (pacemakers, wires, implants, staples, stents, etc.) potentially biasing image quality analysis. A hardware detection algorithm was developed using a gradient-based thresholding method. The training and testing paradigm used a set of 48 images from which 1920 51×51 pixel{sup 2} ROIs with and 1920 ROIs without hardware were manually selected. Results: Acceptable lung centerlines were generated in 98.7% of radiographs while spine centerlines were acceptable in 99.1% of radiographs. Following threshold optimization, the hardware detection software yielded average true positive and true negative rates of 92.7% and 96.9%, respectively. Conclusion: Updated segmentation and centerline estimation methods in addition to new gradient-based hardware detection software provide improved data integrity control and error-checking for automated clinical chest image quality characterization across multiple radiography systems.

60 APPLIED LIFE SCIENCES↗

SDSS-V Algorithms: Fast, Collision-free Trajectory Planning for Heavily Overlapping Robotic Fiber Positioners

Robotic fiber positioner (RFP) arrays are becoming heavily adopted in wide-field massively multiplexed spectroscopic survey instruments. RFP arrays decrease nightly operational overheads through rapid reconfiguration between fields and exposures. In comparison to similar instruments, SDSS-V has selected a very dense RFP packing scheme where any point in a field is typically accessible to three or more robots. This design provides flexibility in target assignment. However, the task of collisionless trajectory planning is especially challenging. We present two multiagent distributed control strategies that are highly efficient and computationally inexpensive for determining collision-free paths for RFPs in heavily overlapping workspaces. We demonstrate that a reconfiguration path between two arbitrary robot configurations can be efficiently found if a “folded” state, in which all robot arms are retracted and aligned in a lattice-like orientation, is inserted between the initial and final states. Although developed for SDSS-V, the approach we describe is generic and thus applicable to a wide range of RFP designs and layouts. Robotic fiber positioner technology continues to advance rapidly, and in the near future ultra-densely packed RFP designs may be feasible. Our algorithms are especially capable in routing paths in very crowded environments, where we see efficient results even in regimes significantly more crowded than the SDSS-V RFP design.

42 ENGINEERING↗