Performance analysis of cooperative hopfield networks for stereo matching

2Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper proposes a dense stereo matching algorithm based on cooperative Hopfield networks. It uses two Hopfield networks with similar structure to solve energy minimization problem of stereo matching in parallel. Two strategies are applied to the performance analysis. One strategy considers each pixel as a neuron. The other is the Coarse-to-Fine strategy, which firstly divides the images into non-overlapping homogeneous regions, and each region is represented as super-pixel of the coarse images. After coarse estimation, a more refined estimation is implemented in pixel domain. Experiments indicate the method with the Coarse-to-Fine strategy has better performance and more rapid convergence speed, and less insensitive to initial conditions of the neural networks and the neuron update orders. © Springer-Verlag Berlin Heidelberg 2007.

Cite

CITATION STYLE

APA

Zhou, W., Xiang, Z., & Gu, W. (2007). Performance analysis of cooperative hopfield networks for stereo matching. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4456 LNAI, pp. 983–990). Springer Verlag. https://doi.org/10.1007/978-3-540-74377-4_103

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free