Revisiting priority queues for image analysis

DOI10.1016/j.patcog.2010.04.002zbMath1214.68447OpenAlexW2168992062MaRDI QIDQ1957852

Cris L. Luengo Hendriks

Publication date: 27 September 2010

Published in: Pattern Recognition (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.patcog.2010.04.002

zbMATH Keywords

priority queueimage analysisbinary search treeAVL treeheapwatershedsplay treegrey-weighted distance transformhierarchical heapladder queuered-black tree

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Pattern recognition, speech recognition (68T10) Data structures (68P05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• An optimal algorithm for deleting the root of a heap
• Inserting a new element into a heap
• Topographic distance and watershed lines
• Theory of 2-3 heaps
• O(\(N\)) implementation of the fast marching algorithm
• Self-adjusting binary search trees
• Shading from shape, the eikonal equation solved by grey-weighted distance transform
• A comparative study of parallel and sequential priority queue algorithms
• Ladder queue
• A fast marching level set method for monotonically advancing fronts.
• Fibonacci heaps and their uses in improved network optimization algorithms
• Irredundant intervals

This page was built for publication: Revisiting priority queues for image analysis