本次版本图片裁剪出错，正在找毛病
import numpy as np
import cv2 # 导入opencv模块
# 迷宫中0的地位代表墙，不能走
# 8代表入口，1代表可走地位
# 888代表出口
migong = """
0 0 0 0 0 0 0 0 0 0 0 0
0 1 0 1 1 1 1 1 1 1 1 0
0 1 1 1 1 0 1 1 1 1 0 0
0 1 1 1 1 1 1 1 1 888 1 0
0 0 1 0 0 1 1 1 1 1 1 0
0 1 1 1 1 1 1 1 1 1 1 0
0 1 0 1 1 1 1 0 0 0 1 0
0 1 1 1 1 1 1 1 1 1 1 0
0 1 1 1 1 1 1 1 1 1 1 0
0 1 8 1 1 1 1 1 1 1 1 0
0 1 1 1 1 1 1 1 1 1 1 0
0 0 0 0 0 0 0 0 0 0 0 0"""
data = np.array(migong.split(), dtype=int).reshape((12,12))#以空格为分隔符,强迫装换成int
def yanseshibie(): # 创立一个函数，函数名随便定义
#初始化变量
i=1
n=1
y0 = 0
y1 = 49
x0 = 0
x1 = 63
x3=1
y3=1
z=1
while(True):
frame = cv2.imread("/home/pi/tupian/cheku_xinban1111.jpg")
cv2.imshow("original", frame) # 输出视频每帧
frame= frame[y0:y1, x0:x1] # 裁剪坐标为[y0:y1, x0:x1]
cv2.imwrite("/home/pi/migong_tupian/"+str(z)+".jpg",frame)
if i==11 :
i=1
n=n+1
f=2
if i==1 and n!=1:
print(i)
y0 = y0+49
y1 = y1+49
x0 = 0
x1 = 63
#if i!=1:
x0 = x0+63
x1 = x1+63
# if f==2:
# x0 = x0-63
# x1 = x1-63
if z==91:
break
#print(z)
z=z+1
i=i+1#每次进入重复加1这三项加同时加
#a = frame.size
#print("像素值:",a)
# 将这一帧图象BGR转换为HSV
hsv = cv2.cvtColor(frame, cv2.COLOR_BGR2HSV)
# 这一帧图象限定在HSV蓝色的规模
blue_lower = np.array([0, 100, 90])
blue_upper = np.array([10, 255, 225])
blue_mask = cv2.inRange(hsv, blue_lower, blue_upper)
#blue_mask = blue_mask0+blue_mask1
# Bitwise-AND屏蔽原始图象
blue_res = cv2.bitwise_and(frame, frame, mask=blue_mask)
# 构造元素
kernel = cv2.getStructuringElement(cv2.MORPH_ELLIPSE, (3, 3))
# 形态学停止
blue_closing = cv2.morphologyEx(blue_res, cv2.MORPH_CLOSE, kernel)
# 转换为黑白图象
blue_gray = cv2.cvtColor(blue_closing, cv2.COLOR_BGR2GRAY)
(thresh2, blue_bw) = cv2.threshold(blue_gray, 128, 255, cv2.THRESH_BINARY | cv2.THRESH_OTSU)
# 盘算像素变更
blue_black = cv2.countNonZero(blue_bw)
print("白色区域：", blue_black)
if blue_black > 38:
# print("视频中有蓝色像素")
data[x3,y3]=4
print(x3,y3)
if i==1:
x3 = x3+1
y3 = 1
if i!=1 :
y3 = y3+1
#else:
#print("无蓝色")
# 显示成果帧
cv2.imshow("blue_quyu", blue_bw)
def direction_set(data):
"""
函数功效，找到data中未被走过的处所，并同时记载该处所能够走的处所
"""
dir_set = {}
v, h = np.where(data > 0)
for i, j in zip(v, h):
key = str(i) + str(j)
if data[i, j + 1] > 0: # 该处所东邻块是不是能走
dir_set[key] = [str(i) + str(j + 1)]
if data[i + 1, j] > 0: # 该处所南邻块是不是能走
if key in dir_set:
dir_set[key] += [str(i + 1) + str(j)]
else:
dir_set[key] = [str(i + 1) + str(j)]
# data[i, j-1]
if data[i, j - 1] > 0: # 该处所西邻块是不是能走
if key in dir_set:
dir_set[key] += [str(i) + str(j - 1)]
else:
dir_set[key] = [str(i) + str(j - 1)]
# data[i-1, j]
if data[i - 1, j] > 0: # 该处所北邻块是不是能走
if key in dir_set:
dir_set[key] += [str(i - 1) + str(j)]
else:
dir_set[key] = [str(i - 1) + str(j)]
return dir_set
def get_forward_step(exit_index):
layer_ori = ["92"] # 寄存第一层信息
while True:
layer_sec = [] # 寄存第二层信息
for key in layer_ori: # 将layer_ori里面所能到达的地位，寄存在layer_sec中
layer_sec += direction[key]
if exit_index in direction[key]:
forward_step = key
if exit_index in layer_sec: break
layer_ori = layer_sec
return forward_step
if __name__ == "__main__":
yanseshibie()
direction = direction_set(data)
huish = ["39"]
# data[int(huish[0][0]), int(huish[0][1])] = 888 #将出口用888标志
while True:
forward_step = get_forward_step(huish[-1])
huish += [forward_step]
if forward_step == "92":
break
step = huish[::-1][:-1]
for ind in step:
data[int(ind[0]), int(ind[1])] = -8
print(data)
print(step)
import numpy as np
import cv2 
