如何识别字母的验证码？
单纯为了学习技术，从最简单的情况分析，无扭曲无变形无干扰数字的特征库如下，那字母的特征库如何建立比较有效？
public static int[] number6 = {
0,0,1,1,1,1,
0,1,0,0,0,0,
1,0,0,0,0,0,
1,0,1,1,0,0,
1,1,0,0,1,0,
1,0,0,0,0,1,
1,0,0,0,0,1,
0,1,0,0,1,0,
0,0,1,1,0,0
};
public static int[] number0 = {
0,0,1,1,0,0,
0,1,0,0,1,0,
1,0,0,0,0,1,
1,0,0,0,0,1,
1,0,0,0,0,1,
1,0,0,0,0,1,
1,0,0,0,0,1,
0,1,0,0,1,0,
0,0,1,1,0,0
};
public static int[] number1 = {
0,0,1,1,0,0,
0,1,0,1,0,0,
0,0,0,1,0,0,
0,0,0,1,0,0,
0,0,0,1,0,0,
0,0,0,1,0,0,
0,0,0,1,0,0,
0,0,0,1,0,0,
0,1,1,1,1,1
};
public static int[] number2 = {
1,1,1,1,0,0,
0,0,0,0,1,0,
0,0,0,0,1,0,
0,0,0,0,1,0,
0,0,0,1,0,0,
0,0,1,0,0,0,
0,1,0,0,0,0,
1,0,0,0,0,0,
1,1,1,1,1,0
};
public static int[] number3 = {
1,1,1,1,0,0,
0,0,0,0,1,0,
0,0,0,0,1,0,
0,0,0,1,0,0,
0,1,1,0,0,0,
0,0,0,1,0,0,
0,0,0,0,1,0,
0,0,0,0,1,0,
0,1,1,1,0,0
};
public static int[] number4 = {
0,0,0,0,1,0,
0,0,0,1,1,0,
0,0,1,0,1,0,
0,1,0,0,1,0,
1,0,0,0,1,0,
1,1,1,1,1,1,
0,0,0,0,1,0,
0,0,0,0,1,0,
0,0,0,0,1,0
};
public static int[] number5 = {
1,1,1,1,1,0,
1,0,0,0,0,0,
1,0,0,0,0,0,
1,1,1,0,0,0,
0,0,0,1,0,0,
0,0,0,0,1,0,
0,0,0,0,1,0,
0,0,0,1,0,0,
1,1,1,0,0,0
};
public static int[] number7 = {
1,1,1,1,1,1,
0,0,0,0,0,1,
0,0,0,0,1,0,
0,0,0,1,0,0,
0,0,0,1,0,0,
0,0,1,0,0,0,
0,0,1,0,0,0,
0,1,0,0,0,0,
0,1,0,0,0,0
};
public static int[] number8 = {
0,1,1,1,1,0,
1,0,0,0,0,1,
1,0,0,0,0,1,
0,1,0,0,1,0,
0,1,1,1,1,0,
1,0,0,0,0,1,
1,0,0,0,0,1,
1,0,0,0,0,1,
0,1,1,1,1,0
};
public static int[] number9 = {
0,0,1,1,0,0,
0,1,0,0,1,0,
1,0,0,0,0,1,
1,0,0,0,0,1,
0,1,0,0,1,1,
0,0,1,1,0,1,
0,0,0,0,0,1,
0,0,0,0,1,0,
1,1,1,1,0,0
};
