Hubble Asteroid Hunter: II. Identifying strong gravitational lenses in HST images with crowdsourcing
Authors: Emily O. Garvin, Sandor Kruk, Claude Cornen, Rachana Bhatawdekar, Raoul Cañameras, Bruno Merín
Abstract: The Hubble Space Telescope (HST) archives constitute a rich dataset of high resolution images to mine for strong gravitational lenses. While many HST programs specifically target strong lenses, they can also be present by coincidence in other HST observations. We aim to identify non-targeted strong gravitational lenses in almost two decades of images from the ESA it Hubble Space Telescope archive (eHST), without any prior selection on the lens properties. We used crowdsourcing on the Hubble Asteroid Hunter (HAH) citizen science project to identify strong lenses, alongside asteroid trails, in publicly available large field-of-view HST images. We visually inspected 2354 objects tagged by citizen scientists as strong lenses to clean the sample and identify the genuine lenses. We report the detection of 252 strong gravitational lens candidates, which were not the primary targets of the HST observations. 198 of them are new, not previously reported by other studies, consisting of 45 A grades, 74 B grades and 79 C grades. The majority are galaxy-galaxy configurations. The newly detected lenses are, on average, 1.3 magnitudes fainter than previous HST searches. This sample of strong lenses with high resolution HST imaging is ideal to follow-up with spectroscopy, for lens modelling and scientific analyses. This paper presents an unbiased search of lenses, which enabled us to find a high variety of lens configurations, including exotic lenses. We demonstrate the power of crowdsourcing in visually identifying strong lenses and the benefits of exploring large archival datasets. This study shows the potential of using crowdsourcing in combination with artificial intelligence for the detection and validation of strong lenses in future large-scale surveys such as ESA's future mission Euclid or in JWST archival images.
Explore the paper tree
Click on the tree nodes to be redirected to a given paper and access their summaries and virtual assistant
Look for similar papers (in beta version)
By clicking on the button above, our algorithm will scan all papers in our database to find the closest based on the contents of the full papers and not just on metadata. Please note that it only works for papers that we have generated summaries for and you can rerun it from time to time to get a more accurate result while our database grows.