Search NASA⌕ Search

SEARCH · Search NASA

Results for “data clustering”

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 109 records · Page 6

The alignment between brightest cluster galaxies and host clusters

The alignment between the brightest cluster galaxies (BCGs) and host clusters can reveal the mystery of the formation and evolution of galaxy clusters. We measure cluster orientations in optical based on the projected distribution of member galaxies and in X-ray by fitting the morphology of intracluster medium (ICM). Cluster orientations determined in the two wavelengths are generally consistent. The orientation alignment between BCGs and host clusters is confirmed and more significant than in previous works. We find that BCGs are more aligned with cluster orientations measured in X-ray than those from optical data. Clusters with a brighter BCG generally show a stronger alignment. We argue that the detected redshift evolution of the alignment is probably caused by observational bias rather than intrinsic evolution. The alignment is not related to the ellipticity of BCGs, and the richness, ellipticity, and dynamical state of host clusters. As a result, the strong alignment between BCGs and the morphology of ICMs may be the consequence of the co-evolution between the central massive galaxy and host clusters.

79 ASTRONOMY AND ASTROPHYSICS↗

A new clustering algorithm applicable to multispectral and polarimetric SAR images

We describe an application of a scale-space clustering algorithm to the classification of a multispectral and polarimetric SAR image of an agricultural site. After the initial polarimetric and radiometric calibration and noise cancellation, we extracted a 12-dimensional feature vector for each pixel from the scattering matrix. The clustering algorithm was able to partition a set of unlabeled feature vectors from 13 selected sites, each site corresponding to a distinct crop, into 13 clusters without any supervision. The cluster parameters were then used to classify the whole image. The classification map is much less noisy and more accurate than those obtained by hierarchical rules. Starting with every point as a cluster, the algorithm works by melting the system to produce a tree of clusters in the scale space. It can cluster data in any multidimensional space and is insensitive to variability in cluster densities, sizes and ellipsoidal shapes. This algorithm, more powerful than existing ones, may be useful for remote sensing for land use.

Wong, Yiu-Fai↗

Adaptive on-line classification of multi-spectral scanner data

A possible solution to the analysis of the massive amounts of multi-spectral scanner data from the Earth Resource Technical Satellite (ERTS) program is proposed. This solution is offered as an adaptive on-line classification scheme. The classifier is described as well as its controller which is based on ground truth data. Cluster analysis is presented as an alternative approach to the ground truth data. Adaptive feature selection is discussed and possible mini-computer implementations are offered.

Fromm, F. R.↗

Physics of Galaxy Clusters and How it Affects Cosmological Tests

We have worked on the analysis of the Chandra observations of the distant clusters of galaxies, and on exploring new ways to obtain cosmological constraints from the cluster data. Some of the scientific results are discussed below: (1) Evolution of the cluster scaling relations at z is approximately 0.5; (2) Using gas mass as a proxy for the total cluster mass.

Vikhlinin, Alexey↗

The composite sequential clustering technique for analysis of multispectral scanner data

The clustering technique consists of two parts: (1) a sequential statistical clustering which is essentially a sequential variance analysis, and (2) a generalized K-means clustering. In this composite clustering technique, the output of (1) is a set of initial clusters which are input to (2) for further improvement by an iterative scheme. This unsupervised composite technique was employed for automatic classification of two sets of remote multispectral earth resource observations. The classification accuracy by the unsupervised technique is found to be comparable to that by traditional supervised maximum likelihood classification techniques. The mathematical algorithms for the composite sequential clustering program and a detailed computer program description with job setup are given.

Su, M. Y.↗

Making the most of missing values : object clustering with partial data in astronomy

We demonstrate a clustering analysis algorithm, KSC, that a) uses all observed values and b) does not discard the partially observed objects. KSC uses soft constraints defined by the fully observed objects to assist in the grouping of objects with missing values. We present an analysis of objects taken from the Sloan Digital Sky Survey to demonstrate how imputing the values can be misleading and why the KSC approach can produce more appropriate results.

clustering↗

Accessing protected data by a high-performance computing cluster

A data protection system is provided that allows applications to access protected data in a way that restricts applications from outputting to unauthorized targets any unprotected data derived from the protected data and that ensures that the applications do not have access to a key that allows access to the unprotected data. The data protection system provides a policy server that may execute on a service node of a high performance computing system and a data encryption process that may execute on each compute node that is allocated to an application or batch job. The policy server maintains policies of entities specifying access control for protected data. The data encryption process generates a secure execution environment for an application process and interfaces with the policy server to retrieve keys for decrypting protected data in accordance with a policy, and it decrypts and provides the decrypted data to the application process.

Barnes, Peter↗

Sub-10 nm Probing of Ferroelectricity in Heterogeneous Materials by Machine Learning Enabled Contact Kelvin Probe Force Microscopy

Reducing the dimensions of ferroelectric materials down to the nanoscale has strong implications on the ferroelectric polarization pattern and on the ability to switch the polarization. As the size of ferroelectric domains shrinks to the nanometer scale, the heterogeneity of the polarization pattern becomes increasingly pronounced, enabling a large variety of possible polar textures in nanocrystalline and nanocomposite materials. Critical to the understanding of fundamental physics of such materials and hence their applications in electronic nanodevices is the ability to investigate their ferroelectric polarization at the nanoscale in a nondestructive way. We show that contact Kelvin probe force microscopy (cKPFM) combined with a k-means response clustering algorithm enables to measure the ferroelectric response at a mapping resolution of 8 nm. In a BaTiO 3 thin film on silicon composed of tetragonal and hexagonal nanocrystals, we determine a nanoscale lateral distribution of discrete ferroelectric response clusters, fully consistent with the nanostructure determined by transmission electron microscopy. Moreover, we apply this data clustering method to the cKPFM responses measured at different temperatures, which allows us to follow the corresponding change in the polarization pattern as the Curie temperature is approached and across the phase transition. This work opens up perspectives for mapping complex ferroelectric polarization textures such as curled/swirled polar textures that can be stabilized in epitaxial heterostructures and more generally for mapping the polar domain distribution of any spatially highly heterogeneous ferroelectric materials.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A Neural Network Approach for Identifying Particle Pitch Angle Distributions in Van Allen Probes Data

Analysis of particle pitch angle distributions (PADs) has been used as a means to comprehend a multitude of different physical mechanisms that lead to flux variations in the Van Allen belts and also to particle precipitation into the upper atmosphere. In this work we developed a neural network-based data clustering methodology that automatically identifies distinct PAD types in an unsupervised way using particle flux data. One can promptly identify and locate three well-known PAD types in both time and radial distance, namely, 90deg peaked, butterfly, and flattop distributions. In order to illustrate the applicability of our methodology, we used relativistic electron flux data from the whole month of November 2014, acquired from the Relativistic Electron-Proton Telescope instrument on board the Van Allen Probes, but it is emphasized that our approach can also be used with multiplatform spacecraft data. Our PAD classification results are in reasonably good agreement with those obtained by standard statistical fitting algorithms. The proposed methodology has a potential use for Van Allen belt's monitoring.

Souza, V. M.↗

THE DISTANCE DUALITY RELATION FROM STRONG GRAVITATIONAL LENSING

Under very general assumptions of the metric theory of spacetime, photons traveling along null geodesics and photon number conservation, two observable concepts of cosmic distance, i.e., the angular diameter and the luminosity distances are related to each other by the so-called distance duality relation (DDR) D{sup L}=D{sup A}(1+z){sup 2}. Observational validation of this relation is quite important because any evidence of its violation could be a signal of new physics. In this paper we introduce a new method to test the DDR based on strong gravitational lensing systems and type Ia supernovae (SNe Ia) under a flat universe. The method itself is worth attention because unlike previously proposed techniques, it does not depend on all other prior assumptions concerning the details of cosmological model. We tested it using a new compilation of strong lensing (SL) systems and JLA compilation of SNe Ia and found no evidence of DDR violation. For completeness, we also combined it with previous cluster data and showed its power on constraining the DDR. It could become a promising new probe in the future in light of forthcoming massive SL surveys and because of expected advances in galaxy cluster modeling.

79 ASTRONOMY AND ASTROPHYSICS↗

Development of Gamma Background Radiation Digital Twin with Machine Learning Algorithms: Application of Unsupervised Machine Learning to Detection of Anomalies and Nuisances in Gamma Background Radiation Environmental Screening Data

Environmental screening of gamma radiation consists of detecting weak nuisance and anomaly signal in the presence of strong and highly varying background. In a typical scenario, a mobile detector-spectrometer continuously measures gamma radiation spectra in short, e.g., one-second, signal acquisition intervals. The measurement data is a 2D matrix, where one dimension is gamma ray energy, and the other dimension is the number of measurements or total time. In principle, gamma radiation sources can be detected and identified from the measured data by their unique spectral lines. Detecting sources from data measured in a search scenario is difficult due to the highly varying background because of naturally occurring radioactive material (NORM), and low signal-to-noise ratio (S/N) of spectral signal measured during one-second acquisition intervals. The objective of this work is to explore unsupervised machine learning (ML) algorithms for development of a digital twin of gamma radiation background, and for detection and identification of weak nuisances and anomalies events in the presence of highly fluctuating background. In one segment of work, we developed a gamma background estimation model using a Longshort term memory (LSTM) network for one-step CPS time series prediction. The LSTM model was validated with two data sets of measurements from two independent NaI detectors positioned on a mobile platform. The data sets contained background radiation only and no orphan isotope sources. The LSTM model was constructed and tested using data from one of the detectors. Performance of the LSTM model was validate through one-step prediction of CPS time series of another NaI detector without re-training. This approach allows to create a digital twin for nuclear background estimation. Using LSTM, it could be possible to detect a source through subtraction of the estimated counts from the measured background. In another segment of work, we investigated detection of gamma emitting sources in the presence of complex background using unsupervised machine learning. Spectral lines of isotopes are difficult to observe in one-second measurements. Averaging over the entire measurement campaign data set reveals spectral lines of most common background isotopes. Spectral lines of orphan sources, which might appear only in a few measurements during the campaign, will be washed out if averaging is performed over the entire measurement data set. The approach we have explored consists of extracting one-second measurements containing weak spectral features through data clustering. Averaging one-second spectra in a cluster should reveal the presence of anomaly sources. We created two ML models using K-means clustering and Neural Network Self-organizing Map (SOM). Performance of these ML models was benchmarked using search data. One data set contained 137 Cs source, and another dataset contained 131 I source.

54 ENVIRONMENTAL SCIENCES↗

High Performance Computing Based Parallel HIearchical Modal Association Clustering (HPAR HMAC)

For many applications, clustering is a crucial step in order to gain insight into the makeup of a dataset. The best approach to a given problem often depends on a variety of factors, such as the size of the dataset, time restrictions, and soft clustering requirements. The HMAC algorithm seeks to combine the strengths of 2 particular clustering approaches: model-based and linkage-based clustering. One particular weakness of HMAC is its computational complexity. HMAC is not practical for mega-scale data clustering. For high-definition imagery, a user would have to wait months or years for a result; for a 16-megapixel image, the estimated runtime skyrockets to over a decade! To improve the execution time of HMAC, it is reasonable to consider an multi-core implementation that utilizes available system resources. An existing imple-mentation (Ray and Cheng 2014) divides the dataset into N partitions - one for each thread prior to executing the HMAC algorithm. This implementation benefits from 2 types of optimization: parallelization and divide-and-conquer. By running each partition in parallel, the program is able to accelerate computation by utilizing more system resources. Although the parallel implementation provides considerable improvement over the serial HMAC, it still suffers from poor computational complexity, O(N2). Once the maximum number of cores on a system is exhausted, the program exhibits slower behavior. We now consider a modification to HMAC that involves a recursive partitioning scheme. Our modification aims to exploit divide-and-conquer benefits seen by the parallel HMAC implementation. At each level in the recursion tree, partitions are divided into 2 sub-partitions until a threshold size is reached. When the partition can no longer be divided without falling below threshold size, the base HMAC algorithm is applied. This results in a significant speedup over the parallel HMAC.

Patlolla, Dilip R↗

Analysis of data on absorption in the northern part of the milky way

The values of absorption for different galactic longitudes are obtained on the basis of star cluster data. It is found that the distance up to the point, where the straightening of the absorption distribution curve begins, depends on the limiting magnitude of the catalogue and the density of absorbing matter near the sun. The picture of absorbing matter distribution in the northern part of the Milky Way is given.

Polishchuk, E. P.↗

Stringent σ8 constraints from small-scale galaxy clustering using a hybrid MCMC + emulator framework

ABSTRACT We present a novel simulation-based hybrid emulator approach that maximally derives cosmological and Halo Occupation Distribution (HOD) information from non-linear galaxy clustering, with sufficient precision for DESI Year 1 (Y1) analysis. Our hybrid approach first samples the HOD space on a fixed cosmological simulation grid to constrain the high-likelihood region of cosmology + HOD parameter space, and then constructs the emulator within this constrained region. This approach significantly reduces the parameter volume emulated over, thus achieving much smaller emulator errors with fixed number of training points. We demonstrate that this combined with state-of-the-art simulations result in tight emulator errors comparable to expected DESI Y1 LRG sample variance. We leverage the new abacussummit simulations and apply our hybrid approach to CMASS non-linear galaxy clustering data. We infer constraints on σ8 = 0.762 ± 0.024 and fσ8(zeff = 0.52) = 0.444 ± 0.016, the tightest among contemporary galaxy clustering studies. We also demonstrate that our fσ8 constraint is robust against secondary biases and other HOD model choices, a critical first step towards showcasing the robust cosmology information accessible in non-linear scales. We speculate that the additional statistical power of DESI Y1 should tighten the growth rate constraints by at least another 50–60 ${{\ \rm per\ cent}}$, significantly elucidating any potential tension with Planck. We also address the ‘lensing is low’ tension, which we find to be in the same direction as a potential tension in fσ8. We show that the combined effect of a lower fσ8 and environment-based bias accounts for approximately $50{{\ \rm per\ cent}}$ of the discrepancy.

79 ASTRONOMY AND ASTROPHYSICS↗

Intermittent Turbulence and SOC Dynamics in a 2-D Driven Current-Sheet Model

Borovsky et al. have shown that Earth's magnetotail plasma sheet is strongly turbulent. More recently, Borovsky and Funsten have shown that eddy turbulence dominates and have suggested that the eddy turbulence is driven by fast flows that act as jets in the plasma. Through basic considerations of energy and magnetic flux conservation, these fast flows are thought to be localized to small portions of the total plasma sheet and to be generated by magnetic flux reconnection that is similarly localized. Angelopoulos et al., using single spacecraft Geotail data, have shown that the plasma sheet turbulence exhibits signs of intermittence and Weygand et al., using four spacecraft Cluster data, have confirmed and expanded on this conclusion. Uritsky et al., using Polar UVI image data, have shown that the evolution of bright, nightside, UV auroral emission regions is consistent with many of the properties of systems in self-organized criticality (SOC). Klimas et al. have suggested that the auroral dynamics is a reflection of the dynamics of the fast flows in the plasma. sheet. Their hypothesis is that the transport of magnetic fludenergy through the magnetotail is enabled by scale-free avalanches of localized reconnection whose SOC dynamics are reflected in the auroral UV emission dynamics. A corollary of this hypothesis is that the strong, intermittent, eddy turbulence of the plasma sheet is closely related to its critical dynamics. The question then arises: Can in situ evidence for the SOC dynamics be found in the properties of the plasma sheet turbulence? A 2-dimensional numerical driven current-sheet model of the central plasma sheet has been developed that incorporates an idealized current-driven instability with a resistive MHD system. It has been shown that the model can evolve into SOC in a physically relevant parameter regime. Initial results from a study of intermittent turbulence in this model and the relationship of this turbulence to the model's known SOC dynamics will be discussed.

Klimas, A. J.↗

Dark Energy Survey Year 3 Results: clustering redshifts – calibration of the weak lensing source redshift distributions with redMaGiC and BOSS/eBOSS

ABSTRACT We present the calibration of the Dark Energy Survey Year 3 (DES Y3) weak lensing (WL) source galaxy redshift distributions n(z) from clustering measurements. In particular, we cross-correlate the WL source galaxies sample with redMaGiC galaxies (luminous red galaxies with secure photometric redshifts) and a spectroscopic sample from BOSS/eBOSS to estimate the redshift distribution of the DES sources sample. Two distinct methods for using the clustering statistics are described. The first uses the clustering information independently to estimate the mean redshift of the source galaxies within a redshift window, as done in the DES Y1 analysis. The second method establishes a likelihood of the clustering data as a function of n(z), which can be incorporated into schemes for generating samples of n(z) subject to combined clustering and photometric constraints. Both methods incorporate marginalization over various astrophysical systematics, including magnification and redshift-dependent galaxy-matter bias. We characterize the uncertainties of the methods in simulations; the first method recovers the mean z of tomographic bins to RMS (precision) of ∼0.014. Use of the second method is shown to vastly improve the accuracy of the shape of n(z) derived from photometric data. The two methods are then applied to the DES Y3 data.

79 ASTRONOMY AND ASTROPHYSICS↗

Facial Named Entity Recognition by Attention-Based Graph Convolutional Neural Network

In the realm of facial recognition and analysis, the ability to accurately cluster large datasets of facial images stands as a cornerstone for various applications, ranging from security surveillance to user biometric identification. This project evolves a novel approach to facial data clustering by embedding facial images into a high-dimensional vector space using an advanced embedding model trained on separate data and assumes a graph-like structure on the high-dimensional vectors. We find our method works significantly better than common shallow methods.

97 MATHEMATICS AND COMPUTING↗