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 451 records · Page 25

Reducing Surface Clutter in Cloud Profiling Radar Data

An algorithm has been devised to reduce ground clutter in the data products of the CloudSat Cloud Profiling Radar (CPR), which is a nadir-looking radar instrument, in orbit around the Earth, that measures power backscattered by clouds as a function of distance from the instrument. Ground clutter contaminates the CPR data in the lowest 1 km of the atmospheric profile, heretofore making it impossible to use CPR data to satisfy the scientific interest in studying clouds and light rainfall at low altitude. The algorithm is based partly on the fact that the CloudSat orbit is such that the geodetic altitude of the CPR varies continuously over a range of approximately 25 km. As the geodetic altitude changes, the radar timing parameters are changed at intervals defined by flight software in order to keep the troposphere inside a data-collection time window. However, within each interval, the surface of the Earth continuously "scans through" (that is, it moves across) a few range bins of the data time window. For each radar profile, only few samples [one for every range-bin increment ((Delta)r = 240 m)] of the surface-clutter signature are available around the range bin in which the peak of surface return is observed, but samples in consecutive radar profiles are offset slightly (by amounts much less than (Delta)r) with respect to each other according to the relative change in geodetic altitude. As a consequence, in a case in which the surface area under examination is homogenous (e.g., an ocean surface), a sequence of consecutive radar profiles of the surface in that area contains samples of the surface response with range resolution (Delta)p much finer than the range-bin increment ((Delta)p << r). Once the high-resolution surface response has thus become available, the profile of surface clutter can be accurately estimated by use of a conventional maximum-correlation scheme: A translated and scaled version of the high-resolution surface response is fitted to the observed low-resolution profile. The translation and scaling factors that optimize the fit in a maximum-correlation sense represent (1) the true position of the surface relative to the sampled surface peak and (2) the magnitude of the surface backscatter. The performance of this algorithm has been tested on CloudSat data acquired over an ocean surface. A preliminary analysis of the test data showed a surface-clutter-rejection ratio over flat surfaces of >10 dB and a reduction of the contaminated altitude over ocean from about 1 km to about 0.5 km (over the ocean). The algorithm has been embedded in CloudSat L1B processing as of Release 04 (July 2007), and the estimated flat surface clutter is removed in L2B-GEOPROF product from the observed profile of reflectivity (see CloudSat product documentation for details and performance at http://www.cloudsat.cira.colostate.edu/ dataSpecs.php?prodid=1).

Tanelli, Simone↗

Eyjafjallajokull Volcano Plume Particle-Type Characterization from Space-Based Multi-angle Imaging

The Multi-angle Imaging SpectroRadiometer (MISR) Research Aerosol algorithm makes it possible to study individual aerosol plumes in considerable detail. From the MISR data for two optically thick, near-source plumes from the spring 2010 eruption of the Eyjafjallaj kull volcano, we map aerosol optical depth (AOD) gradients and changing aerosol particle types with this algorithm; several days downwind, we identify the occurrence of volcanic ash particles and retrieve AOD, demonstrating the extent and the limits of ash detection and mapping capability with the multi-angle, multi-spectral imaging data. Retrieved volcanic plume AOD and particle microphysical properties are distinct from background values near-source, as well as for overwater cases several days downwind. The results also provide some indication that as they evolve, plume particles brighten, and average particle size decreases. Such detailed mapping offers context for suborbital plume observations having much more limited sampling. The MISR Standard aerosol product identified similar trends in plume properties as the Research algorithm, though with much smaller differences compared to background, and it does not resolve plume structure. Better optical analogs of non-spherical volcanic ash, and coincident suborbital data to validate the satellite retrieval results, are the factors most important for further advancing the remote sensing of volcanic ash plumes from space.

Kahn, Ralph A.↗

Extensions of the space trajectories error analysis programs

A generalized covariance analysis technique which permits the study of the sensitivity of linear estimation algorithms to errors in a priori statistics has been developed and programed. Several sample cases are presented to illustrate the use of this technique. Modifications to the Simulated Trajectories Error Analysis Program (STEAP) to enable targeting a multiprobe mission of the Planetary Explorer type are discussed. The logic for the mini-probe targeting is presented. Finally, the initial phases of the conversion of the Viking mission Lander Trajectory Reconstruction (LTR) program for use on Venus missions is discussed. An integrator instability problem is discussed and a solution proposed.

Adams, G. L.↗

Digital-computer normal shock position and restart control of a Mach 2.5 axisymmetric mixed-compression inlet

Digital computer control of a mixed-compression inlet is discussed. The inlet was terminated with a choked orifice at the compressor face station to dynamically simulate a turbojet engine. Inlet diffuser exit airflow disturbances were used. A digital version of a previously tested analog control system was used for both normal shock and restart control. Digital computer algorithms were derived using z-transform and finite difference methods. Using a sample rate of 1000 samples per second, the digital normal shock and restart controls essentially duplicated the inlet analog computer control results. At a sample rate of 100 samples per second, the control system performed adequately but was less stable.

Neiner, G. H.↗

Spline smoothing of histograms by linear programming

An algorithm for an approximating function to the frequency distribution is obtained from a sample of size n. To obtain the approximating function a histogram is made from the data. Next, Euclidean space approximations to the graph of the histogram using central B-splines as basis elements are obtained by linear programming. The approximating function has area one and is nonnegative.

Bennett, J. O.↗

Transfer-function-parameter estimation from frequency response data: A FORTRAN program

A FORTRAN computer program designed to fit a linear transfer function model to given frequency response magnitude and phase data is presented. A conjugate gradient search is used that minimizes the integral of the absolute value of the error squared between the model and the data. The search is constrained to insure model stability. A scaling of the model parameters by their own magnitude aids search convergence. Efficient computer algorithms result in a small and fast program suitable for a minicomputer. A sample problem with different model structures and parameter estimates is reported.

Seidel, R. C.↗

Satellite-derived surface energy balance estimates in the Alaskan sub-Arctic

The capabilities of the heat capacity mapping mission (HCMM) satellite are described, together with the numerical model used for data analysis. The HCMM carries the HCM radiometer for remote sensing in the visible and 0.55-1.1 micron wavelength regions, as well as in the 10.5-12.5 micron interval, with the swath being 720 km and each pixel being a square 500 m on a side. The HCMM is intended to aid in hydrological studies of soil moisture, runoff, and evapotranspiration estimates. Data are taken of the albedos and temperatures of vegetation, assuming that all reflection is diffuse. Corrections are made in the algorithm to account for sun angle and the spacecraft distance from the earth. Sample calculations are provided from scans of a coastal plain, mountains, and plateaus of Alaska.

Gurney, R. J.↗

A space-time stochastic model of rainfall for satellite remote-sensing studies

A model of the spatial and temporal distribution of rainfall is described that produces random spatial rainfall patterns with these characteristics: (1) the model is defined on a grid with each grid point representing the average rain rate over the surrounding grid box, (2) rain occurs at any one grid point, on average, a specified percentage of the time and has a lognormal probability distribution, (3) spatial correlation of the rainfall can be arbitrarily prescribed, and (4) time stepping is carried out so that large-scale features persist longer than small-scale features. Rain is generated in the model from the portion of a correlated Gaussian random field that exceeds a threshold. The portion of the field above the threshold is rescaled to have a lognormal probability distribution. Sample output of the model designed to mimic radar observations of rainfall during the Global Atmospheric Research Program Atlantic Tropical Experiment (GATE), is shown. The model is intended for use in evaluating sampling strategies for satellite remote-sensing of rainfall and for development of algorithms for converting radiant intensity received by an instrument from its field of view into rainfall amount.

Bell, Thomas L.↗

An algorithmic approach to crustal deformation analysis

In recent years the analysis of crustal deformation measurements has become important as a result of current improvements in geodetic methods and an increasing amount of theoretical and observational data provided by several earth sciences. A first-generation data analysis algorithm which combines a priori information with current geodetic measurements was proposed. Relevant methods which can be used in the algorithm were discussed. Prior information is the unifying feature of this algorithm. Some of the problems which may arise through the use of a priori information in the analysis were indicated and preventive measures were demonstrated. The first step in the algorithm is the optimal design of deformation networks. The second step in the algorithm identifies the descriptive model of the deformation field. The final step in the algorithm is the improved estimation of deformation parameters. Although deformation parameters are estimated in the process of model discrimination, they can further be improved by the use of a priori information about them. According to the proposed algorithm this information must first be tested against the estimates calculated using the sample data only. Null-hypothesis testing procedures were developed for this purpose. Six different estimators which employ a priori information were examined. Emphasis was put on the case when the prior information is wrong and analytical expressions for possible improvements under incompatible prior information were derived.

Iz, Huseyin Baki↗

On the optimality of code options for a universal noiseless coder

A universal noiseless coding structure was developed that provides efficient performance over an extremely broad range of source entropy. This is accomplished by adaptively selecting the best of several easily implemented variable length coding algorithms. Custom VLSI coder and decoder modules capable of processing over 20 million samples per second are currently under development. The first of the code options used in this module development is shown to be equivalent to a class of Huffman code under the Humblet condition, other options are shown to be equivalent to the Huffman codes of a modified Laplacian symbol set, at specified symbol entropy values. Simulation results are obtained on actual aerial imagery, and they confirm the optimality of the scheme. On sources having Gaussian or Poisson distributions, coder performance is also projected through analysis and simulation.

Yeh, Pen-Shu↗

Lock detection in Costas loops

Previous analyses of lock detector algorithms for Costas loops have ignored the effects of the inherent correlation between samples of the phase error process. In this paper, both analysis and simulations are used to quantify the effects of phase correlation on lock detection for the 'square law' and 'absolute value' type detectors. Results are obtained which depict the lock detection probability as a function of loop signal-to-noise ratio for a given false alarm rate. It is shown that the square law detector experiences less degradation due to phase jitter than the absolute value detector and that the degradation in detector signal-to-noise ratio is more pronounced for squarewave than for sinewave signals.

Mileant, A.↗

Solution of free-boundary problems using finite-element/Newton methods and locally refined grids - Application to analysis of solidification microstructure

A new method is presented for the solution of free-boundary problems using Lagrangian finite element approximations defined on locally refined grids. The formulation allows for direct transition from coarse to fine grids without introducing non-conforming basis functions. The calculation of elemental stiffness matrices and residual vectors are unaffected by changes in the refinement level, which are accounted for in the loading of elemental data to the global stiffness matrix and residual vector. This technique for local mesh refinement is combined with recently developed mapping methods and Newton's method to form an efficient algorithm for the solution of free-boundary problems, as demonstrated here by sample calculations of cellular interfacial microstructure during directional solidification of a binary alloy.

Tsiveriotis, K.↗

Application of MAC-Europe AVIRIS data to the analysis of various alteration stages in the Landdmannalauger Hydrothermal Area (South Iceland)

In June 1991 extensive airborne remote sensing data-sets have been acquired over Iceland in the framework of the joint NASA/ESA Multisensor Airborne Campaign Europe (MAC-Europe). The study area is located within the Torfajokull central volcanic complex in South Iceland. This complex is composed by anomalously abundant rhyolitic acid volcanics, which underwent intensive hydrothermal alteration. Detailed studies of surface alteration of rhyolitic rocks in the area showed that all the major elements are leached as the rock is affected by complex mineralogical changes. Montmorillonite appears during the earliest stages of alteration. In the ultimate alteration product montmorillonite is absent and the rock consists mostly of amorphous silica, anatase, up to a volume of 50% kaolinite and variable amounts of native sulphur and pyrite. The case study presented shall endeavor to assess the potential of MAC-Europe AVIRIS and TMS data in determining a possible zonation of hydrothermal alteration in relationship to the active geo-thermal fields and structural features. To this end, the airborne data is analysed in comparison with laboratory spectral measurements of characteristics rock, soil, and vegetation samples collected in the study areaduring the summer of 1992. Various spectral mapping algorithms as well as unmixing approaches are tested and evaluated. Detailed geological and structural mapping as well as geochemical analysis of the main rock and soil types were performed to underpin the analysis of the airborne data.

Sommer, S.↗

Detecting Faults By Use Of Hidden Markov Models

Frequency of false alarms reduced. Faults in complicated dynamic system (e.g., antenna-aiming system, telecommunication network, or human heart) detected automatically by method of automated, continuous monitoring. Obtains time-series data by sampling multiple sensor outputs at discrete intervals of t and processes data via algorithm determining whether system in normal or faulty state. Algorithm implements, among other things, hidden first-order temporal Markov model of states of system. Mathematical model of dynamics of system not needed. Present method is "prior" method mentioned in "Improved Hidden-Markov-Model Method of Detecting Faults" (NPO-18982).

Smyth, Padhraic J.↗

Rule groupings in expert systems

Currently, expert system shells do not address software engineering issues for developing or maintaining expert systems. As a result, large expert systems tend to be incomprehensible, difficult to debug or modify, and almost impossible to verify or validate Partitioning rule-based systems into rule groups which reflect the underlying subdomains of the problem should enhance the comprehensibility, maintainability, and reliability of expert-system software. In this paper, we investigate methods to semi-automatically structure a CLIPS rule base e into groups of rules that carry related information. We discuss three different distance metrics for measuring the relatedness of rules and describe two clustering algorithms based on these distance metrics. The results of our experiment with three sample rule bases are also presented.

Mehrotra, Mala↗

Monitoring of Time-Dependent System Profiles by Multiplex Gas Chromatography with Maximum Entropy Demodulation

The maximum entropy technique was successfully applied to the deconvolution of overlapped chromatographic peaks. An algorithm was written in which the chromatogram was represented as a vector of sample concentrations multiplied by a peak shape matrix. Simulation results demonstrated that there is a trade off between the detector noise and peak resolution in the sense that an increase of the noise level reduced the peak separation that could be recovered by the maximum entropy method. Real data originated from a sample storage column was also deconvoluted using maximum entropy. Deconvolution is useful in this type of system because the conservation of time dependent profiles depends on the band spreading processes in the chromatographic column, which might smooth out the finer details in the concentration profile. The method was also applied to the deconvolution of previously interpretted Pioneer Venus chromatograms. It was found in this case that the correct choice of peak shape function was critical to the sensitivity of maximum entropy in the reconstruction of these chromatograms.

Becker, Joseph F.↗

Software for Partly Automated Recognition of Targets

The Feature Analyst is a computer program for assisted (partially automated) recognition of targets in images. This program was developed to accelerate the processing of high-resolution satellite image data for incorporation into geographic information systems (GIS). This program creates an advanced user interface that embeds proprietary machine-learning algorithms in commercial image-processing and GIS software. A human analyst provides samples of target features from multiple sets of data, then the software develops a data-fusion model that automatically extracts the remaining features from selected sets of data. The program thus leverages the natural ability of humans to recognize objects in complex scenes, without requiring the user to explain the human visual recognition process by means of lengthy software. Two major subprograms are the reactive agent and the thinking agent. The reactive agent strives to quickly learn the user's tendencies while the user is selecting targets and to increase the user's productivity by immediately suggesting the next set of pixels that the user may wish to select. The thinking agent utilizes all available resources, taking as much time as needed, to produce the most accurate autonomous feature-extraction model possible.

Opitz, David↗

Software for Partly Automated Recognition of Targets

The Feature Analyst is a computer program for assisted (partially automated) recognition of targets in images. This program was developed to accelerate the processing of high-resolution satellite image data for incorporation into geographic information systems (GIS). This program creates an advanced user interface that embeds proprietary machine-learning algorithms in commercial image-processing and GIS software. A human analyst provides samples of target features from multiple sets of data, then the software develops a data-fusion model that automatically extracts the remaining features from selected sets of data. The program thus leverages the natural ability of humans to recognize objects in complex scenes, without requiring the user to explain the human visual recognition process by means of lengthy software. Two major subprograms are the reactive agent and the thinking agent. The reactive agent strives to quickly learn the user s tendencies while the user is selecting targets and to increase the user s productivity by immediately suggesting the next set of pixels that the user may wish to select. The thinking agent utilizes all available resources, taking as much time as needed, to produce the most accurate autonomous feature-extraction model possible.

Opitz, David↗