Cut Pursuit and Geometric Applications
1 : LIFAT
Université de Tours
We present an overview of the cut pursuit algorithm [1], together with different applications for image processing and 3D data analysis.
We consider the problem of minimizing functionals defined with respect to an undirected weighted graph G = (V, E, w) with w ∈ RE+ and with the following form:
F:ΩV →R:x
Personnes connectées : 2 | Vie privée |