Non‐minimum phase wavelet estimation by non‐linear optimization of all‐pass operators
Bibliographic record
Abstract
ABSTRACT Convolution of a minimum‐phase wavelet with an all‐pass wavelet provides a means of varying the phase of the minimum‐phase wavelet without affecting its amplitude spectrum. This observation leads to a parametrization of a mixed‐phase wavelet being obtained in terms of a minimum‐phase wavelet and an all‐pass operator. The Wiener–Levinson algorithm allows the minimum‐phase wavelet to be estimated from the data. It is known that the fourth‐order cumulant preserves the phase information of the wavelet, provided that the underlying reflectivity sequence is a non‐Gaussian, independent and identically distributed process. This property is used to estimate the all‐pass operator from the data that have been whitened by the deconvolution of the estimated minimum‐phase wavelet. Wavelet estimation based on a cumulant‐matching technique is dependent on the bandwidth‐to‐central‐frequency ratio of the data. For the cumulants to be sensitive to the phase signatures, it is imperative that the ratio of bandwidth to central frequency is at least greater than one, and preferably close to two. Pre‐whitening of the data with the estimated minimum‐phase wavelet helps to increase the bandwidth, resulting in a more favourable bandwidth‐to‐central‐frequency ratio. The proposed technique makes use of this property to estimate the all‐pass wavelet from the prewhitened data. The paper also compares the results obtained from both prewhitened and non‐whitened data. The results show that the use of prewhitened data leads to a significant improvement in the estimation of the mixed‐phase wavelet when the data are severely band‐limited. The proposed algorithm was further tested on real data, followed by a test involving the introduction of a 90°‐phase‐rotated wavelet and then recovery of the wavelet. The test was successful.
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.002 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.000 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.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.
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".