Search NASA⌕ Search

SEARCH · Search NASA

Results for “nearest neighbors”

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 19 records
All sourcesNASA NTRSDOE OSTI
NASA NTRS1990

Nearest neighbor spacing of fair weather cumulus clouds

Histograms of nearest neighbor spacings of fair weather cumulus at 15 locations over the world's oceans are presented based on the analysis of high resolution Landsat 3 Multispectral Scanner images for amounts of cloud cover ranging from 0.6 to 37.6 percent. These histograms are found to be essentially the same at all locations analyzed, similarly to previous findings on the size distributions and the fractal dimensions of the perimeters for this cloud type. The nearest neighbor spacings are linearly dependent on the effective cloud radii, with a proportionality factor ranging from five to twenty. The histograms peak at about 0.5 km. Nearest-neighbor spacings smaller than about a kilometer, associated with cumulus clouds with an effective radius less than a few hundred meters, have a distribution of cloud centers that is almost indepedent in the horizontal plane and show a tendency for the formation of clumps. Larger spacings of up to thirty kilometers occur and are associated with the larger clouds. These latter spacings are not independent.

Joseph, Joachim H.↗
NASA NTRS2020

Improving Trust in Deep Neural Networks with Nearest Neighbors

Deep neural networks are used increasingly for perception and decision-making in UAVs. For example, they can be used to recognize objects from images and decide what actions the vehicle should take. While deep neural networks can perform very well at complex tasks, their decisions may be unintuitive to a human operator. When a human disagrees with a neural network prediction, due to the black box nature of deep neural networks, it can be unclear whether the system knows something the human does not or whether the system is malfunctioning. This uncertainty is problematic when it comes to ensuring safety. As a result, it is important to develop technologies for explaining neural network decisions for trust and safety. This paper explores a modification to the deep neural network classification layer to produce both a predicted label and an explanation to support its prediction. Specifically, at test time, we replace the final output layer of the neural network classifier by a k-nearest neighbor classifier. The nearest neighbor classifier produces 1) a predicted label through voting and 2) the nearest neighbors involved in the prediction, which represent the most similar examples from the training dataset. Because prediction and explanation are derived from the same underlying process, this approach guarantees that the explanations are always relevant to the predictions. We demonstrate the approach on a convolutional neural network for a UAV image classification task. We perform experiments using a forest trail image dataset and show empirically that the hybrid classifier can produce intuitive explanations without loss of predictive performance compared to the original neural network. We also show how the approach can be used to help identify potential issues in the network and training process.

Lee, Ritchie↗
NASA NTRS1972

A nearest neighbors approach to multidimensional filtering.

The concept of nearest neighbor interaction is applied as a basis for data filtering in two-dimensional steady state problems. A steady state process represented by a potential equation with additive white noise is used to illustrate the application of this concept. It is demonstrated that significant dimensionality reductions can be achieved by applying this concept to various linear steady state problems.

Angel, E.↗
NASA NTRS1972

Nearest Neighbor Algorithms for Pattern Classification

A solution of the discrimination problem is considered by means of the minimum distance classifier, commonly referred to as the nearest neighbor (NN) rule. The NN rule is nonparametric, or distribution free, in the sense that it does not depend on any assumptions about the underlying statistics for its application. The k-NN rule is a procedure that assigns an observation vector z to a category F if most of the k nearby observations x sub i are elements of F. The condensed nearest neighbor (CNN) rule may be used to reduce the size of the training set required categorize The Bayes risk serves merely as a reference-the limit of excellence beyond which it is not possible to go. The NN rule is bounded below by the Bayes risk and above by twice the Bayes risk.

Barrios, J. O.↗
NASA NTRS1991

Effect of nearest-neighbor ions on excited ionic states, emission spectra, and line profiles in hot and dense plasmas

The effect of the cylindrical symmetry imposed by the nearest-neighbor ions on the ionic levels and the emission spectra of a Li-like Kr ion immersed in hot and dense plasmas is investigated using the Stein et al. (1989) two-centered model extended to include computations of the line profiles, shifts, and widths, as well as the energy-level mixing and the forbidden transition probabilities. It is shown that the cylindrical symmetry mixes states with different orbital quantum numbers l, particularly for highly excited states, and, thereby, gives rise to forbidden transitions in the emission spectrum. Results are obtained for the variation of the ionic level shifts and mixing coefficients with the distance to the nearest neighbor. Also obtained are representative computed spectra that show the density effects on the spectral line profiles, shifts, and widths, and the forbidden components in the spectrum.

Salzmann, D.↗
NASA NTRS1971

A statistical mechanical calculation of the thermodynamic properties of interstitial solid solutions involving second nearest neighbor interactions.

A previous calculation of the thermodynamic properties of interstitial solid solutions based on the technique of Kirkwood expansions has been extended to include the effects of second nearest neighbor solute atom mutual interactions. The error inherent in the first order (or quasi-chemical) counting of the degeneracy of the solution crystal is avoided. It is shown that, at high temperatures, even strong second nearest neighbor solute mutual interactions have a negligible effect on the entropy of the solution and a small, temperature-dependent effect on the solute partial enthalpy.

Alex, K.↗
NASA NTRS1977

Nearest-neighbor doublets in protein-coding regions of MS2 RNA

'Nearest neighbor' base pairs ('doublets') in the protein-coding regions of MS2 RNA have been tabulated with respect to their positions in the first two bases of amino acid codons, in the second two bases, or paired by contact between adjoining codons. Considerable variation is evident between numbers of doublets in each of these three possible positions, but the totals of each of the 16 doublets in the coding regions of the MS2 RNA molecule show much less variation. Compilations of doublets in nucleic acid strands have no predictive value for the amino acid composition of proteins coded by such strands.

Jukes, T. H.↗
NASA NTRS1995

Evaluation of nearest-neighbor methods for detection of chimeric small-subunit rRNA sequences

Detection of chimeric artifacts formed when PCR is used to retrieve naturally occurring small-subunit (SSU) rRNA sequences may rely on demonstrating that different sequence domains have different phylogenetic affiliations. We evaluated the CHECK_CHIMERA method of the Ribosomal Database Project and another method which we developed, both based on determining nearest neighbors of different sequence domains, for their ability to discern artificially generated SSU rRNA chimeras from authentic Ribosomal Database Project sequences. The reliability of both methods decreases when the parental sequences which contribute to chimera formation are more than 82 to 84% similar. Detection is also complicated by the occurrence of authentic SSU rRNA sequences that behave like chimeras. We developed a naive statistical test based on CHECK_CHIMERA output and used it to evaluate previously reported SSU rRNA chimeras. Application of this test also suggests that chimeras might be formed by retrieving SSU rRNAs as cDNA. The amount of uncertainty associated with nearest-neighbor analyses indicates that such tests alone are insufficient and that better methods are needed.

NASA Discipline Exobiology↗
NASA NTRSDate not supplied

Nearest-Neighbor Machine Learning Feature Selection for Interpretation of Microbial Molecular Signatures from Isotope Ratio Mass Spectrometry Data

Mass spectrometry (MS) promises to be a powerful tool for potential biosignature detection during astrobiological missions on ocean worlds in our solar system. Accurate and generalizable machine learning methods could enhance science return on investment by predicting seawater chemistry and classifying isotopic biosignatures, either as a signature consistent with microbial life (biotic) or as a novelty (unclassified/unique). However, machine learning models are likely to be complex and involve interactions between MS features, making biosignatures difficult to interpret. Feature selection methods provide biological and chemical context that help interpret the mechanisms of machine learning models, but these methods also need the ability to detect complex interactions. Previously, we developed a machine learning feature selection algorithm called nearest-neighbor projected distance regression (NPDR) that has the ability to identify important model features that involve complex interactions and automatically reduce correlation and the dimensionality in a high-dimensional variable space. The standard distance metrics used in NPDR – Manhattan and Euclidean – assume the multivariate data are isotropic, which is often violated in real data due to differences in the covariance between variables. Thus, we extend NPDR to include a random forest distance, and other anisotropic distance metrics, for computing nearest neighbors. We also augment the isotope-ratio MS data with time-series features from the raw MS signal to improve biotic classification. We test NPDR on our novel experimental ocean world seawater analog MS data. We measure isotope fractionations of volatile CO 2 that could be measured in exospheres or plumes. Samples include baseline abiotic conditions using a range of possible seawater chemistry consistent with Europa and Enceladus, and biotic samples that include microbes in these seawaters. We use penalized NPDR with random forest proximity to identify interpretable microbial molecular signatures. We compare features with random forest importance, and we train a classifier that discriminates between biotic and abiotic samples with high accuracy. These ML-trained ocean-world analog MS data could be used to assist in identifying biosignatures during future missions.

geochemistry↗
NASA NTRS2003

Ising model of cardiac thin filament activation with nearest-neighbor cooperative interactions

We have developed a model of cardiac thin filament activation using an Ising model approach from equilibrium statistical physics. This model explicitly represents nearest-neighbor interactions between 26 troponin/tropomyosin units along a one-dimensional array that represents the cardiac thin filament. With transition rates chosen to match experimental data, the results show that the resulting force-pCa (F-pCa) relations are similar to Hill functions with asymmetries, as seen in experimental data. Specifically, Hill plots showing (log(F/(1-F)) vs. log [Ca]) reveal a steeper slope below the half activation point (Ca(50)) compared with above. Parameter variation studies show interplay of parameters that affect the apparent cooperativity and asymmetry in the F-pCa relations. The model also predicts that Ca binding is uncooperative for low [Ca], becomes steeper near Ca(50), and becomes uncooperative again at higher [Ca]. The steepness near Ca(50) mirrors the steep F-pCa as a result of thermodynamic considerations. The model also predicts that the correlation between troponin/tropomyosin units along the one-dimensional array quickly decays at high and low [Ca], but near Ca(50), high correlation occurs across the whole array. This work provides a simple model that can account for the steepness and shape of F-pCa relations that other models fail to reproduce.

Evaluation Studies↗
NASA NTRS1984

Finite element computation on nearest neighbor connected machines

Research aimed at faster, more cost effective parallel machines and algorithms for improving designer productivity with finite element computations is discussed. A set of 8 boards, containing 4 nearest neighbor connected arrays of commercially available floating point chips and substantial memory, are inserted into a commercially available machine. One-tenth Mflop (64 bit operation) processors provide an 89% efficiency when solving the equations arising in a finite element problem for a single variable regular grid of size 40 by 40 by 40. This is approximately 15 to 20 times faster than a much more expensive machine such as a VAX 11/780 used in double precision. The efficiency falls off as faster or more processors are envisaged because communication times become dominant. A novel successive overrelaxation algorithm which uses cyclic reduction in order to permit data transfer and computation to overlap in time is proposed.

Mcaulay, A. D.↗
NASA NTRS1990

Morphological type correlation between nearest neighbor pairs of galaxies

Although the morphological type of galaxies is one of the most fundamental properties of galaxies, its origin and evolutionary processes, if any, are not yet fully understood. It has been established that the galaxy morphology strongly depends on the environment in which the galaxy resides (e.g., Dressler 1980). Galaxy pairs correspond to the smallest scales of galaxy clustering and may provide important clues to how the environment influences the formation and evolution of galaxies. Several investigators pointed out that there is a tendency for pair galaxies to have similar morphological types (Karachentsev and Karachentseva 1974, Page 1975, Noerdlinger 1979). Here, researchers analyze morphological type correlation for 18,364 nearest neighbor pairs of galaxies identified in the magnetic tape version of the Center for Astrophysics Redshift Catalogue.

Yamagata, Tomohiko↗
NASA NTRS2023

DESI Observations of the Andromeda Galaxy: Revealing the Immigration History of Our Nearest Neighbor

We present Dark Energy Spectroscopic Instrument (DESI) observations of the inner halo of M31, which reveal the kinematics of a recent merger—a galactic immigration event—in exquisite detail. Of the 11,416 sources studied in 3.75 hr of on-sky exposure time, 7438 are M31 sources with well-measured radial velocities. The observations reveal intricate coherent kinematic structure in the positions and velocities of individual stars: streams, wedges, and chevrons. While hints of coherent structures have been previously detected in M31, this is the first time they have been seen with such detail and clarity in a galaxy beyond the Milky Way. We find clear kinematic evidence for shell structures in the Giant Stellar Stream, the Northeast Shelf, and Western Shelf regions. The kinematics are remarkably similar to the predictions of dynamical models constructed to explain the spatial morphology of the inner halo. The results are consistent with the interpretation that much of the substructure in the inner halo of M31 is produced by a single galactic immigration event 1–2 Gyr ago. Significant numbers of metal-rich stars ([Fe/H] > − 0.5) are present in all of the detected substructures, suggesting that the immigrating galaxy had an extended star formation history. We also investigate the ability of the shells and Giant Stellar Stream to constrain the gravitational potential of M31, and estimate the mass within a projected radius of 125 kpc to be (log 10 ) (M NEW ) (<125 kpc)/(M ꙩ ) =(11.80 +0.12 −0.10 ). The results herald a new era in our ability to study stars on a galactic scale and the immigration histories of galaxies.

Arjun Dey↗
NASA NTRS2003

A Fast Implementation of the ISOCLUS Algorithm

Unsupervised clustering is a fundamental building block in numerous image processing applications. One of the most popular and widely used clustering schemes for remote sensing applications is the ISOCLUS algorithm, which is based on the ISODATA method. The algorithm is given a set of n data points in d-dimensional space, an integer k indicating the initial number of clusters, and a number of additional parameters. The general goal is to compute the coordinates of a set of cluster centers in d-space, such that those centers minimize the mean squared distance from each data point to its nearest center. This clustering algorithm is similar to another well-known clustering method, called k-means. One significant feature of ISOCLUS over k-means is that the actual number of clusters reported might be fewer or more than the number supplied as part of the input. The algorithm uses different heuristics to determine whether to merge lor split clusters. As ISOCLUS can run very slowly, particularly on large data sets, there has been a growing .interest in the remote sensing community in computing it efficiently. We have developed a faster implementation of the ISOCLUS algorithm. Our improvement is based on a recent acceleration to the k-means algorithm of Kanungo, et al. They showed that, by using a kd-tree data structure for storing the data, it is possible to reduce the running time of k-means. We have adapted this method for the ISOCLUS algorithm, and we show that it is possible to achieve essentially the same results as ISOCLUS on large data sets, but with significantly lower running times. This adaptation involves computing a number of cluster statistics that are needed for ISOCLUS but not for k-means. Both the k-means and ISOCLUS algorithms are based on iterative schemes, in which nearest neighbors are calculated until some convergence criterion is satisfied. Each iteration requires that the nearest center for each data point be computed. Naively, this requires O(kn) time, where k denotes the current number of centers. Traditional techniques for accelerating nearest neighbor searching involve storing the k centers in a data structure. However, because of the iterative nature of the algorithm, this data structure would need to be rebuilt with each new iteration. Our approach is to store the data points in a kd-tree data structure. The assignment of points to nearest neighbors is carried out by a filtering process, which successively eliminates centers that can not possibly be the nearest neighbor for a given region of space. This algorithm is significantly faster, because large groups of data points can be assigned to their nearest center in a single operation. Preliminary results on a number of real Landsat datasets show that our revised ISOCLUS-like scheme runs about twice as fast.

Memarsadeghi, Nargess↗
NASA NTRS1979

Explicit numerical formulas of improved stability and accuracy for the solution of parabolic equations

A class of explicit numerical formulas which involve next nearest neighbor as well as nearest neighbor points are explored in this paper. These formulas are formal approximations to the linear parabolic partial-differential equation of first order in time and second order in distance. It was found that some of these formulas can employ time steps as much as four times that for the conventional explicit technique without becoming unstable. Others showed improved accuracy for a given time step and spatial grid spacing. One formula achieved a steady-state solution of specified accuracy for an example problem in less than 4 percent of the total computational time required by the conventional explicit technique.

Olstad, W. B.↗