Paper
21 March 1989 Collective Networks For Linear Interpolation
Fred B. Holt, David I. Feinstein
Author Affiliations +
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.
© (1989) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Fred B. Holt and David I. Feinstein "Collective Networks For Linear Interpolation", Proc. SPIE 1095, Applications of Artificial Intelligence VII, (21 March 1989); https://doi.org/10.1117/12.969333
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Geodesy

Artificial intelligence

Digital electronics

Electronics

Ranging

Silicon

RELATED CONTENT

Large-area CMOS SPADs with very low dark counting rate
Proceedings of SPIE (February 04 2013)
MIRAGE large format emitter arrays 1024 x 1024 and...
Proceedings of SPIE (July 12 2000)
An Affordable 128 X 128 InSb Hybrid Focal Plane Array
Proceedings of SPIE (January 08 1990)
Development of arrays of TES x-ray detectors
Proceedings of SPIE (December 13 2000)

Back to Top