Search NASA⌕ Search

SEARCH · Search NASA

Results for “clustering methods”

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 235 records · Page 13

Validation of Methods for Computational Catalyst Design: Geometries, Structures, and Energies of Neutral and Charged Silver Clusters

We report a systematic study of small silver clusters, Agn, Agn+, and Agn–, n = 1–7. We studied all possible isomers of clusters with n = 5–7. We tested 42 exchange–correlation functionals, and we assess these functionals for their accuracy in three respects: geometries (quantitative prediction of internuclear distances), structures (the nature of the lowest-energy structure, for example, whether it is planar or nonplanar), and energies. We find that the ingredients of exchange–correlation functionals are indicators of their success in predicting geometries and structures: local exchange–correlation functionals are generally better than hybrid functionals for geometries; functionals depending on kinetic energy density are the best for predicting the lowest-energy isomer correctly, especially for predicting two-dimensional to three-dimenstional transitions correctly. The accuracy for energies is less sensitive to the ingredient list. Our findings could be useful for guiding the selection of methods for computational catalyst design.

Environmental Molecular Sciences Laboratory↗

Excitation energies with cost-reduced variant of the active-space EOMCCSDT method: the EOMCCSDt-(3) over-bar approach

In this paper we discuss the performance of the several simplified variants of equation-of-motion coupled cluster method (EOMCC) with iterative inclusion of singles, doubles and active-space triples (EOMCCSDt). In particular, we explore simplified EOMCCSDt approaches which enable one to generate the triply excited amplitudes in on-the-fly manner. The original EOMCCSDt formulation has already demonstrated a great success in encapsulating the most important excited-state correlation effects due to triples. In analogy to the original EOMCCSDT formulation, the proposed approach can by-pass the typical bottlenecks associated with the need for storing triply-excited amplitudes. In this paper, we illustrate the performance of several approximate EOMCCSDt methods, named EOMCCSDt-3 and EOMCCSdt-3x, on typical benchmark systems including C2, N2, and the ozone molecules. These new methods yield excitation energies close to the EOMCCSDt ones. The extrapolation of excitation energies for basis sets ranging from cc-pVDZ to cc-pV6Z for N2 and C2 shows very good convergence to the experimental results for states dominated by single excitations.

Coupled cluster↗

Fuzzy Set Methods for Object Recognition in Space Applications

Progress on the following four tasks is described: (1) fuzzy set based decision methodologies; (2) membership calculation; (3) clustering methods (including derivation of pose estimation parameters), and (4) acquisition of images and testing of algorithms.

Keller, James M.↗

Reference air kerma and kerma-area product as estimators of peak skin dose for fluoroscopically guided interventions

Purpose: To determine more accurate regression formulas for estimating peak skin dose (PSD) from reference air kerma (RAK) or kerma-area product (KAP). Methods: After grouping of the data from 21 procedures into 13 clinically similar groups, assessments were made of optimal clustering using the Bayesian information criterion to obtain the optimal linear regressions of (log-transformed) PSD vs RAK, PSD vs KAP, and PSD vs RAK and KAP. Results: Three clusters of clinical groups were optimal in regression of PSD vs RAK, seven clusters of clinical groups were optimal in regression of PSD vs KAP, and six clusters of clinical groups were optimal in regression of PSD vs RAK and KAP. Prediction of PSD using both RAK and KAP is significantly better than prediction of PSD with either RAK or KAP alone. The regression of PSD vs RAK provided better predictions of PSD than the regression of PSD vs KAP. The partial-pooling (clustered) method yields smaller mean squared errors compared with the complete-pooling method.Conclusion: PSD distributions for interventional radiology procedures are log-normal. Estimates of PSD derived from RAK and KAP jointly are most accurate, followed closely by estimates derived from RAK alone. Estimates of PSD derived from KAP alone are the least accurate. Using a stochastic search approach, it is possible to cluster together certain dissimilar types of procedures to minimize the total error sum of squares.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Simulating X-ray Absorption Spectra with Linear-Response Density Cumulant Theory

We present a new approach for simulating X-ray absorption spectra based on linear-response density cumulant theory (LR-DCT) [Copan, A. V.; Sokolov, A. Yu. J. Chem. Theory Comput. 2018, 14, 4097–4108]. Our new method combines the LR-ODC-12 formulation of LR-DCT with core- valence separation approximation (CVS) that allows us to efficiently access high-energy core-excited states. We describe our computer implementation of the CVS-approximated LRODC-12 method (CVS-ODC-12) and benchmark its performance by comparing simulated X-ray absorption spectra to those obtained from experiment for several small molecules. Our results demonstrate that the CVS-ODC-12 method shows good agreement with experiment for relative spacings between transitions and their intensities, but the excitation energies are systematically overestimated. When compared to results from excited-state coupled cluster methods with single and double excitations, the CVS-ODC-12 method shows a similar performance for intensities and peak separations, while coupled cluster spectra are less shifted, relative to experiment. An important advantage of CVS-ODC-12 is that its excitation energies are computed by diagonalizing a Hermitian matrix, which enables efficient computation of transition intensities.

Peng, Ruojing↗

Lowest triplet (n,π{sup *}) state of 2-cyclohexen-1-one: Characterization by cavity ringdown spectroscopy and quantum-chemical calculations

The cavity ringdown (CRD) absorption spectrum of 2-cyclohexen-1-one (2CHO) was recorded over the range 401.5–410.5 nm in a room-temperature gas cell. The very weak band system (ε ⩽ 0.1 M{sup −1} cm{sup −1}) in this spectral region is due to the T{sub 1}(n, π*) ← S{sub 0} electronic transition. The 0{sub 0}{sup 0} origin band was assigned to the feature observed at 24 558.8 ± 0.3 cm{sup −1}. We have assigned 46 vibronic transitions in a region extending from −200 to +350 cm{sup −1} relative to the origin band. For the majority of these transitions, we have made corresponding assignments in the spectrum of the deuterated derivative 2CHO-2,6,6-d{sub 3}. From the assignments, we determined fundamental frequencies for several vibrational modes in the T{sub 1}(n, π{sup *}) excited state of 2CHO, including the lowest ring-twisting (99.6 cm{sup −1}) and ring-bending (262.2 cm{sup −1}) modes. These values compare to fundamentals of 122.2 cm{sup −1} and 251.9 cm{sup −1}, respectively, determined previously for the isoconfigurational S{sub 1}(n, π{sup *}) excited state of 2CHO and 99 cm{sup −1} and 248 cm{sup −1}, respectively, for the S{sub 0} ground state. With the aid of quantum-mechanical calculations, we have also ascertained descriptions for these two modes, thereby resolving ambiguities appearing in the previous literature. The ring-twisting mode (ν{sub 39}) contains a significant contribution from O=C–C=C torsion, whereas the ring-bending mode (ν{sub 38} in the ground state) involves mainly the motion of C-5 with respect to the plane containing the other heavy atoms. The CRD spectroscopic data for the T{sub 1}(n, π{sup *}) state have allowed us to benchmark several computational methods for treating excited states, including time-dependent density functional theory and an equation-of-motion coupled cluster method. In turn, the computational results provide an explanation for observed differences in the T{sub 1}(n, π{sup *}) vs. S{sub 1}(n, π{sup *}) ring frequencies.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

VoroClust

SAND2025-11465O VoroClust, also known as Voronoi Clustering, is a fast, density-based unsupervised clustering algorithm applicable to high-resolution and high-dimensional data. It operates as quickly as distance-based clustering methods while effectively capturing complex regional geometries, matching the performance of current density-based methods. VoroClust employs a data-centered sphere cover to reduce computational demands while preserving data topology. It propagates clusters outward from local density peaks. Although supervised machine learning is powerful for applications like image classification and segmentation, it requires comprehensive, consistent datasets, which many applications lack. Unsupervised clustering algorithms analyze the structure of each dataset rather than relying on similarities with other examples, making them well-suited for practical applications with insufficient or inappropriate data for supervised learning. Sandia National Laboratories is a multimission laboratory managed and operated by National Technology & Engineering Solutions of Sandia, LLC, a wholly owned subsidiary of Honeywell International Inc., for the U.S. Department of Energy’s National Nuclear Security Administration under contract DE-NA0003525.

Ebeida, Mohamed [Sandia National Lab. (SNL-CA), Li↗

Bacterial and Archaea Community Present in the Pine Barrens Forest of Long Island, NY: Unusually High Percentage of Ammonia Oxidizing Bacteria

Of the few preserved areas in the northeast of United States, the soil in the Pine Barrens Forests presents a harsh environment for the microorganisms to grow and survive. In the current study we report the use of clustering methods to scientifically select the sampling locations that would represent the entire forest and also report the microbial diversity present in various horizons of the soil. Sixty six sampling locations were selected across the forest and soils were collected from three horizons (sampling depths). The three horizons were 0-10 cm (Horizon O); 11-25 cm (Horizon A) and 26-40 cm (Horizon B). Based on the total microbial substrate utilization pattern and K-means clustering analysis, the soil in the Pine Barrens Forest can be classified into four distinct clusters at each of the three horizons. One soil sample from each of the four clusters were selected and archaeal and bacterial populations within the soil studied using pyrosequencing method. The results show the microbial communities present in each of these clusters are different. Within the microbial communities present, microorganisms involved in nitrogen cycle occupy a major fraction of microbial community in the soil. High level of diversity was observed for nitrogen fixing bacteria. In contrast, Nitrosovibrio and Nitrosocaldus spp are the single bacterial and archaeal population respectively carrying out ammonia oxidation in the soil.

54 ENVIRONMENTAL SCIENCES↗

Normalized Cut Algorithm for Automated Assignment of Protein Domains

We present a novel computational method for automatic assignment of protein domains from structural data. At the core of our algorithm lies a recently proposed clustering technique that has been very successful for image-partitioning applications. This grap.,l-theory based clustering method uses the notion of a normalized cut to partition. an undirected graph into its strongly-connected components. Computer implementation of our method tested on the standard comparison set of proteins from the literature shows a high success rate (84%), better than most existing alternative In addition, several other features of our algorithm, such as reliance on few adjustable parameters, linear run-time with respect to the size of the protein and reduced complexity compared to other graph-theory based algorithms, would make it an attractive tool for structural biologists.

Samanta, M. P.↗

Enhancing Cluster Identification in Atom Probe Tomography Data Using Transfer Learning

Atom probe tomography (APT) has enabled the direct visualization of solute clusters, providing valuable insights into material structures. This clustering is crucial for understanding the nanoscale composition and behavior of materials, which can significantly influence their mechanical and physical properties. However, the widely used clustering methods in the APT community face challenges such as subjective parametric selection and limited applicability, particularly in dealing with overlapping clusters, nested clusters, and artifacts across different scales, such as precipitates and dislocations. To address these challenges, we present a framework based on density-based cluster analysis that aims to be less dependent on user input, reproducible, and robust.

Density-based clustering↗

VoroClust: Scalable Clustering for Remote Sensing

Although supervised machine learning provides a powerful framework for image classification and segmentation, it requires comprehensive consistent datasets, which are not available for many remote-sensing applications. Remote-sensing datasets are expensive to collect, and each is acquired under different environmental conditions or with significant variations in system operating parameters. Unsupervised clustering algorithms analyze the structure of each dataset independently, rather than drawing on similarities with existing “training” examples, and are thus well suited for practical remote-sensing applications. We introduce VoroClust, a fast density-based unsupervised clustering algorithm applicable to high-resolution and high-dimensional data. VoroClust runs as fast as distance-based clustering methods, while capturing complex regional geometries at least as well as current-density-based methods. It uses a data-centered sphere cover to reduce computational demands, while still capturing data topology. It then propagates clusters outward from local peaks in density. We show that VoroClust provides fast state-of-the-art clustering for both high-resolution polarimetric synthetic aperture radar and high-dimensional hyperspectral imaging datasets.

42 ENGINEERING↗

Subnanometer catalytic clusters for water splitting, method for splitting water using subnanometer catalyst clusters

The invention provides a catalytic electrode for converting molecules, the electrode comprising a predetermined number of single catalytic sites supported on a substrate. Also provided is a method for oxidizing water comprising contacting the water with size selected catalyst clusters. The invention also provides a method for reducing an oxidized moiety, the method comprising contacting the moiety with size selected catalyst clusters at a predetermined voltage potential.

Vajda, Stefan↗

Texture analysis improves level set segmentation of the anterior abdominal wall

Purpose: The treatment of ventral hernias (VH) has been a challenging problem for medical care. Repair of these hernias is fraught with failure; recurrence rates ranging from 24% to 43% have been reported, even with the use of biocompatible mesh. Currently, computed tomography (CT) is used to guide intervention through expert, but qualitative, clinical judgments, notably, quantitative metrics based on image-processing are not used. The authors propose that image segmentation methods to capture the three-dimensional structure of the abdominal wall and its abnormalities will provide a foundation on which to measure geometric properties of hernias and surrounding tissues and, therefore, to optimize intervention.Methods: In this study with 20 clinically acquired CT scans on postoperative patients, the authors demonstrated a novel approach to geometric classification of the abdominal. The authors’ approach uses a texture analysis based on Gabor filters to extract feature vectors and follows a fuzzy c-means clustering method to estimate voxelwise probability memberships for eight clusters. The memberships estimated from the texture analysis are helpful to identify anatomical structures with inhomogeneous intensities. The membership was used to guide the level set evolution, as well as to derive an initial start close to the abdominal wall.Results: Segmentation results on abdominal walls were both quantitatively and qualitatively validated with surface errors based on manually labeled ground truth. Using texture, mean surface errors for the outer surface of the abdominal wall were less than 2 mm, with 91% of the outer surface less than 5 mm away from the manual tracings; errors were significantly greater (2–5 mm) for methods that did not use the texture.Conclusions: The authors’ approach establishes a baseline for characterizing the abdominal wall for improving VH care. Inherent texture patterns in CT scans are helpful to the tissue classification, and texture analysis can improve the level set segmentation around the abdominal region.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Population Subdivision in the Gopher Frog (Rana capito) across the Fragmented Longleaf Pine-Wiregrass Savanna of the Southeastern USA

Delineating genetically distinct population segments of threatened species and quantifying population connectivity are important steps in developing effective conservation and management strategies aimed at preventing extinction. The gopher frog (Rana capito) is a xeric-adapted, pond-breeding species endemic to the Gulf and Atlantic coastal plains of the southeastern United States. This species has experienced extensive habitat loss and fragmentation in the formerly widespread longleaf pine-wiregrass savanna where it lives, resulting in individual abundance declines and population extinctions throughout its range. We used individual-based clustering methods along with Bayesian inference of historical migration based on almost 1500 multilocus microsatellite genotypes to examine genetic structure in this taxon. Clustering analyses identified panhandle and peninsular populations in Florida as distinct genetic clusters separated by the Aucilla River, consistent with the division between the Coastal Plain and peninsular mitochondrial lineages, respectively. Analysis of historical migration indicated an east–west population divergence event followed by immigration to the east. Together, our results indicate that the genetically distinct Coastal Plain and peninsular Florida lineages should be considered separately for conservation and management purposes.

59 BASIC BIOLOGICAL SCIENCES↗

Aerosol Models for the CALIPSO Lidar Inversion Algorithms

We use measurements and models to develop aerosol models for use in the inversion algorithms for the Cloud Aerosol Lidar and Imager Pathfinder Spaceborne Observations (CALIPSO). Radiance measurements and inversions of the AErosol RObotic NETwork (AERONET1, 2) are used to group global atmospheric aerosols using optical and microphysical parameters. This study uses more than 105 records of radiance measurements, aerosol size distributions, and complex refractive indices to generate the optical properties of the aerosol at more 200 sites worldwide. These properties together with the radiance measurements are then classified using classical clustering methods to group the sites according to the type of aerosol with the greatest frequency of occurrence at each site. Six significant clusters are identified: desert dust, biomass burning, urban industrial pollution, rural background, marine, and dirty pollution. Three of these are used in the CALIPSO aerosol models to characterize desert dust, biomass burning, and polluted continental aerosols. The CALIPSO aerosol model also uses the coarse mode of desert dust and the fine mode of biomass burning to build a polluted dust model. For marine aerosol, the CALIPSO aerosol model uses measurements from the SEAS experiment 3. In addition to categorizing the aerosol types, the cluster analysis provides all the column optical and microphysical properties for each cluster.

Omar, Ali H.↗

A Fast Implementation of the ISODATA Clustering Algorithm

Clustering is central to many image processing and remote sensing applications. ISODATA is one of the most popular and widely used clustering methods in geoscience applications, but it can run slowly, particularly with large data sets. We present a more efficient approach to ISODATA clustering, which achieves better running times by storing the points in a kd-tree and through a modification of the way in which the algorithm estimates the dispersion of each cluster. We also present an approximate version of the algorithm which allows the user to further improve the running time, at the expense of lower fidelity in computing the nearest cluster center to each point. We provide both theoretical and empirical justification that our modified approach produces clusterings that are very similar to those produced by the standard ISODATA approach. We also provide empirical studies on both synthetic data and remotely sensed Landsat and MODIS images that show that our approach has significantly lower running times.

Memarsadeghi, Nargess↗

A Fast Implementation of the Isodata Clustering Algorithm

Clustering is central to many image processing and remote sensing applications. ISODATA is one of the most popular and widely used clustering methods in geoscience applications, but it can run slowly, particularly with large data sets. We present a more efficient approach to IsoDATA clustering, which achieves better running times by storing the points in a kd-tree and through a modification of the way in which the algorithm estimates the dispersion of each cluster. We also present an approximate version of the algorithm which allows the user to further improve the running time, at the expense of lower fidelity in computing the nearest cluster center to each point. We provide both theoretical and empirical justification that our modified approach produces clusterings that are very similar to those produced by the standard ISODATA approach. We also provide empirical studies on both synthetic data and remotely sensed Landsat and MODIS images that show that our approach has significantly lower running times.

Memarsadeghi, Nargess↗