A Simple Stereo Matching Algorithm using PBIL and its Alternative


The KIPS Transactions:PartB , Vol. 12, No. 4, pp. 429-436, Aug. 2005
10.3745/KIPSTB.2005.12.4.429,   PDF Download:

Abstract

A simple stereo matching algorithm using population-based incremental learning(PBIL) is proposed in this paper to decrease the general abilities, is preserved. As a result, memory space is decreased, matching rules are simplified, andcomputation cost is reduced. In addition, a scheme controlling the distance of neighbors for disparity smoothness is inserted to obtain a wide-area consistency of disparities, like a result of coarse-to-fine matchers. Because of this scheme, the proposed algorithm can produce a stable disparity map with a small fixed-size window. Finally, an alternative version of the proposed algorithm without using probability vector is also presented for simpler set-ups.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
K. P. Han, "A Simple Stereo Matching Algorithm using PBIL and its Alternative," The KIPS Transactions:PartB , vol. 12, no. 4, pp. 429-436, 2005. DOI: 10.3745/KIPSTB.2005.12.4.429.

[ACM Style]
Kyu Phil Han. 2005. A Simple Stereo Matching Algorithm using PBIL and its Alternative. The KIPS Transactions:PartB , 12, 4, (2005), 429-436. DOI: 10.3745/KIPSTB.2005.12.4.429.