A watershed algorithm progressively unveiling its optimalityReportar como inadecuado

A watershed algorithm progressively unveiling its optimality - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

1 CMM - Centre de Morphologie Mathématique

Abstract : In 1991 I described a particularly simple and elegant water-shed algorithm, where the ooding a topographic surface was scheduled by a hierarchical queue. In 2004 the watershed line has been described as the skeleton by zone of inuence for the topographic distance. The same algorithm still applies. In 2012 I dened a new distance based on a lexicographic ordering of the downstream paths leading each node to a regional minimum. Without changing a iota, the same algorithm does the job.

Keywords : weighted graphs steepest lexicographic distance topographic distance hierarchical queue Watershed Flooding

Autor: Fernand Meyer -

Fuente: https://hal.archives-ouvertes.fr/


Documentos relacionados