Fitting B-spline curves to point clouds by curvature-based squared distance minimization

ACM Transactions on Graphics - Tập 25 Số 2 - Trang 214-238 - 2006
Wenping Wang1, Helmut Pottmann2, Yang Liu1
1University of Hong Kong, Hong Kong, China
2Vienna Univ. of Technology, Wien, Austria#TAB#

Tóm tắt

Computing a curve to approximate data points is a problem encountered frequently in many applications in computer graphics, computer vision, CAD/CAM, and image processing. We present a novel and efficient method, calledsquared distance minimization(SDM), for computing a planar B-spline curve, closed or open, to approximate a target shape defined by apoint cloud, that is, a set of unorganized, possibly noisy data points. We show that SDM significantly outperforms other optimization methods used currently in common practice of curve fitting. In SDM, a B-spline curve starts from some properly specified initial shape and converges towards the target shape through iterative quadratic minimization of the fitting error. Our contribution is the introduction of a new fitting error term, called thesquared distance (SD) error term, defined by a curvature-based quadratic approximant of squared distances from data points to a fitting curve. The SD error term faithfully measures the geometric distance between a fitting curve and a target shape, thus leading to faster and more stable convergence than the point distance (PD) error term, which is commonly used in computer graphics and CAGD, and the tangent distance (TD) error term, which is often adopted in the computer vision community. To provide a theoretical explanation of the superior performance of SDM, we formulate the B-spline curve fitting problem as a nonlinear least squares problem and conclude that SDM is a quasi-Newton method which employs a curvature-based positive definite approximant to the true Hessian of the objective function. Furthermore, we show that the method based on the TD error term is a Gauss-Newton iteration, which is unstable for target shapes with high curvature variations, whereas optimization based on the PD error term is the alternating method that is known to have linear convergence.

Từ khóa


Tài liệu tham khảo

10.1007/BF02922668

10.1016/0167-8396(94)90303-4

Bjorck A. 1996. Numerical Methods for Least Squares Problems. Mathematics Society for Industrial and Applied Mathematics Philadelphia PA. Bjorck A. 1996. Numerical Methods for Least Squares Problems. Mathematics Society for Industrial and Applied Mathematics Philadelphia PA.

Blake A. and Isard M. 1998. Active Contours. Springer Verlag New York NY. Blake A. and Isard M. 1998. Active Contours. Springer Verlag New York NY.

10.1145/566282.566303

Farin G. 1997. Curves and Surfaces for Computer Aided Geometric Design: A Practical Guide 4th Ed. Academic Press New York NY. Farin G. 1997. Curves and Surfaces for Computer Aided Geometric Design: A Practical Guide 4th Ed. Academic Press New York NY.

10.1145/221659.221665

10.1007/s00607-003-0046-y

10.1145/353981.353992

10.1006/gmod.2001.0542

Haber J., Proceedings of Visualization. 341--348

10.1145/237170.237216

10.1145/192161.192233

10.1016/0167-8396(88)90017-9

Hoschek J. and Lasser D. 1993. Fundamentals of Computer Aided Geometric Design. AK Peters. Hoschek J. and Lasser D. 1993. Fundamentals of Computer Aided Geometric Design. AK Peters.

10.1016/j.cagd.2004.12.001

10.1007/BF00133570

Kelley C. T. 1999. Iterative Methods for Optimization. Society for Industrial and Applied Mathematics Philadelphia PA. Kelley C. T. 1999. Iterative Methods for Optimization. Society for Industrial and Applied Mathematics Philadelphia PA.

Laurent-Gengoux P. and Mekhilef M. 1993. Optimization of a nurbs representation. Comput.-aided Design 25 699--710. Laurent-Gengoux P. and Mekhilef M. 1993. Optimization of a nurbs representation. Comput.-aided Design 25 699--710.

10.1016/0010-4485(89)90003-1

Luenberger D. 1984. Linear and Nonlinear Programming. Addision-Wesley. Luenberger D. 1984. Linear and Nonlinear Programming. Addision-Wesley.

Ma W. Y. and Kruth J. P. 1995. Parameterization of randomly measured points for least squares fitting of b-spline curves and surfaces. Comput.-aided Design 27 663--675. Ma W. Y. and Kruth J. P. 1995. Parameterization of randomly measured points for least squares fitting of b-spline curves and surfaces. Comput.-aided Design 27 663--675.

10.1016/S1077-3169(02)00006-0

10.1109/34.368173

Osher S. and Fedkiw. 2003. Level Set Methods and Dynamic Implicit Surfaces. Springer-Verlag New York NY. Osher S. and Fedkiw. 2003. Level Set Methods and Dynamic Implicit Surfaces. Springer-Verlag New York NY.

10.1145/357314.357315

10.1145/964967.801153

Pottmann H. and Hofer M. 2003. Geometry of the squared distance function to curves and surfaces. In Visualization and Mathematics III H. Hege and K. Polthier Eds. 223--244. Pottmann H. and Hofer M. 2003. Geometry of the squared distance function to curves and surfaces. In Visualization and Mathematics III H. Hege and K. Polthier Eds. 223--244.

Pottmann H., Proceedings of Pacific Graphics. IEEE Computer Society Press, 8--25

Pottmann H. and Wallner J. 2001. Computational Line Geometry. Springer-Verlag Berlin Germany. Pottmann H. and Wallner J. 2001. Computational Line Geometry. Springer-Verlag Berlin Germany.

10.1145/325334.325225

10.1137/1022057

10.1016/0167-8396(91)90016-5

10.1016/j.cagd.2003.06.004

Sethian J. A. 1999. Level Set Methods and Fast Marching Methods. Cambridge University Press Cambridge UK. Sethian J. A. 1999. Level Set Methods and Fast Marching Methods. Cambridge University Press Cambridge UK.

10.1016/S0167-8396(98)00024-7

10.1006/gmod.2002.0571

10.1145/108541.108548

10.1145/545261.545283

10.1016/S0167-8396(01)00086-3

Yang H. P. Wang W. and Sun J. G. 2004. Control point adjustment for b-spline curve approximation. Comput.-aided Design 36 639--652. Yang H. P. Wang W. and Sun J. G. 2004. Control point adjustment for b-spline curve approximation. Comput.-aided Design 36 639--652.

Thông tin
Thông tin xuất bản

ACM Transactions on Graphics

Tập 25 Số 2

214-238

Thông tin tác giả