Nearest-Neighbor Clutter Removal for Estimating Features in Spatial Point Processes
We consider the problem of detecting features in spatial point processes in the presence of substantial clutter. One example is the detection of minefields using reconnaissance aircraft images that identify many objects that are not mines. Our solution uses \(K\)th nearest neighbor distances of points in the process to classify them as clutter or otherwise. The observed \(K\)th nearest neighbor distances are modeled as a mixture distribution, the parameters of which are estimated by a simple EM algorithm. This method allows for detection of generally shaped features that need not be path connected. In the minefield example this method yields high detection and low false-positive rates. Another application, to outlining seismic faults, is considered with some success. The method works well in high dimensions. The method can also be used to produce very high-breakdown-point-robust estimators of a covariance matrix.
- Bayesian nearest-neighbor analysis via record value statistics and nonhomogeneous spatial Poisson processes
- Cluster-wise assessment of cluster stability
- Clusters, outliers, and regression: Fixed point clusters
- Clustering multivariate functional data in group-specific functional subspaces
- Central limit theorems for \(k\)-nearest neighbour distances
- Estimation of linear target-layer trajectories using cluttered point cloud data
- A Bayesian mixture model to quantify parameters of spatial clustering
- Breakdown points for maximum likelihood estimators of location-scale mixtures
- Robust clustering around regression lines with high density regions
- Classification of events using local pair correlation functions for spatial point patterns
- A spatial correlation-based anomaly detection method for subsurface modeling
- Outlier identification in model-based cluster analysis
- A review of robust clustering methods
- An adaptive level set evolution equation for contour extraction
- Parsimonious mixtures of multivariate contaminated normal distributions
- Clustering in the Presence of Scatter
- Detecting Features in Spatial Point Processes with Clutter via Model-Based Clustering
- Nonparametric Maximum Likelihood Estimation of Features in Spatial Point Processes Using Voronoi Tessellation
- scientific article; zbMATH DE number 2073348 (Why is no real title available?)
- Solution path clustering with adaptive concave penalty
- Mechanism and a new algorithm for nonconvex clustering
- Robust clustering method in the presence of scattered observations
- An adequacy approach for deciding the number of clusters for OTRIMLE robust Gaussian mixture‐based clustering
- Merging K-means with hierarchical clustering for identifying general-shaped groups
- Spatio-temporal classification in point patterns under the presence of clutter
- Point process models for sweat gland activation observed with noise
- What you see is not what is there: mechanisms, models and methods for point pattern deviations
- Clustering in point processes on linear networks using nearest neighbour volumes
- Distance-based parametric bootstrap tests for clustering of species ranges
- A network flow approach in finding maximum likelihood estimate of high concentration regions
- Significance tests for unsupervised pattern discovery in large continuous multivariate data sets
- Spatial point process models of defensive strategies: detecting changes
This page was built for publication: Nearest-Neighbor Clutter Removal for Estimating Features in Spatial Point Processes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4216952)
