The all-nearest-neighbours (ANN) problem is a fundamental problem in computational geometry. In the letter a new two-dimensional triangular systolic array with mesh-connected cells is proposed for the ANN problem. Thi...
详细信息
The all-nearest-neighbours (ANN) problem is a fundamental problem in computational geometry. In the letter a new two-dimensional triangular systolic array with mesh-connected cells is proposed for the ANN problem. This array can process a queue of ANN problems at a throughput of one ANN problem per time period, with an efficiency of 100%.
作者：
Creutzburg, ReinerAcademy of Sciences of the G.D.R
Central Institute of Cybernetics and Information Processes International Basic Laboratory for Image Processing and Computer Graphics Kurstrasse 33 P.O.Box 1298 BerlinDDR-1086 Germany
In this paper we investigate the parallel conflict-free access to complete extended q-ary subtrees of complete q-ary trees. Thereby the memory module assignment function S is supposed to be recursively linear and nonl...
详细信息
An approach for applying a structural texture analysis method to automatic visual inspection of fabric samples in the textile industry is presented. The main steps (image preprocessing, image segmentation, model descr...
详细信息
In this paper the parallel conflict-free access to complete extended binary subtrees of complete binary trees is investigated. Thereby linear and also nonlinear memory module assignment functions S are considered. Fur...
详细信息
暂无评论