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 397 records · Page 22

All sources NASA NTRS DOE OSTI

NASA NTRS1982

Computing the Power-Density Spectrum for an Engineering Model

Computer program for calculating of power-density spectrum (PDS) from data base generated by Advanced Continuous Simulation Language (ACSL) uses algorithm that employs fast Fourier transform (FFT) to calculate PDS of variable. Accomplished by first estimating autocovariance function of variable and then taking FFT of smoothed autocovariance function to obtain PDS. Fast-Fourier-transform technique conserves computer resources.

Dunn, H. J.↗

NASA NTRS1989

A spatial operator algebra for manipulator modeling and control

A spatial operator algebra for modeling the control and trajectory design of manipulation is discussed, with emphasis on its analytical formulation and implementation in the Ada programming language. The elements of this algebra are linear operators whose domain and range spaces consist of forces, moments, velocities, and accelerations. The effect of these operators is equivalent to a spatial recursion along the span of the manipulator. Inversion is obtained using techniques of recursive filtering and smoothing. The operator alegbra provides a high-level framework for describing the dynamic and kinematic behavior of a manipulator and control and trajectory design algorithms. Implementable recursive algorithms can be immediately derived from the abstract operator expressions by inspection, thus greatly simplifying the transition from an abstract problem formulation and solution to the detailed mechanization of a specific algorithm.

Rodriguez, G.↗

NASA NTRS1993

Algorithm For Enlargement Of Digitized Images

Digital Image Enlarging Balanced Reconstruction Algorithm (DIEBRA) enlarges digitized image composed of square pixels to make image look more like real scene. Synthesizes enlarged image at greater number of pixels, smoothing out blockiness while providing resolution finer than original pixels and closer to scene. Based on more-realistic treatment of pixels, not as points but as areas representing spatial-resolution elements or fields of view of imaging instrument.

Rhea, William J.↗

NASA NTRS1994

Some practical aspects of lossless and nearly-lossless compression of AVHRR imagery

Compression of Advanced Very high Resolution Radiometers (AVHRR) imagery operating in a lossless or nearly-lossless mode is evaluated. Several practical issues are analyzed including: variability of compression over time and among channels, rate-smoothing buffer size, multi-spectral preprocessing of data, day/night handling, and impact on key operational data applications. This analysis is based on a DPCM algorithm employing the Universal Noiseless Coder, which is a candidate for inclusion in many future remote sensing systems. It is shown that compression rates of about 2:1 (daytime) can be achieved with modest buffer sizes (less than or equal to 2.5 Mbytes) and a relatively simple multi-spectral preprocessing step.

Hogan, David B.↗

NASA NTRS1996

GENIE(++): A Multi-Block Structured Grid System

The computer code GENIE++ is a continuously evolving grid system containing a multitude of proven geometry/grid techniques. The generation process in GENIE++ is based on an earlier version. The process uses several techniques either separately or in combination to quickly and economically generate sculptured geometry descriptions and grids for arbitrary geometries. The computational mesh is formed by using an appropriate algebraic method. Grid clustering is accomplished with either exponential or hyperbolic tangent routines which allow the user to specify a desired point distribution. Grid smoothing can be accomplished by using an elliptic solver with proper forcing functions. B-spline and Non-Uniform Rational B-splines (NURBS) algorithms are used for surface definition and redistribution. The built in sculptured geometry definition with desired distribution of points, automatic Bezier curve/surface generation for interior boundaries/surfaces, and surface redistribution is based on NURBS. Weighted Lagrance/Hermite transfinite interpolation methods, interactive geometry/grid manipulation modules, and on-line graphical visualization of the generation process are salient features of this system which result in a significant time savings for a given geometry/grid application.

Williams, Tonya↗

NASA NTRS2005

On-Line Loss of Control Detection Using Wavelets

Wavelet transforms are used for on-line detection of aircraft loss of control. Wavelet transforms are compared with Fourier transform methods and shown to more rapidly detect changes in the vehicle dynamics. This faster response is due to a time window that decreases in length as the frequency increases. New wavelets are defined that further decrease the detection time by skewing the shape of the envelope. The wavelets are used for power spectrum and transfer function estimation. Smoothing is used to tradeoff the variance of the estimate with detection time. Wavelets are also used as front-end to the eigensystem reconstruction algorithm. Stability metrics are estimated from the frequency response and models, and it is these metrics that are used for loss of control detection. A Matlab toolbox was developed for post-processing simulation and flight data using the wavelet analysis methods. A subset of these methods was implemented in real time and named the Loss of Control Analysis Tool Set or LOCATS. A manual control experiment was conducted using a hardware-in-the-loop simulator for a large transport aircraft, in which the real time performance of LOCATS was demonstrated. The next step is to use these wavelet analysis tools for flight test support.

Brenner, Martin J.↗

DOE OSTI2022

Discriminative Dimensionality Reduction using Deep Neural Networks for Clustering of LIGO Data

In this paper, leveraging the capabilities of neural networks for modeling the non-linearities that exist in the data, we propose several models that can project data into a low dimensional, discriminative, and smooth manifold. The proposed models can transfer knowledge from the domain of known classes to a new domain where the classes are unknown. A clustering algorithm is further applied in the new domain to find potentially new classes from the pool of unlabeled data. The research problem and data for this paper originated from the Gravity Spy project which is a side project of Advanced Laser Interferometer Gravitational-wave Observatory (LIGO). The LIGO project aims at detecting cosmic gravitational waves using huge detectors. However non-cosmic, non-Gaussian disturbances known as "glitches", show up in gravitational-wave data of LIGO. This is undesirable as it creates problems for the gravitational wave detection process. Gravity Spy aids in glitch identification with the purpose of understanding their origin. Since new types of glitches appear over time, one of the objective of Gravity Spy is to create new glitch classes. Towards this task, we offer a methodology in this paper to accomplish this.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

NASA NTRS2000

On Utilization of NEXRAD Scan Strategy Information to Infer Discrepancies Associated With Radar and Rain Gauge Surface Volumetric Rainfall Accumulations

To evaluate the Tropical Rainfall Measuring Mission (TRMM) monthly Ground Validation (GV) rain map, 42 quality controlled tipping bucket rain gauge data (1 minute interpolated rain rates) were utilized. We have compared the gauge data to the surface volumetric rainfall accumulation of NEXRAD reflectivity field, (converting to rain rates using a 0.5 dB resolution smooth Z-R table). The comparison was carried out from data collected at Melbourne, Florida during the month of July 98. GV operational level 3 (L3 monthly) accumulation algorithm was used to obtain surface volumetric accumulations for the radar. The gauge records were accumulated using the 1 minute interpolated rain rates while the radar Volume Scan (VOS) intervals remain less than or equal to 75 minutes. The correlation coefficient for the radar and gauge totals for the monthly time-scale remain at 0.93, however, a large difference was noted between the gauge and radar derived rain accumulation when the radar data interval is either 9 minute, or 10 minute. This difference in radar and gauge accumulation is being explained in terms of the radar scan strategy information. The discrepancy in terms of the Volume Coverage Pattern (VCP) of the NEXRAD is being reported where VCP mode is ascertained using the radar tilt angle information. Hourly radar and gauge accumulations have been computed using the present operational L3 method supplemented with a threshold period of +/- 5 minutes (based on a sensitivity analysis). These radar and gauge accumulations are subsequently improved using a radar hourly scan weighting factor (taking ratio of the radar scan frequency within a time bin to the 7436 total radar scans for the month). This GV procedure is further being improved by introducing a spatial smoothing method to yield reasonable bulk radar to gauge ratio for the hourly and daily scales.

Roy, Biswadev↗

DOE OSTI2022

An Efficient Bayesian Approach to Learning Droplet Collision Kernels: Proof of Concept Using “Cloudy,” a New n -Moment Bulk Microphysics Scheme

The small-scale microphysical processes governing the formation of precipitation particles cannot be resolved explicitly by cloud resolving and climate models. Instead, they are represented by microphysics schemes that are based on a combination of theoretical knowledge, statistical assumptions, and fitting to data (“tuning”). Historically, tuning was done in an ad hoc fashion, leading to parameter choices that are not explainable or repeatable. Recent work has treated it as an inverse problem that can be solved by Bayesian inference. The posterior distribution of the parameters given the data—the solution of Bayesian inference—is found through computationally expensive sampling methods, which require over $\mathcal{O}$(10 5 ) evaluations of the forward model; this is prohibitive for many models. We present a proof of concept of Bayesian learning applied to a new bulk microphysics scheme named “Cloudy,” using the recently developed Calibrate-Emulate-Sample (CES) algorithm. Cloudy models collision-coalescence and collisional breakup of cloud droplets with an adjustable number of prognostic moments and with easily modifiable assumptions for the cloud droplet mass distribution and the collision kernel. The CES algorithm uses machine learning tools to accelerate Bayesian inference by reducing the number of forward evaluations needed to $\mathcal{O}$(10 2 ). It also exhibits a smoothing effect when forward evaluations are polluted by noise. In a suite of perfect-model experiments, we show that CES enables computationally efficient Bayesian inference of parameters in Cloudy from noisy observations of moments of the droplet mass distribution. In an additional imperfect-model experiment, a collision kernel parameter is successfully learned from output generated by a Lagrangian particle-based microphysics model.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2023

Comparative Analysis of TRGBs (CATs) from Unsupervised, Multi-halo-field Measurements: Contrast is Key

The tip of the red giant branch (TRGB) is an apparent discontinuity of the luminosity function (LF) due to the end of the red giant evolutionary phase and is used to measure distances in the local universe. In practice, tip localization via edge detection response (EDR) relies on several methods applied on a case-by-case basis. It is hard to evaluate how individual choices affect a distance estimation using only a single host field while also avoiding confirmation bias. To devise a standardized approach, we compare unsupervised, algorithmic analyses of the TRGB in multiple halo fields per galaxy. We first optimize methods for the lowest field-to-field dispersion, including spatial filtering, smoothing, and weighting of LF, color band selection, and tip selection based on the number of likely RGB stars and the ratio of stars below versus above the tip (R). We find R, which we call the tip contrast, to be the most important indicator of the quality of EDR measurements; higher R selection can decrease field-to-field dispersion. Further, since R is found to correlate with the age or metallicity of the stellar population based on theoretical modeling, it might result in a displacement of the detected tip magnitude. We find a tip-contrast relation with a slope of -0.023 ± 0.0046 mag/ratio, an ~5σ result that can be used to correct these variations in the detections. When using TRGB to establish a distance ladder, consistent TRGB standardization using tip-contrast relation across rungs is vital to make robust cosmological measurements.

79 ASTRONOMY AND ASTROPHYSICS↗

NASA NTRS1986

Orthographic terrain views using data derived from digital elevation models

A fast algorithm for producing three-dimensional orthographic terrain views uses digital elevation data and co-registered imagery. These views are created using projective geometry and are designed for display on high-resolution raster graphics devices. The algorithm's effectiveness is achieved by (1) the implementation of two efficient gray-level interpolation routines that offer the user a choice between speed and smoothness, and (2) a unique visible surface determination procedure based on horizon angles derived from the elevation data set.

Dubayah, R. O.↗

NASA NTRS1985

Mesh-connected processor arrays for the transitive closure problem

The main purpose in this paper is to lay a theoretical foundation for the design of mesh-connected processor arrays for the transitive closure problem. Using a simple path-algebraic formulation of the problem and observing its similarity to certain well-known smoothing problems that occur in digital signal processing, it is shown how to draw upon existing techniques from the signal processing literature to derive regular iterative algorithms for determining the transitive closure of the graph. The regular iterative algorithms that are derived using these considerations, are then analyzed and synthesized on mesh-connected processor arrays. Among the vast number of mesh-connected processor arrays that can be designed using this unified approach, the systolic arrays reported in the literature for this problem are shown to be special cases.

Rao, S. K.↗

NASA NTRS1986

Roundoff error effects on spatial lattice algorithm

The floating-point roundoff error effect under finite word length limitations is analyzed for the time updates of reflection coefficients in the spatial lattice algorithm. It is shown that recursive computation is superior to direct computation under finite word length limitations. Moreover, the forgetting factor, which is conventionally used to smooth the time variations of the inputs, is also a crucial parameter in the consideration of the system stability and adaptability under finite word length constraints.

An, S. H.↗

NASA NTRS1991

A spatial operator algebra for manipulator modeling and control

A recently developed spatial operator algebra for manipulator modeling, control, and trajectory design is discussed. The elements of this algebra are linear operators whose domain and range spaces consist of forces, moments, velocities, and accelerations. The effect of these operators is equivalent to a spatial recursion along the span of a manipulator. Inversion of operators can be efficiently obtained via techniques of recursive filtering and smoothing. The operator algebra provides a high-level framework for describing the dynamic and kinematic behavior of a manipulator and for control and trajectory design algorithms. The interpretation of expressions within the algebraic framework leads to enhanced conceptual and physical understanding of manipulator dynamics and kinematics.

Rodriguez, G.↗

DOE OSTI2023

Topographic hydro-conditioning to resolve surface depression storage and ponding in a fully distributed hydrologic model

Land surface depressions play a central role in the transformation of rainfall to ponding, infiltration and runoff, yet digital elevation models (DEMs) used by spatially distributed hydrologic models that resolve land surface processes rarely capture land surface depressions at spatial scales relevant to this transformation. Methods to generate DEMs through processing of remote sensing data, such as optical and light detection and ranging (LiDAR) have favored surfaces without depressions to avoid adverse slopes that are problematic for many hydrologic routing methods. Here, in this study, we present a new topographic conditioning workflow, Depression-Preserved DEM Processing (D2P) algorithm, which is designed to preserve physically meaningful surface depressions for depression-integrated and efficient hydrologic modeling. D2P includes several features: (1) an adaptive screening interval for delineation of depressions, (2) the ability to filter out anthropogenic land surface features (e.g., bridges), (3) the ability to blend river smoothing (e.g., a general downslope profile) and depression resolving functionality. From a case study in the Goodwin Creek Experimental Watershed, D2P successfully resolved 86% of the ponds at a DEM resolution of 10 m. Topographic conditioning was achieved with minimum impact as D2P reduced the number of modified cells from the original DEM by 51% compared to a conventional algorithm. Furthermore, hydrologic simulation using a D2P processed DEM resulted in a more robust characterization on surface water dynamics based on higher surface water storage as well as an attenuated and delayed peak streamflow.

54 ENVIRONMENTAL SCIENCES↗

DOE OSTI2022

Smoothed aggregation for difficult stretched mesh and coefficient variation problems

Abstract Four adaptations of the smoothed aggregation algebraic multigrid (SA‐AMG) method are proposed with an eye toward improving the convergence and robustness of the solver in situations when the discretization matrix contains many weak connections. These weak connections can cause higher than expected levels of fill‐in within the coarse discretization matrices and can also give rise to suboptimal smoothing within the prolongator smoothing phase. These smoothing drawbacks are due to the relatively small size of some diagonal entries within the filtered matrix that one obtains after dropping the weak connections. The new algorithms consider modifications to the Jacobi‐like step that defines the prolongator smoother, modifications to the filtered matrix, and also direct modifications to the resulting grid transfer operators. Numerical results are given illustrating the potential benefits of the proposed adaptations.

Hu, Jonathan J.↗

NASA NTRS1987

Algorithm developments for the Euler equations with calculations of transonic flows

A new algorithm has been developed for the Euler equations that uses flux vector splitting in combination with the concept of rotating the coordinate system to the local streamwise direction. Flux vector biasing is applied along the local streamwise direction and central differencing is used transverse to the flow direction. The flux vector biasing is switched from upwind for supersonic flow to downwind-biased for subsonic flow. This switching is based on the Mach number; hence the proper domain of dependence is used in the supersonic regions and the switching occurs across shock waves. The theoretical basis and the development of the formulas for flux vector splitting are presented. Then several one-dimensional calculations are presented of steady and unsteady transonic flows, which demonstrate the stability and accuracy of the algorithm. Finally results are shown for unsteady transonic flow over an airfoil. The pressure coefficient plots show sharp transonic shock profiles, and the Mach contour plots show smoothly varying contours.

Goorjian, Peter M.↗

NASA NTRS1991

Robust contour decomposition using a constant curvature criterion

The problem of decomposing an extended boundary or contour into simple primitives is addressed with particular emphasis on Laplacian-of-Gaussian (LoG) zero-crossing contours. A technique is introduced for partitioning such contours into constant curvature segments. A nonlinear `blip' filter matched to the impairment signature of the curvature computation process, an overlapped voting scheme, and a sequential contiguous segment extraction mechanism are used. This technique is insensitive to reasonable changes in algorithm parameters and robust to noise and minor viewpoint-induced distortions in the contour shape, such as those encountered between stereo image pairs. The results vary smoothly with the data, and local perturbations induce only local changes in the result. Robustness and insensitivity are experimentally verified.

Wuescher, Daniel M.↗