148 search results - page 1 / 30 » The random Tukey depth |
CSDA
2008
13 years 11 months ago
2008
The computation of the Tukey depth, also called halfspace depth, is very demanding, even in low dimensional spaces, because it requires that all possible one-dimensional projectio...
SODA
2004
ACM
14 years 15 days ago
2004
ACM
We present the first optimal algorithm to compute the maximum Tukey depth (also known as location or halfspace depth) for a non-degenerate point set in the plane. The algorithm is...
SAC
2008
ACM
13 years 10 months ago
2008
ACM
The Tukey depth (Tukey 1975) of a point p with respect to a finite set S of points is the minimum number of elements of S contained in any closed halfspace that contains p. Algori...
ESA
2011
Springer
12 years 11 months ago
2011
Springer
Over the past several decades, many combinatorial measures have been devised for capturing the statistical data depth of a set of n points in R2 . These include Tukey depth [15], O...
CVPR
2012
IEEE
12 years 1 months ago
2012
IEEE
We present a generic framework for object segmentation using depth maps based on Random Forest and Graph-cuts theory, and apply it to the segmentation of human limbs in depth maps...