Euclid Quick Data Release (Q1). Searching for giant gravitational arcs in galaxy clusters with mask region-based convolutional neural networks
Bibliographic record
Abstract
Strong gravitational lensing (SL) by galaxy clusters is a powerful probe of their inner mass distribution and a key test bed for cosmological models. However, the detection of SL events in wide-field surveys such as Euclid requires robust, automated methods capable of handling the immense data volume generated. In this work, we present an advanced deep learning (DL) framework based on mask region-based convolutional neural networks (Mask R-CNNs), designed to autonomously detect and segment bright, strongly-lensed arcs in Euclid's multi-band imaging of galaxy clusters. The model is trained on a realistic simulated data set of cluster-scale SL events, constructed by injecting mock background sources into Euclidised Hubble Space Telescope images of 10 massive lensing clusters, exploiting their high-precision mass models constructed with extensive spectroscopic data. The network is trained and validated on over 4500 simulated images, and tested on an independent set of 500 simulations, as well as real Euclid Quick Data Release (Q1) observations. The trained network achieves high performance in identifying gravitational arcs in the test set, with a precision and recall of 76% and 58%, respectively, processing 2'x2' images in a fraction of a second. When applied to a sample of visually confirmed Euclid Q1 cluster-scale lenses, our model recovers 66% of gravitational arcs above the area threshold used during training. While the model shows promising results, limitations include the production of some false positives and challenges in detecting smaller, fainter arcs. Our results demonstrate the potential of advanced DL computer vision techniques for efficient and scalable arc detection, enabling the automated analysis of SL systems in current and future wide-field surveys. The code, ARTEMIDE, is open source and will be available at github.com/LBasz/ARTEMIDE.
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.001 |
| Meta-epidemiology (broad) | 0.000 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.004 | 0.004 |
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".