Symmetric Sampling Gate with Stored Charge Dumping

In view of the distortion in the filter gain matrix calculation as well as the high computational complexity and the nonlocal effect of symmetric sampling that exists in the UKF-SLAM algorithm, the square root UKF-SLAM algorithm based on the smallest proportion of skewness in single line sampling was proposed. According to the mended algorithm, the square root of covariance matrix is brought into iteration operation instead of covariance matrix, moreover, the smallest proportion of skewness in single line sampling is utilized for the optimization of sampling strategy. The results of simulation show that the algorithm can effectively improve the position accuracy in robot as well as the estimation accuracy of feature map. Furthermore, the computational complexity is reduced and the algorithm stability is improved.

Get full-text (via PubEx)

Symmetric sampling procedures, general epidemic processes and their threshold limit theorems

Journal of Applied Probability ◽

10.1017/s0021900200029594 ◽

1986 ◽

Vol 23 (02) ◽

pp. 265-282 ◽

Cited By ~ 24

Author(s):

Anders Martin-Löf

Keyword(s):

Limit Distribution ◽

Limit Theorems ◽

General Type ◽

Finite Population ◽

Binomial Sampling ◽

Threshold Limit ◽

Iterative Sampling ◽

Factorial Series ◽

Sampling Procedures ◽

Symmetric Sampling

Iterative sampling procedures of a general type in a finite population are considered. They generalize the Reed-Frost process in that binomial sampling is replaced by an arbitrary symmetric sampling defined by a factorial series distribution. Threshold limit theorems are proved saying that the total number of sampled objects is either small with a certain limit distribution, or a finite fraction of the population with a Gaussian limit distribution as the size of the population gets large. These results extend earlier ones for the Reed-Frost process [1], and are proved in a more direct way than before.

Get full-text (via PubEx)

Unscented transformation with scaled symmetric sampling strategy for precision estimation of total least squares

Studia Geophysica et Geodaetica ◽

10.1007/s11200-016-1113-0 ◽

2017 ◽

Vol 61 (3) ◽

pp. 385-411 ◽

Cited By ~ 17

Author(s):

Leyang Wang ◽

Yingwen Zhao

Keyword(s):

Least Squares ◽

Sampling Strategy ◽

Total Least Squares ◽

Unscented Transformation ◽

Precision Estimation ◽

Symmetric Sampling

Get full-text (via PubEx)

3-D symmetric sampling in theory and practice

The Leading Edge ◽

10.1190/1.1437882 ◽

1998 ◽

Vol 17 (11) ◽

pp. 1514-1519 ◽

Cited By ~ 3

Author(s):

Gijs J. O. Vermeer

Keyword(s):

Theory And Practice ◽

Symmetric Sampling

Get full-text (via PubEx)

Reply by authors to G. J. O. Vermeer

Geophysics ◽

10.1190/1.1486983 ◽

1990 ◽

Vol 55 (7) ◽

pp. 937-937

Author(s):

Peter F. Morse ◽

George F. Hildebrandt

Keyword(s):

Quick Test ◽

Ground Roll ◽

Symmetric Sampling

We thank Gijs Vermeer for his interesting comments on our article. The focus of his discussion is to explain why residual ground roll remains on the stacked sections of Figures 13 and 14 even after using the optimal stackarray. He reasons that right‐dipping residual ground‐roll events can be explained by the presence of off‐line scatterers. He further argues that symmetric sampling of the ground roll in both shot‐and‐receiver domains would mitigate this effect, and proposes a quick test involving reprocessing of our Humble data using only every fifth receiver group (which would result in symmetric sampling).

Get full-text (via PubEx)