Towards Reliable Detection of Empty Space: Conditional Marked Point Processes for Object Detection

Tobias Riedlinger, Kira Maag, Hanno Gottschalk

Introduction

Current state-of-the-art object detectors, such as YOLO or Faster R-CNN, are highly optimized for performance metrics like mean Average Precision (mAP). However, they lack a solid probabilistic foundation. While these models assign "objectness" scores to their predictions, they remain notoriously silent about areas where no objects are detected.

In safety-critical applications like autonomous driving, a lack of detection is often dangerously interpreted as "safe to drive." Standard models do not actually quantify the probability that an empty region is truly obstacle-free. This "overconfidence in nothingness" poses a significant risk. While semantic segmentation can estimate "void" classes, these models typically treat pixels as independent, leading to poorly calibrated confidence scores when aggregated over a larger region.

To address this, researchers have introduced a mathematically principled object detection framework based on Conditional Marked Point Processes (CMPPP). Unlike standard detectors, this approach yields reliable, calibrated probability estimates for "empty space," fulfilling a critical requirement for safe autonomous navigation.

Bridging Deep Learning and Spatial Statistics

The authors bridge the gap between deep learning and spatial statistics by modeling bounding box data as realizations of a Marked Point Process (MPP).

Visual comparison of segmentation, intensity mapping, and bounding box detection.

The methodology is built on several core pillars:

  • Point Process Foundation: The model treats object centers as spatial "point events" and their properties (such as width, height, and class) as "marks" attached to those points.
  • Intensity Modeling: A neural network backbone (e.g., ResNet or HRNet) predicts an "intensity function" ($\lambda$) across the image. High intensity indicates a high probability of an object center.
  • Likelihood-based Training: Instead of relying on heuristic loss functions, the authors derive a loss based on the negative log-likelihood of a Conditional Marked Poisson Point Process. Achieved using the Radon-Nikodym derivative, this provides a rigorous statistical framework for end-to-end training.
  • Void Confidence: Because the model is grounded in Poisson statistics, the probability that a specific region $A$ contains zero objects is mathematically defined as $\exp(-\int_A \lambda(\xi) d\xi)$. This provides a reliable "drivable area" confidence.
  • Inference via Counting: Instead of standard Non-Maximum Suppression (NMS), the framework uses the counting statistics of the point process to determine the expected number of objects and extracts peaks directly from the intensity map.

Key Insights

This approach introduces several paradigm shifts in how we handle object detection uncertainty:

  1. Principled Uncertainty: Empty space is no longer just the absence of a detection; it is a measurable statistical state. By integrating the intensity function over a region, the model provides a cumulative confidence that is far more reliable than multiplying independent pixel probabilities.
  2. Zero Training Hyperparameters: Because the framework is likelihood-based, parameters like the scale of bounding box residuals can be solved analytically via Maximum Likelihood Estimation (MLE). This removes the need for the manual tuning of loss weights common in other detectors.
  3. Fixing the Independence Fallacy: Standard segmentation models often become "underconfident" over large regions because they assume every pixel is an independent coin flip. The CMPPP approach uses a "counting logic" that scales correctly with the size of the queried area.

Results and Performance

The method was evaluated on three diverse datasets representing different use cases for empty space detection: Cityscapes (urban driving), VisDrone (aerial footage), and TiROD (mobile robotics).

Calibration plot showing a massive reduction in Expected Calibration Error (ECE) for empty space detection.
  • Superior Calibration: The CMPPP method achieved orders of magnitude better calibration for empty space than semantic segmentation baselines. On the Cityscapes dataset, the Expected Calibration Error (ECE) for empty regions was reduced drastically from ~0.2245 (using DeepLabv3+) to just ~0.0029.
  • Competitive Detection: While the primary goal was reliability, the model remains competitive in standard detection tasks. On Cityscapes, the DeepLabv3+ CMPPP achieved a mAP of 49.43%, holding its own against highly optimized traditional detectors.
  • Efficiency: The model scales well with existing architectures, running at approximately 16.2 FPS with a DeepLabv3+ backbone, making it viable for real-time applications.

Limitations and Future Directions

While the CMPPP framework significantly improves empty space detection, the authors note some remaining miscalibration in the center bins of the intensity function. They hypothesize this is due to the model's capacity being spent on calibrating the probability of multiple objects.

Furthermore, the current model uses a Poisson process, which assumes object centers are independent. In reality, physical objects cannot overlap. Future work may explore Gibbs processes, which can model "repelling potentials" between objects to further improve physical realism. Finally, the current peak detection relies on a fixed square patch size, which might be sub-optimal for scenes with extreme scale variance, suggesting an area for future refinement.

Summary updated

Abstract

Deep neural networks have set the state-of-the-art in computer vision tasks such as bounding box detection and semantic segmentation. Object detectors and segmentation models assign confidence scores to predictions, reflecting the model’s uncertainty in object detection or pixel-wise classification. However, these confidence estimates are often miscalibrated, as their architectures and loss functions are tailored to task performance rather than probabilistic foundation. Even with well calibrated predictions, object detectors fail to quantify uncertainty outside detected bounding boxes, i.e., the model does not make a probability assessment of whether an area without detected objects is truly free of obstacles. This poses a safety risk in applications such as automated driving, where uncertainty in empty areas remains unexplored. In this work, we propose an object detection model grounded in spatial statistics. Bounding box data matches realizations of a marked point process, commonly used to describe the probabilistic occurrence of spatial point events identified as bounding box centers, where marks are used to describe the spatial extension of bounding boxes and classes. Our statistical framework enables a likelihood-based training and provides well-defined confidence estimates for whether a region is drivable, i.e., free of objects. We demonstrate the effectiveness of our method through calibration assessments and evaluation of performance.
BibTeX
@inproceedings{riedlinger2026towards,
  author = {Tobias Riedlinger and Kira Maag and Hanno Gottschalk},
  title = {{Towards Reliable Detection of Empty Space: Conditional Marked Point Processes for Object Detection}},
  booktitle = {International Conference on Learning Representations},
  year = {2026},
  url = {https://openreview.net/forum?id=M2KLWLHzX0},
}
Figure