A modified fast marching method

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2749, Issue , 2003, Pages 1154-1161

  Danielsson, Per Erik ^a   Lin, Qingfen ^a  

^a LINKÖPING UNIVERSITY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

COST FUNCTIONS; IMAGE PROCESSING; IMAGE SEGMENTATION;

ARRIVAL TIME; FAST MARCHING METHODS; IMAGE PROCESSING APPLICATIONS; INPUT AND OUTPUTS; INPUT COSTS; INPUT DATAS; NUMERICAL EXPERIMENTS; SAMPLING UNITS;

NUMERICAL METHODS;

EID: 35248825149     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45103-x_151     Document Type: Article

References (7)

1. D. Adalsteinsson and J. A. Sethian. A fast level set method for propagating interfaces. Journal of Computational Physics, 118:269-277, 1995.
2. E. W. Dijkstra. A note on two problems in connection with graphs. Numerische Mathematik, 1:269-271, 1959.
3. Seongjai Kim. An O(N) level set method for eikonal equations. SIAM J. Sci. Comput., 22(6):2178-2193, 2001.
4. Qingfen Lin. Enhancement, extraction, and visualization of 3D volume data. PhD thesis, Linköping University, 2003.
5. Ingemar Ragnemalm. Neighborhoods for distance transformation using ordered propagation. CVGIP - Image Understanding, 56:161-166, 1992.
6. J. A. Sethian. Level Set Methods and Fast Marching Methods. Cambridge University Press, 1999.
7. John N. Tsitsiklis. Efficient algorithm for globally optimal trajectories. IEEE Transactions on Automatic Control, 40(9):1528-1538, 1995.