Abstract
This report will be of interest to those who program mathematical morphology routines, since it concentrates on data structures for their efficient implementation. With respect to basic priority queue operations, we provide an empirical evaluation, using execution time, of an implicit heap, splay—tree, SplayQ, AVL—tree, Fibonacci—heap and hierarchical queue. It is shown that the hierarchical queue implementation performs fastest. However, it is an unrealistic implementation for images that contain data items with a key value greater than 12 significant bits or for floating point values. Therefore, we introduce the SplayQ, a hybrid data structure, to overcome this limitation, and with respect to speed of performance, it is the SplayQ that is the fastest from the other data structures considered.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adams, R. & Bischof, L. (1994), ‘Seeded region growing’, IEEE Transactions on Pattern Analysis and Machine Intelligence.
Bell, J. & Gupta, G. (1993), ‘An evaluation of self—adjusting binary search tree techniques’, Software Practice and Experience 23, 369–382.
Breen, E., Joss, G. & Williams, K. (1992), ‘Dynamic arrays for fast, efficient, data manipulation during image analysis: a new software tool for exploratory data analysis’, Computer Methods and Programs in Biomedicine 37, 85–92.
Fredman, M. L. & Tarjan, R. E. (1987), ‘Fibonacci heaps and their uses in improved network optimization algorithms’, J. Assoc. Comp. Mach. 34, 596–615.
Jones, D. W. (1986), ‘An empirical comparison of priority—queue and event—set implementations’, Communications of the ACM 29, 300–311.
Kingston, J. H. (1990), Algorithms and data structures: design, correctness, analysis, International Computer Science, Addison-Wesley, Sydney.
Knuth, D. (1973), The art of computer programming. Volume 3: Sorting and searching, Addison-Wesley.
Meyer, F. (1991), Algorithmes ordonnés de ligne de partage des eaux, Technical Report N06/90/MM, Ecole des Mines de Paris, Centre de Morphologie Mathématique.
Serra, J. (1982), Image Analysis and Mathematical Morphology, Academic Press.
Sleator, D. D. & Tarjan, R. E. (1985), ‘Self—adjusting binary search trees’, J. Assoc. Comp. Mach. 32, 652–686.
Soille, P. & Vincent, L. (1990), Determining watersheds in digital pictures via flooding simulations, in ‘Visual Communications and Image Processing’90’, Lausanne, pp. 240–250.
Vincent, L. (1989), ‘Graphs and mathematical morphology’, Signal Processing 16, 365–388.
Vincent, L. (1991a), Efficient computation of various types of skeletons, in ‘Medical Imaging V’.
Vincent, L. (1991b), New trends in morphological algorithms, in ‘Nonlinear Image Processing II’, pp. 158–170.
Vincent, L. (1992), Morphological grayscale reconstruction: definition, efficient algorithm and applications in image analysis, in Proc. IEEE Computer Vision and Pattern Recognition’92’, Champaign IL, pp. 633–635.
Vincent, L. (1993), Grayscale area openings and closings, their efficient implementation and applications, in J. Serra & P. Salembier, eds, ‘Mathematical Morphology and its applications to signal processing’, UPC Publications, pp. 22–27.
Vincent, L. & Soille, P. (1991), ‘Watersheds in digital spaces: an efficient algorithm based on immersion simulations’, IEEE Transactions on Pattern Analysis and Machine Intelligence 13(6), 583–598.
Williams, J. W. J. (1964), ‘Algorithm 232: Heapsort’, Communications of the ACM 7, 347–348.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1994 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Breen, E.J., Monro, D.H. (1994). An Evaluation of Priority Queues for Mathematical Morphology. In: Serra, J., Soille, P. (eds) Mathematical Morphology and Its Applications to Image Processing. Computational Imaging and Vision, vol 2. Springer, Dordrecht. https://doi.org/10.1007/978-94-011-1040-2_32
Download citation
DOI: https://doi.org/10.1007/978-94-011-1040-2_32
Publisher Name: Springer, Dordrecht
Print ISBN: 978-94-010-4453-0
Online ISBN: 978-94-011-1040-2
eBook Packages: Springer Book Archive