Share Email Print

Proceedings Paper

Recursive cellular networks for inverse problems
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

The recursive use of thresholded binary networks of the Hopfield-type lead to the efficient retrieval of the regularized least-squares (LS) solution in certain inverse problem formulations. This strategy is especially effective when substantial data must be processed by resources which are constrained either in space or available bandwidth. Partitions of the network are identified based on forms of representation of the data. The objective criterion is optimized using sequential and parallel updates on these partitions. The algorithms consist of minimizing a suboptimal objective criterion in the currently active partition. Once the local minima is attained, an inactive partition is chosen to continue the minimization. An application to digital image restoration is considered.

Paper Details

Date Published: 17 November 2000
PDF: 11 pages
Proc. SPIE 4109, Critical Technologies for the Future of Computing, (17 November 2000); doi: 10.1117/12.409208
Show Author Affiliations
Ramakrishnan Sundaram, Information Systems, Inc. (United States)

Published in SPIE Proceedings Vol. 4109:
Critical Technologies for the Future of Computing
Sunny Bains; Leo J. Irakliotis, Editor(s)

© SPIE. Terms of Use
Back to Top