doi abstract bibtex

In this paper 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: i) sequential updates, ii) n-simultaneous updates, and iii) partially asynchronous updates. The sequential algorithm is shown to converge to a local minimum of the energy function after a finite number of iterations. This local minimum is defined in terms of a unit distance neighborhood in the discrete intensity value space. 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 11 norm of the residual at a fixed point is bounded. It is also shown that the upper bound on the 11 norm of the residual can be made arbitrarily small by using an appropriate step size. Finally, 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. It is shown that the /1 norm of the residual at the fixed point of this algorithm increases as the upper bound on the delay increases. Experimental results are shown testing and comparing the proposed algorithms. © 1992 IEEE

@article{ title = {Image Restoration Using a Modified Hopfield Network}, type = {article}, year = {1992}, pages = {49-63}, volume = {1}, publisher = {IEEE}, id = {6fe40fb2-cc40-321c-b534-14a40c397a51}, created = {2023-02-26T01:15:05.163Z}, file_attached = {false}, profile_id = {5f6ed621-5f14-3d88-8517-f63e186d1afc}, group_id = {09c00d87-e816-323b-b005-1b73877c8545}, last_modified = {2023-02-27T22:15:48.657Z}, read = {true}, starred = {false}, authored = {false}, confirmed = {true}, hidden = {false}, citation_key = {paik1992image}, source_type = {article}, private_publication = {false}, abstract = {In this paper 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: i) sequential updates, ii) n-simultaneous updates, and iii) partially asynchronous updates. The sequential algorithm is shown to converge to a local minimum of the energy function after a finite number of iterations. This local minimum is defined in terms of a unit distance neighborhood in the discrete intensity value space. 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 1<inf>1</inf> norm of the residual at a fixed point is bounded. It is also shown that the upper bound on the 1<inf>1</inf> norm of the residual can be made arbitrarily small by using an appropriate step size. Finally, 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. It is shown that the /<inf>1</inf> norm of the residual at the fixed point of this algorithm increases as the upper bound on the delay increases. Experimental results are shown testing and comparing the proposed algorithms. © 1992 IEEE}, bibtype = {article}, author = {Katsaggelos, Aggelos K.}, doi = {10.1109/83.128030}, journal = {IEEE Transactions on Image Processing}, number = {1} }

Downloads: 0