SEARCH · Search NASA

Results for “optimal spatial search”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

36 records · Page 2

All sources NASA NTRS DOE OSTI

NASA NTRS1981

Incorporating spatial context into statistical classification of multidimensional image data

Compound decision theory is employed to develop a general statistical model for classifying image data using spatial context. The classification algorithm developed from this model exploits the tendency of certain ground-cover classes to occur more frequently in some spatial contexts than in others. A key input to this contextural classifier is a quantitative characterization of this tendency: the context function. Several methods for estimating the context function are explored, and two complementary methods are recommended. The contextural classifier is shown to produce substantial improvements in classification accuracy compared to the accuracy produced by a non-contextural uniform-priors maximum likelihood classifier when these methods of estimating the context function are used. An approximate algorithm, which cuts computational requirements by over one-half, is presented. The search for an optimal implementation is furthered by an exploration of the relative merits of using spectral classes or information classes for classification and/or context function estimation.

Bauer, M. E.↗

NASA NTRS2026

Remote Sensing-Driven Hydrodynamic Modeling in Data-Scarce Regions: Integrating ICESat-2, Sentinel-2, SWOT and Re-analysis Models for Coastal Monitoring

Hydrodynamic models in coastal and estuarine systems are typically constrained by sparse bathymetry, boundary, and validation data, especially in regions where field campaigns are costly or impractical. Here we develop and test a fully satellite-driven framework for hydrodynamic modeling in South Africa’s Langebaan Lagoon without using any local in situ measurements. Bathymetry is derived by training multispectral Sentinel-2 reflectance against ICESat-2 ATL24 photon-derived depths using an XGBoost model optimized with Bayesian search. The final satellite-derived bathymetry reproduces independent ATL24 points with RMSE = 0.45 m and R 2 = 0.97. This bathymetry was used in a depth-averaged Delft3D Flexible Mesh model driven at the open boundary by TPXO tidal harmonics and by ERA5 winds. We validate modeled water surface elevation against 16 SWOT low-rate (250 m, unsmoothed) passes in 2023. SWOT–model comparisons yield an overall RMSE of 0.11 m and R 2 = 0.61, with typical point differences <0.10 m (∼7% of the 1.5 m tidal range), and showed consistent spatial gradients in water level from the offshore boundary, through Saldanha Bay, and into the lagoon. At the offshore boundary, TPXO and SWOT sea surface heights agree closely (R 2 = 0.86). A simple phase adjustment of ∼26,min between TPXO and SWOT lowers the RMSE from 0.18,m to 0.11,m, showing that phase offset accounts for some of the discrepancy, with additional errors likely linked to non-tidal signals. Our results demonstrate that combining passive optical, photon-counting LiDAR, radar interferometry, and global tidal/atmospheric models enables robust, transferrable hydrodynamic modeling in data-scarce coastal systems, offering a cost-effective pathway for monitoring.

ICESat-2↗

NASA NTRS1987

Recursive inverse kinematics for robot arms via Kalman filtering and Bryson-Frazier smoothing

This paper applies linear filtering and smoothing theory to solve recursively the inverse kinematics problem for serial multilink manipulators. This problem is to find a set of joint angles that achieve a prescribed tip position and/or orientation. A widely applicable numerical search solution is presented. The approach finds the minimum of a generalized distance between the desired and the actual manipulator tip position and/or orientation. Both a first-order steepest-descent gradient search and a second-order Newton-Raphson search are developed. The optimal relaxation factor required for the steepest descent method is computed recursively using an outward/inward procedure similar to those used typically for recursive inverse dynamics calculations. The second-order search requires evaluation of a gradient and an approximate Hessian. A Gauss-Markov approach is used to approximate the Hessian matrix in terms of products of first-order derivatives. This matrix is inverted recursively using a two-stage process of inward Kalman filtering followed by outward smoothing. This two-stage process is analogous to that recently developed by the author to solve by means of spatial filtering and smoothing the forward dynamics problem for serial manipulators.

Rodriguez, G.↗

NASA NTRS1995

Searching for patterns in remote sensing image databases using neural networks

We have investigated a method, based on a successful neural network multispectral image classification system, of searching for single patterns in remote sensing databases. While defining the pattern to search for and the feature to be used for that search (spectral, spatial, temporal, etc.) is challenging, a more difficult task is selecting competing patterns to train against the desired pattern. Schemes for competing pattern selection, including random selection and human interpreted selection, are discussed in the context of an example detection of dense urban areas in Landsat Thematic Mapper imagery. When applying the search to multiple images, a simple normalization method can alleviate the problem of inconsistent image calibration. Another potential problem, that of highly compressed data, was found to have a minimal effect on the ability to detect the desired pattern. The neural network algorithm has been implemented using the PVM (Parallel Virtual Machine) library and nearly-optimal speedups have been obtained that help alleviate the long process of searching through imagery.

Paola, Justin D.↗

NASA NTRS1992

Uncertainty management by relaxation of conflicting constraints in production process scheduling

Mathematical-analytical methods as used in Operations Research approaches are often insufficient for scheduling problems. This is due to three reasons: the combinatorial complexity of the search space, conflicting objectives for production optimization, and the uncertainty in the production process. Knowledge-based techniques, especially approximate reasoning and constraint relaxation, are promising ways to overcome these problems. A case study from an industrial CIM environment, namely high-grade steel production, is presented to demonstrate how knowledge-based scheduling with the desired capabilities could work. By using fuzzy set theory, the applied knowledge representation technique covers the uncertainty inherent in the problem domain. Based on this knowledge representation, a classification of jobs according to their importance is defined which is then used for the straightforward generation of a schedule. A control strategy which comprises organizational, spatial, temporal, and chemical constraints is introduced. The strategy supports the dynamic relaxation of conflicting constraints in order to improve tentative schedules.

Dorn, Juergen↗

NASA NTRS1990

Pyramid image codes

All vision systems, both human and machine, transform the spatial image into a coded representation. Particular codes may be optimized for efficiency or to extract useful image features. Researchers explored image codes based on primary visual cortex in man and other primates. Understanding these codes will advance the art in image coding, autonomous vision, and computational human factors. In cortex, imagery is coded by features that vary in size, orientation, and position. Researchers have devised a mathematical model of this transformation, called the Hexagonal oriented Orthogonal quadrature Pyramid (HOP). In a pyramid code, features are segregated by size into layers, with fewer features in the layers devoted to large features. Pyramid schemes provide scale invariance, and are useful for coarse-to-fine searching and for progressive transmission of images. The HOP Pyramid is novel in three respects: (1) it uses a hexagonal pixel lattice, (2) it uses oriented features, and (3) it accurately models most of the prominent aspects of primary visual cortex. The transform uses seven basic features (kernels), which may be regarded as three oriented edges, three oriented bars, and one non-oriented blob. Application of these kernels to non-overlapping seven-pixel neighborhoods yields six oriented, high-pass pyramid layers, and one low-pass (blob) layer.

Watson, Andrew B.↗

NASA NTRS2011

Design Considerations for a Dedicated Gravity Recovery Satellite Mission Consisting of Two Pairs of Satellites

Future satellite missions dedicated to measuring time-variable gravity will need to address the concern of temporal aliasing errors; i.e., errors due to high-frequency mass variations. These errors have been shown to be a limiting error source for future missions with improved sensors. One method of reducing them is to fly multiple satellite pairs, thus increasing the sampling frequency of the mission. While one could imagine a system architecture consisting of dozens of satellite pairs, this paper explores the more economically feasible option of optimizing the orbits of two pairs of satellites. While the search space for this problem is infinite by nature, steps have been made to reduce it via proper assumptions regarding some parameters and a large number of numerical simulations exploring appropriate ranges for other parameters. A search space originally consisting of 15 variables is reduced to two variables with the utmost impact on mission performance: the repeat period of both pairs of satellites (shown to be near-optimal when they are equal to each other), as well as the inclination of one of the satellite pairs (the other pair is assumed to be in a polar orbit). To arrive at this conclusion, we assume circular orbits, repeat groundtracks for both pairs of satellites, a 100-km inter-satellite separation distance, and a minimum allowable operational satellite altitude of 290 km based on a projected 10-year mission lifetime. Given the scientific objectives of determining time-variable hydrology, ice mass variations, and ocean bottom pressure signals with higher spatial resolution, we find that an optimal architecture consists of a polar pair of satellites coupled with a pair inclined at 72deg, both in 13-day repeating orbits. This architecture provides a 67% reduction in error over one pair of satellites, in addition to reducing the longitudinal striping to such a level that minimal post-processing is required, permitting a substantial increase in the spatial resolution of the gravity field products. It should be emphasized that given different sets of scientific objectives for the mission, or a different minimum allowable satellite altitude, different architectures might be selected.

Wiese, D. N.↗

NASA NTRS2017

Development of Multi-Sensor Global Cloud and Radiance Composites for DSCOVR EPIC Imager with Subpixel Definition

The Deep Space Climate Observatory (DSCOVR) enables analysis of the daytime Earth radiation budget via the onboard Earth Polychromatic Imaging Camera (EPIC) and National Institute of Standards and Technology Advanced Radiometer (NISTAR). EPIC delivers adequate spatial resolution imagery but only in shortwave bands (317-780 nm), while NISTAR measures the top-of-atmosphere (TOA) whole-disk radiance in shortwave and longwave broadband windows. Accurate calculation of albedo and outgoing longwave flux requires a high-resolution scene identification such as the radiance observations and cloud properties retrievals from low earth orbit (LEO, including NASA Terra and Aqua MODIS, Suomi-NPP VIIRS, and NOAA AVHRR) and geosynchronous (GEO, including GOES east and west, METEOSAT, INSAT-3D, MTSAT-2, and Himawari-8) satellite imagers. The cloud properties are derived using the Clouds and the Earth's Radiant Energy System (CERES) mission Cloud Subsystem group algorithms. These properties have to be co-located with EPIC pixels to provide the scene identification and to select anisotropic directional models (ADMs), which are then used to adjust the NISTAR-measured radiance and subsequently obtain the global daytime shortwave and longwave fluxes. This work presents an algorithm for optimal merging of selected radiance and cloud property parameters derived from multiple satellite imagers to obtain seamless global hourly composites at 5-km resolution. Selection of satellite data for each 5-km pixel is based on an aggregated rating that incorporates five parameters: nominal satellite resolution, pixel time relative to the EPIC time, viewing zenith angle, distance from day/night terminator, and probability of sun glint. To provide a smoother transition in the merged output, in regions where candidate pixel data from two satellite sources have comparable aggregated rating, the selection decision is defined by the cumulative function of the normal distribution so that abrupt changes in the visual appearance of the composite data are avoided. Higher spatial accuracy in the composite product is achieved by using the inverse mapping with gradient search during reprojection and bicubic interpolation for pixel resampling.

Khlopenkov, Konstantin V.↗

NASA NTRS1992

A spatial data handling system for retrieval of images by unrestricted regions of user interest

The Intelligent Data Management (IDM) project at NASA/Goddard Space Flight Center has prototyped an Intelligent Information Fusion System (IIFS), which automatically ingests metadata from remote sensor observations into a large catalog which is directly queryable by end-users. The greatest challenge in the implementation of this catalog was supporting spatially-driven searches, where the user has a possible complex region of interest and wishes to recover those images that overlap all or simply a part of that region. A spatial data management system is described, which is capable of storing and retrieving records of image data regardless of their source. This system was designed and implemented as part of the IIFS catalog. A new data structure, called a hypercylinder, is central to the design. The hypercylinder is specifically tailored for data distributed over the surface of a sphere, such as satellite observations of the Earth or space. Operations on the hypercylinder are regulated by two expert systems. The first governs the ingest of new metadata records, and maintains the efficiency of the data structure as it grows. The second translates, plans, and executes users' spatial queries, performing incremental optimization as partial query results are returned.

Dorfman, Erik↗

NASA NTRS2016

Streamlining the Design Tradespace for Earth Imaging Constellations

Science Data Processing↗

NASA NTRS1988

Spatial compression of Seasat SAR imagery

The results of a study of techniques for spatial compression of synthetic-aperture-radar (SAR) imagery are summarized. Emphasis is on image-data volume reduction for archive and online storage applications while preserving the image resolution and radiometric fidelity. A quantitative analysis of various techniques, including vector quantization (VQ) and adaptive discrete cosine transform (ADCT), is presented. Various factors such as compression ratio, algorithm complexity, and image quality are considered in determining the optimal algorithm. The compression system requirements are established for electronic access of an online archive system based on the results of a survey of the science community. The various algorithms are presented and their results evaluated considering the effects of speckle noise and the wide dynamic range inherent in SAR imagery. The conclusion is that although the ADCT produces the best signal-to-distortion-noise ratio for a given compression ratio, the two-level tree-searched VQ technique is preferred due to its simplicity of decoding and near-optimal performance.

Chang, C. Y.↗

NASA NTRS2017

Navigating the Deployment and Downlink Tradespace for Earth Imaging Constellations

Distributed Spacecraft Missions (DSMs) are gaining momentum in their application to Earth Observation (EO) missions owing to their unique ability to increase observation sampling in spatial, spectral, angular and temporal dimensions simultaneously. DSM design includes a much larger number of variables than its monolithic counterpart, therefore, Model-Based Systems Engineering (MBSE) has been often used for preliminary mission concept designs, to understand the trade-offs and interdependencies among the variables. MBSE models are complex because the various objectives a DSM is expected to achieve are almost always conflicting, non-linear and rarely analytical. NASA Goddard Space Flight Center (GSFC) is developing a pre-Phase A tool called Tradespace Analysis Tool for Constellations (TAT-C) to initiate constellation mission design. The tool will allow users to explore the tradespace between various performance, cost and risk metrics (as a function of their science mission) and select Pareto optimal architectures that meet their requirements. This paper will describe the different types of constellations that TAT-C’s Tradespace Search Iterator is capable of enumerating (homogeneous Walker, heterogeneous Walker, precessing type, ad-hoc) and their impact on key performance metrics such as revisit statistics, time to global access and coverage. We will also discuss the ability to simulate phased deployment of the given constellations, as a function of launch availabilities and/or vehicle capability, and show the impact on performance. All performance metrics are calculated by the Data Reduction and Metric Computation module within TAT-C, which issues specific requests and processes results from the Orbit and Coverage module. Our TSI is also capable of generating tradespaces for downlinking imaging data from the constellation, based on permutations of available ground station networks - known (default) or customized (by the user). We will show the impact of changing ground station options for any given constellation, on data latency and required communication bandwidth, which in turn determines the responsiveness of the space system.

Nag, Sreeja↗

NASA NTRS2010

Searching for Turbulent Spectra in Mutliple Spacecraft Observations

The subject of magnetohydrodynamic simulations in the 1980's, magnetic turbulence has reemerged as a favored explanation for the production of fast magnetic reconnection. Recent three-dimensional simulations reveal the formation of secondary islands that serve to shorten the current sheet and increase the accelerating electric field, while both simulations and observations witness electron holes whose collapse energizes electrons. However, little work has been done to investigate the presence of turbulent magnetic and electric field spectra in association with in situ reconnection observations in space. In this study we address this deficiency by analyzing the wavelength spectra of two reconnection events established by multiple spacecraft observations in previous publications. We apply a k-filtering analysis to determine the wave vectors. To optimize the quality of the k-filtering analysis and minimize aliasing, we select multi-spacecraft observations having optimal spacecraft tetrahedral geometry and dimensions that resolve wavelengths within the ion diffusion region. We have chosen one dayside and one nightside reconnection event each observed by the Cluster spacecraft. Spatial correlation between the reconnecting current sheet and a turbulent magnetic spectrum supports an association between turbulence and reconnection in space. The k-filtering method, a wavelet time-frequency spectrum, and a polarization analysis serve to identify wave modes associated with the turbulence. A calculation of the reconnection electric field based on the normal component of the reconnecting magnetic field provides an estimate of the reconnection rate.

Wendel, Deirdre E.↗

NASA NTRS1985

A Residuals Approach to Filtering, Smoothing and Identification for Static Distributed Systems

An approach for state estimation and identification of spatially distributed parameters embedded in static distributed (elliptic) system models is advanced. The method of maximum likelihood is used to find parameter values that maximize a likelihood functional for the system model, or equivalently, that minimize the negative logarithm of this functional. To find the minimum, a Newton-Raphson search is conducted that from an initial estimate generates a convergent sequence of parameter estimates. For simplicity, a Gauss-Markov approach is used to approximate the Hessian in terms of products of first derivatives. The gradient and approximate Hessian are computed by first arranging the negative log likelihood functional into a form based on the square root factorization of the predicted covariance of the measurement process. The resulting data processing approach, referred to here by the new term of predicted data covariance square root filtering, makes the gradient and approximate Hessian calculations very simple. A closely related set of state estimates is also produced by the maximum likelihood method: smoothed estimates that are optimal in a conditional mean sense and filtered estimates that emerge from the predicted data covariance square root filter.

Rodriguez, G.↗

NASA NTRS2016

TAT-C: A Trade-Space Analysis Tool for Constellations

Under a changing technological and economic environment, there is growing interest in implementing future NASA Earth Science missions as Distributed Spacecraft Missions (DSM). The objective of our project is to provide a framework that facilitates DSM Pre-Phase A investigations and optimizes DSM designs with respect to a-priori Science goals. In this first version of our Trade-space Analysis Tool for Constellations (TAT-C), we are investigating questions such as: Which type of constellations should be chosen? How many spacecraft should be included in the constellation? Which design has the best costrisk value? This paper describes the overall architecture of TAT-C including: a User Interface (UI) interacting with multiple users - scientists, missions designers or program managers; an Executive Driver gathering requirements from UI and formulating Trade-space Search Requests for the Trade-space Search Iterator, which in collaboration with the Orbit Coverage, Reduction Metrics, and Cost Risk modules generates multiple potential architectures and their associated characteristics. UI will include Graphical, Command Line and Application Programmer Interfaces to respond to the demands of various levels of users expertise. Science inputs are grouped into various mission concepts, satellite specifications, and payload specifications, while science outputs are grouped into several types of metrics - spatial, temporal, angular and radiometric. Orbit Coverage leverages the use of the Goddard Mission Analysis Tool (GMAT) to compute coverage and ancillary data that are passed to Reduction Metrics. Then, for each architecture design, Cost Risk will provide estimates of the cost and life cycle cost as well as technical and cost risk of the proposed mission. Additionally, the Knowledge Base module is a centralized store of structured data readable by humans and machines. It will support both TAT-C analysis when composing new mission concepts from existing model inputs, and TAT-C exploration when discovering new mission concepts by querying previous results.

Science Data Processing↗

NASA NTRS1994

An implementation of a tree code on a SIMD, parallel computer

We describe a fast tree algorithm for gravitational N-body simulation on SIMD parallel computers. The tree construction uses fast, parallel sorts. The sorted lists are recursively divided along their x, y and z coordinates. This data structure is a completely balanced tree (i.e., each particle is paired with exactly one other particle) and maintains good spatial locality. An implementation of this tree-building algorithm on a 16k processor Maspar MP-1 performs well and constitutes only a small fraction (approximately 15%) of the entire cycle of finding the accelerations. Each node in the tree is treated as a monopole. The tree search and the summation of accelerations also perform well. During the tree search, node data that is needed from another processor is simply fetched. Roughly 55% of the tree search time is spent in communications between processors. We apply the code to two problems of astrophysical interest. The first is a simulation of the close passage of two gravitationally, interacting, disk galaxies using 65,636 particles. We also simulate the formation of structure in an expanding, model universe using 1,048,576 particles. Our code attains speeds comparable to one head of a Cray Y-MP, so single instruction, multiple data (SIMD) type computers can be used for these simulations. The cost/performance ratio for SIMD machines like the Maspar MP-1 make them an extremely attractive alternative to either vector processors or large multiple instruction, multiple data (MIMD) type parallel computers. With further optimizations (e.g., more careful load balancing), speeds in excess of today's vector processing computers should be possible.

Olson, Kevin M.↗

NASA NTRS2005

The Optimization of Trained and Untrained Image Classification Algorithms for Use on Large Spatial Datasets

The HARVIST project seeks to automatically provide an accurate, interactive interface to predict crop yield over the entire United States. In order to accomplish this goal, large images must be quickly and automatically classified by crop type. Current trained and untrained classification algorithms, while accurate, are highly inefficient when operating on large datasets. This project sought to develop new variants of two standard trained and untrained classification algorithms that are optimized to take advantage of the spatial nature of image data. The first algorithm, harvist-cluster, utilizes divide-and-conquer techniques to precluster an image in the hopes of increasing overall clustering speed. The second algorithm, harvistSVM, utilizes support vector machines (SVMs), a type of trained classifier. It seeks to increase classification speed by applying a "meta-SVM" to a quick (but inaccurate) SVM to approximate a slower, yet more accurate, SVM. Speedups were achieved by tuning the algorithm to quickly identify when the quick SVM was incorrect, and then reclassifying low-confidence pixels as necessary. Comparing the classification speeds of both algorithms to known baselines showed a slight speedup for large values of k (the number of clusters) for harvist-cluster, and a significant speedup for harvistSVM. Future work aims to automate the parameter tuning process required for harvistSVM, and further improve classification accuracy and speed. Additionally, this research will move documents created in Canvas into ArcGIS. The launch of the Mars Reconnaissance Orbiter (MRO) will provide a wealth of image data such as global maps of Martian weather and high resolution global images of Mars. The ability to store this new data in a georeferenced format will support future Mars missions by providing data for landing site selection and the search for water on Mars.

Kocurek, Michael J.↗

NASA NTRS1994

Locating buildings in aerial photos

Algorithms and techniques for use in the identification and location of large buildings in digitized copies of aerial photographs are developed and tested. The building data would be used in the simulation of objects located in the vicinity of an airport that may be detected by aircraft radar. Two distinct approaches are considered. Most building footprints are rectangular in form. The first approach studied is to search for right-angled corners that characterize rectangular objects and then to connect these corners to complete the building. This problem is difficult because many nonbuilding objects, such as street corners, parking lots, and ballparks often have well defined corners which are often difficult to distinguish from rooftops. Furthermore, rooftops come in a number of shapes, sizes, shadings, and textures which also limit the discrimination task. The strategy used linear sequences of different samples to detect straight edge segments at multiple angles and to determine when these segments meet at approximately right-angles with respect to each other. This technique is effective in locating corners. The test image used has a fairly rectangular block pattern oriented about thirty degrees clockwise from a vertical alignment, and the overall measurement data reflect this. However, this technique does not discriminate between buildings and other objects at an operationally suitable rate. In addition, since multiple paths are tested for each image pixel, this is a time consuming task. The process can be speeded up by preprocessing the image to locate the more optimal sampling paths. The second approach is to rely on a human operator to identify and select the building objects and then to have the computer determine the outline and location of the selected structures. When presented with a copy of a digitized aerial photograph, the operator uses a mouse and cursor to select a target building. After a button on the mouse is pressed, with the cursor fully within the perimeter of the building, the program scans from the position of the cursor to a perimeter position where a shift in grayscale is detected. Once at the perimeter, the process traces along it, around the building, until it eventually returns to the perimeter starting point. Spatial resolution limits cause the perimeter trace to be somewhat course so that a line straightening algorithm is employed. One result is that the building corner positions become more distinctly defined.

Green, James S.↗