Search NASA⌕ Search

SEARCH · Search NASA

Results for “generalized algorithm”

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 1,045 records · Page 58

Mineral Dust Optical Properties for Remote Sensing and Global Modeling: A Review

Dust plays a key role in many Earth system processes and is ubiquitous in the Martian atmosphere. Various intensive field campaigns, laboratory analyses, space-based remote sensing missions, and global modeling efforts aim to characterize dust optical properties. This is a bountiful time for dust scientists, and yet the interpretation of retrievals and comparison to models remains complicated by various conflicting assumptions that are part of each algorithm. For example, the conversion of satellite radiance measurements into products like aerosol optical depth for model evaluation depends upon aerosol properties like particle size and shape that are often prescribed and not part of the retrieval. Conversely, the model calculation of aerosol optical depth often uses different assumptions. The goal of this review is to first document algorithmic assumptions by various satellite retrieval products and models, and identify where there is consistency and where there are differences. In general, the differences documented in this paper reflect uncertainties resulting from incomplete observational characterization of dust aerosols and limitations in our understanding. Second, we note what observations might reduce uncertainties in our knowledge and bring greater consistency to retrievals and models, allowing for a more rigorous and harmonious comparison. The lack of comprehensive and realistic shape models for dust is an outstanding issue, such that closure between forward modeling from particle refractive index, shape, and size and observed optical properties cannot be achieved. Limitations in the computational methods that must be applied to model scattering from complex shapes also makes accurate optical modeling for dust challenging. Field observations indicate the persistence of coarse and giant dust particles at higher altitudes and farther downwind from their source than previously expected. Remote sensing retrieval algorithms based on observations at visible wavelengths have limited sensitivity to these particles and generally do not consider them, although a recent product based on longwave radiances is encouraging. Current measurements of the refractive index of bulk dust and fundamental dust minerology components such as hematite vary widely, inhibiting attempts to represent the variability in dust optical properties and forcing, as expected from different major dust source regions on Earth that have varying mineralogical composition. Some remote sensing retrieval algorithms allow for limited refractive index variability in their inversion solutions through mixing with other fine mode aerosol models, or optimizing the single scattering albedo, but Earth system models surveyed for this paper assume a globally uniform, size-invariant refractive index. Although no Martian dust samples have yet been returned to Earth, remote sensing observations indicate that Martian dust is globally homogenous in composition, and a single spectral refractive index assumption has been widely adopted to represent Martian dust. The lack of comprehensive, statistically representative measurements of dust particle microphysical properties (size distribution, morphology, complex index of refraction spectra, internal structure heterogeneity), and the resulting optical properties, limits our ability to verify the fidelity of these assumptions. A chain of measurements is needed, ranging from characterizing individual dust mineralogy components (e.g., pure hematite and goethite) to in situ sampling of complex atmospheric aerosol mixtures. Such results could be applied to both remote sensing retrievals that characterize the optical properties of the total aerosol burden in the atmosphere from total radiance measurements, and to global models that represent the total aerosol burden in the atmosphere by building it up from the balance of individual aerosol sources and sinks.

Aeolian dust↗

Using parallel banded linear system solvers in generalized eigenvalue problems

Subspace iteration is a reliable and cost effective method for solving positive definite banded symmetric generalized eigenproblems, especially in the case of large scale problems. This paper discusses an algorithm that makes use of two parallel banded solvers in subspace iteration. A shift is introduced to decompose the banded linear systems into relatively independent subsystems and to accelerate the iterations. With this shift, an eigenproblem is mapped efficiently into the memories of a multiprocessor and a high speedup is obtained for parallel implementations. An optimal shift is a shift that balances total computation and communication costs. Under certain conditions, we show how to estimate an optimal shift analytically using the decay rate for the inverse of a banded matrix, and how to improve this estimate. Computational results on iPSC/2 and iPSC/860 multiprocessors are presented.

DISTRIBUTED MEMORY MULTIPROCES↗

A Fast Implementation of the ISOCLUS Algorithm

Unsupervised clustering is a fundamental tool in numerous image processing and remote sensing applications. For example, unsupervised clustering is often used to obtain vegetation maps of an area of interest. This approach is useful when reliable training data are either scarce or expensive, and when relatively little a priori information about the data is available. Unsupervised clustering methods play a significant role in the pursuit of unsupervised classification. 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 (or samples) 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 a set of cluster centers in d-space. Although there is no specific optimization criterion, the algorithm is similar in spirit to the well known k-means clustering method in which the objective is to minimize the average squared distance of each point to its nearest center, called the average distortion. One significant feature of ISOCLUS over k-means is that clusters may be merged or split, and so the final number of clusters may be different from the number k supplied as part of the input. This algorithm will be described in later in this paper. The ISOCLUS algorithm can run very slowly, particularly on large data sets. Given its wide use in remote sensing, its efficient computation is an important goal. We have developed a fast implementation of the ISOCLUS algorithm. Our improvement is based on a recent acceleration to the k-means algorithm, the filtering algorithm, by Kanungo et al.. They showed that, by storing the data in a kd-tree, it was possible to significantly reduce the running time of k-means. We have adapted this method for the ISOCLUS algorithm. For technical reasons, which are explained later, it is necessary to make a minor modification to the ISOCLUS specification. We provide empirical evidence, on both synthetic and Landsat image data sets, that our algorithm's performance is essentially the same as that of ISOCLUS, but with significantly lower running times. We show that our algorithm runs from 3 to 30 times faster than a straightforward implementation of ISOCLUS. Our adaptation of the filtering algorithm involves the efficient computation of a number of cluster statistics that are needed for ISOCLUS, but not for k-means.

Memarsadeghi, Nargess↗

Update on Bayesian Blocks: Segmented Models for Sequential Data

The Bayesian Block algorithm, in wide use in astronomy and other areas, has been improved in several ways. The model for block shape has been generalized to include other than constant signal rate - e.g., linear, exponential, or other parametric models. In addition the computational efficiency has been improved, so that instead of O(N**2) the basic algorithm is O(N) in most cases. Other improvements in the theory and application of segmented representations will be described.

Scargle, Jeff↗

Multirate sampled-data yaw-damper and modal suppression system design

A multirate control law synthesized algorithm based on an infinite-time quadratic cost function, was developed along with a method for analyzing the robustness of multirate systems. A generalized multirate sampled-data control law structure (GMCLS) was introduced. A new infinite-time-based parameter optimization multirate sampled-data control law synthesis method and solution algorithm were developed. A singular-value-based method for determining gain and phase margins for multirate systems was also developed. The finite-time-based parameter optimization multirate sampled-data control law synthesis algorithm originally intended to be applied to the aircraft problem was instead demonstrated by application to a simpler problem involving the control of the tip position of a two-link robot arm. The GMCLS, the infinite-time-based parameter optimization multirate control law synthesis method and solution algorithm, and the singular-value based method for determining gain and phase margins were all demonstrated by application to the aircraft control problem originally proposed for this project.

Berg, Martin C.↗

Clustering with Missing Values: No Imputation Required

Clustering algorithms can identify groups in large data sets, such as star catalogs and hyperspectral images. In general, clustering methods cannot analyze items that have missing data values. Common solutions either fill in the missing values (imputation) or ignore the missing data (marginalization). Imputed values are treated as just as reliable as the truly observed data, but they are only as good as the assumptions used to create them. In contrast, we present a method for encoding partially observed features as a set of supplemental soft constraints and introduce the KSC algorithm, which incorporates constraints into the clustering process. In experiments on artificial data and data from the Sloan Digital Sky Survey, we show that soft constraints are an effective way to enable clustering with missing values.

constraints↗

The dynamics and control of large flexible space structures X, part 1

The effect of delay in the control system input on the stability of a continuously acting controller which is designed without considering the delay is studied. The stability analysis of a second order plant is studied analytically and verified numerically. For this example it is found that the system becomes unstable for a delay which is equivalent to only 16 percent of its natural period of motion. It is also observed that even a small amount of natural damping in the system can increase the amount of delay that can be tolerated before the onset of instability. The delay problem is formulated in the discrete time domain and an analysis procedure suggested. The maximum principle from optimal control theory is applied to minimize the time required for the slewing of a general rigid spacecraft. The slewing motion need not be restricted to a single axis maneuver. The minimum slewing time is calculated based on a quasi-linearization algorithm for the resulting two point boundary value problem. Numerical examples based on the rigidized in-orbit model of the SCOLE also include the more general reflector line-of-sight slewing maneuvers.

Bainum, Peter M.↗

A Lanczos algorithm for vibration, suckling and termal analysis

This paper reviews an eigensolver algorithm based on the Lanczos Method for vibration, buckling and thermal analysis. The original code was written for inclusion in the Computational Mechanics Testbed (COMET), a general purpose finite element code. A portable version of the Lanczos code that is optimized for high-performance supercomputers has been developed. Special features of the algorithm include the capability to compute rigid body modes, thermal modes and Lanczos vectors that are derived from the applied load vector. The latter is necessary when using the Lanczos vectors as reduced-basis vectors in transient structural response and transient heat conduction calculations. The modularity of the code allows the user the option of including the most up-to-date utilities, such as the equation solver best suited for the application. The algorithm is discussed in detail and results of several applications are presented. Timing results for a vibration application indicate that the Lanczos algorithm is twenty times faster than the subspace iteration method which has been extensively used in the past.

Bostic, Susan W.↗

Comparison of different fractal dimension measuring algorithms for RE-TM M-O films

Noise in magneto-optical recording devices is discussed. In general, it appears that either the divider technique or amplitude spectrum technique may be used interchangeably to measure the fractal dimension (D) in the domain wall structure of ideal images. However, some caveats must be observed for best results. The divider technique is attractive for its simplicity and relatively modest computation requirements. However, it is sensitive to noise, in that noise pixels that touch the domain boundary are interpreted as being part of the boundary, skewing the measurement. Also, it is not useful in measuring nucleation-dominated films or domains that have significant amounts of structure within the interior of the domain wall. The amplitude spectrum method is more complex, and less intuitive than the divider method, and somewhat more expensive to implement computationally. However, since the camera noise tends to be white, the noise can be avoided in the measurement of D by avoiding that portion of the curve that is flat (due to the white noise) when the least squares line is fit to the plot. Also, many image processing software packages include a Fast Fourier Transformation (FFT) facility, while the user will most likely have to write his own edge extraction routine for the divider method. The amplitude spectrum method is a true two dimensional technique that probes the interior of the domain wall, and in fact, can measure arbitrary clusters of domains. It can also be used to measure grey-level images, further reducing processing steps needed to threshold the image.

Bernacki, Bruce E.↗

Practical input optimization for aircraft parameter estimation experiments

The object of this research was to develop an algorithm for the design of practical, optimal flight test inputs for aircraft parameter estimation experiments. A general, single pass technique was developed which allows global optimization of the flight test input design for parameter estimation using the principles of dynamic programming with the input forms limited to square waves only. Provision was made for practical constraints on the input, including amplitude constraints, control system dynamics, and selected input frequency range exclusions. In addition, the input design was accomplished while imposing output amplitude constraints required by model validity and considerations of safety during the flight test. The algorithm has multiple input design capability, with optional inclusion of a constraint that only one control move at a time, so that a human pilot can implement the inputs. It is shown that the technique can be used to design experiments for estimation of open loop model parameters from closed loop flight test data. The report includes a new formulation of the optimal input design problem, a description of a new approach to the solution, and a summary of the characteristics of the algorithm, followed by three example applications of the new technique which demonstrate the quality and expanded capabilities of the input designs produced by the new technique. In all cases, the new input design approach showed significant improvement over previous input design methods in terms of achievable parameter accuracies.

Morelli, Eugene A.↗

SAD5 Stereo Correlation Line-Striping in an FPGA

High precision SAD5 stereo computations can be performed in an FPGA (field-programmable gate array) at much higher speeds than possible in a conventional CPU (central processing unit), but this uses large amounts of FPGA resources that scale with image size. Of the two key resources in an FPGA, Slices and BRAM (block RAM), Slices scale linearly in the new algorithm with image size, and BRAM scales quadratically with image size. An approach was developed to trade latency for BRAM by sub-windowing the image vertically into overlapping strips and stitching the outputs together to create a single continuous disparity output. In stereo, the general rule of thumb is that the disparity search range must be 1/10 the image size. In the new algorithm, BRAM usage scales linearly with disparity search range and scales again linearly with line width. So a doubling of image size, say from 640 to 1,280, would in the previous design be an effective 4 of BRAM usage: 2 for line width, 2 again for disparity search range. The minimum strip size is twice the search range, and will produce an output strip width equal to the disparity search range. So assuming a disparity search range of 1/10 image width, 10 sequential runs of the minimum strip size would produce a full output image. This approach allowed the innovators to fit 1280 960 wide SAD5 stereo disparity in less than 80 BRAM, 52k Slices on a Virtex 5LX330T, 25% and 24% of resources, respectively. Using a 100-MHz clock, this build would perform stereo at 39 Hz. Of particular interest to JPL is that there is a flight qualified version of the Virtex 5: this could produce stereo results even for very large image sizes at 3 orders of magnitude faster than could be computed on the PowerPC 750 flight computer. The work covered in the report allows the stereo algorithm to run on much larger images than before, and using much less BRAM. This opens up choices for a smaller flight FPGA (which saves power and space), or for other algorithms in addition to SAD5 to be run on the same FPGA.

Villalpando, Carlos Y.↗

Retrieval of atmospheric water vapor profiles using radiometric measurements at 183 and 90 GHz

The algorithm developed by Wilheim (1990) dealt with the retrieval of water-vapor profiles from microwave radiometric measurements, even in the presence of clouds. This algorithm was tested using radiometric measurements at frequencies near 90 and 183 GHz; the results show that the retrieved water-vapor profiles were in general agreement with those derived from radiosonde data. In particular, retrieval over both land and ocean surfaces generated clouds at locations that could be verified from satellite photographs. The algorithm did not perform well where there were surface fronts. These clouds possibly contained ice particles as well as precipitating snow, which the algorithm was not expected to handle.

Lutz, Robert↗

A Generalized Approach to Aircraft Trajectory Prediction via Supervised Deep Learning

As research advances diverse forms and missions of aircraft, the National Airspace System (NAS) will become increasingly crowded, limiting current communications resources to accommodate aviation operations. Ongoing research proposes a paradigm of airspace communications, such that resources are autonomously and dynamically allocated via intelligent agents; this allocation requires accurate representations of the NAS, including the predicted positions of aircraft. State-of-the-art research emphasizes the importance of a hybrid-recurrent framework for trajectory prediction and compares the impact of commonly considered weather data on prediction accuracy. However, current research has been limited in its scope of efforts, frequently utilizing a unique flight route, architecture, set of weather data, and date range. This article considers the challenges of generalizing hybrid-recurrent predictive models for flight trajectories. Results illustrate an increase in error variance when identical models are trained over a generalized set of flights; this may be mitigated with careful tuning of hyperparameters, both in the network structure and optimization algorithms. Even so, an irreducible vertical error was identified, resulting from the complex takeoff and landing procedures which can not be correlated to functions of weather or additional assumptions of aircraft behavior. Finally, the use of a test route indicates that generalized models still do not possess sufficient knowledge for general aircraft predictions, with mean error increases ranging from 70-500%. These results illustrate the need for continued efforts on improving model versatility, as well as potential limitations for spectrum allocation near airports and other centers.

Nathan Schimpf↗

1D-Convolutional Neural Network Architecture for Generalized Time-Segmentation Tasks

Time segmentation of experimental data is a common and often difficult task. Consequently, it is of interest to automate this type of segmentation to reduce manual inputs, which are labor intensive and less consistent. However, simple thresholding algorithms are often insufficiently robust due either to noise or inconsistent data. This paper proposes a simple 1D convolutional neural net (CNN) architecture as a generalized solution for typical time segmentation tasks. The layer architecture, training methods, and methods for simple customization are described as well as the results of application to three separate arc jet data streams: facility condition segmentation, video highlight segmentation, and calorimeter time-series segmentation.

Machine learning↗

Preservation of Provenance and Context to Ensure Future Understandability of Airborne Earth Observations and Derived Data Products

Open-source science goes beyond making data from scientific projects (e.g., on-orbit/satellite missions, airborne and field investigations, and other data producing activities) openly available after they are generated, but involves and open sharing of information throughout the project lifecycle. Preservation of the data and associated information required for understanding and reusing the data well after the scientific projects is a contributor to open-source science as well. Considering the high investment in the on-orbit/satellite missions, we had developed a document titled “NASA Earth Science Data Preservation Content Specification (PCS)” in 2011. This document has been used as a requirement for recent on-orbit/satellite missions by NASA. Recently it became clear that the specifications should be applied to other scientific projects as well. Therefore, the document was revised to cover other types of projects, and a Preservation Content Implementation Guidance (PCIG) document was also developed. The revised PCS, and the PCIG, were published in 2022. The purpose of this presentation is to highlight the contents of these documents as they apply to suborbital/airborne investigations. The PCS calls for content preservation in eight general categories - Measuring Instrument/Platform Description, Instrument and Science Data Products and Metadata, Science Raw Data, Product and Algorithm Documentation, Instrument Calibration, Science Algorithm Software, Science Data Product Algorithm Inputs, Science Data Product Validation, and Science Data Access and Analysis Tools. While all these categories apply to various types of projects, a few clarifying sentences have been added to the descriptions of contents in each of the categories to show which categories are especially important to airborne and field investigations and where some contents are not applicable (or difficult to obtain). The PCIG document provides some general guidance applicable to all types of projects and specific guidance in a separate section for airborne and field investigations. This section calls out typical artifacts produced during such investigations that can meet the spirit of the various PCS categories.

remote sensing↗

REQUEST: A Recursive QUEST Algorithm for Sequential Attitude Determination

In order to find the attitude of a spacecraft with respect to a reference coordinate system, vector measurements are taken. The vectors are pairs of measurements of the same generalized vector, taken in the spacecraft body coordinates, as well as in the reference coordinate system. We are interested in finding the best estimate of the transformation between these coordinate system.s The algorithm called QUEST yields that estimate where attitude is expressed by a quarternion. Quest is an efficient algorithm which provides a least squares fit of the quaternion of rotation to the vector measurements. Quest however, is a single time point (single frame) batch algorithm, thus measurements that were taken at previous time points are discarded. The algorithm presented in this work provides a recursive routine which considers all past measurements. The algorithm is based on on the fact that the, so called, K matrix, one of whose eigenvectors is the sought quaternion, is linerly related to the measured pairs, and on the ability to propagate K. The extraction of the appropriate eigenvector is done according to the classical QUEST algorithm. This stage, however, can be eliminated, and the computation simplified, if a standard eigenvalue-eigenvector solver algorithm is used. The development of the recursive algorithm is presented and illustrated via a numerical example.

Bar-Itzhack, Itzhack Y.↗

Boundary conditions for implicit solutions to the compressible Navier-Stokes equations in finite computational domains

The admissible boundary conditions for the unsteady Navier-Stokes equations are insufficient to determine completely the flow variables at grid points on the boundaries of a finite computational domain. A general method is presented in which the boundary conditions are supplemented by conservatively differenced forms of the flow equations. For implicit algorithms, the method provides a fully implicit coupling between boundary and interior points. Implicit boundary-point computation schemes are given for most types of flow boundary encountered in internal and external flow problems. Convergence to steady state is generally faster than with locally explicit boundary-point schemes.

Thomas, P. D.↗

Multistep integration formulas for the numerical integration of the satellite problem

The use of two Class 2/fixed mesh/fixed order/multistep integration packages of the PECE type for the numerical integration of the second order, nonlinear, ordinary differential equation of the satellite orbit problem. These two methods are referred to as the general and the second sum formulations. The derivation of the basic equations which characterize each formulation and the role of the basic equations in the PECE algorithm are discussed. Possible starting procedures are examined which may be used to supply the initial set of values required by the fixed mesh/multistep integrators. The results of the general and second sum integrators are compared to the results of various fixed step and variable step integrators.

Lundberg, J. B.↗