Ultrasonic signal denoising based on autoencoder
Bibliographic record
Abstract
At present, denoising parameters in different signal processing algorithms require a specific signal waveform to be set. Human factors would significantly affect the denoising result. To solve this problem, we proposed a signal adaptive denoising method based on a denoising autoencoder to achieve denoising on ultrasonic signals. By applying this method to sample signals and comparing with the singular value decomposition (SVD), principal component analysis (PCA), and wavelet algorithms, it is found that this method can effectively suppress the noise at different noise intensities. Using the signal to noise ratio, root mean square error, and autocorrelation coefficient as evaluation parameters in the experiment, the overall denoising effect of the proposed method is better than that of PCA, and this method is better than the wavelet and SVD algorithms having a relatively weak noise intensity. In addition, by comparing the reconstructed signal curve of the proposed method and that of the wavelet algorithm, the proposed method can retain the information of signal saltation with a better performance. Finally, we apply this method for processing ultrasonic signals and verify its effectiveness from time and frequency domain diagrams.
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.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.000 |
| 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".