Distance maps from unthresholded magnitudes

0Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A straightforward algorithm that computes distance maps from unthresholded magnitude values is presented, suitable for still images and video sequences. While results on binary images are similar to classic Euclidean Distance Transforms, the proposed approach does not require a binarization step. Thus, no thresholds are needed and no information is lost in intermediate classification stages. Experiments include the evaluation of segmented images using the watershed algorithm and the measurement of pixel value stability in video sequences. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Anton-Canalis, L., Hernandez-Tejera, M., & Sanchez-Nielsen, E. (2011). Distance maps from unthresholded magnitudes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6669 LNCS, pp. 92–99). https://doi.org/10.1007/978-3-642-21257-4_12

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