Selecting the Kth nearest-neighbour for clutter removal in spatial point processes through segmented regression models

We consider the problem of feature detection, in the presence of clutter in spatial point processes. A previous study addresses the issue of the selection of the best nearest neighbour for clutter removal. We outline a simple workflow to automatically estimate the number of nearest neighbours by means of segmented regression models applied to an entropy measure of cluster separation. The method is suitable for a feature with clutter as two superimposed Poisson processes on any twodimensional space, including linear networks. We present simulations to illustrate the method and an application to the problem of seismic fault detection.