×

Finite-volume level set method and its adaptive version on completing subjective contours. (English) Zbl 1140.35323

Summary: We deal with a problem of segmentation (including missing boundary completion) and subjective contour creation. For the corresponding models we apply the semi-implicit finite volume numerical schemes leading to methods which are robust, efficient and stable without any restriction to a time step. The finite volume discretization enables to use the spatial adaptivity and thus improve significantly the computational time. The computational results related to image segmentation with partly missing boundaries and subjective contour extraction are presented.

MSC:

35A35 Theoretical approximation in context of PDEs
35K55 Nonlinear parabolic equations
65M12 Stability and convergence of numerical methods for initial value and initial-boundary value problems involving PDEs
68M10 Network design and communication in computer systems
PDF BibTeX XML Cite
Full Text: EuDML Link

References:

[1] Evans L. C., Spruck J.: Motion of level sets by curvature I. Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision, and Material Science. Cambridge University Press, Cambridge 1999 · Zbl 0726.53029
[2] Handlovičová A., Mikula, K., Sgallari F.: Semi-implicit complementary volume scheme for solving level set like equations in image processing and curve evolution. Numer. Math. 93 (2003), 675-695 · Zbl 1065.65105
[3] Kanizsa G.: Organization in Vision. Hardcover 1979
[4] Krivá Z., Mikula K.: An adaptive finite volume scheme for solving nonlinear diffusion equations in image processing. J. Visual Communication and Image Representation 13 (2002), 22-35
[5] Krivá Z., Mikula K.: An adaptive finite volume scheme in processing of color images. Proc. ALGORITMY 2000, Conference on Scientific Computing, Podbanské 2000, pp. 174-188 · Zbl 1012.35002
[6] Krivá Z.: Adaptive Finite Volume Methods in Image Processing. Edícia vedeckých prác, STU Bratislava, Stavebná fakulta 2004
[7] Krivá Z.: Segmentation combining approaches based on mean curvature. Mathematical Modelling and Analysis 2005, Proc. 10th International Conference MMA2005&CMAM2, Trakai 2005, pp. 433-441
[8] Mikula K., Sarti,, A, Sgallari F.: Co-volume method for Riemennian mean curvature flow in subjective surface multiscale segmentation. Comput. Visual Sci. 9 (2006), 1, 23-31
[9] Mikula K., Sarti, A., Sgallari F.: Co-volume level set method in subjective surface based medical image segmentation. Handbook of Biomedical Image Analysis, Kluwer Academic/Plenum Publishers, Dordrecht 2005, pp. 583-626
[10] Mikula K., Sarti A.: Parallel co-volume subjective surface method for 3D medical image segmentation. Deformable Model (J. Suri, Springer-Verlag, Berlin 2006, to appear
[11] Osher S., Sethian J. A.: Front propagating with curvature dependent speed: algorithms based on the Hamilton-Jacobi formulation. J. Comput. Phys. 79 (1988), 12-49 · Zbl 0659.65132
[12] Sarti A., Malladi, R., Sethian J. A.: Subjective surfaces: A method for completing missing boundaries. Proc. Nat. Acad. Sci. U.S.A. 12 (2000), 97, pp. 6258-6263 · Zbl 0966.68214
[13] Sarti A., Citti G.: Subjective surfaces and Riemannian mean curvature flow graphs. Acta Math. Univ. Comenianae 70 (2001), 1, 85-104 · Zbl 0995.65100
[14] Sarti A., Malladi, R., Sethian J. A.: Subjective surfaces: A geometric model for boundary completion. Internat. J. Computer Vision 46 (2002), 3, 201-221 · Zbl 1012.68727
[15] Sethian J. A.: Numerical algorithm for propagating interfaces: Hamilton-Jacobi equations and conservation laws. J. Diff. Geom. 31 (1990), 131-161 · Zbl 0691.65082
[16] Sethian J. A.: Level set methods and fast marching methods. Evolving Interfaces in Computational Geometry, Fluid Mechanics, Computer Vision, and Material Science. Cambridge University Press, Cambridge 1999 · Zbl 0973.76003
[17] Walkington N. J.: Algorithms for computing motion by mean curvature. SIAM J. Numer. Anal. 33 (1996), 6, 2215-2238 · Zbl 0863.65061
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.