Search NASA⌕ Search

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.

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

At least 19 records

Performances Of Fixed-Lag Phase-Smoothing Algorithms

Report discusses performances of fixed-lag nonlinear smoothing algorithms applied to estimation of phase and frequency of sinusoidal carrier signal with process phase noise and additive observation phase noise. Algorithm of type considered functions as suboptimal filter operating on received signal. Algorithm developed for system in which signal sampled at discrete times. Process noise assumed to be Gaussian with zero mean and independent of observation noise. Nonlinear smoothing equations derived in customary matrix-and-vector forms.

Kumar, Rajendra↗

Alternative smoothing algorithms for on-line estimation problems

In recent years, much emphasis has been placed on the Kalman filter to solve on-line estimation problems. Smoothers, which determine state estimates at a certain time t using measurements between 0 and T, have been used primarily in off-line estimation schemes. This paper presents alternative forms of smoothers that can be used for on-line estimation problems. The alternative smoothing algorithms provide state estimates which are more refined than Kalman filtered state estimates. The alternative smoothing algorithms are illustrated in two examples. The first example considers a linear discrete-time system while the second example considers a nonlinear continuous-time system with discrete-time measurements.

Baumgartner, Eric T.↗

A smoothing algorithm using cubic spline functions

Two algorithms are presented for smoothing arbitrary sets of data. They are the explicit variable algorithm and the parametric variable algorithm. The former would be used where large gradients are not encountered because of the smaller amount of calculation required. The latter would be used if the data being smoothed were double valued or experienced large gradients. Both algorithms use a least-squares technique to obtain a cubic spline fit to the data. The advantage of the spline fit is that the first and second derivatives are continuous. This method is best used in an interactive graphics environment so that the junction values for the spline curve can be manipulated to improve the fit.

Smith, R. E., Jr.↗

An optimal smoothing algorithm for Viking spacecraft attitude determination

A fundamental requirement for ground analysis of onboard attitude control systems is the determination of the time evolution of spacecraft angular orientation and velocity, and of external torques acting on the spacecraft. However, at times, there are limitations on the data received on the ground, and essential but missing variables must be estimated. This paper contains a description of the design and implementation of an algorithm for angular position, velocity, and torque estimation. The algorithm has been used to analyze the performance of the Viking Orbiter attitude control system. Typical results of this analysis are presented.

Rodriguez, G.↗

Enhancement of surface definition and gridding in the EAGLE code

Algorithms for smoothing of curves and surfaces for the EAGLE grid generation program are presented. The method uses an existing automated technique which detects undesirable geometric characteristics by using a local fairness criterion. The geometry entity is then smoothed by repeated removal and insertion of spline knots in the vicinity of the geometric irregularity. The smoothing algorithm is formulated for use with curves in Beta spline form and tensor product B-spline surfaces.

Thompson, Joe F.↗

Nonlinear smoothing identification algorithm with application to data consistency checks

A parameter identification algorithm for nonlinear systems is presented. It is based on smoothing test data with successively improved sets of model parameters. The smoothing, which is iterative, provides all of the information needed to compute the gradients of the smoothing performance measure with respect to the parameters. The parameters are updated using a quasi-Newton procedure, until convergence is achieved. The advantage of this algorithm over standard maximum likelihood identification algorithms is the computational savings in calculating the gradient. This algorithm was used for flight-test data consistency checks based on a nonlinear model of aircraft kinematics. Measurement biases and scale factors were identified. The advantages of the presented algorithm and model are discussed.

Idan, M.↗

Employing Relaxed Smoothness Constraints on Imaginary Part of Refractive Index in AERONET Aerosol Retrieval Algorithm

In the Aerosol Robotic Network (AERONET) retrieval algorithm, smoothness constraints on the imaginary part of the refractive index provide control of retrieved spectral dependence of aerosol absorption by preventing the inversion code from fitting the noise in optical measurements and thus avoiding unrealistic oscillations of retrievals with wavelength. The history of implementation of the smoothness constraints in the AERONET retrieval algorithm is discussed. It is shown that the latest version of the smoothness constraints on the imaginary part of refractive index, termed standard and employed by Version 3 of the retrieval algorithm, should be modified to account for strong variability of light absorption by brown-carbon-containing aerosols in UV through mid-visible parts of the solar spectrum. In Version 3 strong spectral constraints were imposed at high values of the Ångström exponent (440–870 nm) since black carbon was assumed to be the primary absorber, while the constraints became increasingly relaxed as aerosol exponent deceased to allow for wavelength dependence of absorption for dust aerosols. The new version of the smoothness constraints on the imaginary part of the refractive index assigns different weights to different pairs of wavelengths, which are the same for all values of the Ångström exponent. For example, in the case of four-wavelength input, the weights assigned to short-wavelength pairs (440–675, 675–870 nm) are small so that smoothness constraints do not suppress natural spectral variability of the imaginary part of the refractive index. At longer wavelengths (870–1020 nm), however, the weight is 10 times higher to provide additional constraints on the imaginary part of refractive index retrievals of aerosols with a high Ångström exponent due to low sensitivity to aerosol absorption for longer channels at relatively low aerosol optical depths. The effect of applying the new version of smoothness constraints, termed relaxed, on retrievals of single-scattering albedo is analyzed for case studies of different aerosol types: black- and brown-carbon-containing fine mode aerosols, mineral dust coarse mode aerosols, and urban industrial fine mode aerosol. It is shown that for brown-carbon-containing aerosols employing the relaxed smoothness constraints resulted in significant reduction in retrieved single-scattering albedo and spectral residual errors (compared to standard) at the short wavelengths. For example, biomass burning smoke cases showed a reduction in single-scattering albedo and spectral residual error at 380 nm of ∼ 0.033 and ∼ 17 %, respectively, for the Rexburg site and ∼ 0.04 and ∼ 12.7 % for the Rimrock site, both AERONET sites in Idaho, USA. For a site with very high levels of black-carbon-containing aerosols (Mongu, Zambia), the effect of modification in the smoothness constraints was minor. For mineral dust aerosols at small Ångström exponent values (Mezaira site, UAE), the spectral constraint on the imaginary part of the refractive index was already relaxed in Version 3; therefore the new relaxed constraint results in minimal change. In the case of weakly absorbing urban industrial aerosols at the GSFC site, there are significant changes in retrieved single-scattering albedo using relaxed assumption, especially reductions at longer wavelengths: ∼ 0.016 and ∼ 0.02 at 875 and 1020 nm, respectively, for 440 nm aerosol optical depth (AOD) ∼ 0.3. The modification of smoothness constraints on the imaginary part of the refractive index has a minor effect on retrievals of other aerosol parameters such as the real part of the refractive index and parameters of the aerosol size distribution. The implementation of the relaxed smoothness constraints on the imaginary part of the refractive index in the next version of the AERONET inversion algorithm will produce significant impacts at some sites in short wavelength channels (380 and 440 nm) for some biomass burning smoke cases with significant brown carbon content and possibly in mid-visible channels (500 and 675 nm) to near-infrared channels (870 to 1020 nm) for some urban industrial aerosol types. However, most differences in single-scattering albedo retrievals between those applying the new relaxed constraint and the standard constraint will be within the uncertainty of the single-scattering albedo retrievals, depending on the level of aerosol optical depth, Ångström exponent, brown carbon content and wavelength.

Aliaksandr Siniuk↗

Sea Surface Salinity Distribution in the Southern Ocean as Observed from Space

Large-scale spatial and temporal variabilities of sea surface salinity (SSS) in the Southern Ocean from 2011 to 2017 were studied using products derived from microwave sensors on board Aquarius, Soil Moisture and Ocean Salinity (SMOS), and Soil Moisture Active and Passive (SMAP) satellites. Four products, three from Aquarius and one from SMOS, were evaluated and shown to be generally consistent within 0.3 to 0.6 psu and agree favorably with in situ measurements. However, although the Aquarius products show consistent seasonality of SSS with high values of 34.45 psu in October and low values of 33.40 psu in May, theSMOS and SMAP products lack such seasonal variations. This may be caused by larger uncertainties in the SMOS and SMAP data due in part to the lack of concurrent scatterometer measurements that is used to correct for roughness effects. The four products provide similar spatial distributions of SSS with root mean square difference from 0.25 to 0.58 psu. Differences among Aquarius products are mainly due to varying salinity retrieval algorithms, smoothing, and masking of sea ice, while the SMOS product showed the highest SSS deviation that is likely due to the bias adjustment done on the data set. Our analyses show that SSS in the Southern Ocean region has significant meridional variations with the lowest SSS near the ice edge and highest at lower latitudes. The SSS is also lowest in summer indicating the predominant influence of sea ice and glacial melt, but it stays low near ice edges even during the growth season. Salinity together with temperature is the key parameters that control the state and circulation of the World's oceans. The large‐scale distribution of the sea surface salinity of the Southern Ocean is quantified for the first time using Aquarius, Soil Moisture and Ocean Salinity, and Soil Moisture Active and Passive satellite microwave data. Seasonal and interannual changes in the distribution as affected by the sea ice cover, surface temperature, and precipitation are evaluated. Comparative studies were done, using four different products that are publicly available, in conjunction with in situ observations to gain insights into the true nature of the distribution and how consistently the sea surface salinity is depicted by the different products. There are general consistencies in the products, and discrepancies are attributed to different algorithms, smoothing techniques, and sea ice masking. Aquarius data are shown to have higher accuracy than Soil Moisture and Ocean Salinity and Soil Moisture Active and Passive products in part because of having concurrent scatterometer that provides accurate correction to roughness effects.

Garcia-Eidell, Cynthia↗

HEASARC Software Archive

(1) Chandra Archive: SAO has maintained the interfaces through which HEASARC gains access to the Chandra Data Archive. At HEASARC's request, we have implemented an anonymous ftp copy of a major part of the public archive and we keep that archive up-to- date. SAO has participated in the ADEC interoperability working group, establishing guidelines or interoperability standards and prototyping such interfaces. We have provided an NVO-based prototype interface, intending to serve the HEASARC-led NVO demo project. HEASARC's Astrobrowse interface was maintained and updated. In addition, we have participated in design discussions surrounding HEASARC's Caldb project. We have attended the HEASARC Users Group meeting and presented CDA status and developments. (2) Chandra CALDB: SA0 has maintained and expanded the Chandra CALDB by including four new data file types, defining the corresponding CALDB keyword/identification structures. We have provided CALDB upgrades for the public (CIAO) and for Standard Data Processing. Approximately 40 new files have been added to the CALDB in these version releases. There have been in the past year ten of these CALDB upgrades, each with unique index configurations. In addition, with the inputs from software, archive, and calibration scientists, as well as CIAO/SDP software developers, we have defined a generalized expansion of the existing CALDB interface and indexing structure. The purpose of this is to make the CALDB more generally applicable and useful in new and future missions that will be supported archivally by HEASARC. The generalized interface will identify additional configurational keywords and permit more extensive calibration parameter and boundary condition specifications for unique file selection. HEASARC scientists and developers from SAO and GSFC have become involved in this work, which is expected to produce a new interface for general use within the current year. (3) DS9: One of the decisions that came from last year's HEADCC meeting was to make the ds9 image display program the primary vehicle for displaying line graphics (as well as images). The first step required to make this possible was to enhance the line graphics capabilities of ds9. SAO therefore spent considerable effort upgrading ds9 to use Tcl 8.4 so that the BLT line graphics package could be built and imported into ds9 from source code, rather than from a pre-built (and generally outdated) shared library. This task, which is nearly complete, allows us to extend BLT as needed for the HEAD community. Following HEADCC discussion concerning archiving and the display of archived data, we extended ds9 to support full access to many astronomical Web-based archives sites, including HEASARC, MAST, CHANDRA, SKYVIEW, ADS, NED, SIMBAD, IRAS, NVRO, SAO TDC, and FIRST. Using ds9's new internal Web access capabilities, these archives can be accessed via their Web page. FITS images, plots, spectra, and journal abstracts can be referenced, down-loaded, and displayed directly and easily in ds9. For more information, see: http://hea-www.harvard.edu/saord/ds9. Also after the HEADCC discussion concerning region filtering, we extended the Funtools sample implementation of region filtering as described in: http://hea-www.harvard.edu/saord/funtools/regions.html. In particular, we added several new composite regions for event and image filtering, including elliptical and box annuli. We also extended the panda (Pie AND Annulus) region support to include box pandas and elliptical pandas. These new composite regions are especially useful in programs that need to count photons in each separate region using only a single pass through the data. Support for these new regions was added to ds9. In the same vein, we developed new region support for filtering images using simple FITS image masks, i.e. 8-bit or 16-bit FITS images where the value of a pixel is the region id number for that pixel. Other important enhancements to DS9 this year, include supporor multiple world coordinate systems, three dimensional event file binning, image smoothing, region groups and tags, the ability to save images in a number of image formats (such as JPEG, TIFF, PNG, FITS), improvements in support for integrating external analysis tools, and support for the virtual observatory. In particular, a full-featured web browser has been implemented within D S 9 . This provides support for full access to HEASARC archive sites such as SKYVIEW and W3BROWSE, in addition to other astronomical archives sites such as MAST, CHANDRA, ADS, NED, SIMBAD, IRAS, NVRO, SA0 TDC, and FIRST. From within DS9, the archives can be searched, and FITS images, plots, spectra, and journal abstracts can be referenced, downloaded and displayed The web browser provides the basis for the built-in help facility. All DS9 documentation, including the reference manual, FAQ, Know Features, and contact information is now available to the user without the need for external display applications. New versions of DS9 maybe downloaded and installed using this facility. Two important features used in the analysis of high energy astronomical data have been implemented in the past year. The first is support for binning photon event data in three dimensions. By binning the third dimension in time or energy, users are easily able to detect variable x-ray sources and identify other physical properties of their data. Second, a number of fast smoothing algorithms have been implemented in DS9, which allow users to smooth their data in real time. Algorithms for boxcar, tophat, and gaussian smoothing are supported.

White, Nicholas↗

An algorithm for surface smoothing with rational splines

Discussed is an algorithm for smoothing surfaces with spline functions containing tension parameters. The bivariate spline functions used are tensor products of univariate rational-spline functions. A distinct tension parameter corresponds to each rectangular strip defined by a pair of consecutive spline knots along either axis. Equations are derived for writing the bivariate rational spline in terms of functions and derivatives at the knots. Estimates of these values are obtained via weighted least squares subject to continuity constraints at the knots. The algorithm is illustrated on a set of terrain elevation data.

Schiess, James R.↗

Earth resources data analysis program, phase 2

The efforts and findings of the Earth Resources Data Analysis Program are summarized. Results of a detailed study of the needs of EOD with respect to an applications development system (ADS) for the analysis of remotely sensed data, including an evaluation of four existing systems with respect to these needs are described. Recommendations as to possible courses for EOD to follow to obtain a viable ADS are presented. Algorithmic development comprised of several subtasks is discussed. These subtasks include the following: (1) two algorithms for multivariate density estimation; (2) a data smoothing algorithm; (3) a method for optimally estimating prior probabilities of unclassified data; and (4) further applications of the modified Cholesky decomposition in various calculations. Little effort was expended on task 3, however, two reports were reviewed.

Source record↗

The detection of X-rays from the hot interstellar medium of the Large Magellanic Cloud

A comprehensive reanalysis is presented of the Einstein IPC data base on the LMC, and a number of new algorithms are used to improve the reliability of the point source detection in this crowded region and to produce the first large-scale map of diffuse emission free from the effects of solar scattered X-rays and cosmic-ray particles. Algorithms described in detail include a technique to decontaminate fields containing solar scattered flux, a mechanism for obtaining a spectrum-weighted vignetting function, and a source excision and smoothing algorithm which results in a diffuse map of uniform statistical quality. A catalog of discrete X-rays sources in the direction of the LMC is presented which contains 33 new sources and eliminates a number of spurious and/or marginal directions from previous lists. A possible detection of the long-sought shadowing effect on the cosmic X-ray background produced by cold LMC gas is reported.

Wang, Q.↗

Analysis of estimation algorithms for CDTI and CAS applications

Estimation algorithms for Cockpit Display of Traffic Information (CDTI) and Collision Avoidance System (CAS) applications were analyzed and/or developed. The algorithms are based on actual or projected operational and performance characteristics of an Enhanced TCAS II traffic sensor developed by Bendix and the Federal Aviation Administration. Three algorithm areas are examined and discussed. These are horizontal x and y, range and altitude estimation algorithms. Raw estimation errors are quantified using Monte Carlo simulations developed for each application; the raw errors are then used to infer impacts on the CDTI and CAS applications. Applications of smoothing algorithms to CDTI problems are also discussed briefly. Technical conclusions are summarized based on the analysis of simulation results.

Goka, T.↗

Accelerated finite-volume calculation of transonic potential flows

A fully conservative finite-volume algorithm is used to calculate transonic potential flows past isolated airfoils and through two-dimensional channels. The difference equations are solved by a multigrid technique which uses an alternating direction implicit method as a smoothing algorithm. The finite-volume formulation provides a framework within which to treat flows past complicated geometries, while the multigrid/alternating direction scheme provides rapid convergence of the solution to very small residuals.

Jameson, A.↗

Conjugate gradient coupled with multigrid for an indefinite problem

An iterative algorithm for the Helmholtz equation is presented. This scheme was based on the preconditioned conjugate gradient method for the normal equations. The preconditioning is one cycle of a multigrid method for the discrete Laplacian. The smoothing algorithm is red-black Gauss-Seidel and is constructed so it is a symmetric operator. The total number of iterations needed by the algorithm is independent of h. By varying the number of grids, the number of iterations depends only weakly on k when k(3)h(2) is constant. Comparisons with a SSOR preconditioner are presented.

Gozani, J.↗