MétaCan
Menu
Back to cohort
Record W2735133106 · doi:10.1109/lsp.2017.2724848

Adaptive Kalman Filtering by Covariance Sampling

2017· article· en· W2735133106 on OpenAlexafffund
Akbar Assa, Konstantinos N. Plataniotis

Bibliographic record

VenueIEEE Signal Processing Letters · 2017
Typearticle
Languageen
FieldComputer Science
TopicTarget Tracking and Data Fusion in Sensor Networks
Canadian institutionsUniversity of Toronto
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsKalman filterCovarianceCovariance intersectionNoise (video)Computer scienceWhite noiseNoise measurementGaussian noiseCovariance matrixAlgorithmA priori and a posterioriEstimation of covariance matricesArtificial intelligenceExtended Kalman filterMathematicsControl theory (sociology)Pattern recognition (psychology)StatisticsNoise reduction

Abstract

fetched live from OpenAlex

It is well known that the performance of the Kalman filter deteriorates when the system noise statistics are not available a priori. In particular, the adjustment of measurement noise covariance is deemed paramount as it directly affects the estimation accuracy and plays the key role in applications such as sensor selection and sensor fusion. This letter proposes a novel adaptive scheme by approximating the measurement noise covariance distribution through finite samples, assuming the noise to be white with a normal distribution. Exploiting these samples in approximation of the system state a posteriori leads to a Gaussian mixture model (GMM), the components of which are acquired by Kalman filtering. The resultant GMM is then reduced to the closest normal distribution and also used to estimate the measurement noise covariance. Compared to previous adaptive techniques, the proposed method adapts faster to the unknown parameters and thus provides a higher performance in terms of estimation accuracy, which is confirmed by the simulation results.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.005
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.012
Threshold uncertainty score0.024

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.005
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0010.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.043
GPT teacher head0.274
Teacher spread0.231 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations58
Published2017
Admission routes2
Has abstractyes

Explore more

Same venueIEEE Signal Processing LettersSame topicTarget Tracking and Data Fusion in Sensor NetworksFrench-language works237,207