MétaCan
Menu
Back to cohort
Record W3082578808 · doi:10.1109/tci.2020.3019137

Fast Multi-Focus Ultrasound Image Recovery Using Generative Adversarial Networks

2020· article· en· W3082578808 on OpenAlex

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.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueIEEE Transactions on Computational Imaging · 2020
Typearticle
Languageen
FieldComputer Science
TopicAdvanced Image Processing Techniques
Canadian institutionsConcordia University
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsFocus (optics)Computer scienceArtificial intelligenceFrame rateComputer visionImage resolutionFrame (networking)Image (mathematics)Boundary (topology)Mean squared errorDeep learningImage restorationImage processingMathematicsOpticsStatisticsTelecommunications

Abstract

fetched live from OpenAlex

In conventional ultrasound (US) imaging, it is common to transmit several focused beams at multiple locations to generate a multi-focus image with constant lateral resolution throughout the image. However, this method comes at the expense of a loss in temporal resolution, which is important in applications requiring both high-frame rate and constant lateral resolution. Moreover, relative motions of the target with respect to the probe often exist due to hand tremors or biological motions, causing blurring artifacts in the multi-focus image. This article introduces a novel approach for multi-focus US image recovery based on Generative Adversarial Network (GAN) without a reduction in the frame-rate. Herein, a mapping function between the single-focus US image and multi-focus version for having a constant lateral resolution everywhere is estimated through different GANs. We use adversarial loss functions in addition to Mean Square Error (MSE) to generate more realistic ultrasound images. Moreover, we use the boundary seeking method for improving the stability of training, which is currently the main challenge in using GANs. Experiments on simulated and real phantoms as well as on ex vivo data are performed. Results confirm that having both adversarial loss function and boundary seeking training provides better results in terms of the mean opinion score test. Furthermore, the proposed method enhances the resolution and contrast indexes without sacrificing the frame-rate. As for the comparison with other approaches which are not based on NNs, the proposed approach gives similar results while requiring neither channel data nor computationally expensive algorithms.

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 imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.323
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0010.000
Scholarly communication0.0000.002
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.027
GPT teacher head0.286
Teacher spread0.260 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it