Abstract

In the context of upcoming large-scale surveys like Euclid, the necessity for the automation of strong lens detection is essential. While existing machine learning pipelines heavily rely on the classification probability (P), this study intends to address the importance of integrating additional metrics, such as Information Content (IC) and the number of pixels above the segmentation threshold ([Formula: see text]), to alleviate the false positive rate in unbalanced data-sets. In this work, we introduce a segmentation algorithm (U-Net) as a supplementary step in the established strong gravitational lens identification pipeline (Denselens), which primarily utilizes [Formula: see text] and [Formula: see text] parameters for the detection and ranking. The results demonstrate that the inclusion of segmentation enables significant reduction of false positives by approximately 25per cent in the final sample extracted from DenseLens, without compromising the identification of strong lenses. The main objective of this study is to automate the strong lens detection process by integrating these three metrics. To achieve this, a decision tree-based selection process is introduced, applied to the Kilo Degree Survey (KiDS) data. This process involves rank-ordering based on classification scores ([Formula: see text]), filtering based on Information Content ([Formula: see text]), and segmentation score ([Formula: see text]). Additionally, the study presents 14 newly discovered strong lensing candidates identified by the U-Denselens network using the KiDS DR4 data.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.