answer_44.cpp

#include <opencv2/core.hpp>
#include <opencv2/highgui.hpp>
#include <iostream>
#include <math.h>


// RGB to Gray scale
cv::Mat BGR2GRAY(cv::Mat img){
  // get height and width
  int height = img.rows;
  int width = img.cols;
  int channel = img.channels();

  // prepare output
  cv::Mat out = cv::Mat::zeros(height, width, CV_8UC1);
  
  // BGR -> Gray
  for (int y = 0; y < height; y++){
    for (int x = 0; x < width; x++){
      out.at<uchar>(y, x) = (int)((float)img.at<cv::Vec3b>(y, x)[0] * 0.0722 + \
				  (float)img.at<cv::Vec3b>(y, x)[1] * 0.7152 + \
				  (float)img.at<cv::Vec3b>(y, x)[2] * 0.2126);
    }
  }
  return out;
}

float clip(float value, float min, float max){
  return fmin(fmax(value, 0), 255);
}

// gaussian filter
cv::Mat gaussian_filter(cv::Mat img, double sigma, int kernel_size){
  int height = img.rows;
  int width = img.cols;
  int channel = img.channels();

  // prepare output
  cv::Mat out = cv::Mat::zeros(height, width, CV_8UC3);
  if (channel == 1) {
    out = cv::Mat::zeros(height, width, CV_8UC1);
  }

  // prepare kernel
  int pad = floor(kernel_size / 2);
  int _x = 0, _y = 0;
  double kernel_sum = 0;
  
  // get gaussian kernel
  float kernel[kernel_size][kernel_size];

  for (int y = 0; y < kernel_size; y++){
    for (int x = 0; x < kernel_size; x++){
      _y = y - pad;
      _x = x - pad; 
      kernel[y][x] = 1 / (2 * M_PI * sigma * sigma) * exp( - (_x * _x + _y * _y) / (2 * sigma * sigma));
      kernel_sum += kernel[y][x];
    }
  }

  for (int y = 0; y < kernel_size; y++){
    for (int x = 0; x < kernel_size; x++){
      kernel[y][x] /= kernel_sum;
    }
  }

  // filtering
  double v = 0;
  
  for (int y = 0; y < height; y++){
    for (int x = 0; x < width; x++){
      // for BGR
      if (channel == 3){
        for (int c = 0; c < channel; c++){
          v = 0;
          for (int dy = -pad; dy < pad + 1; dy++){
            for (int dx = -pad; dx < pad + 1; dx++){
              if (((x + dx) >= 0) && ((y + dy) >= 0) && ((x + dx) < width) && ((y + dy) < height)){
                v += (double)img.at<cv::Vec3b>(y + dy, x + dx)[c] * kernel[dy + pad][dx + pad];
              }
            }
          }
          out.at<cv::Vec3b>(y, x)[c] = (uchar)clip(v, 0, 255);
        }
      } else {
        // for Gray
        v = 0;
        for (int dy = -pad; dy < pad + 1; dy++){
          for (int dx = -pad; dx < pad + 1; dx++){
            if (((x + dx) >= 0) && ((y + dy) >= 0) && ((x + dx) < width) && ((y + dy) < height)){
              v += (double)img.at<uchar>(y + dy, x + dx) * kernel[dy + pad][dx + pad];
            }
          }
        }
        out.at<uchar>(y, x) = (uchar)clip(v, 0, 255);
      }
    }
  }
  return out;
}

// Sobel filter
cv::Mat sobel_filter(cv::Mat img, int kernel_size, bool horizontal){
  int height = img.rows;
  int width = img.cols;
  int channel = img.channels();

  // prepare output
  cv::Mat out = cv::Mat::zeros(height, width, CV_8UC1);

  // prepare kernel
  double kernel[kernel_size][kernel_size] = {{1, 2, 1}, {0, 0, 0}, {-1, -2, -1}};

  if (horizontal){
    kernel[0][1] = 0;
    kernel[0][2] = -1;
    kernel[1][0] = 2;
    kernel[1][2] = -2;
    kernel[2][0] = 1;
    kernel[2][1] = 0;
  }

  int pad = floor(kernel_size / 2);

  double v = 0;

  // filtering  
  for (int y = 0; y < height; y++){
    for (int x = 0; x < width; x++){
      v = 0;
      for (int dy = -pad; dy < pad + 1; dy++){
        for (int dx = -pad; dx < pad + 1; dx++){
          if (((y + dy) >= 0) && (( x + dx) >= 0) && ((y + dy) < height) && ((x + dx) < width)){
            v += (double)img.at<uchar>(y + dy, x + dx) * kernel[dy + pad][dx + pad];
          }
        }
      }
      out.at<uchar>(y, x) = (uchar)clip(v, 0, 255);
    }
  }
  return out;
}

// get edge
cv::Mat get_edge(cv::Mat fx, cv::Mat fy){
  // get height and width
  int height = fx.rows;
  int width = fx.cols;

  // prepare output
  cv::Mat out = cv::Mat::zeros(height, width, CV_8UC1);

  double _fx, _fy;

  for(int y = 0; y < height; y++){
    for(int x = 0; x < width; x++){
      _fx = (double)fx.at<uchar>(y, x);
      _fy = (double)fy.at<uchar>(y, x);

      out.at<uchar>(y, x) = (uchar)clip(sqrt(_fx * _fx + _fy * _fy), 0, 255);
    }
  }

  return out;
}

// get angle
cv::Mat get_angle(cv::Mat fx, cv::Mat fy){
  // get height and width
  int height = fx.rows;
  int width = fx.cols;

  // prepare output
  cv::Mat out = cv::Mat::zeros(height, width, CV_8UC1);

  double _fx, _fy;
  double angle;

  for(int y = 0; y < height; y++){
    for(int x = 0; x < width; x++){
      _fx = fmax((double)fx.at<uchar>(y, x), 0.000001);
      _fy = (double)fy.at<uchar>(y, x);

      angle = atan2(_fy, _fx);
      angle = angle / M_PI * 180;

      if(angle < -22.5){
        angle = 180 + angle;
      } else if (angle >= 157.5) {
        angle = angle - 180;
      }

      // quantization
      if (angle <= 22.5){
        out.at<uchar>(y, x) = 0;
      } else if (angle <= 67.5){
        out.at<uchar>(y, x) = 45;
      } else if (angle <= 112.5){
        out.at<uchar>(y, x) = 90;
      } else {
        out.at<uchar>(y, x) = 135;
      }
    }
  }

  return out;
}


// non maximum suppression
cv::Mat non_maximum_suppression(cv::Mat angle, cv::Mat edge){
  int height = angle.rows;
  int width = angle.cols;
  int channel = angle.channels();

  int dx1, dx2, dy1, dy2;
  int now_angle;

  // prepare output
  cv::Mat _edge = cv::Mat::zeros(height, width, CV_8UC1);

  for (int y = 0; y < height; y++){
    for (int x = 0; x < width; x++){
      now_angle = angle.at<uchar>(y, x);
      // angle condition
      if (now_angle == 0){
        dx1 = -1;
        dy1 = 0;
        dx2 = 1;
        dy2 = 0;
      } else if(now_angle == 45) {
        dx1 = -1;
        dy1 = 1;
        dx2 = 1;
        dy2 = -1;
      } else if(now_angle == 90){
        dx1 = 0;
        dy1 = -1;
        dx2 = 0;
        dy2 = 1;
      } else {
        dx1 = -1;
        dy1 = -1;
        dx2 = 1;
        dy2 = 1;
      }

      if (x == 0){
        dx1 = fmax(dx1, 0);
        dx2 = fmax(dx2, 0);
      }
      if (x == (width - 1)){
        dx1 = fmin(dx1, 0);
        dx2 = fmin(dx2, 0);
      }
      if (y == 0){
        dy1 = fmax(dy1, 0);
        dy2 = fmax(dy2, 0);
      }
      if (y == (height - 1)){
        dy1 = fmin(dy1, 0);
        dy2 = fmin(dy2, 0);
      }

      // if pixel is max among adjuscent pixels, pixel is kept
      if (fmax(fmax(edge.at<uchar>(y, x), edge.at<uchar>(y + dy1, x + dx1)), edge.at<uchar>(y + dy2, x + dx2)) == edge.at<uchar>(y, x)) {
        _edge.at<uchar>(y, x) = edge.at<uchar>(y, x);
      }
    }
  }

  return _edge;
}

// histerisis
cv::Mat histerisis(cv::Mat edge, int HT, int LT){
  int height = edge.rows;
  int width = edge.cols;
  int channle = edge.channels();

  // prepare output
  cv::Mat _edge = cv::Mat::zeros(height, width, CV_8UC1);

  int now_pixel;

  for (int y = 0; y < height; y++){
    for (int x = 0; x < width; x++){
      // get pixel
      now_pixel = edge.at<uchar>(y, x);

      // if pixel >= HT
      if (now_pixel >= HT){
        _edge.at<uchar>(y, x) = 255;
      } 
      // if LT < pixel < HT
      else if (now_pixel > LT) {
        for (int dy = -1; dy < 2; dy++){
          for (int dx = -1; dx < 2; dx++){
            // if 8 nearest neighbor pixel >= HT
            if (edge.at<uchar>(fmin(fmax(y + dy, 0), 255), fmin(fmax(x + dx, 0), 255)) >= HT){
              _edge.at<uchar>(y, x) = 255;
            }
          }
        }
      }
    }
  }
  return _edge;
}


// Canny
cv::Mat Canny(cv::Mat img){
  // BGR -> Gray
  cv::Mat gray = BGR2GRAY(img);

  // gaussian filter
  cv::Mat gaussian = gaussian_filter(gray, 1.4, 5);

  // sobel filter (vertical)
  cv::Mat fy = sobel_filter(gaussian, 3, false);

  // sobel filter (horizontal)
  cv::Mat fx = sobel_filter(gaussian, 3, true);

  // get edge
  cv::Mat edge = get_edge(fx, fy);

  // get angle
  cv::Mat angle = get_angle(fx, fy);

  // edge non-maximum suppression
  edge = non_maximum_suppression(angle, edge);

  // histerisis
  edge = histerisis(edge, 100, 30);

  return edge;
}



//------
// hough

const int ANGLE_T = 180;
const int RHO_MAX = 320;

// hough table
struct struct_hough_table {
  int table[RHO_MAX * 2][ANGLE_T];
};

// hough vote
struct_hough_table Hough_vote(struct_hough_table hough_table, cv::Mat img){
  int height = img.rows;
  int width = img.cols;
  int rho = 0;
  double angle = 0;

  for (int y = 0; y < height; y++){
    for (int x = 0; x < width; x++){

      // if not edge, skip
      if (img.at<uchar>(y, x) != 255){
        continue;
      }

      // 0 <= angle t < 180
      for (int t = 0; t < ANGLE_T; t++){
        angle = M_PI / 180 * t;
        rho = (int)(x * cos(angle) + y * sin(angle));
        hough_table.table[rho + RHO_MAX][t] ++;
      }
    }
  }

  return hough_table;
}

// hough nms
struct_hough_table Hough_NMS(struct_hough_table hough_table){
  // output hough table
  struct_hough_table output_hough_table;

  // initialize 0
  for (int rho = 0; rho < RHO_MAX * 2; rho++){
    for (int t = 0; t < ANGLE_T; t++){ 
      output_hough_table.table[rho][t] = 0;
    }
  }


  // top N x, y
  int N = 30;
  int top_N_rho[N], top_N_t[N], top_N_vote[N];
  int tmp_rho, tmp_t, tmp_vote, tmp_rho2, tmp_t2, tmp_vote2;
  int rho, t;

  for (int n = 0; n < N; n++){
    top_N_rho[n] = -1;
    top_N_t[n] = -1;
    top_N_vote[n] = -1;
  }

  for (int rho = 0; rho < RHO_MAX * 2; rho++){
    for (int t = 0; t < ANGLE_T; t++){
      if (hough_table.table[rho][t] == 0){
        continue;
      }

      // compare to left top
      if (((t - 1) >= 0) && ((rho - 1) >= 0)){
        if (hough_table.table[rho][t] < hough_table.table[rho - 1][t - 1]){
          continue;
        }
      }

      // comparet to top
      if ((rho - 1) >= 0){
        if (hough_table.table[rho][t] < hough_table.table[rho - 1][t]){
          continue;
        }
      }

      // compare to left top
      if (((t + 1) < ANGLE_T) && ((rho - 1) >= 0)){
        if (hough_table.table[rho][t] < hough_table.table[rho - 1][t + 1]){
          continue;
        }
      }

      // compare to left
      if ((t - 1) >= 0){
        if (hough_table.table[rho][t] < hough_table.table[rho][t - 1]){
          continue;
        }
      }

      // compare to right
      if ((t + 1) < ANGLE_T){
        if (hough_table.table[rho][t] < hough_table.table[rho][t + 1]){
          continue;
        }
      }

      // compare to left bottom
      if (((t - 1) >= 0) && ((rho + 1) < RHO_MAX * 2)){
        if (hough_table.table[rho][t] < hough_table.table[rho + 1][t - 1]){
          continue;
        }
      }

      // compare to bottom
      if ((rho + 1) < RHO_MAX * 2){
        if (hough_table.table[rho][t] < hough_table.table[rho + 1][t]){
          continue;
        }
      }

      // compare to right bottom
      if (((t + 1) < ANGLE_T) && ((rho + 1) < RHO_MAX * 2)){
        if (hough_table.table[rho][t] < hough_table.table[rho + 1][t + 1]){
          continue;
        }
      }

      // Select top N votes
      for (int n = 0; n < N; n++){
        if (top_N_vote[n] <= hough_table.table[rho][t]){
          tmp_vote = top_N_vote[n];
          tmp_rho = top_N_rho[n];
          tmp_t = top_N_t[n];
          top_N_vote[n] = hough_table.table[rho][t];
          top_N_rho[n] = rho;
          top_N_t[n] = t;

          for (int m = n + 1; m < N - 1; m++){
            tmp_vote2 = top_N_vote[m];
            tmp_rho2 = top_N_rho[m];
            tmp_t2 = top_N_t[m];
            top_N_vote[m] = tmp_vote;
            top_N_rho[m] = tmp_rho;
            top_N_t[m] = tmp_t;
            tmp_vote = tmp_vote2;
            tmp_rho = tmp_rho2;
            tmp_t = tmp_t2;
          }

          top_N_vote[N - 1] = tmp_vote;
          top_N_rho[N - 1] = tmp_rho;
          top_N_t[N - 1] = tmp_t;
          break;
        }
      }
    }
  }

  // get pixel for top N votes
  for (int n = 0; n < N; n++){
    if (top_N_rho[n] == -1){
      break;
    }
    rho = top_N_rho[n];
    t = top_N_t[n];
    output_hough_table.table[rho][t] = hough_table.table[rho][t];
  }

  return output_hough_table;
}

// Inverse hough transformation
cv::Mat Hough_inverse(struct_hough_table hough_table, cv::Mat img){
  int height = img.rows;
  int width = img.cols;

  double _cos, _sin;
  int y, x;

  for (int rho = 0; rho < RHO_MAX * 2; rho++){
    for (int t = 0; t < ANGLE_T; t++){
      // if not vote, skip
      if (hough_table.table[rho][t] < 1){
        continue;
      }

      _cos = cos(t * M_PI / 180);
      _sin = sin(t * M_PI / 180);

      if ((_sin == 0) || (_cos == 0)){
        continue;
      }

      for (int x = 0; x < width; x++){
        y = (int)(- _cos / _sin * x + (rho - RHO_MAX) / _sin);
        
        if ((y >= 0) && (y < height)){
          img.at<cv::Vec3b>(y, x) = cv::Vec3b(0, 0, 255);
        }
      }

      for (int y = 0; y < height; y++){
        x = (int)(- _sin / _cos * y + (rho - RHO_MAX) / _cos);

        if ((x >= 0) && (x < width)){
          img.at<cv::Vec3b>(y, x) = cv::Vec3b(0, 0, 255);
        }
      }
    }
  }

  return img;
}

// hough step 2
int Hough_line(cv::Mat img){
  // get edge by canny
  cv::Mat edge = Canny(img);

  // hough
  struct_hough_table hough_table;

  // initialize 0
  for (int rho = 0; rho < RHO_MAX * 2; rho++){
    for (int t = 0; t < ANGLE_T; t++){
      hough_table.table[rho][t] = 0;
    }
  }

  // hough vote
  hough_table = Hough_vote(hough_table, edge);

  return 0;
}


int main(int argc, const char* argv[]){
  // read image
  cv::Mat img = cv::imread("thorino.jpg", cv::IMREAD_COLOR);

  // Hough line detection
  Hough_line(img);

  return 0;
}