H. Edelsbrunner. Algorithms in Combinatorial Geometry, volume 10 of EA TCS Monographs on Theoretical Computer Science. Springer-Verlag, Heidelberg, West Germany, 1987.

Digital Library

Google Scholar

[9]

H. Edelsbrunner, J. O'Rourke, and R. Seidel. Constructing arrangements of lines and hyperplanes with applications. SIAM J. Comput., 15:341-363, 1986.

Digital Library

Google Scholar

[10]

H. Edelsbrunner, R. Seidel, and M. Sharir. On the zone theorem for hyperplane arrangements. SIAM J. Comput., 22(2):418-429, 1993.

Digital Library

Google Scholar

[11]

D. Eu, E. Gu@vremont, and G. T. Toussaint. On envelopes of arrangements of lines. J. Algorithms, 21:111-148, 1996.

Digital Library

Google Scholar

[12]

L. J. Guibas, M. H. Overmars, and J.-M. Robert. The exact fitting problem for points. Comput. Geom. Theory Appl., 6:215-230, 1996.

Digital Library

Google Scholar

[13]

M. Hubert and P. J. Rousseeuw. The catline for deep regression. J. Multivar. Analysis, 66:270-296, 1998.

Digital Library

Google Scholar

[14]

M. J. Katz and M. Sharir. Optimal slope selection via expanders. In}otto. Process. Left., 47:115-122, 1993.

Digital Library

Google Scholar

[15]

M. Keil. A simple algorithm for determining the envelope of a set of lines. Inform. Process. Lett., 39:121-124, 1991.

Digital Library

Google Scholar

[16]

J. Matou#ek. Randomized optimal algorithm for slope selection. Inform. Process. Left., 39:183-187, 1991.

Digital Library

Google Scholar

[17]

M. H. Overmars and j. van Leeuwen. Maintenance of configurations in the plane. J. Comput. Syst. Sci., 23:166-204, 1981.

Crossref

Google Scholar

[18]

G. W. Peck. On k-sets in the plane. Discrete Math., 56:73-74, 1985.

Crossref

Google Scholar

[19]

P. J. Rousseeuw and M. Hubert. Regression depth. J. Amer. Statist. Assoc., to appear in June 1999.

Google Scholar

[20]

P. J. Rousseeuw and M. Hubert. Depth in an arrangement of hyperplanes. Discrete Comput. Geom., to appear, 1999.

Google Scholar

[21]

P. J. Rousseeuw and I. Ruts. Constructing the bivariate Tukey median. Statistica Sinica, 8:827- 839, 1998.

Google Scholar

[22]

P. J. Rousseeuw and A. Struyf. Computing location depth and regression depth in higher dimensions. Statistics and Computing, 8:193-203, 1998.

Digital Library

Google Scholar

[23]

P. J. Rousseeuw, S. Van Aelst and M. Hubert. Rejoinder to discussion of "Regression Depth". J. Amer. Statist. Assoc., to appear in June 1999.

Crossref

Google Scholar

[24]

I. Ruts and P. J. Rousseeuw. Computing depth contours of bivariate point clouds. Computational Statistics and Data Analysis, 23:153-168, 1996.

Digital Library

Google Scholar

[25]

M. Sharir. k-sets and random hulls. Combinatorica, 13:483-495, 1993.

Crossref

Google Scholar

[26]

A. Struyf and P. J. Rousseeuw. Halfspace depth characterizes the empirical distribution. J. Multivar. Analysis, to appear, 1999.

Digital Library

Google Scholar

[27]

A. Struyf and P. J. Rousseeuw. High-dimensional computation of the deepest location. Manuscript, Dept. of Mathematics and Computer Science, University of Antwerp, Belgium, 1998.

Google Scholar

[28]

S. Van Aelst and P. J. Rousseeuw. Robustness of Deepest Regression. Manuscript, Dept. of Mathematics and Computer Science, University of Antwerp, Belgium, 1998.

Google Scholar

Cited By

View all

Gopala HMorin P(2008)Algorithms for bivariate zonoid depthComputational Geometry: Theory and Applications10.1016/j.comgeo.2007.05.00739:1(2-13)Online publication date: 1-Jan-2008
https://dl.acm.org/doi/10.1016/j.comgeo.2007.05.007
Fukuda KRosta V(2005)Data Depth and Maximum Feasible SubsystemsGraph Theory and Combinatorial Optimization10.1007/0-387-25592-3_3(37-67)Online publication date: 2005
https://doi.org/10.1007/0-387-25592-3_3
Chan TMunro I(2004)An optimal randomized algorithm for maximum Tukey depthProceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms10.5555/982792.982853(430-436)Online publication date: 11-Jan-2004
https://dl.acm.org/doi/10.5555/982792.982853
Show More Cited By

Index Terms

Efficient algorithms for maximum regression depth

Recommendations

Efficient Algorithms for Maximum Regression Depth

We investigate algorithmic questions that arise in the statistical problem of computing lines or hyperplanes of maximum regression depth among a set of n points. We work primarily with a dual representation and find points of maximum undirected depth ...
A depth recovery algorithm for using the maximum likelihood estimation
ICIMCS'16: Proceedings of the International Conference on Internet Multimedia Computing and Service

The depth data is commonly used for the 3-D scene reconstruction. In this paper, we study the depth recovery for depth acquisition of active sensors using maximum likelihood estimation (MLE). It is observed that the depth missing problem is serious ...
Efficient Unsupervised Monocular Depth Estimation with Inter-Frame Depth Interpolation
Image and Graphics
Abstract
To alleviate the need of expensive depth annotations, some existing works resort to unsupervised learning methods for depth estimation using monocular videos. To improve the accuracy of the prediction with the relationship of the inter-frame, we ...

Comments

Information & Contributors

Information

Published In

SCG '99: Proceedings of the fifteenth annual symposium on Computational geometry

June 1999

432 pages

ISBN:1581130686

DOI:10.1145/304893

Chairman:
Victor Milenkovic
Univ. of Miami, Coral Gables, FL

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 June 1999

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

SoCG99

Sponsor:

SoCG99: The Symposium on Computational Geometry

June 13 - 16, 1999

Florida, Miami Beach, USA

Acceptance Rates

SCG '99 Paper Acceptance Rate 44 of 103 submissions, 43%;

Overall Acceptance Rate 625 of 1,685 submissions, 37%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

10
Total Citations
View Citations
341
Total Downloads

Downloads (Last 12 months)36
Downloads (Last 6 weeks)7

Reflects downloads up to 15 Sep 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Gopala HMorin P(2008)Algorithms for bivariate zonoid depthComputational Geometry: Theory and Applications10.1016/j.comgeo.2007.05.00739:1(2-13)Online publication date: 1-Jan-2008
https://dl.acm.org/doi/10.1016/j.comgeo.2007.05.007
Fukuda KRosta V(2005)Data Depth and Maximum Feasible SubsystemsGraph Theory and Combinatorial Optimization10.1007/0-387-25592-3_3(37-67)Online publication date: 2005
https://doi.org/10.1007/0-387-25592-3_3
Chan TMunro I(2004)An optimal randomized algorithm for maximum Tukey depthProceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms10.5555/982792.982853(430-436)Online publication date: 11-Jan-2004
https://dl.acm.org/doi/10.5555/982792.982853
Adrover JMaronna RYohai V(2004)Robust regression quantilesJournal of Statistical Planning and Inference10.1016/j.jspi.2003.06.009122:1-2(187-202)Online publication date: May-2004
https://doi.org/10.1016/j.jspi.2003.06.009
Langerman SSteiger W(2003)Optimization in ArrangementsSTACS 200310.1007/3-540-36494-3_6(50-61)Online publication date: 17-Feb-2003
https://doi.org/10.1007/3-540-36494-3_6
Bern Eppstein (2002)Multivariate Regression DepthDiscrete & Computational Geometry10.1007/s00454-001-0092-128:1(1-17)Online publication date: 1-Jul-2002
https://dl.acm.org/doi/10.1007/s00454-001-0092-1
Rousseeuw PVan Aelst SRambali BSmeyers-Verbeke J(2001)Deepest regression in analytical chemistryAnalytica Chimica Acta10.1016/S0003-2670(01)01034-0446:1-2(243-254)Online publication date: Nov-2001
https://doi.org/10.1016/S0003-2670(01)01034-0
Hubert MRousseeuw PVan Aelst S(2001)Similarities Between Location Depth and Regression DepthStatistics in Genetics and in the Environmental Sciences10.1007/978-3-0348-8326-9_11(159-172)Online publication date: 2001
https://doi.org/10.1007/978-3-0348-8326-9_11
Bern MEppstein DCheng SCheong OAgarwal PFortune S(2000)Multivariate regression depthProceedings of the sixteenth annual symposium on Computational geometry10.1145/336154.336218(315-321)Online publication date: 1-May-2000
https://dl.acm.org/doi/10.1145/336154.336218
Rousseeuw PVan Aelst SHubert M(1999)RejoinderJournal of the American Statistical Association10.1080/01621459.1999.1047413794:446(419-433)Online publication date: Jun-1999
https://doi.org/10.1080/01621459.1999.10474137

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Efficient Algorithms for Maximum Regression Depth

A depth recovery algorithm for using the maximum likelihood estimation

Efficient Unsupervised Monocular Depth Estimation with Inter-Frame Depth Interpolation

Comments

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF

eReader

Login options

Full Access

References

Cited By

Index Terms

Recommendations

Efficient Algorithms for Maximum Regression Depth

A depth recovery algorithm for using the maximum likelihood estimation

Efficient Unsupervised Monocular Depth Estimation with Inter-Frame Depth Interpolation

Comments

Information

Published In

Sponsors

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations