返回
Revisiting priority queues for image analysis
DOI:10.1016/j.patcog.2010.04.002.png)
摘要
En 中文
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. (C) 2010 Elsevier Ltd. All rights reserved.
Keyword:
Image analysis
Priority queue
Heap
Binary search tree
AVL tree
Splay tree
Red-black tree
Ladder queue
Hierarchical heap
Grey-weighted distance transform
Watershed
AI总结
对已上传原文的论文进行重点信息的提取,主要内容包括:简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
7.6
论文数:
1.4W
被引数:
6.1W
机构
暂无机构信息

