OpenCV条码(6)简单实现

用OpenCV读取条码图像，并利用EAN-13码的编码方式解码。

通过读入一张条码图像，识别对应的条码。

参考自  http://felix.abecassis.me/2011/10/opencv-barcode-reader-part-1/

/*version 0.01:
* 只是把upc的识别换成了ean的识别
* 第一个数字只能识别6或者9
* 图像要求为只包含条码
* 清晰度要求太高，500w手机拍照的照片不能完全识别
*----
*    ChriZZ   2013.5.5
*/
  1 #include <iostream>
#include <map>
#include <string>
#include <algorithm>
#include <cv.h>
#include <highgui.h>

using namespace std;
using namespace cv;

#define SPACE 0
#define BAR 255

typedef Mat_<uchar> MatU;
map<string, int> table[3];
enum position{LEFT,RIGHT};
int counter;     //计数器，表示正在计算的条码编号（不包括起始编号）
int front;       //起始编号
int mode[6];    //不同的起始编号对应着不同的左侧编码模式，比如起始编号为6对应“奇偶偶偶奇奇”，9对应“奇偶偶奇偶奇”。用1表示奇数，0表示偶数

void change01(string & s){//0和1互换。解码时使用
    for(int i=0; i<s.length(); i++)
        if(s[i]=='0') s[i]='1';
        else s[i]='0';
}

void setup_map(){   //设定解码映射表table[], table[0]为左侧条码奇数型，table[1]为左侧条码偶数型，table[2]为右侧条码偶数型
    string zode[10]={"0001101", "0011001", "0010011", "0111101", "0100011", "0110001", "0101111", "0111011", "0110111", "0001011"};
    for(int i=0; i<10; i++){
        table[0][zode[i]]=i;
        string tmp=zode[i];
        change01(tmp);
        table[2][tmp]=i;
        reverse(tmp.begin(), tmp.end());
        table[1][tmp]=i;
    }
}
void align_boundary(const MatU& img, Point& cur, int begin, int end){
    if (img(cur) == end){
        while (img(cur)==end)
            ++cur.x;
    }else{
        while (img(cur.y, cur.x-1)==begin)
            --cur.x;
    }
}

/*int read_digit(...)
 *返回解析后得到的数字*/
int read_digit(const MatU& img, Point& cur, int unit_width, int position){
    // Read the 7 consecutive bits.
    int pattern[7] = {0, 0, 0, 0, 0, 0, 0};
    for (int i = 0; i < 7; i++){
        for (int j = 0; j < unit_width; j++){
            if (img(cur) == 255)
                ++pattern[i];
            ++cur.x;
        }
        // See below for explanation.
        if (pattern[i] == 1 && img(cur) == BAR
            || pattern[i] == unit_width - 1 && img(cur) == SPACE)
            --cur.x;
    }
    // Convert to binary, consider that a bit is set if the number of
    // bars encountered is greater than a threshold.
    int threshold = unit_width / 2;
    string v="";
    for (int i = 0; i < 7; i++){
        if(pattern[i]>=threshold) v=v+"1";
        else v=v+"0";
    }
    // Lookup digit value.
    int digit;
    if (position == LEFT){
        if(counter==0){
            if(v=="0001011"){//说明左侧数据第一个字符是6，将模式设定为“奇偶偶偶奇奇”
                mode[0]=1;
                mode[1]=0;
                mode[2]=0;
                mode[3]=0;
                mode[4]=1;
                mode[5]=1;
                front=6;
            }else{              //在中国除了69*开头的条码 应该都是97*开头的（ISBN）
                mode[0]=1;
                mode[1]=0;
                mode[2]=0;
                mode[3]=1;
                mode[4]=0;
                mode[5]=1;
                front=9;
            }
        }
        if(mode[counter]==1) digit=table[0][v]; //对应左侧奇数的编码方式
        else digit=table[1][v];                 //对应左侧偶数的编码方式
        align_boundary(img, cur, SPACE, BAR);
    }else{
        // Bitwise complement (only on the first 7 bits).
        digit = table[2][v];                    //对应右侧偶数的编码方式
        align_boundary(img, cur, BAR, SPACE);
    }
    counter++;
    return digit;
}

void skip_quiet_zone(const MatU& img, Point& cur){//略过空白区域
    while (img(cur) == SPACE)
        ++cur.x;
}

unsigned read_lguard(const MatU& img, Point& cur){//读取起始编号和左侧数据之间的
    int widths[3] = { 0, 0, 0 };
    int pattern[3] = { BAR, SPACE, BAR };
    for (int i = 0; i < 3; i++)
        while (img(cur) == pattern[i]){
            ++cur.x;
            ++widths[i];
        }
        return widths[0];
}

void skip_mguard(const MatU& img, Point& cur){      //略过左侧数据和右侧数据之间的分界
    int pattern[5] = { SPACE, BAR, SPACE, BAR, SPACE };
    for (int i = 0; i < 5; i++)
        while (img(cur) == pattern[i])
            ++cur.x;
}

void read_barcode(const string& filename){      //读取条码主程序
    counter=0;
    MatU img = cv::imread(filename, 0);         //载入图像
    Size size = img.size();
    Point cur(0, size.height / 2);              //cur表示当前位置

    bitwise_not(img, img);
    threshold(img, img, 128, 255, THRESH_BINARY);
    skip_quiet_zone(img, cur);

    setup_map();                    //初始化解析表

    int unit_width = read_lguard(img, cur);

    vector<int> digits;
    for (int i=0; i<6; i++){               //左侧数据解码
        int d = read_digit(img, cur, unit_width, LEFT);
        digits.push_back(d);
    }

    skip_mguard(img, cur);

    for (int i = 0; i < 6; i++){        //右侧数据解码
        int d = read_digit(img, cur, unit_width, RIGHT);
        digits.push_back(d);
    }
    cout << front;                      //输出解码结果
    for (int i = 0; i < 12; i++)
        cout << digits[i];
    cout << endl;
    waitKey();
}
int main(){
    string imgname="C:/testdir/left.jpg";
    read_barcode(imgname);
    return 0;
}

通过改进测量方法，用数学的手段减小了误差，提高了识别率，代码如下

/*version 0.02
*提高了识别精度
*第一位字符通过左侧6个数据反推得到，不仅仅限定于6和9
*------
*     ChrisZZ  2012.5.5
*/
  1 #include <iostream>
#include <map>
#include <string>
#include <cmath>
#include <algorithm>
#include <cv.h>
#include <highgui.h>

using namespace std;
using namespace cv;

#define SPACE 0
#define BAR 255

typedef Mat_<uchar> MatU;
map<string, int> table[3];
enum position{LEFT,RIGHT};
int front;       //起始编号
int mode[6];    //不同的起始编号对应着不同的左侧编码模式，比如起始编号为6对应“奇偶偶偶奇奇”，9对应“奇偶偶奇偶奇”。用1表示奇数，0表示偶数
const double eps=1e-5;
int z;

int get_front(){
    string tmp="";
    int i;
    for(i=0; i<6; i++){
        if(mode[i]==0) tmp=tmp+"0";
        else tmp=tmp+"1";
    }
    if(tmp=="000000") return 0;
    else if(tmp=="001011") return 1;
    else if(tmp=="001101") return 2;
    else if(tmp=="001110") return 3;
    else if(tmp=="010011") return 4;
    else if(tmp=="011001") return 5;
    else if(tmp=="011100") return 6;
    else if(tmp=="010101") return 7;
    else if(tmp=="010110") return 8;
    else if(tmp=="011010") return 9;
    else return -1;
}

void align_boundary(const MatU& img, Point& cur, int begin, int end){
    if (img(cur) == end){
        while (img(cur)==end)
            ++cur.x;
    }else{
        while (img(cur.y, cur.x-1)==begin)
            --cur.x;
    }
}

/*int read_digit(...)
 *返回解析后得到的数字*/
int read_digit(const MatU& img, Point& cur, int position){
    int pattern[4] = {0,0,0,0}, i;
    for (i=0; i<4; i++){
        int cur_val=img(cur);
        while(img(cur)==cur_val){
            ++pattern[i];
            ++cur.x;
        }
    }
    double sum=pattern[0]+pattern[1]+pattern[2]+pattern[3];
    double tmp1=(pattern[0]+pattern[1])*1.0;
    double tmp2=(pattern[1]+pattern[2])*1.0;
    int at1, at2;
    if(tmp1/sum < 2.5/7)  at1=2;
    else if(tmp1/sum < 3.5/7) at1=3;
    else if(tmp1/sum < 4.5/7) at1=4;
    else at1=5;

    if(tmp2/sum < 2.5/7)  at2=2;
    else if(tmp2/sum < 3.5/7) at2=3;
    else if(tmp2/sum < 4.5/7) at2=4;
    else at2=5;

    int digit=-1;

    if(position==LEFT){
        if(at1==2){
            if(at2==2) {
                mode[z++]=0;
                digit = 6;
            }
            else if(at2==3) {
                mode[z++]=1;
                digit = 0;
            }
            else if(at2==4) {
                mode[z++]=0;
                digit = 4;
            }
            else if(at2==5) {
                mode[z++]=1;
                digit = 3;
            }
        }
        else if(at1==3){
            if(at2==2) {
                mode[z++]=1;
                digit = 9;
            }
            else if(at2==3) {
                mode[z++]=0;
                if(pattern[2]+1<pattern[3]) digit = 8;
                else digit = 2;
            }
            else if(at2==4) {
                mode[z++]=1;
                if(pattern[1]+1<pattern[2]) digit = 7;
                else digit = 1;
            }
            else if(at2==5) {
                mode[z++]=0;
                digit = 5;
            }
        }
        else if(at1==4){
            if(at2==2) {
                mode[z++]=0;
                digit = 9;
            }
            else if(at2==3) {
                mode[z++]=1;
                if(pattern[1]+1<pattern[0]) digit = 8;
                else digit = 2;
            }
            else if(at2==4) {
                mode[z++]=0;
                if(pattern[0]+1<pattern[1]) digit = 7;
                else digit = 1;
            }
            else if(at2==5) {
                mode[z++]=1;
                digit = 5;
            }
        }
        else if(at1==5){
            if(at2==2) {
                mode[z++]=1;
                digit = 6;
            }
            else if(at2==3) {
                mode[z++]=0;
                digit = 0;
            }
            else if(at2==4) {
                mode[z++]=1;
                digit = 4;
            }
            else if(at2==5) {
                mode[z++]=0;
                digit=3;
            }
        }
     //   align_boundary(img, cur, SPACE, BAR);
    }else{
        if(at1==2){
            if(at2==2) digit = 6;
            else if(at2==4) digit = 4;
        }
        else if(at1==3){
            if(at2==3) {
                if(pattern[2]+1<pattern[3]) digit = 8;
                else digit = 2;
            }
            else if(at2==5) digit = 5;
        }
        else if(at1==4){
            if(at2==2) digit = 9;
            else if(at2==4) {
                if(pattern[0]+1<pattern[1]) digit = 7;
                else digit = 1;
            }
        }
        else if(at1==5){
            if(at2==3) digit = 0;
            else if(at2==5) digit=3;
        }
     //   align_boundary(img, cur, SPACE, BAR);
    }
    return digit;
}

void skip_quiet_zone(const MatU& img, Point& cur){//略过空白区域
    while (img(cur) == SPACE)
        ++cur.x;
}

void read_lguard(const MatU& img, Point& cur){//通过读取左侧固定的“条空条”，获取单位长度。
    int pattern[3] = { BAR, SPACE, BAR };
    for (int i=0; i<3; i++)
        while (img(cur)==pattern[i])
            ++cur.x;
}

void skip_mguard(const MatU& img, Point& cur){      //略过左侧数据和右侧数据之间的分界
    int pattern[5] = { SPACE, BAR, SPACE, BAR, SPACE };
    for (int i=0; i<5; i++)
        while (img(cur)==pattern[i])
            ++cur.x;
}

void read_barcode(const string& filename){      //读取条码主程序
    z=0;
    MatU img = imread(filename, 0);         //载入图像
    Size size = img.size();
    Point cur(0, size.height / 2);              //cur表示当前位置
    bitwise_not(img, img);
    threshold(img, img, 128, 255, THRESH_BINARY);
    skip_quiet_zone(img, cur);
    read_lguard(img, cur);
    vector<int> digits;
    for (int i=0; i<6; i++){               //左侧数据解码
        int d = read_digit(img, cur, LEFT);
        digits.push_back(d);
    }
    skip_mguard(img, cur);
    for (int i = 0; i < 6; i++){        //右侧数据解码
        int d = read_digit(img, cur, RIGHT);
        digits.push_back(d);
    }
    //输出解码结果
    int front=get_front();
    cout << front << " ";
    for (int i = 0; i < 12; i++)
        cout << digits[i] << " ";
    cout << endl;
    waitKey();
}
int main(){
    string imgname="C:/testdir/barcode3.jpg";
    read_barcode(imgname);
    return 0;
}

目前把摄像头调用和条码图片检测联系在一起，发现有问题，矩形区域的确认还没做好。。使用了多边形。

#include <iostream>
#include <map>
#include <string>
#include <cmath>
#include <algorithm>
#include <cv.h>
#include <highgui.h>

using namespace std;
using namespace cv;

#define SPACE 0
#define BAR 255

typedef Mat_<uchar> MatU;
map<string, int> table[3];
enum position{LEFT,RIGHT};
int front;       //Æðʼ±àºÅ
int mode[6];    //²»Í¬µÄÆðʼ±àºÅ¶ÔÓ¦×Ų»Í¬µÄ×ó²à±àÂëģʽ£¬±ÈÈçÆðʼ±àºÅΪ6¶ÔÓ¦¡°ÆæżżżÆæÆ桱£¬9¶ÔÓ¦¡°ÆæżżÆæżÆ桱¡£ÓÃ1±íʾÆæÊý£¬0±íʾżÊý
const double eps=1e-5;
int z;

int get_front(){
    string tmp="";
    int i;
    for(i=0; i<6; i++){
        if(mode[i]==0) tmp=tmp+"0";
        else tmp=tmp+"1";
    }
    if(tmp=="000000") return 0;
    else if(tmp=="001011") return 1;
    else if(tmp=="001101") return 2;
    else if(tmp=="001110") return 3;
    else if(tmp=="010011") return 4;
    else if(tmp=="011001") return 5;
    else if(tmp=="011100") return 6;
    else if(tmp=="010101") return 7;
    else if(tmp=="010110") return 8;
    else if(tmp=="011010") return 9;
    else return -1;
}

void align_boundary(const MatU& img, Point& cur, int begin, int end){
    if (img(cur) == end){
        while (img(cur)==end)
            ++cur.x;
    }else{
        while (img(cur.y, cur.x-1)==begin)
            --cur.x;
    }
}

/*int read_digit(...)
 *·µ»Ø½âÎöºóµÃµ½µÄÊý×Ö*/
int read_digit(const MatU& img, Point& cur, int position){
    // Read the 7 consecutive bits.
    int pattern[4] = {0,0,0,0};
    int i;
    for (i=0; i<4; i++){
        int cur_val=img(cur);
        while(img(cur)==cur_val){
            ++pattern[i];
            ++cur.x;
        }
        cout << endl;
        cout << "pattern[" << i << "]=" << pattern[i] << endl;
        // See below for explanation.
/*        if ((pattern[i] == 1 && img(cur) == BAR) || (pattern[i] == unit_width - 1 && img(cur) == SPACE))
            --cur.x;*/
    }



    // Convert to binary, consider that a bit is set if the number of
    // bars encountered is greater than a threshold.
    double sum=pattern[0]+pattern[1]+pattern[2]+pattern[3];
    double tmp1=(pattern[0]+pattern[1])*1.0;
    double tmp2=(pattern[1]+pattern[2])*1.0;
    int at1, at2;
    if(tmp1/sum < 2.5/7)  at1=2;
    else if(tmp1/sum < 3.5/7) at1=3;
    else if(tmp1/sum < 4.5/7) at1=4;
    else at1=5;

    if(tmp2/sum < 2.5/7)  at2=2;
    else if(tmp2/sum < 3.5/7) at2=3;
    else if(tmp2/sum < 4.5/7) at2=4;
    else at2=5;

    int digit=-1;

    if(position==LEFT){
        if(at1==2){
            if(at2==2) {
                mode[z++]=0;
                digit = 6;
            }
            else if(at2==3) {
                mode[z++]=1;
                digit = 0;
            }
            else if(at2==4) {
                mode[z++]=0;
                digit = 4;
            }
            else if(at2==5) {
                mode[z++]=1;
                digit = 3;
            }
        }
        else if(at1==3){
            if(at2==2) {
                mode[z++]=1;
                digit = 9;
            }
            else if(at2==3) {
                mode[z++]=0;
                if(pattern[2]+1<pattern[3]) digit = 8;
                else digit = 2;
            }
            else if(at2==4) {
                mode[z++]=1;
                if(pattern[1]+1<pattern[2]) digit = 7;
                else digit = 1;
            }
            else if(at2==5) {
                mode[z++]=0;
                digit = 5;
            }
        }
        else if(at1==4){
            if(at2==2) {
                mode[z++]=0;
                digit = 9;
            }
            else if(at2==3) {
                mode[z++]=1;
                if(pattern[1]+1<pattern[0]) digit = 8;
                else digit = 2;
            }
            else if(at2==4) {
                mode[z++]=0;
                if(pattern[0]+1<pattern[1]) digit = 7;
                else digit = 1;
            }
            else if(at2==5) {
                mode[z++]=1;
                digit = 5;
            }
        }
        else if(at1==5){
            if(at2==2) {
                mode[z++]=1;
                digit = 6;
            }
            else if(at2==3) {
                mode[z++]=0;
                digit = 0;
            }
            else if(at2==4) {
                mode[z++]=1;
                digit = 4;
            }
            else if(at2==5) {
                mode[z++]=0;
                digit=3;
            }
        }
     //   align_boundary(img, cur, SPACE, BAR);
    }else{
        if(at1==2){
            if(at2==2) digit = 6;
            else if(at2==4) digit = 4;
        }
        else if(at1==3){
            if(at2==3) {
                if(pattern[2]+1<pattern[3]) digit = 8;
                else digit = 2;
            }
            else if(at2==5) digit = 5;
        }
        else if(at1==4){
            if(at2==2) digit = 9;
            else if(at2==4) {
                if(pattern[0]+1<pattern[1]) digit = 7;
                else digit = 1;
            }
        }
        else if(at1==5){
            if(at2==3) digit = 0;
            else if(at2==5) digit=3;
        }
     //   align_boundary(img, cur, SPACE, BAR);
    }
    cout << "digit=" << digit << endl;
    return digit;
}

void skip_quiet_zone(const MatU& img, Point& cur){//ÂÔ¹ý¿Õ°×ÇøÓò
    while (img(cur) == SPACE)
        ++cur.x;
}

void read_lguard(const MatU& img, Point& cur){//ͨ¹ý¶ÁÈ¡×ó²à¹Ì¶¨µÄ¡°Ìõ¿ÕÌõ¡±£¬»ñÈ¡µ¥Î»³¤¶È¡£
    int pattern[3] = { BAR, SPACE, BAR };
    for (int i=0; i<3; i++)
        while (img(cur)==pattern[i])
            ++cur.x;
}

void skip_mguard(const MatU& img, Point& cur){      //ÂÔ¹ý×ó²àÊý¾ÝºÍÓÒ²àÊý¾ÝÖ®¼äµÄ·Ö½ç
    int pattern[5] = { SPACE, BAR, SPACE, BAR, SPACE };
    for (int i=0; i<5; i++)
        while (img(cur)==pattern[i])
            ++cur.x;
}

void read_barcode(MatU& img/*const string& filename*/){      //¶ÁÈ¡ÌõÂëÖ÷³ÌÐò
    z=0;
  //  MatU img = imread(filename, 0);         //ÔØÈëͼÏñ
    Size size = img.size();
    Point cur(0, size.height / 2);              //cur±íʾµ±Ç°Î»ÖÃ

    bitwise_not(img, img);
    threshold(img, img, 128, 255, THRESH_BINARY);

    if (img(cur) != SPACE) return;

    skip_quiet_zone(img, cur);

    read_lguard(img, cur);

    vector<int> digits;
    for (int i=0; i<6; i++){               //×ó²àÊý¾Ý½âÂë
        int d = read_digit(img, cur, LEFT);
        digits.push_back(d);
    }

    skip_mguard(img, cur);

    for (int i = 0; i < 6; i++){        //ÓÒ²àÊý¾Ý½âÂë
        int d = read_digit(img, cur, RIGHT);
        digits.push_back(d);
    }
  //  cout << front;                      //Êä³ö½âÂë½á¹û
    int front=get_front();
    cout << front << " ";
    for (int i = 0; i < 12; i++)
        cout << digits[i] << " ";
    cout << endl;
    //waitKey();
}




// The "Square Detector" program.
// It loads several images sequentially and tries to find squares in
// each image

#include "opencv2/core/core.hpp"
#include "opencv2/imgproc/imgproc.hpp"
#include "opencv2/highgui/highgui.hpp"

#include <iostream>
#include <math.h>
#include <string.h>

using namespace cv;
using namespace std;

static void help()
{
    cout <<
    "\nA program using pyramid scaling, Canny, contours, contour simpification and\n"
    "memory storage (it's got it all folks) to find\n"
    "squares in a list of images pic1-6.png\n"
    "Returns sequence of squares detected on the image.\n"
    "the sequence is stored in the specified memory storage\n"
    "Call:\n"
    "./squares\n"
    "Using OpenCV version %s\n" << CV_VERSION << "\n" << endl;
}


int thresh = 50, N = 11;
const char* wndname = "Square Detection Demo";

// helper function:
// finds a cosine of angle between vectors
// from pt0->pt1 and from pt0->pt2
static double angle( Point pt1, Point pt2, Point pt0 )
{
    double dx1 = pt1.x - pt0.x;
    double dy1 = pt1.y - pt0.y;
    double dx2 = pt2.x - pt0.x;
    double dy2 = pt2.y - pt0.y;
    return (dx1*dx2 + dy1*dy2)/sqrt((dx1*dx1 + dy1*dy1)*(dx2*dx2 + dy2*dy2) + 1e-10);
}

// returns sequence of squares detected on the image.
// the sequence is stored in the specified memory storage
static void findSquares( const Mat& image, vector<vector<Point> >& squares )
{
    squares.clear();

    Mat pyr, timg, gray0(image.size(), CV_8U), gray;

    // down-scale and upscale the image to filter out the noise
    pyrDown(image, pyr, Size(image.cols/2, image.rows/2));
    pyrUp(pyr, timg, image.size());
    vector<vector<Point> > contours;

    // find squares in every color plane of the image
    for( int c = 0; c < 3; c++ )
    {
        int ch[] = {c, 0};
        mixChannels(&timg, 1, &gray0, 1, ch, 1);

        // try several threshold levels
        for( int l = 0; l < N; l++ )
        {
            // hack: use Canny instead of zero threshold level.
            // Canny helps to catch squares with gradient shading
            if( l == 0 )
            {
                // apply Canny. Take the upper threshold from slider
                // and set the lower to 0 (which forces edges merging)
                Canny(gray0, gray, 0, thresh, 5);
                // dilate canny output to remove potential
                // holes between edge segments
                dilate(gray, gray, Mat(), Point(-1,-1));
            }
            else
            {
                // apply threshold if l!=0:
                //     tgray(x,y) = gray(x,y) < (l+1)*255/N ? 255 : 0
                gray = gray0 >= (l+1)*255/N;
            }

            // find contours and store them all as a list
            findContours(gray, contours, CV_RETR_LIST, CV_CHAIN_APPROX_SIMPLE);

            vector<Point> approx;

            // test each contour
            for( size_t i = 0; i < contours.size(); i++ )
            {
                // approximate contour with accuracy proportional
                // to the contour perimeter
                approxPolyDP(Mat(contours[i]), approx, arcLength(Mat(contours[i]), true)*0.02, true);

                // square contours should have 4 vertices after approximation
                // relatively large area (to filter out noisy contours)
                // and be convex.
                // Note: absolute value of an area is used because
                // area may be positive or negative - in accordance with the
                // contour orientation
                if( approx.size() == 4 &&
                    fabs(contourArea(Mat(approx))) > 1000 &&
                    isContourConvex(Mat(approx)) )
                {
                    double maxCosine = 0;

                    for( int j = 2; j < 5; j++ )
                    {
                        // find the maximum cosine of the angle between joint edges
                        double cosine = fabs(angle(approx[j%4], approx[j-2], approx[j-1]));
                        maxCosine = MAX(maxCosine, cosine);
                    }

                    // if cosines of all angles are small
                    // (all angles are ~90 degree) then write quandrange
                    // vertices to resultant sequence
                    if( maxCosine < 0.3 )
                        squares.push_back(approx);
                }
            }
        }
    }
}

bool zrange(const Point* p){


    for(int i=0; i<4; i++){
        if(!(p[i].x>0&&p[i].x<480&&p[i].y>0&&p[i].y<480))
            return false;
        cout << "(" <<  p[i].x << "," << p[i].y << ")" << endl;
    }
    return true;
}

// the function draws all the squares in the image
static void drawSquares( Mat& image, const vector<vector<Point> >& squares )
{
    for( size_t i = 0; i < squares.size(); i++ )
    {
        const Point* p = &squares[i][0];
        int n = (int)squares[i].size();//actually n is always equals to 4
     //   polylines(image, &p, &n, 1, true, Scalar(0,255,0), 3, CV_AA);



        //read_barcode(Rect(p[0], p[2]));
      //  if(zrange(p))
       // {
            for(int j=0; j<4; j++){//使用line()函数替代polyline()函数画四边形
                line(image, p[j], p[(j+1)%4], Scalar( 255 ), 3, 8);
            }

       //     MatU imageROI=image(Rect(p[0], p[2]));
       //     MatU zcopy=Mat(imageROI);

      //      read_barcode(imageROI);
       //     addWeighted(imageROI,1.0,zcopy,0.3,0.,image);
        //    cout << endl;
      //  }
      //  vector<Point>approxedRectangle;
      //  approxPolyDP(squares[i], approxedRectangle, 0., true);
       // fillConvexPoly(image, &approxedRectangle[0], 4, 4);

      //  fillConvexPoly(Inputimage, inputarrayPoints, scalarColor, lineType, shift);


    }

    imshow(wndname, image);
}

int main(){

/*
    string msg="press q , Q or ESC to close this program";
    cout << msg << endl;
    VideoCapture capture(0);
    if(!capture.isOpened()) return 1;
    Mat image; //frame of video
    string window_name="Extracted Frame";
    namedWindow(window_name);
    while(true){
        capture >> image;
        vector<vector<Point> > squares;
        if(image.data){
            findSquares(image, squares);
            drawSquares(image, squares);
        }
        if(waitKey(30)>=0) break;
    }
    */
    MatU image=imread("C:/testdir/barcode11.jpg", 0);
    vector<vector<Point> > squares;
    findSquares(image, squares);
    drawSquares(image, squares);
   // read_barcode(image);
    waitKey(0);
/*

    Mat image=imread("C:/testdir/test1.jpg");
    Mat roi=image(Rect(20, 20, 100, 100));

    Mat mask=Mat(roi);
    cvtColor(mask, mask, CV_RGB2GRAY);

    addWeighted(roi, 1.0, mask, 0.3, 0., image);

    imshow("dfds", image);
    waitKey(0);

*/




    return 0;
}



/*

int main(){
    Mat image=imread("C:/testdir/barcode1.jpg");
    MatU logo=image(Rect(110, 200, 265, 230));

    read_barcode(logo);
    addWeighted(logo, 1.0, logo, 0.3, 0., logo);
    imshow("with logo", image);
    waitKey(0);


}

*/


/*------------------------------------------------------------------------------------------*\
   This file contains material supporting chapter 2 of the cookbook:
   Computer Vision Programming using the OpenCV Library.
   by Robert Laganiere, Packt Publishing, 2011.

   This program is free software; permission is hereby granted to use, copy, modify,
   and distribute this source code, or portions thereof, for any purpose, without fee,
   subject to the restriction that the copyright notice may not be removed
   or altered from any source or altered source distribution.
   The software is released on an as-is basis and without any warranties of any kind.
   In particular, the software is not guaranteed to be fault-tolerant or free from failure.
   The author disclaims all warranties with regard to this software, any use,
   and any consequent failure, is purely the responsibility of the user.

   Copyright (C) 2010-2011 Robert Laganiere, www.laganiere.name
\*------------------------------------------------------------------------------------------*/
/*

#include <vector>
#include <opencv2/core/core.hpp>
#include <opencv2/highgui/highgui.hpp>


int main()
{
    cv::Mat image1;
    cv::Mat image2;

    image1= cv::imread("C:/testdir/barcode1.jpg");
    image2= cv::imread("C:/testdir/barcode19.jpg");
    if (!image1.data)
        return 0;
    if (!image2.data)
        return 0;

    cv::namedWindow("Image 1");
    cv::imshow("Image 1",image1);
    cv::namedWindow("Image 2");
    cv::imshow("Image 2",image2);

    cv::Mat result;
    cv::addWeighted(image1,0.7,image2,0.9,0.,result);

    cv::namedWindow("result");
    cv::imshow("result",result);

    // using overloaded operator
    result= 0.7*image1+0.9*image2;

    cv::namedWindow("result with operators");
    cv::imshow("result with operators",result);
/*
    image2= cv::imread("rain.jpg",0);

    // create vector of 3 images
    std::vector<cv::Mat> planes;
    // split 1 3-channel image into 3 1-channel images
    cv::split(image1,planes);
    // add to blue channel
    planes[0]+= image2;
    // merge the 3 1-channel images into 1 3-channel image
    cv::merge(planes,result);

    cv::namedWindow("Result on blue channel");
    cv::imshow("Result on blue channel",result);

    // read images
    cv::Mat image= cv::imread("boldt.jpg");
    cv::Mat logo= cv::imread("logo.bmp");

    // define image ROI
    cv::Mat imageROI;
    imageROI= image(cv::Rect(385,270,logo.cols,logo.rows));

    // add logo to image
    cv::addWeighted(imageROI,1.0,logo,0.3,0.,imageROI);

    // show result
    cv::namedWindow("with logo");
    cv::imshow("with logo",image);

    // read images
    image= cv::imread("boldt.jpg");
    logo= cv::imread("logo.bmp");

    // define ROI
    imageROI= image(cv::Rect(385,270,logo.cols,logo.rows));

    // load the mask (must be gray-level)
    cv::Mat mask= cv::imread("logo.bmp",0);

    // copy to ROI with mask
    logo.copyTo(imageROI,mask);

    // show result
    cv::namedWindow("with logo 2");
    cv::imshow("with logo 2",image);

    // read images
    logo= cv::imread("logo.bmp",0);
    image1= cv::imread("boldt.jpg");

    // split 3-channel image into 3 1-channel images
    std::vector<cv::Mat> channels;
    cv::split(image1,channels);

    imageROI= channels.at(1);

    cv::addWeighted(imageROI(cv::Rect(385,270,logo.cols,logo.rows)),1.0,
                    logo,0.5,0.,imageROI(cv::Rect(385,270,logo.cols,logo.rows)));

    cv::merge(channels,image1);

    cv::namedWindow("with logo 3");
    cv::imshow("with logo 3",image1);

    cv::waitKey();

    return 0;
}





*/

 今天打开Qt发现Qt抽了。。程序一直报错。把复杂的程序都注释了只剩下读入和显示一张图片的代码结果仍然报错。我确实有清理过项目和重新构建项目。诶，蛋疼。重新建立一个工程写吧。。

代码：读入图片，检测、圈出并截图显示 ：宽度在50-280之间的矩形框

#include "opencv2/core/core.hpp"
#include "opencv2/imgproc/imgproc.hpp"
#include "opencv2/highgui/highgui.hpp"

#include <iostream>
#include <math.h>
#include <string.h>

using namespace cv;
using namespace std;


#define SPACE 0
#define BAR 255

typedef Mat_<uchar> MatU;
map<string, int> table[3];
enum position{LEFT,RIGHT};
int front;       //Æðʼ±àºÅ
int mode[6];    //²»Í¬µÄÆðʼ±àºÅ¶ÔÓ¦×Ų»Í¬µÄ×ó²à±àÂëģʽ£¬±ÈÈçÆðʼ±àºÅΪ6¶ÔÓ¦¡°ÆæżżżÆæÆ桱£¬9¶ÔÓ¦¡°ÆæżżÆæżÆ桱¡£ÓÃ1±íʾÆæÊý£¬0±íʾżÊý
const double eps=1e-5;
int z;

int get_front(){
    string tmp="";
    int i;
    for(i=0; i<6; i++){
        if(mode[i]==0) tmp=tmp+"0";
        else tmp=tmp+"1";
    }
    if(tmp=="000000") return 0;
    else if(tmp=="001011") return 1;
    else if(tmp=="001101") return 2;
    else if(tmp=="001110") return 3;
    else if(tmp=="010011") return 4;
    else if(tmp=="011001") return 5;
    else if(tmp=="011100") return 6;
    else if(tmp=="010101") return 7;
    else if(tmp=="010110") return 8;
    else if(tmp=="011010") return 9;
    else return -1;
}

void align_boundary(const MatU& img, Point& cur, int begin, int end){
    if (img(cur) == end){
        while (img(cur)==end)
            ++cur.x;
    }else{
        while (img(cur.y, cur.x-1)==begin)
            --cur.x;
    }
}

/*int read_digit(...)
 *·µ»Ø½âÎöºóµÃµ½µÄÊý×Ö*/
int read_digit(const MatU& img, Point& cur, int position){
    // Read the 7 consecutive bits.
    int pattern[4] = {0,0,0,0};
    int i;
    for (i=0; i<4; i++){
        int cur_val=img(cur);
        while(img(cur)==cur_val){
            ++pattern[i];
            ++cur.x;
        }
        cout << endl;
        cout << "pattern[" << i << "]=" << pattern[i] << endl;
        // See below for explanation.
/*        if ((pattern[i] == 1 && img(cur) == BAR) || (pattern[i] == unit_width - 1 && img(cur) == SPACE))
            --cur.x;*/
    }



    // Convert to binary, consider that a bit is set if the number of
    // bars encountered is greater than a threshold.
    double sum=pattern[0]+pattern[1]+pattern[2]+pattern[3];
    double tmp1=(pattern[0]+pattern[1])*1.0;
    double tmp2=(pattern[1]+pattern[2])*1.0;
    int at1, at2;
    if(tmp1/sum < 2.5/7)  at1=2;
    else if(tmp1/sum < 3.5/7) at1=3;
    else if(tmp1/sum < 4.5/7) at1=4;
    else at1=5;

    if(tmp2/sum < 2.5/7)  at2=2;
    else if(tmp2/sum < 3.5/7) at2=3;
    else if(tmp2/sum < 4.5/7) at2=4;
    else at2=5;

    int digit=-1;

    if(position==LEFT){
        if(at1==2){
            if(at2==2) {
                mode[z++]=0;
                digit = 6;
            }
            else if(at2==3) {
                mode[z++]=1;
                digit = 0;
            }
            else if(at2==4) {
                mode[z++]=0;
                digit = 4;
            }
            else if(at2==5) {
                mode[z++]=1;
                digit = 3;
            }
        }
        else if(at1==3){
            if(at2==2) {
                mode[z++]=1;
                digit = 9;
            }
            else if(at2==3) {
                mode[z++]=0;
                if(pattern[2]+1<pattern[3]) digit = 8;
                else digit = 2;
            }
            else if(at2==4) {
                mode[z++]=1;
                if(pattern[1]+1<pattern[2]) digit = 7;
                else digit = 1;
            }
            else if(at2==5) {
                mode[z++]=0;
                digit = 5;
            }
        }
        else if(at1==4){
            if(at2==2) {
                mode[z++]=0;
                digit = 9;
            }
            else if(at2==3) {
                mode[z++]=1;
                if(pattern[1]+1<pattern[0]) digit = 8;
                else digit = 2;
            }
            else if(at2==4) {
                mode[z++]=0;
                if(pattern[0]+1<pattern[1]) digit = 7;
                else digit = 1;
            }
            else if(at2==5) {
                mode[z++]=1;
                digit = 5;
            }
        }
        else if(at1==5){
            if(at2==2) {
                mode[z++]=1;
                digit = 6;
            }
            else if(at2==3) {
                mode[z++]=0;
                digit = 0;
            }
            else if(at2==4) {
                mode[z++]=1;
                digit = 4;
            }
            else if(at2==5) {
                mode[z++]=0;
                digit=3;
            }
        }
     //   align_boundary(img, cur, SPACE, BAR);
    }else{
        if(at1==2){
            if(at2==2) digit = 6;
            else if(at2==4) digit = 4;
        }
        else if(at1==3){
            if(at2==3) {
                if(pattern[2]+1<pattern[3]) digit = 8;
                else digit = 2;
            }
            else if(at2==5) digit = 5;
        }
        else if(at1==4){
            if(at2==2) digit = 9;
            else if(at2==4) {
                if(pattern[0]+1<pattern[1]) digit = 7;
                else digit = 1;
            }
        }
        else if(at1==5){
            if(at2==3) digit = 0;
            else if(at2==5) digit=3;
        }
     //   align_boundary(img, cur, SPACE, BAR);
    }
    cout << "digit=" << digit << endl;
    return digit;
}

void skip_quiet_zone(const MatU& img, Point& cur){//ÂÔ¹ý¿Õ°×ÇøÓò
    while (img(cur) == SPACE)
        ++cur.x;
}

void read_lguard(const MatU& img, Point& cur){//ͨ¹ý¶ÁÈ¡×ó²à¹Ì¶¨µÄ¡°Ìõ¿ÕÌõ¡±£¬»ñÈ¡µ¥Î»³¤¶È¡£
    int pattern[3] = { BAR, SPACE, BAR };
    for (int i=0; i<3; i++)
        while (img(cur)==pattern[i])
            ++cur.x;
}

void skip_mguard(const MatU& img, Point& cur){      //ÂÔ¹ý×ó²àÊý¾ÝºÍÓÒ²àÊý¾ÝÖ®¼äµÄ·Ö½ç
    int pattern[5] = { SPACE, BAR, SPACE, BAR, SPACE };
    for (int i=0; i<5; i++)
        while (img(cur)==pattern[i])
            ++cur.x;
}

bool isBar(MatU& img){
    Size size = img.size();
    Point cur(0, size.height / 2);
    int cnt=0;//count the number of BAR-and-SPACE regions
    if(img(cur)!=SPACE){
        cnt=0;
        return false;
    }else{
        while(img(cur)==SPACE)
            cur.x++;
        int statue=SPACE;
        while(cur.x<img.cols){
            if(img(cur)!=statue)
                cnt++;
            if(cnt>20) return true;
        }
        return false;
    }
}

void read_barcode(MatU& img/*const string& filename*/){      //¶ÁÈ¡ÌõÂëÖ÷³ÌÐò

  //  if(isBar(img)) //isBar():judge weather img is a barcode region or not
   //     return;

    z=0;
  //  MatU img = imread(filename, 0);         //ÔØÈëͼÏñ
    Size size = img.size();
    Point cur(0, size.height / 2);              //cur±íʾµ±Ç°Î»ÖÃ

    bitwise_not(img, img);
    threshold(img, img, 128, 255, THRESH_BINARY);

    if (img(cur) != SPACE) return;

    skip_quiet_zone(img, cur);

    read_lguard(img, cur);

    vector<int> digits;
    for (int i=0; i<6; i++){               //×ó²àÊý¾Ý½âÂë
        int d = read_digit(img, cur, LEFT);
        digits.push_back(d);
    }

    skip_mguard(img, cur);

    for (int i = 0; i < 6; i++){        //ÓÒ²àÊý¾Ý½âÂë
        int d = read_digit(img, cur, RIGHT);
        digits.push_back(d);
    }
  //  cout << front;                      //Êä³ö½âÂë½á¹û
    int front=get_front();
    cout << front << " ";
    for (int i = 0; i < 12; i++)
        cout << digits[i] << " ";
    cout << endl;
    //waitKey();
}

static void help()
{
    cout <<
    "\nA program using pyramid scaling, Canny, contours, contour simpification and\n"
    "memory storage (it's got it all folks) to find\n"
    "squares in a list of images pic1-6.png\n"
    "Returns sequence of squares detected on the image.\n"
    "the sequence is stored in the specified memory storage\n"
    "Call:\n"
    "./squares\n"
    "Using OpenCV version %s\n" << CV_VERSION << "\n" << endl;
}


int thresh = 50, N = 11;
const char* wndname = "Square Detection Demo";

// helper function:
// finds a cosine of angle between vectors
// from pt0->pt1 and from pt0->pt2
static double angle( Point pt1, Point pt2, Point pt0 )
{
    double dx1 = pt1.x - pt0.x;
    double dy1 = pt1.y - pt0.y;
    double dx2 = pt2.x - pt0.x;
    double dy2 = pt2.y - pt0.y;
    return (dx1*dx2 + dy1*dy2)/sqrt((dx1*dx1 + dy1*dy1)*(dx2*dx2 + dy2*dy2) + 1e-10);
}

// returns sequence of squares detected on the image.
// the sequence is stored in the specified memory storage
static void findSquares( const Mat& image, vector<vector<Point> >& squares )
{
    squares.clear();

    Mat pyr, timg, gray0(image.size(), CV_8U), gray;

    // down-scale and upscale the image to filter out the noise
    pyrDown(image, pyr, Size(image.cols/2, image.rows/2));
    pyrUp(pyr, timg, image.size());
    vector<vector<Point> > contours;

    // find squares in every color plane of the image
    for( int c = 0; c < 3; c++ )
    {
        int ch[] = {c, 0};
        mixChannels(&timg, 1, &gray0, 1, ch, 1);

        // try several threshold levels
        for( int l = 0; l < N; l++ )
        {
            // hack: use Canny instead of zero threshold level.
            // Canny helps to catch squares with gradient shading
            if( l == 0 )
            {
                // apply Canny. Take the upper threshold from slider
                // and set the lower to 0 (which forces edges merging)
                Canny(gray0, gray, 0, thresh, 5);
                // dilate canny output to remove potential
                // holes between edge segments
                dilate(gray, gray, Mat(), Point(-1,-1));
            }
            else
            {
                // apply threshold if l!=0:
                //     tgray(x,y) = gray(x,y) < (l+1)*255/N ? 255 : 0
                gray = gray0 >= (l+1)*255/N;
            }

            // find contours and store them all as a list
            findContours(gray, contours, CV_RETR_LIST, CV_CHAIN_APPROX_SIMPLE);

            vector<Point> approx;

            // test each contour
            for( size_t i = 0; i < contours.size(); i++ )
            {
                // approximate contour with accuracy proportional
                // to the contour perimeter
                approxPolyDP(Mat(contours[i]), approx, arcLength(Mat(contours[i]), true)*0.02, true);

                // square contours should have 4 vertices after approximation
                // relatively large area (to filter out noisy contours)
                // and be convex.
                // Note: absolute value of an area is used because
                // area may be positive or negative - in accordance with the
                // contour orientation
                if( approx.size() == 4 &&
                    fabs(contourArea(Mat(approx))) > 1000 &&
                    isContourConvex(Mat(approx)) )
                {
                    double maxCosine = 0;

                    for( int j = 2; j < 5; j++ )
                    {
                        // find the maximum cosine of the angle between joint edges
                        double cosine = fabs(angle(approx[j%4], approx[j-2], approx[j-1]));
                        maxCosine = MAX(maxCosine, cosine);
                    }

                    // if cosines of all angles are small
                    // (all angles are ~90 degree) then write quandrange
                    // vertices to resultant sequence
                    if( maxCosine < 0.3 )
                        squares.push_back(approx);
                }
            }
        }
    }
}

double dist(Point p1, const Point p2){
    return sqrt((p1.x-p2.x)*(p1.x-p2.x)+(p1.y-p2.y)*(p1.y-p2.y));
}

// the function draws all the squares in the image
static void drawSquares( Mat& image, const vector<vector<Point> >& squares )
{
    for( size_t i = 0; i < squares.size(); i++ )
    {
        const Point* p = &squares[i][0];
        double d1=dist(p[0], p[1]);
        double d2=dist(p[1], p[2]);
        if(d1<50 || d2<50 || d1>280 || d2>280) continue;//把宽度小于50和大于350的矩形过滤
        cout << dist(p[0], p[1]) << endl;
        cout << dist(p[1], p[2]) << endl;
        for(int j=0; j<4; j++){//使用line()函数替代polyline()函数画四边形
            line(image, p[j], p[(j+1)%4], Scalar( 255 ), 3, 8);
        }

        MatU imageROI=image(Rect(Point(p[1].x,p[1].y), Point(p[3].x, p[3].y)));
             MatU zcopy=Mat(imageROI);
             imshow("sdfds", zcopy);


             if(isBar(imageROI)){
                 cout << "yes" << endl;
                 read_barcode(imageROI);
                 addWeighted(imageROI,1.0,zcopy,0.3,0.,image);
             }

    }

    imshow(wndname, image);
}

int main(int /*argc*/, char** /*argv*/)
{
    help();
    namedWindow( wndname, 1 );
    vector<vector<Point> > squares;


    string imgname="C:/testdir/barcode1.jpg";
    Mat image = imread(imgname, 1);
    if( image.empty() ) return -1;

    findSquares(image, squares);
    drawSquares(image, squares);

    waitKey(0);
}