Numerical Analysis of Target Enumeration via Euler Characteristic Integrals

Publication date 13 February 2012

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational issues in computer and robotic vision (65D19) Numerical approximation and computational geometry (primarily algorithms) (65Dxx) Combinatorics (05-XX) Combinatorial probability (60Cxx)

Abstract: Given a continuous sensor field, we can apply the Euler characteristic integral approach to count the number of targets in the sensor field. If the sensor field is discrete, the Euler integral approach introduces errors into our target count. In this paper, we study the behavior of the Euler integral when applied to discrete sensor fields. Under precise assumptions, we count the number of first- and second-order errors in target count, and discover a formula proportional to much higher order errors. This allows us to derive a point estimator for the number of targets in a discrete sensor field. Finally we derive an asymptotic result, providing insight into how the discrete Euler integral behaves for a large number of targets.

This page was built for publication: Numerical Analysis of Target Enumeration via Euler Characteristic Integrals

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6231002)