Bibliographic record
Abstract
Teaching digital signal processing at the graduate and undergraduate levels has a long tradition at universities. The signals include time series, still images, videos, and volumetric data such as radar and Doppler radar. The traditional topics such as spectral techniques in single-scale analysis and synthesis are now being expanded to include wavelet bases for multiscale analysis and synthesis [2]. The course described in this paper [1] expands the analysis to polyscale analysis and synthesis as it relates to self-affine processes and dynamical systems [3-4]. This course presents foundations of fractal (polyscale) and chaos theory, with applications to engineering. A unified approach to fractal dimensions provides tools for multiscale and polyscale analysis of time series, images, video, and other objects. Other topics include analysis and synthesis of mono- and multifractal coloured noise for research purposes, as well as stability analysis of dynamical systems, characterization of chaos using Lyapunov exponents, and reconstruction of strange attractors from experimental data. The course also provides a unified description of 19 different fractal dimensions grouped in four classes based on: set- morphology, entropy, spectrum, and variance. Special attention is given to (a) probability and pair-correlation algorithms for E-dimensional images and strange attractors, (b) batch and real-time computation of the variance fractal dimension, and (c) the Rényi dimension spectrum formulation for fractals and multifractals. The objective is to learn how to characterize multifractals through multi- and poly-scale analyses, and how to extract features for their classification. This paper describes the structure of the course, the set of topics covered, the set of course projects, and the lessons learned from the extensive experience with the course.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.003 |
| Insufficient payload (model declined to judge) | 0.045 | 0.020 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".