Fast implementation of the ultimate opening - Mines Paris Accéder directement au contenu
Communication Dans Un Congrès Année : 2009

Fast implementation of the ultimate opening


We present an efficient implementation of the ultimate attribute opening operator. In this implementation, the ultimate opening is computed by processing the image maxtree representation. To show the efficiency of this implementation, execution time is given for various images at different scales. A quasi-linear dependency with the number of pixels is observed. This new implementation makes the ultimate attribute opening usable in real time. Moreover, the use of the maxtree allows us to process specific zones of the image independently, with a negligible additional computation time.

Dates et versions

hal-00834197 , version 1 (14-06-2013)



Jonathan Fabrizio, Beatriz Marcotegui. Fast implementation of the ultimate opening. 9th International Symposium on Mathematical Morphology and Its Application to Signal and Image Processing, ISMM 2009, Aug 2009, Groningen, Netherlands. pp.272-281, ⟨10.1007/978-3-642-03613-2_25⟩. ⟨hal-00834197⟩
180 Consultations
0 Téléchargements



Gmail Facebook Twitter LinkedIn More