MétaCan
Menu
Back to cohort
Record W1939477843 · doi:10.1109/icassp.1985.1168333

Sufficient codition for extendibility and two-dimensional power spectrum estimation

2005· article· en· W1939477843 on OpenAlex
C.L. Nikias, A. Venetsanopoulos

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicAdvanced Adaptive Filtering Techniques
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsToeplitz matrixAutocorrelationMathematicsQuadratic growthPositive definitenessMatrix (chemical analysis)Applied mathematicsMatrix decompositionSpectrum (functional analysis)Eigendecomposition of a matrixAutocorrelation matrixIterative methodAlgorithmSymmetric matrixSpectral densityMathematical optimizationPositive-definite matrixPure mathematicsEigenvalues and eigenvectorsStatistics

Abstract

fetched live from OpenAlex

A sufficient condition for the extendibility of two-dimensional (2-d) quadratically symmetric autocorrelation samples is derived based on matrix decomposition approaches. This condition is very simple to test because it boils down to a positive definiteness checking of a set of Toeplitz form matrices. It is shown by means of examples that this sufficient condition can be very useful, in some cases, by making the tedious extendibility test unnecessary. This paper also presents a method which can approximate with small error a given quadratically symmetric autocorrelation function (a.c.f) over a square with a new a.c.f that is guaranteed to be extendible. This method is also based on a matrix decomposition approach and employs an iterative gradient algorithm. Its implications to the estimation of a 2-d power spectrum is demonstrated.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation 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: Empirical · Consensus signal: none
Teacher disagreement score0.471
Threshold uncertainty score0.319

Codex and Gemma teacher scores by category

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

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.010
GPT teacher head0.257
Teacher spread0.247 · 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

Quick stats

Citations0
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicAdvanced Adaptive Filtering TechniquesFrench-language works237,207