Search NASA⌕ Search

SEARCH · Search NASA

Results for “LABELLING”

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 937 records · Page 52

A Novel Data Segmentation Method for Data-driven Phase Identification

This paper presents a smart meter phase identification algorithm for two cases: meter-phase-label-known and meter-phase-label-unknown. To improve the identification accuracy, a data segmentation method is proposed to exclude data segments that are collected when the voltage correlation between smart meters on the same phase is weakened. Then, using the selected data segments, a hierarchical clustering method is used to calculate the correlation distances and cluster the smart meters. If the phase labels are unknown, a Connected-Triple-based Similarity (CTS) method is adapted to further improve the phase identification accuracy of the ensemble clustering method. The methods are developed and tested on both synthetic and real feeder data sets. Here, simulation results show that the proposed phase identification algorithm outperforms the state-of-the-art methods in both accuracy and robustness.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Associative nitrogen fixation linked with three perennial bioenergy grasses in field and greenhouse experiments

Abstract Associative nitrogen (N 2 )‐fixation (ANF) by bacteria in the root‐zone of perennial bioenergy grasses has the potential to replace or supplement N fertilizer and support sustainable production of biomass, but its application in marginal ecosystems requires further evaluation. In this study, we first combined both greenhouse and field experiments, to explore the N 2 fixation effects of three temperate feedstocks Miscanthus × giganteus (giant miscanthus, Freedom), Panicum virgatum (switchgrass, Alamo), and Saccharum sp. (energycane, Ho 02‐147). In field studies across three growing seasons, plant and soil pools of candidate feedstocks were partially composed of N derived from the atmosphere (Ndfa). Energycane, giant miscanthus, and switchgrass were estimated to derive >30%, %Ndfa. Greenhouse studies were also performed to trace isotopically labeled 15 N 2 into plant biomass and soil pools. Evidence for Ndfa was detected in all three feedstock grasses (using reference 15 N of soil, chicory, and sorghum, δ 15 N~+7.0). Isotopically labeled 15 N 2 was traced into biomass (during grass elongation stage) and soil pools. Extrapolation of rates during the 24 hr labeling period to 50 days estimated 30%–55% of plant Ndfa, with the greatest Ndfa for energycane. The findings of the field natural abundance and greenhouse 15 N 2 feeding experiments provided complementary evidence that perennial bioenergy grasses have the potential to support relatively high rates of ANF, and accumulate diazotroph‐derived N into biomass when grown on non‐fertilized soil.

09 BIOMASS FUELS↗

Factor analysis in automated face detection: gender, occlusion, eyewear, brightness, contrast, and focus measure

Computer-based facial recognition algorithms exploit the unique characteristics of faces in images. However, in non-cooperative situations these unique characteristics are often disturbed. In this study, we examine the effect of six different factors on face detection in an unconstrained imaging environment: image brightness, image contrast, focus measure, eyewear, gender, and occlusion. The aim of this study is twofold: first, to quantify detection rates of conventional Haar cascade algorithms across these six factors; and second, to propose methods for automatically labeling datasets whose size prohibits manual labeling. First, we manually classify a uniquely challenging dataset comprising 9,688 images of passengers in vehicles acquired from a roadside camera system. Next, we quantify how each of the aforementioned factors affect face detection on this dataset. Of the six factors studied, occlusion had the most significant impact, resulting in a 54% decrease in detection rate between unoccluded and severely occluded faces in our unique dataset. Finally, we provide a methodology for data analytics of large datasets where manual labeling of the whole dataset is not possible.

Jafek, Benjamin↗

Uncluttered single-image visualization of the abdominal aortic vessel tree: Method and evaluation

Purpose: The authors develop a method to visualize the abdominal aorta and its branches, obtained by CT or MR angiography, in a single 2D stylistic image without overlap among branches. Methods: The abdominal aortic vasculature is modeled as an articulated object whose underlying topology is a rooted tree. The inputs to the algorithm are the 3D centerlines of the abdominal aorta, its branches, and their associated diameter information. The visualization problem is formulated as an optimization problem that finds a spatial configuration of the bounding boxes of the centerlines most similar to the projection of the input into a given viewing direction (e.g., anteroposterior), while not introducing intersections among the boxes. The optimization algorithm minimizes a score function regarding the overlap of the bounding boxes and the deviation from the input. The output of the algorithm is used to produce a stylistic visualization, made of the 2D centerlines modulated by the associated diameter information, on a plane. The authors performed a preliminary evaluation by asking three radiologists to label 366 arterial branches from the 30 visualizations of five cases produced by the method. Each of the five patients was presented in six different variant images, selected from ten variants with the three lowest and three highest scores. For each label, they assigned confidence and distortion ratings (low/medium/high). They studied the association between the quantitative metrics measured from the visualization and the subjective ratings by the radiologists. Results: All resulting visualizations were free from branch overlaps. Labeling accuracies of the three readers were 93.4%, 94.5%, and 95.4%, respectively. For the total of 1098 samples, the distortion ratings were low: 77.39%, medium: 10.48%, and high: 12.12%. The confidence ratings were low: 5.56%, medium: 16.50%, and high: 77.94%. The association study shows that the proposed quantitative metrics can predict a reader's subjective ratings and suggests that the visualization with the lowest score should be selected for readers. Conclusions: The method for eliminating misleading false intersections in 2D projections of the abdominal aortic tree conserves the overall shape and does not diminish accurate identifiability of the branches.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Automatic segmentation of head and neck CT images for radiotherapy treatment planning using multiple atlases, statistical appearance models, and geodesic active contours

Purpose: Accurate delineation of organs at risk (OARs) is a precondition for intensity modulated radiation therapy. However, manual delineation of OARs is time consuming and prone to high interobserver variability. Because of image artifacts and low image contrast between different structures, however, the number of available approaches for autosegmentation of structures in the head-neck area is still rather low. In this project, a new approach for automated segmentation of head-neck CT images that combine the robustness of multiatlas-based segmentation with the flexibility of geodesic active contours and the prior knowledge provided by statistical appearance models is presented. Methods: The presented approach is using an atlas-based segmentation approach in combination with label fusion in order to initialize a segmentation pipeline that is based on using statistical appearance models and geodesic active contours. An anatomically correct approximation of the segmentation result provided by atlas-based segmentation acts as a starting point for an iterative refinement of this approximation. The final segmentation result is based on using model to image registration and geodesic active contours, which are mutually influencing each other. Results: 18 CT images in combination with manually segmented labels of parotid glands and brainstem were used in a leave-one-out cross validation scheme in order to evaluate the presented approach. For this purpose, 50 different statistical appearance models have been created and used for segmentation. Dice coefficient (DC), mean absolute distance and max. Hausdorff distance between the autosegmentation results and expert segmentations were calculated. An average Dice coefficient of DC = 0.81 (right parotid gland), DC = 0.84 (left parotid gland), and DC = 0.86 (brainstem) could be achieved. Conclusions: The presented framework provides accurate segmentation results for three important structures in the head neck area. Compared to a segmentation approach based on using multiple atlases in combination with label fusion, the proposed hybrid approach provided more accurate results within a clinically acceptable amount of time.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

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

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

07 ISOTOPE AND RADIATION SOURCES↗

SU-G-IeP2-06: Evaluation of Registration Accuracy for Cone-Beam CT Reconstruction Techniques

Purpose: Cone-beam (CB) computed tomography (CT) is used for image guidance during radiotherapy treatment delivery. Conventional Feldkamp and compressed sensing (CS) based CBCT recon-struction techniques are compared for image registration. This study is to evaluate the image registration accuracy of conventional and CS CBCT for head-and-neck (HN) patients. Methods: Ten HN patients with oropharyngeal tumors were retrospectively selected. Each HN patient had one planning CT (CTP) and three CBCTs were acquired during an adaptive radiotherapy proto-col. Each CBCT was reconstructed by both the conventional (CBCTCON) and compressed sens-ing (CBCTCS) methods. Two oncologists manually labeled 23 landmarks of normal tissue and implanted gold markers on both the CTP and CBCTCON. Subsequently, landmarks on CTp were propagated to CBCTs, using a b-spline-based deformable image registration (DIR) and rigid registration (RR). The errors of these registration methods between two CBCT methods were calcu-lated. Results: For DIR, the mean distance between the propagated and the labeled landmarks was 2.8 mm ± 0.52 for CBCTCS, and 3.5 mm ± 0.75 for CBCTCON. For RR, the mean distance between the propagated and the labeled landmarks was 6.8 mm ± 0.92 for CBCTCS, and 8.7 mm ± 0.95 CBCTCON. Conclusion: This study has demonstrated that CS CBCT is more accurate than conventional CBCT in image registration by both rigid and non-rigid methods. It is potentially suggested that CS CBCT is an improved image modality for image guided adaptive applications.

60 APPLIED LIFE SCIENCES↗

Hydrazinoacetic acid is a biosynthetic precursor of the bacterially produced nitramine, N -nitroglycine

Nitramines [R(R′)N–NO 2 ; R,R′=H or alkyl] are valuable synthetic products, but knowledge of the biosynthetic processes that generate these compounds is limited. This work sought to elucidate the biosynthesis of a nitramine natural product, N-nitroglycine (NNG) by Streptomyces noursei . Stable isotope studies showed that S. noursei cells supplemented with L-(ε- 15 N)lysine, ( 15 N)glycine, or ( 13 C)hydrazinoacetic acid (HAA) incorporated 67%, 88%, and 67% of the isotope label into NNG, respectively, indicating that these compounds are biosynthetic precursors of NNG. Liquid chromatography coupled tandem mass spectrometry (LC-MS/MS) of 15 N-Lys-labeled NNG confirmed that the nitro nitrogen of NNG originates from Lys. Bioinformatics analysis of the S. noursei genome showed evidence for a biosynthetic gene cluster (BGC) that contained machinery for HAA biosynthesis ( nngKLM ), consistent with the results of the isotope labeling. In vitro reconstitution of the gene products produced HAA. The borders of this BGC were defined by cross-referencing the predicted BGC with previously published differential proteomics data. Furthermore, we show that azaserine is produced alongside NNG in S. noursei cultures, linking the two biosynthetic pathways via a proposed nitrosamine biosynthetic intermediate. Finally, the oxygen balance for NNG is −20.2% for the formation of carbon dioxide (CO 2 ), which is comparable to that of hexahydro-1,3,5- trinitro-1,3,5-triazene (common name: RDX; −21.6%). Crystal structure data of NNG indicate that the unit crystalizes as a pure material, not a hydrate, suggesting a favorable energetic crystallization phase. The combined results suggest a route that, with further development, could lead to sustainable production of energetic nitramines via synthetic biology or biocatalytic approaches.

biosynthesis↗

Development of Strong Anaerobic Fluorescent Reporters for Clostridium acetobutylicum and Clostridium ljungdahlii Using HaloTag and SNAP-tag Proteins

One of the biggest limitations in the study and engineering of anaerobic Clostridium organisms is the lack of strong fluorescent reporters capable of strong and real-time fluorescence. Recently, we developed a strong fluorescent reporter system for Clostridium organisms based on the FAST protein. Here, we report the development of two new strong fluorescent reporter systems for Clostridium organisms based on the HaloTag and SNAP-tag proteins, which produce strong fluorescent signals when covalently bound to fluorogenic ligands. These new fluorescent reporters are orthogonal to the FAST ligands and to each other, allowing for simultaneous labeling and visualization. We used HaloTag and SNAP-tag to label the strictly anaerobic organisms Clostridium acetobutylicum and Clostridium ljungdahlii. We have also identified a new strong promoter for protein expression in C. acetobutylicum, based on the phosphotransacetylase gene (pta) from C. ljungdahlii. Furthermore, the HaloTag and the SNAP-tag, in combination with the previously described FAST system, were successfully used to measure cell populations in bacterial mixed cultures and showed the simultaneous orthogonal labeling of HaloTag and SNAP-tag together with the FAST protein reporter. Finally, we show the expression of recombinant fusion protein of FAST and the ZapA division protein (from C. acetobutylicum) in C. ljungdahlii. The availability of multiple strong fluorescent reporters is a major addition to the genetic toolkit of Here, Clostridium and other anaerobes that will lead to better understanding of these unique organisms.

59 BASIC BIOLOGICAL SCIENCES↗

Erratum for Skennerton et al., “Methane-Fueled Syntrophy through Extracellular Electron Transfer: Uncovering the Genomic Traits Conserved within Diverse Bacterial Partners of Anaerobic Methanotrophic Archaea”

Volume 8, no. 4, e00530-17, 2017, https://doi.org/10.1128/mBio.00530-17. It has been brought to our attention that some of the gene labels assigned to Geobacter sulfurreducens are incorrect in Fig. 3. Upon careful review, we have confirmed that the analyses in our manuscript were performed on the correct genes, and it is only the figure labels that are incorrect. The revised Fig. 3 shows the correct labels.

59 BASIC BIOLOGICAL SCIENCES↗

Quantitative Stable-Isotope Probing (qSIP) with Metagenomics Links Microbial Physiology and Activity to Soil Moisture in Mediterranean-Climate Grassland Ecosystems

The growth and physiology of soil microorganisms, which play vital roles in biogeochemical cycling, are shaped by both current and historical soil environmental conditions. Here, we developed and applied a genome-resolved metagenomic implementation of quantitative stable isotope probing (qSIP) with an H 2 18 O labeling experiment to identify actively growing soil microorganisms and their genomic capacities. qSIP enabled measurement of taxon-specific growth because isotopic incorporation into microbial DNA requires production of new genome copies. We studied three Mediterranean grassland soils across a rainfall gradient to evaluate the hypothesis that historic precipitation levels are an important factor controlling trait selection. We used qSIP-informed genome-resolved metagenomics to resolve the active subset of soil community members and identify their characteristic ecophysiological traits. Higher year-round precipitation levels correlated with higher activity and growth rates of flagellar motile microorganisms. In addition to heavily isotopically labeled bacteria, we identified abundant isotope-labeled phages, suggesting phage-induced cell lysis likely contributed to necromass production at all three sites. Further, there was a positive correlation between phage activity and the activity of putative phage hosts. Contrary to our expectations, the capacity to decompose the diverse complex carbohydrates common in soil organic matter or oxidize methanol and carbon monoxide were broadly distributed across active and inactive bacteria in all three soils, implying that these traits are not highly selected for by historical precipitation.

54 ENVIRONMENTAL SCIENCES↗

Semi-supervised graph neural networks for pileup noise removal

Abstract The high instantaneous luminosity of the CERN Large Hadron Collider leads to multiple proton–proton interactions in the same or nearby bunch crossings (pileup). Advanced pileup mitigation algorithms are designed to remove this noise from pileup particles and improve the performance of crucial physics observables. This study implements a semi-supervised graph neural network for particle-level pileup noise removal, by identifying individual particles produced from pileup. The graph neural network is firstly trained on charged particles with known labels, which can be obtained from detector measurements on data or simulation, and then inferred on neutral particles for which such labels are missing. This semi-supervised approach does not depend on the neutral particle pileup label information from simulation, and thus allows us to perform training directly on experimental data. The performance of this approach is found to be consistently better than widely-used domain algorithms and comparable to the fully-supervised training using simulation truth information. The study serves as the first attempt at applying semi-supervised learning techniques to pileup mitigation, and opens up a new direction of fully data-driven machine learning pileup mitigation studies.

43 PARTICLE ACCELERATORS↗

Scalable Pattern Matching in Metadata Graphs via Constraint Checking

Pattern matching is a fundamental tool for answering complex graph queries. Unfortunately, existing solutions have limited capabilities: They do not scale to process large graphs and/or support only a restricted set of search templates or usage scenarios. Moreover, the algorithms at the core of the existing techniques are not suitable for today’s graph processing infrastructures relying on horizontal scalability and shared-nothing clusters, as most of these algorithms are inherently sequential and difficult to parallelize. In this article we present an algorithmic pipeline that bases pattern matching on constraint checking. The key intuition is that each vertex and edge participating in a match has to meet a set of constraints implicitly specified by the search template. These constraints can be verified independently and typically are less expensive to compute than searching the full template. The pipeline we propose generates these constraints and iterates over them to eliminate all the vertices and edges that do not participate in any match, thus reducing the background graph to a subgraph that is the union of all template matches—the complete set of all vertices and edges that participate in at least one match. Additional analysis can be performed on this annotated, reduced graph, such as full match enumeration, match counting, or computing vertex/edge centrality. Furthermore, a vertex-centric formulation for constraint checking algorithms exists, and this makes it possible to harness existing high-performance, vertex-centric graph processing frameworks. This technique (i) enables highly scalable pattern matching in metadata (labeled) graphs; (ii) supports arbitrary patterns with 100% precision; (iii) enables tradeoffs between precision and time-to-solution, while always selects all vertices and edges that participate in matches, thus offering 100% recall; and (iv) supports a set of popular data analytics scenarios. We implement our approach on top of HavoqGT, an open-source asynchronous graph processing framework, and demonstrate its advantages through strong and weak scaling experiments on massive scale real-world (up to 257 billion edges) and synthetic (up to 4.4 trillion edges) labeled graphs, respectively, and at scales (1,024 nodes / 36,864 cores), orders of magnitude larger than used in the past for similar problems. This article serves two purposes: First, it synthesises the knowledge accumulated during a long-term project. Second, it presents new system features, usage scenarios, optimizations, and comparisons with related work that strengthen the confidence that pattern matching based on iterative pruning via constraint checking is an effective and scalable approach in practice. The new contributions include the following: (i) We demonstrate the ability of the constraint checking approach to efficiently support two additional search scenarios that often emerge in practice, interactive incremental search and exploratory search. (ii) We empirically compare our solution with two additional state-of-the-art systems, Arabsque and TriAD. (iii) We show the ability of our solution to accommodate a more diverse range of datasets with varying properties, e.g., scale, skewness, label distribution, and match frequency. (iv) We introduce or extend a number of system features (e.g., work aggregation, load balancing, and the ability to cap the generated traffic) and design optimizations and demonstrate their advantages with respect to improving performance and scalability. (v) We present bottleneck analysis and insights into artifacts that influence performance. (vi) We present a theoretical complexity argument that motivates the performance gains we observe.

97 MATHEMATICS AND COMPUTING↗

HangulFonts v1.0.0

The software creates the Hangul Fonts data set.The Hangul Fonts Datasets consists of all possible blocks for each font along with a set of labels and features for each block which are common across all fonts. We provide scripts to render each block and font into an image and store them together in an HDF5 file for each font and fontsize specified. Each font has 11,172 possible blocks and we have curated 35 fonts for a total of 391,020 possible images. The spoken consonants and vowel correspond to a set of "initial", "medial", and "final" labels for each block with 19, 21, and 28 classes respectively. In addition, each block can also be assigned a hierarchy label based on the block geometry. Finally, the individual glyphs (atoms) are composed across the initial, medial, and final locations along with potential scalings, translations, or rotations. These features of the data set make it uniquely positioned in the deep representation learning field because of its compositionally and hierarchical organization, while retaining diverse types of variation in the realizations.

Bouchard, Kristofer↗

DistGANS- Distributed Generative Adversarial Neural Networks

DistGANs is a Python package to perform distributed training of conditional generative adversarial neural networks for multi-class labeled image data. DistGANs partitionins the training data according to data labels, and enhances scalability by performing a parallel training where multiple generators are concurrently trained, each one of them focusing on a single data label.

Lupo Pasini, Massimiliano [Oak Ridge National Lab.↗

XRF-XFS-XAS-Auto v1.0 - Beta release

This software allows to analyze XRF maps, XFS spectra and XAS spectra collected at the Advanced Light Source's Beamline 10.3.2. Features include: 1) XRF maps: - process XRF maps, all elemental maps are saved as bmp automatically and labeled with the incident energy used, the scale bar is also labeled and can be controlled. - XRF elemental correlation plots, save the correlation plots automatically - Extract single or multiple transects in XRF maps on one or several regions of interest, each transect profile is numbered and saved in a corresponding folder, along with the corresponding maps showing transect location. 2) XFS spectra - save in log10 scale the XFS spectra, either a single or multiple files all at once. The files are saved as .bmp. - XFS spectra are labeled according to tabulated fluorescence emission lines. 3) XAS spectra - allows to plot individual scalers in the raw data. - allows calibration of the spectra using an Io internal glitch present in all spectra and performing 1st derivative. - Least-square linear combination fitting of XANES or extended XANES spectra using a database of standards using 1, 2 or 3 components maximum. It also provides the 5 top combinations and provide the user for the possibility of saving the 2nd, 3rd, 4th and 5th best combinations in addition to the best one. The processed spectra (pre-edge background substracted, post-edge normalized), the fits and residuals are automatically saved. A table of the component, with fit% and SSN is provided and saved automatically as well.

Fakra, Sirine↗

batteryNET v0.0.1

Code to organize, prepare, and segment multi-scan, larger-than-memory, volumetric dataset. Deep learning segmentation uses pytorch-lightning for code organization, logging and metrics, and multi-GPU parallelization of training and prediction. Also uses moani for volumetric data augmentation and model implementation (currently U-Net++). Training can be done slice-by-slice with 2D models trained on 2D patches either aligned with or perpendicular to the electrode plane, or with 3D models on 3D patches. Sparse labels can be used to minimize required hand-labeling -- less than 0.1% of the entire dataset was labeled. Also includes code for data preparation (alignment/cropping/patching).

Ushizima, Daniela↗

xxing9703/PAVE

Untargeted metabolomics can detect more than 10 000 peaks in a single LC–MS run. The correspondence between these peaks and metabolites, however, remains unclear. Here, we introduce a Peak Annotation and Verification Engine (PAVE) for annotating untargeted microbial metabolomics data. The workflow involves growing cells in 13C and 15N isotope-labeled media to identify peaks from biological compounds and their carbon and nitrogen atom counts. Improved deisotoping and deadducting are enabled by algorithms that integrate positive mode, negative mode, and labeling data. To distinguish metabolites and their fragments, PAVE experimentally measures the response of each peak to weak in-source collision induced dissociation, which increases the peak intensity for fragments while decreasing it for their parent ions. The molecular formulas of the putative metabolites are then assigned based on database searching using both m/z and C/N atom counts. Application of this procedure to Saccharomyces cerevisiae and Escherichia coli revealed that more than 80% of peaks do not label, i.e., are environmental contaminants. More than 70% of the biological peaks are isotopic variants, adducts, fragments, or mass spectrometry artifacts yielding ∼2000 apparent metabolites across the two organisms. About 650 match to a known metabolite formula based on m/z and C/N atom counts, with 220 assigned structures based on MS/MS and/or retention time to match to authenticated standards. Thus, PAVE enables systematic annotation of LC–MS metabolomics data with only ∼4% of peaks annotated as apparent metabolites.

Xing, Xi↗