scholarly journals A priori fixed covariance matrices of disturbance estimators

1972 ◽  
Vol 3 (4) ◽  
pp. 413-436 ◽  
Author(s):  
C. Dubbelman
Keyword(s):  
A Priori ◽  
2021 ◽  
Author(s):  
Nalini Arasavali ◽  
Sasibhushanarao Gottapu

Abstract Kalman filter (KF) is a widely used navigation algorithm, especially for precise positioning applications. However, the exact filter parameters must be defined a priori to use standard Kalman filters for coping with low error values. But for the dynamic system model, the covariance of process noise is a priori entirely undefined, which results in difficulties and challenges in the implementation of the conventional Kalman filter. Kalman Filter with recursive covariance estimation applied to solve those complicated functional issues, which can also be used in many other applications involving Kalaman filtering technology, a modified Kalman filter called MKF-RCE. While this is a better approach, KF with SAR tuned covariance has been proposed to resolve the problem of estimation for the dynamic model. The data collected at (x: 706970.9093 m, y: 6035941.0226 m, z: 1930009.5821 m) used to illustrate the performance analysis of KF with recursive covariance and KF with computational intelligence correction by means of SAR (Search and Rescue) tuned covariance, when the covariance matrices of process and measurement noises are completely unknown in advance.


2015 ◽  
Author(s):  
Guilherme Garcia ◽  
Felipe Bandoni de Oliveira ◽  
Gabriel Marroig

The study of modularity in morphological systems has increased in the past twenty years, parallel to the popularization of geometric morphometrics, which has led to the emergence of different criteria for detecting modularity on landmark data. However, compared to usual covariance matrix estimators, Procrustes estimators have properties that hinder their use. Here, we compare different representations of form, focusing on detecting modularity patterns defineda priori; we also compare two metrics: one derived from traditional morphometrics (MHI) and another that emerged in the context of landmark data (RV). Using Anthropoid skulls, we compare these metrics over three representations of form: interlandmark distances, Procrustes residuals, and local shape variables. Over Procrustes residuals, both tests fail to detect modularity patterns, while in remaining representations they show the distinction between early and late development in skull ontogeny. To estimate type I and II error rates, we built covariance matrices of known structure; these tests indicate that, considering both effect and sample sizes, tests using MHI are more robust than those using RV. However, both metrics have low power when used on Procrustes residuals. Thus, we conclude that the influence of development and function is poorly represented on Procrustes estimators for covariance matrices.


2014 ◽  
Vol 10 (S306) ◽  
pp. 99-103 ◽  
Author(s):  
Benjamin Joachimi ◽  
Andy Taylor

AbstractCurrent and forthcoming cosmological data analyses share the challenge of huge datasets alongside increasingly tight requirements on the precision and accuracy of extracted cosmological parameters. The community is becoming increasingly aware that these requirements not only apply to the central values of parameters but, equally important, also to the error bars. Due to non-linear effects in the astrophysics, the instrument, and the analysis pipeline, data covariance matrices are usually not well known a priori and need to be estimated from the data itself, or from suites of large simulations. In either case, the finite number of realisations available to determine data covariances introduces significant biases and additional variance in the errors on cosmological parameters in a standard likelihood analysis. Here, we review recent work on quantifying these biases and additional variances and discuss approaches to remedy these effects.


1984 ◽  
Vol 44 (2) ◽  
pp. 255-264
Author(s):  
K. Terry Schurr ◽  
L. W. Henriksen
Keyword(s):  
A Priori ◽  

Author(s):  
Amber Srivastava ◽  
Mayank Baranwal ◽  
Srinivasa Salapaka

Typically clustering algorithms provide clustering solutions with prespecified number of clusters. The lack of a priori knowledge on the true number of underlying clusters in the dataset makes it important to have a metric to compare the clustering solutions with different number of clusters. This article quantifies a notion of persistence of clustering solutions that enables comparing solutions with different number of clusters. The persistence relates to the range of dataresolution scales over which a clustering solution persists; it is quantified in terms of the maximum over two-norms of all the associated cluster-covariance matrices. Thus we associate a persistence value for each element in a set of clustering solutions with different number of clusters. We show that the datasets where natural clusters are a priori known, the clustering solutions that identify the natural clusters are most persistent - in this way, this notion can be used to identify solutions with true number of clusters. Detailed experiments on a variety of standard and synthetic datasets demonstrate that the proposed persistence-based indicator outperforms the existing approaches, such as, gap-statistic method, X-means, Gmeans, PG-means, dip-means algorithms and informationtheoretic method, in accurately identifying the clustering solutions with true number of clusters. Interestingly, our method can be explained in terms of the phase-transition phenomenon in the deterministic annealing algorithm, where the number of distinct cluster centers changes (bifurcates) with respect to an annealing parameter.


Author(s):  
D. E. Luzzi ◽  
L. D. Marks ◽  
M. I. Buckett

As the HREM becomes increasingly used for the study of dynamic localized phenomena, the development of techniques to recover the desired information from a real image is important. Often, the important features are not strongly scattering in comparison to the matrix material in addition to being masked by statistical and amorphous noise. The desired information will usually involve the accurate knowledge of the position and intensity of the contrast. In order to decipher the desired information from a complex image, cross-correlation (xcf) techniques can be utilized. Unlike other image processing methods which rely on data massaging (e.g. high/low pass filtering or Fourier filtering), the cross-correlation method is a rigorous data reduction technique with no a priori assumptions.We have examined basic cross-correlation procedures using images of discrete gaussian peaks and have developed an iterative procedure to greatly enhance the capabilities of these techniques when the contrast from the peaks overlap.


Author(s):  
H.S. von Harrach ◽  
D.E. Jesson ◽  
S.J. Pennycook

Phase contrast TEM has been the leading technique for high resolution imaging of materials for many years, whilst STEM has been the principal method for high-resolution microanalysis. However, it was demonstrated many years ago that low angle dark-field STEM imaging is a priori capable of almost 50% higher point resolution than coherent bright-field imaging (i.e. phase contrast TEM or STEM). This advantage was not exploited until Pennycook developed the high-angle annular dark-field (ADF) technique which can provide an incoherent image showing both high image resolution and atomic number contrast.This paper describes the design and first results of a 300kV field-emission STEM (VG Microscopes HB603U) which has improved ADF STEM image resolution towards the 1 angstrom target. The instrument uses a cold field-emission gun, generating a 300 kV beam of up to 1 μA from an 11-stage accelerator. The beam is focussed on to the specimen by two condensers and a condenser-objective lens with a spherical aberration coefficient of 1.0 mm.


Sign in / Sign up

Export Citation Format

Share Document