title: Gradient direction computation
body: <p>I'm working on my task in computer vision course. One of sub-tasks is gradient direction computation based on image brightness. I've made a matrix bright[width][height] containing brightness values for every pixel of the image. And i have two such functions:</p>
  
  <pre><code>double Image::grad_x(int x,int y){
      if(x==width-1 || x==0) return bright[x][y];
      return bright[x+1][y]-bright[x-1][y];
  }
  double Image::grad_y(int x,int y){
      if(y==height-1 || y==0) return bright[x][y];
      return bright[x][y+1]-bright[x][y-1];
  }
  </code></pre>
  
  <p>EDIT: border check fixed</p>
  
  <p>I'm working with simple derivative, without using Sobel operator 'cause simple derivative is sufficient for my needs. </p>
  
  <p>The question is, am i doing this gradient computation right and what exactly do i have to do with border pixels(right now function returns value of the pixel itself, im not sure it's accurate)? And, by the way, is there any utility for computation of gradients of the image? I want to be sure my program is performing well.</p>