From 26c0a434a8d2898187ef891424f7589b5de73b41 Mon Sep 17 00:00:00 2001
From: Gary Bradski <garybradski@gmail.com>
Date: Wed, 21 Jun 2017 06:28:48 +0000
Subject: [PATCH] example 19-04

---
 example_19-04.cpp | 74 +++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 74 insertions(+)
 create mode 100644 example_19-04.cpp

diff --git a/example_19-04.cpp b/example_19-04.cpp
new file mode 100644
index 0000000..9d9f1ac
--- /dev/null
+++ b/example_19-04.cpp
@@ -0,0 +1,74 @@
+// Example 19-4. Two-dimensional line fitting
+#include <opencv2/opencv.hpp>
+#include <iostream>
+#include <math.h>
+
+using namespace std;
+
+void help(char **argv) {
+  cout << "\nExample 19-04, two dimensional line fitting"
+       << "\nCall"
+       << "\n" << argv[0] << "\n"
+       << "\n 'q', 'Q' or ESC to quit"
+       << "\n" << endl;
+}
+
+int main(int argc, char **argv) {
+  cv::Mat img(500, 500, CV_8UC3);
+  cv::RNG rng(-1);
+  help(argv);
+  for (;;) {
+    char key;
+    int i, count = rng.uniform(0, 100) + 3, outliers = count / 5;
+    float a = (float)rng.uniform(0., 200.);
+    float b = (float)rng.uniform(0., 40.);
+    float angle = (float)rng.uniform(0., CV_PI);
+    float cos_a = cos(angle), sin_a = sin(angle);
+    cv::Point pt1, pt2;
+    vector<cv::Point> points(count);
+    cv::Vec4f line;
+    float d, t;
+    b = MIN(a * 0.3f, b);
+
+    // generate some points that are close to the line
+    for (i = 0; i < count - outliers; i++) {
+      float x = (float)rng.uniform(-1., 1.) * a;
+      float y = (float)rng.uniform(-1., 1.) * b;
+      points[i].x = cvRound(x * cos_a - y * sin_a + img.cols / 2);
+      points[i].y = cvRound(x * sin_a + y * cos_a + img.rows / 2);
+    }
+
+    // generate outlier points
+    for (; i < count; i++) {
+      points[i].x = rng.uniform(0, img.cols);
+      points[i].y = rng.uniform(0, img.rows);
+    }
+
+    // find the optimal line
+    cv::fitLine(points, line, cv::DIST_L1, 1, 0.001, 0.001);
+
+    // draw the points
+    img = cv::Scalar::all(0);
+    for (i = 0; i < count; i++)
+      cv::circle(img, points[i], 2,
+                 i < count - outliers ? cv::Scalar(0, 0, 255)
+                                      : cv::Scalar(0, 255, 255),
+                 cv::FILLED, CV_AA, 0);
+
+    // ... and the long enough line to cross the whole image
+    d = sqrt((double)line[0] * line[0] + (double)line[1] * line[1]);
+    line[0] /= d;
+    line[1] /= d;
+    t = (float)(img.cols + img.rows);
+    pt1.x = cvRound(line[2] - line[0] * t);
+    pt1.y = cvRound(line[3] - line[1] * t);
+    pt2.x = cvRound(line[2] + line[0] * t);
+    pt2.y = cvRound(line[3] + line[1] * t);
+    cv::line(img, pt1, pt2, cv::Scalar(0, 255, 0), 3, CV_AA, 0);
+    cv::imshow("Fit Line", img);
+    key = (char)cv::waitKey(0);
+    if (key == 27 || key == 'q' || key == 'Q') // 'ESC'
+      break;
+  }
+  return 0;
+}