Convergence of algorithms for reconstructing convex bodies and directional measures
By Richard J. Gardner, Markus Kiderlen, Peyman Milanfar. 2006
72 citations recorded by the source corpus.
We investigate algorithms for reconstructing a convex body K in R n from noisy measurements of its support function or its brightness function in k directions u 1 ,..., u k . The key idea of these algorithms is to construct a convex polytope P k whose support function (or brightness function) best approximates the given measurements in the directions u 1 ,...,u k (in the least squares sense). The measurement errors are assumed to be stochastically independent and Gaussian. It is shown that this procedure is (strongly) consistent, meaning that, almost surely, P k tends to K in the Hausdorff metric as k → ∞. Here some mild assumptions on the sequence (u i ) of directions are needed. Using results from the theory of empirical processes, estimates of rates of convergence are derived, which are first obtained in the L 2 metric and then transferred to the Hausdorff metric. Along the way, a new estimate is obtained for the metric entropy of the class of origin-symmetric zonoids contained in the unit ball. Similar results are obtained for the convergence of an algorithm that reconstructs an approximating measure to the directional measure of a stationary fiber process from noisy measurements of its rose of intersections in k directions u 1 ,...,u k . Here the Dudley and Prohorov metrics are used. The methods are linked to those employed for the support and brightness function algorithms via the fact that the rose of intersections is the support function of a projection body.
Subfields: Applied Mathematics, Computer Vision and Pattern Recognition, Geometry and Topology
View Paper: https://www.semanticscholar.org/paper/975f7f65f3369503d2c30a2960ff80a1aac205cc
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Applied Mathematics
In Computer Vision and Pattern Recognition
In Geometry and Topology
Citations in the corpus
- Covering Numbers for Convex Functions (2012, background): “Note that this proves the theorem because we can set Γ i = ∞ for all i = 1 , . . . : , d .”