JavaSE图像验证码简单识别程序详解

/**
 * 图片解析引擎，适合做网站验证码的分析。
 * 首先必须载入样品，解析器将从左到右横向扫描，发现于样本的就自动记录。
 * 当然本程序不适合样本不是唯一的，也就是说要识别的图片被缩放或者坐标变动和变形本程序无法进行这样的识别。
 * 如果图片中的颜色变化非常大，此程序可能会有问题，当然了你可以选择一个标准的值做为转换成0,1矩阵的标准。
 * 
 * 样本的制作：请将样本转换成灰度模式，只含有两色最好，当然了不转换我也帮你转换了。
 * 
 */

import java.awt.Image;
import java.awt.image.bufferedImage;
import java.io.file;
import java.util.ArrayList;
import java.util.Iterator;
import java.util.List;

import javax.imageio.ImageIO;

public class ImageParser {

  // ------------------------------------------------------------ Private Data

  // 样本的矩阵
  private static List swatches   = null;

  // 样本的值
  private static List swatcheValues = null;

  // 图片文件的矩阵化
  private byte[][]  targetcolors;
  
  // ------------------------------------------------------------ Test main method
  public static voID main(String[] args) {
    // 加入样本与其样本对应的数值
    String[] files = new String[10];
    String[] values = new String[10];
    for (int i = 0; i < files.length; i++){
      files[i] = "D:/workspace/SZXClIEntAPP/res/" + i + ".jpg";
      values[i] = String.valueOf(i);
    }
    
    ImageParser parse = new ImageParser(files,values);
    long startime = System.currentTimeMillis();
    try {
      // 解析图片
      System.out.println(parse.parseValue("D:/workspace/SZXClIEntAPP/res/ValIDateNum"));
      long sinCETime = System.currentTimeMillis();
      System.out.println("所花时间 = " + (sinCETime - startimE));
    } catch (Exception E) {
      e.printstacktrace();
    }
  }

  // ------------------------------------------------------------ Constructors

  /**
   * 载入所有样本路径与其样本对应的数值
   * 
   * @param files
   */
  public ImageParser(String[] files,String[] values) {
    // 只允许样本创建一次即可
    if (swatches == null && swatcheValues == null) {
      int fileslength = files.length;
      int valueslength = values.length;
      if(fileslength != valueslength){
        System.out.println("样本文件与样本数值不匹配！请重新设置！");
        return;
      }
      swatches = new ArrayList(fileslength);
      swatcheValues = new ArrayList(valueslength);
      int i = 0;
      try {
        for (; i < files.length; i++) {
          swatches.add(imagetoMatrix(files[i]));
          swatcheValues.add(i,values[i]);
        }
      } catch (Exception E) {
        System.out.println(files[i] + " can not be parsed");
        e.printstacktrace();
      }
    }
  }

  public ImageParser() {
    super();
    if (swatches == null || swatcheValues == null) {
      System.out.println("您未载入样本，请先载入样本！");
    }
  }

  /**
   * 解析图片的值
   * 
   * @param parsefilePath
   *      给出图片路径
   * @return 返回字符串
   * @throws Exception
   */
  public String parseValue(String parsefilePath) throws Exception {
    StringBuffer result = new StringBuffer();
    targetcolors = imagetoMatrix(parsefilePath);
    // printMatrix(targetcolors);
    int height = targetcolors.length;
    int targetWIDth = targetcolors[0].length;

    int wIDth = 0;
    Iterator it = swatches.iterator();
    while (it.hasNext()) {
      byte[][] bytes = (byte[][]) it.next();
      int templen = bytes[0].length;
      if (templen > wIDth)
        wIDth = templen;
    }
    // System.out.println("MaxWIDth = " + wIDth);
    // System.out.println("MaxHeight = " + height);
    int xTag = 0;
    while ((xTag + wIDth) < targetWIDth) {
      cout: {
        Iterator itx = swatches.iterator();
        int i = 0;
        while (itx.hasNext()) {
          byte[][] bytes = (byte[][]) itx.next();
          byte[][] temp = splitMatrix(targetcolors,xTag,wIDth,height);
          // System.out.println(i++);
          if (ismatrixInBigMatrix(bytes,temp)) {
            xTag += wIDth;
            // System.out.println("new maxtrix: ");
            // printMatrix(temp);
            
            result.append(swatcheValues.get(i));
            break cout;
          }
          i++;
        }
        xTag++;
      }
    }
    return result.toString();
  }

  // ------------------------------------------------------------ Private methods

  /**
   * 判断一个矩阵是否在另外的矩阵中
   * 
   * @param source
   *      源矩阵
   * @param bigMatrix
   *      大的矩阵
   * @return 如果存在就返回 true
   */
  private static final Boolean ismatrixInBigMatrix(byte[][] source,byte[][] bigMatriX) {
    if (source == bigMatriX)
      return true;
    if (source == null || bigMatrix == null)
      return false;

    if (source.length > bigMatrix.length)
      return false;

    try {
      for (int i = 0; i < source.length; i++) {
        if (source[i].length > bigMatrix[i].length)
          return false;
      }
    } catch (Arrayindexoutofboundsexception E) {
      return false;
    }

    int height = source.length;
    int wIDth = source[0].length;
    int x = 0,y = 0;
    int i = 0,j = 0;
    int count = 0;

    int comparecount = height * wIDth;

    for (; i < bigMatrix.length - height + 1; i++) {
      for (j = 0; j < bigMatrix[i].length - wIDth + 1; j++) {
        cout: {
          x = 0;
          count = 0;
          for (int k = i; k < height + i; k++) {
            y = 0;
            for (int l = j; l < wIDth + j; L++) {
              // System.out.println("bytes[" + x + "][" + y + "]"
              // + " = " + source[x][y] + "," + "other["
              // + k + "][" + l + "] = " + bigMatrix[k][l]);
              if ((source[x][y] & bigMatrix[k][l]) == source[x][y]) {
                count++;
              } else
                break cout;
              y++;
            }
            x++;
          }
          // System.out.println("count = " + count);
          if (count == comparecount)
            return true;
        }
      }
    }
    return false;
  }

  /**
   * 切割矩阵
   * 
   * @param source
   *      源矩阵
   * @param x
   *      X坐标
   * @param y
   *      Y坐标
   * @param wIDth
   *      矩阵的宽度
   * @param height
   *      矩阵的高度
   * @return 切割后的矩阵
   */
  private static final byte[][] splitMatrix(byte[][] source,int x,int y,int wIDth,int height) {
    byte[][] resultbytes = new byte[height][wIDth];
    for (int i = y,k = 0; i < height + y; i++,k++) {
      for (int j = x,l = 0; j < wIDth + x; j++,L++) {

        resultbytes[k][l] = source[i][j];
        // System.out.println("source[" + i + "][" + j + "]" + " = " +
        // source[i][j] + "," + "resultbytes["
        // + k + "][" + l + "] = " + resultbytes[k][l]);
      }

    }
    return resultbytes;
  }

  /**
   * 图片转换成矩阵数组
   * 
   * @param filePath
   *      文件路径
   * @return 返回矩阵
   * @throws Exception
   *       可能会抛出异常
   */
  private byte[][] imagetoMatrix(String filePath) throws Exception {
    // 读入文件
    Image image = ImageIO.read(new file(filePath));
    int w = image.getWIDth(null);
    int h = image.getHeight(null);
    BufferedImage src = new BufferedImage(w,h,BufferedImage.TYPE_INT_RGB);
    src.getGraphics().drawImage(image,null);

    byte[][] colors = new byte[h][w];

    for (int i = 0; i < h; i++) {
      for (int j = 0; j < w; j++) {
        int rgb = src.getRGB(j,i);
        // 像素进行灰度处理
        String sRed = Integer.toHexString(rgb).subString(2,4);
        String sGreen = Integer.toHexString(rgb).subString(4,6);
        String sBlank = Integer.toHexString(rgb).subString(6,8);
        long ired = Math.round((Integer.parseInt(sRed,16) * 0.3 + 0.5d));
        long igreen = Math.round((Integer.parseInt(sGreen,16) * 0.59 + 0.5d));
        long iblank = Math.round((Integer.parseInt(sBlank,16) * 0.11 + 0.5d));
        long al = ired + igreen + iblank;

        // if (al > 127)
        // System.out.print(" " + " ");
        // else
        // System.out.print(" " + "1");
        // System.out.print(" " + (tempint > = maxint ? 0 : 1));
        // System.out.println("tempInt = " + tempint);

        /* 将图像转换成0,1 */
        // 此处的值可以将来修改成你所需要判断的值
        colors[i][j] = (bytE) (al > 127 ? 0 : 1);
      }
      // System.out.println();
    }

    return colors;
  }

  /**
   * 打印矩阵
   * 
   * @param matrix
   */
  private static final voID printMatrix(byte[][] matriX) {
    for (int i = 0; i < matrix.length; i++) {
      for (int j = 0; j < matrix[i].length; j++) {
        if (matrix[i][j] == 0)
          System.out.print(" ");
        else
          System.out.print(" 1");
      }
      System.out.println();
    }
  }
}