Search NASA⌕ Search

SEARCH · Search NASA

Results for “Euclidean”

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 55 records · Page 3
All sourcesNASA NTRSDOE OSTI
NASA NTRS2010

Time of Closest Approach in Three-Dimensional Airspace

In air traffic management, the aircraft separation requirement is defined by a minimum horizontal distance and a minimum vertical distance that the aircraft have to maintain. Since this requirement defines a cylinder around each aircraft rather than a sphere, the three-dimensional Euclidean distance does not provide an appropriate basis for the definition of time of closest approach. For instance, conflicting aircraft are not necessarily in loss of separation at the time of closest three-dimensional Euclidean distance. This paper proposes a definition of time of closest approach that characterizes conflicts in a three-dimensional airspace. The proposed time is defined as the time that minimizes a distance metric called cylindrical norm. An algorithm that computes the time of closest approach between two aircraft is provided and the formal verification of its main properties is reported.

Munoz, Cesar A.↗
NASA NTRS2011

Superpixel-Augmented Endmember Detection for Hyperspectral Images

Superpixels are homogeneous image regions comprised of several contiguous pixels. They are produced by shattering the image into contiguous, homogeneous regions that each cover between 20 and 100 image pixels. The segmentation aims for a many-to-one mapping from superpixels to image features; each image feature could contain several superpixels, but each superpixel occupies no more than one image feature. This conservative segmentation is relatively easy to automate in a robust fashion. Superpixel processing is related to the more general idea of improving hyperspectral analysis through spatial constraints, which can recognize subtle features at or below the level of noise by exploiting the fact that their spectral signatures are found in neighboring pixels. Recent work has explored spatial constraints for endmember extraction, showing significant advantages over techniques that ignore pixels relative positions. Methods such as AMEE (automated morphological endmember extraction) express spatial influence using fixed isometric relationships a local square window or Euclidean distance in pixel coordinates. In other words, two pixels covariances are based on their spatial proximity, but are independent of their absolute location in the scene. These isometric spatial constraints are most appropriate when spectral variation is smooth and constant over the image. Superpixels are simple to implement, efficient to compute, and are empirically effective. They can be used as a preprocessing step with any desired endmember extraction technique. Superpixels also have a solid theoretical basis in the hyperspectral linear mixing model, making them a principled approach for improving endmember extraction. Unlike existing approaches, superpixels can accommodate non-isometric covariance between image pixels (characteristic of discrete image features separated by step discontinuities). These kinds of image features are common in natural scenes. Analysts can substitute superpixels for image pixels during endmember analysis that leverages the spatial contiguity of scene features to enhance subtle spectral features. Superpixels define populations of image pixels that are independent samples from each image feature, permitting robust estimation of spectral properties, and reducing measurement noise in proportion to the area of the superpixel. This permits improved endmember extraction, and enables automated search for novel and constituent minerals in very noisy, hyperspatial images. This innovation begins with a graph-based segmentation based on the work of Felzenszwalb et al., but then expands their approach to the hyperspectral image domain with a Euclidean distance metric. Then, the mean spectrum of each segment is computed, and the resulting data cloud is used as input into sequential maximum angle convex cone (SMACC) endmember extraction.

Thompson, David R.↗
NASA NTRSDate not supplied

A Generalized, Compactly-Supported Correlation Function for Data Assimilation Applications

Correlation functions play an essential role in modern data assimilation, where they are used to model covariances given a set of tunable parameters or applied as tapering functions to localize covariances in ensemble-based schemes. One of the most widely-used correlation functions in data assimilation is the Gaspari and Cohn (1999) piecewise-rational, compactly-supported parametric correlation function (hereafter referred to as GC99). The GC99 correlation function is useful due to its tunable cut-off parameter c and Gaussian-like shape achieved when the parameter a is set to one-half. These properties are attractive for tapering functions in data assimilation applications. However, the GC99 correlation function is homogeneous over Euclidean 3-space and isotropic when restricted to the sphere, properties that may be less than ideal for some geophysical applications. GC99 is also compactly-supported on a sphere of fixed radius, which requires tuning of the cut-off parameter c that can depend on the specific application. This work presents a generalization of the GC99 correlation function that allows the cut-off parameter c and shape parameter a to vary over space to gain more flexibility in shape while maintaining its compact support property. The function, which we call the Generalized Gaspari Cohn (GenGC) correlation function, introduces inhomogeneity in Euclidean 3-space and anisotropy when restricted to the sphere by allowing both parameters c and a to vary, as functions, over the spatial domain. The GC99 correlation function is a special case of GenGC where the functions c and a are held constant, as fixed parameters rather than functions. The GenGC correlation function also generalizes the follow-on to the work of Gaspari and Cohn (1999) presented in Gaspari et al. (2006), which allowed a to vary while keeping c fixed. We illustrate through simple one- and two-dimensional examples the variety of inhomogeneous and anisotropic correlation functions GenGC can produce by varying c and a over space, and suggest applications where they may be useful in data assimilation, such as covariance modeling or localization. In particular, we describe how the GenGC correlation function can be used to construct covariances using correlation length and variance fields derived from dynamics. For example, the correlation length field for advective dynamics is governed by a partial differential equation (PDE) in N spatial dimensions, where N is the number of space dimensions of the state. Correlation length fields can be determined from this PDE and used with GenGC to construct the corresponding correlations. We can then approximate the full covariance by rescaling by the variance, which also satisfies a PDE in N spatial dimensions for advective dynamics. Thus we can approximate the full covariance without solving the covariance PDE, which is in 2N spatial dimensions, by solving just two PDEs each in only N spatial dimensions. This approach to evolving the correlation length and variance fields, then reconstructing the correlations using GenGC, is suggested as an alternative to current methods of covariance modeling in data assimilation algorithms.

GC99↗
NASA NTRS1968

Boundary Control Systems

Boundary conditions control systems described by partial differential equation in domain of Euclidean space analyzed for optimal controllability

Fattorini, H. O.↗