canny.cpp 18.2 KB
Newer Older
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42
/*M///////////////////////////////////////////////////////////////////////////////////////
//
//  IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
//
//  By downloading, copying, installing or using the software you agree to this license.
//  If you do not agree to this license, do not download, install,
//  copy or use the software.
//
//
//                        Intel License Agreement
//                For Open Source Computer Vision Library
//
// Copyright (C) 2000, Intel Corporation, all rights reserved.
// Third party copyrights are property of their respective owners.
//
// Redistribution and use in source and binary forms, with or without modification,
// are permitted provided that the following conditions are met:
//
//   * Redistribution's of source code must retain the above copyright notice,
//     this list of conditions and the following disclaimer.
//
//   * Redistribution's in binary form must reproduce the above copyright notice,
//     this list of conditions and the following disclaimer in the documentation
//     and/or other materials provided with the distribution.
//
//   * The name of Intel Corporation may not be used to endorse or promote products
//     derived from this software without specific prior written permission.
//
// This software is provided by the copyright holders and contributors "as is" and
// any express or implied warranties, including, but not limited to, the implied
// warranties of merchantability and fitness for a particular purpose are disclaimed.
// In no event shall the Intel Corporation or contributors be liable for any direct,
// indirect, incidental, special, exemplary, or consequential damages
// (including, but not limited to, procurement of substitute goods or services;
// loss of use, data, or profits; or business interruption) however caused
// and on any theory of liability, whether in contract, strict liability,
// or tort (including negligence or otherwise) arising in any way out of
// the use of this software, even if advised of the possibility of such damage.
//
//M*/

#include "precomp.hpp"
A
Alexander Alekhin 已提交
43
#include "opencl_kernels_imgproc.hpp"
44

45

46 47 48 49 50
#if defined (HAVE_IPP) && (IPP_VERSION_MAJOR >= 7)
#define USE_IPP_CANNY 1
#else
#undef USE_IPP_CANNY
#endif
51

I
Ilya Lavrenov 已提交
52

53 54
namespace cv
{
I
Ilya Lavrenov 已提交
55 56

#ifdef USE_IPP_CANNY
57 58 59 60 61
static bool ippCanny(const Mat& _src, Mat& _dst, float low,  float high)
{
    int size = 0, size1 = 0;
    IppiSize roi = { _src.cols, _src.rows };

I
Ilya Lavrenov 已提交
62 63 64 65
    if (ippiFilterSobelNegVertGetBufferSize_8u16s_C1R(roi, ippMskSize3x3, &size) < 0)
        return false;
    if (ippiFilterSobelHorizGetBufferSize_8u16s_C1R(roi, ippMskSize3x3, &size1) < 0)
        return false;
66
    size = std::max(size, size1);
I
Ilya Lavrenov 已提交
67 68 69

    if (ippiCannyGetSize(roi, &size1) < 0)
        return false;
70 71 72 73 74 75
    size = std::max(size, size1);

    AutoBuffer<uchar> buf(size + 64);
    uchar* buffer = alignPtr((uchar*)buf, 32);

    Mat _dx(_src.rows, _src.cols, CV_16S);
76
    if( ippiFilterSobelNegVertBorder_8u16s_C1R(_src.ptr(), (int)_src.step,
77 78 79 80 81
                    _dx.ptr<short>(), (int)_dx.step, roi,
                    ippMskSize3x3, ippBorderRepl, 0, buffer) < 0 )
        return false;

    Mat _dy(_src.rows, _src.cols, CV_16S);
82
    if( ippiFilterSobelHorizBorder_8u16s_C1R(_src.ptr(), (int)_src.step,
83 84 85 86
                    _dy.ptr<short>(), (int)_dy.step, roi,
                    ippMskSize3x3, ippBorderRepl, 0, buffer) < 0 )
        return false;

87
    if( ippiCanny_16s8u_C1R(_dx.ptr<short>(), (int)_dx.step,
88
                               _dy.ptr<short>(), (int)_dy.step,
89
                              _dst.ptr(), (int)_dst.step, roi, low, high, buffer) < 0 )
90 91 92 93 94
        return false;
    return true;
}
#endif

I
Ilya Lavrenov 已提交
95 96
#ifdef HAVE_OPENCL

I
Ilya Lavrenov 已提交
97 98 99
static bool ocl_Canny(InputArray _src, OutputArray _dst, float low_thresh, float high_thresh,
                      int aperture_size, bool L2gradient, int cn, const Size & size)
{
100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116
    UMat map;

    const ocl::Device &dev = ocl::Device::getDefault();
    int max_wg_size = (int)dev.maxWorkGroupSize();

    int lSizeX = 32;
    int lSizeY = max_wg_size / 32;

    if (lSizeY == 0)
    {
        lSizeX = 16;
        lSizeY = max_wg_size / 16;
    }
    if (lSizeY == 0)
    {
        lSizeY = 1;
    }
I
Ilya Lavrenov 已提交
117 118 119 120 121 122

    if (L2gradient)
    {
        low_thresh = std::min(32767.0f, low_thresh);
        high_thresh = std::min(32767.0f, high_thresh);

123 124 125 126
        if (low_thresh > 0)
            low_thresh *= low_thresh;
        if (high_thresh > 0)
            high_thresh *= high_thresh;
I
Ilya Lavrenov 已提交
127 128 129 130 131
    }
    int low = cvFloor(low_thresh), high = cvFloor(high_thresh);

    if (aperture_size == 3 && !_src.isSubmatrix())
    {
132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147
        /*
            stage1_with_sobel:
                Sobel operator
                Calc magnitudes
                Non maxima suppression
                Double thresholding
        */
        char cvt[40];
        ocl::Kernel with_sobel("stage1_with_sobel", ocl::imgproc::canny_oclsrc,
                               format("-D WITH_SOBEL -D cn=%d -D TYPE=%s -D convert_intN=%s -D intN=%s -D GRP_SIZEX=%d -D GRP_SIZEY=%d%s",
                                      cn, ocl::memopTypeToStr(_src.depth()),
                                      ocl::convertTypeStr(_src.type(), CV_32SC(cn), cn, cvt),
                                      ocl::memopTypeToStr(CV_32SC(cn)),
                                      lSizeX, lSizeY,
                                      L2gradient ? " -D L2GRAD" : ""));
        if (with_sobel.empty())
I
Ilya Lavrenov 已提交
148 149
            return false;

150 151 152 153 154
        UMat src = _src.getUMat();
        map.create(size, CV_32S);
        with_sobel.args(ocl::KernelArg::ReadOnly(src),
                        ocl::KernelArg::WriteOnlyNoSize(map),
                        low, high);
I
Ilya Lavrenov 已提交
155

156 157
        size_t globalsize[2] = { size.width, size.height },
                localsize[2] = { lSizeX, lSizeY };
I
Ilya Lavrenov 已提交
158

159
        if (!with_sobel.run(2, globalsize, localsize, false))
I
Ilya Lavrenov 已提交
160 161 162 163
            return false;
    }
    else
    {
164 165 166 167 168 169 170
        /*
            stage1_without_sobel:
                Calc magnitudes
                Non maxima suppression
                Double thresholding
        */
        UMat dx, dy;
171 172
        Sobel(_src, dx, CV_16S, 1, 0, aperture_size, 1, 0, BORDER_REPLICATE);
        Sobel(_src, dy, CV_16S, 0, 1, aperture_size, 1, 0, BORDER_REPLICATE);
I
Ilya Lavrenov 已提交
173

174 175 176 177
        ocl::Kernel without_sobel("stage1_without_sobel", ocl::imgproc::canny_oclsrc,
                                    format("-D WITHOUT_SOBEL -D cn=%d -D GRP_SIZEX=%d -D GRP_SIZEY=%d%s",
                                           cn, lSizeX, lSizeY, L2gradient ? " -D L2GRAD" : ""));
        if (without_sobel.empty())
I
Ilya Lavrenov 已提交
178 179
            return false;

180 181 182 183 184 185 186
        map.create(size, CV_32S);
        without_sobel.args(ocl::KernelArg::ReadOnlyNoSize(dx), ocl::KernelArg::ReadOnlyNoSize(dy),
                           ocl::KernelArg::WriteOnly(map),
                           low, high);

        size_t globalsize[2] = { size.width, size.height },
                localsize[2] = { lSizeX, lSizeY };
I
Ilya Lavrenov 已提交
187

188
        if (!without_sobel.run(2, globalsize, localsize, false))
I
Ilya Lavrenov 已提交
189 190 191
            return false;
    }

192 193 194 195 196
    int PIX_PER_WI = 8;
    /*
        stage2:
            hysteresis (add weak edges if they are connected with strong edges)
    */
I
Ilya Lavrenov 已提交
197

198 199
    ocl::Kernel edgesHysteresis("stage2_hysteresis", ocl::imgproc::canny_oclsrc,
                                format("-D STAGE2 -D PIX_PER_WI=%d", PIX_PER_WI));
I
Ilya Lavrenov 已提交
200

201
    if (edgesHysteresis.empty())
I
Ilya Lavrenov 已提交
202 203
        return false;

204
    edgesHysteresis.args(ocl::KernelArg::ReadWrite(map));
I
Ilya Lavrenov 已提交
205

206 207 208
    int sizey = lSizeY / PIX_PER_WI;
    if (sizey == 0)
        sizey = 1;
I
Ilya Lavrenov 已提交
209

210
    size_t globalsize[2] = { size.width, size.height / PIX_PER_WI }, localsize[2] = { lSizeX, sizey };
I
Ilya Lavrenov 已提交
211

212 213
    if (!edgesHysteresis.run(2, globalsize, localsize, false))
        return false;
I
Ilya Lavrenov 已提交
214 215

    // get edges
216 217 218

    ocl::Kernel getEdgesKernel("getEdges", ocl::imgproc::canny_oclsrc,
                                format("-D GET_EDGES -D PIX_PER_WI=%d", PIX_PER_WI));
I
Ilya Lavrenov 已提交
219 220 221
    if (getEdgesKernel.empty())
        return false;

222
    _dst.create(size, CV_8UC1);
I
Ilya Lavrenov 已提交
223 224
    UMat dst = _dst.getUMat();

225
    getEdgesKernel.args(ocl::KernelArg::ReadOnly(map), ocl::KernelArg::WriteOnlyNoSize(dst));
226

I
Ilya Lavrenov 已提交
227 228 229
    return getEdgesKernel.run(2, globalsize, NULL, false);
}

I
Ilya Lavrenov 已提交
230 231
#endif

I
Ilya Lavrenov 已提交
232 233
}

234 235 236
void cv::Canny( InputArray _src, OutputArray _dst,
                double low_thresh, double high_thresh,
                int aperture_size, bool L2gradient )
237
{
I
Ilya Lavrenov 已提交
238 239
    const int type = _src.type(), depth = CV_MAT_DEPTH(type), cn = CV_MAT_CN(type);
    const Size size = _src.size();
240

I
Ilya Lavrenov 已提交
241 242
    CV_Assert( depth == CV_8U );
    _dst.create(size, CV_8U);
A
Andrey Kamaev 已提交
243 244 245

    if (!L2gradient && (aperture_size & CV_CANNY_L2_GRADIENT) == CV_CANNY_L2_GRADIENT)
    {
I
Ilya Lavrenov 已提交
246
        // backward compatibility
A
Andrey Kamaev 已提交
247 248 249 250 251
        aperture_size &= ~CV_CANNY_L2_GRADIENT;
        L2gradient = true;
    }

    if ((aperture_size & 1) == 0 || (aperture_size != -1 && (aperture_size < 3 || aperture_size > 7)))
252
        CV_Error(CV_StsBadFlag, "Aperture size should be odd");
A
Andrey Kamaev 已提交
253

254 255 256
    if (low_thresh > high_thresh)
        std::swap(low_thresh, high_thresh);

257
    CV_OCL_RUN(_dst.isUMat() && (cn == 1 || cn == 3),
I
Ilya Lavrenov 已提交
258
               ocl_Canny(_src, _dst, (float)low_thresh, (float)high_thresh, aperture_size, L2gradient, cn, size))
I
Ilya Lavrenov 已提交
259 260 261

    Mat src = _src.getMat(), dst = _dst.getMat();

A
Andrey Kamaev 已提交
262
#ifdef HAVE_TEGRA_OPTIMIZATION
263
    if (tegra::canny(src, dst, low_thresh, high_thresh, aperture_size, L2gradient))
A
Andrey Kamaev 已提交
264 265
        return;
#endif
266

267
#ifdef USE_IPP_CANNY
I
Ilya Lavrenov 已提交
268 269 270 271 272 273
    if( aperture_size == 3 && !L2gradient && 1 == cn )
    {
        if (ippCanny(src, dst, (float)low_thresh, (float)high_thresh))
            return;
        setIppErrorStatus();
    }
274
#endif
275

276 277
    Mat dx(src.rows, src.cols, CV_16SC(cn));
    Mat dy(src.rows, src.cols, CV_16SC(cn));
278

I
Ilya Lavrenov 已提交
279 280
    Sobel(src, dx, CV_16S, 1, 0, aperture_size, 1, 0, BORDER_REPLICATE);
    Sobel(src, dy, CV_16S, 0, 1, aperture_size, 1, 0, BORDER_REPLICATE);
281

A
Andrey Kamaev 已提交
282
    if (L2gradient)
283
    {
A
Andrey Kamaev 已提交
284 285
        low_thresh = std::min(32767.0, low_thresh);
        high_thresh = std::min(32767.0, high_thresh);
286

A
Andrey Kamaev 已提交
287 288
        if (low_thresh > 0) low_thresh *= low_thresh;
        if (high_thresh > 0) high_thresh *= high_thresh;
289
    }
A
Andrey Kamaev 已提交
290 291
    int low = cvFloor(low_thresh);
    int high = cvFloor(high_thresh);
292

A
Andrey Kamaev 已提交
293
    ptrdiff_t mapstep = src.cols + 2;
294
    AutoBuffer<uchar> buffer((src.cols+2)*(src.rows+2) + cn * mapstep * 3 * sizeof(int));
295

A
Andrey Kamaev 已提交
296 297 298 299 300 301 302 303 304 305 306 307 308 309
    int* mag_buf[3];
    mag_buf[0] = (int*)(uchar*)buffer;
    mag_buf[1] = mag_buf[0] + mapstep*cn;
    mag_buf[2] = mag_buf[1] + mapstep*cn;
    memset(mag_buf[0], 0, /* cn* */mapstep*sizeof(int));

    uchar* map = (uchar*)(mag_buf[2] + mapstep*cn);
    memset(map, 1, mapstep);
    memset(map + mapstep*(src.rows + 1), 1, mapstep);

    int maxsize = std::max(1 << 10, src.cols * src.rows / 10);
    std::vector<uchar*> stack(maxsize);
    uchar **stack_top = &stack[0];
    uchar **stack_bottom = &stack[0];
310

A
Andrey Kamaev 已提交
311
    /* sector numbers
312 313 314
       (Top-Left Origin)

        1   2   3
A
Andrey Kamaev 已提交
315 316
         *  *  *
          * * *
317
        0*******0
A
Andrey Kamaev 已提交
318 319
          * * *
         *  *  *
320 321 322
        3   2   1
    */

A
Andrey Kamaev 已提交
323
    #define CANNY_PUSH(d)    *(d) = uchar(2), *stack_top++ = (d)
324 325
    #define CANNY_POP(d)     (d) = *--stack_top

326 327 328 329
#if CV_SSE2
    bool haveSSE2 = checkHardwareSupport(CV_CPU_SSE2);
#endif

I
typos  
Ilya Lavrenov 已提交
330
    // calculate magnitude and angle of gradient, perform non-maxima suppression.
331 332 333 334
    // fill the map with one of the following values:
    //   0 - the pixel might belong to an edge
    //   1 - the pixel can not belong to an edge
    //   2 - the pixel does belong to an edge
A
Andrey Kamaev 已提交
335
    for (int i = 0; i <= src.rows; i++)
336
    {
A
Andrey Kamaev 已提交
337 338
        int* _norm = mag_buf[(i > 0) + 1] + 1;
        if (i < src.rows)
339
        {
A
Andrey Kamaev 已提交
340 341 342 343
            short* _dx = dx.ptr<short>(i);
            short* _dy = dy.ptr<short>(i);

            if (!L2gradient)
344
            {
345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365
                int j = 0, width = src.cols * cn;
#if CV_SSE2
                if (haveSSE2)
                {
                    __m128i v_zero = _mm_setzero_si128();
                    for ( ; j <= width - 8; j += 8)
                    {
                        __m128i v_dx = _mm_loadu_si128((const __m128i *)(_dx + j));
                        __m128i v_dy = _mm_loadu_si128((const __m128i *)(_dy + j));
                        v_dx = _mm_max_epi16(v_dx, _mm_sub_epi16(v_zero, v_dx));
                        v_dy = _mm_max_epi16(v_dy, _mm_sub_epi16(v_zero, v_dy));

                        __m128i v_norm = _mm_add_epi32(_mm_unpacklo_epi16(v_dx, v_zero), _mm_unpacklo_epi16(v_dy, v_zero));
                        _mm_storeu_si128((__m128i *)(_norm + j), v_norm);

                        v_norm = _mm_add_epi32(_mm_unpackhi_epi16(v_dx, v_zero), _mm_unpackhi_epi16(v_dy, v_zero));
                        _mm_storeu_si128((__m128i *)(_norm + j + 4), v_norm);
                    }
                }
#endif
                for ( ; j < width; ++j)
A
Andrey Kamaev 已提交
366
                    _norm[j] = std::abs(int(_dx[j])) + std::abs(int(_dy[j]));
367 368 369
            }
            else
            {
370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390
                int j = 0, width = src.cols * cn;
#if CV_SSE2
                if (haveSSE2)
                {
                    for ( ; j <= width - 8; j += 8)
                    {
                        __m128i v_dx = _mm_loadu_si128((const __m128i *)(_dx + j));
                        __m128i v_dy = _mm_loadu_si128((const __m128i *)(_dy + j));

                        __m128i v_dx_ml = _mm_mullo_epi16(v_dx, v_dx), v_dx_mh = _mm_mulhi_epi16(v_dx, v_dx);
                        __m128i v_dy_ml = _mm_mullo_epi16(v_dy, v_dy), v_dy_mh = _mm_mulhi_epi16(v_dy, v_dy);

                        __m128i v_norm = _mm_add_epi32(_mm_unpacklo_epi16(v_dx_ml, v_dx_mh), _mm_unpacklo_epi16(v_dy_ml, v_dy_mh));
                        _mm_storeu_si128((__m128i *)(_norm + j), v_norm);

                        v_norm = _mm_add_epi32(_mm_unpackhi_epi16(v_dx_ml, v_dx_mh), _mm_unpackhi_epi16(v_dy_ml, v_dy_mh));
                        _mm_storeu_si128((__m128i *)(_norm + j + 4), v_norm);
                    }
                }
#endif
                for ( ; j < width; ++j)
A
Andrey Kamaev 已提交
391
                    _norm[j] = int(_dx[j])*_dx[j] + int(_dy[j])*_dy[j];
392
            }
393

A
Andrey Kamaev 已提交
394
            if (cn > 1)
395
            {
A
Andrey Kamaev 已提交
396
                for(int j = 0, jn = 0; j < src.cols; ++j, jn += cn)
397
                {
A
Andrey Kamaev 已提交
398 399 400 401 402 403
                    int maxIdx = jn;
                    for(int k = 1; k < cn; ++k)
                        if(_norm[jn + k] > _norm[maxIdx]) maxIdx = jn + k;
                    _norm[j] = _norm[maxIdx];
                    _dx[j] = _dx[maxIdx];
                    _dy[j] = _dy[maxIdx];
404 405
                }
            }
A
Andrey Kamaev 已提交
406
            _norm[-1] = _norm[src.cols] = 0;
407 408
        }
        else
A
Andrey Kamaev 已提交
409
            memset(_norm-1, 0, /* cn* */mapstep*sizeof(int));
410

411 412
        // at the very beginning we do not have a complete ring
        // buffer of 3 magnitude rows for non-maxima suppression
A
Andrey Kamaev 已提交
413
        if (i == 0)
414 415
            continue;

A
Andrey Kamaev 已提交
416 417 418 419 420 421 422 423 424 425 426
        uchar* _map = map + mapstep*i + 1;
        _map[-1] = _map[src.cols] = 1;

        int* _mag = mag_buf[1] + 1; // take the central row
        ptrdiff_t magstep1 = mag_buf[2] - mag_buf[1];
        ptrdiff_t magstep2 = mag_buf[0] - mag_buf[1];

        const short* _x = dx.ptr<short>(i-1);
        const short* _y = dy.ptr<short>(i-1);

        if ((stack_top - stack_bottom) + src.cols > maxsize)
427 428
        {
            int sz = (int)(stack_top - stack_bottom);
A
Andrey Kamaev 已提交
429
            maxsize = maxsize * 3/2;
430 431 432 433 434
            stack.resize(maxsize);
            stack_bottom = &stack[0];
            stack_top = stack_bottom + sz;
        }

A
Andrey Kamaev 已提交
435 436
        int prev_flag = 0;
        for (int j = 0; j < src.cols; j++)
437 438
        {
            #define CANNY_SHIFT 15
A
Andrey Kamaev 已提交
439
            const int TG22 = (int)(0.4142135623730950488016887242097*(1<<CANNY_SHIFT) + 0.5);
440 441 442

            int m = _mag[j];

A
Andrey Kamaev 已提交
443
            if (m > low)
444
            {
A
Andrey Kamaev 已提交
445 446 447 448
                int xs = _x[j];
                int ys = _y[j];
                int x = std::abs(xs);
                int y = std::abs(ys) << CANNY_SHIFT;
449

A
Andrey Kamaev 已提交
450
                int tg22x = x * TG22;
451

A
Andrey Kamaev 已提交
452
                if (y < tg22x)
453
                {
A
Andrey Kamaev 已提交
454
                    if (m > _mag[j-1] && m >= _mag[j+1]) goto __ocv_canny_push;
455
                }
A
Andrey Kamaev 已提交
456
                else
457
                {
A
Andrey Kamaev 已提交
458 459
                    int tg67x = tg22x + (x << (CANNY_SHIFT+1));
                    if (y > tg67x)
460
                    {
A
Andrey Kamaev 已提交
461
                        if (m > _mag[j+magstep2] && m >= _mag[j+magstep1]) goto __ocv_canny_push;
462
                    }
A
Andrey Kamaev 已提交
463
                    else
464
                    {
A
Andrey Kamaev 已提交
465 466
                        int s = (xs ^ ys) < 0 ? -1 : 1;
                        if (m > _mag[j+magstep2-s] && m > _mag[j+magstep1+s]) goto __ocv_canny_push;
467 468 469 470
                    }
                }
            }
            prev_flag = 0;
A
Andrey Kamaev 已提交
471 472 473 474 475 476 477 478 479 480
            _map[j] = uchar(1);
            continue;
__ocv_canny_push:
            if (!prev_flag && m > high && _map[j-mapstep] != 2)
            {
                CANNY_PUSH(_map + j);
                prev_flag = 1;
            }
            else
                _map[j] = 0;
481 482
        }

A
Andrey Kamaev 已提交
483
        // scroll the ring buffer
484 485 486 487 488 489 490
        _mag = mag_buf[0];
        mag_buf[0] = mag_buf[1];
        mag_buf[1] = mag_buf[2];
        mag_buf[2] = _mag;
    }

    // now track the edges (hysteresis thresholding)
A
Andrey Kamaev 已提交
491
    while (stack_top > stack_bottom)
492 493
    {
        uchar* m;
A
Andrey Kamaev 已提交
494
        if ((stack_top - stack_bottom) + 8 > maxsize)
495 496
        {
            int sz = (int)(stack_top - stack_bottom);
A
Andrey Kamaev 已提交
497
            maxsize = maxsize * 3/2;
498 499 500 501 502 503
            stack.resize(maxsize);
            stack_bottom = &stack[0];
            stack_top = stack_bottom + sz;
        }

        CANNY_POP(m);
A
Andrey Kamaev 已提交
504 505 506 507 508 509 510 511 512

        if (!m[-1])         CANNY_PUSH(m - 1);
        if (!m[1])          CANNY_PUSH(m + 1);
        if (!m[-mapstep-1]) CANNY_PUSH(m - mapstep - 1);
        if (!m[-mapstep])   CANNY_PUSH(m - mapstep);
        if (!m[-mapstep+1]) CANNY_PUSH(m - mapstep + 1);
        if (!m[mapstep-1])  CANNY_PUSH(m + mapstep - 1);
        if (!m[mapstep])    CANNY_PUSH(m + mapstep);
        if (!m[mapstep+1])  CANNY_PUSH(m + mapstep + 1);
513 514 515
    }

    // the final pass, form the final image
A
Andrey Kamaev 已提交
516 517 518
    const uchar* pmap = map + mapstep + 1;
    uchar* pdst = dst.ptr();
    for (int i = 0; i < src.rows; i++, pmap += mapstep, pdst += dst.step)
519
    {
A
Andrey Kamaev 已提交
520 521
        for (int j = 0; j < src.cols; j++)
            pdst[j] = (uchar)-(pmap[j] >> 1);
522 523 524
    }
}

525 526
void cvCanny( const CvArr* image, CvArr* edges, double threshold1,
              double threshold2, int aperture_size )
527
{
528 529
    cv::Mat src = cv::cvarrToMat(image), dst = cv::cvarrToMat(edges);
    CV_Assert( src.size == dst.size && src.depth() == CV_8U && dst.type() == CV_8U );
530

531 532
    cv::Canny(src, dst, threshold1, threshold2, aperture_size & 255,
              (aperture_size & CV_CANNY_L2_GRADIENT) != 0);
533 534 535
}

/* End of file. */