Provably Correct Edgel Linking and Subpixel Boundary Reconstruction

Ullrich Köthe, Peer Stelldinger, Hans Meine

in: K. Franke, K.-R. Müller, B. Nikolay, R. Schäfer (Eds.): Pattern Recognition, Proc. DAGM 2006, Lecture Notes in Computer Science 4174, pp. 81-90, Berlin: Springer, 2006. (note: this article is © Springer-Verlag)

Abstract

Existing methods for segmentation by edgel linking are based on heuristics and give no guarantee for a topologically correct result. In this paper, we propose an edgel linking algorithm based on a new sampling theorem for shape digitization, which guarantees a topologically correct reconstruction of regions and boundaries if the edgels approximate true object edges with a known maximal error. Experiments on real and generated images demonstrate the good performance of the new method and confirm the predictions of our theory.

Online version: PostScript (438 kb), PDF (327 kb)

Back to Ullrich Köthe's publication page