Efficient computation of location depth contours by methods of computational geometry
نویسندگان
چکیده
The concept of location depth was introduced as a way to extend the univariate notion of ranking to a bivariate configuration of data points. It has been used successfully for robust estimation, hypothesis testing, and graphical display. The depth contours form a collection of nested polygons, and the center of the deepest contour is called the Tukey median. The only available implemented algorithms for the depth contours and the Tukey median are slow, which limits their usefulness. In this paper we describe an optimal algorithm which computes all bivariate depth contours in O(n) time and space, using topological sweep of the dual arrangement of lines. Once these contours are known, the location depth of any point can be computed in O(log n) time with no additional preprocessing or in O(log n) time after O(n) preprocessing. We provide fast implementations of these algorithms to allow their use in everyday statistical practice.
منابع مشابه
Dynamic Update of Half-space Depth Contours
Data depth is an approach to statistical analysis based on the geometry of the data. Half-space depth has been studied most frequently by computational geometers. The half-space depth of a point x relative to a set of points S = {X1, ..., Xn} in R d is the minimum number of points of S lying in any closed half-space determined by a line through x [2, 11]. Depth contours, enclosing regions with ...
متن کاملSweep Line Algorithm for Convex Hull Revisited
Convex hull of some given points is the intersection of all convex sets containing them. It is used as primary structure in many other problems in computational geometry and other areas like image processing, model identification, geographical data systems, and triangular computation of a set of points and so on. Computing the convex hull of a set of point is one of the most fundamental and imp...
متن کاملFeasibility of detecting and localizing radioactive source using image processing and computational geometry algorithms
We consider the problem of finding the localization of radioactive source by using data from a digital camera. In other words, the camera could help us to detect the direction of radioactive rays radiation. Therefore, the outcome could be used to command a robot to move toward the true direction to achieve the source. The process of camera data is performed by using image processing and computa...
متن کاملMultivariate Quantiles and Multiple-output Regression Quantiles: from L1 Optimization to Halfspace Depth
A new multivariate concept of quantile, based on a directional version of Koenker and Bassett’s traditional regression quantiles, is introduced for multivariate location and multiple-output regression problems. In their empirical version, those quantiles can be computed efficiently via linear programming techniques. Consistency, Bahadur representation and asymptotic normality results are establ...
متن کاملFast Computation of 2-Dimensional Depth Contours
"One person’s noise is another person’s signal." For many applications, including the detection of credit card frauds and the monitoring of criminal activities in electronic commerce, an important knowledge discovery problem is the detection of exceptional/outlying events. In computational statistics, a depth-based approach detects outlying data points in a 2-D dataset by, based on some definit...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Statistics and Computing
دوره 13 شماره
صفحات -
تاریخ انتشار 2003