Fast Implementation of the Ultimate Opening

Authors:
Jonathan Fabrizio;Beatriz Marcotegui
Affiliations:
MINES Paristech, CMM- Centre de morphologie mathématique, Mathématiques et Systèmes, Fontainebleau cedex, France 77305 and Laboratoire d'informatique de Paris 6, UPMC Univ Paris 06, ...;MINES Paristech, CMM- Centre de morphologie mathématique, Mathématiques et Systèmes, Fontainebleau cedex, France 77305
Venue:
ISMM '09 Proceedings of the 9th International Symposium on Mathematical Morphology and Its Application to Signal and Image Processing
Year:
2009

Citing 6
Cited 2

Attribute openings, thinnings, and granulometries

Computer Vision and Image Understanding
A Comparison of Algorithms for Connected Set Openings and Closings

IEEE Transactions on Pattern Analysis and Machine Intelligence
Connected Operators Based on Region-Tree Pruning Strategies

ICPR '00 Proceedings of the International Conference on Pattern Recognition - Volume 3
Numerical residues

Image and Vision Computing
Antiextensive connected operators for image and sequence processing

IEEE Transactions on Image Processing
Building the Component Tree in Quasi-Linear Time

IEEE Transactions on Image Processing

Ultimate Attribute Opening Segmentation with Shape Information

ISMM '09 Proceedings of the 9th International Symposium on Mathematical Morphology and Its Application to Signal and Image Processing
Ultimate opening and gradual transitions

ISMM'11 Proceedings of the 10th international conference on Mathematical morphology and its applications to image and signal processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.