An algorithm for estimating parameters of a group of closely spaced random processes: Synthesis, analysis, and modeling (Q1286548)
From MaRDI portal
| This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An algorithm for estimating parameters of a group of closely spaced random processes: Synthesis, analysis, and modeling |
scientific article; zbMATH DE number 1283818
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An algorithm for estimating parameters of a group of closely spaced random processes: Synthesis, analysis, and modeling |
scientific article; zbMATH DE number 1283818 |
Statements
An algorithm for estimating parameters of a group of closely spaced random processes: Synthesis, analysis, and modeling (English)
0 references
20 July 1999
0 references
The paper is devoted to the estimation of the track parameters of closely spaced targets moving in a space where the coordinates are measured directly. The observation conditions are assumed to be such that probabilities of disappearance of a mark or appearance of a false mark are negligible. Under these conditions, the main problem of estimating track parameters consists in comparing the marks given to the observed target in the current frame. A Bayes method of solution is chosen. It is demonstrated that this algorithm is branching and its realization in practice is very difficult. In addition, to an optimal algorithm, a quasi-optimal one is considered. Some considerations on the practical realization of modified Bayes algorithms and on the results of numerical modeling are presented. The problem is solved in discrete time.
0 references
quasi-optimal algorithm
0 references
branching algorithm
0 references
estimation of the track parameters
0 references
Bayes method
0 references
0.84583765
0 references
0.84442854
0 references
0.8442895
0 references
0.8421468
0 references
0.8396707
0 references