Self-adjusting binary search trees
Journal of the ACM (JACM)
An empirical comparison of priority-queue and event-set implementations
Communications of the ACM
Fibonacci heaps and their uses in improved network optimization algorithms
Journal of the ACM (JACM)
Computing distance transformations in convex and non-convex domains
Pattern Recognition
Relaxed heaps: an alternative to Fibonacci heaps with applications to parallel computation
Communications of the ACM
Shading from shape, the eikonal equation solved by grey-weighted distance transform
Pattern Recognition Letters
An optimal algorithm for deleting the roof of a heap
Information Processing Letters
Performance of priority queue structures in a virtual memory environment
The Computer Journal - Special issue on data structures
Topographic distance and watershed lines
Signal Processing - Special issue on mathematical morphology and its applications to signal processing
The influence of caches on the performance of heaps
Journal of Experimental Algorithmics (JEA)
Attribute openings, thinnings, and granulometries
Computer Vision and Image Understanding
A comparative study of parallel and sequential priority queue algorithms
ACM Transactions on Modeling and Computer Simulation (TOMACS)
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Lazy queue: an efficient implementation of the pending-event set
ANSS '91 Proceedings of the 24th annual symposium on Simulation
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Buckets, heaps, lists, and monotone priority queues
SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
A two-list synchronization procedure for discrete event simulation
Communications of the ACM
Algorithm alley: fast and small resizable arrays
Dr. Dobb's Journal
IEEE Transactions on Pattern Analysis and Machine Intelligence
Discrete Applied Mathematics - Special issue: Special issue devoted to the fifth annual international computing and combinatories conference (COCOON'99) Tokyo, Japan 26-28 July 1999
Funnel Heap - A Cache Oblivious Priority Queue
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
Efficient morphological reconstruction: a downhill filter
Pattern Recognition Letters
Ladder queue: An O(1) priority queue structure for large-scale discrete event simulation
ACM Transactions on Modeling and Computer Simulation (TOMACS)
Short note: O(N) implementation of the fast marching algorithm
Journal of Computational Physics
Priority pixel queue algorithm for geodesic distance transforms
Image and Vision Computing
Discrete bisector function and Euclidean skeleton in 2D and 3D
Image and Vision Computing
Shared hardware data structures for hard real-time systems
Proceedings of the tenth ACM international conference on Embedded software
Improving the stochastic watershed
Pattern Recognition Letters
| Hi-index | 0.01 |
Many algorithms in image analysis require a priority queue, a data structure that holds pointers to pixels in the image, and which allows efficiently finding the pixel in the queue with the highest priority. However, very few articles describing such image analysis algorithms specify which implementation of the priority queue was used. Many assessments of priority queues can be found in the literature, but mostly in the context of numerical simulation rather than image analysis. Furthermore, due to the ever-changing characteristics of computing hardware, performance evaluated empirically 10 years ago is no longer relevant. In this paper I revisit priority queues as used in image analysis routines, evaluate their performance in a very general setting, and come to a very different conclusion than other authors: implicit heaps are the most efficient priority queues. At the same time, I propose a simple modification of the hierarchical queue (or bucket queue) that is more efficient than the implicit heap for extremely large queues.