Canny edge detector: Difference between revisions
Content added Content deleted
Line 675: | Line 675: | ||
<p>Intensity gradient fields are similarly structured. Gradient values are vectors, and are represented here as complex numbers, with real and imaginary components representing down and right respectively. </p> |
<p>Intensity gradient fields are similarly structured. Gradient values are vectors, and are represented here as complex numbers, with real and imaginary components representing down and right respectively. </p> |
||
<p>Edge and non-edge points are represented as zeros and ones respectively. Edges are sets of connected points. Edge points within a 3-by-3 region are considered to be connected. Edges are represented as points having a common unique identifier. </p> |
<p>Edge and non-edge points are represented as zeros and ones respectively. Edges are sets of connected points. Edge points within a 3-by-3 region are considered to be connected. Edges are represented as points having a common unique identifier. </p> |
||
<ul>ToDo: |
|||
<li>figure out how to upload the images</li> |
|||
<li>generate gaussian filter for given sigma</li> |
|||
</ul> |
|||
<lang J>NB. 2D convolution, filtering, ... |
<lang J>NB. 2D convolution, filtering, ... |
||