Fast and Accurate 3D Edge Detection for Surface Reconstruction

Authors:
Christian Bähnisch;Peer Stelldinger;Ullrich Köthe
Affiliations:
University of Hamburg, Hamburg, Germany 22527 and University of Heidelberg, Heidelberg, Germany 69115;University of Hamburg, Hamburg, Germany 22527 and University of Heidelberg, Heidelberg, Germany 69115;University of Hamburg, Hamburg, Germany 22527 and University of Heidelberg, Heidelberg, Germany 69115
Venue:
Proceedings of the 31st DAGM Symposium on Pattern Recognition
Year:
2009

Citing 6
Cited 1

A Computational Approach to Edge Detection

IEEE Transactions on Pattern Analysis and Machine Intelligence
3D edge detection using recursive filtering: application to scanner images

CVGIP: Image Understanding
Three-dimensional alpha shapes

ACM Transactions on Graphics (TOG)
Line search algorithms with guaranteed sufficient decrease

ACM Transactions on Mathematical Software (TOMS)
Numerical Recipes in C++: the art of scientific computing

Numerical Recipes in C++: the art of scientific computing
Skeletons in N dimensions using shape primitives

Pattern Recognition Letters

How to define a locally adaptive sampling criterion for topologically correct reconstruction of multiple regions

Pattern Recognition Letters

Quantified Score

Hi-index	0.01

Visualization

Abstract

Although edge detection is a well investigated topic, 3D edge detectors mostly lack either accuracy or speed. We will show, how to build a highly accurate subvoxel edge detector, which is fast enough for practical applications. In contrast to other approaches we use a spline interpolation in order to have an efficient approximation of the theoretically ideal sinc interpolator. We give theoretical bounds for the accuracy and show experimentally that our approach reaches these bounds while the often-used subpixel-accurate parabola fit leads to much higher edge displacements.