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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Retornaz, T., Marcotegui, B.: Scene text localization based on the ultimate opening. In: International Symposium on Mathematical Morphology, vol. 1, pp. 177–188 (2007)
Beucher, S.: Numerical residues. Image Vision Computing 25(4), 405–415 (2007)
Breen, E.J., Jones, R.: Attribute openings, thinnings, and granulometries. Computer Vision and Image Understanding 64(3), 377–389 (1996)
Retornaz, T.: Détection de textes enfouis dans des bases d’images généralistes. Un descripteur sémantique pour l’indexation. PhD thesis, Ecole Nationale Suprieure des Mines de Paris - C.M.M., Fontainebleau - France (October 2007)
Retornaz, T., Marcotegui, B.: Ultimate opening implementation based on a flooding process. In: The 12th International Congress for Stereology (September 2007)
Garrido, L.: Hierarchical Region Based Processing of Images and Video Sequences: Application to Filtering, Segmentation and Information Retrieval. PhD thesis, Universitat Politnica de Catalunya - Department of Signal theory and Communications, Barcelona, Spain (April 2002)
Salembier, P., Garrido, L.: Connected operators based on region-tree pruning strategies. In: International Conference on Pattern Recognition, ICPR 2000, September 2000, vol. 3, pp. 3371–3374 (2000)
Meijster, A., Wilkinson, M.H.: A comparison of algorithms for connected set openings and closings. IEEE Trans. on Pattern Analysis and Machine Intelligence 24(4) (April 2002)
Salembier, P., Oliveras, A., Garrido, L.: Anti-extensive connected operators for image and sequence processing. IEEE Trans. on Image Processing 7(4), 555–570 (1998)
Huang, X., Fisher, M., Smith, D.: An efficient implementation of max tree with linked list and hash table. In: Proc. VIIth Digital Image Computing: Techniques and Applications, pp. 299–308 (2003)
Najman, L., Couprie, M.: Building the component tree in quasi-linear time. IEEE Transactions on Image Processing 15(11), 3531–3539 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fabrizio, J., Marcotegui, B. (2009). Fast Implementation of the Ultimate Opening. In: Wilkinson, M.H.F., Roerdink, J.B.T.M. (eds) Mathematical Morphology and Its Application to Signal and Image Processing. ISMM 2009. Lecture Notes in Computer Science, vol 5720. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-03613-2_25
Download citation
DOI: https://doi.org/10.1007/978-3-642-03613-2_25
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-03612-5
Online ISBN: 978-3-642-03613-2
eBook Packages: Computer ScienceComputer Science (R0)