-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathstereo2_DP.py
More file actions
76 lines (59 loc) · 2.51 KB
/
stereo2_DP.py
File metadata and controls
76 lines (59 loc) · 2.51 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
# Stereo Matching using Dynamic Programming
# Computes a disparity map from a rectified stereo pair using Dynamic Programming
import time
import numpy as np
import cv2 as cv
import matplotlib.pyplot as plt
# Set parameters
dispLevels = 16 #disparity range: 0 to dispLevels-1
lambda_ = 5 #weight of smoothness cost
trunc = 4 #truncation of smoothness cost
# Define matching cost function
computeMatchingCost = lambda left,right: np.absolute(left-right) #absolute differences
# Define smoothness cost function
computeSmoothnessCost = lambda d1,d2: lambda_*np.minimum(np.absolute(d1-d2),trunc)
# Load left and right images in grayscale
leftImg = cv.imread("left.png",cv.IMREAD_GRAYSCALE)
rightImg = cv.imread("right.png",cv.IMREAD_GRAYSCALE)
# Apply a Gaussian filter
leftImg = cv.GaussianBlur(leftImg,(5,5),0.6)
rightImg = cv.GaussianBlur(rightImg,(5,5),0.6)
# Get the size
(rows,cols) = leftImg.shape
# Convert to int32
leftImg = leftImg.astype(np.int32)
rightImg = rightImg.astype(np.int32)
# Compute pixel-based matching costs
matchingCosts = np.zeros((rows,cols,dispLevels),dtype=np.int32)
for d in range(dispLevels):
rightImgShifted = np.roll(rightImg,d,1)
matchingCosts[:,:,d] = computeMatchingCost(leftImg,rightImgShifted)
# Compute smoothness costs
d = np.arange(dispLevels)
smoothnessCosts = computeSmoothnessCost(d,d[np.newaxis,:].T)
smoothnessCosts3H = smoothnessCosts[np.newaxis,:,:].astype(np.int32)
# Initialize minimum cost paths and transitions for the left to right direction
fromLeft = np.zeros((rows,cols,dispLevels),dtype=np.int32)
transitions = np.zeros((rows,cols,dispLevels),dtype=np.int32)
# Compute minimum cost paths and transitions for left to right direction
for x in range(cols-1):
sumCosts = (matchingCosts[:,x,:] + fromLeft[:,x,:])[:,np.newaxis,:] + smoothnessCosts3H
minSumCosts = np.amin(sumCosts,axis=2)
fromLeft[:,x+1,:] = minSumCosts
transitions[:,x+1,:] = np.argmin(sumCosts,axis=2)
# Compute the disparity map - Backtracking
dispMap = np.zeros((rows,cols))
ind = np.argmin(fromLeft[:,cols-1,:],axis=1)
for x in range(cols-1,-1,-1):
dispMap[:,x] = ind
ind = transitions[np.arange(rows),x,ind] #get the disparity transitions
# Normalize the disparity map for display
scaleFactor = 256/dispLevels
dispImg = (dispMap*scaleFactor).astype(np.uint8)
# Show disparity map
plt.imshow(dispImg,cmap="gray")
plt.show(block=False)
plt.pause(0.01)
# Save disparity map
cv.imwrite("disparity2_DP.png",dispImg)
plt.show()