• Documents
  • Authors
  • Tables
  • Log in
  • Sign up
  • MetaCart
  • DMCA
  • Donate

CiteSeerX logo

Advanced Search Include Citations
Advanced Search Include Citations | Disambiguate

A simple, fast and stabilized flowing finite volume method for solving general curve evolution equations. (2010)

by K Mikula, D Sevcovic, M Balazovjech
Venue:Comm. Comp. Physics
Add To MetaCart

Tools

Sorted by:
Results 1 - 3 of 3

3D Curve Evolution Algorithm with Tangential Redistribution for a Fully Automatic Finding of an Ideal Camera Path in Virtual Colonoscopy

by Karol Mikula , Jozef Urbán
"... Abstract. In this paper we develop new method, based on 3D evolving curves, for finding the optimal trajectory of the camera in the virtual colonoscopy -the medical technology dealing with colon diagnoses by computer. The proposed method consists of three steps: 3D segmentation of the colon from CT ..."
Abstract - Add to MetaCart
Abstract. In this paper we develop new method, based on 3D evolving curves, for finding the optimal trajectory of the camera in the virtual colonoscopy -the medical technology dealing with colon diagnoses by computer. The proposed method consists of three steps: 3D segmentation of the colon from CT images, finding an initial trajectory guess inside the segmented 3D subvolumes, and driving the initial 3D curve to its optimal position. To that goal, the new fast and stable 3D curve evolution algorithm is developed in which the initial curve is driven by the velocity field in the plane normal to the evolving curve, the evolution is regularized by curvature and accompanied by the suitable choice of tangential velocity. Thanks to the asymtotically uniform tangential redistribution of grid points, originally introduced in this paper for 3D evolving curves, and to the fast and stable semi-implicit scheme for solving our proposed intrinsic advection-diffusion PDE, we end up in fast and robust way with the smooth uniformly discretized 3D curve representing the ideal path of the camera in virtual colonoscopy.
(Show Context)

Citation Context

...lane normal to the evolving curve, the evolution is regularized by curvature, which makes it smooth, and it is accompanied by the suitable choice of the tangential velocity which makes the curve uniformly discretized during the evolution. In this paper, we develop new asymptotically uniform tangential grid point redistribution method for 3D evolving curves in parametric representation. Our new method is based on ideas from [7], where the authors used special κ1 − κ2 − ω − L 3D curve evolution formulation. The new method can be also understood as nontrivial generalization of 2D approaches from [9,10,11]. Our final 3D curve evolution model, in the form of an intrinsic advection-diffusion partial differential 642 K. Mikula and J. Urban equation with a driving force, is solved by the fast and stable semi-implicit scheme and we end up with the smooth uniformly discretized 3D curve representing the ideal trajectory of the camera in virtual colonoscopy. It is worth to note that the overall CPU for all steps in our approach is about 8 seconds on standard PC. Thus the method is highly competitive and it is being implemented into the medical software of the TatraMed spol s r.o., Bratislava company. ...

METHODS FOR SOLVING ADVECTION EQUATIONS

by Karol Mikula, Mario Ohlberger, Jozef Urbán, Karol Mikula, Mario Ohlberger, Jozef Urbán
"... Abstract. We introduce a new class of methods for solving non-stationary advection equations. The new methods are based on finite volume space discretizations and a semi-implicit discretization in time. Its basic idea is that outflow from a cell is treated explicitly while inflow is treated implicit ..."
Abstract - Add to MetaCart
Abstract. We introduce a new class of methods for solving non-stationary advection equations. The new methods are based on finite volume space discretizations and a semi-implicit discretization in time. Its basic idea is that outflow from a cell is treated explicitly while inflow is treated implicitly. This is natural, since we know what is outflowing from a cell at the old time step but we leave the method to resolve a system of equations determined by the inflows to a cell to obtain the solution values at the new time step. The matrix of the system in our inflow-implicit/outflow-explicit (I2OE) method is determined by the inflow fluxes which results in a M-matrix yielding favourable stability properties for the scheme. Since the explicit (outflow) part is not always dominated by the implicit (inflow) part and thus some oscillations can occur, we build a stabilization based on the upstream weighted averages with coefficients determined by the flux-corrected transport approach [2, 19] yielding high resolution versions, S1I2OE and S2I2OE, of the basic scheme. We prove that our new method is exact for any choice of a discrete time step on uniform rectangular grids in the case of constant velocity transport of quadratic functions in any dimension. We also show its formal second order accuracy in space and time for 1D advection problems with variable velocity. Although designed for non-divergence free velocity fields, we show that the basic I2OE scheme is locally mass
(Show Context)

Citation Context

...non-divergence free velocities or nonlinear conservation laws [11], in the Eulerian level set methods for evolving fronts [18], in a tangentially stabilized Lagrangean methods for evolving interfaces =-=[16, 1]-=- or in other ∗ Department of Mathematics, Slovak University of Technology, Radlinského 11, 81368 Bratislava, Slovakia (karol.mikula@stuba.sk). † Institut für Numerische und Angewandte Mathematik, Univ...

:1

by unknown authors
"... ar ..."
Abstract - Add to MetaCart
Abstract not found
(Show Context)

Citation Context

... and νN+2 = νN+1 + (ν2 − ν1). In order to derive a discrete numerical scheme, we follow the flowing finite volume method adopted for curve evolutionary problems as it was proposed by Mikula et al. in =-=[17, 19]-=-. Let us introduce the “dual” volume S∗i = [x∗i ,xi] ∪ [xi,x∗i+1] of Si, where x∗i = (xi−1 + xi)/2 (i = 1, 2, · · · , N ; x∗N+1 = x∗1). We define the i-th unit tangent angle of S∗i by ν∗i = (νi + νi+1...

Powered by: Apache Solr
  • About CiteSeerX
  • Submit and Index Documents
  • Privacy Policy
  • Help
  • Data
  • Source
  • Contact Us

Developed at and hosted by The College of Information Sciences and Technology

© 2007-2019 The Pennsylvania State University