Note that there are some explanatory texts on larger screens.

plurals
  1. PO
    primarykey
    data
    text
    <blockquote> <p>The simplest case of Hough transform is the linear transform for detecting straight lines. In the image space, the straight line can be described as y = mx + b and can be graphically plotted for each pair of image points (x, y)</p> </blockquote> <p>So this tells you what <code>x</code> and <code>y</code> correspond to back in the image.</p> <blockquote> <p>In the Hough transform, a main idea is to consider the characteristics of the straight line not as image points (x1, y1), (x2, y2), ..., but instead, in terms of its parameters, such as the slope parameter m and the intercept parameter b.</p> <p>Based on that fact, the straight line y = mx + b can be represented as a point (b, m) in the parameter space. However, one faces the problem that vertical lines give rise to unbounded values of the parameters m and b. For computational reasons, it is therefore better to use a different pair of parameters, denoted and (theta), for the lines in the Hough transform.</p> <p>The parameter rho represents the distance between the line and the origin, while theta is the angle of the vector from the origin to this closest point.</p> </blockquote> <p>This tells you what <code>rho</code> and <code>theta</code> correspond to: they are the representation in polar coordinates of slope and intercept of the line you are trying to describe in your image.</p> <hr> <p>On <a href="http://cimg.cvs.sourceforge.net/cimg/CImg/examples/hough_transform.cpp?view=markup">SourceForge</a> you can find a <code>C++</code> implementation of hough transform.</p> <p>A description from which you should be able to interpret the code which I pointed out in the previous link may be the following:</p> <blockquote> <p>The Hough transform algorithm uses an array, called an accumulator, to detect the existence of a line y = mx + b.</p> <p>For example, the linear Hough transform problem has two unknown parameters: m and b.</p> <p>For each pixel and its neighborhood, the Hough transform algorithm determines if there is enough evidence of an edge at that pixel. If so, it will calculate the parameters of that line, and then look for the accumulator's bin that the parameters fall into, and increase the value of that bin.</p> <p>By finding the bins with the highest values, typically by looking for local maxima in the accumulator space, the most likely lines can be extracted</p> </blockquote>
    singulars
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    plurals
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. This table or related slice is empty.
    1. VO
      singulars
      1. This table or related slice is empty.
    2. VO
      singulars
      1. This table or related slice is empty.
    3. VO
      singulars
      1. This table or related slice is empty.
    1. This table or related slice is empty.
 

Querying!

 
Guidance

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload