CONSTANT-TIME PARALLEL ALGORITHMS FOR IMAGE LABELING ON A RECONFIGURABLE NETWORK OF PROCESSORS

被引：9

作者：

ALNUWEIRI, HM ^{[1
]}

机构：

[1] UNIV BRITISH COLUMBIA,CTR INTEGRATED COMP RES SYST,VANCOUVER V6T 1Z4,BC,CANADA

来源：

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS | 1994年 / 5卷 / 03期

基金：

加拿大自然科学与工程研究理事会;

关键词：

RECONFIGURABLE BUS SYSTEMS; PARALLEL ALGORITHMS; CONFIGURATIONAL COMPUTING; PARALLEL ARCHITECTURES; IMAGE COMPONENT LABELING; IMAGE COMPUTATIONS;

D O I：

10.1109/71.277785

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

A constant-time algorithm for labeling the connected components of an N x N image on a reconfigurable network of N3 processors is Presented. The main contribution of the algorithm is a novel constant-time technique for determining the minimum-labeled PE in each component. The number of processors used by the algorithm can be reduced to N2+(1/d), for any 1 less-than-or-equal-to d less-than-or-equal-to log N, if O(d) time is allowed.

引用

页码：320 / 326

页数：7

共 15 条

[1] PARALLEL ARCHITECTURES AND ALGORITHMS FOR IMAGE COMPONENT LABELING
ALNUWEIRI, HM
PRASANNA, VK
[J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 1992, 14 (10) : 1014 - 1034
[2] ALNUWEIRI HM, 1991, DEC P INT WORKSH COM
[3] THE POWER OF RECONFIGURATION
BENASHER, Y
PELEG, D
RAMASWAMI, R
SCHUSTER, A
[J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1991, 13 (02) : 139 - 153
[4] HAO E, 1992, S FRONTIERS MASSIVEL
[5] JANG J, 1992, S FRONTIERS MASSIVEL
[6] JENG J, 1991, P INT C PARALLEL PRO
[7] POLYMORPHIC-TORUS NETWORK
LI, HW
MARESCA, M
[J]. IEEE TRANSACTIONS ON COMPUTERS, 1989, 38 (09) : 1345 - 1351
[8] CONNECTION AUTONOMY IN SIMD COMPUTERS - A VLSI IMPLEMENTATION
MARESCA, M
LI, HW
[J]. JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1989, 7 (02) : 302 - 320
[9] MILLER R, 1988, 5TH P MIT C ADV RES, P163
[10] NAKANO K, 1990, P COMP 90, P71

← 1 2 →