Share Email Print

Proceedings Paper

Parallel and distributed image restoration using a modified Hopfield network
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

A modified Hopfield network model for parallel and distributed image restoration is presented. The proposed network does not require the zero autoconnection assumption which is one of the major drawbacks of the original Hopfield network. A new number representation scheme is also given for implementation of the network. As a tool for the convergence analysis of parallel and distributed algorithms, the convergence of descent algorithms theorem is presented. According to this theorem, the proposed image restoration algorithm with sequential updates and decoupled parallel updates is shown to converge. The sufficient condition for convergence of n-simultaneous updates is also given. If this condition is satisfied, the algorithm with totally asynchronous updates is guaranteed to converge. When the image restoration problem does not satisfy the convergence condition, a greedy algorithm is used which guarantees convergence at the expense of image quality. The proposed algorithm with sequential updates performs identically to the algorithm using the original Hopfield network, without checking the reduction of the energy function at the update of each neuron.

Paper Details

Date Published: 1 July 1990
PDF: 10 pages
Proc. SPIE 1246, Parallel Architectures for Image Processing, (1 July 1990); doi: 10.1117/12.19589
Show Author Affiliations
Joon-Ki Paik, Northwestern Univ. (United States)
Aggelos K. Katsaggelos, Northwestern Univ. (United States)

Published in SPIE Proceedings Vol. 1246:
Parallel Architectures for Image Processing
Joydeep Ghosh; Colin G. Harrison, Editor(s)

© SPIE. Terms of Use
Back to Top