Search NASA⌕ Search

SEARCH · Search NASA

Results for “recursive estimation”

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

Experiments with recursive estimation in astronomical image processing

Recursive estimation concepts were applied to image enhancement problems since the 70's. However, very few applications in the particular area of astronomical image processing are known. These concepts were derived, for 2-dimensional images, from the well-known theory of Kalman filtering in one dimension. The historic reasons for application of these techniques to digital images are related to the images' scanned nature, in which the temporal output of a scanner device can be processed on-line by techniques borrowed directly from 1-dimensional recursive signal analysis. However, recursive estimation has particular properties that make it attractive even in modern days, when big computer memories make the full scanned image available to the processor at any given time. One particularly important aspect is the ability of recursive techniques to deal with non-stationary phenomena, that is, phenomena which have their statistical properties variable in time (or position in a 2-D image). Many image processing methods make underlying stationary assumptions either for the stochastic field being imaged, for the imaging system properties, or both. They will underperform, or even fail, when applied to images that deviate significantly from stationarity. Recursive methods, on the contrary, make it feasible to perform adaptive processing, that is, to process the image by a processor with properties tuned to the image's local statistical properties. Recursive estimation can be used to build estimates of images degraded by such phenomena as noise and blur. We show examples of recursive adaptive processing of astronomical images, using several local statistical properties to drive the adaptive processor, as average signal intensity, signal-to-noise and autocorrelation function. Software was developed under IRAF, and as such will be made available to interested users.

Busko, I.↗

Application of Recursive Estimation to Heat Tracing for Groundwater/Surface‐Water Exchange

Abstract We present and demonstrate a recursive‐estimation framework to infer groundwater/surface‐water exchange based on temperature time series collected at different vertical depths below the sediment/water interface. We formulate the heat‐transport problem as a state‐space model (SSM), in which the spatial derivatives in the convection/conduction equation are approximated using finite differences. The SSM is calibrated to estimate time‐varying specific discharge using the Extended Kalman Filter (EKF) and Extended Rauch‐Tung‐Striebel Smoother (ERTSS). Whereas the EKF is suited to real‐time (“online”) applications and uses only the past and current measurements for estimation (filtering), the ERTSS is intended for near‐real time or batch‐processing (“offline”) applications and uses a window of data for batch estimation (smoothing). The two algorithms are demonstrated with synthetic and field‐experimental data and are shown to be efficient and rapid for the estimation of time‐varying flux over seasonal periods; further, the recursive approaches are effective in the presence of rapidly changing flux and (or) nonperiodic thermal boundary conditions, both of which are problematic for existing approaches to heat tracing of time‐varying groundwater/surface‐water exchange.

54 ENVIRONMENTAL SCIENCES↗

Recursive estimator for OSO-8 attitude

Modifications and enhancements that have been made to the Recursive Estimation Attitude Program (REAP) are discussed. Continuous attitudes for OSO-8 to + or - 0.05 degree accuracy are determined from Sun and star slit sensors mounted on the spinning portion of the spacecraft. The bulk of the attitude production is performed by a Weighted Least Squares (WLS) batch processor, but REAP is used for problem passes such as those involving gas jet maneuvers, sparse star fields, or star sensor saturation by high energy particles in the South Atlantic Anomaly.

Headrick, R. D.↗

Decision-directed adaptive recursive estimators - Divergence prevention.

A method is proposed for dealing with the divergence phenomenon problem encountered in applications of minimum-variance recursive estimators when the error covariance calculated by the estimator becomes inconsistent with the actual error covariance. The proposed method differs from previous ones in that the state model and statistics are accepted as given. The form of the optimal estimator is used, but a constant check is made on the consistency of the calculated and actual error covariances. The method is independent of the source of error, whether it be inaccuracies in the system model, incorrect values of the a priori and random process statistics, approximations required in the case of nonlinear systems, or computational roundoff. Several simulated examples, in which inconsistencies in the calculated and actual error covariances exist, show a significant improvement in the performance of the estimator when the given procedure is applied.

Nahi, N. E.↗

A Precision Recursive Estimate for Ephemeris Refinement (PREFER)

A recursive filter/smoother orbit determination program was developed to refine the ephemerides produced by a batch orbit determination program (e.g., CELEST, GEODYN). The program PREFER can handle a variety of ground and satellite to satellite tracking types as well as satellite altimetry. It was tested on simulated data which contained significant modeling errors and the results clearly demonstrate the superiority of the program compared to batch estimation.

Gibbs, B.↗

Recursive estimation of prior probabilities using the mixture approach

The problem of estimating the prior probabilities q sub k of a mixture of known density functions f sub k(X), based on a sequence of N statistically independent observations is considered. It is shown that for very mild restrictions on f sub k(X), the maximum likelihood estimate of Q is asymptotically efficient. A recursive algorithm for estimating Q is proposed, analyzed, and optimized. For the M = 2 case, it is possible for the recursive algorithm to achieve the same performance with the maximum likelihood one. For M 2, slightly inferior performance is the price for having a recursive algorithm. However, the loss is computable and tolerable.

Kazakos, D.↗