MétaCan
Menu
Back to cohort
Record W1910715712 · doi:10.1109/ccece.1993.332439

Approximation of spectrogrammes by cubic splines using the Kalman filter

2002· article· en· W1910715712 on OpenAlexaff
Pierre Étienne Eugène Brouard, Roman Z. Morawski, A. Barwicz

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Data Processing Techniques
Canadian institutionsUniversité du Québec à Trois-Rivières
Fundersnot available
KeywordsKalman filterSpline (mechanical)Convolution (computer science)Applied mathematicsAlgorithmMathematicsSet (abstract data type)Computer scienceArtificial intelligenceArtificial neural network

Abstract

fetched live from OpenAlex

The raw spectrogrammes are subject to systematic errors of an instrumental type that may be reduced provided a mathematical model of the instrumental imperfections is identified. It is assumed in the paper that this model has the form of an integral, convolution-type equation of the first kind. The correction of the spectrogrammes consists in numerically solving this equation on the basis of the noisy data acquired by a spectrometer. An algorithm of correction is proposed which is based on the approximation of the solution with a spline function whose parameters are determined by means of a recursive Kalman-filter-based algorithm with a non-negativity constraint imposed on the set of feasible solutions. It is shown, using synthetic and real spectrophotometric data, that an improvement in the quality of correction is attained.>

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.003
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.024
Threshold uncertainty score0.048

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.027
GPT teacher head0.252
Teacher spread0.225 · 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

Citations0
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Data Processing TechniquesFrench-language works237,207