skip to main content
10.1145/2245276.2245285acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
research-article

An application of circumscribed circle filter in the Multi-Stencils Fast Marching method

Authors Info & Claims
Published:26 March 2012Publication History

ABSTRACT

We develop an effective method for improving the segmentation result based on the Multi-Stencils Fast Marching method (MSFM). In MSFM, the gradient information of the image plays a vital role for calculating edges. It is straightforward to obtain the edge of good quality images; however, MSFM may not have robust edge maps available for images with spurious edges. Thus, a special multi-direction circumscribed circle filter is proposed to calculate the image gradient information which is then used in the MSFM. Using the new gradient information, better image contours can be obtained with MSFM. The size of the radius used in our circle filter is constant even the standard deviation of zero-mean Gaussian noise changes while the parameters of mean filter and Canny filter for gradient computation have to be correctly selected according to different noisy images. Our proposed method shows that it is effective through the experiments of image segmentation.

References

  1. H. Hu, et al., "Image segmentation of cervical vertebra in X-ray radiographs using the curve fitting strategy," 2011, pp. 853--858. Google ScholarGoogle ScholarDigital LibraryDigital Library
  2. M. Kass, et al., "Snakes: Active contour models," International journal of computer vision, vol. 1, pp. 321--331, 1988.Google ScholarGoogle Scholar
  3. P. Fua and Y. Leclerc, "Model driven edge detection," Machine Vision and Applications, vol. 3, pp. 45--56, 1990. Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. S. Osher and J. Sethian, "Fronts propagating with curvature-dependent speed: algorithms based on Hamilton-Jacobi formulations," Journal of Computational Physics, vol. 79, pp. 12--49, 1988. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. T. Barth and J. Sethian, "Numerical schemes for the Hamilton-Jacobi and level set equations on triangulated domains," Journal of Computational Physics, vol. 145, pp. 1--40, 1998. Google ScholarGoogle ScholarDigital LibraryDigital Library
  6. D. Adalsteinsson and J. Sethian, "A fast level set method for propagating interfaces," Journal of computational physics, vol. 118, pp. 269--277, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. R. Kimmel and J. Sethian, "Optimal algorithm for shape from shading and path planning," Journal of Mathematical Imaging and Vision, vol. 14, pp. 237--244, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. R. Kimmel and A. Bruckstein, "Shape offsets via level sets," Computer-Aided Design, vol. 25, pp. 154--162, 1993.Google ScholarGoogle ScholarCross RefCross Ref
  9. T. Deschamps and L. Cohen, "Fast extraction of tubular and tree 3D surfaces with front propagation methods," Pattern Recognition, vol. 1, p. 10731, 2002. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. S. Kim, "An o(n) Level Set Method for Eikonal Equations," SIAM J. Scientific Computing, vol. 22, pp. 2178--2193, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. J. Sethian, "Level set methods and fast marching methods," Journal of Computing and Information Technology, vol. 11, pp. 1--2, 2003.Google ScholarGoogle ScholarCross RefCross Ref
  12. L. Cohen and R. Kimmel, "Global minimum for active contour models: A minimal path approach," International journal of computer vision, vol. 24, pp. 57--78, 1997. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. R. K. a. J. Sethian, "Fast Marching Methods on Triangulated Domains," Proc. Nat'l Academy of Sciences, vol. 95, pp. 8341--8435, 1998.Google ScholarGoogle Scholar
  14. P. E. D. a. Q. Lin, "A Modified Fast Marching Method," Proc. Scandinavian Conf. Image Analysis, pp. 1154--1161, 2003. Google ScholarGoogle ScholarDigital LibraryDigital Library
  15. A. B. L. Yatziv, and G. Sapiro, "O(N) Implementation of the Fast Marching Algorithm," J. Computational Physics, vol. 212, pp. 393--399, Mar. 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. M. Hassouna and A. Farag, "Multistencils fast marching methods: A highly accurate solution to the eikonal equation on cartesian domains," IEEE transactions on pattern analysis and machine intelligence, pp. 1563--1574, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. D. A. a. J. Sethian, "A Fast Level Set Method for Propagating Interfaces," J. Computational Physics, vol. 118, pp. 269--277, 1995. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. S. Godunov, "A finite difference method for the numerical computation of discontinuous solutions of the equations of fluid dynamics," Mat. Sb, vol. 47, pp. 271--290, 1959.Google ScholarGoogle Scholar
  19. E. Rouy and A. Tourin, "A viscosity solutions approach to shape-from-shading," SIAM Journal on Numerical Analysis, vol. 29, pp. 867--884, 1992. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. H. Zhao, "Fast Sweeping Method for Eikonal Equations," Math. Computation, vol. 74, pp. 603--627, 2004.Google ScholarGoogle ScholarCross RefCross Ref
  21. E. W. Dijkstra, "A Note on Two Problems in Connection with Graphs," Numerische Mathematik, vol. 1, pp. 269--271, 1959.Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. J. Sethian, "Level Sets Methods and Fast Marching Methods, second ed," Cambridge Univ. Press, 1999.Google ScholarGoogle Scholar
  23. I. Abdou and W. Pratt, "Quantitative design and evaluation of enhancement/thresholding edge detectors," Proceedings of the IEEE, vol. 67, pp. 753--763, 1979.Google ScholarGoogle ScholarCross RefCross Ref
  24. J. F. Canny, "A computational approach to edge detection," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 8, pp. 679--698, 1986. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. An application of circumscribed circle filter in the Multi-Stencils Fast Marching method

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          SAC '12: Proceedings of the 27th Annual ACM Symposium on Applied Computing
          March 2012
          2179 pages
          ISBN:9781450308571
          DOI:10.1145/2245276
          • Conference Chairs:
          • Sascha Ossowski,
          • Paola Lecca

          Copyright © 2012 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 26 March 2012

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article

          Acceptance Rates

          SAC '12 Paper Acceptance Rate270of1,056submissions,26%Overall Acceptance Rate1,650of6,669submissions,25%
        • Article Metrics

          • Downloads (Last 12 months)0
          • Downloads (Last 6 weeks)0

          Other Metrics

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader