mlsanityData to 14 Oct 2026

Closely-Spaced Object Classification Using MuyGPyS

arXiv 2311.10904 ↗First posted 17 Nov 2023cs.CV physics.data-an physics.ins-detcited by 2

Not on the map. Why?

Abstract (arXiv)

Accurately detecting rendezvous and proximity operations (RPO) is crucial for understanding how objects are behaving in the space domain. However, detecting closely-spaced objects (CSO) is challenging for ground-based optical space domain awareness (SDA) algorithms as two objects close together along the line-of-sight can appear blended as a single object within the point-spread function (PSF) of the optical system. Traditional machine learning methods can be useful for differentiating between singular objects and closely-spaced objects, but many methods require large training sample sizes or high signal-to-noise conditions. The quality and quantity of realistic data make probabilistic classification methods a superior approach, as they are better suited to handle these data inadequacies. We present CSO classification results using the Gaussian process python package, MuyGPyS, and examine classification accuracy as a function of angular separation and magnitude difference between the simulated satellites. This orbit-independent analysis is done on highly accurate simulated SDA images that emulate realistic ground-based commercial-of-the-shelf (COTS) optical sensor observations of CSOs. We find that MuyGPyS outperforms traditional machine learning methods, especially under more challenging circumstances.

Key facts. Cited by 2 papers in the map (data through 14 Oct 2026). Builds on 2 of its 8 references that are in the map. First posted on arXiv 17 Nov 2023.

Builds on

2 of 8 references.

References · 2

  1. 2021MuyGPs: Scalable Gaussian Process Hyperparameter Estimation Using Local Cross-Validationcited by 8
  2. 2022Light curve completion and forecasting using fast and scalable Gaussian processes (MuyGPs)cited by 1

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 1.

2 papers.