.png){kind=icon}
返回
An efficient O(1) time 3D all nearest neighbor algorithm from image processing perspective
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jpdc.2007.06.001.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper, we solve the k-dimensional all nearest neighbor (kD_ANN) problem, where k = 2 or 3, on a linear array with a reconfigurable pipelined bus system (LARPBS) from image processing perspective. First, for a two-dimensional (2D) binary image of size N x N, we devise an algorithm for solving the 2D_ANN problem using a LARPBS of size N2+epsilon, where 0 < epsilon << 1. Then, for a three-dimensional (3D) binary image of size N x N x N, we devise an algorithm for solving the 3D_ANN problem using a LARPBS of size N3+epsilon, where 0 < epsilon < 1. To the best of our knowledge, all results derived above are the best O(1) time 2D_ANN and 3D_ANN algorithms on the LARPBS model known. (C) 2007 Elsevier Inc. All rights reserved.
Keyword:
all nearest neighbors
Euclidean distance transform
LARPBS
image processing
parallel algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
4
论文数:
3.8K
被引数:
4.8K
机构
暂无机构信息
引用论文
Halogenation of Indoles with Copper(II) Halides: Selective Synthesis of 2-Halo-, 3-Halo-, and 2,3-Dibromoindoles.png)
Synthesis
SynthesisIF0
PREAI
分享收藏Experimental Study on the Dynamic Stability of Circular Saw Blades during the Processing of Bamboo-Based Fiber Composite PanelsForests
OAAI
ForestsIF0
OAAI分享收藏An O(1) time algorithm for the 3D euclidean distance transform on the CRCW PRAM modelCRCW PRAM模型上3D欧氏距离变换的O(1) 时间算法
PREAI
分享收藏Scalable and efficient parallel algorithms for Euclidean Distance Transform on the LARPBS model
PREAI
分享收藏
查看更多内容