Efficient algorithm for finding the exact minimum barrier distance

Abstract The minimum barrier distance, MBD, introduced recently in [1] , is a pseudo-metric defined on a compact subset D of the Euclidean space R n and whose values depend on a fixed map (an image) f from D into R . The MBD is defined as the minimal value of the barrier strength of a path between the points, which constitutes the length of the smallest interval containing all values of f along the path. In this paper we present a polynomial time algorithm, that provably calculates the exact values of MBD for the digital images. We compare this new algorithm, theoretically and experimentally, with the algorithm presented in [1] , which computes the approximate values of the MBD. Moreover, we notice that every generalized distance function can be naturally translated to an image segmentation algorithm. The algorithms that fall under such category include: Relative Fuzzy Connectedness, and those associated with the minimum barrier, fuzzy distance, and geodesic distance functions. In particular, we compare experimentally these four algorithms on the 2D and 3D natural and medical images with known ground truth and at varying level of noise, blur, and inhomogeneity.

[1]  Punam K. Saha,et al.  Measurement of trabecular bone thickness in the limited resolution regime of in vivo MRI by fuzzy distance transform , 2004, IEEE Transactions on Medical Imaging.

[2]  Azriel Rosenfeld,et al.  On connectivity properties of grayscale pictures , 1981, Pattern Recognit..

[3]  A. ROSENFELD,et al.  Distance functions on digital pictures , 1968, Pattern Recognit..

[4]  Céline Fouard,et al.  An Objective Comparison Between Gray Weighted Distance Transforms and Weighted Distance Transforms on Curved Spaces , 2006, DGCI.

[5]  James A. Sethian,et al.  Level Set Methods and Fast Marching Methods , 1999 .

[6]  Xinjian Chen,et al.  Linear Time Algorithms for Exact Distance Transform , 2011, Journal of Mathematical Imaging and Vision.

[7]  G. Borgefors.  Distance transformations in arbitrary dimensions , 1984 .

[8]  Jun-ichiro Toriwaki,et al.  New algorithms for euclidean distance transformation of an n-dimensional digitized picture with applications , 1994, Pattern Recognit..

[9]  Robin Strand,et al.  Distance Functions & Image Processing on Point-lattices: With Focus on the 3d Face-&-body-centered Cubic Grids , 2008 .

[10]  Punam K. Saha,et al.  The minimum barrier distance , 2013, Comput. Vis. Image Underst..

[11]  Jayaram K. Udupa,et al.  Fuzzy Connectedness Image Segmentation in Graph Cut Formulation: A Linear-Time Algorithm and a Comparative Analysis , 2012, Journal of Mathematical Imaging and Vision.

[12]  Azriel Rosenfeld,et al.  Sequential Operations in Digital Picture Processing , 1966, JACM.

[13]  Leo Grady,et al.  A Seeded Image Segmentation Framework Unifying Graph Cuts And Random Walker Which Yields A New Algorithm , 2007, 2007 IEEE 11th International Conference on Computer Vision.

[14]  Pekka J. Toivanen,et al.  Erratum to "New geodesic distance transforms for gray-scale images" [Pattern Recognition Letters 17 (1996) 437-450] , 1996, Pattern Recognit. Lett..

[15]  R. Oppermann.  Elements of the topology of plane sets of points: by M. H. A. Newman. 221 pages, illustrations, 15 × 23 cms. New York, The Macmillan Company, 1939. Price $3.50 , 1939 .

[16]  Milan Sonka,et al.  Topomorphologic Separation of Fused Isointensity Objects via Multiscale Opening: Separating Arteries and Veins in 3-D Pulmonary CT , 2010, IEEE Transactions on Medical Imaging.

[17]  A. Rosenfeld.  The fuzzy geometry of image subsets , 1984, Pattern Recognit. Lett..

[18]  Wim H. Hesselink,et al.  A General Algorithm for Computing Distance Transforms in Linear Time , 2000, ISMM.

[19]  Gunilla Borgefors,et al.  Digital distance functions on three-dimensional grids , 2011, Theor. Comput. Sci..

[20]  P. Danielsson.  Euclidean distance mapping , 1980 .

[21]  Jayaram K. Udupa,et al.  Affinity functions in fuzzy connectedness based image segmentation II: Defining and recognizing truly novel affinities , 2010, Comput. Vis. Image Underst..

[22]  Punam K. Saha,et al.  Fuzzy Distance Transform: Theory, Algorithms, and Applications , 2002, Comput. Vis. Image Underst..

[23]  Gilles Bertrand,et al.  Watershed Cuts: Thinnings, Shortest Path Forests, and Topological Watersheds , 2010, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[24]  Andrew Blake,et al.  "GrabCut" , 2004, ACM Trans. Graph..

[25]  P. Rüegsegger,et al.  A new method for the model‐independent assessment of thickness in three‐dimensional images , 1997 .

[26]  Camille Couprie,et al.  Power Watershed: A Unifying Graph-Based Optimization Framework , 2011, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[27]  Azriel Rosenfeld,et al.  Fuzzy Digital Topology , 1979, Inf. Control..

[28]  Calvin R. Maurer,et al.  A Linear Time Algorithm for Computing Exact Euclidean Distance Transforms of Binary Images in Arbitrary Dimensions , 2003, IEEE Trans. Pattern Anal. Mach. Intell..

[29]  Gilles Bertrand,et al.  Quasi-Linear Algorithms for the Topological Watershed , 2005, Journal of Mathematical Imaging and Vision.

[30]  Marko Subasic,et al.  Level Set Methods and Fast Marching Methods , 2003 .

[31]  Gilles Bertrand,et al.  Enhanced computation method of topological smoothing on shared memory parallel machines , 2005, Journal of Mathematical Imaging and Vision.

[32]  Jayaram K. Udupa,et al.  Affinity functions in fuzzy connectedness based image segmentation I: Equivalence of affinities , 2010, Comput. Vis. Image Underst..

[33]  Jorge Stolfi,et al.  The image foresting transform: theory, algorithms, and applications , 2004 .

[34]  Jayaram K. Udupa,et al.  Fuzzy-connected 3D image segmentation at interactive speeds , 2000, Graph. Model..

[35]  Tomio Hirata,et al.  A Unified Linear-Time Algorithm for Computing Distance Maps , 1996, Inf. Process. Lett..

[36]  Gunilla Borgefors,et al.  On Digital Distance Transforms in Three Dimensions , 1996, Comput. Vis. Image Underst..