//
// Created by on 2024/3/4.
//
#include "project.h"
void printf_show(vector<vector<Point>> contours_)
{
for (size_t i = 0; i < contours_.size(); ++i) {
std::cout << "Contour:" << std::endl;
const std::vector<cv::Point>& contour = contours_[i];
for (size_t j = 0; j < contour.size(); ++j) {
const cv::Point& point = contour[j];
std::cout << "Point " << j << ": x = " << point.x << ", y = " << point.y << std::endl;
}
// 打印轮廓的总点数
std::cout << "Total points: " << contour.size() << std::endl;
// 打印轮廓的边界框坐标
cv::Rect bounding_box = cv::boundingRect(contour);
std::cout << "Bounding box - x: " << bounding_box.x << ", y: " << bounding_box.y << ", w: " << bounding_box.width << ", h: " << bounding_box.height << std::endl;
std::cout << std::endl;
}
}
vector<vector<Point>> sortContours(vector<vector<Point>>& cnt_s, string method)
{
int reverse = 0;
if (method == "left-sort") {
reverse = 1;
}
vector<Rect> bounding_boxs;
for (auto& cnn : cnt_s) {
// 计算轮廓的外接矩形
bounding_boxs.push_back(cv::boundingRect(cnn));
}
std::sort(bounding_boxs.begin(), bounding_boxs.end(), [&](const cv::Rect& a, const cv::Rect& b) {
return a.tl().y < b.tl().y;
});
std::vector<std::vector<cv::Point>> sorted_cnt_s;
for (const auto& bb : bounding_boxs) {
sorted_cnt_s.push_back(cnt_s[&bb - &bounding_boxs[0]]);
}
if (reverse) {
std::reverse(sorted_cnt_s.begin(), sorted_cnt_s.end());
}
return sorted_cnt_s;
}
/*
cv::THRESH_BINARY:
这是最常用的二值化方法。对于每个像素,如果其值大于阈值,则将其设置为最大二值化值;否则,将其设置为0。
cv::THRESH_BINARY_INV:
这是cv::THRESH_BINARY方法的反向版本。对于每个像素,如果其值大于阈值,则将其设置为0;否则,将其设置为最大二值化值。
cv::THRESH_TRUNC:
这种方法将大于阈值的像素值截断为阈值,而保留小于等于阈值的像素值。
cv::THRESH_TOZERO:
这种方法将小于等于阈值的像素值设置为0,而保留大于阈值的像素值。
cv::THRESH_TOZERO_INV:
这是cv::THRESH_TOZERO方法的反向版本。对于每个像素,如果其值大于阈值,则保持像素值不变;否则,将其设置为0。
*/
void cv_project1()
{
Mat src = imread("/Users/zhulei/CLionProjects/opencv_test/ocr_a_reference.png");
Mat ref_gray, binimg;
cvtColor(src, ref_gray, cv::COLOR_BGR2GRAY);
// 二值化操作
// 大于10的都为0,小于10,设置为255
threshold(ref_gray, binimg, 10, 255, cv::THRESH_BINARY_INV);
vector<vector<Point>> contours_;
findContours(binimg.clone(), contours_, cv::RETR_EXTERNAL, cv::CHAIN_APPROX_SIMPLE);
Mat img_contours = src.clone();
// -1表示绘制所有,2表示线宽度
drawContours(img_contours, contours_, -1, Scalar(0, 255, 0), 2);
printf_show(contours_);
cv::imshow("Binary Image", img_contours);
// 对轮廓点从左到右进行排序
vector<vector<Point>> sort_res = sortContours(contours_, "left-sort");
//vector<Mat> digits(sort_res.size());
// 计算轮廓的外接矩形,取出矩形对应图像中的区域,存储到map中
// 索引为当前图像对应的数字
std::map<std::string, cv::Mat> digits;
for (int i = 0; i < sort_res.size(); i++) {
Rect boundingRect = cv::boundingRect(sort_res[i]);
int x = boundingRect.x;
int y = boundingRect.y;
int w = boundingRect.width;
int h = boundingRect.height;
cout << "x:" << x << " y:" << y << " w:" << w << " h:" << h << endl;
Mat roi = binimg(Rect(x, y, w, h));
resize(roi, roi, Size(57, 88));
digits.insert(std::make_pair(to_string(i), roi.clone()));
imshow("1", roi);
waitKey(100);
}
Mat rect_Kernel = getStructuringElement(MORPH_RECT, Size(9, 3));
Mat square_Kernel = getStructuringElement(MORPH_RECT, Size(5, 5));
// 读取信用卡图片
Mat img_car = imread("/Users/zhulei/CLionProjects/opencv_test/credit_card_01.png");
Mat img_resize, img_gray;
float img_ratio = (300 / (float)img_car.cols);
cout << "img_ratio:" << img_ratio << endl;
resize(img_car, img_resize, Size(300, (img_ratio * img_car.rows)));
cvtColor(img_resize, img_gray, cv::COLOR_BGR2GRAY);
imshow("new", img_gray);
waitKey(1000);
// 礼貌计算突明亮区域
Mat morpho, image_gradx;
morphologyEx(img_gray, morpho, MORPH_TOPHAT, rect_Kernel);
Sobel(morpho, image_gradx, CV_32F, 1, 0, -1);
image_gradx = cv::abs(image_gradx);
double minv, maxv;
minMaxLoc(image_gradx, &minv, &maxv);
cout << "minv:" << minv << " " << maxv << endl;
image_gradx = (255 * ((image_gradx - minv) / (maxv - minv)));
image_gradx.convertTo(image_gradx, CV_8UC1);
// 闭操作
Mat image_CLOSE, image_thresh;
morphologyEx(image_gradx, image_CLOSE, MORPH_CLOSE, square_Kernel);
imshow("闭操作", image_CLOSE);
waitKey(2000);
cout << "image_CLOSE:" << image_CLOSE.type() << "image_gradx:" << image_gradx.type() << endl;
// 自动寻找阈值
// THRESH_OTSU 会自动寻找合适的阈值,适合双峰,需把阈值参数设置为0。
threshold(image_CLOSE, image_thresh, 10, 255, THRESH_BINARY | THRESH_OTSU);
// (二次)闭操作,将四个连在一起的数字进行填充形成一个整体。
Mat image_2_dilate, image_1_erode, image_2_CLOSE;
dilate(image_thresh, image_2_dilate, square_Kernel, Point(-1, -1), 2); // 膨胀(迭代次数2次)
erode(image_2_dilate, image_1_erode, square_Kernel, Point(-1, -1), 1); // 腐蚀(迭代次数1次)
image_2_CLOSE = image_1_erode;
// 轮廓检测
vector<vector<Point>> threshCnts;
findContours(image_2_CLOSE.clone(), threshCnts, RETR_EXTERNAL, CHAIN_APPROX_SIMPLE);
Mat image_Contours = img_resize.clone();
drawContours(image_Contours, threshCnts, -1, (0, 0, 255), 3);
imshow("nn", image_Contours);
waitKey(2000);
vector<Rect> locs;
cout << "threshCnts:" << threshCnts.size();
for (int i = 0; i < threshCnts.size(); i++) {
auto& c = threshCnts[i];
Rect rect = cv::boundingRect(c);
int x = rect.x;
int y = rect.y;
int w = rect.width;
int h = rect.height;
float ar = static_cast<float>(w) / h;
if (2.0 < ar && ar < 4.0) {
if (35 < w && w < 60 && 10 < h && h < 20) {
cout << "rect:" << rect << endl;
locs.push_back(rect);
}
}
}
sort(locs.begin(), locs.end(), [](const Rect& r1, const Rect& r2) {
return r1.x < r2.x;
});
cout << "locs:" << locs.size() << endl;
for (int i = 0; i < locs.size(); i++) {
std::vector<std::string> groupOutput;
int gx = locs[i].x;
int gy = locs[i].y;
int gw = locs[i].width;
int gh = locs[i].height;
vector<string> grououtput;
// 根据坐标提取每一个组(将每个轮廓的结果放大一些,避免信息丢失)
Mat group_digit = img_gray(Rect(gx - 5, gy - 5, gw + 10, gh + 10));
Mat group_digit_th;
threshold(group_digit, group_digit_th, 0, 255, cv::THRESH_BINARY | cv::THRESH_OTSU);
vector<vector<Point>> digitCnts;
findContours(group_digit_th.clone(), digitCnts, cv::RETR_EXTERNAL, cv::CHAIN_APPROX_SIMPLE);
// 对轮廓进行排序
std::sort(digitCnts.begin(), digitCnts.end(), [](const std::vector<cv::Point>& c1, const std::vector<cv::Point>& c2) {
cv::Rect rect1 = cv::boundingRect(c1);
cv::Rect rect2 = cv::boundingRect(c2);
return rect1.x < rect2.x;
});
// 计算每一组中的每一个数值
for (const auto& jj : digitCnts) {
cv::Rect rect = cv::boundingRect(jj);
cv::Mat roi = group_digit(rect);
cv::resize(roi, roi, cv::Size(57, 88));
cv::imshow("Image", roi);
cv::waitKey(200);
std::vector<double> scores;
// 遍历,模板map
for (const auto& digit : digits) {
cv::Mat result;
cv::matchTemplate(roi, digit.second, result, cv::TM_CCOEFF);
double max_score;
cv::minMaxLoc(result, nullptr, &max_score);
scores.push_back(max_score);
}
cout << "数字:" << std::to_string(std::distance(scores.begin(), std::max_element(scores.begin(), scores.end())));
groupOutput.push_back(std::to_string(std::distance(scores.begin(), std::max_element(scores.begin(), scores.end()))));
}
cv::rectangle(img_resize, cv::Point(gx - 5, gy - 5), cv::Point(gx + gw + 5, gy + gh + 5), cv::Scalar(0, 0, 255), 1);
// cv::putText(img_resize, std::accumulate(groupOutput.begin(), groupOutput.end(), std::string("")), cv::Point(gx, gy - 15), cv::FONT_HERSHEY_SIMPLEX, 0.65, cv::Scalar(0, 0, 255), 2);
}
cout << "end!!!" << endl;
cv::waitKey(0);
}
- 1.
- 2.
- 3.
- 4.
- 5.
- 6.
- 7.
- 8.
- 9.
- 10.
- 11.
- 12.
- 13.
- 14.
- 15.
- 16.
- 17.
- 18.
- 19.
- 20.
- 21.
- 22.
- 23.
- 24.
- 25.
- 26.
- 27.
- 28.
- 29.
- 30.
- 31.
- 32.
- 33.
- 34.
- 35.
- 36.
- 37.
- 38.
- 39.
- 40.
- 41.
- 42.
- 43.
- 44.
- 45.
- 46.
- 47.
- 48.
- 49.
- 50.
- 51.
- 52.
- 53.
- 54.
- 55.
- 56.
- 57.
- 58.
- 59.
- 60.
- 61.
- 62.
- 63.
- 64.
- 65.
- 66.
- 67.
- 68.
- 69.
- 70.
- 71.
- 72.
- 73.
- 74.
- 75.
- 76.
- 77.
- 78.
- 79.
- 80.
- 81.
- 82.
- 83.
- 84.
- 85.
- 86.
- 87.
- 88.
- 89.
- 90.
- 91.
- 92.
- 93.
- 94.
- 95.
- 96.
- 97.
- 98.
- 99.
- 100.
- 101.
- 102.
- 103.
- 104.
- 105.
- 106.
- 107.
- 108.
- 109.
- 110.
- 111.
- 112.
- 113.
- 114.
- 115.
- 116.
- 117.
- 118.
- 119.
- 120.
- 121.
- 122.
- 123.
- 124.
- 125.
- 126.
- 127.
- 128.
- 129.
- 130.
- 131.
- 132.
- 133.
- 134.
- 135.
- 136.
- 137.
- 138.
- 139.
- 140.
- 141.
- 142.
- 143.
- 144.
- 145.
- 146.
- 147.
- 148.
- 149.
- 150.
- 151.
- 152.
- 153.
- 154.
- 155.
- 156.
- 157.
- 158.
- 159.
- 160.
- 161.
- 162.
- 163.
- 164.
- 165.
- 166.
- 167.
- 168.
- 169.
- 170.
- 171.
- 172.
- 173.
- 174.
- 175.
- 176.
- 177.
- 178.
- 179.
- 180.
- 181.
- 182.
- 183.
- 184.
- 185.
- 186.
- 187.
- 188.
- 189.
- 190.
- 191.
- 192.
- 193.
- 194.
- 195.
- 196.
- 197.
- 198.
- 199.
- 200.
- 201.
- 202.
- 203.
- 204.
- 205.
- 206.
- 207.
- 208.
- 209.
- 210.
- 211.
- 212.
- 213.
- 214.
- 215.
- 216.
- 217.
- 218.
- 219.
- 220.
- 221.
- 222.
- 223.
- 224.
- 225.
- 226.
- 227.
- 228.
- 229.
- 230.
- 231.
- 232.
- 233.
- 234.
- 235.
- 236.
- 237.