Abstract
This paper addresses a common problem in dealing with range images. We propose a novel method to fit surfaces of known types via a parameter decomposition approach. This approach is faithful and it strongly reduces the possibilities of dropping into local minima in the process of iterative optimization. Therefore, it increases the tolerance in selecting the initializations. Moreover, it reduces the computation time and increases the fitting accuracy compared to former approaches. We present methods for fitting cylinders, cones, and tori to 3D data points. They share the fundamental idea of decomposing the set of parameters into two parts: one part has to be solved by some traditional optimization method and another part can be solved either analytically or directly. We experimentally compare our method with a fitting algorithm recently reported in the literature. The results demonstrate that our method has superior performance in accuracy and speed.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Jiang, X.: An adaptive contour closure algorithm and its experimental evaluation. IEEE Trans. Pattern Analysis and Machine Intelligence 22(11), 1252–1265 (2000)
Chaudhuri, B.B., Kundu, P.: Optimum circular fit to weighted data in multi-dimensional space. Pattern Recognition Letter 14(1), 1–6 (1993)
Marshall, D., Lukacs, G., Martin, R.: Robust segmentation of primitives from range data in the presence of geometric degeneracy. IEEE Trans. Pattern Analysis and Machine Intelligence 23(3), 304–314 (2001)
Werghi, N., Fisher, R., Robertson, C., Ashbrook, A.: Modelling objects having quadric surfaces incorporating geometric constraints. In: Burkhardt, H., Neumann, B. (eds.) ECCV 1998. LNCS, vol. 1407, pp. 185–201. Springer, Heidelberg (1998)
Flynn, P.J., Jain, A.K.: Surface classification: hypothesis testing and parameter estimation. Computer Vision and Pattern Recognition, 261–267 (1998)
Jiang, X.: A decomposition approach to geometric fitting. In: Proc. of Int. Workshop on Machine Vision Applications, pp. 467–470 (2000)
Pratt, V.: Direct least-squares fitting of algebraic surfaces. Computer Graphics 21(4), 145–152 (1987)
Thomas, S.M., Chan, Y.T.: A simple approach for the estimation of circular arc center and its radius. CVGIP 45, 362–370 (1989)
Fitzgibbon, A., Pilu, M., Fisher, R.B.: Direct least square fitting of ellipses. IEEE Trans. Pattern Analysis and Machine Intelligence 21(5), 476–480 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jiang, X., Cheng, DC. (2005). A Novel Parameter Decomposition Approach to Faithful Fitting of Quadric Surfaces. In: Kropatsch, W.G., Sablatnig, R., Hanbury, A. (eds) Pattern Recognition. DAGM 2005. Lecture Notes in Computer Science, vol 3663. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11550518_21
Download citation
DOI: https://doi.org/10.1007/11550518_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28703-2
Online ISBN: 978-3-540-31942-9
eBook Packages: Computer ScienceComputer Science (R0)