Improved A-Line and B-Line Detection in Lung Ultrasound Using Deep Learning with Boundary-Aware Dice Loss
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
Lung ultrasound (LUS) is a non-invasive bedside imaging technique for diagnosing pulmonary conditions, especially in critical care settings. A-lines and B-lines are important features in LUS images that help to assess lung health and identify changes in lung tissue. However, accurately detecting and segmenting these lines remains challenging, due to their subtle blurred boundaries. To address this, we propose TransBound-UNet, a novel segmentation model that integrates a transformer-based encoder with boundary-aware Dice loss to enhance medical image segmentation. This loss function incorporates boundary-specific penalties into a hybrid Dice-BCE formulation, allowing for more accurate segmentation of critical structures. The proposed framework was tested on a dataset of 4599 LUS images. The model achieved a Dice Score of 0.80, outperforming state-of-the-art segmentation networks. Additionally, it demonstrated superior performance in Specificity (0.97) and Precision (0.85), with a significantly reduced Hausdorff Distance of 15.13, indicating improved boundary delineation and overall segmentation quality. Post-processing techniques were applied to automatically detect and count A-lines and B-lines, demonstrating the potential of the segmented outputs in diagnostic workflows. This framework provides an efficient solution for automated LUS interpretation, with improved boundary precision.
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.001 |
| 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 it