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

International Conference on Information, Communications and Signal Processing

作者： J.T. O'Brien D.S. Wickramanayake E.A. Edirisinghe H.E. Bez Parallel Algorithms & Architectures Research Centre Department of Computer Science Loughborough University UK

ISBN: (纸本)0780381858

The current trends in computer animations, virtual reality and augmented reality applications have resulted in the problem of texture synthesis receiving considerable attention from the computer graphics and image processing research community. In this paper we revisit the well-known texture synthesis method, image quilting, first proposed by Efros and Freeman and propose improvements to its algorithms and implementation. Further, we outline its application within a multiresolution framework, particularly suited for modern imaging applications associated with compressed image data. We provide experimental results to prove the effectiveness of the proposed modifications and variation.

关键词： Application software Image processing Animation Virtual reality computer graphics Image generation Surface texture Stochastic processes Markov random fields Computational modeling

来源：评论

学校读者我要写书评

暂无评论

TRANSPUTER IMPLEMENTATION FOR LOW-LEVEL IMAGE PROCESSING SYSTOLIC ARRAY DESIGNS

引用

parallel algorithms and Applications 1997年第3-4期10卷 283-299页

作者： S. A. Amin[a] D. J. Evans[a] [a] Mid-Kent College Chatham and Parallel Algorithms Research Centre (PARC) Computer Studies Department Loughborough University of Technology

This paper describes transputer implementation of systolic array designs of parallel algorithms for low-level digital image processing, in particular we consider the gradient operator. To achieve high performance, a new systolic array in which all the cells in a double pipeline are interconnected to a system bus. The transputer implementation of the design, is discussed. Comments and conclusions related to the implementation of the systolic array on transputer networks are provided in the performance section. It is then shown that the systolic array design can be extended to handle the Prewitt and Sobel operators and inverse gradient filter.

关键词： Systolic array gradient filter transputer network OCCAM double pipeline image processing

来源：评论

学校读者我要写书评

暂无评论

A VLSI PROCESSOR ARRAY FOR FLEXIBLE STRING MATCHING

引用

parallel algorithms and Applications 1997年第1-2期11卷 45-60页

作者： K. G. Margaritis[a] D. J. Evans[b] [a] Department of Informatics University of Macedonia Thessaloniki Greece [b] Parallel Algorithms Research Centre Department of Computer Studies Loughborough University U.K.

This paper presents a systolic design for flexible string matching. Initially a sequential algorithm is discussed which consists of two phases, i.e. pre-processing and searching, and a matrix vector notation of the algorithm is proposed. Then, starting from the computational schedule of the searching phase a systolic algorithm is derived which can be realised directly onto a special purpose VLSI processor array architecture for string matching. Further the pre-processing phase is also accommodated onto the same VLSI design. Finally extensions to approximate pattern matching are discussed.

关键词： String matching pattern recognition systolic arrays VLSI processors

来源：评论

学校读者我要写书评

暂无评论

SYSTOLIC algorithms FOR THE SOLUTION OF TOEPLITZ MATRICES

引用

parallel algorithms and Applications 1997年第4期12卷 321-339页

作者： D. J. Evans[a] S. A. Amin[b] [a] Computer Studies Department Parallel Algorithms Research Center (PARC) Lougborough University Lougborough Leices UK [b] Informatic and Software Engineering Research Centre (ISERC) Chatham Kent UK

In this paper a factorisation of certain symmetric circulant banded linear systems proposed by Evans [Evans 1981] is described. It can be shown that a banded Toeplitz matrix can be factorised into the product of easily inverted cyclic matrices. By using this factorisation, a solution can be derived for such *** matrices have become increasingly important with the rapid growth of signal and image processing. To achieve high performance, new systolic array designs for the algorithm shown above are implemented, A full description of the systolic array designs are given in a later section. The performance of the designs are discussed.

关键词： Toeplitz circulant systolic array

来源：评论

学校读者我要写书评

暂无评论

ON INCREASING THE parallelISM IN NUMERICAL algorithms

引用

Wuhan University Journal of Natural Sciences 1996年第Z1期1卷 292-308页

作者： D.J. Evans(parallel algorithms and architectures research centre department of computer studies University of Technology Loughborough, Letes., U.K. and Institute of Software Engineering mahan University Wuhan P.R. China.) Parallel Algorithms and Architectures Research Centre Department of Computer Studies University of Technology Loughborough U.K. Institute of Software Engineering Wuhan University Wuhan P.R. China

parallel algorithms have been designed for the past 20 years initially by parallelising existing sequential algorithms for many different parallel architectures. More recently parallel strategies have been identified and utilized 'resulting in many new parallel algorithms. However the analysis of such algorithms reveals that further strategies can be applied to increase the parallelism. One of these, i.e., increasing the computational capacity in each processing node can reduce the congestion/communicgtion for shared memory/distributed memory multiprocessor systems and dramahcally improve the Performance of the algorithm. Two algorithms are identified and studied, i.e., the Cyclic reduction method for solving large tridiagonal linear systems in which the odd/even sequence is increased to a 'stride of 3' or more resulting in an improved algorithm. Similarly the Gaussian Elimination method for solving linear systems in which one element is eliminated at a time can be adapted to parallel form in which two elements are simultaneously eliminated resulting in the parallel Implicit Elimination (P.I.E.) method. Numerical results are presented to support the analyses.

关键词： Granularity cyclic and stride reduchon Gaussian and parallel Implicit Elimination methods.

来源：评论

学校读者我要写书评

暂无评论

The alternating group explicit (AGE) iterative method for variable coefficient parabolic equations

引用

INTERNATIONAL JOURNAL OF computer MATHEMATICS 1995年第1-2期59卷 107-121页

作者： Evans, DJ Sukon, KS [a] Parallel Algorithms Research Centre Department of Computer Studies University of Technology Loughborough Leics U.K

In this paper the alternating group explicit (AGE) iterative method is extended to solve the general linear variable coefficient parabolic equation in one dimension under suitable initial and boundary conditions after an appropriate transformation of the differential equation. The stability of the finite difference equations and the convergence of the AGE method is studied. The AGE methods are tested on the convection-diffusion equations in cartesian, cylindrical and spherical co-ordinates, and the results of the numerical experiments compared. The methods are explicit, accurate and flexible.

关键词： linear parabolic partial differential equation AGE method

来源：评论

学校读者我要写书评

暂无评论

parallel symmetric elimination for positive definite linear systems

引用

parallel algorithms and Applications 1995年第1期6卷 67-78页

作者： Chawla, M.M. Evans, D.J. Department of Mathematics Kuwait University Safat 13060 P.O. Box 5969 Kuwait Parallel Algorithms Research Centre Department of Computer Studies Loughborough University of Technology Loughborough Leicestershire LE11 3TU United Kingdom

As an alternative to Choleski factorisation, in 1965 Martin et al. [3] suggested a root-free symmetric decomposition for a positive definite matrix. Since around 1970, root-free form has been favoured to Choleski form. In the present paper, by introducing symmetric elimination transformations we first obtain an elimination-variant of the root-free symmetric decomposition method of Martin et al. We then extend the idea to partitioned systems. By introducing (block) symmetric elimination transformations we obtain a root-free parallel symmetric elimination algorithm for positive definite linear systems. With the given system of size N, partitioned into p² blocks, we discuss an implementation of the parallel algorithm;using p processors, which exhibits good load-balancing in view of symmetry of the updates across the partitioning blocks. The parallel algorithm has an operations count of O(N³/3p), indicating that the algorithm could achieve efficiency close to 1 if implemented on a p-processor machine. © 1995, Taylor & Francis Group, LLC. All rights reserved.

关键词： Algorithm Choleski factorization Efficiency Linear system parallel symmetric elimination Partitioning Positive definite Root-free symmetric elimination Symmetric

来源：评论

学校读者我要写书评

暂无评论

ON SYSTOLIC GENERAL SYSTEM SOLUTION FOR OPTIMAL ARTIFICIAL NEURAL-NETWORK TRAINING

引用

INTERNATIONAL JOURNAL OF computer MATHEMATICS 1994年第1-2期54卷 33-52页

作者： MARGARITIS, KG EVANS, DJ [a]Department of Computer Studies Loughborough University of Technology Parallel Algorithms Research Centre UK

This paper presents systolic algorithms for general system solution and generalised matrix inversion in the context of the optimal linear associative memory artificial neural network, and with applications to optimise... 详细信息

关键词： ARTIFICIAL NEURAL NETWORKS SYSTOLIC algorithms AND architectures GENERAL SYSTEM SOLUTION GENERALIZED MATRIX INVERSION

来源：评论

学校读者我要写书评

暂无评论

ITERATIVE MATRIX-INVERSION ON A SYSTOLIC ARRAY - A CASE OF ALGORITHM INTEGRATION

引用

INTERNATIONAL JOURNAL OF computer MATHEMATICS 1994年第1-2期51卷 95-106页

作者： MARGARITIS, KG EVANS, DJ [a]Parallel Algorithms Research Centre Department of Computer Studies Loughborough University of Technology UK

This paper describes the implementation of the Pan-Reif iterative algorithm for matrix inversion on the re-usable systolic processor array for matrix multiplication. The calculation of initial approximations, matrix norms and matrix transposition are implemented on the same processor array. Further the inversion of several special matrices is also discussed. All phases of the iterative algorithm are integrated so that they can be executed without any communication with a host system. The parallel algorithms and the systolic designs were implemented using Occam.

关键词： ITERATIVE MATRIX INVERSION SYSTOLIC ARRAY OCCAM IMPLEMENTATION

来源：评论

学校读者我要写书评

暂无评论

Solving tridiagonal linear systems by the enhanced parallel stride of three reduction method

引用

parallel algorithms and Applications 1994年第3期2卷 149-154页

作者： Evans, D.J. Yousif, W.S. Parallel Algorithms Research Centre Department of Computer Studies Loughborough University of Technology Loughborough Leicestershire LE11 3TU United Kingdom

In this paper, the parallelisation of the stride of three method for the solution of a tridiagonal system of equations for P processors is investigated. The presented algorithm is organised in such a way that all processors are fully operational at every stage of the solution process. The results of experiments carried out on the Sequent Balance 8000 multiprocessor are presented. © 1994, Taylor & Francis Group, LLC. All rights reserved.

关键词： Cyclic reduction stride of 3 reduction tridiagonal matrix

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：