Share Email Print

Proceedings Paper

Collective Networks For Linear Interpolation
Author(s): Fred B. Holt; David I. Feinstein
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

In its simplest form, linear interpolation on a discrete grid reduces to a special case of the subjective-contour problem: finding the straightest path between two boundary points of the grid. Linear interpolation using local information is hard because straight lines running counter to the grid do not appear straight locally. We present a network which performs approximate linear interpolation, using simple arithmetic elements with nearest-neighbor interconnections. The network represents the line between two boundary points as a profile of activation across the grid of elements. The activation of each element counts the number of direct grid paths from this element to the two boundary points. These counts can span an enormous range. Numerically sound, the network must compromise its performance with the limited dynamic range of real elements.

Paper Details

Date Published: 21 March 1989
PDF: 5 pages
Proc. SPIE 1095, Applications of Artificial Intelligence VII, (21 March 1989); doi: 10.1117/12.969333
Show Author Affiliations
Fred B. Holt, Boeing Electronics High Tech Center (United States)
David I. Feinstein, Boeing Electronics High Tech Center (United States)

Published in SPIE Proceedings Vol. 1095:
Applications of Artificial Intelligence VII
Mohan M. Trivedi, Editor(s)

© SPIE. Terms of Use
Back to Top