Revisiting the Emission Line Source Detection Problem in Integral Field Spectroscopic Data

Authors: Edmund Christian Herenz

Herenz, E. C. 2023, Astron. Nachr., e909
arXiv: 2212.00662v2 - DOI (astro-ph.IM)
Article published in AN
License: CC BY-NC-ND 4.0

Abstract: We present a 3-dimensional matched filtering approach for the blind search of faint emission-line sources in integral-field spectroscopic datasets. The filter is designed to account for the spectrally rapidly varying background noise due to the telluric air glow spectrum. A software implementation of this matched filtering search is implemented in an updated version of the Line Source Detection Cataloguing tool (LSDCat2.0). Using public data from the MUSE-Wide survey we show how the new filter design provides higher detection significances for faint emission line sources buried in between atmospheric [OH]-bands at $\lambda \gtrsim 7000$\,\AA{}. We also show how, for a given source parameterisation, the selection function of the improved algorithm can be derived analytically from the variances of the data. We verify this analytic solution against source insertion and recovery experiments in the recently released dataset of the MUSE eXtreme Deep Field (MXDF). We then illustrate how the selection function has to be re-scaled for 3D emission line source profiles that are not fully congruent with the template. This procedure alleviates the construction of realistic selection functions by removing the need for computationally cumbersome source insertion and recovery experiments.

Submitted to arXiv on 01 Dec. 2022

Explore the paper tree

Click on the tree nodes to be redirected to a given paper and access their summaries and virtual assistant

Also access our AI generated Summaries, or ask questions about this paper to our AI assistant.

Beta

Look for similar papers (in beta version)

By clicking on the button above, our algorithm compares the title and abstract of this paper with all the papers of the same arXiv category that we have summarized, and finds the closest ones. You can rerun it from time to time: the results improve as our database grows.