Revision as of 21:55, 25 July 2015 (view source) rosettacode>JimTheriot m (→‎{{header\|J}}) ← Older edit		Revision as of 22:09, 27 July 2015 (view source) rosettacode>JimTheriot m (→‎{{header\|J}}) Newer edit →
Line 673: =={{header\|J}}== <p>The image is represented as a 2D array of pixels, with first and second axes representing down and right respectively. Array elements represent monochromatic intensity values as integers ranging from 0 (black) to 255 (white). </p> <p>~~Intensity~~In the intensity gradient image, 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~~Detected edge and non-edge points are represented as ~~zeros~~ones and ~~ones~~zeros respectively. ~~Edges~~An ~~are~~edge ~~sets~~is a set of connected edge points~~. Edge~~ (points ~~within~~adjacent ahorizontally, ~~3-by-3~~vertically, or ~~region~~diagonally are considered to be connected). ~~Edges~~In ~~are~~the final image, each edge is represented asby ~~points~~assigning ~~having~~its set of points a common unique ~~identifier~~value. </p> <lang J>NB. 2D convolution, filtering, ...

Canny edge detector: Difference between revisions

Canny edge detector (view source)