2010-05-12 01:44:00 +08:00
|
|
|
/*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.
|
|
|
|
//
|
|
|
|
//
|
|
|
|
// License Agreement
|
|
|
|
// For Open Source Computer Vision Library
|
|
|
|
//
|
|
|
|
// Copyright (C) 2000-2008, Intel Corporation, all rights reserved.
|
2011-04-17 21:14:45 +08:00
|
|
|
// Copyright (C) 2009-2011, Willow Garage Inc., all rights reserved.
|
2010-05-12 01:44:00 +08:00
|
|
|
// 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 the copyright holders 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*/
|
|
|
|
|
|
|
|
/* ////////////////////////////////////////////////////////////////////
|
|
|
|
//
|
2011-04-17 21:14:45 +08:00
|
|
|
// Arithmetic and logical operations: +, -, *, /, &, |, ^, ~, abs ...
|
2010-05-12 01:44:00 +08:00
|
|
|
//
|
|
|
|
// */
|
|
|
|
|
|
|
|
#include "precomp.hpp"
|
|
|
|
|
|
|
|
namespace cv
|
|
|
|
{
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
#if ARITHM_USE_IPP
|
|
|
|
struct IPPArithmInitializer
|
|
|
|
{
|
|
|
|
IPPArithmInitializer(void)
|
|
|
|
{
|
|
|
|
IppStatus status = ippStaticInit();
|
|
|
|
}
|
|
|
|
};
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
IPPArithmInitializer ippArithmInitializer;
|
|
|
|
#endif
|
2011-01-07 08:26:09 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
struct NOP {};
|
|
|
|
|
|
|
|
template<typename T, class Op, class Op8>
|
|
|
|
void vBinOp8(const T* src1, size_t step1, const T* src2, size_t step2, T* dst, size_t step, Size sz)
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
Op8 op8;
|
|
|
|
Op op;
|
|
|
|
|
|
|
|
for( ; sz.height--; src1 += step1/sizeof(src1[0]),
|
|
|
|
src2 += step2/sizeof(src2[0]),
|
|
|
|
dst += step/sizeof(dst[0]) )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
|
|
|
int x = 0;
|
2011-04-17 21:14:45 +08:00
|
|
|
|
|
|
|
#if CV_SSE2
|
|
|
|
if( USE_SSE2 )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
for( ; x <= sz.width - 32; x += 32 )
|
|
|
|
{
|
|
|
|
__m128i r0 = _mm_loadu_si128((const __m128i*)(src1 + x));
|
|
|
|
__m128i r1 = _mm_loadu_si128((const __m128i*)(src1 + x + 16));
|
|
|
|
r0 = op8(r0,_mm_loadu_si128((const __m128i*)(src2 + x)));
|
|
|
|
r1 = op8(r1,_mm_loadu_si128((const __m128i*)(src2 + x + 16)));
|
|
|
|
_mm_storeu_si128((__m128i*)(dst + x), r0);
|
|
|
|
_mm_storeu_si128((__m128i*)(dst + x + 16), r1);
|
|
|
|
}
|
|
|
|
for( ; x <= sz.width - 8; x += 8 )
|
|
|
|
{
|
|
|
|
__m128i r0 = _mm_loadl_epi64((const __m128i*)(src1 + x));
|
|
|
|
r0 = op8(r0,_mm_loadl_epi64((const __m128i*)(src2 + x)));
|
|
|
|
_mm_storel_epi64((__m128i*)(dst + x), r0);
|
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
2011-04-17 21:14:45 +08:00
|
|
|
#endif
|
|
|
|
|
|
|
|
for( ; x <= sz.width - 4; x += 4 )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
T v0 = op(src1[x], src2[x]);
|
|
|
|
T v1 = op(src1[x+1], src2[x+1]);
|
|
|
|
dst[x] = v0; dst[x+1] = v1;
|
|
|
|
v0 = op(src1[x+2], src2[x+2]);
|
|
|
|
v1 = op(src1[x+3], src2[x+3]);
|
|
|
|
dst[x+2] = v0; dst[x+3] = v1;
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
2011-04-17 21:14:45 +08:00
|
|
|
|
|
|
|
for( ; x < sz.width; x++ )
|
|
|
|
dst[x] = op(src1[x], src2[x]);
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
2011-04-17 21:14:45 +08:00
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
template<typename T, class Op, class Op16>
|
|
|
|
void vBinOp16(const T* src1, size_t step1, const T* src2, size_t step2,
|
|
|
|
T* dst, size_t step, Size sz)
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
Op16 op16;
|
|
|
|
Op op;
|
|
|
|
|
|
|
|
for( ; sz.height--; src1 += step1/sizeof(src1[0]),
|
|
|
|
src2 += step2/sizeof(src2[0]),
|
|
|
|
dst += step/sizeof(dst[0]) )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
|
|
|
int x = 0;
|
2011-04-17 21:14:45 +08:00
|
|
|
|
|
|
|
#if CV_SSE2
|
|
|
|
if( USE_SSE2 )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
for( ; x <= sz.width - 16; x += 16 )
|
|
|
|
{
|
|
|
|
__m128i r0 = _mm_loadu_si128((const __m128i*)(src1 + x));
|
|
|
|
__m128i r1 = _mm_loadu_si128((const __m128i*)(src1 + x + 8));
|
|
|
|
r0 = op16(r0,_mm_loadu_si128((const __m128i*)(src2 + x)));
|
|
|
|
r1 = op16(r1,_mm_loadu_si128((const __m128i*)(src2 + x + 8)));
|
|
|
|
_mm_storeu_si128((__m128i*)(dst + x), r0);
|
|
|
|
_mm_storeu_si128((__m128i*)(dst + x + 16), r1);
|
|
|
|
}
|
|
|
|
for( ; x <= sz.width - 4; x += 4 )
|
|
|
|
{
|
|
|
|
__m128i r0 = _mm_loadl_epi64((const __m128i*)(src1 + x));
|
|
|
|
r0 = op16(r0,_mm_loadl_epi64((const __m128i*)(src2 + x)));
|
|
|
|
_mm_storel_epi64((__m128i*)(dst + x), r0);
|
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
2011-04-17 21:14:45 +08:00
|
|
|
else
|
|
|
|
#endif
|
|
|
|
|
|
|
|
for( ; x <= sz.width - 4; x += 4 )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
T v0 = op(src1[x], src2[x]);
|
|
|
|
T v1 = op(src1[x+1], src2[x+1]);
|
|
|
|
dst[x] = v0; dst[x+1] = v1;
|
|
|
|
v0 = op(src1[x+2], src2[x+2]);
|
|
|
|
v1 = op(src1[x+3], src2[x+3]);
|
|
|
|
dst[x+2] = v0; dst[x+3] = v1;
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
2011-04-17 21:14:45 +08:00
|
|
|
|
|
|
|
for( ; x < sz.width; x++ )
|
|
|
|
dst[x] = op(src1[x], src2[x]);
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
2011-04-17 21:14:45 +08:00
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
|
|
|
|
template<class Op, class Op32>
|
|
|
|
void vBinOp32s(const int* src1, size_t step1, const int* src2, size_t step2,
|
|
|
|
int* dst, size_t step, Size sz)
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
Op32 op32;
|
|
|
|
Op op;
|
|
|
|
|
|
|
|
for( ; sz.height--; src1 += step1/sizeof(src1[0]),
|
|
|
|
src2 += step2/sizeof(src2[0]),
|
|
|
|
dst += step/sizeof(dst[0]) )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
|
|
|
int x = 0;
|
2011-04-17 21:14:45 +08:00
|
|
|
|
|
|
|
#if CV_SSE2
|
|
|
|
if( USE_SSE2 )
|
|
|
|
{
|
|
|
|
if( (((size_t)src1|(size_t)src2|(size_t)dst)&15) == 0 )
|
|
|
|
for( ; x <= sz.width - 8; x += 8 )
|
|
|
|
{
|
|
|
|
__m128i r0 = _mm_load_si128((const __m128i*)(src1 + x));
|
|
|
|
__m128i r1 = _mm_load_si128((const __m128i*)(src1 + x + 4));
|
|
|
|
r0 = op32(r0,_mm_load_si128((const __m128i*)(src2 + x)));
|
|
|
|
r1 = op32(r1,_mm_load_si128((const __m128i*)(src2 + x + 4)));
|
|
|
|
_mm_store_si128((__m128i*)(dst + x), r0);
|
|
|
|
_mm_store_si128((__m128i*)(dst + x + 16), r1);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
for( ; x <= sz.width - 8; x += 8 )
|
|
|
|
{
|
|
|
|
__m128i r0 = _mm_loadu_si128((const __m128i*)(src1 + x));
|
|
|
|
__m128i r1 = _mm_loadu_si128((const __m128i*)(src1 + x + 4));
|
|
|
|
r0 = op32(r0,_mm_loadu_si128((const __m128i*)(src2 + x)));
|
|
|
|
r1 = op32(r1,_mm_loadu_si128((const __m128i*)(src2 + x + 4)));
|
|
|
|
_mm_storeu_si128((__m128i*)(dst + x), r0);
|
|
|
|
_mm_storeu_si128((__m128i*)(dst + x + 16), r1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
|
|
|
for( ; x <= sz.width - 4; x += 4 )
|
|
|
|
{
|
|
|
|
int v0 = op(src1[x], src2[x]);
|
|
|
|
int v1 = op(src1[x+1], src2[x+1]);
|
|
|
|
dst[x] = v0; dst[x+1] = v1;
|
|
|
|
v0 = op(src1[x+2], src2[x+2]);
|
|
|
|
v1 = op(src1[x+3], src2[x+3]);
|
|
|
|
dst[x+2] = v0; dst[x+3] = v1;
|
|
|
|
}
|
|
|
|
|
|
|
|
for( ; x < sz.width; x++ )
|
|
|
|
dst[x] = op(src1[x], src2[x]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
template<class Op, class Op32>
|
|
|
|
void vBinOp32f(const float* src1, size_t step1, const float* src2, size_t step2,
|
|
|
|
float* dst, size_t step, Size sz)
|
|
|
|
{
|
|
|
|
Op32 op32;
|
|
|
|
Op op;
|
|
|
|
|
|
|
|
for( ; sz.height--; src1 += step1/sizeof(src1[0]),
|
|
|
|
src2 += step2/sizeof(src2[0]),
|
|
|
|
dst += step/sizeof(dst[0]) )
|
|
|
|
{
|
|
|
|
int x = 0;
|
|
|
|
|
|
|
|
#if CV_SSE2
|
|
|
|
if( USE_SSE2 )
|
|
|
|
{
|
|
|
|
if( (((size_t)src1|(size_t)src2|(size_t)dst)&15) == 0 )
|
|
|
|
for( ; x <= sz.width - 8; x += 8 )
|
|
|
|
{
|
|
|
|
__m128 r0 = _mm_load_ps(src1 + x);
|
|
|
|
__m128 r1 = _mm_load_ps(src1 + x + 4);
|
|
|
|
r0 = op32(r0,_mm_load_ps(src2 + x));
|
|
|
|
r1 = op32(r1,_mm_load_ps(src2 + x + 4));
|
|
|
|
_mm_store_ps(dst + x, r0);
|
|
|
|
_mm_store_ps(dst + x + 4, r1);
|
|
|
|
}
|
|
|
|
else
|
|
|
|
for( ; x <= sz.width - 8; x += 8 )
|
|
|
|
{
|
|
|
|
__m128 r0 = _mm_loadu_ps(src1 + x);
|
|
|
|
__m128 r1 = _mm_loadu_ps(src1 + x + 4);
|
|
|
|
r0 = op32(r0,_mm_loadu_ps(src2 + x));
|
|
|
|
r1 = op32(r1,_mm_loadu_ps(src2 + x + 4));
|
|
|
|
_mm_storeu_ps(dst + x, r0);
|
|
|
|
_mm_storeu_ps(dst + x + 4, r1);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
for( ; x <= sz.width - 4; x += 4 )
|
|
|
|
{
|
|
|
|
float v0 = op(src1[x], src2[x]);
|
|
|
|
float v1 = op(src1[x+1], src2[x+1]);
|
|
|
|
dst[x] = v0; dst[x+1] = v1;
|
|
|
|
v0 = op(src1[x+2], src2[x+2]);
|
|
|
|
v1 = op(src1[x+3], src2[x+3]);
|
|
|
|
dst[x+2] = v0; dst[x+3] = v1;
|
|
|
|
}
|
|
|
|
|
|
|
|
for( ; x < sz.width; x++ )
|
|
|
|
dst[x] = op(src1[x], src2[x]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
template<class Op, class Op64>
|
|
|
|
void vBinOp64f(const double* src1, size_t step1, const double* src2, size_t step2,
|
|
|
|
double* dst, size_t step, Size sz)
|
|
|
|
{
|
|
|
|
Op64 op64;
|
|
|
|
Op op;
|
|
|
|
|
|
|
|
for( ; sz.height--; src1 += step1/sizeof(src1[0]),
|
|
|
|
src2 += step2/sizeof(src2[0]),
|
|
|
|
dst += step/sizeof(dst[0]) )
|
|
|
|
{
|
|
|
|
int x = 0;
|
|
|
|
|
|
|
|
#if CV_SSE2
|
|
|
|
if( USE_SSE2 && (((size_t)src1|(size_t)src2|(size_t)dst)&15) == 0 )
|
|
|
|
for( ; x <= sz.width - 4; x += 4 )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
__m128d r0 = _mm_load_pd(src1 + x);
|
|
|
|
__m128d r1 = _mm_load_pd(src1 + x + 2);
|
|
|
|
r0 = op64(r0,_mm_load_pd(src2 + x));
|
|
|
|
r1 = op64(r1,_mm_load_pd(src2 + x + 2));
|
|
|
|
_mm_store_pd(dst + x, r0);
|
|
|
|
_mm_store_pd(dst + x + 2, r1);
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
else
|
2011-04-17 21:14:45 +08:00
|
|
|
#endif
|
|
|
|
for( ; x <= sz.width - 4; x += 4 )
|
|
|
|
{
|
|
|
|
double v0 = op(src1[x], src2[x]);
|
|
|
|
double v1 = op(src1[x+1], src2[x+1]);
|
|
|
|
dst[x] = v0; dst[x+1] = v1;
|
|
|
|
v0 = op(src1[x+2], src2[x+2]);
|
|
|
|
v1 = op(src1[x+3], src2[x+3]);
|
|
|
|
dst[x+2] = v0; dst[x+3] = v1;
|
|
|
|
}
|
|
|
|
|
|
|
|
for( ; x < sz.width; x++ )
|
|
|
|
dst[x] = op(src1[x], src2[x]);
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
2011-04-17 21:14:45 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
#if CV_SSE2
|
|
|
|
|
2010-05-12 01:44:00 +08:00
|
|
|
struct _VAdd8u { __m128i operator()(const __m128i& a, const __m128i& b) const { return _mm_adds_epu8(a,b); }};
|
|
|
|
struct _VSub8u { __m128i operator()(const __m128i& a, const __m128i& b) const { return _mm_subs_epu8(a,b); }};
|
|
|
|
struct _VMin8u { __m128i operator()(const __m128i& a, const __m128i& b) const { return _mm_min_epu8(a,b); }};
|
|
|
|
struct _VMax8u { __m128i operator()(const __m128i& a, const __m128i& b) const { return _mm_max_epu8(a,b); }};
|
|
|
|
struct _VAbsDiff8u
|
|
|
|
{
|
|
|
|
__m128i operator()(const __m128i& a, const __m128i& b) const
|
|
|
|
{ return _mm_add_epi8(_mm_subs_epu8(a,b),_mm_subs_epu8(b,a)); }
|
|
|
|
};
|
2011-04-17 21:14:45 +08:00
|
|
|
|
|
|
|
struct _VAdd8s { __m128i operator()(const __m128i& a, const __m128i& b) const { return _mm_adds_epi8(a,b); }};
|
|
|
|
struct _VSub8s { __m128i operator()(const __m128i& a, const __m128i& b) const { return _mm_subs_epi8(a,b); }};
|
|
|
|
struct _VMin8s
|
|
|
|
{
|
|
|
|
__m128i operator()(const __m128i& a, const __m128i& b) const
|
|
|
|
{
|
|
|
|
__m128i m = _mm_cmpgt_epi8(a, b);
|
|
|
|
return _mm_xor_si128(a, _mm_and_si128(_mm_xor_si128(a, b), m));
|
|
|
|
}
|
|
|
|
};
|
|
|
|
struct _VMax8s
|
|
|
|
{
|
|
|
|
__m128i operator()(const __m128i& a, const __m128i& b) const
|
|
|
|
{
|
|
|
|
__m128i m = _mm_cmpgt_epi8(b, a);
|
|
|
|
return _mm_xor_si128(a, _mm_and_si128(_mm_xor_si128(a, b), m));
|
|
|
|
}
|
|
|
|
};
|
|
|
|
struct _VAbsDiff8s
|
|
|
|
{
|
|
|
|
__m128i operator()(const __m128i& a, const __m128i& b) const
|
|
|
|
{
|
|
|
|
__m128i d = _mm_subs_epi8(a, b);
|
|
|
|
__m128i m = _mm_cmpgt_epi8(b, a);
|
|
|
|
return _mm_subs_epi8(_mm_xor_si128(d, m), m);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2010-05-12 01:44:00 +08:00
|
|
|
struct _VAdd16u { __m128i operator()(const __m128i& a, const __m128i& b) const { return _mm_adds_epu16(a,b); }};
|
|
|
|
struct _VSub16u { __m128i operator()(const __m128i& a, const __m128i& b) const { return _mm_subs_epu16(a,b); }};
|
|
|
|
struct _VMin16u
|
|
|
|
{
|
|
|
|
__m128i operator()(const __m128i& a, const __m128i& b) const
|
|
|
|
{ return _mm_subs_epu16(a,_mm_subs_epu16(a,b)); }
|
|
|
|
};
|
|
|
|
struct _VMax16u
|
|
|
|
{
|
|
|
|
__m128i operator()(const __m128i& a, const __m128i& b) const
|
|
|
|
{ return _mm_adds_epu16(_mm_subs_epu16(a,b),b); }
|
|
|
|
};
|
|
|
|
struct _VAbsDiff16u
|
|
|
|
{
|
|
|
|
__m128i operator()(const __m128i& a, const __m128i& b) const
|
|
|
|
{ return _mm_add_epi16(_mm_subs_epu16(a,b),_mm_subs_epu16(b,a)); }
|
|
|
|
};
|
2011-04-17 21:14:45 +08:00
|
|
|
|
2010-05-12 01:44:00 +08:00
|
|
|
struct _VAdd16s { __m128i operator()(const __m128i& a, const __m128i& b) const { return _mm_adds_epi16(a,b); }};
|
|
|
|
struct _VSub16s { __m128i operator()(const __m128i& a, const __m128i& b) const { return _mm_subs_epi16(a,b); }};
|
|
|
|
struct _VMin16s { __m128i operator()(const __m128i& a, const __m128i& b) const { return _mm_min_epi16(a,b); }};
|
|
|
|
struct _VMax16s { __m128i operator()(const __m128i& a, const __m128i& b) const { return _mm_max_epi16(a,b); }};
|
|
|
|
struct _VAbsDiff16s
|
|
|
|
{
|
|
|
|
__m128i operator()(const __m128i& a, const __m128i& b) const
|
|
|
|
{
|
|
|
|
__m128i M = _mm_max_epi16(a,b), m = _mm_min_epi16(a,b);
|
|
|
|
return _mm_subs_epi16(M, m);
|
|
|
|
}
|
|
|
|
};
|
2011-04-17 21:14:45 +08:00
|
|
|
|
|
|
|
struct _VAdd32s { __m128i operator()(const __m128i& a, const __m128i& b) const { return _mm_add_epi32(a,b); }};
|
|
|
|
struct _VSub32s { __m128i operator()(const __m128i& a, const __m128i& b) const { return _mm_sub_epi32(a,b); }};
|
|
|
|
struct _VMin32s
|
|
|
|
{
|
|
|
|
__m128i operator()(const __m128i& a, const __m128i& b) const
|
|
|
|
{
|
|
|
|
__m128i m = _mm_cmpgt_epi32(a, b);
|
|
|
|
return _mm_xor_si128(a, _mm_and_si128(_mm_xor_si128(a, b), m));
|
|
|
|
}
|
|
|
|
};
|
|
|
|
struct _VMax32s
|
|
|
|
{
|
|
|
|
__m128i operator()(const __m128i& a, const __m128i& b) const
|
|
|
|
{
|
|
|
|
__m128i m = _mm_cmpgt_epi32(b, a);
|
|
|
|
return _mm_xor_si128(a, _mm_and_si128(_mm_xor_si128(a, b), m));
|
|
|
|
}
|
|
|
|
};
|
|
|
|
struct _VAbsDiff32s
|
|
|
|
{
|
|
|
|
__m128i operator()(const __m128i& a, const __m128i& b) const
|
|
|
|
{
|
|
|
|
__m128i d = _mm_sub_epi32(a, b);
|
|
|
|
__m128i m = _mm_cmpgt_epi32(b, a);
|
|
|
|
return _mm_sub_epi32(_mm_xor_si128(d, m), m);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2010-05-12 01:44:00 +08:00
|
|
|
struct _VAdd32f { __m128 operator()(const __m128& a, const __m128& b) const { return _mm_add_ps(a,b); }};
|
|
|
|
struct _VSub32f { __m128 operator()(const __m128& a, const __m128& b) const { return _mm_sub_ps(a,b); }};
|
|
|
|
struct _VMin32f { __m128 operator()(const __m128& a, const __m128& b) const { return _mm_min_ps(a,b); }};
|
|
|
|
struct _VMax32f { __m128 operator()(const __m128& a, const __m128& b) const { return _mm_max_ps(a,b); }};
|
|
|
|
static int CV_DECL_ALIGNED(16) v32f_absmask[] = { 0x7fffffff, 0x7fffffff, 0x7fffffff, 0x7fffffff };
|
|
|
|
struct _VAbsDiff32f
|
|
|
|
{
|
|
|
|
__m128 operator()(const __m128& a, const __m128& b) const
|
|
|
|
{
|
|
|
|
return _mm_and_ps(_mm_sub_ps(a,b), *(const __m128*)v32f_absmask);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
struct _VAdd64f { __m128d operator()(const __m128d& a, const __m128d& b) const { return _mm_add_pd(a,b); }};
|
|
|
|
struct _VSub64f { __m128d operator()(const __m128d& a, const __m128d& b) const { return _mm_sub_pd(a,b); }};
|
|
|
|
struct _VMin64f { __m128d operator()(const __m128d& a, const __m128d& b) const { return _mm_min_pd(a,b); }};
|
|
|
|
struct _VMax64f { __m128d operator()(const __m128d& a, const __m128d& b) const { return _mm_max_pd(a,b); }};
|
|
|
|
|
|
|
|
static int CV_DECL_ALIGNED(16) v64f_absmask[] = { 0xffffffff, 0x7fffffff, 0xffffffff, 0x7fffffff };
|
|
|
|
struct _VAbsDiff64f
|
|
|
|
{
|
|
|
|
__m128d operator()(const __m128d& a, const __m128d& b) const
|
|
|
|
{
|
|
|
|
return _mm_and_pd(_mm_sub_pd(a,b), *(const __m128d*)v64f_absmask);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2010-05-12 01:44:00 +08:00
|
|
|
struct _VAnd8u { __m128i operator()(const __m128i& a, const __m128i& b) const { return _mm_and_si128(a,b); }};
|
2011-01-07 08:26:09 +08:00
|
|
|
struct _VOr8u { __m128i operator()(const __m128i& a, const __m128i& b) const { return _mm_or_si128(a,b); }};
|
2010-05-12 01:44:00 +08:00
|
|
|
struct _VXor8u { __m128i operator()(const __m128i& a, const __m128i& b) const { return _mm_xor_si128(a,b); }};
|
2011-04-17 21:14:45 +08:00
|
|
|
struct _VNot8u { __m128i operator()(const __m128i& a, const __m128i&) const { return _mm_andnot_si128(_mm_setzero_si128(),a); }};
|
|
|
|
|
|
|
|
#endif
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
#if CV_SSE2
|
|
|
|
#define IF_SIMD(op) op
|
2010-05-12 01:44:00 +08:00
|
|
|
#else
|
2011-04-17 21:14:45 +08:00
|
|
|
#define IF_SIMD(op) NOP
|
2010-05-12 01:44:00 +08:00
|
|
|
#endif
|
2011-04-17 21:14:45 +08:00
|
|
|
|
|
|
|
template<> inline uchar OpAdd<uchar>::operator ()(uchar a, uchar b) const
|
|
|
|
{ return CV_FAST_CAST_8U(a + b); }
|
|
|
|
template<> inline uchar OpSub<uchar>::operator ()(uchar a, uchar b) const
|
|
|
|
{ return CV_FAST_CAST_8U(a - b); }
|
|
|
|
|
|
|
|
template<typename T> struct OpAbsDiff
|
2011-01-20 07:27:30 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
typedef T type1;
|
|
|
|
typedef T type2;
|
|
|
|
typedef T rtype;
|
|
|
|
T operator()(T a, T b) const { return (T)std::abs(a - b); }
|
2011-01-20 07:27:30 +08:00
|
|
|
};
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
template<> inline short OpAbsDiff<short>::operator ()(short a, short b) const
|
|
|
|
{ return saturate_cast<short>(std::abs(a - b)); }
|
2011-01-20 07:27:30 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
template<> inline schar OpAbsDiff<schar>::operator ()(schar a, schar b) const
|
|
|
|
{ return saturate_cast<schar>(std::abs(a - b)); }
|
|
|
|
|
|
|
|
template<typename T, typename WT=T> struct OpAbsDiffS
|
2011-01-07 08:26:09 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
typedef T type1;
|
|
|
|
typedef WT type2;
|
|
|
|
typedef T rtype;
|
|
|
|
T operator()(T a, WT b) const { return saturate_cast<T>(std::abs(a - b)); }
|
2011-01-07 08:26:09 +08:00
|
|
|
};
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
template<typename T> struct OpAnd
|
2011-01-07 08:26:09 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
typedef T type1;
|
|
|
|
typedef T type2;
|
|
|
|
typedef T rtype;
|
|
|
|
T operator()( T a, T b ) const { return a & b; }
|
2011-01-07 08:26:09 +08:00
|
|
|
};
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
template<typename T> struct OpOr
|
2011-01-07 08:26:09 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
typedef T type1;
|
|
|
|
typedef T type2;
|
|
|
|
typedef T rtype;
|
|
|
|
T operator()( T a, T b ) const { return a | b; }
|
2011-01-07 08:26:09 +08:00
|
|
|
};
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
template<typename T> struct OpXor
|
2011-01-07 08:26:09 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
typedef T type1;
|
|
|
|
typedef T type2;
|
|
|
|
typedef T rtype;
|
|
|
|
T operator()( T a, T b ) const { return a ^ b; }
|
2011-01-07 08:26:09 +08:00
|
|
|
};
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
template<typename T> struct OpNot
|
2011-01-07 08:26:09 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
typedef T type1;
|
|
|
|
typedef T type2;
|
|
|
|
typedef T rtype;
|
|
|
|
T operator()( T a, T ) const { return ~a; }
|
2011-01-07 08:26:09 +08:00
|
|
|
};
|
2011-04-17 21:14:45 +08:00
|
|
|
|
|
|
|
static inline void fixSteps(Size sz, size_t elemSize, size_t& step1, size_t& step2, size_t& step)
|
|
|
|
{
|
|
|
|
if( sz.height == 1 )
|
|
|
|
step1 = step2 = step = sz.width*elemSize;
|
|
|
|
}
|
|
|
|
|
|
|
|
static void add8u( const uchar* src1, size_t step1,
|
|
|
|
const uchar* src2, size_t step2,
|
|
|
|
uchar* dst, size_t step, Size sz, void* )
|
|
|
|
{
|
|
|
|
IF_IPP(fixSteps(sz, sizeof(dst[0]), step1, step2, step);
|
|
|
|
ippiAdd_8u_C1RSfs(src1, (int)step1, src2, (int)step2, dst, (IppiSize&)sz, 0),
|
|
|
|
(vBinOp8<uchar, OpAdd<uchar>, IF_SIMD(_VAdd8u)>(src1, step1, src2, step2, dst, step, sz)));
|
|
|
|
}
|
2011-01-07 08:26:09 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void add8s( const schar* src1, size_t step1,
|
|
|
|
const schar* src2, size_t step2,
|
|
|
|
schar* dst, size_t step, Size sz, void* )
|
2011-01-07 08:26:09 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
vBinOp8<schar, OpAdd<schar>, IF_SIMD(_VAdd8s)>(src1, step1, src2, step2, dst, step, sz);
|
|
|
|
}
|
2011-01-07 08:26:09 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void add16u( const ushort* src1, size_t step1,
|
|
|
|
const ushort* src2, size_t step2,
|
|
|
|
ushort* dst, size_t step, Size sz, void* )
|
2011-01-09 05:24:31 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
IF_IPP(fixSteps(sz, sizeof(dst[0]), step1, step2, step);
|
|
|
|
ippiAdd_16u_C1RSfs(src1, (int)step1, src2, (int)step2, dst, (IppiSize&)sz, 0),
|
|
|
|
(vBinOp16<ushort, OpAdd<ushort>, IF_SIMD(_VAdd16u)>(src1, step1, src2, step2, dst, step, sz)));
|
|
|
|
}
|
2011-01-09 05:24:31 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void add16s( const short* src1, size_t step1,
|
|
|
|
const short* src2, size_t step2,
|
|
|
|
short* dst, size_t step, Size sz, void* )
|
2011-01-09 05:24:31 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
IF_IPP(fixSteps(sz, sizeof(dst[0]), step1, step2, step);
|
|
|
|
ippiAdd_16s_C1RSfs(src1, (int)step1, src2, (int)step2, dst, (IppiSize&)sz, 0),
|
|
|
|
(vBinOp16<short, OpAdd<short>, IF_SIMD(_VAdd16s)>(src1, step1, src2, step2, dst, step, sz)));
|
|
|
|
}
|
2011-01-09 05:24:31 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void add32s( const int* src1, size_t step1,
|
|
|
|
const int* src2, size_t step2,
|
|
|
|
int* dst, size_t step, Size sz, void* )
|
2011-01-09 05:24:31 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
vBinOp32s<OpAdd<int>, IF_SIMD(_VAdd32s)>(src1, step1, src2, step2, dst, step, sz);
|
|
|
|
}
|
2011-01-09 05:24:31 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void add32f( const float* src1, size_t step1,
|
|
|
|
const float* src2, size_t step2,
|
|
|
|
float* dst, size_t step, Size sz, void* )
|
2011-01-09 05:24:31 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
IF_IPP(fixSteps(sz, sizeof(dst[0]), step1, step2, step);
|
|
|
|
ippiAdd_32f_C1RSfs(src1, (int)step1, src2, (int)step2, dst, (IppiSize&)sz, 0),
|
|
|
|
(vBinOp32f<OpAdd<float>, IF_SIMD(_VAdd32f)>(src1, step1, src2, step2, dst, step, sz)));
|
|
|
|
}
|
2011-01-09 05:24:31 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void add64f( const double* src1, size_t step1,
|
|
|
|
const double* src2, size_t step2,
|
|
|
|
double* dst, size_t step, Size sz, void* )
|
2011-01-09 05:24:31 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
vBinOp64f<OpAdd<double>, IF_SIMD(_VAdd64f)>(src1, step1, src2, step2, dst, step, sz);
|
|
|
|
}
|
2011-01-09 05:24:31 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void sub8u( const uchar* src1, size_t step1,
|
|
|
|
const uchar* src2, size_t step2,
|
|
|
|
uchar* dst, size_t step, Size sz, void* )
|
2011-01-09 05:24:31 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
IF_IPP(fixSteps(sz, sizeof(dst[0]), step1, step2, step);
|
|
|
|
ippiSub_8u_C1RSfs(src2, (int)step2, src1, (int)step1, dst, (IppiSize&)sz, 0),
|
|
|
|
(vBinOp8<uchar, OpSub<uchar>, IF_SIMD(_VSub8u)>(src1, step1, src2, step2, dst, step, sz)));
|
|
|
|
}
|
2011-01-09 05:24:31 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void sub8s( const schar* src1, size_t step1,
|
|
|
|
const schar* src2, size_t step2,
|
|
|
|
schar* dst, size_t step, Size sz, void* )
|
2011-01-10 08:43:14 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
vBinOp8<schar, OpSub<schar>, IF_SIMD(_VSub8s)>(src1, step1, src2, step2, dst, step, sz);
|
|
|
|
}
|
2011-01-10 08:43:14 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void sub16u( const ushort* src1, size_t step1,
|
|
|
|
const ushort* src2, size_t step2,
|
|
|
|
ushort* dst, size_t step, Size sz, void* )
|
2011-01-10 08:43:14 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
IF_IPP(fixSteps(sz, sizeof(dst[0]), step1, step2, step);
|
|
|
|
ippiSub_16u_C1RSfs(src2, (int)step2, src1, (int)step1, dst, (IppiSize&)sz, 0),
|
|
|
|
(vBinOp16<ushort, OpSub<ushort>, IF_SIMD(_VSub16u)>(src1, step1, src2, step2, dst, step, sz)));
|
|
|
|
}
|
2011-01-10 08:43:14 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void sub16s( const short* src1, size_t step1,
|
|
|
|
const short* src2, size_t step2,
|
|
|
|
short* dst, size_t step, Size sz, void* )
|
2011-01-10 08:43:14 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
IF_IPP(fixSteps(sz, sizeof(dst[0]), step1, step2, step);
|
|
|
|
ippiSub_16s_C1RSfs(src2, (int)step2, src1, (int)step1, dst, (IppiSize&)sz, 0),
|
|
|
|
(vBinOp16<short, OpSub<short>, IF_SIMD(_VSub16s)>(src1, step1, src2, step2, dst, step, sz)));
|
|
|
|
}
|
2011-01-10 08:43:14 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void sub32s( const int* src1, size_t step1,
|
|
|
|
const int* src2, size_t step2,
|
|
|
|
int* dst, size_t step, Size sz, void* )
|
2011-01-10 08:43:14 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
vBinOp32s<OpSub<int>, IF_SIMD(_VSub32s)>(src1, step1, src2, step2, dst, step, sz);
|
|
|
|
}
|
2011-01-10 08:43:14 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void sub32f( const float* src1, size_t step1,
|
|
|
|
const float* src2, size_t step2,
|
|
|
|
float* dst, size_t step, Size sz, void* )
|
2011-01-10 08:43:14 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
IF_IPP(fixSteps(sz, sizeof(dst[0]), step1, step2, step);
|
|
|
|
ippiSub_32f_C1RSfs(src2, (int)step2, src1, (int)step1, dst, (IppiSize&)sz, 0),
|
|
|
|
(vBinOp32f<OpSub<float>, IF_SIMD(_VSub32f)>(src1, step1, src2, step2, dst, step, sz)));
|
|
|
|
}
|
2011-01-10 08:43:14 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void sub64f( const double* src1, size_t step1,
|
|
|
|
const double* src2, size_t step2,
|
|
|
|
double* dst, size_t step, Size sz, void* )
|
2011-01-10 08:43:14 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
vBinOp64f<OpSub<double>, IF_SIMD(_VSub64f)>(src1, step1, src2, step2, dst, step, sz);
|
|
|
|
}
|
2011-01-10 08:43:14 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
template<> inline uchar OpMin<uchar>::operator ()(uchar a, uchar b) const { return CV_MIN_8U(a, b); }
|
|
|
|
template<> inline uchar OpMax<uchar>::operator ()(uchar a, uchar b) const { return CV_MAX_8U(a, b); }
|
|
|
|
|
|
|
|
static void max8u( const uchar* src1, size_t step1,
|
|
|
|
const uchar* src2, size_t step2,
|
|
|
|
uchar* dst, size_t step, Size sz, void* )
|
2011-01-10 08:43:14 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
IF_IPP(fixSteps(sz, sizeof(dst[0]), step1, step2, step);
|
|
|
|
ippiMaxEvery_8u_C1R(src1, (int)step1, src2, (int)step2, dst, (IppiSize&)sz),
|
|
|
|
(vBinOp8<uchar, OpMax<uchar>, IF_SIMD(_VMax8u)>(src1, step1, src2, step2, dst, step, sz)));
|
|
|
|
}
|
2011-01-10 08:43:14 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void max8s( const schar* src1, size_t step1,
|
|
|
|
const schar* src2, size_t step2,
|
|
|
|
schar* dst, size_t step, Size sz, void* )
|
2011-01-10 08:43:14 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
vBinOp8<schar, OpMax<schar>, IF_SIMD(_VMax8s)>(src1, step1, src2, step2, dst, step, sz);
|
|
|
|
}
|
2011-01-10 08:43:14 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void max16u( const ushort* src1, size_t step1,
|
|
|
|
const ushort* src2, size_t step2,
|
|
|
|
ushort* dst, size_t step, Size sz, void* )
|
2011-01-10 08:43:14 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
IF_IPP(fixSteps(sz, sizeof(dst[0]), step1, step2, step);
|
|
|
|
ippiMaxEvery_16u_C1R(src1, (int)step1, src2, (int)step2, dst, (IppiSize&)sz),
|
|
|
|
(vBinOp16<ushort, OpMax<ushort>, IF_SIMD(_VMax16u)>(src1, step1, src2, step2, dst, step, sz)));
|
|
|
|
}
|
2011-01-10 08:43:14 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void max16s( const short* src1, size_t step1,
|
|
|
|
const short* src2, size_t step2,
|
|
|
|
short* dst, size_t step, Size sz, void* )
|
2011-01-10 08:43:14 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
IF_IPP(fixSteps(sz, sizeof(dst[0]), step1, step2, step);
|
|
|
|
ippiMaxEvery_16s_C1R(src1, (int)step1, src2, (int)step2, dst, (IppiSize&)sz),
|
|
|
|
(vBinOp16<short, OpMax<short>, IF_SIMD(_VMax16s)>(src1, step1, src2, step2, dst, step, sz)));
|
|
|
|
}
|
2011-01-10 08:43:14 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void max32s( const int* src1, size_t step1,
|
|
|
|
const int* src2, size_t step2,
|
|
|
|
int* dst, size_t step, Size sz, void* )
|
2011-01-10 08:43:14 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
vBinOp32s<OpMax<int>, IF_SIMD(_VMax32s)>(src1, step1, src2, step2, dst, step, sz);
|
|
|
|
}
|
2011-01-10 08:43:14 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void max32f( const float* src1, size_t step1,
|
|
|
|
const float* src2, size_t step2,
|
|
|
|
float* dst, size_t step, Size sz, void* )
|
2011-01-10 08:43:14 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
IF_IPP(fixSteps(sz, sizeof(dst[0]), step1, step2, step);
|
|
|
|
ippiMaxEvery_32f_C1R(src1, (int)step1, src2, (int)step2, dst, (IppiSize&)sz),
|
|
|
|
(vBinOp32f<OpMax<float>, IF_SIMD(_VMax32f)>(src1, step1, src2, step2, dst, step, sz)));
|
|
|
|
}
|
2011-01-10 08:43:14 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void max64f( const double* src1, size_t step1,
|
|
|
|
const double* src2, size_t step2,
|
|
|
|
double* dst, size_t step, Size sz, void* )
|
2011-01-10 08:43:14 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
vBinOp64f<OpMax<double>, IF_SIMD(_VMax64f)>(src1, step1, src2, step2, dst, step, sz);
|
|
|
|
}
|
2011-01-10 08:43:14 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void min8u( const uchar* src1, size_t step1,
|
|
|
|
const uchar* src2, size_t step2,
|
|
|
|
uchar* dst, size_t step, Size sz, void* )
|
2011-01-10 08:43:14 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
IF_IPP(fixSteps(sz, sizeof(dst[0]), step1, step2, step);
|
|
|
|
ippiMinEvery_8u_C1R(src1, (int)step1, src2, (int)step2, dst, (IppiSize&)sz),
|
|
|
|
(vBinOp8<uchar, OpMin<uchar>, IF_SIMD(_VMin8u)>(src1, step1, src2, step2, dst, step, sz)));
|
|
|
|
}
|
2011-01-10 08:43:14 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void min8s( const schar* src1, size_t step1,
|
|
|
|
const schar* src2, size_t step2,
|
|
|
|
schar* dst, size_t step, Size sz, void* )
|
|
|
|
{
|
|
|
|
vBinOp8<schar, OpMin<schar>, IF_SIMD(_VMin8s)>(src1, step1, src2, step2, dst, step, sz);
|
|
|
|
}
|
2011-01-07 08:26:09 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void min16u( const ushort* src1, size_t step1,
|
|
|
|
const ushort* src2, size_t step2,
|
|
|
|
ushort* dst, size_t step, Size sz, void* )
|
|
|
|
{
|
|
|
|
IF_IPP(fixSteps(sz, sizeof(dst[0]), step1, step2, step);
|
|
|
|
ippiMinEvery_16u_C1R(src1, (int)step1, src2, (int)step2, dst, (IppiSize&)sz),
|
|
|
|
(vBinOp16<ushort, OpMin<ushort>, IF_SIMD(_VMin16u)>(src1, step1, src2, step2, dst, step, sz)));
|
|
|
|
}
|
2011-01-07 08:26:09 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void min16s( const short* src1, size_t step1,
|
|
|
|
const short* src2, size_t step2,
|
|
|
|
short* dst, size_t step, Size sz, void* )
|
|
|
|
{
|
|
|
|
IF_IPP(fixSteps(sz, sizeof(dst[0]), step1, step2, step);
|
|
|
|
ippiMinEvery_16s_C1R(src1, (int)step1, src2, (int)step2, dst, (IppiSize&)sz),
|
|
|
|
(vBinOp16<short, OpMin<short>, IF_SIMD(_VMin16s)>(src1, step1, src2, step2, dst, step, sz)));
|
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void min32s( const int* src1, size_t step1,
|
|
|
|
const int* src2, size_t step2,
|
|
|
|
int* dst, size_t step, Size sz, void* )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
vBinOp32s<OpMin<int>, IF_SIMD(_VMin32s)>(src1, step1, src2, step2, dst, step, sz);
|
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void min32f( const float* src1, size_t step1,
|
|
|
|
const float* src2, size_t step2,
|
|
|
|
float* dst, size_t step, Size sz, void* )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
IF_IPP(fixSteps(sz, sizeof(dst[0]), step1, step2, step);
|
|
|
|
ippiMinEvery_32f_C1R(src1, (int)step1, src2, (int)step2, dst, (IppiSize&)sz),
|
|
|
|
(vBinOp32f<OpMin<float>, IF_SIMD(_VMin32f)>(src1, step1, src2, step2, dst, step, sz)));
|
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void min64f( const double* src1, size_t step1,
|
|
|
|
const double* src2, size_t step2,
|
|
|
|
double* dst, size_t step, Size sz, void* )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
vBinOp64f<OpMin<double>, IF_SIMD(_VMin64f)>(src1, step1, src2, step2, dst, step, sz);
|
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void absdiff8u( const uchar* src1, size_t step1,
|
|
|
|
const uchar* src2, size_t step2,
|
|
|
|
uchar* dst, size_t step, Size sz, void* )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
IF_IPP(fixSteps(sz, sizeof(dst[0]), step1, step2, step);
|
|
|
|
ippiAbsDiff_8u_C1R(src1, (int)step1, src2, (int)step2, dst, (IppiSize&)sz),
|
|
|
|
(vBinOp8<uchar, OpAbsDiff<uchar>, IF_SIMD(_VAbsDiff8u)>(src1, step1, src2, step2, dst, step, sz)));
|
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void absdiff8s( const schar* src1, size_t step1,
|
|
|
|
const schar* src2, size_t step2,
|
|
|
|
schar* dst, size_t step, Size sz, void* )
|
|
|
|
{
|
|
|
|
vBinOp8<schar, OpAbsDiff<schar>, IF_SIMD(_VAbsDiff8s)>(src1, step1, src2, step2, dst, step, sz);
|
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void absdiff16u( const ushort* src1, size_t step1,
|
|
|
|
const ushort* src2, size_t step2,
|
|
|
|
ushort* dst, size_t step, Size sz, void* )
|
|
|
|
{
|
|
|
|
IF_IPP(fixSteps(sz, sizeof(dst[0]), step1, step2, step);
|
|
|
|
ippiAbsDiff_16u_C1R(src1, (int)step1, src2, (int)step2, dst, (IppiSize&)sz),
|
|
|
|
(vBinOp16<ushort, OpAbsDiff<ushort>, IF_SIMD(_VAbsDiff16u)>(src1, step1, src2, step2, dst, step, sz)));
|
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void absdiff16s( const short* src1, size_t step1,
|
|
|
|
const short* src2, size_t step2,
|
|
|
|
short* dst, size_t step, Size sz, void* )
|
|
|
|
{
|
|
|
|
IF_IPP(fixSteps(sz, sizeof(dst[0]), step1, step2, step);
|
|
|
|
ippiAbsDiff_16s_C1R(src1, (int)step1, src2, (int)step2, dst, (IppiSize&)sz),
|
|
|
|
(vBinOp16<short, OpAbsDiff<short>, IF_SIMD(_VAbsDiff16s)>(src1, step1, src2, step2, dst, step, sz)));
|
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void absdiff32s( const int* src1, size_t step1,
|
|
|
|
const int* src2, size_t step2,
|
|
|
|
int* dst, size_t step, Size sz, void* )
|
|
|
|
{
|
|
|
|
vBinOp32s<OpAbsDiff<int>, IF_SIMD(_VAbsDiff32s)>(src1, step1, src2, step2, dst, step, sz);
|
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void absdiff32f( const float* src1, size_t step1,
|
|
|
|
const float* src2, size_t step2,
|
|
|
|
float* dst, size_t step, Size sz, void* )
|
|
|
|
{
|
|
|
|
IF_IPP(fixSteps(sz, sizeof(dst[0]), step1, step2, step);
|
|
|
|
ippiAbsDiff_32f_C1R(src1, (int)step1, src2, (int)step2, dst, (IppiSize&)sz),
|
|
|
|
(vBinOp32f<OpAbsDiff<float>, IF_SIMD(_VAbsDiff32f)>(src1, step1, src2, step2, dst, step, sz)));
|
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void absdiff64f( const double* src1, size_t step1,
|
|
|
|
const double* src2, size_t step2,
|
|
|
|
double* dst, size_t step, Size sz, void* )
|
|
|
|
{
|
|
|
|
vBinOp64f<OpAbsDiff<double>, IF_SIMD(_VAbsDiff64f)>(src1, step1, src2, step2, dst, step, sz);
|
|
|
|
}
|
|
|
|
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void and8u( const uchar* src1, size_t step1,
|
|
|
|
const uchar* src2, size_t step2,
|
|
|
|
uchar* dst, size_t step, Size sz, void* )
|
|
|
|
{
|
|
|
|
IF_IPP(fixSteps(sz, sizeof(dst[0]), step1, step2, step);
|
|
|
|
ippiAnd_8u_C1R(src1, (int)step1, src2, (int)step2, dst, (IppiSize&)sz),
|
|
|
|
(vBinOp8<uchar, OpAnd<uchar>, IF_SIMD(_VAnd8u)>(src1, step1, src2, step2, dst, step, sz)));
|
|
|
|
}
|
|
|
|
|
|
|
|
static void or8u( const uchar* src1, size_t step1,
|
|
|
|
const uchar* src2, size_t step2,
|
|
|
|
uchar* dst, size_t step, Size sz, void* )
|
|
|
|
{
|
|
|
|
IF_IPP(fixSteps(sz, sizeof(dst[0]), step1, step2, step);
|
|
|
|
ippiOr_8u_C1R(src1, (int)step1, src2, (int)step2, dst, (IppiSize&)sz),
|
|
|
|
(vBinOp8<uchar, OpOr<uchar>, IF_SIMD(_VOr8u)>(src1, step1, src2, step2, dst, step, sz)));
|
|
|
|
}
|
|
|
|
|
|
|
|
static void xor8u( const uchar* src1, size_t step1,
|
|
|
|
const uchar* src2, size_t step2,
|
|
|
|
uchar* dst, size_t step, Size sz, void* )
|
|
|
|
{
|
|
|
|
IF_IPP(fixSteps(sz, sizeof(dst[0]), step1, step2, step);
|
|
|
|
ippiXor_8u_C1R(src1, (int)step1, src2, (int)step2, dst, (IppiSize&)sz),
|
|
|
|
(vBinOp8<uchar, OpXor<uchar>, IF_SIMD(_VXor8u)>(src1, step1, src2, step2, dst, step, sz)));
|
|
|
|
}
|
|
|
|
|
|
|
|
static void not8u( const uchar* src1, size_t step1,
|
|
|
|
const uchar* src2, size_t step2,
|
|
|
|
uchar* dst, size_t step, Size sz, void* )
|
|
|
|
{
|
|
|
|
IF_IPP(fixSteps(sz, sizeof(dst[0]), step1, step2, step);
|
|
|
|
ippiNot_8u_C1R(src1, (int)step1, dst, (IppiSize&)sz),
|
|
|
|
(vBinOp8<uchar, OpNot<uchar>, IF_SIMD(_VNot8u)>(src1, step1, src2, step2, dst, step, sz)));
|
|
|
|
}
|
|
|
|
|
|
|
|
/****************************************************************************************\
|
|
|
|
* logical operations *
|
|
|
|
\****************************************************************************************/
|
|
|
|
|
|
|
|
static inline bool checkScalar(const Mat& sc, int atype, int sckind, int akind)
|
|
|
|
{
|
|
|
|
if( sc.dims > 2 || (sc.cols != 1 && sc.rows != 1) || !sc.isContinuous() )
|
|
|
|
return false;
|
|
|
|
int cn = CV_MAT_CN(atype);
|
|
|
|
if( akind == InputArray::MATX && sckind != InputArray::MATX )
|
|
|
|
return false;
|
|
|
|
return sc.size() == Size(1, 1) || sc.size() == Size(1, cn) || sc.size() == Size(cn, 1) ||
|
|
|
|
(sc.size() == Size(1, 4) && sc.type() == CV_64F && cn <= 4);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void convertAndUnrollScalar( const Mat& sc, int buftype, uchar* scbuf, size_t blocksize )
|
|
|
|
{
|
|
|
|
int scn = (int)sc.total(), cn = CV_MAT_CN(buftype);
|
|
|
|
size_t esz = CV_ELEM_SIZE(buftype);
|
|
|
|
getConvertFunc(sc.depth(), buftype)(sc.data, 0, 0, 0, scbuf, 0, Size(std::min(cn, scn), 1), 0);
|
|
|
|
// unroll the scalar
|
|
|
|
if( scn < cn )
|
|
|
|
{
|
|
|
|
CV_Assert( scn == 1 );
|
|
|
|
size_t esz1 = CV_ELEM_SIZE1(buftype);
|
|
|
|
for( size_t i = esz1; i < esz; i++ )
|
|
|
|
scbuf[i] = scbuf[i - esz1];
|
|
|
|
}
|
|
|
|
for( size_t i = esz; i < blocksize*esz; i++ )
|
|
|
|
scbuf[i] = scbuf[i - esz];
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
void binary_op(const InputArray& _src1, const InputArray& _src2, OutputArray& _dst,
|
|
|
|
const InputArray& _mask, const BinaryFunc* tab, bool bitwise)
|
|
|
|
{
|
|
|
|
int kind1 = _src1.kind(), kind2 = _src2.kind();
|
|
|
|
Mat src1 = _src1.getMat(), src2 = _src2.getMat();
|
|
|
|
bool haveMask = !_mask.empty(), haveScalar = false;
|
|
|
|
BinaryFunc func;
|
|
|
|
int c;
|
|
|
|
|
|
|
|
if( src1.dims <= 2 && src2.dims <= 2 && kind1 == kind2 &&
|
|
|
|
src1.size() == src2.size() && src1.type() == src2.type() && !haveMask )
|
|
|
|
{
|
|
|
|
_dst.create(src1.size(), src1.type());
|
|
|
|
Mat dst = _dst.getMat();
|
|
|
|
if( bitwise )
|
|
|
|
{
|
|
|
|
func = *tab;
|
|
|
|
c = (int)src1.elemSize();
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
func = tab[src1.depth()];
|
|
|
|
c = src1.channels();
|
|
|
|
}
|
|
|
|
|
|
|
|
Size sz = getContinuousSize(src1, src2, dst, c);
|
|
|
|
func(src1.data, src1.step, src2.data, src2.step, dst.data, dst.step, sz, 0);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if( (kind1 == InputArray::MATX) + (kind2 == InputArray::MATX) == 1 ||
|
|
|
|
src1.size != src2.size || src1.type() != src2.type() )
|
|
|
|
{
|
|
|
|
if( checkScalar(src1, src2.type(), kind1, kind2) )
|
|
|
|
// src1 is a scalar; swap it with src2
|
|
|
|
swap(src1, src2);
|
|
|
|
else if( !checkScalar(src2, src1.type(), kind2, kind1) )
|
|
|
|
CV_Error( CV_StsUnmatchedSizes,
|
|
|
|
"The operation is neither 'array op array' (where arrays have the same size and type), "
|
|
|
|
"nor 'array op scalar', nor 'scalar op array'" );
|
|
|
|
haveScalar = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
size_t esz = src1.elemSize();
|
|
|
|
size_t blocksize0 = (BLOCK_SIZE + esz-1)/esz;
|
|
|
|
int cn = src1.channels();
|
|
|
|
BinaryFunc copymask = 0;
|
|
|
|
Mat mask;
|
|
|
|
|
|
|
|
if( haveMask )
|
|
|
|
{
|
|
|
|
mask = _mask.getMat();
|
|
|
|
CV_Assert( (mask.type() == CV_8UC1 || mask.type() == CV_8SC1) );
|
|
|
|
CV_Assert( mask.size == src1.size );
|
|
|
|
copymask = getCopyMaskFunc(esz);
|
|
|
|
}
|
|
|
|
|
|
|
|
AutoBuffer<uchar> _buf;
|
|
|
|
uchar *scbuf = 0, *maskbuf = 0;
|
|
|
|
|
|
|
|
_dst.create(src1.dims, src1.size, src1.type());
|
|
|
|
Mat dst = _dst.getMat();
|
|
|
|
|
|
|
|
if( bitwise )
|
|
|
|
{
|
|
|
|
func = *tab;
|
|
|
|
c = (int)esz;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
func = tab[src1.depth()];
|
|
|
|
c = cn;
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
2011-04-17 21:14:45 +08:00
|
|
|
|
|
|
|
if( !haveScalar )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
const Mat* arrays[] = { &src1, &src2, &dst, &mask, 0 };
|
|
|
|
uchar* ptrs[4];
|
|
|
|
|
|
|
|
NAryMatIterator it(arrays, ptrs);
|
|
|
|
size_t total = it.size, blocksize = total;
|
|
|
|
|
|
|
|
if( haveMask )
|
|
|
|
{
|
|
|
|
blocksize = std::min(blocksize, blocksize0);
|
|
|
|
_buf.allocate(blocksize*esz);
|
|
|
|
maskbuf = _buf;
|
|
|
|
}
|
|
|
|
|
|
|
|
for( size_t i = 0; i < it.nplanes; i++, ++it )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
for( size_t j = 0; j < total; j += blocksize )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
int bsz = (int)std::min(total - j, blocksize);
|
|
|
|
|
|
|
|
func( ptrs[0], 0, ptrs[1], 0, haveMask ? maskbuf : ptrs[2], 0, Size(bsz*c, 1), 0 );
|
|
|
|
if( haveMask )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
copymask( maskbuf, 0, ptrs[3], 0, ptrs[2], 0, Size(bsz, 1), &esz );
|
|
|
|
ptrs[3] += bsz;
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
2011-04-17 21:14:45 +08:00
|
|
|
|
|
|
|
bsz *= (int)esz;
|
|
|
|
ptrs[0] += bsz; ptrs[1] += bsz; ptrs[2] += bsz;
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
}
|
2011-04-17 21:14:45 +08:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
const Mat* arrays[] = { &src1, &dst, &mask, 0 };
|
|
|
|
uchar* ptrs[3];
|
|
|
|
|
|
|
|
NAryMatIterator it(arrays, ptrs);
|
|
|
|
size_t total = it.size, blocksize = std::min(total, blocksize0);
|
|
|
|
|
|
|
|
_buf.allocate(blocksize*(haveMask ? 2 : 1)*esz + 32);
|
|
|
|
scbuf = _buf;
|
|
|
|
maskbuf = alignPtr(scbuf + blocksize*esz, 16);
|
|
|
|
|
|
|
|
convertAndUnrollScalar( src2, src1.type(), scbuf, blocksize);
|
|
|
|
|
|
|
|
for( size_t i = 0; i < it.nplanes; i++, ++it )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
for( size_t j = 0; j < total; j += blocksize )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
int bsz = (int)std::min(total - j, blocksize);
|
|
|
|
|
|
|
|
func( ptrs[0], 0, scbuf, 0, haveMask ? maskbuf : ptrs[1], 0, Size(bsz*c, 1), 0 );
|
|
|
|
if( haveMask )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
copymask( maskbuf, 0, ptrs[2], 0, ptrs[1], 0, Size(bsz, 1), &esz );
|
|
|
|
ptrs[2] += bsz;
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
2011-04-17 21:14:45 +08:00
|
|
|
|
|
|
|
bsz *= (int)esz;
|
|
|
|
ptrs[0] += bsz; ptrs[1] += bsz;
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2011-04-17 21:14:45 +08:00
|
|
|
|
|
|
|
static BinaryFunc maxTab[] =
|
2010-10-12 20:31:40 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
(BinaryFunc)max8u, (BinaryFunc)max8s, (BinaryFunc)max16u, (BinaryFunc)max16s,
|
|
|
|
(BinaryFunc)max32s, (BinaryFunc)max32f, (BinaryFunc)max64f, 0
|
|
|
|
};
|
2011-01-07 08:26:09 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static BinaryFunc minTab[] =
|
|
|
|
{
|
|
|
|
(BinaryFunc)min8u, (BinaryFunc)min8s, (BinaryFunc)min16u, (BinaryFunc)min16s,
|
|
|
|
(BinaryFunc)min32s, (BinaryFunc)min32f, (BinaryFunc)min64f, 0
|
|
|
|
};
|
2011-01-07 08:26:09 +08:00
|
|
|
|
2010-10-12 20:31:40 +08:00
|
|
|
}
|
2011-04-17 21:14:45 +08:00
|
|
|
|
|
|
|
void cv::bitwise_and(const InputArray& a, const InputArray& b, OutputArray c, const InputArray& mask)
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
BinaryFunc f = and8u;
|
|
|
|
binary_op(a, b, c, mask, &f, true);
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
void cv::bitwise_or(const InputArray& a, const InputArray& b, OutputArray c, const InputArray& mask)
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
BinaryFunc f = or8u;
|
|
|
|
binary_op(a, b, c, mask, &f, true);
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
void cv::bitwise_xor(const InputArray& a, const InputArray& b, OutputArray c, const InputArray& mask)
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
BinaryFunc f = xor8u;
|
|
|
|
binary_op(a, b, c, mask, &f, true);
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
void cv::bitwise_not(const InputArray& a, OutputArray c, const InputArray& mask)
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
BinaryFunc f = not8u;
|
|
|
|
binary_op(a, a, c, mask, &f, true);
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
void cv::max( const InputArray& src1, const InputArray& src2, OutputArray dst )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
binary_op(src1, src2, dst, InputArray(), maxTab, false );
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
void cv::min( const InputArray& src1, const InputArray& src2, OutputArray dst )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
binary_op(src1, src2, dst, InputArray(), minTab, false );
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
void cv::max(const Mat& src1, const Mat& src2, Mat& dst)
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
OutputArray _dst(dst);
|
|
|
|
binary_op(src1, src2, _dst, InputArray(), maxTab, false );
|
|
|
|
}
|
|
|
|
|
|
|
|
void cv::min(const Mat& src1, const Mat& src2, Mat& dst)
|
|
|
|
{
|
|
|
|
OutputArray _dst(dst);
|
|
|
|
binary_op(src1, src2, _dst, InputArray(), minTab, false );
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
2011-04-17 21:14:45 +08:00
|
|
|
|
|
|
|
void cv::max(const Mat& src1, double src2, Mat& dst)
|
|
|
|
{
|
|
|
|
OutputArray _dst(dst);
|
|
|
|
binary_op(src1, src2, _dst, InputArray(), maxTab, false );
|
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
void cv::min(const Mat& src1, double src2, Mat& dst)
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
OutputArray _dst(dst);
|
|
|
|
binary_op(src1, src2, _dst, InputArray(), minTab, false );
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
2011-04-17 21:14:45 +08:00
|
|
|
|
|
|
|
/****************************************************************************************\
|
|
|
|
* add/subtract *
|
|
|
|
\****************************************************************************************/
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
namespace cv
|
|
|
|
{
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
void arithm_op(const InputArray& _src1, const InputArray& _src2, OutputArray& _dst,
|
|
|
|
const InputArray& _mask, int dtype, BinaryFunc* tab, bool muldiv=false, void* usrdata=0)
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
int kind1 = _src1.kind(), kind2 = _src2.kind();
|
|
|
|
Mat src1 = _src1.getMat(), src2 = _src2.getMat();
|
|
|
|
bool haveMask = !_mask.empty();
|
|
|
|
|
|
|
|
if( kind1 == kind2 && src1.dims <= 2 && src2.dims <= 2 &&
|
|
|
|
src1.size() == src2.size() && src1.type() == src2.type() &&
|
|
|
|
!haveMask && ((!_dst.fixedType() && (dtype < 0 || CV_MAT_DEPTH(dtype) == src1.depth())) ||
|
|
|
|
(_dst.fixedType() && _dst.type() == _src1.type())) )
|
2010-10-12 20:31:40 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
_dst.create(src1.size(), src1.type());
|
|
|
|
Mat dst = _dst.getMat();
|
|
|
|
Size sz = getContinuousSize(src1, src2, dst, src1.channels());
|
|
|
|
tab[src1.depth()](src1.data, src1.step, src2.data, src2.step, dst.data, dst.step, sz, usrdata);
|
2010-10-12 20:31:40 +08:00
|
|
|
return;
|
|
|
|
}
|
2011-04-17 21:14:45 +08:00
|
|
|
|
|
|
|
bool haveScalar = false, swapped12 = false;
|
|
|
|
|
|
|
|
if( (kind1 == InputArray::MATX) + (kind2 == InputArray::MATX) == 1 ||
|
|
|
|
src1.size != src2.size || src1.channels() != src2.channels() )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
if( checkScalar(src1, src2.type(), kind1, kind2) )
|
|
|
|
{
|
|
|
|
// src1 is a scalar; swap it with src2
|
|
|
|
swap(src1, src2);
|
|
|
|
swapped12 = true;
|
|
|
|
}
|
|
|
|
else if( !checkScalar(src2, src1.type(), kind2, kind1) )
|
|
|
|
CV_Error( CV_StsUnmatchedSizes,
|
|
|
|
"The operation is neither 'array op array' (where arrays have the same size and the same number of channels), "
|
|
|
|
"nor 'array op scalar', nor 'scalar op array'" );
|
|
|
|
haveScalar = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
int cn = src1.channels(), depth1 = src1.depth(), depth2 = src2.depth(), wtype;
|
|
|
|
BinaryFunc cvtsrc1 = 0, cvtsrc2 = 0, cvtdst = 0;
|
|
|
|
|
|
|
|
if( dtype < 0 )
|
|
|
|
{
|
|
|
|
if( _dst.fixedType() )
|
|
|
|
dtype = _dst.type();
|
|
|
|
else
|
|
|
|
{
|
|
|
|
if( !haveScalar && src1.type() != src2.type() )
|
|
|
|
CV_Error(CV_StsBadArg,
|
|
|
|
"When the input arrays in add/subtract/multiply/divide functions have different types, "
|
|
|
|
"the output array type must be explicitly specified");
|
|
|
|
dtype = src1.type();
|
|
|
|
}
|
|
|
|
}
|
|
|
|
dtype = CV_MAT_DEPTH(dtype);
|
|
|
|
|
|
|
|
if( depth1 == depth2 && dtype == depth1 )
|
|
|
|
wtype = dtype;
|
|
|
|
else if( !muldiv )
|
|
|
|
{
|
|
|
|
wtype = depth1 <= CV_8S && depth2 <= CV_8S ? CV_16S :
|
|
|
|
depth1 <= CV_32S && depth2 <= CV_32S ? CV_32S : std::max(depth1, depth2);
|
|
|
|
wtype = std::max(wtype, dtype);
|
|
|
|
|
|
|
|
// when the result of addition should be converted to an integer type,
|
|
|
|
// and just one of the input arrays is floating-point, it makes sense to convert that input to integer type before the operation,
|
|
|
|
// instead of converting the other input to floating-point and then converting the operation result back to integers.
|
|
|
|
if( dtype < CV_32F && (depth1 < CV_32F || depth2 < CV_32F) )
|
|
|
|
wtype = CV_32S;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
wtype = std::max(depth1, std::max(depth2, CV_32F));
|
|
|
|
wtype = std::max(wtype, dtype);
|
|
|
|
}
|
|
|
|
|
|
|
|
cvtsrc1 = depth1 == wtype ? 0 : getConvertFunc(depth1, wtype);
|
|
|
|
cvtsrc2 = depth2 == depth1 ? cvtsrc1 : depth2 == wtype ? 0 : getConvertFunc(depth2, wtype);
|
|
|
|
cvtdst = dtype == wtype ? 0 : getConvertFunc(wtype, dtype);
|
|
|
|
|
|
|
|
dtype = CV_MAKETYPE(dtype, cn);
|
|
|
|
wtype = CV_MAKETYPE(wtype, cn);
|
|
|
|
|
|
|
|
size_t esz1 = src1.elemSize(), esz2 = src2.elemSize();
|
|
|
|
size_t dsz = CV_ELEM_SIZE(dtype), wsz = CV_ELEM_SIZE(wtype);
|
|
|
|
size_t blocksize0 = (size_t)(BLOCK_SIZE + wsz-1)/wsz;
|
|
|
|
BinaryFunc copymask = 0;
|
|
|
|
Mat mask;
|
|
|
|
|
|
|
|
if( haveMask )
|
|
|
|
{
|
|
|
|
mask = _mask.getMat();
|
|
|
|
CV_Assert( (mask.type() == CV_8UC1 || mask.type() == CV_8SC1) );
|
|
|
|
CV_Assert( mask.size == src1.size );
|
|
|
|
copymask = getCopyMaskFunc(dsz);
|
|
|
|
}
|
|
|
|
|
|
|
|
AutoBuffer<uchar> _buf;
|
|
|
|
uchar *buf, *maskbuf = 0, *buf1 = 0, *buf2 = 0, *wbuf = 0;
|
|
|
|
size_t bufesz = (cvtsrc1 ? wsz : 0) + (cvtsrc2 || haveScalar ? wsz : 0) + (cvtdst ? wsz : 0) + (haveMask ? dsz : 0);
|
|
|
|
|
|
|
|
_dst.create(src1.dims, src1.size, src1.type());
|
|
|
|
Mat dst = _dst.getMat();
|
|
|
|
BinaryFunc func = tab[CV_MAT_DEPTH(wtype)];
|
|
|
|
|
|
|
|
if( !haveScalar )
|
|
|
|
{
|
|
|
|
const Mat* arrays[] = { &src1, &src2, &dst, &mask, 0 };
|
|
|
|
uchar* ptrs[4];
|
|
|
|
|
|
|
|
NAryMatIterator it(arrays, ptrs);
|
|
|
|
size_t total = it.size, blocksize = total;
|
|
|
|
|
|
|
|
if( haveMask || cvtsrc1 || cvtsrc2 || cvtdst )
|
|
|
|
blocksize = std::min(blocksize, blocksize0);
|
|
|
|
|
|
|
|
_buf.allocate(bufesz*blocksize + 64);
|
|
|
|
buf = _buf;
|
|
|
|
if( cvtsrc1 )
|
|
|
|
buf1 = buf, buf = alignPtr(buf + blocksize*wsz, 16);
|
|
|
|
if( cvtsrc2 )
|
|
|
|
buf2 = buf, buf = alignPtr(buf + blocksize*wsz, 16);
|
|
|
|
wbuf = maskbuf = buf;
|
|
|
|
if( cvtdst )
|
|
|
|
buf = alignPtr(buf + blocksize*wsz, 16);
|
|
|
|
if( haveMask )
|
|
|
|
maskbuf = buf;
|
|
|
|
|
|
|
|
for( size_t i = 0; i < it.nplanes; i++, ++it )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
for( size_t j = 0; j < total; j += blocksize )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
int bsz = (int)std::min(total - j, blocksize);
|
|
|
|
Size bszn(bsz*cn, 1);
|
|
|
|
const uchar *sptr1 = ptrs[0], *sptr2 = ptrs[1];
|
|
|
|
uchar* dptr = ptrs[2];
|
|
|
|
if( cvtsrc1 )
|
|
|
|
{
|
|
|
|
cvtsrc1( sptr1, 0, 0, 0, buf1, 0, bszn, 0 );
|
|
|
|
sptr1 = buf1;
|
|
|
|
}
|
|
|
|
if( ptrs[0] == ptrs[1] )
|
|
|
|
sptr2 = sptr1;
|
|
|
|
else if( cvtsrc2 )
|
|
|
|
{
|
|
|
|
cvtsrc2( sptr2, 0, 0, 0, buf2, 0, bszn, 0 );
|
|
|
|
sptr2 = buf2;
|
|
|
|
}
|
|
|
|
|
|
|
|
if( !haveMask && !cvtdst )
|
|
|
|
func( sptr1, 0, sptr2, 0, dptr, 0, bszn, usrdata );
|
|
|
|
else
|
|
|
|
{
|
|
|
|
func( sptr1, 0, sptr2, 0, wbuf, 0, bszn, usrdata );
|
|
|
|
if( !haveMask )
|
|
|
|
cvtdst( wbuf, 0, 0, 0, dptr, 0, bszn, 0 );
|
|
|
|
else if( !cvtdst )
|
|
|
|
{
|
|
|
|
copymask( wbuf, 0, ptrs[3], 0, dptr, 0, Size(bsz, 1), &dsz );
|
|
|
|
ptrs[3] += bsz;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
cvtdst( wbuf, 0, 0, 0, maskbuf, 0, bszn, 0 );
|
|
|
|
copymask( maskbuf, 0, ptrs[3], 0, dptr, 0, Size(bsz, 1), &dsz );
|
|
|
|
ptrs[3] += bsz;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
ptrs[0] += bsz*esz1; ptrs[1] += bsz*esz2; ptrs[2] += bsz*dsz;
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
}
|
2011-04-17 21:14:45 +08:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
const Mat* arrays[] = { &src1, &dst, &mask, 0 };
|
|
|
|
uchar* ptrs[3];
|
|
|
|
|
|
|
|
NAryMatIterator it(arrays, ptrs);
|
|
|
|
size_t total = it.size, blocksize = std::min(total, blocksize0);
|
|
|
|
|
|
|
|
_buf.allocate(bufesz*blocksize + 64);
|
|
|
|
buf = _buf;
|
|
|
|
if( cvtsrc1 )
|
|
|
|
buf1 = buf, buf = alignPtr(buf + blocksize*wsz, 16);
|
|
|
|
buf2 = buf; buf = alignPtr(buf + blocksize*wsz, 16);
|
|
|
|
wbuf = maskbuf = buf;
|
|
|
|
if( cvtdst )
|
|
|
|
buf = alignPtr(buf + blocksize*wsz, 16);
|
|
|
|
if( haveMask )
|
|
|
|
maskbuf = buf;
|
|
|
|
|
|
|
|
convertAndUnrollScalar( src2, wtype, buf2, blocksize);
|
|
|
|
|
|
|
|
for( size_t i = 0; i < it.nplanes; i++, ++it )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
for( size_t j = 0; j < total; j += blocksize )
|
|
|
|
{
|
|
|
|
int bsz = (int)std::min(total - j, blocksize);
|
|
|
|
Size bszn(bsz*cn, 1);
|
|
|
|
const uchar *sptr1 = ptrs[0];
|
|
|
|
const uchar* sptr2 = buf2;
|
|
|
|
uchar* dptr = ptrs[1];
|
|
|
|
|
|
|
|
if( cvtsrc1 )
|
|
|
|
{
|
|
|
|
cvtsrc1( sptr1, 0, 0, 0, buf1, 0, bszn, 0 );
|
|
|
|
sptr1 = buf1;
|
|
|
|
}
|
|
|
|
|
|
|
|
if( swapped12 )
|
|
|
|
std::swap(sptr1, sptr2);
|
|
|
|
|
|
|
|
if( !haveMask && !cvtdst )
|
|
|
|
func( sptr1, 0, sptr2, 0, dptr, 0, bszn, usrdata );
|
|
|
|
else
|
|
|
|
{
|
|
|
|
func( sptr1, 0, sptr2, 0, wbuf, 0, bszn, usrdata );
|
|
|
|
if( !haveMask )
|
|
|
|
cvtdst( wbuf, 0, 0, 0, dptr, 0, bszn, 0 );
|
|
|
|
else if( !cvtdst )
|
|
|
|
{
|
|
|
|
copymask( wbuf, 0, ptrs[2], 0, dptr, 0, Size(bsz, 1), &dsz );
|
|
|
|
ptrs[2] += bsz;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
cvtdst( wbuf, 0, 0, 0, maskbuf, 0, bszn, 0 );
|
|
|
|
copymask( maskbuf, 0, ptrs[2], 0, dptr, 0, Size(bsz, 1), &dsz );
|
|
|
|
ptrs[2] += bsz;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
ptrs[0] += bsz*esz1; ptrs[1] += bsz*dsz;
|
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
2011-04-17 21:14:45 +08:00
|
|
|
|
2010-05-12 01:44:00 +08:00
|
|
|
static BinaryFunc addTab[] =
|
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
(BinaryFunc)add8u, (BinaryFunc)add8s, (BinaryFunc)add16u, (BinaryFunc)add16s,
|
|
|
|
(BinaryFunc)add32s, (BinaryFunc)add32f, (BinaryFunc)add64f, 0
|
2010-05-12 01:44:00 +08:00
|
|
|
};
|
2011-04-17 21:14:45 +08:00
|
|
|
|
2010-05-12 01:44:00 +08:00
|
|
|
static BinaryFunc subTab[] =
|
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
(BinaryFunc)sub8u, (BinaryFunc)sub8s, (BinaryFunc)sub16u, (BinaryFunc)sub16s,
|
|
|
|
(BinaryFunc)sub32s, (BinaryFunc)sub32f, (BinaryFunc)sub64f, 0
|
2010-05-12 01:44:00 +08:00
|
|
|
};
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static BinaryFunc absdiffTab[] =
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
(BinaryFunc)absdiff8u, (BinaryFunc)absdiff8s, (BinaryFunc)absdiff16u,
|
|
|
|
(BinaryFunc)absdiff16s, (BinaryFunc)absdiff32s, (BinaryFunc)absdiff32f,
|
|
|
|
(BinaryFunc)absdiff64f, 0
|
|
|
|
};
|
2010-05-12 01:44:00 +08:00
|
|
|
|
|
|
|
}
|
2011-04-17 21:14:45 +08:00
|
|
|
|
|
|
|
void cv::add( const InputArray& src1, const InputArray& src2, OutputArray dst,
|
|
|
|
const InputArray& mask, int dtype )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
arithm_op(src1, src2, dst, mask, dtype, addTab );
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
void cv::subtract( const InputArray& src1, const InputArray& src2, OutputArray dst,
|
|
|
|
const InputArray& mask, int dtype )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
arithm_op(src1, src2, dst, mask, dtype, subTab );
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
void cv::absdiff( const InputArray& src1, const InputArray& src2, OutputArray dst )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
arithm_op(src1, src2, dst, InputArray(), -1, absdiffTab);
|
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
|
|
|
|
/****************************************************************************************\
|
|
|
|
* multiply/divide *
|
|
|
|
\****************************************************************************************/
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
namespace cv
|
|
|
|
{
|
|
|
|
|
2010-05-12 01:44:00 +08:00
|
|
|
template<typename T, typename WT> static void
|
2011-04-17 21:14:45 +08:00
|
|
|
mul_( const T* src1, size_t step1, const T* src2, size_t step2,
|
|
|
|
T* dst, size_t step, Size size, WT scale )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
step1 /= sizeof(src1[0]);
|
|
|
|
step2 /= sizeof(src2[0]);
|
|
|
|
step /= sizeof(dst[0]);
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
if( scale == (WT)1. )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
for( ; size.height--; src1 += step1, src2 += step2, dst += step )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
for( i = 0; i <= size.width - 4; i += 4 )
|
|
|
|
{
|
2011-01-07 08:26:09 +08:00
|
|
|
T t0;
|
|
|
|
T t1;
|
|
|
|
t0 = saturate_cast<T>(src1[i ] * src2[i ]);
|
|
|
|
t1 = saturate_cast<T>(src1[i+1] * src2[i+1]);
|
|
|
|
dst[i ] = t0;
|
|
|
|
dst[i+1] = t1;
|
2010-05-12 01:44:00 +08:00
|
|
|
|
|
|
|
t0 = saturate_cast<T>(src1[i+2] * src2[i+2]);
|
|
|
|
t1 = saturate_cast<T>(src1[i+3] * src2[i+3]);
|
2011-01-07 08:26:09 +08:00
|
|
|
dst[i+2] = t0;
|
|
|
|
dst[i+3] = t1;
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
for( ; i < size.width; i++ )
|
|
|
|
dst[i] = saturate_cast<T>(src1[i] * src2[i]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
for( ; size.height--; src1 += step1, src2 += step2, dst += step )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
|
|
|
int i;
|
|
|
|
for( i = 0; i <= size.width - 4; i += 4 )
|
|
|
|
{
|
|
|
|
T t0 = saturate_cast<T>(scale*(WT)src1[i]*src2[i]);
|
|
|
|
T t1 = saturate_cast<T>(scale*(WT)src1[i+1]*src2[i+1]);
|
|
|
|
dst[i] = t0; dst[i+1] = t1;
|
|
|
|
|
|
|
|
t0 = saturate_cast<T>(scale*(WT)src1[i+2]*src2[i+2]);
|
|
|
|
t1 = saturate_cast<T>(scale*(WT)src1[i+3]*src2[i+3]);
|
|
|
|
dst[i+2] = t0; dst[i+3] = t1;
|
|
|
|
}
|
|
|
|
|
|
|
|
for( ; i < size.width; i++ )
|
|
|
|
dst[i] = saturate_cast<T>(scale*(WT)src1[i]*src2[i]);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
template<typename T> static void
|
2011-04-17 21:14:45 +08:00
|
|
|
div_( const T* src1, size_t step1, const T* src2, size_t step2,
|
|
|
|
T* dst, size_t step, Size size, double scale )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
step1 /= sizeof(src1[0]);
|
|
|
|
step2 /= sizeof(src2[0]);
|
|
|
|
step /= sizeof(dst[0]);
|
|
|
|
|
|
|
|
for( ; size.height--; src1 += step1, src2 += step2, dst += step )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
|
|
|
int i = 0;
|
|
|
|
for( ; i <= size.width - 4; i += 4 )
|
|
|
|
{
|
|
|
|
if( src2[i] != 0 && src2[i+1] != 0 && src2[i+2] != 0 && src2[i+3] != 0 )
|
|
|
|
{
|
|
|
|
double a = (double)src2[i] * src2[i+1];
|
|
|
|
double b = (double)src2[i+2] * src2[i+3];
|
|
|
|
double d = scale/(a * b);
|
|
|
|
b *= d;
|
|
|
|
a *= d;
|
2011-04-17 21:14:45 +08:00
|
|
|
|
2011-02-10 04:55:11 +08:00
|
|
|
T z0 = saturate_cast<T>(src2[i+1] * ((double)src1[i] * b));
|
|
|
|
T z1 = saturate_cast<T>(src2[i] * ((double)src1[i+1] * b));
|
|
|
|
T z2 = saturate_cast<T>(src2[i+3] * ((double)src1[i+2] * a));
|
|
|
|
T z3 = saturate_cast<T>(src2[i+2] * ((double)src1[i+3] * a));
|
2011-04-17 21:14:45 +08:00
|
|
|
|
2010-05-12 01:44:00 +08:00
|
|
|
dst[i] = z0; dst[i+1] = z1;
|
|
|
|
dst[i+2] = z2; dst[i+3] = z3;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
T z0 = src2[i] != 0 ? saturate_cast<T>(src1[i]*scale/src2[i]) : 0;
|
|
|
|
T z1 = src2[i+1] != 0 ? saturate_cast<T>(src1[i+1]*scale/src2[i+1]) : 0;
|
|
|
|
T z2 = src2[i+2] != 0 ? saturate_cast<T>(src1[i+2]*scale/src2[i+2]) : 0;
|
|
|
|
T z3 = src2[i+3] != 0 ? saturate_cast<T>(src1[i+3]*scale/src2[i+3]) : 0;
|
2011-04-17 21:14:45 +08:00
|
|
|
|
2010-05-12 01:44:00 +08:00
|
|
|
dst[i] = z0; dst[i+1] = z1;
|
|
|
|
dst[i+2] = z2; dst[i+3] = z3;
|
|
|
|
}
|
|
|
|
}
|
2011-04-17 21:14:45 +08:00
|
|
|
|
2010-05-12 01:44:00 +08:00
|
|
|
for( ; i < size.width; i++ )
|
|
|
|
dst[i] = src2[i] != 0 ? saturate_cast<T>(src1[i]*scale/src2[i]) : 0;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
template<typename T> static void
|
2011-04-17 21:14:45 +08:00
|
|
|
recip_( const T*, size_t, const T* src2, size_t step2,
|
|
|
|
T* dst, size_t step, Size size, double scale )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
step2 /= sizeof(src2[0]);
|
|
|
|
step /= sizeof(dst[0]);
|
|
|
|
|
|
|
|
for( ; size.height--; src2 += step2, dst += step )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
|
|
|
int i = 0;
|
|
|
|
for( ; i <= size.width - 4; i += 4 )
|
|
|
|
{
|
|
|
|
if( src2[i] != 0 && src2[i+1] != 0 && src2[i+2] != 0 && src2[i+3] != 0 )
|
|
|
|
{
|
|
|
|
double a = (double)src2[i] * src2[i+1];
|
|
|
|
double b = (double)src2[i+2] * src2[i+3];
|
|
|
|
double d = scale/(a * b);
|
|
|
|
b *= d;
|
|
|
|
a *= d;
|
2011-04-17 21:14:45 +08:00
|
|
|
|
2010-05-12 01:44:00 +08:00
|
|
|
T z0 = saturate_cast<T>(src2[i+1] * b);
|
|
|
|
T z1 = saturate_cast<T>(src2[i] * b);
|
|
|
|
T z2 = saturate_cast<T>(src2[i+3] * a);
|
|
|
|
T z3 = saturate_cast<T>(src2[i+2] * a);
|
2011-04-17 21:14:45 +08:00
|
|
|
|
2010-05-12 01:44:00 +08:00
|
|
|
dst[i] = z0; dst[i+1] = z1;
|
|
|
|
dst[i+2] = z2; dst[i+3] = z3;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
T z0 = src2[i] != 0 ? saturate_cast<T>(scale/src2[i]) : 0;
|
|
|
|
T z1 = src2[i+1] != 0 ? saturate_cast<T>(scale/src2[i+1]) : 0;
|
|
|
|
T z2 = src2[i+2] != 0 ? saturate_cast<T>(scale/src2[i+2]) : 0;
|
|
|
|
T z3 = src2[i+3] != 0 ? saturate_cast<T>(scale/src2[i+3]) : 0;
|
2011-04-17 21:14:45 +08:00
|
|
|
|
2010-05-12 01:44:00 +08:00
|
|
|
dst[i] = z0; dst[i+1] = z1;
|
|
|
|
dst[i+2] = z2; dst[i+3] = z3;
|
|
|
|
}
|
|
|
|
}
|
2011-04-17 21:14:45 +08:00
|
|
|
|
2010-05-12 01:44:00 +08:00
|
|
|
for( ; i < size.width; i++ )
|
|
|
|
dst[i] = src2[i] != 0 ? saturate_cast<T>(scale/src2[i]) : 0;
|
|
|
|
}
|
|
|
|
}
|
2011-04-17 21:14:45 +08:00
|
|
|
|
|
|
|
|
|
|
|
static void mul8u( const uchar* src1, size_t step1, const uchar* src2, size_t step2,
|
|
|
|
uchar* dst, size_t step, Size sz, void* scale)
|
|
|
|
{
|
|
|
|
mul_(src1, step1, src2, step2, dst, step, sz, (float)*(const double*)scale);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void mul8s( const schar* src1, size_t step1, const schar* src2, size_t step2,
|
|
|
|
schar* dst, size_t step, Size sz, void* scale)
|
|
|
|
{
|
|
|
|
mul_(src1, step1, src2, step2, dst, step, sz, (float)*(const double*)scale);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void mul16u( const ushort* src1, size_t step1, const ushort* src2, size_t step2,
|
|
|
|
ushort* dst, size_t step, Size sz, void* scale)
|
|
|
|
{
|
|
|
|
mul_(src1, step1, src2, step2, dst, step, sz, (float)*(const double*)scale);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void mul16s( const short* src1, size_t step1, const short* src2, size_t step2,
|
|
|
|
short* dst, size_t step, Size sz, void* scale)
|
|
|
|
{
|
|
|
|
mul_(src1, step1, src2, step2, dst, step, sz, (float)*(const double*)scale);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void mul32s( const int* src1, size_t step1, const int* src2, size_t step2,
|
|
|
|
int* dst, size_t step, Size sz, void* scale)
|
|
|
|
{
|
|
|
|
mul_(src1, step1, src2, step2, dst, step, sz, *(const double*)scale);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void mul32f( const float* src1, size_t step1, const float* src2, size_t step2,
|
|
|
|
float* dst, size_t step, Size sz, void* scale)
|
|
|
|
{
|
|
|
|
mul_(src1, step1, src2, step2, dst, step, sz, (float)*(const double*)scale);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void mul64f( const double* src1, size_t step1, const double* src2, size_t step2,
|
|
|
|
double* dst, size_t step, Size sz, void* scale)
|
|
|
|
{
|
|
|
|
mul_(src1, step1, src2, step2, dst, step, sz, *(const double*)scale);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void div8u( const uchar* src1, size_t step1, const uchar* src2, size_t step2,
|
|
|
|
uchar* dst, size_t step, Size sz, void* scale)
|
|
|
|
{
|
|
|
|
if( src1 )
|
|
|
|
div_(src1, step1, src2, step2, dst, step, sz, *(const double*)scale);
|
|
|
|
else
|
|
|
|
recip_(src1, step1, src2, step2, dst, step, sz, *(const double*)scale);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void div8s( const schar* src1, size_t step1, const schar* src2, size_t step2,
|
|
|
|
schar* dst, size_t step, Size sz, void* scale)
|
|
|
|
{
|
|
|
|
div_(src1, step1, src2, step2, dst, step, sz, *(const double*)scale);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void div16u( const ushort* src1, size_t step1, const ushort* src2, size_t step2,
|
|
|
|
ushort* dst, size_t step, Size sz, void* scale)
|
|
|
|
{
|
|
|
|
div_(src1, step1, src2, step2, dst, step, sz, *(const double*)scale);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void div16s( const short* src1, size_t step1, const short* src2, size_t step2,
|
|
|
|
short* dst, size_t step, Size sz, void* scale)
|
|
|
|
{
|
|
|
|
div_(src1, step1, src2, step2, dst, step, sz, *(const double*)scale);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void div32s( const int* src1, size_t step1, const int* src2, size_t step2,
|
|
|
|
int* dst, size_t step, Size sz, void* scale)
|
|
|
|
{
|
|
|
|
div_(src1, step1, src2, step2, dst, step, sz, *(const double*)scale);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void div32f( const float* src1, size_t step1, const float* src2, size_t step2,
|
|
|
|
float* dst, size_t step, Size sz, void* scale)
|
|
|
|
{
|
|
|
|
div_(src1, step1, src2, step2, dst, step, sz, *(const double*)scale);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void div64f( const double* src1, size_t step1, const double* src2, size_t step2,
|
|
|
|
double* dst, size_t step, Size sz, void* scale)
|
|
|
|
{
|
|
|
|
div_(src1, step1, src2, step2, dst, step, sz, *(const double*)scale);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void recip8u( const uchar* src1, size_t step1, const uchar* src2, size_t step2,
|
|
|
|
uchar* dst, size_t step, Size sz, void* scale)
|
|
|
|
{
|
|
|
|
recip_(src1, step1, src2, step2, dst, step, sz, *(const double*)scale);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void recip8s( const schar* src1, size_t step1, const schar* src2, size_t step2,
|
|
|
|
schar* dst, size_t step, Size sz, void* scale)
|
|
|
|
{
|
|
|
|
recip_(src1, step1, src2, step2, dst, step, sz, *(const double*)scale);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void recip16u( const ushort* src1, size_t step1, const ushort* src2, size_t step2,
|
|
|
|
ushort* dst, size_t step, Size sz, void* scale)
|
|
|
|
{
|
|
|
|
recip_(src1, step1, src2, step2, dst, step, sz, *(const double*)scale);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void recip16s( const short* src1, size_t step1, const short* src2, size_t step2,
|
|
|
|
short* dst, size_t step, Size sz, void* scale)
|
|
|
|
{
|
|
|
|
recip_(src1, step1, src2, step2, dst, step, sz, *(const double*)scale);
|
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void recip32s( const int* src1, size_t step1, const int* src2, size_t step2,
|
|
|
|
int* dst, size_t step, Size sz, void* scale)
|
|
|
|
{
|
|
|
|
recip_(src1, step1, src2, step2, dst, step, sz, *(const double*)scale);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void recip32f( const float* src1, size_t step1, const float* src2, size_t step2,
|
|
|
|
float* dst, size_t step, Size sz, void* scale)
|
|
|
|
{
|
|
|
|
recip_(src1, step1, src2, step2, dst, step, sz, *(const double*)scale);
|
|
|
|
}
|
|
|
|
|
|
|
|
static void recip64f( const double* src1, size_t step1, const double* src2, size_t step2,
|
|
|
|
double* dst, size_t step, Size sz, void* scale)
|
|
|
|
{
|
|
|
|
recip_(src1, step1, src2, step2, dst, step, sz, *(const double*)scale);
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static BinaryFunc mulTab[] =
|
|
|
|
{
|
|
|
|
(BinaryFunc)mul8u, (BinaryFunc)mul8s, (BinaryFunc)mul16u,
|
|
|
|
(BinaryFunc)mul16s, (BinaryFunc)mul32s, (BinaryFunc)mul32f,
|
|
|
|
(BinaryFunc)mul64f, 0
|
|
|
|
};
|
|
|
|
|
|
|
|
static BinaryFunc divTab[] =
|
|
|
|
{
|
|
|
|
(BinaryFunc)div8u, (BinaryFunc)div8s, (BinaryFunc)div16u,
|
|
|
|
(BinaryFunc)div16s, (BinaryFunc)div32s, (BinaryFunc)div32f,
|
|
|
|
(BinaryFunc)div64f, 0
|
|
|
|
};
|
|
|
|
|
|
|
|
static BinaryFunc recipTab[] =
|
|
|
|
{
|
|
|
|
(BinaryFunc)recip8u, (BinaryFunc)recip8s, (BinaryFunc)recip16u,
|
|
|
|
(BinaryFunc)recip16s, (BinaryFunc)recip32s, (BinaryFunc)recip32f,
|
|
|
|
(BinaryFunc)recip64f, 0
|
|
|
|
};
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
void cv::multiply(const InputArray& src1, const InputArray& src2,
|
|
|
|
OutputArray dst, double scale, int dtype)
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
arithm_op(src1, src2, dst, InputArray(), dtype, mulTab, true, &scale);
|
|
|
|
}
|
2011-01-07 08:26:09 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
void cv::divide(const InputArray& src1, const InputArray& src2,
|
|
|
|
OutputArray dst, double scale, int dtype)
|
|
|
|
{
|
|
|
|
arithm_op(src1, src2, dst, InputArray(), dtype, divTab, true, &scale);
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
void cv::divide(double scale, const InputArray& src2,
|
|
|
|
OutputArray dst, int dtype)
|
|
|
|
{
|
|
|
|
arithm_op(src2, src2, dst, InputArray(), dtype, recipTab, true, &scale);
|
|
|
|
}
|
|
|
|
|
2010-05-12 01:44:00 +08:00
|
|
|
/****************************************************************************************\
|
|
|
|
* addWeighted *
|
|
|
|
\****************************************************************************************/
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
namespace cv
|
|
|
|
{
|
|
|
|
|
2010-05-12 01:44:00 +08:00
|
|
|
template<typename T, typename WT> static void
|
2011-04-17 21:14:45 +08:00
|
|
|
addWeighted_( const T* src1, size_t step1, const T* src2, size_t step2,
|
|
|
|
T* dst, size_t step, Size size, void* _scalars )
|
|
|
|
{
|
|
|
|
const double* scalars = (const double*)_scalars;
|
|
|
|
WT alpha = (WT)scalars[0], beta = (WT)scalars[1], gamma = (WT)scalars[2];
|
|
|
|
step1 /= sizeof(src1[0]);
|
|
|
|
step2 /= sizeof(src2[0]);
|
|
|
|
step /= sizeof(dst[0]);
|
|
|
|
|
|
|
|
for( ; size.height--; src1 += step1, src2 += step2, dst += step )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
int x = 0;
|
|
|
|
for( ; x <= size.width - 4; x += 4 )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
T t0 = saturate_cast<T>(src1[x]*alpha + src2[x]*beta + gamma);
|
|
|
|
T t1 = saturate_cast<T>(src1[x+1]*alpha + src2[x+1]*beta + gamma);
|
|
|
|
dst[x] = t0; dst[x+1] = t1;
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
t0 = saturate_cast<T>(src1[x+2]*alpha + src2[x+2]*beta + gamma);
|
|
|
|
t1 = saturate_cast<T>(src1[x+3]*alpha + src2[x+3]*beta + gamma);
|
|
|
|
dst[x+2] = t0; dst[x+3] = t1;
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
for( ; x < size.width; x++ )
|
|
|
|
dst[x] = saturate_cast<T>(src1[x]*alpha + src2[x]*beta + gamma);
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static void
|
2011-04-17 21:14:45 +08:00
|
|
|
addWeighted8u( const uchar* src1, size_t step1,
|
|
|
|
const uchar* src2, size_t step2,
|
|
|
|
uchar* dst, size_t step, Size size,
|
|
|
|
void* _scalars )
|
|
|
|
{
|
|
|
|
const double* scalars = (const double*)_scalars;
|
|
|
|
float alpha = (float)scalars[0], beta = (float)scalars[1], gamma = (float)scalars[2];
|
|
|
|
|
|
|
|
for( ; size.height--; src1 += step1, src2 += step2, dst += step )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
int x = 0;
|
|
|
|
|
|
|
|
#if CV_SSE2
|
|
|
|
if( USE_SSE2 )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
__m128 a4 = _mm_set1_ps(alpha), b4 = _mm_set1_ps(beta), g4 = _mm_set1_ps(gamma);
|
|
|
|
__m128i z = _mm_setzero_si128();
|
|
|
|
|
|
|
|
for( ; x <= size.width - 8; x += 8 )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
__m128i u = _mm_unpacklo_epi8(_mm_loadl_epi64((const __m128i*)(src1 + x)), z);
|
|
|
|
__m128i v = _mm_unpacklo_epi8(_mm_loadl_epi64((const __m128i*)(src2 + x)), z);
|
|
|
|
|
|
|
|
__m128 u0 = _mm_cvtepi32_ps(_mm_unpacklo_epi16(u, z));
|
|
|
|
__m128 u1 = _mm_cvtepi32_ps(_mm_unpackhi_epi16(u, z));
|
|
|
|
__m128 v0 = _mm_cvtepi32_ps(_mm_unpacklo_epi16(v, z));
|
|
|
|
__m128 v1 = _mm_cvtepi32_ps(_mm_unpackhi_epi16(v, z));
|
|
|
|
|
|
|
|
u0 = _mm_add_ps(_mm_mul_ps(u0, a4), _mm_mul_ps(v0, b4));
|
|
|
|
u1 = _mm_add_ps(_mm_mul_ps(u1, a4), _mm_mul_ps(v1, b4));
|
|
|
|
u0 = _mm_add_ps(u0, g4); u1 = _mm_add_ps(u1, g4);
|
|
|
|
|
|
|
|
u = _mm_packs_epi32(_mm_cvtps_epi32(u0), _mm_cvtps_epi32(u1));
|
|
|
|
u = _mm_packus_epi16(u, u);
|
|
|
|
|
|
|
|
_mm_storel_epi64((__m128i*)(dst + x), u);
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
}
|
2011-04-17 21:14:45 +08:00
|
|
|
#endif
|
|
|
|
for( ; x <= size.width - 4; x += 4 )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
float t0, t1;
|
|
|
|
t0 = CV_8TO32F(src1[x])*alpha + CV_8TO32F(src2[x])*beta + gamma;
|
|
|
|
t1 = CV_8TO32F(src1[x+1])*alpha + CV_8TO32F(src2[x+1])*beta + gamma;
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
dst[x] = saturate_cast<uchar>(t0);
|
|
|
|
dst[x+1] = saturate_cast<uchar>(t1);
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
t0 = CV_8TO32F(src1[x+2])*alpha + CV_8TO32F(src2[x+2])*beta + gamma;
|
|
|
|
t1 = CV_8TO32F(src1[x+3])*alpha + CV_8TO32F(src2[x+3])*beta + gamma;
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
dst[x+2] = saturate_cast<uchar>(t0);
|
|
|
|
dst[x+3] = saturate_cast<uchar>(t1);
|
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
for( ; x < size.width; x++ )
|
|
|
|
{
|
|
|
|
float t0 = CV_8TO32F(src1[x])*alpha + CV_8TO32F(src2[x])*beta + gamma;
|
|
|
|
dst[x] = saturate_cast<uchar>(t0);
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void addWeighted8s( const schar* src1, size_t step1, const schar* src2, size_t step2,
|
|
|
|
schar* dst, size_t step, Size sz, void* scalars )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
addWeighted_<schar, float>(src1, step1, src2, step2, dst, step, sz, scalars);
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void addWeighted16u( const ushort* src1, size_t step1, const ushort* src2, size_t step2,
|
|
|
|
ushort* dst, size_t step, Size sz, void* scalars )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
addWeighted_<ushort, float>(src1, step1, src2, step2, dst, step, sz, scalars);
|
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void addWeighted16s( const short* src1, size_t step1, const short* src2, size_t step2,
|
|
|
|
short* dst, size_t step, Size sz, void* scalars )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
addWeighted_<short, float>(src1, step1, src2, step2, dst, step, sz, scalars);
|
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void addWeighted32s( const int* src1, size_t step1, const int* src2, size_t step2,
|
|
|
|
int* dst, size_t step, Size sz, void* scalars )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
addWeighted_<int, double>(src1, step1, src2, step2, dst, step, sz, scalars);
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void addWeighted32f( const float* src1, size_t step1, const float* src2, size_t step2,
|
|
|
|
float* dst, size_t step, Size sz, void* scalars )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
addWeighted_<float, double>(src1, step1, src2, step2, dst, step, sz, scalars);
|
|
|
|
}
|
2011-01-07 08:26:09 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void addWeighted64f( const double* src1, size_t step1, const double* src2, size_t step2,
|
|
|
|
double* dst, size_t step, Size sz, void* scalars )
|
|
|
|
{
|
|
|
|
addWeighted_<double, double>(src1, step1, src2, step2, dst, step, sz, scalars);
|
|
|
|
}
|
2010-10-12 20:31:40 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static BinaryFunc addWeightedTab[] =
|
|
|
|
{
|
|
|
|
(BinaryFunc)addWeighted8u, (BinaryFunc)addWeighted8s, (BinaryFunc)addWeighted16u,
|
|
|
|
(BinaryFunc)addWeighted16s, (BinaryFunc)addWeighted32s, (BinaryFunc)addWeighted32f,
|
|
|
|
(BinaryFunc)addWeighted64f, 0
|
|
|
|
};
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
void cv::addWeighted( const InputArray& src1, double alpha, const InputArray& src2,
|
|
|
|
double beta, double gamma, OutputArray dst, int dtype )
|
|
|
|
{
|
|
|
|
double scalars[] = {alpha, beta, gamma};
|
|
|
|
arithm_op(src1, src2, dst, InputArray(), dtype, addWeightedTab, true, scalars);
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
|
2010-05-12 01:44:00 +08:00
|
|
|
/****************************************************************************************\
|
2011-04-17 21:14:45 +08:00
|
|
|
* compare *
|
2010-05-12 01:44:00 +08:00
|
|
|
\****************************************************************************************/
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
namespace cv
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
template<typename T> static void
|
|
|
|
cmp_(const T* src1, size_t step1, const T* src2, size_t step2,
|
|
|
|
uchar* dst, size_t step, Size size, int code)
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
step1 /= sizeof(src1[0]);
|
|
|
|
step2 /= sizeof(src2[0]);
|
|
|
|
if( code == CMP_GE || code == CMP_LT )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
std::swap(src1, src2);
|
|
|
|
std::swap(step1, step2);
|
|
|
|
code = code == CMP_GE ? CMP_LE : CMP_GT;
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
2011-04-17 21:14:45 +08:00
|
|
|
|
|
|
|
if( code == CMP_GT || code == CMP_LE )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
int m = code == CMP_GT ? 0 : 255;
|
|
|
|
for( ; size.height--; src1 += step1, src2 += step2, dst += step )
|
|
|
|
{
|
|
|
|
int x = 0;
|
|
|
|
for( ; x <= size.width - 4; x += 4 )
|
|
|
|
{
|
|
|
|
int t0, t1;
|
|
|
|
t0 = -(src1[x] > src2[x]) ^ m;
|
|
|
|
t1 = -(src1[x+1] > src2[x+1]) ^ m;
|
|
|
|
dst[x] = (uchar)t0; dst[x+1] = (uchar)t1;
|
|
|
|
t0 = -(src1[x+2] > src2[x+2]) ^ m;
|
|
|
|
t1 = -(src1[x+3] > src2[x+3]) ^ m;
|
|
|
|
dst[x+2] = (uchar)t0; dst[x+3] = (uchar)t1;
|
|
|
|
}
|
|
|
|
|
|
|
|
for( ; x < size.width; x++ )
|
|
|
|
dst[x] = (uchar)(-(src1[x] > src2[x]) ^ m);
|
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
2011-04-17 21:14:45 +08:00
|
|
|
else if( code == CMP_EQ || code == CMP_NE )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
int m = code == CMP_EQ ? 0 : 255;
|
|
|
|
for( ; size.height--; src1 += step1, src2 += step2, dst += step )
|
|
|
|
{
|
|
|
|
int x = 0;
|
|
|
|
for( ; x <= size.width - 4; x += 4 )
|
|
|
|
{
|
|
|
|
int t0, t1;
|
|
|
|
t0 = -(src1[x] == src2[x]) ^ m;
|
|
|
|
t1 = -(src1[x+1] == src2[x+1]) ^ m;
|
|
|
|
dst[x] = (uchar)t0; dst[x+1] = (uchar)t1;
|
|
|
|
t0 = -(src1[x+2] == src2[x+2]) ^ m;
|
|
|
|
t1 = -(src1[x+3] == src2[x+3]) ^ m;
|
|
|
|
dst[x+2] = (uchar)t0; dst[x+3] = (uchar)t1;
|
|
|
|
}
|
|
|
|
|
|
|
|
for( ; x < size.width; x++ )
|
|
|
|
dst[x] = (uchar)(-(src1[x] == src2[x]) ^ m);
|
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
2011-04-17 21:14:45 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
static void cmp8u(const uchar* src1, size_t step1, const uchar* src2, size_t step2,
|
|
|
|
uchar* dst, size_t step, Size size, void* _cmpop)
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
cmp_(src1, step1, src2, step2, dst, step, size, *(int*)_cmpop);
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void cmp8s(const schar* src1, size_t step1, const schar* src2, size_t step2,
|
|
|
|
uchar* dst, size_t step, Size size, void* _cmpop)
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
cmp_(src1, step1, src2, step2, dst, step, size, *(int*)_cmpop);
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void cmp16u(const ushort* src1, size_t step1, const ushort* src2, size_t step2,
|
|
|
|
uchar* dst, size_t step, Size size, void* _cmpop)
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
cmp_(src1, step1, src2, step2, dst, step, size, *(int*)_cmpop);
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void cmp16s(const short* src1, size_t step1, const short* src2, size_t step2,
|
|
|
|
uchar* dst, size_t step, Size size, void* _cmpop)
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
cmp_(src1, step1, src2, step2, dst, step, size, *(int*)_cmpop);
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void cmp32s(const int* src1, size_t step1, const int* src2, size_t step2,
|
|
|
|
uchar* dst, size_t step, Size size, void* _cmpop)
|
|
|
|
{
|
|
|
|
cmp_(src1, step1, src2, step2, dst, step, size, *(int*)_cmpop);
|
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void cmp32f(const float* src1, size_t step1, const float* src2, size_t step2,
|
|
|
|
uchar* dst, size_t step, Size size, void* _cmpop)
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
cmp_(src1, step1, src2, step2, dst, step, size, *(int*)_cmpop);
|
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void cmp64f(const double* src1, size_t step1, const double* src2, size_t step2,
|
|
|
|
uchar* dst, size_t step, Size size, void* _cmpop)
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
cmp_(src1, step1, src2, step2, dst, step, size, *(int*)_cmpop);
|
|
|
|
}
|
|
|
|
|
|
|
|
static BinaryFunc cmpTab[] =
|
|
|
|
{
|
|
|
|
(BinaryFunc)cmp8u, (BinaryFunc)cmp8s, (BinaryFunc)cmp16u,
|
|
|
|
(BinaryFunc)cmp16s, (BinaryFunc)cmp32s, (BinaryFunc)cmp32f,
|
|
|
|
(BinaryFunc)cmp64f, 0
|
2010-05-12 01:44:00 +08:00
|
|
|
};
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
|
|
|
|
static double getMinVal(int depth)
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
static const double tab[] = {0, -128, 0, -32768, INT_MIN, -FLT_MAX, -DBL_MAX, 0};
|
|
|
|
return tab[depth];
|
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static double getMaxVal(int depth)
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
static const double tab[] = {255, 127, 65535, 32767, INT_MAX, FLT_MAX, DBL_MAX, 0};
|
|
|
|
return tab[depth];
|
|
|
|
}
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
void cv::compare(const InputArray& _src1, const InputArray& _src2, OutputArray _dst, int op)
|
|
|
|
{
|
|
|
|
CV_Assert( op == CMP_LT || op == CMP_LE || op == CMP_EQ ||
|
|
|
|
op == CMP_NE || op == CMP_GE || op == CMP_GT );
|
|
|
|
|
|
|
|
int kind1 = _src1.kind(), kind2 = _src2.kind();
|
|
|
|
Mat src1 = _src1.getMat(), src2 = _src2.getMat();
|
|
|
|
|
|
|
|
if( kind1 == kind2 && src1.dims <= 2 && src2.dims <= 2 && src1.size() == src2.size() && src1.type() == src2.type() )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
_dst.create(src1.size(), CV_8UC1);
|
|
|
|
Mat dst = _dst.getMat();
|
|
|
|
Size sz = getContinuousSize(src1, src2, dst, src1.channels());
|
|
|
|
cmpTab[src1.depth()](src1.data, src1.step, src2.data, src2.step, dst.data, dst.step, sz, &op);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
bool haveScalar = false;
|
|
|
|
|
|
|
|
if( (kind1 == InputArray::MATX) + (kind2 == InputArray::MATX) == 1 ||
|
|
|
|
src1.size != src2.size || src1.type() != src2.type() )
|
|
|
|
{
|
|
|
|
if( checkScalar(src1, src2.type(), kind1, kind2) )
|
2011-01-07 08:26:09 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
// src1 is a scalar; swap it with src2
|
|
|
|
swap(src1, src2);
|
|
|
|
op = op == CMP_LT ? CMP_GT : op == CMP_LE ? CMP_GE :
|
|
|
|
op == CMP_GE ? CMP_LE : op == CMP_GT ? CMP_LT : op;
|
|
|
|
}
|
|
|
|
else if( !checkScalar(src2, src1.type(), kind2, kind1) )
|
|
|
|
CV_Error( CV_StsUnmatchedSizes,
|
|
|
|
"The operation is neither 'array op array' (where arrays have the same size and the same type), "
|
|
|
|
"nor 'array op scalar', nor 'scalar op array'" );
|
|
|
|
haveScalar = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
int cn = src1.channels(), depth1 = src1.depth(), depth2 = src2.depth();
|
|
|
|
if( cn != 1 )
|
|
|
|
CV_Error( CV_StsUnsupportedFormat, "compare() can only process single-channel arrays" );
|
|
|
|
|
|
|
|
size_t esz = src1.elemSize();
|
|
|
|
size_t blocksize0 = (size_t)(BLOCK_SIZE + esz-1)/esz;
|
|
|
|
|
|
|
|
_dst.create(src1.dims, src1.size, CV_8U);
|
|
|
|
Mat dst = _dst.getMat();
|
|
|
|
BinaryFunc func = cmpTab[depth1];
|
|
|
|
|
|
|
|
if( !haveScalar )
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
const Mat* arrays[] = { &src1, &src2, &dst, 0 };
|
|
|
|
uchar* ptrs[3];
|
|
|
|
|
|
|
|
NAryMatIterator it(arrays, ptrs);
|
|
|
|
size_t total = it.size;
|
|
|
|
|
|
|
|
for( size_t i = 0; i < it.nplanes; i++, ++it )
|
|
|
|
func( ptrs[0], 0, ptrs[1], 0, ptrs[2], 0, Size((int)total, 1), &op );
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
2011-04-17 21:14:45 +08:00
|
|
|
else
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
const Mat* arrays[] = { &src1, &dst, 0 };
|
|
|
|
uchar* ptrs[2];
|
|
|
|
|
|
|
|
NAryMatIterator it(arrays, ptrs);
|
|
|
|
size_t total = it.size, blocksize = std::min(total, blocksize0);
|
|
|
|
|
|
|
|
AutoBuffer<uchar> _buf(blocksize*esz);
|
|
|
|
uchar *buf = _buf;
|
|
|
|
|
|
|
|
if( depth1 > CV_32S )
|
|
|
|
convertAndUnrollScalar( src2, depth1, buf, blocksize );
|
|
|
|
else
|
2011-01-07 08:26:09 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
double fval=0;
|
|
|
|
getConvertFunc(depth2, CV_64F)(src2.data, 0, 0, 0, (uchar*)&fval, 0, Size(1,1), 0);
|
|
|
|
if( fval < getMinVal(depth1) )
|
|
|
|
{
|
|
|
|
dst = Scalar::all(op == CMP_GT || op == CMP_GE || op == CMP_NE ? 255 : 0);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
if( fval > getMaxVal(depth1) )
|
|
|
|
{
|
|
|
|
dst = Scalar::all(op == CMP_LT || op == CMP_LE || op == CMP_NE ? 255 : 0);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
|
|
|
int ival = cvRound(fval);
|
|
|
|
if( fval != ival )
|
|
|
|
{
|
|
|
|
if( op == CMP_LT || op == CMP_GE )
|
|
|
|
ival = cvCeil(fval);
|
|
|
|
else if( op == CMP_LE || op == CMP_GT )
|
|
|
|
ival = cvFloor(fval);
|
|
|
|
else
|
|
|
|
{
|
|
|
|
dst = Scalar::all(op == CMP_NE ? 255 : 0);
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
convertAndUnrollScalar(Mat(1, 1, CV_32S, &ival), depth1, buf, blocksize);
|
|
|
|
}
|
|
|
|
|
|
|
|
for( size_t i = 0; i < it.nplanes; i++, ++it )
|
2011-01-07 08:26:09 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
for( size_t j = 0; j < total; j += blocksize )
|
|
|
|
{
|
|
|
|
int bsz = (int)std::min(total - j, blocksize);
|
|
|
|
func( ptrs[0], 0, buf, 0, ptrs[1], 0, Size(bsz, 1), &op);
|
|
|
|
ptrs[0] += bsz*esz;
|
|
|
|
ptrs[1] += bsz;
|
|
|
|
}
|
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
2011-04-17 21:14:45 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/****************************************************************************************\
|
|
|
|
* inRange *
|
|
|
|
\****************************************************************************************/
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
namespace cv
|
|
|
|
{
|
2011-01-07 08:26:09 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
template<typename T> static void
|
|
|
|
inRange_(const T* src1, size_t step1, const T* src2, size_t step2,
|
|
|
|
const T* src3, size_t step3, uchar* dst, size_t step,
|
|
|
|
Size size)
|
|
|
|
{
|
|
|
|
step1 /= sizeof(src1[0]);
|
|
|
|
step2 /= sizeof(src2[0]);
|
|
|
|
step3 /= sizeof(src3[0]);
|
|
|
|
|
|
|
|
for( ; size.height--; src1 += step1, src2 += step2, src3 += step3, dst += step )
|
2010-10-12 20:31:40 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
int x = 0;
|
|
|
|
for( ; x <= size.width - 4; x += 4 )
|
2010-10-12 20:31:40 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
int t0, t1;
|
|
|
|
t0 = src2[x] <= src1[x] && src1[x] <= src3[x];
|
|
|
|
t1 = src2[x+1] <= src1[x+1] && src1[x+1] <= src3[x+1];
|
|
|
|
dst[x] = (uchar)-t0; dst[x+1] = (uchar)-t1;
|
|
|
|
t0 = src2[x+2] <= src1[x+2] && src1[x+2] <= src3[x+2];
|
|
|
|
t1 = src2[x+3] <= src1[x+3] && src1[x+3] <= src3[x+3];
|
|
|
|
dst[x+2] = (uchar)-t0; dst[x+3] = (uchar)-t1;
|
2010-10-12 20:31:40 +08:00
|
|
|
}
|
2011-04-17 21:14:45 +08:00
|
|
|
|
|
|
|
for( ; x < size.width; x++ )
|
|
|
|
dst[x] = (uchar)-(src2[x] <= src1[x] && src1[x] <= src3[x]);
|
2010-10-12 20:31:40 +08:00
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
|
|
|
|
static void inRange8u(const uchar* src1, size_t step1, const uchar* src2, size_t step2,
|
|
|
|
const uchar* src3, size_t step3, uchar* dst, size_t step, Size size)
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
inRange_(src1, step1, src2, step2, src3, step3, dst, step, size);
|
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void inRange8s(const schar* src1, size_t step1, const schar* src2, size_t step2,
|
|
|
|
const schar* src3, size_t step3, uchar* dst, size_t step, Size size)
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
inRange_(src1, step1, src2, step2, src3, step3, dst, step, size);
|
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void inRange16u(const ushort* src1, size_t step1, const ushort* src2, size_t step2,
|
|
|
|
const ushort* src3, size_t step3, uchar* dst, size_t step, Size size)
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
inRange_(src1, step1, src2, step2, src3, step3, dst, step, size);
|
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void inRange16s(const short* src1, size_t step1, const short* src2, size_t step2,
|
|
|
|
const short* src3, size_t step3, uchar* dst, size_t step, Size size)
|
|
|
|
{
|
|
|
|
inRange_(src1, step1, src2, step2, src3, step3, dst, step, size);
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void inRange32s(const int* src1, size_t step1, const int* src2, size_t step2,
|
|
|
|
const int* src3, size_t step3, uchar* dst, size_t step, Size size)
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
inRange_(src1, step1, src2, step2, src3, step3, dst, step, size);
|
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void inRange32f(const float* src1, size_t step1, const float* src2, size_t step2,
|
|
|
|
const float* src3, size_t step3, uchar* dst, size_t step, Size size)
|
|
|
|
{
|
|
|
|
inRange_(src1, step1, src2, step2, src3, step3, dst, step, size);
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void inRange64f(const double* src1, size_t step1, const double* src2, size_t step2,
|
|
|
|
const double* src3, size_t step3, uchar* dst, size_t step, Size size)
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
inRange_(src1, step1, src2, step2, src3, step3, dst, step, size);
|
|
|
|
}
|
2011-01-07 08:26:09 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static void inRangeReduce(const uchar* src, uchar* dst, size_t len, int cn)
|
|
|
|
{
|
|
|
|
int k = cn % 4 ? cn % 4 : 4;
|
|
|
|
size_t i, j;
|
|
|
|
if( k == 1 )
|
|
|
|
for( i = j = 0; i < len; i++, j += cn )
|
|
|
|
dst[i] = src[j];
|
|
|
|
else if( k == 2 )
|
|
|
|
for( i = j = 0; i < len; i++, j += cn )
|
|
|
|
dst[i] = src[j] & src[j+1];
|
|
|
|
else if( k == 3 )
|
|
|
|
for( i = j = 0; i < len; i++, j += cn )
|
|
|
|
dst[i] = src[j] & src[j+1] & src[j+2];
|
|
|
|
else
|
|
|
|
for( i = j = 0; i < len; i++, j += cn )
|
|
|
|
dst[i] = src[j] & src[j+1] & src[j+2] & src[j+3];
|
|
|
|
|
|
|
|
for( ; k < cn; k += 4 )
|
|
|
|
{
|
|
|
|
for( i = 0, j = k; i < len; i++, j += cn )
|
|
|
|
dst[i] &= src[j] & src[j+1] & src[j+2] & src[j+3];
|
2010-10-12 20:31:40 +08:00
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
2011-04-17 21:14:45 +08:00
|
|
|
|
|
|
|
typedef void (*InRangeFunc)( const uchar* src1, size_t step1, const uchar* src2, size_t step2,
|
|
|
|
const uchar* src3, size_t step3, uchar* dst, size_t step, Size sz );
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
static InRangeFunc inRangeTab[] =
|
2010-05-12 01:44:00 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
(InRangeFunc)inRange8u, (InRangeFunc)inRange8s, (InRangeFunc)inRange16u,
|
|
|
|
(InRangeFunc)inRange16s, (InRangeFunc)inRange32s, (InRangeFunc)inRange32f,
|
|
|
|
(InRangeFunc)inRange64f, 0
|
|
|
|
};
|
|
|
|
|
|
|
|
}
|
|
|
|
|
|
|
|
void cv::inRange(const InputArray& _src, const InputArray& _lowerb,
|
|
|
|
const InputArray& _upperb, OutputArray _dst)
|
|
|
|
{
|
|
|
|
int skind = _src.kind(), lkind = _lowerb.kind(), ukind = _upperb.kind();
|
|
|
|
Mat src = _src.getMat(), lb = _lowerb.getMat(), ub = _upperb.getMat();
|
|
|
|
|
|
|
|
bool lbScalar = false, ubScalar = false;
|
|
|
|
|
|
|
|
if( (lkind == InputArray::MATX && skind != InputArray::MATX) ||
|
|
|
|
src.size != lb.size || src.type() != lb.type() )
|
|
|
|
{
|
|
|
|
if( !checkScalar(lb, src.type(), lkind, skind) )
|
|
|
|
CV_Error( CV_StsUnmatchedSizes,
|
|
|
|
"The lower bounary is neither an array of the same size and same type as src, nor a scalar");
|
|
|
|
lbScalar = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
if( (ukind == InputArray::MATX && skind != InputArray::MATX) ||
|
|
|
|
src.size != ub.size || src.type() != ub.type() )
|
|
|
|
{
|
|
|
|
if( !checkScalar(ub, src.type(), ukind, skind) )
|
|
|
|
CV_Error( CV_StsUnmatchedSizes,
|
|
|
|
"The upper bounary is neither an array of the same size and same type as src, nor a scalar");
|
|
|
|
ubScalar = true;
|
|
|
|
}
|
|
|
|
|
|
|
|
CV_Assert( ((int)lbScalar ^ (int)ubScalar) == 0 );
|
|
|
|
|
|
|
|
int cn = src.channels(), depth = src.depth();
|
|
|
|
|
|
|
|
size_t esz = src.elemSize();
|
|
|
|
size_t blocksize0 = (size_t)(BLOCK_SIZE + esz-1)/esz;
|
|
|
|
|
|
|
|
_dst.create(src.dims, src.size, CV_8U);
|
|
|
|
Mat dst = _dst.getMat();
|
|
|
|
InRangeFunc func = inRangeTab[depth];
|
|
|
|
|
|
|
|
const Mat* arrays_sc[] = { &src, &dst, 0 };
|
|
|
|
const Mat* arrays_nosc[] = { &src, &dst, &lb, &ub, 0 };
|
|
|
|
uchar* ptrs[4];
|
|
|
|
|
|
|
|
NAryMatIterator it(lbScalar && ubScalar ? arrays_sc : arrays_nosc, ptrs);
|
|
|
|
size_t total = it.size, blocksize = std::min(total, blocksize0);
|
|
|
|
|
|
|
|
AutoBuffer<uchar> _buf(blocksize*(((int)lbScalar + (int)ubScalar)*esz + cn) + 2*cn*sizeof(int) + 128);
|
|
|
|
uchar *buf = _buf, *mbuf = buf, *lbuf = 0, *ubuf = 0;
|
|
|
|
buf = alignPtr(buf + blocksize*cn, 16);
|
|
|
|
|
|
|
|
if( lbScalar && ubScalar )
|
|
|
|
{
|
|
|
|
lbuf = buf;
|
|
|
|
ubuf = buf = alignPtr(buf + blocksize*esz, 16);
|
|
|
|
|
|
|
|
CV_Assert( lb.type() == ub.type() );
|
|
|
|
int scdepth = lb.depth();
|
|
|
|
|
|
|
|
if( scdepth != depth && depth < CV_32S )
|
|
|
|
{
|
|
|
|
int* ilbuf = (int*)alignPtr(buf + blocksize*esz, 16);
|
|
|
|
int* iubuf = ilbuf + cn;
|
|
|
|
|
|
|
|
BinaryFunc sccvtfunc = getConvertFunc(scdepth, CV_32S);
|
|
|
|
sccvtfunc(lb.data, 0, 0, 0, (uchar*)ilbuf, 0, Size(cn, 1), 0);
|
|
|
|
sccvtfunc(ub.data, 0, 0, 0, (uchar*)iubuf, 0, Size(cn, 1), 0);
|
|
|
|
int minval = getMinVal(depth), maxval = getMaxVal(depth);
|
|
|
|
|
|
|
|
for( int k = 0; k < cn; k++ )
|
|
|
|
{
|
|
|
|
if( ilbuf[k] > iubuf[k] || ilbuf[k] > maxval || iubuf[k] < minval )
|
|
|
|
ilbuf[k] = minval+1, iubuf[k] = minval;
|
|
|
|
}
|
|
|
|
lb = Mat(cn, 1, CV_32S, ilbuf);
|
|
|
|
ub = Mat(cn, 1, CV_32S, iubuf);
|
|
|
|
}
|
|
|
|
|
|
|
|
convertAndUnrollScalar( lb, src.type(), lbuf, blocksize );
|
|
|
|
convertAndUnrollScalar( ub, src.type(), ubuf, blocksize );
|
|
|
|
}
|
|
|
|
|
|
|
|
for( size_t i = 0; i < it.nplanes; i++, ++it )
|
2010-10-12 20:31:40 +08:00
|
|
|
{
|
2011-04-17 21:14:45 +08:00
|
|
|
for( size_t j = 0; j < total; j += blocksize )
|
|
|
|
{
|
|
|
|
int bsz = (int)std::min(total - j, blocksize);
|
|
|
|
size_t delta = bsz*esz;
|
|
|
|
uchar *lptr = lbuf, *uptr = ubuf;
|
|
|
|
if( !lbScalar )
|
|
|
|
{
|
|
|
|
lptr = ptrs[2];
|
|
|
|
ptrs[2] += delta;
|
|
|
|
}
|
|
|
|
if( !ubScalar )
|
|
|
|
{
|
|
|
|
int idx = !lbScalar ? 3 : 2;
|
|
|
|
uptr = ptrs[idx];
|
|
|
|
ptrs[idx] += delta;
|
|
|
|
}
|
|
|
|
func( ptrs[0], 0, lptr, 0, uptr, 0, cn == 1 ? ptrs[1] : mbuf, 0, Size(bsz*cn, 1));
|
|
|
|
if( cn > 1 )
|
|
|
|
inRangeReduce(mbuf, ptrs[1], bsz, cn);
|
|
|
|
ptrs[0] += delta;
|
|
|
|
ptrs[1] += bsz;
|
|
|
|
}
|
2010-10-12 20:31:40 +08:00
|
|
|
}
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/****************************************************************************************\
|
|
|
|
* Earlier API: cvAdd etc. *
|
|
|
|
\****************************************************************************************/
|
|
|
|
|
|
|
|
CV_IMPL void
|
|
|
|
cvNot( const CvArr* srcarr, CvArr* dstarr )
|
|
|
|
{
|
|
|
|
cv::Mat src = cv::cvarrToMat(srcarr), dst = cv::cvarrToMat(dstarr);
|
2010-10-20 20:33:57 +08:00
|
|
|
CV_Assert( src.size == dst.size && src.type() == dst.type() );
|
2010-05-12 01:44:00 +08:00
|
|
|
cv::bitwise_not( src, dst );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
CV_IMPL void
|
|
|
|
cvAnd( const CvArr* srcarr1, const CvArr* srcarr2, CvArr* dstarr, const CvArr* maskarr )
|
|
|
|
{
|
|
|
|
cv::Mat src1 = cv::cvarrToMat(srcarr1), src2 = cv::cvarrToMat(srcarr2),
|
|
|
|
dst = cv::cvarrToMat(dstarr), mask;
|
2010-10-20 20:33:57 +08:00
|
|
|
CV_Assert( src1.size == dst.size && src1.type() == dst.type() );
|
2010-05-12 01:44:00 +08:00
|
|
|
if( maskarr )
|
|
|
|
mask = cv::cvarrToMat(maskarr);
|
|
|
|
cv::bitwise_and( src1, src2, dst, mask );
|
|
|
|
}
|
|
|
|
|
2011-01-07 08:26:09 +08:00
|
|
|
|
2010-05-12 01:44:00 +08:00
|
|
|
CV_IMPL void
|
|
|
|
cvOr( const CvArr* srcarr1, const CvArr* srcarr2, CvArr* dstarr, const CvArr* maskarr )
|
|
|
|
{
|
|
|
|
cv::Mat src1 = cv::cvarrToMat(srcarr1), src2 = cv::cvarrToMat(srcarr2),
|
|
|
|
dst = cv::cvarrToMat(dstarr), mask;
|
2010-10-20 20:33:57 +08:00
|
|
|
CV_Assert( src1.size == dst.size && src1.type() == dst.type() );
|
2010-05-12 01:44:00 +08:00
|
|
|
if( maskarr )
|
|
|
|
mask = cv::cvarrToMat(maskarr);
|
|
|
|
cv::bitwise_or( src1, src2, dst, mask );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
CV_IMPL void
|
|
|
|
cvXor( const CvArr* srcarr1, const CvArr* srcarr2, CvArr* dstarr, const CvArr* maskarr )
|
|
|
|
{
|
|
|
|
cv::Mat src1 = cv::cvarrToMat(srcarr1), src2 = cv::cvarrToMat(srcarr2),
|
|
|
|
dst = cv::cvarrToMat(dstarr), mask;
|
2010-10-20 20:33:57 +08:00
|
|
|
CV_Assert( src1.size == dst.size && src1.type() == dst.type() );
|
2010-05-12 01:44:00 +08:00
|
|
|
if( maskarr )
|
|
|
|
mask = cv::cvarrToMat(maskarr);
|
|
|
|
cv::bitwise_xor( src1, src2, dst, mask );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
CV_IMPL void
|
|
|
|
cvAndS( const CvArr* srcarr, CvScalar s, CvArr* dstarr, const CvArr* maskarr )
|
|
|
|
{
|
|
|
|
cv::Mat src = cv::cvarrToMat(srcarr), dst = cv::cvarrToMat(dstarr), mask;
|
2010-10-20 20:33:57 +08:00
|
|
|
CV_Assert( src.size == dst.size && src.type() == dst.type() );
|
2010-05-12 01:44:00 +08:00
|
|
|
if( maskarr )
|
|
|
|
mask = cv::cvarrToMat(maskarr);
|
2011-04-17 21:14:45 +08:00
|
|
|
cv::bitwise_and( src, (const cv::Scalar&)s, dst, mask );
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
CV_IMPL void
|
|
|
|
cvOrS( const CvArr* srcarr, CvScalar s, CvArr* dstarr, const CvArr* maskarr )
|
|
|
|
{
|
|
|
|
cv::Mat src = cv::cvarrToMat(srcarr), dst = cv::cvarrToMat(dstarr), mask;
|
2010-10-20 20:33:57 +08:00
|
|
|
CV_Assert( src.size == dst.size && src.type() == dst.type() );
|
2010-05-12 01:44:00 +08:00
|
|
|
if( maskarr )
|
|
|
|
mask = cv::cvarrToMat(maskarr);
|
2011-04-17 21:14:45 +08:00
|
|
|
cv::bitwise_or( src, (const cv::Scalar&)s, dst, mask );
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
CV_IMPL void
|
|
|
|
cvXorS( const CvArr* srcarr, CvScalar s, CvArr* dstarr, const CvArr* maskarr )
|
|
|
|
{
|
|
|
|
cv::Mat src = cv::cvarrToMat(srcarr), dst = cv::cvarrToMat(dstarr), mask;
|
2010-10-20 20:33:57 +08:00
|
|
|
CV_Assert( src.size == dst.size && src.type() == dst.type() );
|
2010-05-12 01:44:00 +08:00
|
|
|
if( maskarr )
|
|
|
|
mask = cv::cvarrToMat(maskarr);
|
2011-04-17 21:14:45 +08:00
|
|
|
cv::bitwise_xor( src, (const cv::Scalar&)s, dst, mask );
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
2011-01-07 08:26:09 +08:00
|
|
|
|
2010-05-12 01:44:00 +08:00
|
|
|
CV_IMPL void cvAdd( const CvArr* srcarr1, const CvArr* srcarr2, CvArr* dstarr, const CvArr* maskarr )
|
|
|
|
{
|
|
|
|
cv::Mat src1 = cv::cvarrToMat(srcarr1), src2 = cv::cvarrToMat(srcarr2),
|
|
|
|
dst = cv::cvarrToMat(dstarr), mask;
|
2011-04-17 21:14:45 +08:00
|
|
|
CV_Assert( src1.size == dst.size && src1.channels() == dst.channels() );
|
2010-05-12 01:44:00 +08:00
|
|
|
if( maskarr )
|
|
|
|
mask = cv::cvarrToMat(maskarr);
|
2011-04-17 21:14:45 +08:00
|
|
|
cv::add( src1, src2, dst, mask, dst.type() );
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
2011-01-07 08:26:09 +08:00
|
|
|
|
2010-05-12 01:44:00 +08:00
|
|
|
CV_IMPL void cvSub( const CvArr* srcarr1, const CvArr* srcarr2, CvArr* dstarr, const CvArr* maskarr )
|
|
|
|
{
|
|
|
|
cv::Mat src1 = cv::cvarrToMat(srcarr1), src2 = cv::cvarrToMat(srcarr2),
|
|
|
|
dst = cv::cvarrToMat(dstarr), mask;
|
2011-04-17 21:14:45 +08:00
|
|
|
CV_Assert( src1.size == dst.size && src1.channels() == dst.channels() );
|
2010-05-12 01:44:00 +08:00
|
|
|
if( maskarr )
|
|
|
|
mask = cv::cvarrToMat(maskarr);
|
2011-04-17 21:14:45 +08:00
|
|
|
cv::subtract( src1, src2, dst, mask, dst.type() );
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
2011-01-07 08:26:09 +08:00
|
|
|
|
2010-05-12 01:44:00 +08:00
|
|
|
CV_IMPL void cvAddS( const CvArr* srcarr1, CvScalar value, CvArr* dstarr, const CvArr* maskarr )
|
|
|
|
{
|
|
|
|
cv::Mat src1 = cv::cvarrToMat(srcarr1),
|
|
|
|
dst = cv::cvarrToMat(dstarr), mask;
|
2011-04-17 21:14:45 +08:00
|
|
|
CV_Assert( src1.size == dst.size && src1.channels() == dst.channels() );
|
2010-05-12 01:44:00 +08:00
|
|
|
if( maskarr )
|
|
|
|
mask = cv::cvarrToMat(maskarr);
|
2011-04-17 21:14:45 +08:00
|
|
|
cv::add( src1, (const cv::Scalar&)value, dst, mask, dst.type() );
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
2011-01-07 08:26:09 +08:00
|
|
|
|
2010-05-12 01:44:00 +08:00
|
|
|
CV_IMPL void cvSubRS( const CvArr* srcarr1, CvScalar value, CvArr* dstarr, const CvArr* maskarr )
|
|
|
|
{
|
|
|
|
cv::Mat src1 = cv::cvarrToMat(srcarr1),
|
|
|
|
dst = cv::cvarrToMat(dstarr), mask;
|
2011-04-17 21:14:45 +08:00
|
|
|
CV_Assert( src1.size == dst.size && src1.channels() == dst.channels() );
|
2010-05-12 01:44:00 +08:00
|
|
|
if( maskarr )
|
|
|
|
mask = cv::cvarrToMat(maskarr);
|
2011-04-17 21:14:45 +08:00
|
|
|
cv::subtract( (const cv::Scalar&)value, src1, dst, mask, dst.type() );
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
2011-01-07 08:26:09 +08:00
|
|
|
|
2010-05-12 01:44:00 +08:00
|
|
|
CV_IMPL void cvMul( const CvArr* srcarr1, const CvArr* srcarr2,
|
|
|
|
CvArr* dstarr, double scale )
|
|
|
|
{
|
|
|
|
cv::Mat src1 = cv::cvarrToMat(srcarr1), src2 = cv::cvarrToMat(srcarr2),
|
|
|
|
dst = cv::cvarrToMat(dstarr);
|
2011-04-17 21:14:45 +08:00
|
|
|
CV_Assert( src1.size == dst.size && src1.channels() == dst.channels() );
|
|
|
|
cv::multiply( src1, src2, dst, scale, dst.type() );
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
2011-01-07 08:26:09 +08:00
|
|
|
|
2010-05-12 01:44:00 +08:00
|
|
|
CV_IMPL void cvDiv( const CvArr* srcarr1, const CvArr* srcarr2,
|
|
|
|
CvArr* dstarr, double scale )
|
|
|
|
{
|
|
|
|
cv::Mat src2 = cv::cvarrToMat(srcarr2),
|
|
|
|
dst = cv::cvarrToMat(dstarr), mask;
|
2011-04-17 21:14:45 +08:00
|
|
|
CV_Assert( src2.size == dst.size && src2.channels() == dst.channels() );
|
2010-05-12 01:44:00 +08:00
|
|
|
|
|
|
|
if( srcarr1 )
|
2011-04-17 21:14:45 +08:00
|
|
|
cv::divide( cv::cvarrToMat(srcarr1), src2, dst, scale, dst.type() );
|
2010-05-12 01:44:00 +08:00
|
|
|
else
|
2011-04-17 21:14:45 +08:00
|
|
|
cv::divide( scale, src2, dst, dst.type() );
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
CV_IMPL void
|
|
|
|
cvAddWeighted( const CvArr* srcarr1, double alpha,
|
|
|
|
const CvArr* srcarr2, double beta,
|
|
|
|
double gamma, CvArr* dstarr )
|
|
|
|
{
|
|
|
|
cv::Mat src1 = cv::cvarrToMat(srcarr1), src2 = cv::cvarrToMat(srcarr2),
|
|
|
|
dst = cv::cvarrToMat(dstarr);
|
2011-04-17 21:14:45 +08:00
|
|
|
CV_Assert( src1.size == dst.size && src1.channels() == dst.channels() );
|
|
|
|
cv::addWeighted( src1, alpha, src2, beta, gamma, dst, dst.type() );
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
CV_IMPL void
|
|
|
|
cvAbsDiff( const CvArr* srcarr1, const CvArr* srcarr2, CvArr* dstarr )
|
|
|
|
{
|
|
|
|
cv::Mat src1 = cv::cvarrToMat(srcarr1), dst = cv::cvarrToMat(dstarr);
|
2010-10-20 20:33:57 +08:00
|
|
|
CV_Assert( src1.size == dst.size && src1.type() == dst.type() );
|
2010-05-12 01:44:00 +08:00
|
|
|
|
|
|
|
cv::absdiff( src1, cv::cvarrToMat(srcarr2), dst );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
CV_IMPL void
|
|
|
|
cvAbsDiffS( const CvArr* srcarr1, CvArr* dstarr, CvScalar scalar )
|
|
|
|
{
|
|
|
|
cv::Mat src1 = cv::cvarrToMat(srcarr1), dst = cv::cvarrToMat(dstarr);
|
2010-10-20 20:33:57 +08:00
|
|
|
CV_Assert( src1.size == dst.size && src1.type() == dst.type() );
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
cv::absdiff( src1, (const cv::Scalar&)scalar, dst );
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
2011-01-07 08:26:09 +08:00
|
|
|
|
2010-05-12 01:44:00 +08:00
|
|
|
CV_IMPL void
|
|
|
|
cvInRange( const void* srcarr1, const void* srcarr2,
|
|
|
|
const void* srcarr3, void* dstarr )
|
|
|
|
{
|
|
|
|
cv::Mat src1 = cv::cvarrToMat(srcarr1), dst = cv::cvarrToMat(dstarr);
|
2010-10-20 20:33:57 +08:00
|
|
|
CV_Assert( src1.size == dst.size && dst.type() == CV_8U );
|
2010-05-12 01:44:00 +08:00
|
|
|
|
|
|
|
cv::inRange( src1, cv::cvarrToMat(srcarr2), cv::cvarrToMat(srcarr3), dst );
|
|
|
|
}
|
|
|
|
|
2011-01-07 08:26:09 +08:00
|
|
|
|
2010-05-12 01:44:00 +08:00
|
|
|
CV_IMPL void
|
|
|
|
cvInRangeS( const void* srcarr1, CvScalar lowerb, CvScalar upperb, void* dstarr )
|
|
|
|
{
|
|
|
|
cv::Mat src1 = cv::cvarrToMat(srcarr1), dst = cv::cvarrToMat(dstarr);
|
2010-10-20 20:33:57 +08:00
|
|
|
CV_Assert( src1.size == dst.size && dst.type() == CV_8U );
|
2010-05-12 01:44:00 +08:00
|
|
|
|
2011-04-17 21:14:45 +08:00
|
|
|
cv::inRange( src1, (const cv::Scalar&)lowerb, (const cv::Scalar&)upperb, dst );
|
2010-05-12 01:44:00 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
CV_IMPL void
|
|
|
|
cvCmp( const void* srcarr1, const void* srcarr2, void* dstarr, int cmp_op )
|
|
|
|
{
|
|
|
|
cv::Mat src1 = cv::cvarrToMat(srcarr1), dst = cv::cvarrToMat(dstarr);
|
2010-10-20 20:33:57 +08:00
|
|
|
CV_Assert( src1.size == dst.size && dst.type() == CV_8U );
|
2010-05-12 01:44:00 +08:00
|
|
|
|
|
|
|
cv::compare( src1, cv::cvarrToMat(srcarr2), dst, cmp_op );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
CV_IMPL void
|
|
|
|
cvCmpS( const void* srcarr1, double value, void* dstarr, int cmp_op )
|
|
|
|
{
|
|
|
|
cv::Mat src1 = cv::cvarrToMat(srcarr1), dst = cv::cvarrToMat(dstarr);
|
2010-10-20 20:33:57 +08:00
|
|
|
CV_Assert( src1.size == dst.size && dst.type() == CV_8U );
|
2010-05-12 01:44:00 +08:00
|
|
|
|
|
|
|
cv::compare( src1, value, dst, cmp_op );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
CV_IMPL void
|
|
|
|
cvMin( const void* srcarr1, const void* srcarr2, void* dstarr )
|
|
|
|
{
|
|
|
|
cv::Mat src1 = cv::cvarrToMat(srcarr1), dst = cv::cvarrToMat(dstarr);
|
2010-10-20 20:33:57 +08:00
|
|
|
CV_Assert( src1.size == dst.size && src1.type() == dst.type() );
|
2010-05-12 01:44:00 +08:00
|
|
|
|
|
|
|
cv::min( src1, cv::cvarrToMat(srcarr2), dst );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
CV_IMPL void
|
|
|
|
cvMax( const void* srcarr1, const void* srcarr2, void* dstarr )
|
|
|
|
{
|
|
|
|
cv::Mat src1 = cv::cvarrToMat(srcarr1), dst = cv::cvarrToMat(dstarr);
|
2010-10-20 20:33:57 +08:00
|
|
|
CV_Assert( src1.size == dst.size && src1.type() == dst.type() );
|
2010-05-12 01:44:00 +08:00
|
|
|
|
|
|
|
cv::max( src1, cv::cvarrToMat(srcarr2), dst );
|
|
|
|
}
|
|
|
|
|
2011-01-07 08:26:09 +08:00
|
|
|
|
2010-05-12 01:44:00 +08:00
|
|
|
CV_IMPL void
|
|
|
|
cvMinS( const void* srcarr1, double value, void* dstarr )
|
|
|
|
{
|
|
|
|
cv::Mat src1 = cv::cvarrToMat(srcarr1), dst = cv::cvarrToMat(dstarr);
|
2010-10-20 20:33:57 +08:00
|
|
|
CV_Assert( src1.size == dst.size && src1.type() == dst.type() );
|
2010-05-12 01:44:00 +08:00
|
|
|
|
|
|
|
cv::min( src1, value, dst );
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
|
|
CV_IMPL void
|
|
|
|
cvMaxS( const void* srcarr1, double value, void* dstarr )
|
|
|
|
{
|
|
|
|
cv::Mat src1 = cv::cvarrToMat(srcarr1), dst = cv::cvarrToMat(dstarr);
|
2010-10-20 20:33:57 +08:00
|
|
|
CV_Assert( src1.size == dst.size && src1.type() == dst.type() );
|
2010-05-12 01:44:00 +08:00
|
|
|
|
|
|
|
cv::max( src1, value, dst );
|
|
|
|
}
|
|
|
|
|
|
|
|
/* End of file. */
|