基于蟻群優(yōu)化算法的立體匹配

立體匹配技術(shù)使得通過像點(diǎn)獲取景物的距離信息，實(shí)現(xiàn)三維立體再現(xiàn)成為可能，是計(jì)
算機(jī)視覺研究中最基本的關(guān)鍵問題之一。本文選擇圖像的邊緣點(diǎn)作為匹配基元，以邊緣特征點(diǎn)處的灰度值、梯度的大小和方向、拉普拉斯值作為其屬性值，依據(jù)立體匹配的約束條件，建立能量函數(shù)。在進(jìn)行圖像的立體匹配的過程中，運(yùn)用蟻群優(yōu)化算法找尋使能量函數(shù)達(dá)到最小的路徑，從而實(shí)現(xiàn)立體匹配。實(shí)驗(yàn)證明，該方法具有較強(qiáng)的穩(wěn)定性，能得到較高精度的匹
配結(jié)果。
關(guān)鍵詞：立體匹配；能量函數(shù)；蟻群優(yōu)化算法

Abstract: Stereo matching makes it possible to reproduce a three- dimensional stereo by getting the distance information through pixels. It is one of the fundamental and significant problems in the study of the computer vision. In this paper, choosing the edges as the primitives for matching, the grey values of the edges and the magnitude and direction of the edge gradient and the Laplace values were figured out as the properties of the edge feature
points, according to the constraints for stereo matching, the energy function was built.
During the process of stereo matching, ant colony optimization algorithm was applied
to this problem for finding the route minimizing the energy function. Experiment
results show that this algorithm is more stable and it can get the matching result with
better accuracy.
Key words: Stereo matching; Energy function; Ant colony optimization algorithm