SEARCH · Search NASA

Results for “Smoothing 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.

SourceResearch connectionFrom yearThrough year

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

At least 91 records · Page 5

All sources NASA NTRS DOE OSTI

NASA NTRS1988

Rational-Spline Subroutines

Smooth curves drawn among plotted data easily. Rational-Spline Approximation with Automatic Tension Adjustment algorithm leads to flexible, smooth representation of experimental data. "Tension" denotes mathematical analog of mechanical tension in spline or other mechanical curve-fitting tool, and "spline" as denotes mathematical generalization of tool. Program differs from usual spline under tension, allows user to specify different values of tension between adjacent pairs of knots rather than constant tension over entire range of data. Subroutines use automatic adjustment scheme that varies tension parameter for each interval until maximum deviation of spline from line joining knots less than or equal to amount specified by user. Procedure frees user from drudgery of adjusting individual tension parameters while still giving control over local behavior of spline.

Schiess, James R.↗

NASA NTRS1970

Simple data-smoothing and noise-suppression technique

Algorithm, based on the Borel method of summing divergent sequences, is used for smoothing noisy data where knowledge of frequency content is not required. Technique's effectiveness is demonstrated by a series of graphs.

Duty, R. L.↗

NASA NTRS2006

Microwave Signatures of Snow on Sea Ice: Modeling

Accurate knowledge of snow-depth distribution over sea ice is critical for polar climate studies. Current snow-depth-over-sea-ice retrieval algorithms do not sufficiently account for variations in snow and ice physical properties that can affect the accuracy of retrievals. For this reason, airborne microwave observations were coordinated with ground-based measurements of snow depth and snow properties in the vicinity of Barrow, AK, in March 2003. In this paper, the effects of snowpack properties and ice conditions on microwave signatures are examined using detailed surface-based measurements and airborne observations in conjunction with a thermal microwave-emission model. A comparison of the Microwave Emission Model of Layered Snowpacks (MEMLS) simulations with detailed snowpack and ice data from stakes along the Elson Lagoon and the Beaufort Sea and ra- 'diometer data taken from low-level flights using a Polarimetric Scanning Radiometer (PSR-A) shows that MEMLS can be used to simulate snow on sea ice and is a useful tool for understanding the limitations of the snow-depth algorithm. Analysis of radiance data taken over the Elson Lagoon and the Beaufort Sea using MEMLS suggests that the radiometric differences between the two locations are due to the differences in sea-ice emissivity. Furthermore, measured brightness temperatures suggest that the current snow-depth retrieval algorithm is sufficient for areas of smooth first-year sea ice, whereas new algorithm coefficients are needed for rough first-year sea ice. Snowpack grain size and density remain an unresolved issue for snow-depth retrievals using passive-microwave radiances.

Powell, D. C.↗

NASA NTRS1992

The cool-star spectral catalog: A uniform collection of IUE SWP-LOs

Over the past decade and a half of its operations, the International Ultraviolet Explorer has recorded low-dispersion spectrograms in the 1150-2000 A interval of more than 800 stars of late spectral type (F-M). The sub-2000 A region contains a number of emission lines that are key diagnostics of physical conditions in the high-excitation chromospheres and subcoronal 'transition zones' of such stars. Many of the sources have been observed a number of times, and the available collection of SWP-LO exposures in the IUE Archives exceeds 4,000. With support from the Astrophysics Data Program, we have assembled the archival material into a catalog of IUE far-UV fluxes of late-type stars. In order to ensure uniform processing of the spectra, we: (1) photometrically corrected the raw vidicon images with a custom version of the 1985 SWP ITF; (2) identified and eliminated, sharp cosmic-ray 'hits' by means of a spatial filter; (3) extracted the spectral traces with the 'optimal' (weighted-slit) strategy; and (4) calibrated them against a well-characterized reference source, the DA white dwarf G191-B2B. Our approach is similar to that adopted by the IUE Project for its 'Final Archive', but our implementation is specialized to the case of chromospheric emission-line sources. We measured the resulting SWP-LO spectra using a semi-autonomous algorithm that establishes a smooth continuum by numerical filtering, and then fits the significant emissions (or absorptions) by means of a constrained Bevington-type multiple-Gaussian procedure. The algorithm assigns errors to the fitted fluxes - or upper limits in the absence of a significant detection - according to a model based on careful measurements of the noise properties of the IUE's intensified SEC cameras. Here, we describe the 'visualization' strategies we adopted to ensure human-review of the semi-autonomous processing and measuring algorithms; the derivation of the noise model and the assignment of errors; and the structure of the final catalog as delivered to the Astrophysics Data System.

Ayres, T.↗

NASA NTRS2001

Identification of Surface and Near Surface Defects and Damage Evaluation by Laser Speckle Techniques

As a part of the grant activity, a laboratory was established within the Department of Electrical Engineering for the study for measurements of surface defects and damage evaluation. This facility has been utilized for implementing several algorithms for accurate measurements of defects. Experiments were conducted using simulated images and multiple images were fused to achieve accurate measurements. During the nine months of the grants when the principal investigator was transferred in my name, experiments were conducted using simulated synthetic aperture radar (SAR) images. This proved useful when several algorithms were used on images of smooth objects with minor deformalities. Given the time constraint, the derived algorithms could not be applied to actual images of smooth objects with minor abnormalities.

Gowda, Chandrakanth H.↗

NASA NTRS1991

Implementation and control of a 3 degree-of-freedom force-reflecting manual controller

An implementation of a manual controller system is described in which a parallel 3-DOF spherical structure (for compactness and reduced weight) is combined with high-gear-ratio reducers using a force control algorithm to produce a 'power steering' effect for enhanced smoothness and transparency. The force control algorithm has the further benefit of minimizing the effect of the system friction and nonlinear inertia forces. The required analyses for a universal force-reflecting manual controller application are presented, as are test results for a prototype system.

Kim, Whee K.↗

NASA NTRS1993

Generating Smooth Motions For Robotic Manipulators

In improved method for generating trajectory of robotic manipulator, each straight-line segment of trajectory composed of constant-velocity main portion sandwiched between smooth acceleration at start and smooth deceleration at finish. Algorithm implementing method computes velocity in each accelerating portion as sinusoidal function of position along line. This motion chosen for two reasons: closely approximates motion of human hand along straight-line trajectory, and provides very smooth transitions between constant-velocity portion and accelerated and decelerational end portions.

Bejczy, Antal K.↗

NASA NTRS2012

Q-Method Extended Kalman Filter

A new algorithm is proposed that smoothly integrates non-linear estimation of the attitude quaternion using Davenport s q-method and estimation of non-attitude states through an extended Kalman filter. The new method is compared to a similar existing algorithm showing its similarities and differences. The validity of the proposed approach is confirmed through numerical simulations.

Zanetti, Renato↗

NASA NTRS2001

Use of a genetic algorithm for the analysis of eye movements from the linear vestibulo-ocular reflex

It is common in vestibular and oculomotor testing to use a single-frequency (sine) or combination of frequencies [sum-of-sines (SOS)] stimulus for head or target motion. The resulting eye movements typically contain a smooth tracking component, which follows the stimulus, in which are interspersed rapid eye movements (saccades or fast phases). The parameters of the smooth tracking--the amplitude and phase of each component frequency--are of interest; many methods have been devised that attempt to identify and remove the fast eye movements from the smooth. We describe a new approach to this problem, tailored to both single-frequency and sum-of-sines stimulation of the human linear vestibulo-ocular reflex. An approximate derivative is used to identify fast movements, which are then omitted from further analysis. The remaining points form a series of smooth tracking segments. A genetic algorithm is used to fit these segments together to form a smooth (but disconnected) wave form, by iteratively removing biases due to the missing fast phases. A genetic algorithm is an iterative optimization procedure; it provides a basis for extending this approach to more complex stimulus-response situations. In the SOS case, the genetic algorithm estimates the amplitude and phase values of the component frequencies as well as removing biases.

Non-NASA Center↗

NASA NTRS1974

Error detection and data smoothing based on local procedures

An algorithm is presented which is able to locate isolated bad points and correct them without contaminating the rest of the good data. This work has been greatly influenced and motivated by what is currently done in the manual loft. It is not within the scope of this work to handle small random errors characteristic of a noisy system, and it is therefore assumed that the bad points are isolated and relatively few when compared with the total number of points. Motivated by the desire to imitate the loftsman a visual experiment was conducted to determine what is considered smooth data. This criterion is used to determine how much the data should be smoothed and to prove that this method produces such data. The method utimately converges to a set of points that lies on the polynomial that interpolates the first and last points; however convergence to such a set is definitely not the purpose of our algorithm. The proof of convergence is necessary to demonstrate that oscillation does not take place and that in a finite number of steps the method produces a set as smooth as desired.

Guerra, V. M.↗

NASA NTRS1990

Formulation of boundary conditions for the multigrid acceleration of the Euler and Navier Stokes equations

An explicit, Multigrid algorithm was written to solve the Euler and Navier-Stokes equations with special consideration given to the coarse mesh boundary conditions. These are formulated in a manner consistent with the interior solution, utilizing forcing terms to prevent coarse-mesh truncation error from affecting the fine-mesh solution. A 4-Stage Hybrid Runge-Kutta Scheme is used to advance the solution in time, and Multigrid convergence is further enhanced by using local time-stepping and implicit residual smoothing. Details of the algorithm are presented along with a description of Jameson's standard Multigrid method and a new approach to formulating the Multigrid equations.

Jentink, Thomas Neil↗

NASA NTRS2022

A Novel Atmospheric Correction Algorithm to Exploit the Diurnal Variability in Hypertemporal Geostationary Observations

This study developed a new atmospheric correction algorithm, GeoNEX-AC, that is independent from the traditional use of spectral band ratios but dedicated to exploiting information from the diurnal variability in the hypertemporal geostationary observations. The algorithm starts by evaluating smooth segments of the diurnal time series of the top-of-atmosphere (TOA) reflectance to identify clear-sky and snow-free observations. It then attempts to retrieve the Ross-Thick–Li-Sparse (RTLS) surface bi-directional reflectance distribution function (BRDF) parameters and the daily mean atmospheric optical depth (AOD) with an atmospheric radiative transfer model (RTM) to optimally simulate the observed diurnal variability in the clear-sky TOA reflectance. Once the initial RTLS parameters are retrieved after the algorithm’s burn-in period, they serve as the prior information to estimate the AOD levels for the following days and update the surface BRDF information with the new clear-sky observations. This process is iterated through the full time span of the observations, skipping only totally cloudy days or when surface snow is detected. We tested the algorithm over various Aerosol Robotic Network (AERONET) sites and the retrieved results well agree with the ground-based measurements. This study demonstrates that the high-frequency diurnal geostationary observations contain unique information that can help to address the atmospheric correction problem from new directions.

atmospheric correction↗

NASA NTRS1990

An adaptive grid algorithm for one-dimensional nonlinear equations

Richards' equation, which models the flow of liquid through unsaturated porous media, is highly nonlinear and difficult to solve. Step gradients in the field variables require the use of fine grids and small time step sizes. The numerical instabilities caused by the nonlinearities often require the use of iterative methods such as Picard or Newton interation. These difficulties result in large CPU requirements in solving Richards equation. With this in mind, adaptive and multigrid methods are investigated for use with nonlinear equations such as Richards' equation. Attention is focused on one-dimensional transient problems. To investigate the use of multigrid and adaptive grid methods, a series of problems are studied. First, a multigrid program is developed and used to solve an ordinary differential equation, demonstrating the efficiency with which low and high frequency errors are smoothed out. The multigrid algorithm and an adaptive grid algorithm is used to solve one-dimensional transient partial differential equations, such as the diffusive and convective-diffusion equations. The performance of these programs are compared to that of the Gauss-Seidel and tridiagonal methods. The adaptive and multigrid schemes outperformed the Gauss-Seidel algorithm, but were not as fast as the tridiagonal method. The adaptive grid scheme solved the problems slightly faster than the multigrid method. To solve nonlinear problems, Picard iterations are introduced into the adaptive grid and tridiagonal methods. Burgers' equation is used as a test problem for the two algorithms. Both methods obtain solutions of comparable accuracy for similar time increments. For the Burgers' equation, the adaptive grid method finds the solution approximately three times faster than the tridiagonal method. Finally, both schemes are used to solve the water content formulation of the Richards' equation. For this problem, the adaptive grid method obtains a more accurate solution in fewer work units and less computation time than required by the tridiagonal method. The performance of the adaptive grid method tends to degrade as the solution process proceeds in time, but still remains faster than the tridiagonal scheme.

Gutierrez, William E.↗

NASA NTRS1972

A geometrical interpretation of the 2n-th central difference

Many algorithms used for data smoothing, data classification and error detection require the calculation of the distance from a point to the polynomial interpolating its 2n neighbors (n on each side). This computation, if performed naively, would require the solution of a system of equations and could create numerical problems. This note shows that if the data is equally spaced, then this calculation can be performed using a simple recursion formula.

Tapia, R. A.↗

NASA NTRS1980

Equations for determining aircraft motions for accident data

Procedures for determining a comprehensive accident scenario from a limited data set are reported. The analysis techniques accept and process data from either an Air Traffic Control radar tracking system or a foil flight data recorder. Local meteorological information at the time of the accident and aircraft performance data are also utilized. Equations for the desired aircraft motions and forces are given in terms of elements of the measurement set and certain of their time derivatives. The principal assumption made is that aircraft side force and side-slip angle are negligible. An estimation procedure is outlined for use with each data source. For the foil case, a discussion of exploiting measurement redundancy is given. Since either formulation requires estimates of measurement time derivatives, an algorithm for least squares smoothing is provided.

Bach, R. E., Jr.↗

NASA NTRS1982

Terminal area automatic navigation, guidance, and control research using the Microwave Landing System (MLS). Part 3: A comparison of waypoint guidance algorithms for RNAV/MLS transition

The results of an investigation carried out for the Langley Research Center Terminal Configured Vehicle Program are presented. The investigation generated and compared three path update algorithms designed to provide smooth transition for an aircraft guidance system from DME, VORTAC, and barometric navaids to the more precise MLS by modifying the desired 3-D flight path. The first, called the Zero Cross Track, eliminates the discontinuity in cross track and altitude error by designating the first valid MLS aircraft position as the desired first waypoint, while retaining all subsequent waypoints. The discontinuity in track angle is left unaltered. The second, called the Tangent Path also eliminates the discontinuity in cross track and altitude and choose a new desired heading to be tangent to the next oncoming circular arc turn. The third, called the Continued Track eliminates the discontinuity in cross track, altitude and track angle by accepting the current MLS position and track angle as the desired ones and recomputes the location of the next waypoint. A method is presented for providing a waypoint guidance path reconstruction which treats turns of less than, and greater than, 180 degrees in a uniform manner to construct the desired path.

Pines, S.↗

NASA NTRS1997

Dynamic Forms: Application to Aircraft Guidance - Part 2

The paper describes a method for guiding a dynamic system through a given set of points. The paradigm is a fully automatic aircraft subject to air traffic control (ATC). The ATC provides a sequence of waypoints through which the aircraft trajectory must pass. The waypoints typically specify time, position, and velocity. The guidance problem is to synthesize a system state trajectory that satisfies both the ATC and aircraft constraints. Complications arise because the controlled process is multidimensional, multiaxis, nonlinear, highly coupled, and the state space is not flat. In addition, there is a multitude of operating modes, which may number in the hundreds. Each such mode defines a distinct state space model of the process by specifying the state space coordinatization, the partition of the controls into active controls and configuration controls, and the output map. Furthermore, mode transitions are required to be smooth. The proposed guidance algorithm is based on the inversion of the pure feedback approximation, followed by correction for the effects of zero dynamics. The paper describes the structure and major modules of the algorithm, and the performance is illustrated by several example aircraft maneuvers.

Meyer, George↗

NASA NTRS1999

Brain segmentation and the generation of cortical surfaces

This paper describes methods for white matter segmentation in brain images and the generation of cortical surfaces from the segmentations. We have developed a system that allows a user to start with a brain volume, obtained by modalities such as MRI or cryosection, and constructs a complete digital representation of the cortical surface. The methodology consists of three basic components: local parametric modeling and Bayesian segmentation; surface generation and local quadratic coordinate fitting; and surface editing. Segmentations are computed by parametrically fitting known density functions to the histogram of the image using the expectation maximization algorithm [DLR77]. The parametric fits are obtained locally rather than globally over the whole volume to overcome local variations in gray levels. To represent the boundary of the gray and white matter we use triangulated meshes generated using isosurface generation algorithms [GH95]. A complete system of local parametric quadratic charts [JWM+95] is superimposed on the triangulated graph to facilitate smoothing and geodesic curve tracking. Algorithms for surface editing include extraction of the largest closed surface. Results for several macaque brains are presented comparing automated and hand surface generation. Copyright 1999 Academic Press.

NASA Discipline Neuroscience↗