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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Arlandis, J., Perez-Cortes, J.-C.: Fast handwritten recognition using continuous distance transformation. In: Sanfeliu, A., Ruiz-Shulcloper, J. (eds.) CIARP 2003. LNCS, vol. 2905, pp. 400–407. Springer, Heidelberg (2003)
Beucher, S., Meyer, F.: The morphological approach of segmentation: the watershed transformation. Mathematical Morphology in Image Processing, 433–481 (1993)
Borgefors, G.: Hierarchical chamfer matching: A parametric edge matching algorithm. IEEE Transactions on Pattern Analysis and Machine Intelligence 10(6), 849–865 (1988)
Canny, J.: A computational approach to edge detection. IEEE Transactions on Pattern Analysis and Machine Intelligence 8(6), 679–698 (1986)
Deriche, R.: Using canny’s criteria to derive a recursively implemented optimal edge detector. International Journal of Computer Vision 1(2), 167–187 (1987)
Huttenlocher, D.P., Klanderman, G.A., Rucklidge, W.J.: Comparing images using the hausdorff distance. IEEE Transactions on Pattern Analysis and Machine Intelligence 15(9), 850–863 (1993)
Jang, J.H., Hong, K.S.: A pseudo-distance map for the segmentation-free skeletonization of gray-scale images. In: Proceedings of ICCV, pp. II18–II23 (2001)
Martin, D., Fowlkes, C., Tal, D., Malik, J.: A database of human segmented natural images and its application to evaluating segmentation algorithms and measuring ecological statistics. In: Proceedings of ICCV, vol. 2, pp. 416–423 (July 2001)
Roerdink, J.B.T.M., Meijster, A.: The watershed transform: definitions, algorithms and parallelization strategies. Fundamenta Informaticae 41(1-2), 187–228 (2000)
Rosenfeld, A., Pfaltz, J.L.: Distance functions on digital pictures. Pattern Recognition 1(1), 33–61 (1968)
Rosin, P.L., West, G.A.W.: Salience distance transforms. Graphical Models and Image Processing 57(6), 483–521 (1995)
Taylor, T., Geva, S., Boles, W.W.: Directed exploration using a modified distance transform. In: Proceedings of DICTA, p. 53. IEEE Computer Society, Washington, DC (2005)
Vincent, L., Soille, P.: Watersheds in digital spaces: An efficient algorithm based on immersion simulations. IEEE Trans. Pattern Anal. Mach. Intell. 13(6), 583–598 (1991)
Viola, P.A., Jones, M.J.: Rapid object detection using a boosted cascade of simple features. In: Proceedings of CVPR, pp. I511–I518 (2001)
Yang, R., Mirmehdi, M., Xie, X.: A charged active contour based on electrostatics. In: Blanc-Talon, J., Philips, W., Popescu, D., Scheunders, P. (eds.) ACIVS 2006. LNCS, vol. 4179, pp. 173–184. Springer, Heidelberg (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Anton-Canalis, L., Hernandez-Tejera, M., Sanchez-Nielsen, E. (2011). Distance Maps from Unthresholded Magnitudes. In: Vitrià , J., Sanches, J.M., Hernández, M. (eds) Pattern Recognition and Image Analysis. IbPRIA 2011. Lecture Notes in Computer Science, vol 6669. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21257-4_12
Download citation
DOI: https://doi.org/10.1007/978-3-642-21257-4_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21256-7
Online ISBN: 978-3-642-21257-4
eBook Packages: Computer ScienceComputer Science (R0)