Structure-Aware Compressive Sensing for Magnetic Flux Leakage Detectors: Theory and Experimental Validation
Bibliographic record
Abstract
Compressive sensing (CS) has emerged as a promising technique for collecting and reconstructing digital signals. In this article, we design a CS method for magnetic flux leakage (MFL) detectors based on the problem's physics. A method is presented to reconstruct x and y components of magnetic B <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">→</sup> field using a few samples. First, the problem is formulated into an optimization framework where the goal is to minimize Euclidean distance between real and reconstructed signals while preserving the CS acquisition criteria. The resulting optimizations are then simplified and solved through the established majorization minimization (MM) method. Meanwhile, a Gaussian sampling strategy is adopted where samples with more information have a higher chance of being selected. Validation of the proposed method is accomplished through the performance comparison among the proposed method and several established high-performance CS techniques on gathered experimental data. The extensive validation of the signals gathered from 17 artificial defects on the 12-m pipe reveals that the signals can be compressed and recovered with exceptional fidelity when the problem's physical structure is known.
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 distilled prediction
Teacher imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 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 teacher head, 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".