Abstract. We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, we propose a new thinning paradigm to compute them. More precisel...
Jean Cousty, Gilles Bertrand, Laurent Najman, Mich...
A method of rare event simulation, termed here quantum simulation, and known also (with some variations) as population Monte Carlo, and Sequential Markov Chain simulation, is appli...
We recently introduced the watershed cuts, a notion of watershed in edge-weighted graphs. In this paper, our main contribution is a thinning paradigm from which we derive three alg...
Jean Cousty, Gilles Bertrand, Laurent Najman, Mich...
A fully parallel iterative thinning algorithm called MB2 is presented. It favourably competes with the best known algorithms regarding homotopy, mediality; thickness, rotation inv...
This paper describes an improved thinning algorithm for binary images. We improve thinning algorithm from the fundamental properties such as connectivity, onepixel width, robust t...