Estimating curvature by Kalman filters

A problem which occurs frequently in computer vision research is that of determining reasonable curvature estimates, and is especially difficult in applications where noisy or imperfect data are used [1, 2]. Thus, estimating curve or surface points by an “edge detector” is not an end in itself, but only the first step of image understanding. These points are often noisy and the estimate must be improved before proceeding to subsequent stages such as grouping. The problem addressed in this paper is that of refining the estimated points of a smooth curve which have been corrupted by noise. The method presented here is expected to be of general interest for the edge detection problem by delivering a coherent set of putative curve points along with estimates of normals and curvatures. Here, we restrict the discussion to curves, but note that the method generalizes immediately to surfaces [3].

[1]  Peter T. Sander,et al.  Generic curvature features from 3-D images , 1989, IEEE Trans. Syst. Man Cybern..

[2]  Jan J. Koenderink,et al.  Solid shape , 1990 .

[3]  Nicholas Ayache,et al.  From voxel to curvature , 1991, Proceedings. 1991 IEEE Computer Society Conference on Computer Vision and Pattern Recognition.

[4]  D. Luenberger Optimization by Vector Space Methods , 1968 .

[5]  Steven W. Zucker,et al.  Inferring Surface Trace and Differential Structure from 3-D Images , 1990, IEEE Trans. Pattern Anal. Mach. Intell..

[6]  Jean Ponce,et al.  Describing surfaces , 1985, Comput. Vis. Graph. Image Process..