Curvature based corner detector for discrete, noisy and multi-scale contours

Bertrand Kerautret (1) , Jacques-Olivier Lachaud (2) , Benoît Naegel (3)

1 ADAGIO - Applying Discrete Algorithms to Genomics and Imagery
2 LAMA - Laboratoire de Mathématiques
3 QGAR - Querying Graphics through Analysis and Recognition

Estimating curvature on digital shapes is known to be a difficult problem even in high resolution images 10,19. Moreover the presence of noise contributes to the insta- bility of the estimators and limits their use in many computer vision applications like corner detection. Several recent curvature estimators 16,13,15, which come from the dis- crete geometry community, can now process damaged data and integrate the amount of noise in their analysis. In this paper, we propose a comparative evaluation of these estimators, testing their accuracy, efficiency, and robustness with respect to several type of degradations. We further compare the best one with the visual curvature proposed by Liu et al. 14, a recently published method from the computer vision community. We finally propose a novel corner detector, which is based on curvature estimation, and we provide a comprehensive set of experiments to compare it with many other classical cor- ner detectors. Our study shows that this corner detector has most of the time a better behavior than the others, while requiring only one parameter to take into account the noise level. It is also promising for multi-scale shape description.

Mots clés: curvature estimators; corner detection; multi-scale analysis; dominant point extraction

Domaines: Synthèse d'image et réalité virtuelle [cs.GR]

Bertrand Kerautret, Jacques-Olivier Lachaud, Benoît Naegel. Curvature based corner detector for discrete, noisy and multi-scale contours. International Journal of Shape Modeling, 2008, 14 (2), pp.127-145. ⟨10.1142/S0218654308001117⟩. ⟨inria-00437575⟩