An application of circumscribed circle filter in the Multi-Stencils Fast Marching method
Pages 33 - 38
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.
[2]
M. Kass, et al., "Snakes: Active contour models," International journal of computer vision, vol. 1, pp. 321--331, 1988.
[3]
P. Fua and Y. Leclerc, "Model driven edge detection," Machine Vision and Applications, vol. 3, pp. 45--56, 1990.
[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.
[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.
[6]
D. Adalsteinsson and J. Sethian, "A fast level set method for propagating interfaces," Journal of computational physics, vol. 118, pp. 269--277, 1995.
[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.
[8]
R. Kimmel and A. Bruckstein, "Shape offsets via level sets," Computer-Aided Design, vol. 25, pp. 154--162, 1993.
[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.
[10]
S. Kim, "An o(n) Level Set Method for Eikonal Equations," SIAM J. Scientific Computing, vol. 22, pp. 2178--2193, 2001.
[11]
J. Sethian, "Level set methods and fast marching methods," Journal of Computing and Information Technology, vol. 11, pp. 1--2, 2003.
[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.
[13]
R. K. a. J. Sethian, "Fast Marching Methods on Triangulated Domains," Proc. Nat'l Academy of Sciences, vol. 95, pp. 8341--8435, 1998.
[14]
P. E. D. a. Q. Lin, "A Modified Fast Marching Method," Proc. Scandinavian Conf. Image Analysis, pp. 1154--1161, 2003.
[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.
[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.
[17]
D. A. a. J. Sethian, "A Fast Level Set Method for Propagating Interfaces," J. Computational Physics, vol. 118, pp. 269--277, 1995.
[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.
[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.
[20]
H. Zhao, "Fast Sweeping Method for Eikonal Equations," Math. Computation, vol. 74, pp. 603--627, 2004.
[21]
E. W. Dijkstra, "A Note on Two Problems in Connection with Graphs," Numerische Mathematik, vol. 1, pp. 269--271, 1959.
[22]
J. Sethian, "Level Sets Methods and Fast Marching Methods, second ed," Cambridge Univ. Press, 1999.
[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.
[24]
J. F. Canny, "A computational approach to edge detection," IEEE Transactions on Pattern Analysis and Machine Intelligence, vol. 8, pp. 679--698, 1986.
Index Terms
- An application of circumscribed circle filter in the Multi-Stencils Fast Marching method
Recommendations
Designs of fractional delay filter, Nyquist filter, lowpass filter and diamond-shaped filter
In this paper, the designs of fractional delay filter, Nyquist filter, lowpass filter and diamond-shaped filter are presented. First, the relation between Nyquist filter and fractional delay filter is investigated such that the design tools of one ...
Fast Multi-Hypothesis Motion Compensated Filter for Video Denoising
Multi-Hypothesis motion compensated filter (MHMCF) utilizes a number of hypotheses (temporal predictions) to estimate the current pixel which is corrupted with noise. While showing remarkable denoising results, MHMCF is computationally intensive as full ...
A fast 3D adaptive bilateral filter for ultrasound volume visualization
We propose a noise removal method for 3D ultrasound volume data using parallel bilateral filter.We can adjust the filter window size proportionally depending on the ultrasound coordinates.We performed to compare noise removal for anisotropic diffusion ...
Comments
Please enable JavaScript to view thecomments powered by Disqus.Information & Contributors
Information
Published In
March 2012
2179 pages
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]
Sponsors
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 26 March 2012
Check for updates
Author Tags
Qualifiers
- Research-article
Conference
SAC 2012
Sponsor:
Acceptance Rates
SAC '12 Paper Acceptance Rate 270 of 1,056 submissions, 26%;
Overall Acceptance Rate 1,650 of 6,669 submissions, 25%
Upcoming Conference
SAC '25
- Sponsor:
- sigapp
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 105Total Downloads
- Downloads (Last 12 months)2
- Downloads (Last 6 weeks)0
Reflects downloads up to 12 Dec 2024
Other Metrics
Citations
View Options
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in