Example of simple verification code recognition function implemented in Python3-Python Tutorial-php.cn

Example of simple verification code recognition function implemented in Python3

不言

Release： 2018-05-02 14:09:50

Original

1779 people have browsed it

This article mainly introduces the simple verification code recognition function implemented in Python3, involving Python's related operating skills for verification code image recognition and processing. Friends in need can refer to it

The examples in this article describe the simple implementation of Python3 Verification code recognition function. Share it with everyone for your reference, the details are as follows:

This time the requirement is to automatically log in to an organization's website. The verification code is very unique and is very suitable for an introductory demo of verification code recognition. I will post the main code first, including pictures. The comparison uses the edit distance algorithm, and the script uses the pillow library

from PIL import Image
import requests
import re
splitter = re.compile(r&#39;\d{30}&#39;) # 分割二值化后的图片
# distance(&#39;11110000&#39;, &#39;00000000&#39;)
# 比较两个字符串有多少位不同, 返回不同的位数
def distance(string1, string2):
  d_str1 = len(string1)
  d_str2 = len(string2)
  d_arr = [[0] * d_str2 for i in range(d_str1)]
  for i in range(d_str1):
    for j in range(d_str2):
      if string1[i] == string2[j]:
        if i == 0 and j == 0:
          d_arr[i][j] = 0
        elif i != 0 and j == 0:
          d_arr[i][j] = d_arr[i - 1][j]
        elif i == 0 and j != 0:
          d_arr[i][j] = d_arr[i][j - 1]
        else:
          d_arr[i][j] = d_arr[i - 1][j - 1]
      else:
        if i == 0 and j == 0:
          d_arr[i][j] = 1
        elif i != 0 and j == 0:
          d_arr[i][j] = d_arr[i - 1][j] + 1
        elif i == 0 and j != 0:
          d_arr[i][j] = d_arr[i][j - 1] + 1
        else:
          d_arr[i][j] = min(d_arr[i][j - 1], d_arr[i - 1][j], d_arr[i - 1][j - 1]) + 1
  current = max(d_arr[d_str1 - 1][d_str2 - 1], abs(d_str2 - d_str1))
  # print("Levenshtein Distance is",current)
  # print(current)
  return current
# 去除字符串里面连续的1
def no_one(string):
  n_arr = splitter.findall(string)
  n_arr = filter(lambda each_str: each_str != &#39;111111111111111111111111111111&#39;, n_arr)
  n_result = &#39;&#39;
  for n_each in n_arr:
    n_result += str(n_each)
  return n_result
opener = requests.session()
res = opener.get(&#39;http://60.211.254.236:8402/Ajax/ValidCodeImg.ashx&#39;).content
with open(&#39;verify.gif&#39;, &#39;wb&#39;) as v:
  v.write(res)
img = Image.open(&#39;verify.gif&#39;)
img = img.convert(&#39;L&#39;)
size = img.size
# img = img.point(table, &#39;1&#39;)
img_arr = img.load()
# for x in range(size[0]):
#   for y in range(size[1]):
#     if img_arr[x, y] > 210:
#       img_arr[x, y] = 1
#     else:
#       img_arr[x, y] = 0
# img.save(&#39;after.gif&#39;)
inc = 0
str1 = &#39;&#39;
str2 = &#39;&#39;
str3 = &#39;&#39;
cur_str = &#39;&#39;
for x in range(size[0]):
  for y in range(size[1]):
    if img_arr[x, y] > 210:
      cur_str += &#39;1&#39;
    else:
      cur_str += &#39;0&#39;
    # print(img_arr[i, j], end=&#39;&#39;)
    # cur_str += str(img_arr[x, y])
  inc += 1
  # if inc % 18 == 0:
  #   print(&#39;\n----&#39;)
  # else:
  #   print(&#39;&#39;)
  if inc == 18:
    str1 = cur_str
    cur_str = &#39;&#39;
  elif inc == 36:
    str2 = cur_str
    cur_str = &#39;&#39;
  elif inc == 54:
    str3 = cur_str
    cur_str = &#39;&#39;
str1 = str1[:-60]
str2 = str2[:-60]
str3 = str3[:-60]
str1 = no_one(str1)
str2 = no_one(str2)
str3 = no_one(str3)
str1 = str1.strip(&#39;1&#39;)
str2 = str2.strip(&#39;1&#39;)
str3 = str3.strip(&#39;1&#39;)
# print(str1)
# print(str3)
with open(&#39;./dict/plus&#39;) as plus:
  with open(&#39;./dict/minus&#39;) as minus:
    p = plus.read()
    m = minus.read()
    is_add = 1 if distance(p, str2) < distance(m, str2) else 0
arr1 = []
arr3 = []
for each in range(1, 10):
  with open(&#39;./dict/{}&#39;.format(each)) as f:
    ff = f.read()
    arr1.append([each, distance(ff, str1)])
    arr3.append([each, distance(ff, str3)])
arr1 = sorted(arr1, key=lambda item: item[1])
arr3 = sorted(arr3, key=lambda item: item[1])
result = arr1[0][0] + arr3[0][0] if is_add else arr1[0][0] - arr3[0][0]
print(result)
# login_url = &#39;http://60.211.254.236:8402/Ajax/Login.ashx?Method=G3_Login&#39;
# login_data = {
#   &#39;loginname&#39;: usn,
#   &#39;password&#39;: pwd,
#   &#39;validcode&#39;: result,
#
# }
# opener.get(login_url, login_data)

Copy after login

Related recommendations:

Read txt data files in Python3 How to enter the matrix

The above is the detailed content of Example of simple verification code recognition function implemented in Python3. For more information, please follow other related articles on the PHP Chinese website!