Stochastic Morphological Filtering and Bellman-Maslov Chains - Mines Paris Accéder directement au contenu
Communication Dans Un Congrès Année : 2013

Stochastic Morphological Filtering and Bellman-Maslov Chains

Résumé

This paper introduces a probabilistic framework for adaptive morphological dilation and erosion. More precisely our probabilistic formalization is based on using random walk simulations for a stochastic estimation of adaptive and robust morphological operators. Hence, we propose a theoretically sound morphological counterpart of Monte Carlo stochastic filtering. The approach by simulations is inefficient but particularly tailorable for introducing different kinds of adaptability. From a theoretical viewpoint, stochastic morphological operators fit into the framework of Bellman-Maslov chains, the ( max , + )-counterpart of Markov chains, which the basis behind the efficient implementations using sparse matrix products.

Dates et versions

hal-00834635 , version 1 (17-06-2013)

Identifiants

Citer

Jesus Angulo, Santiago Velasco-Forero. Stochastic Morphological Filtering and Bellman-Maslov Chains. 11th International Symposium, ISMM 2013, May 2013, Uppsala, Sweden. pp.171-182, ⟨10.1007/978-3-642-38294-9_15⟩. ⟨hal-00834635⟩
170 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More