Fast Computation of Variant Templates for Parallel Image Processing

  • Authors:
  • Yuning Dong

  • Affiliations:
  • Department of Information Engineering, Nanjing University of Posts & Telecom, P.O. Box 166, 66, New mo-fan-ma-lu Road, 210003 Nanjing Jiangsu, People's Republic of China. dongyn@njupt. ...

  • Venue:
  • Journal of Mathematical Imaging and Vision
  • Year:
  • 2004

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we propose a method for efficiently computing variant templates for image processing on parallel machines. It is demonstrated that the cumbersome computation of the variant templates can greatly be relieved by the use of an optimised algorithm for evaluating polynomials at grid points. For variant templates containing non-polynomial functions, the Taylor series of the function is exploited for iterative computation purpose. The aspects of validity, accuracy and effectiveness of the series form (for implementing the variant templates) of some commonly used functions are analysed in detail. The influence of hardware, as well as the limitations of the proposed approach are also discussed.