Estimating source locations of unexploded ordnance using the multiple signal classification algorithm
Bibliographic record
Abstract
ABSTRACT To extract intrinsic polarization parameters of a buried object from electromagnetic induction (EMI) responses, one has to first find its location. We developed an efficient method to find the approximate locations of multiple ordnance items using time domain electromagnetic data. The procedure was based upon the principle of multiple signal classification which exploits the orthogonality of signal and noise subspaces of multistatic EMI data. For an arbitrary multistatic array, we formulated transmitter-based and receiver-based imaging or steering vectorial operators that related with the left and right singular vectors of a multistatic response matrix. The operators were computed at potential source locations and are mapped onto the noise subspaces derived from data. A spatial metric function was therefore introduced to measure the magnitude of the projection. A 3D source imaging of the metric function could be obtained by evaluating all potential locations over a region of interest. In ideal cases, the perfect orthogonality between the computed signal subspace and measured noisy subspace can be achieved at or near a target location, and rendered an imaging peak at that location. Conversely, the peak image locations obtained from this technique were used as the indicators for where targets were most likely present. The number of targets could be estimated from the rank of the data matrix, provided there were a sufficient number of transmitters and receivers. In some instances the locations of multiple targets were imaged directly, but the procedure was enhanced by stripping the effect of a larger or shallower target from the image. The technique was evaluated using the test-stand and field data, and compared with the standard nonlinear inversion. The results showed that it has potential capability to accurately localize sources in EMI sensing.
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.002 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 0.001 |
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".