Image restoration using a modified Hopfield network

  • Authors:
  • J. K. Paik;A. K. Katsaggelos

  • Affiliations:
  • Dept. of Electr. Eng. & Comput. Sci., Northwestern Univ., Evanston, IL;-

  • Venue:
  • IEEE Transactions on Image Processing
  • Year:
  • 1992

Quantified Score

Hi-index 0.02

Visualization

Abstract

A modified Hopfield neural network model for regularized image restoration is presented. The proposed network allows negative autoconnections for each neuron. A set of algorithms using the proposed neural network model is presented, with various updating modes: sequential updates; n-simultaneous updates; and partially asynchronous updates. The sequential algorithm is shown to converge to a local minimum of the energy function after a finite number of iterations. Since an algorithm which updates all n neurons simultaneously is not guaranteed to converge, a modified algorithm is presented, which is called a greedy algorithm. Although the greedy algorithm is not guaranteed to converge to a local minimum, the l 1 norm of the residual at a fixed point is bounded. A partially asynchronous algorithm is presented, which allows a neuron to have a bounded time delay to communicate with other neurons. Such an algorithm can eliminate the synchronization overhead of synchronous algorithms