Search NASA⌕ Search

SEARCH · Search NASA

Results for “sampling 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 361 records · Page 20

Image gathering and processing - Information and fidelity

In this paper we formulate and use information and fidelity criteria to assess image gathering and processing, combining optical design with image-forming and edge-detection algorithms. The optical design of the image-gathering system revolves around the relationship among sampling passband, spatial response, and signal-to-noise ratio (SNR). Our formulations of information, fidelity, and optimal (Wiener) restoration account for the insufficient sampling (i.e., aliasing) common in image gathering as well as for the blurring and noise that conventional formulations account for. Performance analyses and simulations for ordinary optical-design constraints and random scences indicate that (1) different image-forming algorithms prefer different optical designs; (2) informationally optimized designs maximize the robustness of optimal image restorations and lead to the highest-spatial-frequency channel (relative to the sampling passband) for which edge detection is reliable (if the SNR is sufficiently high); and (3) combining the informationally optimized design with a 3 by 3 lateral-inhibitory image-plane-processing algorithm leads to a spatial-response shape that approximates the optimal edge-detection response of (Marr's model of) human vision and thus reduces the data preprocessing and transmission required for machine vision.

Huck, F. O.↗

Runtime Verification with State Estimation

We introduce the concept of Runtime Verification with State Estimation and show how this concept can be applied to estimate theprobability that a temporal property is satisfied by a run of a program when monitoring overhead is reduced by sampling. In such situations, there may be gaps in the observed program executions, thus making accurate estimation challenging. To deal with the effects of sampling on runtime verification, we view event sequences as observation sequences of a Hidden Markov Model (HMM), use an HMM model of the monitored program to "fill in" sampling-induced gaps in observation sequences, and extend the classic forward algorithm for HMM state estimation (which determines the probability of a state sequence, given an observation sequence) to compute the probability that the property is satisfied by an execution of the program. To validate our approach, we present a case study based on the mission software for a Mars rover. The results of our case study demonstrate high prediction accuracy for the probabilities computed by our algorithm. They also show that our technique is much more accurate than simply evaluating the temporal property on the given observation sequences, ignoring the gaps.

sampling↗

Tracking algorithms using log-polar mapped image coordinates

The use of log-polar image sampling coordinates rather than conventional Cartesian coordinates offers a number of advantages for visual tracking and docking of space vehicles. Pixel count is reduced without decreasing the field of view, with commensurate reduction in peripheral resolution. Smaller memory requirements and reduced processing loads are the benefits in working environments where bulk and energy are at a premium. Rotational and zoom symmetries of log-polar coordinates accommodate range and orientation extremes without computational penalties. Separation of radial and rotational coordinates reduces the complexity of several target centering algorithms, described below.

Weiman, Carl F. R.↗

Compliance matrices for cracked bodies

An algorithm is developed to construct the compliance matrix for a cracked solid in the integral-equation formulation of two-dimensional linear-elastic fracture mechanics. The integral equation is reduced to a system of algebraic equations for unknown values of the dislocation-density function at discrete points on the interval from -1 to 1, using the numerical procedure described by Gerasoulis (1982). Sample numerical results are presented, and it is suggested that the algorithm is especially useful in cases where iterative solutions are required; e.g., models of fiber-reinforced concrete, rocks, or ceramics where microcracking, fiber bridging, and other nonlinear effects are treated as nonlinear springs along the crack surfaces (Ballarini et al., 1984).

Ballarini, R.↗

Mapping small-scale vegetation changes in Mexico

This research attempts to map small-scale vegetation changes in Mexico. Forty-eight weeks of coarse resolution Advanced Very High Resolution Radiometer Normalized Difference Vegetation Index (NDVI), a digitized climax vegetation map, land cover samples from space shuttle photographs and actual vegetation samples were used as inputs. Principal components analyses and a clustering algorithm were applied to the NDVI data to generate a single layer that was stratified by the climax vegetation zones map. The purpose is to create a new layer that differentiates climax vegetation (hypothesized potential vegetation) from non-climax vegetation land covers. One of the keys to developing a present-day vegetation map was differentiating intrazone land covers based on the stratification; as great as 75% of the sampled land cover types differed from the climax vegetation. The present-day vegetation map achieved 80% classification accuracy when calculated from available ground reference data. About 55% of the temperate zones and 37% of the tropical zones were found to contain original climax vegetation. Most changes coincide with areas of major agricultural activity.

Turcotte, Kevin M.↗

Aerocapture Guidance Algorithm Comparison Campaign

The aerocapture is a promising technique for the future human interplanetary missions. The Mars Sample Return was initially based on an insertion by aerocapture. A CNES orbiter Mars Premier was developed to demonstrate this concept. Mainly due to budget constraints, the aerocapture was cancelled for the French orbiter. A lot of studies were achieved during the three last years to develop and test different guidance algorithms (APC, EC, TPC, NPC). This work was shared between CNES and NASA, with a fruitful joint working group. To finish this study an evaluation campaign has been performed to test the different algorithms. The objective was to assess the robustness, accuracy, capability to limit the load, and the complexity of each algorithm. A simulation campaign has been specified and performed by CNES, with a similar activity on the NASA side to confirm the CNES results. This evaluation has demonstrated that the numerical guidance principal is not competitive compared to the analytical concepts. All the other algorithms are well adapted to guaranty the success of the aerocapture. The TPC appears to be the more robust, the APC the more accurate, and the EC appears to be a good compromise.

Rousseau, Stephane↗

Orbital Trade Study for the PREFIRE Mission

The Polar Radiant Energy in the Far-Infrared Experiment (PREFIRE) is a low-cost cubesat-based Earth Science mission selected for rapid implementation through NASAs Earth Ventures-Instrument program. Two cubesats carrying thermal infrared spectrometers (TIRS) in polar orbits will test long-held assumptions regarding radiative balance at long wavelengths where the cold-dry Arctic and Antarctic surfaces expel significant amounts of the earth's radiant energy. Thermal radiometry with better than one micron sampling at wavelengths beyond 15 microns will provide critical observational bounds for inputs into glacier melt and climate change models through improvements in surface emissivities, longwave greenhouse effect parameterizations, and cloud presence/types. Additional information on potential far-infrared surface/atmosphere feedbacks during rapid melt processes may be captured with sub-diurnal revisits of targeted areas. A baseline mission with two cubesats in different orbits provides a means for optimization of sub-diurnal sampling for science purposes. In this presentation we provide details of orbit studies that inform expected sampling metrics. Candidate orbits are modeled in SGP and then TIRS sampling is projected into surface footprints with appropriate geo-location. Matching algorithms then compile statistics for time-delayed revisits between and within the two orbits. Binning of results by latitude allows for abstraction of precession issues as well as for correlations with surface types as defined by radiometric classification schemes. Multiple acceptable pairs of science-driven orbits were found that optimize sampling in areas known to experience rapid melt events. The final choice of PREFIRE orbital parameters includes the systems trade-space, particularly the power budget, as well as the availability of launch opportunities.

"L'Ecuyer, Tristan"↗

Uncertainty in Satellite Rainfall Estimates: Time Series Comparison

We examined nine satellite rainfall algorithms and compared the rain fields produced from these algorithms for the period of August 1987 to December 1988. Preliminary results show algorithms which use the same satellite sensor data tend to be similar, suggesting the importance of sampling. Oceanic global mean rainfall ranges from 2.7 to 3.6 mm/d. The variability in zonal mean rain rate is about 1.5-2 mm/d for these algorithms.

Chang, Alfred T. C.↗

Algorithm Development for Predicting Biodiversity Based on Phytoplankton Absorption

Ocean color remote sensing has provided the scientific community with unprecedented global coverage of chlorophyll a, an indicator of phytoplankton biomass. Together, satellite-derived chlorophyll a and knowledge of Phytoplankton Functional Types (PFTs) will improve our limited understanding of marine ecosystem responses to physiochemical climate drivers involved in carbon cycle dynamics and linkages. Using cruise data from the Gulf of Maine and the Middle Atlantic Bight (N 269 pairs of HPLC and phytoplankton absorption samples), two modeling approaches were utilized to predict phytoplankton absorption and pigments. Algorithm I predicts the chlorophyll-specific absorption coefficient (a*(sub ph) (m(exp 2) mg chl a(exp - 1)) using inputs of temperature, light, and chlorophyll a. Modeled r(exp 2) values (400700 nm) ranged from 0.79 to 0.99 when compared to in situ observations with approximately 25 percent lower r(exp 2) values in the UV region. Algorithm II-a utilizes matrix inversion analysis to predict a(sub ph)(m(exp -1), 400700 nm) and r(exp 2) values ranged from 0.89 to 0.99. The prediction of phytoplankton pigments with Algorithm II-b produced r(exp 2) values that ranged from 0.40 to 0.93. When used in combination, Algorithm I, and Algorithm II-a are able to use satellite products of SST, PAR, and chlorophyll a (Algorithm I) to predict pigment concentrations and ratios to describe the phytoplankton community. The results of this study demonstrate that the spatial variation in modeled pigment ratios differ significantly from the 10-year SeaWiFS average chlorophyll a data set. Contiguous observations of chlorophyll a and phytoplankton biodiversity will elucidate ecosystem responses with unprecedented complexity.

phytoplankton↗

Nonparametric probability density estimation by optimization theoretic techniques

Two nonparametric probability density estimators are considered. The first is the kernel estimator. The problem of choosing the kernel scaling factor based solely on a random sample is addressed. An interactive mode is discussed and an algorithm proposed to choose the scaling factor automatically. The second nonparametric probability estimate uses penalty function techniques with the maximum likelihood criterion. A discrete maximum penalized likelihood estimator is proposed and is shown to be consistent in the mean square error. A numerical implementation technique for the discrete solution is discussed and examples displayed. An extensive simulation study compares the integrated mean square error of the discrete and kernel estimators. The robustness of the discrete estimator is demonstrated graphically.

Scott, D. W.↗

Spectral analysis using CCDs

Charge-coupled devices (CCDs) are ideally suited for performing sampled-data transversal filtering operations in the analog domain. Two algorithms have been identified for performing spectral analysis in which the bulk of the computation can be performed in a CCD transversal filter; the chirp z-transform and the prime transform. CCD implementation of both these transform algorithms is presented together with performance data and applications.

Hewes, C. R.↗

A Computer Program for the Calculation of Three-Dimensional Transonic Nacelle/Inlet Flowfields

A highly efficient computer analysis was developed for predicting transonic nacelle/inlet flowfields. This algorithm can compute the three dimensional transonic flowfield about axisymmetric (or asymmetric) nacelle/inlet configurations at zero or nonzero incidence. The flowfield is determined by solving the full-potential equation in conservative form on a body-fitted curvilinear computational mesh. The difference equations are solved using the AF2 approximate factorization scheme. This report presents a discussion of the computational methods used to both generate the body-fitted curvilinear mesh and to obtain the inviscid flow solution. Computed results and correlations with existing methods and experiment are presented. Also presented are discussions on the organization of the grid generation (NGRIDA) computer program and the flow solution (NACELLE) computer program, descriptions of the respective subroutines, definitions of the required input parameters for both algorithms, a brief discussion on interpretation of the output, and sample cases to illustrate application of the analysis.

Vadyak, J.↗

Speed test results and hardware/software study of computational speed problem, appendix D

The HP9845C is a desktop computer which is tested and evaluated for processing speed. A study was made to determine the availability and approximate cost of computers and/or hardware accessories necessary to meet the 20 ms sample period speed requirements. Additional requirements were that the control algorithm could be programmed in a high language and that the machine have sufficient storage to store the data from a complete experiment.

Source record↗

Absolute classification with unsupervised clustering

An absolute classification algorithm is proposed in which the class definition through training samples or otherwise is required only for a particular class of interest. The absolute classification is considered as a problem of unsupervised clustering when one cluster is known initially. The definitions and statistics of the other classes are automatically developed through the weighted unsupervised clustering procedure, which is developed to keep the cluster corresponding to the class of interest from losing its identity as the class of interest. Once all the classes are developed, a conventional relative classifier such as the maximum-likelihood classifier is used in the classification.

Jeon, Byeungwoo↗

Formulation for Simultaneous Aerodynamic Analysis and Design Optimization

An efficient approach for simultaneous aerodynamic analysis and design optimization is presented. This approach does not require the performance of many flow analyses at each design optimization step, which can be an expensive procedure. Thus, this approach brings us one step closer to meeting the challenge of incorporating computational fluid dynamic codes into gradient-based optimization techniques for aerodynamic design. An adjoint-variable method is introduced to nullify the effect of the increased number of design variables in the problem formulation. The method has been successfully tested on one-dimensional nozzle flow problems, including a sample problem with a normal shock. Implementations of the above algorithm are also presented that incorporate Newton iterations to secure a high-quality flow solution at the end of the design process. Implementations with iterative flow solvers are possible and will be required for large, multidimensional flow problems.

Hou, G. W.↗

A Comparison of Techniques for Scheduling Fleets of Earth-Observing Satellites

Earth observing satellite (EOS) scheduling is a complex real-world domain representative of a broad class of over-subscription scheduling problems. Over-subscription problems are those where requests for a facility exceed its capacity. These problems arise in a wide variety of NASA and terrestrial domains and are .XI important class of scheduling problems because such facilities often represent large capital investments. We have run experiments comparing multiple variants of the genetic algorithm, hill climbing, simulated annealing, squeaky wheel optimization and iterated sampling on two variants of a realistically-sized model of the EOS scheduling problem. These are implemented as permutation-based methods; methods that search in the space of priority orderings of observation requests and evaluate each permutation by using it to drive a greedy scheduler. Simulated annealing performs best and random mutation operators outperform our squeaky (more intelligent) operator. Furthermore, taking smaller steps towards the end of the search improves performance.

Globus, Al↗

First International Diagnosis Competition - DXC'09

A framework to compare and evaluate diagnosis algorithms (DAs) has been created jointly by NASA Ames Research Center and PARC. In this paper, we present the first concrete implementation of this framework as a competition called DXC 09. The goal of this competition was to evaluate and compare DAs in a common platform and to determine a winner based on diagnosis results. 12 DAs (model-based and otherwise) competed in this first year of the competition in 3 tracks that included industrial and synthetic systems. Specifically, the participants provided algorithms that communicated with the run-time architecture to receive scenario data and return diagnostic results. These algorithms were run on extended scenario data sets (different from sample set) to compute a set of pre-defined metrics. A ranking scheme based on weighted metrics was used to declare winners. This paper presents the systems used in DXC 09, description of faults and data sets, a listing of participating DAs, the metrics and results computed from running the DAs, and a superficial analysis of the results.

Kurtoglu, tolga↗