Search NASA⌕ Search

SEARCH · Search NASA

Results for “Filtering algorithms”

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 433 records · Page 24

Hybrid Feedforward-Feedback Noise Control Using Virtual Sensors

Several approaches to active noise control using virtual sensors are evaluated for eventual use in an active headrest. Specifically, adaptive feedforward, feedback, and hybrid control structures are compared. Each controller incorporates the traditional filtered-x least mean squares algorithm. The feedback controller is arranged in an internal model configuration to draw comparisons with standard feedforward control theory results. Simulation and experimental results are presented that illustrate each controllers ability to minimize the pressure at both physical and virtual microphone locations. The remote microphone technique is used to obtain pressure estimates at the virtual locations. It is shown that a hybrid controller offers performance benefits over the traditional feedforward and feedback controllers. Stability issues associated with feedback and hybrid controllers are also addressed. Experimental results show that 15-20 dB reduction in broadband disturbances can be achieved by minimizing the measured pressure, whereas 10-15 dB reduction is obtained when minimizing the estimated pressure at a virtual location.

Bean, Jacob↗

ANC of Radiated Sound from a Small UAS Rotor using Virtual Error Sensors

Small unmanned aerial systems (UAS) are becoming increasingly common for private, military, and commercial use, increasing community noise exposure. Reducing the noise produced by UAS could help improve community acceptance. Active noise control (ANC) might be used to attenuate noise produced by UAS, however, traditional ANC systems require a physical sensor in the far-field, which is not feasible. This paper assesses a virtual error sensing (VES) method that eliminates the need for a far-field sensor. This paper describes the proposed VES strategy, and presents numerical simulations and experimental results that highlight the benefits and limitations of the approach. Results for the VES system alone and with an ANC approach are presented and discussed. Experimental testing focused on attenuating the tonal noise produced by one 2-bladed rotor with a tip radius of 11.9 cm. Pressure variations caused by blade rotation were measured in the near and far-field using electret microphones and externally polarized condenser microphones, respectively. The filtered-x least mean squares algorithm was used in conjunction with the VES system to attenuate the far-field response. Experimental results show reductions between 6-13 dB at varying far-field locations and rotation rates.

virtual error sensor↗

Adaptable Iterative and Recursive Kalman Filter Schemes

Nonlinear filters are often very computationally expensive and usually not suitable for real-time applications. Real-time navigation algorithms are typically based on linear estimators, such as the extended Kalman filter (EKF) and, to a much lesser extent, the unscented Kalman filter. The Iterated Kalman filter (IKF) and the Recursive Update Filter (RUF) are two algorithms that reduce the consequences of the linearization assumption of the EKF by performing N updates for each new measurement, where N is the number of recursions, a tuning parameter. This paper introduces an adaptable RUF algorithm to calculate N on the go, a similar technique can be used for the IKF as well.

Zanetti, Renato↗

Suboptimal schemes for atmospheric data assimilation based on the Kalman filter

This work is directed toward approximating the evolution of forecast error covariances for data assimilation. The performance of different algorithms based on simplification of the standard Kalman filter (KF) is studied. These are suboptimal schemes (SOSs) when compared to the KF, which is optimal for linear problems with known statistics. The SOSs considered here are several versions of optimal interpolation (OI), a scheme for height error variance advection, and a simplified KF in which the full height error covariance is advected. To employ a methodology for exact comparison among these schemes, a linear environment is maintained, in which a beta-plane shallow-water model linearized about a constant zonal flow is chosen for the test-bed dynamics. The results show that constructing dynamically balanced forecast error covariances rather than using conventional geostrophically balanced ones is essential for successful performance of any SOS. A posteriori initialization of SOSs to compensate for model - data imbalance sometimes results in poor performance. Instead, properly constructed dynamically balanced forecast error covariances eliminate the need for initialization. When the SOSs studied here make use of dynamically balanced forecast error covariances, the difference among their performances progresses naturally from conventional OI to the KF. In fact, the results suggest that even modest enhancements of OI, such as including an approximate dynamical equation for height error variances while leaving height error correlation structure homogeneous, go a long way toward achieving the performance of the KF, provided that dynamically balanced cross-covariances are constructed and that model errors are accounted for properly. The results indicate that such enhancements are necessary if unconventional data are to have a positive impact.

Todling, Ricardo↗

Post-Flight Performance Analysis of Navigation and Advanced Guidance Algorithms on a Terrestrial Suborbital Rocket Flight

There is currently renewed interest in robotic and crewed landers for a return to the lunar surface. Advanced guidance and navigation algorithms are essential to accurately delivering cargo and crew safely to the moon successfully. This paper reports the overall performance of an integrated set of navigation and guidance algorithms flown on a terrestrial suborbital rocket up to an altitude of approximately 100km. The navigation algorithm consists of an onboard extended Kalman Filter (EKF) that ingests multiple sensor measurements, one of which is the output from a terrain relative navigation (TRN) algorithm that cross-references camera images to on-board satellite imagery to perform feature correlation within the camera image. The guidance algorithm solves for a 6-degree-of-freedom (DoF) optimal trajectory using a successive convexification method during powered descent. The altitude range as well as the landing dynamics experienced during this test flight are realistic for an extraterrestrial landing and provide an invaluable data set to gauge the current development of these landing algorithms in an effort to advance the overall software readiness levels (SRL). This paper will delve into different aspects of each algorithm and present an analysis of the in-flight performance of the algorithms. This flight was conducted under the National Aeronautics and Space Administration (NASA) Safe and Precise Landing Integrated Capabilities Evolution (SPLICE) project focused on technology advancement for landing applications.

Guidance↗

Optimal realizable filters and the minimum Euclidean distance principle

Minimizing a Euclidean distance in the complex plane optimizes a wide class of correlation metrics for filters implemented on realistic devices. The algorithm searches over no more than two real scalars (gain and phase). It unifies a variety of previous solutions for special cases (e.g., a maximum signal-to-noise ratio with colored noise and a real filter and a maximum correlation intensity with no noise and a coupled filter). It extends optimal partial information filter theory to arbitrary spatial light modulators (fully complex, coupled, discrete, finite contrast ratio, and so forth), additive input noise (white or colored), spatially nonuniform filter modulators, and additive correlation detection noise (including signal dependent noise).

Juday, Richard D.↗

Application of velocity filtering to optical-flow passive ranging

The performance of the velocity filtering method as applied to optical-flow passive ranging under real-world conditions is evaluated. The theory of the 3-D Fourier transform as applied to constant-speed moving points is reviewed, and the space-domain shift-and-add algorithm is derived from the general 3-D matched filtering formulation. The constant-speed algorithm is then modified to fit the actual speed encountered in the optical flow application, and the passband of that filter is found in terms of depth (sensor/object distance) so as to cover any given range of depths. Two algorithmic solutions for the problems associated with pixel interpolation and object expansion are developed, and experimental results are presented.

Barniv, Yair↗

Performance evaluation of tracking based on a low pass filter model

The performance of a human in a closed loop tracking task can be determined by using a simple low pass filter model with a least squares identification algorithm. The crossover model and the extended crossover model can be shown to be special cases of the low pass filter model presented here. Performance in tracking can be easily determined by mean square tracking error which can be written in terms of the parameters of the low pass filter model. A closed form expression for the effective time delay is also obtained. Experimental data from a roll axis tracking simulation is presented and simple prediction rules are determined. A comparison is made between this model and the crossover model with respect to their differences and similarities.

Repperger, D. W.↗

A Comparison of Filter-based Approaches for Model-based Prognostics

Model-based prognostics approaches use domain knowledge about a system and its failure modes through the use of physics-based models. Model-based prognosis is generally divided into two sequential problems: a joint state-parameter estimation problem, in which, using the model, the health of a system or component is determined based on the observations; and a prediction problem, in which, using the model, the stateparameter distribution is simulated forward in time to compute end of life and remaining useful life. The first problem is typically solved through the use of a state observer, or filter. The choice of filter depends on the assumptions that may be made about the system, and on the desired algorithm performance. In this paper, we review three separate filters for the solution to the first problem: the Daum filter, an exact nonlinear filter; the unscented Kalman filter, which approximates nonlinearities through the use of a deterministic sampling method known as the unscented transform; and the particle filter, which approximates the state distribution using a finite set of discrete, weighted samples, called particles. Using a centrifugal pump as a case study, we conduct a number of simulation-based experiments investigating the performance of the different algorithms as applied to prognostics.

prognostics↗

Systematic estimation of forecast and observation error covariances in four-dimensional data assimilation

A two-part algorithm is presented for reliably computing weather forecast model and observational error covariances during data assimilation. Data errors arise from instrumental inaccuracies and sub-grid scale variability, whereas forecast errors occur because of modeling errors and the propagation of previous analysis errors. A Kalman filter is defined as the primary algorithm for estimating the forecast and analysis error convariance matrices. A second algorithm is described for quantifying the noise covariance matrices of any degree to obtain accurate values for the observational error covariances. Numerical results are provided from a linearized one-dimensional shallow-water model. The results cover observational noise covariances, initial instrumental errors and erroneous model values.

Dee, D. P.↗

The CCD/Transit Instrument (CTI) data-analysis system

The automated software system for archiving, analyzing, and interrogating data from the CCD/Transit Instrument (CTI) is described. The CTI collects up to 450 Mbytes of image-data each clear night in the form of a narrow strip of sky observed in two colors. The large data-volumes and the scientific aims of the project make it imperative that the data are analyzed within the 24-hour period following the observations. To this end a fully automatic and self evaluating software system has been developed. The data are collected from the telescope in real-time and then transported to Tucson for analysis. Verification is performed by visual inspection of random subsets of the data and obvious cosmic rays are detected and removed before permanent archival is made to the optical disc. The analysis phase is performed by a pair of linked algorithms, one operating on the absolute pixel-values and the other on the spatial derivative of the data. In this way both isolated and merged images are reliably detected in a single pass. In order to isolate the latter algorithm from the effects of noise spikes a 3x3 Hanning filter is applied to the raw data before the analysis is run. The algorithms reduce the input pixel-data to a database of measured parameters for each image which has been found. A contrast filter is applied in order to assign a detection-probability to each image and then x-y calibration and intensity calibration are performed using known reference stars in the strip. These are added to as necessary by secondary standards boot-strapped from the CTI data itself. The final stages involve merging the new data into the CTI Master-list and History-list and the automatic comparison of each new detection with a set of pre-defined templates in parameter-space to find interesting objects such as supernovae, quasars and variable stars. Each stage of the processing from verification to interesting image selection is performed under a data-logging system which both controls the pipe-lining of data through the system and records key performance monitor parameters which are built into the software. Furthermore, the data from each stage are stored in databases to facilitate evaluation, and all stages offer the facility to enter keyword-indexed free-format text into the data-logging system. In this way a large measure of certification is built into the system to provide the necessary confidence in the end results.

Cawson, M. G. M.↗

Recent Updates in the SMAP Level-4 Soil Moisture Algorithm

The NASA Soil Moisture Active Passive (SMAP) mission generates, among other data sets, the Level-4 Soil Moisture (L4_SM) product. The L4_SM data are published with a mean latency of ~2.5 days from the time of observation and provide global, three-hourly, 9-km resolution estimates of surface and root-zone soil moisture and related land surface states and fluxes. The L4_SM algorithm is based on the assimilation of SMAP radiometer brightness temperature observations into the NASA Catchment land surface model using a spatially distributed ensemble Kalman filter (EnKF). In 2018, the L4_SM algorithm was upgraded from Version 3 to Version 4. Underlying the new version is a revised modeling system that includes improved input parameter datasets for land cover, topography, and vegetation height that are based on recent, high-quality, space-borne remote sensing observations. Additionally, SMAP Level-2 soil moisture retrievals and in situ soil moisture measurements were used to calibrate a particular Catchment model parameter that governs the recharge of surface soil moisture from below under non-equilibrium conditions, which brings the model's surface soil moisture more in line with the SMAP Level-2 and in situ soil moisture. Moreover, the calibration of the assimilated SMAP brightness temperatures changed substantially from Version 3 to Version 4, and the "catchment deficit" model variable was removed from the EnKF state vector to avoid degrading the model's groundwater estimates.Considerable effort went into the version upgrade, creating an expectation that the new version is improved over the old version. Indeed, some aspects of the new version are clearly better. However, other aspects are not. In this presentation we summarize the skill of the new and old versions vs. independent in situ measurements and in terms of data assimilation diagnostics, including, for example, the statistics of the (soil moisture) analysis increments and the observation-minus-forecast (brightness temperatures) residuals. We share our experience with trying to improve to the L4_SM product and the lessons learned from the effort.

Reichle, Rolf H.↗

A novel algorithm for sea surface height estimation using complex SAR data

A method of extracting sea height information from Synthetic Aperture Radar (SAR) complex data was studied. A fundamental SAR ocean imaging model for gravity waves showed that information about the long wave is present in the SAR complex data, especially its phase. Phase demodulation algorithm followed by linear regression and filtering was employed. Only the latter two steps incorporated a priori information that might be available. A relatively simplified simulation indicated that the finite bandwidth of the SAR system imposed the apparently most serious limitation. A preliminary application to SEASAT-SAR complex imagery was encouraging. Information about the long wave, if incorporated into a more sophisticated phase demodulation structure, i.e., at an earlier point in the algorithm, could conceivably mitigate this bandwidth limitation.

Harger, R. O.↗

Intercalibration of AMSR2 NASA Team 2 Algorithm Sea Ice Concentrations with AMSR-E Slow Rotation Data

Sea ice estimates from AMSR2 are intercalibrated with AMSR-E fields through a two-step process. First, slow rotation 2 r/min AMSR-E data is used to derive regression equations from colocated pairs of AMSR2 and AMSR-E brightness temperatures (Tb s). The regression equations are used to modify AMSR2 Tb s into AMSR-E equivalent Tb s that are then input into the NASA Team 2 (NT2) sea ice concentration algorithm used for the AMSR-E standard products. The regressed Tb s result in changes in sea ice concentration of a few percent compared to using the original un-regressed AMSR2 Tb s. Next, sea ice estimates from the F17 SSMIS sensor are used as a bridge to compare AMSR-E total sea ice extent estimates in 2010 with AMSR2 total sea ice extent estimates in 2013. Based on this comparison, a further adjustment is made to a weather filter threshold used in the NT2 algorithm to minimize the total extent bias between AMSR2 and AMSR-E using a double-differencing approach. The adjustments reduced apparent bias with AMSR-E from 200 000 km2 for the original unmodified AMSR2 Tb s to –700 and 4700 km2 for the Arctic and Antarctic, respectively. These differences are within the range of previous passive microwave sea ice intercalibrations. The adjusted AMSR2 sea ice fields provide a nearly 15-year time series of sea ice change; depending on the lifetime of AMSR2 and possible follow on sensors, AMSR2 has the potential to be part of a multidecadal record of sea ice change.

remote sensing↗

Triangular covariance factorizations for

An improved computational form of the discrete Kalman filter is derived using an upper triangular factorization of the error covariance matrix. The covariance P is factored such that P = UDUT where U is unit upper triangular and D is diagonal. Recursions are developed for propagating the U-D covariance factors together with the corresponding state estimate. The resulting algorithm, referred to as the U-D filter, combines the superior numerical precision of square root filtering techniques with an efficiency comparable to that of Kalman's original formula. Moreover, this method is easily implemented and involves no more computer storage than the Kalman algorithm. These characteristics make the U-D method an attractive realtime filtering technique. A new covariance error analysis technique is obtained from an extension of the U-D filter equations. This evaluation method is flexible and efficient and may provide significantly improved numerical results. Cost comparisons show that for a large class of problems the U-D evaluation algorithm is noticeably less expensive than conventional error analysis methods.

Thornton, C. L.↗

Statistical properties of filtered pseudorandom digital sequences formed from the sum of maximum-length sequences

The statistics of filtered pseudorandom digital sequences called hybrid-sum sequences, formed from the modulo-two sum of several maximum-length sequences, are analyzed. The results indicate that a relation exists between the statistics of the filtered sequence and the characteristic polynomials of the component maximum length sequences. An analysis procedure is developed for identifying a large group of sequences with good statistical properties for applications requiring the generation of analog pseudorandom noise. By use of the analysis approach, the filtering process is approximated by the convolution of the sequence with a sum of unit step functions. A parameter reflecting the overall statistical properties of filtered pseudorandom sequences is derived. This parameter is called the statistical quality factor. A computer algorithm to calculate the statistical quality factor for the filtered sequences is presented, and the results for two examples of sequence combinations are included. The analysis reveals that the statistics of the signals generated with the hybrid-sum generator are potentially superior to the statistics of signals generated with maximum-length generators. Furthermore, fewer calculations are required to evaluate the statistics of a large group of hybrid-sum generators than are required to evaluate the statistics of the same size group of approximately equivalent maximum-length sequences.

Wallace, G. R.↗

Formulation and implementation of a practical algorithm for non-stationary adaptive state estimation

Background information on the Kalman filter is given first. A discussion of the filter parameters and their a priori determination follows. The discussion points out the need for adaptive determination of the process noise statistics. The filter innovations are presented as a means for developing the adaptive criteria. The criteria center around the estimation of the true mean and covariance of the filter innovations. A method for the numerical approximation of the mean and covariance of a locally stationary random process is presented. The definition of a local stationarity is presented. Local stationarity allows for the separation of the process statistics into a stationary component and a time-varying component. The separation method is discussed. A method for estimating the stationary and time-varying components is presented. As an example of its application to real problems, the algorithm is applied to the problem to the problem of reentry trajectory estimation for the Space Shuttle. Both the adaptive algorithm and the steady-state Kalman filter are applied to the problem. The results of the reconstructions are presented. The adaptive algorithm exhibits superior performance.

Whitemore, S. A.↗