𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Relaxation by Hopfield network in stereo image matching

✍ Scribed by Gonzalo Pajares; Jesús M Cruz; Joaquın Aranda


Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
325 KB
Volume
31
Category
Article
ISSN
0031-3203

No coin nor oath required. For personal study only.

✦ Synopsis


This paper outlines a relaxation approach using the Hopfield neural network for solving the global stereovision matching problem. The primitives used are edge segments. The similarity, smoothness and uniqueness constraints are transformed into the form of an energy function whose minimum value corresponds to the best solution of the problem. We combine two methods: (a) optimization/relaxation and (b) relaxation merit with the above three constraints mapped in an energy function. The main contribution is made (1) by applying a learning strategy in the similarity constraint and ( 2) by introducing specific conditions to overcome the violation of the smoothness constraint and to avoid the serious problem arising from the required fixation of a disparity limit. So, we improve the stereovision matching process. A better performance of the proposed method is illustrated with a comparative analysis against a classical relaxation method.


📜 SIMILAR VOLUMES


Relaxation labeling in stereo image matc
✍ Gonzalo Pajares; Jesús Manuel de la Cruz; José Antonio López-Orozco 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 443 KB

This paper outlines a method for solving the global stereovision matching problem using edge segments as the primitives. A relaxation scheme is the technique commonly used by existing methods to solve this problem. These techniques generally impose the following competing constraints: similarity, sm

Matching of uncalibrated stereo images b
✍ Wan-Chiu Li; C. H. Leung; Y. S. Hung 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 629 KB

## Abstract We propose a method for uncalibrated stereo matching. The method applies gradual elastic deformation to the line segments in a pair of images until they match with each other. By using an energy function and a neighborhood function, matching is performed in a coarse‐to‐fine manner. Our

Image segmentation by relaxation using c
✍ Fatih Kurugollu; Bülent Sankur; A. Emre Harmancı 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 814 KB

The problem of image segmentation using constraint satisfaction neural networks (CSNN) has been considered. Several variations of the CSNN theme have been advanced to improve its performance or to explore new structures. These new segmentation algorithms are based on interplay of additional constrai

Broadcast scheduling in packet radio net
✍ Wei Li-Chiun; Ruay-Shiung Chang 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 363 KB

A multihop packet radio network is a packet switching network where nodes communicate by radio signals. When used in real-time multimedia or military communication networks, it is very important to broadcast a packet from a source node to all other nodes as quickly as possible. Unfortunately, the pr