Partitioning of Hopfield networks and its application to image restoration

Ramakrishnan Sundaram; Okan K. Ersoy

doi:10.1117/1.600803

1 August 1996 Partitioning of Hopfield networks and its application to image restoration

Optical Engineering, Vol. 35, Issue 8, (August 1996). https://doi.org/10.1117/1.600803

Partitioning of Hopfield networks into submodules is important in large-scale problems for ease of implementation, say, with optical systems having limited space-bandwidth product. Two types of decomposition and their application to image restoration are discussed. In the case of two-stage partitioning, the system functions as a pair of Hopfield subnetworks that iteratively force the energy function to a minimum. The least-squares solution is attained by iteratively switching between the two networks until convergence. The algorithms are valid for any number of partitions. Partitioning also helps avoid the problem of possible limit cycles when threshold nonlinearities are used, and the problem of nonzero diagonal elements in the interconnection matrix when the partitions are implemented in parallel.

Citation Download Citation

Ramakrishnan Sundaram and Okan K. Ersoy "Partitioning of Hopfield networks and its application to image restoration," Optical Engineering 35(8), (1 August 1996). https://doi.org/10.1117/1.600803

Published: 1 August 1996

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