Abstract
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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Nguyen, T. P., & Debled-Rennesson, I. (2007). Curvature estimation in noisy curves. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4673 LNCS, pp. 474–481). Springer Verlag. https://doi.org/10.1007/978-3-540-74272-2_59
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
