OpenCV--答题卡识别

前言

K近邻算法：K近邻算法的本质是将指定对象根据已知特征值分类。
机器学习算法是从数据中产生模型，我们把经验提供给算法，他就能够根据经验产生模型，在训练过程中所使用的数据称为训练数据，其中的每个样本称为训练样本，集合称为训练集合。

步骤

1.原图

2.导入所需库

#案例来源Fu Xianjun. All Rights Reserved
import cv2
import numpy as np

3.读取数据

def cv_show(name,img):
    cv2.imshow(name,img)
    cv2.waitKey(0)
    cv2.destroyAllWindows()
def order_points(pts):
    rect = np.zeros((4,2),dtype="float32")
    s = pts.sum(axis=1)
    rect[0]=pts[np.argmin(s)]
    rect[2]=pts[np.argmax(s)]
    d = np.diff(pts,axis=1)
    rect[1]=pts[np.argmin(d)]
    rect[3]=pts[np.argmax(d)]
    return rect
def four_point_transform(image,pts):
    rect = order_points(pts)
    (tl,tr,br,bl)=rect
    widthA = np.sqrt((br[0]-bl[0])**2+(br[1]-bl[1])**2)
    widthB = np.sqrt((tr[0]-tl[0])**2+(tr[1]-tl[1])**2)
    maxWidth = max(int(widthA),int(widthB))
    
    heightA = np.sqrt((tr[0]-br[0])**2+(tr[1]-br[1])**2)
    heightB = np.sqrt((tl[0]-bl[0])**2+(tl[1]-bl[1])**2)
    maxHeight = max(int(heightA),int(heightB))
    print(rect)
    dst = np.array([[0,0],[maxWidth-1,0],[maxWidth-1,maxHeight-1],[0,maxHeight-1]],dtype="float32")
    M = cv2.getPerspectiveTransform(rect,dst)
    warp = cv2.warpPerspective(image,M(maxWidth,maxHeight))
    return warp
def sort_contours(cnts, method="left-to-right"):
    reverse = False
    i = 0
    if method == "right-to-left" or method == "bottom-to-top":
        reverse = True
    if method == "top-to-bottom" or method == "bottom-to-top":
        i = 1
    boundingBoxes = [cv2.boundingRect(c) for c in cnts]
    (cnts, boundingBoxes) = zip(*sorted(zip(cnts, boundingBoxes), key=lambda b: b[1][i], reverse=reverse))
    return cnts, boundingBoxes

4.操作过程

ANSWER_KEY = {0:1,1:4,2:0,3:3,4:1}
image = cv2.imread("test_05.png")
contour_Img = image.copy()
gray = cv2.cvtColor(image,cv2.COLOR_BGR2GRAY)
blur = cv2.GaussianBlur(gray,(5,5),0)
edge = cv2.Canny(blur,75,200)
cnt = cv2.findContours(edge, cv2.RETR_EXTERNAL, cv2.CHAIN_APPROX_SIMPLE)[0]
cv2.drawContours(contour_Img, cnt, -1,(0,255,0),2)
dotCnt = None
if len(cnt)>0:
    cnt = sorted(cnt, key = cv2.contourArea,reverse=True)
    for c in cnt:
        peri = cv2.arcLength(c,True)
        approx = cv2.approxPolyDP(c, 0.02*peri,True)
        if len(approx)==4:
            dotCnt=approx
warp = four_point_transform(gray, dotCnt.reshape(4,2))

thresh = cv2.threshold(warp,0,255,cv2.THRESH_BINARY_INV|cv2.THRESH_OTSU)[1]
thresh_contours = thresh.copy()
cnts = cv2.findContours(thresh_contours,cv2.RETR_EXTERNAL,cv2.CHAIN_APPROX_SIMPLE)[0]
cv2.drawContours(thresh_contours, cnts, -1,(0,255,255),2)

questionCnts = []
for c in cnts:
    (x,y,w,h) = cv2.boundingRect(c)
    ar = w/float(h)
    if w>=20 and h >=20 and ar>0.9 and ar<1.1:
        questionCnts.append(c)
questionCnts = sort_contours(questionCnts, method="top-to-bottom")[0]
final = cv2.cvtColor(warp,cv2.COLOR_GRAY2BGR)
correct=0
for (q,i) in enumerate(np.arange(0,len(questionCnts),5)):
    cnts = sort_contours(questionCnts[i:i+5])[0]
    bubbled = None
    for (j,c)in enumerate(cnts):
        mask = np.zeros(thresh.shape,dtype="uint8")
        cv2.drawContours(mask, [c], -1,255,-1)
        
        mask = cv2.bitwise_and(thresh,thresh,mask=mask)
        total = cv2.countNonZero(mask)
        if bubbled is None or total >bubbled[0]:
            bubbled = (total,j)
    color = (0,0,255)
    k = ANSWER_KEY[q]
    if k==bubbled[1]:
        color = (0,255,0)
        correct+=1
    
    cv2.drawContours(final, cnts[k], -1,color,2)

score = (correct/5.0)*100
cv2.putText(final,"Total:{:.2f}".format(score),(10,30),cv2.FONT_HERSHEY_SIMPLEX,0.9,(0,0,0),2)
cv2.imshow("final",final)
cv2.waitKey(0)
cv2.destroyAllWindows()

5.展示结果