论文信息 - Curvature Estimation in Noisy Curves

Curvature Estimation in Noisy Curves

An algorithm of estimation of the curvature at each point of a general discrete curve in O(n log2 n) is proposed. It uses the notion of blurred segment, extending the definition of segment of arithmetic discrete line to be adapted to noisy curves. The proposed algorithm relies on the decomposition of a discrete curve into maximal blurred segments also presented in this paper.

Thanh Phuong Nguyen | Isabelle Debled-Rennesson

[1] Laure Tougne,et al. Discrete Curvature Based on Osculating Circle Estimation , 2001, IWVF.

[2] John Harris,et al. Handbook of mathematics and computational science , 1998 .

[3] François de Vieilleville,et al. Analysis and Comparative Evaluation of Discrete Tangent Estimators , 2005, DGCI.

[4] Jan van Leeuwen,et al. Maintenance of Configurations in the Plane , 1981, J. Comput. Syst. Sci..

[5] Jean-Pierre Reveillès. Géométrie discrète, calcul en nombres entiers et algorithmique , 1991 .

[6] Gabriella Sanniti di Baja,et al. Visual Form 2001 , 2001, Lecture Notes in Computer Science.

[7] Isabelle Debled-Rennesson. Estimation of tangents to a noisy discrete curve , 2004, IS&T/SPIE Electronic Imaging.

[8] Lilian Buzer. An Elementary Algorithm for Digital Line Recognition in the General Case , 2005, DGCI.

[9] Isabelle Debled-Rennesson,et al. Optimal blurred segments decomposition of noisy shapes in linear time , 2006, Comput. Graph..

[10] Laurent Wendling,et al. A new method to detect arcs and segments from curvature profiles , 2006, 18th International Conference on Pattern Recognition (ICPR'06).

[11] Laure Tougne,et al. Optimal Time Computation of the Tangent of a Discrete Curve: Application to the Curvature , 1999, DGCI.

[12] Azriel Rosenfeld,et al. Angle Detection on Digital Curves , 1973, IEEE Transactions on Computers.