Lower and upper bounds for scaling factors used for integer approximation of 3D anisotropic chamfer distance operator

1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

For 3D images composed of successive scanner slices (e.g. medical imaging, confocal microscopy or computed tomography), the sampling step may vary according to the axes, and specially according to the depth which can take values lower or higher than 1. Hence, the sampling grid turns out to be parallelepipedic. In this paper, 3D anisotropic local distance operators are introduced. The problem of coefficient optimization is addressed for arbitrary mask size. Lower and upper bounds of scaling factors used for integer approximation are given. This allows, first, to derive analytically the maximal normalized error with respect to Euclidean distance, in any 3D anisotropic lattice, and second, to compute optimal chamfer coefficients. As far as large images or volumes are concerned, 3D anisotropic operators are adapted to the measurement of distances between objects sampled on non-cubic grids as well as for quantitative comparison between grey level images. © 2009 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Coquin, D., & Bolon, P. (2009). Lower and upper bounds for scaling factors used for integer approximation of 3D anisotropic chamfer distance operator. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5810 LNCS, pp. 457–468). https://doi.org/10.1007/978-3-642-04397-0_39

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free