Project 3 – Computer Vision – Stereo Depth Estimation

Project 3 – Computer Vision – Stereo Depth Estimation

This is a class project for CSCI 4527/6527 Computer Vision at George Washington University.

1. Overview

In this project, we explore stereo vision. Stereo vision, is an important module of computer vision. All kinds of objects that human beings can see in the world benefit from our visual system. Well, we want robots to be able to distinguish objects just like humans, and the same need to give robots eyes. We certainly have this kind of experience. When we see an object, we can actually estimate whether the object is closer or farther from us. Then we need to give the robot more than just a system that can recognize objects but can able to judge how far the object is. The function of the stereo vision system can meet the requirements very well.

2. How It Works

2.1 The principle of stereo vision

In general, stereo vision systems require two (or more than two) camera support. It is just like human eyes. In a stereo system. If we can find the corresponding point in the same image taken by the left and right cameras, we can use the triangulation method to find the depth.

Figure 1. stereo vision systems of the three-dimensional system

It can be clearly seen from the figure 1 that in the three-dimensional system, the imaging of P and Q on the target plane T is not located at the same point but has its own imaging point, that is, q' and p'.
When we have Reference and Target, how should we solve the correspondence between the reference plane and the target plane? At this time, the polar constraints are needed. The polar constraints mean that once we know the polar geometry of the stereo vision system, like figure 2 shows, the two-dimensional search of the matching features between the two images is turned into a one-dimensional search along the polar lines. Once we know the search area of the corresponding point, we can reduce it from 2D to 1D, so that a more convenient stereoscopic vision is formed. In our case, the positions of the left and right figures are parallel, and our focus is on how to calculate the depth information of the object. This is the most important and most critical place. The calculation principle under the standard stereo vision system is given below.

Figure 2. stereo vision systems of the rectified system

In figure 3, we assume that P is a point in space, OR is the optical center of the left camera, OT is the optical center of the right camera, the focal length of the camera is f (distance from the optical center to the imaging plane), and the imaging plane is represented by a pink line in the figure. B denotes the distance between the two cameras' optical centres, also called the baseline. The imaging points of P in the imaging planes of the two left and right cameras are p and p' respectively. xR and xT are the horizontal distances of the imaging points. Z is We need depth of requirements.

Figure 3. stereo vision systems of the disparity model

According to triangle similarity theorem:


D is what we usually call disparity.

In image processing, we usually use grey value to represent the disparity, the greater the disparity, the grey value is, the greater the expressed in the disparity image visual effect is the brighter the image, the further the object from us, the smaller the parallax, grey value is smaller, the disparity images will be dark. Because what we have to do is to input the rectified image, what we need to do is stereo matching, and then the depth is calculated to get the depth map.

2.1 stereo matching and the depth map

In the algorithm of image matching, local matching algorithm is selected.

2.2.1 Matching Cost Computation

For each pixel, within a given range of parallax d, we find:


we can think this is the minimum means this is the right match points, and the minimum value of d is the disparity we are looking for.

2.2.2 Cost Aggregation

However, the final disparity is not good, and the matching between points is easily affected by the noise. So we need to set up a window around the point to make a comparison between the pixel block and the pixel block. The basic principle is to select a sub window in the neighborhood of the pixel, given a point on an image. In a region of another image, based on some similarity, find the subgraph which is most similar to the sub-window image. The corresponding pixel point in the matching subgraph is the matching point of the pixel. About Gray-scale Image Matching Algorithm, here we choose Mean Absolute Differences (Abbreviated MAD algorithm).

The advantage is:

1. Simple and easy to understand.

2. The operation process is simple and the matching accuracy is high.

Suppose we have a 3 x 3 window, a first look at the original left image pixels of aggregation. similarly to the right of the image, need to do in disparity scope aggregation. Then, the next step is to calculate the cost of matching the pixels to be processed, and find the minimum cost of them:


The final formula is a function of disparity d.

The widow size I have test are 5 x 5 and 9 x 9. Effects of sliding windows of different sizes on the calculation result of depth maps:

Small size window: higher accuracy and more detail; but especially sensitive to noise

Large-size windows: Inaccurate and incomplete details; but robust to noise.

Figure 4. 5 x 5 window size.
Figure 5. 9 x 9 window size

I use an rectified images as follow:


Figure 6. Rectified images from left.



Figure 7. Rectified images from right.

Figure 8. Left Disparity map for 3x3 block
Figure 9. Right Disparity map for 3x3 block
Figure 10. Left Disparity map for 9x9 block
Figure 11. Right Disparity map for 9x9 block

3. Possible Extensions

I choose to solve “One challenge is images that have large blank regions; develop some other heuristics or rules to "guess" what the best correspondence is for these large regions.”

For this problem I take this approaches

First, a global optimization theory method by dynamic programming is used to estimate the disparity, a global energy function is established, and the optimal disparity value is obtained by minimizing the global energy function. Then do the disparity refinement, use dynamic programming to perform an accurate calculation of the disparity map of the rough estimate obtained in the previous step. Following Figure 12 is the result, we can find more detail information in the blank regions.


Figure 12. The result of the global optimization method with disparity refinement

?著作權(quán)歸作者所有,轉(zhuǎn)載或內(nèi)容合作請(qǐng)聯(lián)系作者
  • 序言:七十年代末摔敛,一起剝皮案震驚了整個(gè)濱河市薛躬,隨后出現(xiàn)的幾起案子,更是在濱河造成了極大的恐慌惠爽,老刑警劉巖形用,帶你破解...
    沈念sama閱讀 210,914評(píng)論 6 490
  • 序言:濱河連續(xù)發(fā)生了三起死亡事件瑟押,死亡現(xiàn)場(chǎng)離奇詭異彪薛,居然都是意外死亡寂呛,警方通過(guò)查閱死者的電腦和手機(jī),發(fā)現(xiàn)死者居然都...
    沈念sama閱讀 89,935評(píng)論 2 383
  • 文/潘曉璐 我一進(jìn)店門伦籍,熙熙樓的掌柜王于貴愁眉苦臉地迎上來(lái)荣赶,“玉大人,你說(shuō)我怎么就攤上這事鸽斟。” “怎么了利诺?”我有些...
    開(kāi)封第一講書(shū)人閱讀 156,531評(píng)論 0 345
  • 文/不壞的土叔 我叫張陵富蓄,是天一觀的道長(zhǎng)。 經(jīng)常有香客問(wèn)我慢逾,道長(zhǎng)立倍,這世上最難降的妖魔是什么? 我笑而不...
    開(kāi)封第一講書(shū)人閱讀 56,309評(píng)論 1 282
  • 正文 為了忘掉前任侣滩,我火速辦了婚禮口注,結(jié)果婚禮上,老公的妹妹穿的比我還像新娘君珠。我一直安慰自己寝志,他們只是感情好,可當(dāng)我...
    茶點(diǎn)故事閱讀 65,381評(píng)論 5 384
  • 文/花漫 我一把揭開(kāi)白布。 她就那樣靜靜地躺著材部,像睡著了一般毫缆。 火紅的嫁衣襯著肌膚如雪。 梳的紋絲不亂的頭發(fā)上乐导,一...
    開(kāi)封第一講書(shū)人閱讀 49,730評(píng)論 1 289
  • 那天苦丁,我揣著相機(jī)與錄音,去河邊找鬼物臂。 笑死旺拉,一個(gè)胖子當(dāng)著我的面吹牛,可吹牛的內(nèi)容都是我干的棵磷。 我是一名探鬼主播蛾狗,決...
    沈念sama閱讀 38,882評(píng)論 3 404
  • 文/蒼蘭香墨 我猛地睜開(kāi)眼,長(zhǎng)吁一口氣:“原來(lái)是場(chǎng)噩夢(mèng)啊……” “哼泽本!你這毒婦竟也來(lái)了淘太?” 一聲冷哼從身側(cè)響起,我...
    開(kāi)封第一講書(shū)人閱讀 37,643評(píng)論 0 266
  • 序言:老撾萬(wàn)榮一對(duì)情侶失蹤规丽,失蹤者是張志新(化名)和其女友劉穎蒲牧,沒(méi)想到半個(gè)月后,有當(dāng)?shù)厝嗽跇?shù)林里發(fā)現(xiàn)了一具尸體赌莺,經(jīng)...
    沈念sama閱讀 44,095評(píng)論 1 303
  • 正文 獨(dú)居荒郊野嶺守林人離奇死亡冰抢,尸身上長(zhǎng)有42處帶血的膿包…… 初始之章·張勛 以下內(nèi)容為張勛視角 年9月15日...
    茶點(diǎn)故事閱讀 36,448評(píng)論 2 325
  • 正文 我和宋清朗相戀三年,在試婚紗的時(shí)候發(fā)現(xiàn)自己被綠了艘狭。 大學(xué)時(shí)的朋友給我發(fā)了我未婚夫和他白月光在一起吃飯的照片挎扰。...
    茶點(diǎn)故事閱讀 38,566評(píng)論 1 339
  • 序言:一個(gè)原本活蹦亂跳的男人離奇死亡,死狀恐怖巢音,靈堂內(nèi)的尸體忽然破棺而出遵倦,到底是詐尸還是另有隱情,我是刑警寧澤官撼,帶...
    沈念sama閱讀 34,253評(píng)論 4 328
  • 正文 年R本政府宣布梧躺,位于F島的核電站,受9級(jí)特大地震影響傲绣,放射性物質(zhì)發(fā)生泄漏掠哥。R本人自食惡果不足惜,卻給世界環(huán)境...
    茶點(diǎn)故事閱讀 39,829評(píng)論 3 312
  • 文/蒙蒙 一秃诵、第九天 我趴在偏房一處隱蔽的房頂上張望续搀。 院中可真熱鬧,春花似錦菠净、人聲如沸禁舷。這莊子的主人今日做“春日...
    開(kāi)封第一講書(shū)人閱讀 30,715評(píng)論 0 21
  • 文/蒼蘭香墨 我抬頭看了看天上的太陽(yáng)榛了。三九已至在讶,卻和暖如春,著一層夾襖步出監(jiān)牢的瞬間霜大,已是汗流浹背构哺。 一陣腳步聲響...
    開(kāi)封第一講書(shū)人閱讀 31,945評(píng)論 1 264
  • 我被黑心中介騙來(lái)泰國(guó)打工, 沒(méi)想到剛下飛機(jī)就差點(diǎn)兒被人妖公主榨干…… 1. 我叫王不留战坤,地道東北人曙强。 一個(gè)月前我還...
    沈念sama閱讀 46,248評(píng)論 2 360
  • 正文 我出身青樓,卻偏偏與公主長(zhǎng)得像途茫,于是被迫代替她去往敵國(guó)和親碟嘴。 傳聞我的和親對(duì)象是個(gè)殘疾皇子,可洞房花燭夜當(dāng)晚...
    茶點(diǎn)故事閱讀 43,440評(píng)論 2 348

推薦閱讀更多精彩內(nèi)容