TY - GEN

T1 - Estimation of curvature from sampled noisy data

AU - Lee, Chang Kyu

AU - Haralick, Robert M.

AU - Deguchi, Koichiro

PY - 1993/12/1

Y1 - 1993/12/1

N2 - Estimation of curvature from noisy sampled data is a fundamental problem in digital arc segmentation. The facet approach in curvature estimation involves least square fitting the observed data points to a parametric cubic polynomial and calculating the curvature analytically from the fitted parametric coefficients. Due to the fitting, there exists systematic error or bias between curvature calculated analytically from the parameterization of a circle and one calculated analytically based on the coefficients of the fitted cubic polynomial, even when the data is sampled from noiseless circle. We show how to compensate this bias by estimating it with the coefficients of the fitted cubic polynomial, which gives more accurate curvature value. We introduce small perturbations to the sampled data from a noiseless circle, and we analytically trace how the perturbation propagates through coefficients of the fitted polynomials and results in perturbation error of the curvature.

AB - Estimation of curvature from noisy sampled data is a fundamental problem in digital arc segmentation. The facet approach in curvature estimation involves least square fitting the observed data points to a parametric cubic polynomial and calculating the curvature analytically from the fitted parametric coefficients. Due to the fitting, there exists systematic error or bias between curvature calculated analytically from the parameterization of a circle and one calculated analytically based on the coefficients of the fitted cubic polynomial, even when the data is sampled from noiseless circle. We show how to compensate this bias by estimating it with the coefficients of the fitted cubic polynomial, which gives more accurate curvature value. We introduce small perturbations to the sampled data from a noiseless circle, and we analytically trace how the perturbation propagates through coefficients of the fitted polynomials and results in perturbation error of the curvature.

UR - http://www.scopus.com/inward/record.url?scp=0027873946&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0027873946&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0027873946

SN - 0818638826

T3 - IEEE Computer Vision and Pattern Recognition

SP - 536

EP - 541

BT - IEEE Computer Vision and Pattern Recognition

A2 - Anon, null

PB - Publ by IEEE

T2 - Proceedings of the 1993 IEEE Computer Society Conference on Computer Vision and Pattern Recognition

Y2 - 15 June 1993 through 18 June 1993

ER -