Skip to main content
SpringerLink
Log in

Fast Computation of Variant Templates for Parallel Image Processing

  • Published:
Journal of Mathematical Imaging and Vision Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. G. Arfken, Mathematical Methods for Physicists, 3rd edition, Academic Press, Inc., Orlando, 1985.

    Google Scholar 

  2. W.H. Beyer, CRC Handbook of Mathematical Sciences, 5th edition, CRC Press, Inc., FL, 1975.

    Google Scholar 

  3. W.H. Beyer, CRC Standard Mathematical Tables, 26th edition, CRC Press, FL, 1981.

    Google Scholar 

  4. T.J. Brown and D. Crookes, “A high level language for image processing,” Image and Vision Computing, Vol. 12, No. 2, pp. 67–79, 1994.

    Google Scholar 

  5. A.N. Choudhary and J.H. Patel, Parallel Architectures and Parallel Algorithms for Integrated Vision Systems, Kluwer Academic Publishers, 1990.

  6. P.C. Coffield and M.B. Scudiere, “A prototype coprocessor for image algebra operations,” Proc. SPIE, Vol. 2030, pp. 327–333, 1993.

    Google Scholar 

  7. R.E. Crandall, Topics in Advanced Scientific Computation, Springer Telos, 1996.

  8. D. Crookes, T.J. Brown, Y. Dong, G. McAleese, P.J. Morrow, D.K. Roantree, and I.T.A. Spence, “A self-optimising coprocessor model for portable parallel image processing,” Lecture Notes in Computer Science, Vol. 1124, Springer Verlag, 1996, pp. 213–216.

    Google Scholar 

  9. D. Crookes, P.J. Morrow, and P.J. McParland, “IAL: A parallel image processing programming language,” IEE Proceedings, Part I, Vol. 137, No. 3, pp. 176–182, 1990.

    Google Scholar 

  10. D. Crookes, I.T.A. Spence, and T.J. Brown, “Efficient parallel image transforms: A very high level approach,” in Transputer Applications and Systems, Proc. 1995 World Transputer Congress, IOS Press, Sept. 1995, pp. 135–143.

  11. M.E.C. Hull, D. Crookes, and P.J. Sweeney, (Eds.), Parallel Processing: The Transputer and its applications, Addison-Wesley, 1994.

  12. D. Li, “Recursive operations in image algebra,” J. Math. Ima. & Vision, Vol. 1, pp. 23–42, 1992.

    Google Scholar 

  13. P. Morrow, D. Crookes, J. Brown, Y. Dong, G. McAleese, D. Roantree, and I. Spence, “Achieving scalability, portability and efficiency in a high-level programming model for parallel architectures,” in Proc. UK PAR'96, Springer-Verlag, ISBN 0302-9743, 1996, pp. 29–39.

  14. W.K. Pratt, Digital Image Processing, 2nd edition, John Wiley & Sons: NY, 1991.

    Google Scholar 

  15. G.X. Ritter et al., “Image algebra: Anoverview,” CVGIP, Vol.49 pp. 297-331, 1990.

    Google Scholar 

  16. H. Shi, “Two image-template operations for binary image processing,” Journal of Mathematical Imaging and Vision, Vol. 7, No. 3, pp. 269–274, 1997.

    Google Scholar 

  17. H. Shi and G.X. Ritter, “A special class of nonlocal imagetemplate operations,” Proc. SPIEVol. 2300, pp. 204–212, 1994.

    Google Scholar 

  18. H. Shi, G.X. Ritter, and J.N. Wilson, “An efficient algorithm for image-template product on SIMD mesh connected computers,” in Proc. '93 Interna. Conf. on Application-Specific Array Processors, Venice, Italy, Oct. 1993.

  19. P. Sussner and G.X. Ritter, “Rank-based decompositions of morphological templates,” IEEE Trans. Image Processing, Vol. 9, No. 8, pp. 1420–1430, 2000.

    Google Scholar 

  20. J.N.Wilson, G.R. Fischer, and G.X. Ritter, “Implementation and use of an image processing algebra for programming massively parallel computers,” in Frontiers '88: The Second Symp. on the Frontiers of Massively Parallel Computation, Fairfax, VA, 1988, pp. 587–594.

    Google Scholar 

  21. J.N. Wilson and R.H. Forsman, “Using templates and neighborhoods: Practical considerations and formal observations,” in Proc. SPIE, Vol. 2300, 1994, pp. 192–203.

    Google Scholar 

  22. A.Y. Zomaya (Ed.), Parallel Computing: Paradigms and Applications, International Thomson Computer Press, 1996.

Download references

Author information

Authors and Affiliations

  1. 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

    Yuning Dong

Authors
  1. Yuning Dong
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Dong, Y. Fast Computation of Variant Templates for Parallel Image Processing. Journal of Mathematical Imaging and Vision 20, 223–235 (2004). https://doi.org/10.1023/B:JMIV.0000024040.65198.04

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:JMIV.0000024040.65198.04

Search

Navigation