Computing halfspace depth contours based on the idea of a circular sequence

DOI10.1007/S11424-015-3160-YMaRDI QIDQ256759zbMATH OpenOpenAlexFDO

Authors Haiping Ren, Guofu Wang, Xiao Hui Liu

Publication date 10 March 2016

Published in Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11424-015-3160-y

zbMATH Keywords

circular sequenceexact algorithmhalfspace depth contour

Mathematics Subject Classification ID

Directional data; spatial statistics (62H11) Applications of mathematical programming (90C90) Sensitivity, stability, parametric optimization (90C31) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• Exact computation of the halfspace depth
• Computing halfspace depth and regression depth
• Computing depth contours of bivariate point clouds
• Algorithm AS 307: Bivariate Location Depth
• Fast implementation of depth contours using topological sweep

Cites work

• scientific article; zbMATH DE number 4032498 (Why is no real title available?)
• scientific article; zbMATH DE number 3541764 (Why is no real title available?)
• scientific article; zbMATH DE number 1086063 (Why is no real title available?)
• scientific article; zbMATH DE number 194744 (Why is no real title available?)
• A nonparametric multivariate multisample test based on data depth
• Algorithm AS 307: Bivariate Location Depth
• Breakdown properties of location estimates based on halfspace depth and projected outlyingness
• Computing depth contours of bivariate point clouds
• Computing multiple-output regression quantile regions
• Computing multiple-output regression quantile regions from projection quantiles
• Computing zonoid trimmed regions of bivariate data sets
• Computing zonoid trimmed regions of dimension \(d>2\)
• Exactly computing bivariate projection depth contours and median
• Finite sample breakdown points of projection based multivariate location and scatter statistics
• General notions of statistical depth function.
• Multivariate quantiles and multiple-output regression quantiles: from \(L_{1}\) optimization to halfspace depth
• On Maximum Depth and Related Classifiers
• On a notion of data depth based on random simplices
• On directional multiple-output quantile regression
• Primal-dual methods for vertex and facet enumeration
• Projection-based depth functions and associated medians
• Quantile tomography: using quantiles with multivariate data
• Regression Depth
• The expected convex hull trimmed regions of a sample
• The quickhull algorithm for convex hulls
• Zonoid trimming for multivariate distributions

Cited in

(5)

• A three-stage approach for segmenting degraded color images: smoothing, lifting and thresholding (SLaT)
• Computing halfspace depth and regression depth
• Exact computation of the halfspace depth
• Computing the halfspace depth with multiple try algorithm and simulated annealing algorithm
• Continuity of halfspace depth contours and maximum depth estimators: Diagnostics of depth-related methods

Describes a project that uses

Uses Software

• Qhull
• AS 307
• Algorithm 489

This page was built for publication: Computing halfspace depth contours based on the idea of a circular sequence

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