Volume 616, August 2018
|Number of page(s)||9|
|Section||Numerical methods and codes|
|Published online||07 August 2018|
Matched filter in low-number count Poisson noise regime: Efficient and effective implementation
Chip Computers Consulting s.r.l.,
Viale Don L. Sturzo 82,
S. Liberale di Marcon,
2 ESO, Karl Schwarzschild strasse 2, 85748 Garching, Germany
Accepted: 15 April 2018
The matched filter (MF) is widely used to detect signals hidden within the noise. If the noise is Gaussian, its performances are well-known and can be described in an elegant analytical form. The treatment of non-Gaussian noises is often cumbersome as in most cases there is no analytical framework. This is true also for Poisson noise which, especially in the low-number count regime, presents the additional difficulty to be discrete. For this reason in the past methods have been proposed based on heuristic or semi-heuristic arguments. Recently, an analytical form of the MF has been introduced but the computation of the probability of false detection or false alarm (PFA) is based on numerical simulations. To overcome this inefficient and time-consuming approach, we propose here an effective method to compute the PFA based on the saddle point approximation (SA). We provide the theoretical framework and support our findings by means of numerical simulations. We also discuss the limitations of the MF in practical applications.
Key words: methods: data analysis / methods: statistical / methods: numerical
© ESO 2018
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.