Bibliographic record
Abstract
Windowed transforms have been used for many years to provide time/frequency or space/wavenumber decompositions for constructing localized wave operators. Construction of an invertible windowed transform that allows for manipulation of localized plane waves has proven to be a difficult task. As a possible solution, we describe a Generalized Windowed Transform (GWT) framework that collects ideas and algorithms from a variety of sources (i.e. windowed Fourier transforms, filter banks, Gaussian beams, beamlets, wavelet transforms, curvelets, etc.) for constructing localized plane wave decompositions with high sparsity. The GWT framework exploits familiar concepts from signal processing in the Fourier domain along with computational efficiencies of the Fast Fourier transform to construct invertible local plane wave decompositions with low redundancy and reasonable computational efficiency. The windowing framework is based on filter bank theory for wavelet transforms in the frequency domain, with extensions that replace sub-band aliasing in window overlap zones with blending, and a computational structure based on the Fast Fourier transform. The classical normalization and aliasing constraints of the wavelet transform are satisfied by the GWT with redundancy factors less than 2. Multidimensional transforms are constructed in a fashion analogous to Fourier transforms, using repeated application of the 1D GWT along each axis of a higher dimensional object. Shift and derivative operators with reasonable computational complexity are constructed using localization constraints and the FFT butterfly algorithm. Examples are provided that show the application of the GWT to time-frequency analysis, image dip filtering, and image compression. The sparsity of the GWT for a given signal to noise ratio exceeds that of curvelet transform for band-limited seismic data.
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.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.003 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.003 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.009 | 0.004 |
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".