运用可变模板进行并行图像处理的一种快速算法.pdfVIP

26 3 Vol. 26 No. 3 2003 3 CHINESE JOURNAL OF COMPUTERS Mar . 2003 董育宁 ( 210003) ( ) . , . , . . , . ; ; TP391 An Efficient Algorithm for Parallel Image Processing with Variant Templates DONG YuNing ( Department of Inf ormationEngineering, Nanjing University of Posts and Telecommunications, Nanjing 210003) Abstract A fast algorithm for parallel image processing with variant templates is presented in this paper. This algorithm is based on a key observation that we have a priori knowledge of the changing patterns of the ar guments i, j and k, and can take full advantage of this. It is shown that the pointwise updating of the variant templates can be greatly simplified by use of an optimized algorithm for evaluating polynomials at the image grid points. While the efficient computation of polynomials plays a central role in this approach, the technique is extended to include transcendental functions with the help of the Taylor expansion. Examples of typical tran scendental functions show that reasonably high precision, for common low level image processing applications, and efficiency, using only very few initial terms of the Taylor series, can be achieved, when the series form of the function is used for executing the variant template operations. The influence of hardware and the limitations of the proposed algorithm are discussed at the end of the paper. Keywords image processing abstractions; variant templates; fast computation