Level sets estimation and Vorob'ev expectation of random compact sets
Philippe Heinrich (LPP), Radu Stefan Stoica (LPP), Viet Chi Tran (LPP,, CMAP)

TL;DR
This paper introduces a consistent estimator for the Vorob'ev expectation of a random compact set, enabling practical mean shape estimation in applications like image analysis, with error control under mild boundary regularity assumptions.
Contribution
It proposes a novel, practical estimator for the Vorob'ev expectation of random sets, with proven consistency and error control, applicable to real-world data.
Findings
Estimator is consistent and easy to implement.
Discretization errors are controlled under mild boundary regularity.
Application demonstrated on cosmological data.
Abstract
The issue of a "mean shape" of a random set often arises, in particular in image analysis and pattern detection. There is no canonical definition but one possible approach is the so-called Vorob'ev expectation , which is closely linked to quantile sets. In this paper, we propose a consistent and ready to use estimator of built from independent copies of with spatial discretization. The control of discretization errors is handled with a mild regularity assumption on the boundary of : a not too large 'box counting' dimension. Some examples are developed and an application to cosmological data is presented.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
