Relaxation by Hopfield network in stereo image matching

Abstract 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 [1] and (b) relaxation merit [2] 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.