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 919 records · Page 51

Beyond 100 Gb/s: Capacity, Flexibility, and Network Optimization

Here, we discuss building blocks that enable the exploitation of optical capacities beyond 100 Gb/s. Optical networks will benefit from more flexibility and agility in their network elements, especially from coherent transceivers. To achieve capacities of 400 Gb/s and more, coherent transceivers will operate at higher symbol rates. This will be made possible with higher bandwidth components using new electro-optic technologies implemented with indium phosphide and silicon photonics. Digital signal processing will benefit from new algorithms. Multi-dimensional modulation, of which some formats are already in existence in current flexible coherent transceivers, will provide improved tolerance to noise and fiber nonlinearities. Constellation shaping will further improve these tolerances while allowing a finer granularity in the selection of capacity. Frequency-division multiplexing will also provide improved tolerance to the nonlinear characteristics of fibers. Algorithms with reduced computation complexity will allow the implementation, at speeds, of direct pre-compensation of nonlinear propagation effects. Advancement in forward error correction will shrink the performance gap with Shannon's limit. At the network control and management level, new tools are being developed to achieve a more efficient utilization of networks. This will also allow for network virtualization, orchestration, and management. Lastly, FlexEthernet and FlexOTN will be put in place to allow network operators to optimize capacity in their optical transport networks without manual changes to the client hardware.

47 OTHER INSTRUMENTATION↗

A Parallel Ghosting Algorithm for The Flexible Distributed Mesh Database

Critical to the scalability of parallel adaptive simulations are parallel control functions including load balancing, reduced inter-process communication and optimal data decomposition. In distributed meshes, many mesh-based applications frequently access neighborhood information for computational purposes which must be transmitted efficiently to avoid parallel performance degradation when the neighbors are on different processors. This article presents a parallel algorithm of creating and deleting data copies, referred to as ghost copies, which localize neighborhood data for computation purposes while minimizing inter-process communication. The key characteristics of the algorithm are: (1) It can create ghost copies of any permissible topological order in a 1D, 2D or 3D mesh based on selected adjacencies. (2) It exploits neighborhood communication patterns during the ghost creation process thus eliminating all-to-all communication. (3) For applications that need neighbors of neighbors, the algorithm can create n number of ghost layers up to a point where the whole partitioned mesh can be ghosted. Strong and weak scaling results are presented for the IBM BG/P and Cray XE6 architectures up to a core count of 32,768 processors. The algorithm also leads to scalable results when used in a parallel super-convergent patch recovery error estimator, an application that frequently accesses neighborhood data to carry out computation.

Mubarak, Misbah↗

High-dimensional multivariate autoregressive model estimation of human electrophysiological data using fMRI priors

Multivariate autoregressive (MVAR) model estimation enables assessment of causal interactions in brain networks. However, accurately estimating MVAR models for high-dimensional electrophysiological recordings is challenging due to the extensive data requirements. Hence, the applicability of MVAR models for study of brain behavior over hundreds of recording sites has been very limited. Prior work has focused on different strategies for selecting a subset of important MVAR coefficients in the model to reduce the data requirements of conventional least-squares estimation algorithms. Here we propose incorporating prior information, such as resting state functional connectivity derived from functional magnetic resonance imaging, into MVAR model estimation using a weighted group least absolute shrinkage and selection operator (LASSO) regularization strategy. The proposed approach is shown to reduce data requirements by a factor of two relative to the recently proposed group LASSO method of Endemann et al (Neuroimage 254:119057, 2022) while resulting in models that are both more parsimonious and more accurate. The effectiveness of the method is demonstrated using simulation studies of physiologically realistic MVAR models derived from intracranial electroencephalography (iEEG) data. The robustness of the approach to deviations between the conditions under which the prior information and iEEG data is obtained is illustrated using models from data collected in different sleep stages. This approach allows accurate effective connectivity analyses over short time scales, facilitating investigations of causal interactions in the brain underlying perception and cognition during rapid transitions in behavioral state.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

SU-F-T-664: The Efficacy of Gold Nanoparticles as Contrast Agents in Mice

Purpose: Micro-Computed Tomography (micro-CT) has been widely used as a non-invasive, high-resolution imaging modality in preclinical research. However, tumors cannot be well distinguished, since their density are similar to those of surrounding tissues, and the tumors’ natural contrast is very low. The benefits of using Gold Nanoparticles (AuNPs) as a promising high atomic weight contrast agent have been published in recent years. The aim of this study is to investigate the efficacy of AuNPs as contrast agents using different energy x-rays. Methods: The left flank of an immune-compromised athymic nude mouse was implanted with subcutaneous xenograft model of human lung cancer line, A549 cells (from ATCC). After 14 days, this mouse was imaged with dual energy cone-beam micro-CT. The selected energies were 45 kVp and 65 kVp. 10µg AuNPs (200 µg/ml concentration) approximately 12 nm in size were injected subcutaneously into the tumor. The mouse was imaged 0, 3 and 24 hours post-injection. During scanning, this mouse was anesthetized. All projection raw data have been optimized and then images were reconstructed with the FDK Algorithm. Results: Based on images, at 0 hour, AuNPs provided obvious contrast no matter which energy selected, 45 kVp or 65 kVp; and using 45 kVp X-ray, AuNps showed greater contrast. After 3 hours or evenand longer, AuNPs distributed throughout the whole body of mouse, and they were not shown clearly shown in the images. Conclusion: In this study, we investigated the efficacy of AuNPs as image contrast agents at different energies with dual-energy micro-CT, using 200µg/mL of AuNPs. Sufficiently high concentrations of AuNPs are needed to be able to track intratumoral distribution. Images showed good contrast immediately following the administration of the agent but results were poor after 3 hours.

60 APPLIED LIFE SCIENCES↗

SU-E-J-87: Lung Deformable Image Registration Using Surface Mesh Deformation for Dose Distribution Combination

Purpose: To allow a reliable deformable image registration (DIR) method for dose calculation in radiation therapy. This work proposes a performance assessment of a morphological segmentation algorithm that generates a deformation field from lung surface displacements with 4DCT datasets. Methods: From the 4DCT scans of 15 selected patients, the deep exhale phase of the breathing cycle is identified as the reference scan. Varian TPS EclipseTM is used to draw lung contours, which are given as input to the morphological segmentation algorithm. Voxelized contours are smoothed by a Gaussian filter and then transformed into a surface mesh representation. Such mesh is adapted by rigid and elastic deformations to match each subsequent lung volumes. The segmentation efficiency is assessed by comparing the segmented lung contour and the TPS contour considering two volume metrics, defined as Volumetric Overlap Error (VOE) [%] and Relative Volume Difference (RVD) [%] and three surface metrics, defined as Average Symmetric Surface Distance (ASSD) [mm], Root Mean Square Symmetric Surface Distance (RMSSD) [mm] and Maximum Symmetric Surface Distance (MSSD) [mm]. Then, the surface deformation between two breathing phases is determined by the displacement of corresponding vertices in each deformed surface. The lung surface deformation is linearly propagated in the lung volume to generate 3D deformation fields for each breathing phase. Results: The metrics were averaged over the 15 patients and calculated with the same segmentation parameters. The volume metrics obtained are a VOE of 5.2% and a RVD of 2.6%. The surface metrics computed are an ASSD of 0.5 mm, a RMSSD of 0.8 mm and a MSSD of 6.9 mm. Conclusion: This study shows that the morphological segmentation algorithm can provide an automatic method to capture an organ motion from 4DCT scans and translate it into a volume deformation grid needed by DIR method for dose distribution combination.

60 APPLIED LIFE SCIENCES↗

Completeness map evaluation demonstrated with candidate next-generation cardiac CT architectures

Purpose: In this report, the authors introduce the general concept of the completeness map, as a means to evaluate the completeness of data acquired by a given CT system design (architecture and scan mode). They illustrate the utility of completeness map by applying the completeness map concept to a number of candidate CT system designs, as part of a study to advance the state-of-the-art in cardiac CT. Methods: In order to optimally reconstruct a point within a volume of interest (VOI), the Radon transform on all possible planes through that point should be measured. The authors quantified the extent to which this ideal condition is satisfied for the entire image volume. They first determined a Radon completeness number for each point in the VOI, as the percentage of possible planes that is actually measured. A completeness map is then defined as a 3D matrix of the completeness numbers for the entire VOI. The authors proposed algorithms to analyze the projection datasets in Radon space and compute the completeness number for a fixed point and apply these algorithms to various architectures and scan modes that they are evaluating. In this report, the authors consider four selected candidate architectures, operating with different scan modes, for a total of five system design alternatives. Each of these alternatives is evaluated using completeness map. Results: If the detector size and cone angle are large enough to cover the entire cardiac VOI, a single-source circular scan can have {>=}99% completeness over the entire VOI. However, only the central z-slice can be exactly reconstructed, which corresponds to 100% completeness. For a typical single-source architecture, if the detector is limited to an axial dimension of 40 mm, a helical scan needs about five rotations to form an exact reconstruction region covering the cardiac VOI, while a triple-source helical scan only requires two rotations, leading to a 2.5x improvement in temporal resolution. If the source and detector of an inverse-geometry (IGCT) system have the same axial extent, and the spacing of source points in the axial and transaxial directions is sufficiently small, the IGCT can also form an exact reconstruction region for the cardiac VOI. If the VOI can be covered by the x-ray beam in any view, a composite-circling scan can generate an exact reconstruction region covering the VOI. Conclusions: The completeness map evaluation provides useful information for selecting the next-generation cardiac CT system design. The proposed completeness map method provides a practical tool for analyzing complex scanning trajectories, where the theoretical image quality for some complex system designs is impossible to predict, without yet-undeveloped reconstruction algorithms.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

MaxEnt-Burg Application to Muon-Spin Resonance

Muon-Spin Rotation ({mu}SR) is an experimental technique similar to Nuclear Magnetic Resonance (NMR). {mu}SR data are recorded as a set of time-series histograms of muon-decay events. Both {mu}SR and NMR regularly produce signals that are overlapping, weak and/or broadened in frequency space. These {mu}SR histograms are usually analyzed by curve fitting and Fourier transformations. However, several NMR and {mu}SR groups have developed Maximum Entropy (MaxEnt, ME) applications to improve the sensitivity of the time series analysis. We have focused on the application of the ME-Burg algorithm. The optimal number of autoregression coefficients is between N/3 and N/5 where N is the total number of data points. Selected results for simulated data and real data ME-{mu}SR applications are reported. Most of our {mu}SR work is for cuprate superconductor studies. The strength of the ME-Burg algorithm is fully used, as there is a clear relationship between the muon-spin signal S(i) at any time i and the signals S(i-k) at earlier times. ME-Burg has the major advantage of producing in the frequency transform only structure for which sufficient statistical evidence is present.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Optimal artificial neural network architecture selection for performance prediction of compact heat exchanger with the EBaLM-OTR technique

Artificial Neural Networks (ANN) have been used in the past to predict the performance of printed circuit heat exchangers (PCHE) with satisfactory accuracy. Typically published literature has focused on optimizing ANN using a training dataset to train the network and a testing dataset to evaluate it. Although this may produce outputs that agree with experimental results, there is a risk of over-training or overlearning the network rather than generalizing it, which should be the ultimate goal. An over-trained network is able to produce good results with the training dataset but fails when new datasets with subtle changes are introduced. In this paper we present EBaLM-OTR (error back propagation and Levenberg-Marquardt algorithms for over training resilience) technique, which is based on a previously discussed method of selecting neural network architecture that uses a separate validation set to evaluate different network architectures based on mean square error (MSE), and standard deviation of MSE. The method uses k-fold cross validation. Therefore in order to select the optimal architecture for the problem, the dataset is divided into three parts which are used to train, validate and test each network architecture. Then each architecture is evaluated according to their generalization capability and capability to conform to original data. The method proved to be a comprehensive tool in identifying the weaknesses and advantages of different network architectures. The method also highlighted the fact that the architecture with the lowest training error is not always the most generalized and therefore not the optimal. Using the method the testing error achieved was in the order of magnitude of within 10{sup -5} - 10{sup -3}. It was also show that the absolute error achieved by EBaLM-OTR was an order of magnitude better than the lowest error achieved by EBaLM-THP.

99 GENERAL AND MISCELLANEOUS↗

Network Algorithms for Detection of Radiation Sources

In support of national defense, Domestic Nuclear Detection Office’s (DNDO) Intelligent Radiation Sensor Systems (IRSS) program supported the development of networks of radiation counters for detecting, localizing and identifying low-level, hazardous radiation sources. Industry teams developed the first generation of such networks with tens of counters, and demonstrated several of their capabilities in indoor and outdoor characterization tests. Subsequently, these test measurements have been used in algorithm replays using various sub-networks of counters. Test measurements combined with algorithm outputs are used to extract Key Measurements and Benchmark (KMB) datasets. We present two selective analyses of these datasets: (a) a notional border monitoring scenario that highlights the benefits of a network of counters compared to individual detectors, and (b) new insights into the Sequential Probability Ratio Test (SPRT) detection method, which lead to its adaptations for improved detection. Using KMB datasets from an outdoor test, we construct a notional border monitoring scenario, wherein twelve 2”*2” NaI detectors are deployed on the periphery of 21*21meter square region. A Cs-137 (175 uCi) source is moved across this region, starting several meters from outside and finally moving away. The measurements from individual counters and the network were processed using replays of a particle filter algorithm developed under IRSS program. The algorithm outputs from KMB datasets clearly illustrate the benefits of combining measurements from all networked counters: the source was detected before it entered the region, during its trajectory inside, and until it moved several meters away. When individual counters are used for detection, the source was detected for much shorter durations, and sometimes was missed in the interior region. The application of SPRT for detecting radiation sources requires choosing the detection threshold, which in turn requires a source strength estimate, typically specified as a multiplier of the background radiation level. A judicious selection of this source multiplier is essential to achieve optimal detection probability at a specified false alarm rate. Typically, this threshold is chosen from the Receiver Operating Characteristic (ROC) by varying the source multiplier estimate. ROC is expected to have a monotonically increasing profile between the detection probability and false alarm rate. We derived ROCs for multiple indoor tests using KMB datasets, which revealed an unexpected loop shape: as the multiplier increases, detection probability and false alarm rate both increase until a limit, and then both contract. Consequently, two detection probabilities correspond to the same false alarm rate, and the higher is achieved at a lower multiplier, which is the desired operating point. Using the Chebyshev’s inequality we analytically confirm this shape. Then, we present two improved network-SPRT methods by (a) using the threshold off-set as a weighting factor for the binary decisions from individual detectors in a weighted majority voting fusion rule, and (b) applying a composite SPRT derived using measurements from all counters.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Storage ring nonlinear dynamics optimization with multi-objective multi-generation Gaussian process optimizer

Nonlinear beam dynamics optimization is essential in a low emittance storage ring design. Multi-objective optimization algorithms are needed in order to simultaneously optimize the dynamic aperture and the momentum aperture. In this study we demonstrate the application of a highly efficient stochastic optimization algorithm, the multi-generation Gaussian process optimizer (MG-GPO), to storage ring nonlinear dynamics optimization by successfully applying the method to the SPEAR3 upgrade lattice. It is shown that the new method, owing to its capability of selecting high rank candidates from a large number of trial solutions, converges significantly faster than the commonly used traditional algorithms, multi-objective genetic algorithms (MOGA) and particle swarm optimization (PSO).

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Multilevel Robustness for 2D Vector Field Feature Tracking, Selection and Comparison

Abstract Critical point tracking is a core topic in scientific visualization for understanding the dynamic behaviour of time‐varying vector field data. The topological notion of robustness has been introduced recently to quantify the structural stability of critical points, that is, the robustness of a critical point is the minimum amount of perturbation to the vector field necessary to cancel it. A theoretical basis has been established previously that relates critical point tracking with the notion of robustness, in particular, critical points could be tracked based on their closeness in stability, measured by robustness, instead of just distance proximity within the domain. However, in practice, the computation of classic robustness may produce artifacts when a critical point is close to the boundary of the domain; thus, we do not have a complete picture of the vector field behaviour within its local neighbourhood. To alleviate these issues, we introduce a multilevel robustness framework for the study of 2D time‐varying vector fields. We compute the robustness of critical points across varying neighbourhoods to capture the multiscale nature of the data and to mitigate the boundary effect suffered by the classic robustness computation. We demonstrate via experiments that such a new notion of robustness can be combined seamlessly with existing feature tracking algorithms to improve the visual interpretability of vector fields in terms of feature tracking, selection and comparison for large‐scale scientific simulations. We observe, for the first time, that the minimum multilevel robustness is highly correlated with physical quantities used by domain scientists in studying a real‐world tropical cyclone dataset. Such an observation helps to increase the physical interpretability of robustness.

97 MATHEMATICS AND COMPUTING↗

Security-Oriented and Load-Balancing Wireless Data Routing Game in the Integration of Advanced Metering Infrastructure Network in Smart Grid

Ensuring flexible and reliable data routing is indispensable for the integration of Advanced Metering Infrastructure (AMI) networks, we propose a secure-oriented and load-balancing wireless data routing scheme. A novel utility function is designed based on security routing scheme. Then, we model the interactive security-oriented routing strategy among meter data concentrators or smart grid meters as a mixed-strategy network formation game. Finally, such problem results in a stable probabilistic routing scheme with proposed distributed learning algorithm. One contributions is that we studied that different types of applications affect the routing selection strategy and the strategy tendency. Another contributions is that the chosen strategy of our mixed routing can adaptively to converge to a new mixed strategy Nash equilibrium (MSNE) during the learning process in the smart grid.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Retrieving and Ranking Unannotated Images through Collaboratively Mining Online Search Results

We present a new image search and ranking algorithm for retrieving unannotated images by collaboratively mining online search results, which consist of online image and text search results. The online image search results are leveraged as reference examples to perform content-based image search over unannotated images. The online text search results are utilized to estimate individual reference images relevance to the search query as not all the online image search results are closely related to the query. Overall, the key contribution of our method lies in its capability to deal with unreliable online image search results through jointly mining visual and textual aspects of online search results. Through such collaborative mining, our algorithm infers the relevance of an online search result image to a text query. Once we estimate a query relevance score for each online image search result, we can selectively use query specific online search result images as reference examples for retrieving and ranking unannotated images. To explore the performance of our algorithm, we tested our algorithm both on the standard public image datasets and several modest sized personal photo collections. We also compared the performance of our method with that of two peer methods. The results are very positive, indicating that our algorithm is superior to existing content-based image search algorithms for retrieving and ranking unannotated images. Overall, the main advantage of our algorithm comes from its collaborative mining over online search results both in the visual and textual domains.

99 GENERAL AND MISCELLANEOUS↗

Comparison of time-frequency-analysis techniques applied in building energy data noise cancellation for building load forecasting: A real-building case study

Time-frequency analysis that disaggregates a signal in both time and frequency domain is an important supporting technique for building energy analysis such as noise cancellation in data-driven building load forecasting. There is a gap in the literature related to comparing various time–frequency-analysis techniques, especially discrete wavelet transform (DWT) and empirical mode decomposition (EMD), to guide the selection and tuning of time–frequency-analysis techniques in data-driven building load forecasting. This article provides a framework to conduct a comprehensive comparison among thirteen DWT/EMD techniques with various parameters in a load forecasting modeling task. A real campus building is used as a case study for illustration. The DWT and EMD techniques are also compared under various data-driven modeling algorithms for building load forecasting. The results in the case study show that the load forecasting models trained with noise-cancelled energy data have increased their accuracy to 9.6% on average tested under unseen data. This study also shows that the effectiveness of DWT/EMD techniques depends on the data-driven algorithms used for load forecasting modeling and the training data. Hence, DWT/EMD-based noise cancellation needs customized selection and tuning to optimize their performance for data-driven building load forecasting modeling.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A Pareto Algorithm for Efficient De Novo Design of Multi-functional Molecules

Here, we have introduced a Pareto sorting algorithm into Synopsis, a de novo design program that generates synthesizable molecules with desirable properties. We give a detailed description of the algorithm and illustrate its working in 2 different de novo design settings: the design of putative dual and selective FGFR and VEGFR inhibitors, and the successful design of organic structure determining agents (OSDAs) for the synthesis of zeolites. We show that the introduction of Pareto sorting not only enables the simultaneous optimization of multiple properties but also greatly improves the performance of the algorithm to generate molecules with hard-to-meet constraints. This in turn allows us to suggest approaches to address the problem of false positive hits in de novo structure based drug design by introducing structural and physicochemical constraints in the designed molecules, and by forcing essential interactions between these molecules and their target receptor.

60 APPLIED LIFE SCIENCES↗

ROBUST ONLINE MONITORING FOR CALIBRATION ASSESSMENT OF TRANSMITTERS AND INSTRUMENTATION

Robust online monitoring (OLM) technologies are expected to enable the extension or elimination of periodic sensor calibration intervals in operating and new reactors. Specifically, the next generation of OLM technology is expected to include newly developed advanced algorithms that improve monitoring of sensor/system performance and enable the use of plant data to derive information that currently cannot be measured. These advances in OLM technologies will improve the safety and reliability of current and planned nuclear power systems through improved accuracy and increased reliability of sensors used to monitor key parameters. In this paper, we discuss an overview of research being performed within the Nuclear Energy Enabling Technologies (NEET)/Advanced Sensors and Instrumentation (ASI) program, for the development of OLM algorithms to use sensor outputs and, in combination with other available information, 1) determine whether one or more sensors are out of calibration or failing and 2) replace a failing sensor with reliable, accurate sensor outputs. Algorithm development is focused on the following OLM functions: • Signal validation – fault detection and selection of acceptance criteria • Virtual sensing – signal value prediction and acceptance criteria • Response-time assessment – fault detection and acceptance criteria selection A GP-based uncertainty quantification (UQ) method previously developed for UQ in OLM, was adapted for use in sensor-fault detection and virtual sensing. For signal validation, the various components to the OLM residual (which is computed using an AAKR model) were explicitly defined and modeled using a GP. Evaluation was conducted using flow loop data from multiple sources. Results using experimental data from laboratory-scale flow loops indicate that the approach, while capable of detecting sensor drift, may be incapable of discriminating between sensor drift and model inadequacy. This may be due to a simplification applied in the initial modeling, where the sensor degradation is assumed to be stationary. In the case of virtual sensors, the GP model was used in a predictive mode to estimate the correct sensor reading for sensors that may have failed. Results have indicated the viability of using this approach for virtual sensing. However, the GP model has proven to be computationally expensive, and so alternative algorithms for virtual sensing are being evaluated. Finally, automated approaches to performing noise analysis for extracting sensor response time were developed. Evaluation of this technique using laboratory-scale data indicates that it compares well with manual techniques previously used for noise analysis. Moreover, the automated and manual approaches for noise analysis also compare well with the current “gold standard”, hydraulic ramp testing, for response time monitoring. Ongoing research in this project is focused on further evaluation of the algorithms, optimization for accuracy and computational efficiency, and integration into a suite of tools for robust OLM that are applicable to monitoring sensor calibration state in nuclear power plants.

calibration interval extension↗

Evaluation of automated stability testing in machining through closed-loop control and Bayesian machine learning

Here, this paper describes a system for automated identification of the optimal stable cutting parameters in milling through Bayesian machine learning and closed-loop control. The closed-loop control system consists of a process monitoring architecture, an analysis framework, and a feedback mechanism. The analysis framework consists of a Bayesian machine learning algorithm that learns a stability map given test results. The learned stability map is used to select parameters for stability testing using an expected improvement in the material removal rate criterion. The test parameters are communicated to the machine controller to complete the test cut through a feedback mechanism. The test cuts were monitored using an audio signal; the stability of the test cut was determined by analyzing the frequency content of the audio signal. The test result was fed back to the Bayesian learning algorithm to complete the loop. Experimental results demonstrate that the system can identify the optimal stable parameters without information about the cutting force model or the structural dynamics. The system provides a low-cost method for optimal stable parameter identification in an industrial environment.

Chatter↗

Using Natural Language Processing of Free-Text Radiology Reports to Identify Type 1 Modic Endplate Changes

Electronic medical record (EMR) systems provide easy access to radiology reports and offer great potential to support quality improvement efforts and clinical research. Harnessing the full potential of the EMR requires scalable approaches such as natural language processing (NLP) to convert text into variables used for evaluation or analysis. Our goal was to determine the feasibility of using NLP to identify patients with Type 1 Modic endplate changes using clinical reports of magnetic resonance (MR) imaging examinations of the spine. Identifying patients with Type 1 Modic change who may be eligible for clinical trials is important as these findings may be important targets for intervention. Four annotators identified all reports that contained Type 1 Modic change, using N = 458 randomly selected lumbar spine MR reports. We then implemented a rule-based NLP algorithm in Java using regular expressions. The prevalence of Type 1 Modic change in the annotated dataset was 10%. Results were recall (sensitivity) 35/50 = 0.70 (95% confidence interval (C.I.) 0.52–0.82), specificity 404/408 = 0.99 (0.97–1.0), precision (positive predictive value) 35/39 = 0.90 (0.75–0.97), negative predictive value 404/419 = 0.96 (0.94–0.98), and F1-score 0.79 (0.43–1.0). Our evaluation shows the efficacy of rule-based NLP approach for identifying patients with Type 1 Modic change if the emphasis is on identifying only relevant cases with low concern regarding false negatives. As expected, our results show that specificity is higher than recall. This is due to the inherent difficulty of eliciting all possible keywords given the enormous variability of lumbar spine reporting, which decreases recall, while availability of good negation algorithms improves specificity.

62 RADIOLOGY AND NUCLEAR MEDICINE↗