Generalized fronts propagation on weighted graphs

Main Article Content

Xavier Desquesnes Abderrahim Elmoataz Olivier Lézoray

Abstract

In this paper, we propose a general formulation and an algorithm for simultaneous propagation of several fronts evolving on a weighted graph. This formulation is an adaptation of the continuous level set formulation for front propagation and uses a Partial dierence Equations (PdEs) framework. The proposed algorithm is a graph-based version of the Fast Marching algorithm that allows simultaneous inward or outward propagation of several fronts. Experiments illustrate the behavior of the algorithm and show some application results on several types of data. 

Article Details

How to Cite
Desquesnes, X., Elmoataz, A., & Lézoray, O. (2015). Generalized fronts propagation on weighted graphs. Proceedings Of The Conference Algoritmy, , 371-381. Retrieved from http://www.iam.fmph.uniba.sk/amuc/ojs/index.php/algoritmy/article/view/347/254
Section
Articles