Recursive cellular networks for inverse problems

Ramakrishnan Sundaram

doi:10.1117/12.409208

17 November 2000 Recursive cellular networks for inverse problems

Ramakrishnan Sundaram

Proceedings Volume 4109, Critical Technologies for the Future of Computing; (2000) https://doi.org/10.1117/12.409208
Event: International Symposium on Optical Science and Technology, 2000, San Diego, CA, United States

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.

Citation Download Citation

Ramakrishnan Sundaram "Recursive cellular networks for inverse problems", Proc. SPIE 4109, Critical Technologies for the Future of Computing, (17 November 2000); https://doi.org/10.1117/12.409208

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available