检索结果-内蒙古大学图书馆

DYNAMIC INTELLIGENT SCHEDULING AND CONTROL OF RECONFIGURABLE parallel ARCHITECTURES FOR COMPUTER VISION image-processing

引用

JOURNAL OF parallel AND distributed COMPUTING 1991年第3期13卷 273-285页

作者： WEIL, F JAMIESON, LH DELP, EJ PURDUE UNIV SCH ELECT ENGNW LAFAYETTEIN 47907

This paper presents a system for dynamic intelligent scheduling and control of reconfigurable parallel processors. The purpose of the system is to provide a rapid prototyping capability for computer vision/image processing tasks. The scheduler particularly addresses the problems of algorithms with execution times that depend on the image data and processing scenarios that vary dynamically based on the input image. Since conventional scheduling methods cannot produce schedules for most tasks of this type, a dynamic controller is used to schedule the task and reconfigure the machine “on the fly.” This dynamic scheduling system attempts to balance the overall processing scenario with the needs of the individual routines that make up the task. This paper discusses the implementation of the DISC ( D ynamic I ntelligent S cheduling and C ontrol) system. Emphasis is on the scheduling heuristics as they apply to a reconfigurable parallel processor, the information in the system database, and the use of the system for prototyping computer vision/image processing tasks on a partitionable parallel system.

关键词： Computer Vision

来源：评论

学校读者我要写书评

暂无评论

parallel ALGORITHMS FOR DETERMINING K-WIDTH CONNECTivITY IN BINARY imageS

引用

JOURNAL OF parallel AND distributed COMPUTING 1991年第1期12卷 12-23页

作者： DEHNE, F HAMBRUSCH, SE PURDUE UNIV DEPT COMP SCIW LAFAYETTEIN 47907

In this paper we consider a new form of connectivity in binary images, called k -width connectivity. Two pixels a and b of value “1” are in the same k -width component if and only if there exists a path of width k such that a is one of the k start pixels and b is one of the k end pixels of this path. We present characterizations of the k -width components and show how to determine the k -width components of an n × n image in O(n) and O (log 2 n ) time on a mesh of processors and hypercube, respectively, when the image is stored with one pixel per processor. Our methods use a reduction of the k -width-connectivity problem to the 1-width-connectivity problem. A distributed, space-efficient encoding of the k -width components of small size allows us to represent the solution using O (1) registers per processor. Our hypercube algorithm also implies an algorithm for the shuffle-exchange network.

关键词： image processing

来源：评论

学校读者我要写书评

暂无评论

Examining the effects of CU/PE overlap and synchronization overhead when using the complete sums approach to image correlation

Examining the effects of CU/PE overlap and synchronization o...

引用

International Symposium on parallel and distributed processing (IPDPS)

作者： J.B. Armstrong M.A. Nichols H. Jay Siegel L.H. Jamieson Parallel Processing Laboratory School of Electrical Engineering Purdue University West Lafayette IN USA

A mixed-mode parallel machine's processing elements (PEs) are capable of operating in and switching between the SIMD and MIMD modes of parallelism. The paper analyzes various mappings of image correlation algorithms onto a mixed-mode parallel processing system. The trade-offs that exist between the SIMD and MIMD modes explain why some sequences of instructions are performed better in one mode than in the other and are the primary basis employed in comparing different mappings of a parallel algorithm onto a mixed-mode system.< >

关键词： parallel machines parallel processing image analysis parallel algorithms image processing Switches Laboratories Large-scale systems Pixel Smoothing methods

来源：评论

学校读者我要写书评

暂无评论

BDG-torus union graph-an efficient algorithmically specialized parallel interconnect

BDG-torus union graph-an efficient algorithmically specializ...

引用

International Symposium on parallel and distributed processing (IPDPS)

作者： N. Suri A. Mendelson D.K. Pradhan Department of Electrical and Computer Engineering University of Massachusetts Amherst MA Department of EE Technion-Israel Institute of Technology Israel

The binary de Bruijn graph (BDG) is a realizable alternative to the hypercube. An extension of the BDG by the edge set union with a torus is shown-union-graph (UG). This achieves graph capabilities/versatility comparable to the product shuffle (PS) graph and the hypercube within a fixed degree graph. The UG improves upon both in implementing pipelined and multi-phase algorithms. More importantly, the purpose being to design an algorithmically specialized interconnect, with the algorithmic features of a wide range of algorithms as well as direct architectural support for them, instead of simple providing for a set of graph embeddings in the interconnect. A set of examples demonstrate the UG's versatility in this aspect of algorithmic support.< >

关键词： Hypercubes Tree graphs Algorithm design and analysis Very large scale integration Costs Focusing Concurrent computing Finite element methods image analysis image processing

来源：评论

学校读者我要写书评

暂无评论

A Neural Controller for Mobile Robots

引用

IFAC Proceedings Volumes 1991年第9期24卷 271-275页

作者： M.B. Zaremba E. Porada Département d’informatique Université du Québec à Hull PQ Canada J8X 3X7

A neural controller for visually guided navigation of a mobile robot in the presence of dynamic obstacles and a vector field of attraction forces is presented. Discrete information, obtained from a raster-type sensor, is subjected to parallel distributed processing aiming at real-time detection of geometrical properties of visual representations of the obstacles. A characteristic feature of the neural architecture adopted here is processing of the input data by a hidden layer of dipole units. This novel approach allows the controller to perform the operations of edge detection and recognition of geometrical features within the controller’s structure rather than using visual data pre-processed by classical convolution-based methods. Dipole processing combined with the ability of our network to learn arbitrary associations very rapidly by self-programming permits the processing of large amounts of input data without compromising the efficiency of the learning phase. The capability of the network to extract and process some geometrical characteristics of the environment works for both local (limited by a field of view window) and global navigation. The behavior of the robot in the vicinity of obstacles can be tuned and modified by changing the number of recursively generated obstacle hulls, the size of the window, and the weights of the force components intervening in the control.

关键词： Neural nets robotics navigation control image processing intelligent machines modeling

来源：评论

学校读者我要写书评

暂无评论

A METHOD FOR PERFORMANCE PREDICTION OF parallel PROGRAMS

引用

JOINT INTERNATIONAL CONF ON VECTOR AND parallel processing ( CONPAR 90 - VAPP iv )

作者： SOTZ, F University of Erlangen-Nürnberg IMMD VII Martensstraße 3 Erlangen D-8520 Germany

ISBN: (纸本)3540530657

In general there are many possibilities to parallelize an algorithm and to distribute the tasks to the processors. In some cases the selection of a processor configuration depends on the given problem, too. To decide which implementation for any configuration may be the best, the programmer can use methods of performance evaluation and prediction. If the structure of the parallel program can be modeled by a seriesparallel graph we know a method to obtain the runtime of the total program. This paper deals with the more difficult problem of predicting the runtimes of non-seriesparallel structured programs. It is shown how to compute approximately the average runtime of a program which consists of tasks with deterministically and/or exponentially distributed runtime variables. The method is based on the well known transient state space analysis. © Springer-Verlag Berlin Heidelberg 1990.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

A parallel distributed algorithm for feature extraction and disparity analysis of computer images 2

A parallel distributed algorithm for feature extraction and ...

引用

2nd IEEE Symposium on parallel and distributed processing, SPDP 1990

作者： Mousavi, M.S. Schalkoff, R.J. AT and T Bell Laboratories MiddletownNJ07748 United States Department of Electrical and Computer Engineering Clemson University ClemsonSC29631 United States

ISBN: (纸本)0818620870

A parallel distributed processing method for extracting features in stereo images is presented. The algorithm is edge-based and employs the epipolar constraint. First edges are detected in a multilayered network using two methods of locating the magnitude of directional first derivatives and the zero-crossing of second derivatives of smoothed images. The combined edge detection process helps to eliminate 'phantom' edges. Then features that are likely to be detectable in both images are selected. These features are edge intervals and edge orientation, that is, the intersection of image edges with the epipolar line and the corresponding slope of the edges at those points. The feature extraction process is implemented in a two-layered parallel distributed processing model. The first layer provides edge interval representations. The second layer computes a similarity of measure for each pair of primitive matches which are then forwarded to the second stage of the algorithm. The purpose of the second stage is to turn the difficult pixel correspondence problem into a constraint satisfaction problem by imposing relational constraints. This constraint satisfaction is then solved using a neural network. The results of computer simulations are presented to demonstrate the effectiveness of the approach. © 1990 IEEE.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

A PERFORMANCE ANALYSIS OF NETWORK TOPOLOGIES IN FINDING THE ROOTS OF A POLYNOMIAL

引用

JOINT INTERNATIONAL CONF ON VECTOR AND parallel processing ( CONPAR 90 - VAPP iv )

作者： COSNARD, M FRAIGNIAUD, P Laboratoire de l'informatique du Parallélisme – IMAG ENS Lyon 46 Allée d'Italie Lyon Cedex 07 69364 France

ISBN: (纸本)3540530657

This paper introduces the parallelization on a distributed memory multicomputer of two iterative methods for finding all the roots of a given polynomial. The parallel algorithms share the computation of the roots among the processors and perform a total exchange of the data at each step. Since the amount of communications is the main drawback of this approach, we study the effect of the network topology on the performance of the algorithms. Particularly, we show that among the different classical processors networks topologies (ring, 2d-torus or n-cube), the hypercube topology minimizes the communications. For each topology is computed the optimal number of processors. Experiments on the hypercube FPS T40 illustrate the results. © Springer-Verlag Berlin Heidelberg 1990.

关键词： Broadcasting Local memory parallel computers parallel algorithms Polynomial zeros Simultaneous polynomial root-finders

来源：评论

学校读者我要写书评

暂无评论

PROTOTYPE OF image COMPRESSION SYSTEM FOR MEDICAL imageS

PROTOTYPE OF IMAGE COMPRESSION SYSTEM FOR MEDICAL IMAGES

引用

CONF ON MEDICAL IMAGING 4 : PACS SYSTEM DESIGN AND EVALUATION

作者： NAKAGAWA, Y YOSHITAKE, T OHTA, Y GOTOH, T YOSHIDA, M Fujitsu Labs. Ltd. (Japan)

ISBN: (纸本)0819402788

We previously developed an image reconstruction display for reconstructing images compressed by our hybrid compression algorithm. The hybrid algorithm, which improves image quality, applies Discrete Cosine Transform coding (DCT) and Block Truncation Coding (BTC) adaptively to an image, according to its local properties. This reconstruction display receives the compressed data from the host computer through a BMC channel and quickly reconstructs good quality images using a pipeline-based microprocessor. This paper describes a prototype of a system for compression and reconstruction of medical images. It also describes the architecture of the image compression processor, one of the components of the system. This system consists of the image compression processor, a host main-frame computer and reconstruction displays. Under this system, distributed processing in the image compression processor and the image reconstruction displays reduces the load on the host computer, and supplies an environment where the control routines for PACS and the hospital information system (HIS) can co-operate. The compression processor consists of a maximum of four parallel compression units with communication ports. In this architecture, the hybrid algorithm, which includes serial operations, can be processed at high speed by communicating the internal data. In experiments, the compression system proved effective: the compression processor compressed a 1k x 1k image in about 2 seconds using four compression units. The three reconstruction displays showed the image at almost the same time. Display took less than 7 seconds for the compressed image, compared with 28 seconds for the original image.

关键词： image compression image processing Medical imaging Computing systems Reconstruction algorithms Digital signal processing image quality image restoration Picture Archiving and Communication System Imaging systems

来源：评论

学校读者我要写书评

暂无评论

parallel algorithms for determining k-width- connectivity in binary images 2

Parallel algorithms for determining k-width- connectivity in...

引用

2nd IEEE Symposium on parallel and distributed processing, SPDP 1990

作者： Dehnc, Frank Hambrusch, Susanne E. School of Computer Science Carleton University OttawaK1S 5B6 Canada Department of Computer Sciences Purdue University West LafayetteIN47907 United States

ISBN: (纸本)0818620870

In this paper we consider a new form of connectivity in binary images, called k-width-connectivity. Two pixels a and 6 of value are in the same k-width- component if and only if there exists a path of width k such that a is one of the k start pixels and b is one of the k end pixels of this path. We present characterizations of the k-width-components and show how to determine the k-width-components of an n x n image in O(n) and 0(log2 n) time on a mesh of processors and hypercube, respectively, when the image is stored with one pixel per processor. Our methods use a reduction of the k-width-connectivity problem to the 1-width-connectivity problem. A distributed, space-efficient encoding of the k-width-components of small size allows us represent the solution using O(l) registers per processor. Our hypercube algorithm also implies an algorithm for the shuffle-exchange network. © 1990 IEEE.

关键词： Pixels

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：