Fitting quadrics with a Bayesian prior

Daniel Beale; Yong-Liang Yang; Neill Campbell; Darren Cosker; Peter Hall

doi:10.1007/s41095-016-0041-9

Computational Visual Media 2016, 2(2): 107-117 https://doi.org/10.1007/s41095-016-0041-9

Research Article |

Open Access | Issue | Published: 07 April 2016

Fitting quadrics with a Bayesian prior

Show Author's Information Hide Author's Information Daniel Beale^¹(

), Yong-Liang Yang^¹, Neill Campbell^¹, Darren Cosker^¹, Peter Hall^¹

1 University of Bath, Claverton Down, Bath, BA2 7AY, UK.

Keywords:

computer vision, geometry, statistics, graphics

Cite this article:

Beale D, Yang Y-L, Campbell N, et al. Fitting quadrics with a Bayesian prior. Computational Visual Media, 2016, 2(2): 107-117. https://doi.org/10.1007/s41095-016-0041-9

Download citation

EndNote(RIS)

BibTeX

698

Views

Downloads

Citations

Crossref

N/A

WoS

Scopus

CSCD

Abstract Full text About this article

Abstract

Quadrics are a compact mathematical formulation for a range of primitive surfaces. A problem arises when there are not enough data points to compute the model but knowledge of the shape is available. This paper presents a method for fitting a quadric with a Bayesian prior. We use a matrix normal prior in order to favour ellipsoids when fitting to ambiguous data. The results show the algorithm copes well when there are few points in the point cloud, competing with contemporary techniques in the area.

Full text

Abstract

Full text

Outline

About this article

Fitting quadrics with a Bayesian prior

Show Author's information Hide Author's Information Daniel Beale^¹(

), Yong-Liang Yang^¹, Neill Campbell^¹, Darren Cosker^¹, Peter Hall^¹

1 University of Bath, Claverton Down, Bath, BA2 7AY, UK.

Abstract

Keywords: computer vision, geometry, statistics, graphics

References(28)

[1]

Taubin, G. Estimation of planar curves, surfaces, and nonplanar space curves defined by implicit equations with applications to edge and range image segmentation. IEEE Transactions on Pattern Analysis and Machine Intelligence Vol. 13, No. 11, 1115-1138, 1991.

DOI Google Scholar

[2]

Ahn, S. J.; Rauh, W.; Cho, H. S.; Warnecke, H.-J. Orthogonal distance fitting of implicit curves and surfaces. IEEE Transactions on Pattern Analysis and Machine Intelligence Vol. 24, No. 5, 620-638, 2002.

DOI Google Scholar

[3]

Andrews, J.; Séquin, C. H. Type-constrained direct fitting of quadric surfaces. Computer-Aided Design and Applications Vol. 11, No. 1, 107-119, 2014.

DOI Google Scholar

[4]

Atieg, A.; Watson, G. A. A class of methods for fitting a curve or surface to data by minimizing the sum of squares of orthogonal distances. Journal of Computational and Applied Mathematics Vol. 158, No. 2, 277-296, 2003.

DOI Google Scholar

[5]

Gander, W.; Golub, G. H.; Strebel, R. Least-squares fitting of circles and ellipses. BIT Numerical Mathematics Vol. 34, No. 4, 558-578, 1994.

DOI Google Scholar

[6]

Lukács, G.; Martin, R.; Marshall, D. Faithful least-squares fitting of spheres, cylinders, cones and tori for reliable segmentation. In: Lecture Notes in Computer Science, Vol. 1406. Burkhardt, H.; Neumann, B. Eds. Springer Berlin Heidelberg, 671-686, 1998.

DOI

[7]

Petitjean, S. A survey of methods for recovering quadrics in triangle meshes. ACM Computing Surveys (CSUR) Vol. 34, No. 2, 211-262, 2002.

DOI Google Scholar

[8]

Ruiz, O.; Arroyave, S.; Acosta, D. Fitting of analytic surfaces to noisy point clouds. American Journal of Computational Mathematics Vol. 3, No. 1A, 18-26, 2013.

DOI Google Scholar

[9]

Rouhani, M.; Sappa, A. D. Implicit polynomial representation through a fast fitting error estimation. IEEE Transactions on Image Processing Vol. 21, No. 4, 2089-2098, 2012.

DOI Google Scholar

[10]

Pratt, V. Direct least-squares fitting of algebraic surfaces. ACM SIGGRAPH Computer Graphics Vol. 21, No. 4, 145-152, 1987.

DOI Google Scholar

[11]

Fitzgibbon, A.; Pilu, M.; Fisher, R. B. Direct least square fitting of ellipses. IEEE Transactions on Pattern Analysis and Machine Intelligence Vol. 21, No. 5, 476-480, 1999.

DOI Google Scholar

[12]

Li, Q.; Griffiths, J. G. Least squares ellipsoid specific fitting. In: Proceedings of Geometric Modeling and Processing, 335-340, 2004.

[13]

Halir, R.; Flusser, J. Numerically stable direct least squares fitting of ellipses. In: Proceedings of the 6th International Conference in Central Europe on Computer Graphics and Visualization, Vol. 98, 125-132, 1998.

[14]

Dai, M.; Newman, T. S.; Cao, C. Least-squares-based fitting of paraboloids. Pattern Recognition Vol. 40, No. 2, 504-515, 2007.

DOI Google Scholar

[15]

Subrahmonia, J.; Cooper, D. B.; Keren, D. Practical reliable Bayesian recognition of 2D and 3D objects using implicit polynomials and algebraic invariants. IEEE Transactions on Pattern Analysis and Machine Intelligence Vol. 18, No. 5, 505-519, 1996.

DOI Google Scholar

[16]

Cohen-Steiner, D.; Alliez, P.; Desbrun, M. Variational shape approximation. ACM Transactions on Graphics Vol. 23, No. 3, 905-914, 2004.

DOI Google Scholar

[17]

Wu, J.; Kobbelt, L. Structure recovery via hybrid variational surface approximation. Computer Graphics Forum Vol. 24, No. 3, 277-284, 2005.

DOI Google Scholar

[18]

Yan, D.-M.; Liu, Y.; Wang, W. Quadric surface extraction by variational shape approximation. In: Lecture Notes in Computer Science, Vol. 4077. Kim, M.-S.; Shimada, K. Eds. Springer Berlin Heidelberg, 73-86, 2006.

DOI

[19]

Schnabel, R.; Wahl, R.; Klein, R. Efficient RANSAC for point-cloud shape detection. Computer Graphics Forum Vol. 26, No. 2, 214-226, 2007.

DOI Google Scholar

[20]

Li, Y.; Wu, X.; Chrysathou, Y.; Sharf, A.; Cohen-Or, D.; Mitra, N. J. GlobFit: Consistently fitting primitives by discovering global relations. ACM Transactions on Graphics Vol. 30, No. 4, Article No. 52, 2011.

DOI Google Scholar

[21]

Ohtake, Y.; Belyaev, A.; Alexa, M.; Turk, G.; Seidel, H.-P. Multi-level partition of unity implicits. In: Proceedings of ACM SIGGRAPH 2005 Courses, Article No. 173, 2005.

DOI

[22]

Hamann, B. Curvature approximation for triangulated surfaces. In: Computing Supplementum, Vol. 8. Farin, G.; Noltemeier, H.; Hagen, H.; Kndel, W. Eds. Springer Vienna, 139-153, 1993.

DOI

[23]

Vona, M.; Kanoulas, D. Curved surface contact patches with quantified uncertainty. In: Proceedings of IEEE/RSJ International Conference on Intelligent Robots and Systems, 1439-1446, 2011.

DOI

[24]

Powell, M. W.; Bowyer, K. W.; Jiang, X.; Bunke, H. Comparing curved-surface range image segmenters. In: Proceedings of the 6th International Conference on Computer Vision, 286-291, 1998.

[25]

Petersen, K. B.; Pedersen, M. S. The Matrix Cookbook. Technical University of Denmark. Version: November 15, 2012. Available at https://www.math.uwaterloo. ca/∽hwolkowi/matrixcookbook. pdf.

[26]

Lott, G. K. Direct orthogonal distance to quadratic surfaces in 3D. IEEE Transactions on Pattern Analysis and Machine Intelligence Vol. 36, No. 9, 1888-1892, 2014.

DOI Google Scholar

[27]

Eberly, D. Distance from a point to an ellipse, an ellipsoid, or a hyperellipsoid. Geometric Tools, LLC, 2011. Available at http://www.geometrictools.com/ Documentation/DistancePointEllipseEllipsoid.pdf.

[28]

Kwatra, V.; Han, M. Fast covariance computation and dimensionality reduction for sub-window features in images. In: Lecture Notes in Computer Science, Vol. 6312. Daniilidis, K.; Maragos, P.; Paragios, N. Eds. Springer Berlin Heidelberg, 156-169, 2010.

About this article

Publication history

Rights and permissions

Publication history

Revised: 30 November 2015

Accepted: 13 January 2016

Published: 07 April 2016

Issue date: June 2016

Copyright

Rights and permissions

This article is published with open access at Springerlink.com

The articles published in this journal are distributed under the terms of the Creative Commons Attribution 4.0 International License (http:// creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution, and reproduction in any medium, provided you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license, and indicate if changes were made.

Other papers from this open access journal are available free of charge from http://www.springer.com/journal/41095. To submit a manuscript, please go to https://www. editorialmanager.com/cvmj.