Artificial intelligence to detect buried objects
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
The detection of targets under the ground is an important procedure that is typically performed by a human non-automatically. Recent studies have automated this process using artificial intelligence (AI) based on radar images. There are three main steps before feeding reconstructed radar images to a neural network. The first step is segmentation which can make the detection task straightforward. We have proposed an Otsu-based segmentation algorithm in this paper. The proposed segmentation algorithm is effectively able to distinguish between all the targets. In the second step before employing AI to detect targets, a local sliding window has been taken into consideration to improve the results. The image is divided into smaller parts by this sliding window after it has been reconstructed. In the third step, two different methods have been considered for data augmentation. The first method is a novel approach for generating synthetic radar data. It is applied before radar image reconstruction based on the summation of two receivers’ signals with different coefficients. In the second augmentation method, some conventional data augmentation methods like flip and rotating are applied to complete this task. To discriminate targets from background, it is necessary to classify input images to AI-based aproaches. This task can be accomplished by classical machine learning approaches like the scalar vector machine (SVM). Gabor filters have been utilized in this paper to extract the features. There also exist two classification approaches using convolutional neural networks (CNN) to automatically detect targets after image reconstruction. Two different CNN have been implemented. Without data augmentation, the SVM-based approach works better than CNN, and its accuracy is 86.9%. Overall, the second CNN algorithm outperformed SVM after the data augmentation by reaching 96% accuracy.
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.
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.002 |
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 it