Share Email Print
cover

Proceedings Paper

Chaining and extension mechanism for image processing software
Author(s): David R. Cok; Ronald S. Cok
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

A common image processing hardware configuration consists of fast, special-purpose hardware attached to a general-purpose computer. The special-purpose hardware performs the computationally-intensive processing. This works well for algorithms that have been hand- coded for the special hardware, and in situations where a complete compiler for the attached processor is available. However, the development of new algorithms requires composition of the basic, hand-coded operators and this suffers from problems of inefficiency in both memory usage and loop overhead. Chaining mechanisms allow the delayed execution of operations, with the potential for optimizing combinations of operations to reduce this inefficiency. Modern programming languages, such as C++, allow attractive implementations of chaining as the programming interface can be natural and intuitive with little syntactical overhead for the chaining constructs. The paper will discuss the philosophy and implementation of chaining and a method for building optimized, chained image processing constructs without a special-purpose language parser or compiler.

Paper Details

Date Published: 30 April 1992
PDF: 12 pages
Proc. SPIE 1659, Image Processing and Interchange: Implementation and Systems, (30 April 1992); doi: 10.1117/12.58407
Show Author Affiliations
David R. Cok, Eastman Kodak Co. (United States)
Ronald S. Cok, Eastman Kodak Co. (United States)


Published in SPIE Proceedings Vol. 1659:
Image Processing and Interchange: Implementation and Systems
Ronald B. Arps; William K. Pratt, Editor(s)

© SPIE. Terms of Use
Back to Top