mirror of https://github.com/opencv/opencv.git
Open Source Computer Vision Library
https://opencv.org/
You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
1332 lines
38 KiB
1332 lines
38 KiB
/////////////////////////////////////////////////////////////////////////////////////// |
|
// |
|
// 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) 2010-2012, Institute Of Software Chinese Academy Of Science, all rights reserved. |
|
// Copyright (C) 2010-2012, Advanced Micro Devices, Inc., all rights reserved. |
|
// Copyright (C) 2010-2012, Multicoreware, Inc., all rights reserved. |
|
// Third party copyrights are property of their respective owners. |
|
// |
|
// @Authors |
|
// Niko Li, newlife20080214@gmail.com |
|
// Jia Haipeng, jiahaipeng95@gmail.com |
|
// Shengen Yan, yanshengen@gmail.com |
|
// Jiang Liyuan,jlyuan001.good@163.com |
|
// Rock Li, Rock.Li@amd.com |
|
// Zailong Wu, bullet@yeah.net |
|
// Yao Wang, bitwangyaoyao@gmail.com |
|
// |
|
// 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 oclMaterials 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*/ |
|
|
|
#include "test_precomp.hpp" |
|
#include <iomanip> |
|
|
|
#ifdef HAVE_OPENCL |
|
|
|
using namespace cv; |
|
using namespace cv::ocl; |
|
using namespace cvtest; |
|
using namespace testing; |
|
using namespace std; |
|
|
|
//////////////////////////////// LUT ///////////////////////////////////////////////// |
|
|
|
PARAM_TEST_CASE(Lut, int, int, bool, bool) |
|
{ |
|
int lut_depth; |
|
int cn; |
|
bool use_roi, same_cn; |
|
|
|
// src mat |
|
cv::Mat src; |
|
cv::Mat lut; |
|
cv::Mat dst; |
|
|
|
// src mat with roi |
|
cv::Mat src_roi; |
|
cv::Mat lut_roi; |
|
cv::Mat dst_roi; |
|
|
|
// ocl dst mat for testing |
|
cv::ocl::oclMat gdst_whole; |
|
|
|
// ocl mat with roi |
|
cv::ocl::oclMat gsrc; |
|
cv::ocl::oclMat glut; |
|
cv::ocl::oclMat gdst; |
|
|
|
virtual void SetUp() |
|
{ |
|
lut_depth = GET_PARAM(0); |
|
cn = GET_PARAM(1); |
|
same_cn = GET_PARAM(2); |
|
use_roi = GET_PARAM(3); |
|
|
|
const int src_type = CV_MAKE_TYPE(CV_8U, cn); |
|
const int lut_type = CV_MAKE_TYPE(lut_depth, same_cn ? cn : 1); |
|
const int dst_type = CV_MAKE_TYPE(lut_depth, cn); |
|
|
|
cv::RNG &rng = TS::ptr()->get_rng(); |
|
|
|
src = randomMat(rng, randomSize(MIN_VALUE, MAX_VALUE), src_type, 0, 256, false); |
|
lut = randomMat(rng, use_roi ? randomSize(260, 300) : Size(256, 1), lut_type, 5, 16, false); |
|
dst = randomMat(rng, use_roi ? randomSize(MIN_VALUE, MAX_VALUE) : src.size(), dst_type, 5, 16, false); |
|
} |
|
|
|
void random_roi() |
|
{ |
|
// set up roi |
|
int roicols, roirows; |
|
int srcx, srcy; |
|
int lutx, luty; |
|
int dstx, dsty; |
|
|
|
if (use_roi) |
|
{ |
|
// randomize ROI |
|
cv::RNG &rng = TS::ptr()->get_rng(); |
|
|
|
roicols = rng.uniform(1, MIN_VALUE); |
|
roirows = rng.uniform(1, MIN_VALUE); |
|
|
|
srcx = rng.uniform(0, src.cols - roicols); |
|
srcy = rng.uniform(0, src.rows - roirows); |
|
lutx = rng.uniform(0, lut.cols - 256); |
|
luty = rng.uniform(0, lut.rows - 1); |
|
|
|
dstx = rng.uniform(0, dst.cols - roicols); |
|
dsty = rng.uniform(0, dst.rows - roirows); |
|
} |
|
else |
|
{ |
|
roicols = src.cols; |
|
roirows = src.rows; |
|
srcx = srcy = 0; |
|
lutx = luty = 0; |
|
dstx = dsty = 0; |
|
} |
|
|
|
src_roi = src(Rect(srcx, srcy, roicols, roirows)); |
|
lut_roi = lut(Rect(lutx, luty, 256, 1)); |
|
dst_roi = dst(Rect(dstx, dsty, roicols, roirows)); |
|
|
|
gdst_whole = dst; |
|
gdst = gdst_whole(Rect(dstx, dsty, roicols, roirows)); |
|
|
|
gsrc = src_roi; |
|
glut = lut_roi; |
|
} |
|
|
|
void Near(double threshold = 0.) |
|
{ |
|
EXPECT_MAT_NEAR(dst, Mat(gdst_whole), threshold); |
|
EXPECT_MAT_NEAR(dst_roi, Mat(gdst), threshold); |
|
} |
|
}; |
|
|
|
TEST_P(Lut, Mat) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::LUT(src_roi, lut_roi, dst_roi); |
|
cv::ocl::LUT(gsrc, glut, gdst); |
|
|
|
Near(); |
|
} |
|
} |
|
|
|
///////////////////////// ArithmTestBase /////////////////////////// |
|
|
|
PARAM_TEST_CASE(ArithmTestBase, int, int, bool) |
|
{ |
|
int depth; |
|
int cn; |
|
bool use_roi; |
|
cv::Scalar val; |
|
|
|
// src mat |
|
cv::Mat src1; |
|
cv::Mat src2; |
|
cv::Mat mask; |
|
cv::Mat dst1; |
|
cv::Mat dst2; // for two outputs |
|
|
|
// set up roi |
|
int roicols, roirows; |
|
int src1x, src1y; |
|
int src2x, src2y; |
|
int dst1x, dst1y; |
|
int dst2x, dst2y; |
|
int maskx, masky; |
|
|
|
// src mat with roi |
|
cv::Mat src1_roi; |
|
cv::Mat src2_roi; |
|
cv::Mat mask_roi; |
|
cv::Mat dst1_roi; |
|
cv::Mat dst2_roi; // for two outputs |
|
|
|
// ocl dst mat for testing |
|
cv::ocl::oclMat gdst1_whole; |
|
cv::ocl::oclMat gdst2_whole; // for two outputs |
|
|
|
// ocl mat with roi |
|
cv::ocl::oclMat gsrc1; |
|
cv::ocl::oclMat gsrc2; |
|
cv::ocl::oclMat gdst1; |
|
cv::ocl::oclMat gdst2; // for two outputs |
|
cv::ocl::oclMat gmask; |
|
|
|
virtual void SetUp() |
|
{ |
|
depth = GET_PARAM(0); |
|
cn = GET_PARAM(1); |
|
use_roi = GET_PARAM(2); |
|
const int type = CV_MAKE_TYPE(depth, cn); |
|
|
|
cv::RNG &rng = TS::ptr()->get_rng(); |
|
|
|
src1 = randomMat(rng, randomSize(MIN_VALUE, MAX_VALUE), type, 5, 16, false); |
|
src2 = randomMat(rng, !use_roi ? src1.size() : randomSize(MIN_VALUE, MAX_VALUE), type, -15440, 14450, false); |
|
dst1 = randomMat(rng, !use_roi ? src1.size() : randomSize(MIN_VALUE, MAX_VALUE), type, 5, 16, false); |
|
dst2 = randomMat(rng, !use_roi ? src1.size() : randomSize(MIN_VALUE, MAX_VALUE), type, 5, 16, false); |
|
mask = randomMat(rng, !use_roi ? src1.size() : randomSize(MIN_VALUE, MAX_VALUE), CV_8UC1, 0, 2, false); |
|
|
|
cv::threshold(mask, mask, 0.5, 255., CV_8UC1); |
|
|
|
val = cv::Scalar(rng.uniform(-100.0, 100.0), rng.uniform(-100.0, 100.0), |
|
rng.uniform(-100.0, 100.0), rng.uniform(-100.0, 100.0)); |
|
} |
|
|
|
void random_roi() |
|
{ |
|
if (use_roi) |
|
{ |
|
// randomize ROI |
|
cv::RNG &rng = TS::ptr()->get_rng(); |
|
|
|
roicols = rng.uniform(1, MIN_VALUE); |
|
roirows = rng.uniform(1, MIN_VALUE); |
|
|
|
src1x = rng.uniform(0, src1.cols - roicols); |
|
src1y = rng.uniform(0, src1.rows - roirows); |
|
src2x = rng.uniform(0, src2.cols - roicols); |
|
src2y = rng.uniform(0, src2.rows - roirows); |
|
|
|
dst1x = rng.uniform(0, dst1.cols - roicols); |
|
dst1y = rng.uniform(0, dst1.rows - roirows); |
|
dst2x = rng.uniform(0, dst2.cols - roicols); |
|
dst2y = rng.uniform(0, dst2.rows - roirows); |
|
|
|
maskx = rng.uniform(0, mask.cols - roicols); |
|
masky = rng.uniform(0, mask.rows - roirows); |
|
} |
|
else |
|
{ |
|
roicols = src1.cols; |
|
roirows = src1.rows; |
|
src1x = src1y = 0; |
|
src2x = src2y = 0; |
|
dst1x = dst1y = 0; |
|
dst2x = dst2y = 0; |
|
maskx = masky = 0; |
|
} |
|
|
|
src1_roi = src1(Rect(src1x, src1y, roicols, roirows)); |
|
src2_roi = src2(Rect(src2x, src2y, roicols, roirows)); |
|
mask_roi = mask(Rect(maskx, masky, roicols, roirows)); |
|
dst1_roi = dst1(Rect(dst1x, dst1y, roicols, roirows)); |
|
dst2_roi = dst2(Rect(dst2x, dst2y, roicols, roirows)); |
|
|
|
gdst1_whole = dst1; |
|
gdst1 = gdst1_whole(Rect(dst1x, dst1y, roicols, roirows)); |
|
|
|
gdst2_whole = dst2; |
|
gdst2 = gdst2_whole(Rect(dst2x, dst2y, roicols, roirows)); |
|
|
|
gsrc1 = src1_roi; |
|
gsrc2 = src2_roi; |
|
gmask = mask_roi; |
|
} |
|
|
|
void Near(double threshold = 0.) |
|
{ |
|
EXPECT_MAT_NEAR(dst1, Mat(gdst1_whole), threshold); |
|
EXPECT_MAT_NEAR(dst1_roi, Mat(gdst1), threshold); |
|
} |
|
|
|
void Near1(double threshold = 0.) |
|
{ |
|
EXPECT_MAT_NEAR(dst2, Mat(gdst2_whole), threshold); |
|
EXPECT_MAT_NEAR(dst2_roi, Mat(gdst2), threshold); |
|
} |
|
}; |
|
|
|
//////////////////////////////// Exp ///////////////////////////////////////////////// |
|
|
|
typedef ArithmTestBase Exp; |
|
|
|
TEST_P(Exp, Mat) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::exp(src1_roi, dst1_roi); |
|
cv::ocl::exp(gsrc1, gdst1); |
|
|
|
Near(2); |
|
} |
|
} |
|
|
|
//////////////////////////////// Log ///////////////////////////////////////////////// |
|
|
|
typedef ArithmTestBase Log; |
|
|
|
TEST_P(Log, Mat) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::log(src1_roi, dst1_roi); |
|
cv::ocl::log(gsrc1, gdst1); |
|
Near(1); |
|
} |
|
} |
|
|
|
//////////////////////////////// Add ///////////////////////////////////////////////// |
|
|
|
typedef ArithmTestBase Add; |
|
|
|
TEST_P(Add, Mat) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::add(src1_roi, src2_roi, dst1_roi); |
|
cv::ocl::add(gsrc1, gsrc2, gdst1); |
|
Near(0); |
|
} |
|
} |
|
|
|
TEST_P(Add, Mat_Mask) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::add(src1_roi, src2_roi, dst1_roi, mask_roi); |
|
cv::ocl::add(gsrc1, gsrc2, gdst1, gmask); |
|
Near(0); |
|
} |
|
} |
|
|
|
TEST_P(Add, Scalar) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::add(src1_roi, val, dst1_roi); |
|
cv::ocl::add(gsrc1, val, gdst1); |
|
Near(1e-5); |
|
} |
|
} |
|
|
|
TEST_P(Add, Scalar_Mask) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::add(src1_roi, val, dst1_roi, mask_roi); |
|
cv::ocl::add(gsrc1, val, gdst1, gmask); |
|
Near(1e-5); |
|
} |
|
} |
|
|
|
//////////////////////////////// Sub ///////////////////////////////////////////////// |
|
|
|
typedef ArithmTestBase Sub; |
|
|
|
TEST_P(Sub, Mat) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::subtract(src1_roi, src2_roi, dst1_roi); |
|
cv::ocl::subtract(gsrc1, gsrc2, gdst1); |
|
|
|
Near(0); |
|
} |
|
} |
|
|
|
TEST_P(Sub, Mat_Mask) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::subtract(src1_roi, src2_roi, dst1_roi, mask_roi); |
|
cv::ocl::subtract(gsrc1, gsrc2, gdst1, gmask); |
|
Near(0); |
|
} |
|
} |
|
|
|
TEST_P(Sub, Scalar) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::subtract(src1_roi, val, dst1_roi); |
|
cv::ocl::subtract(gsrc1, val, gdst1); |
|
|
|
Near(1e-5); |
|
} |
|
} |
|
|
|
TEST_P(Sub, Scalar_Mask) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::subtract(src1_roi, val, dst1_roi, mask_roi); |
|
cv::ocl::subtract(gsrc1, val, gdst1, gmask); |
|
Near(1e-5); |
|
} |
|
} |
|
|
|
//////////////////////////////// Mul ///////////////////////////////////////////////// |
|
|
|
typedef ArithmTestBase Mul; |
|
|
|
TEST_P(Mul, Mat) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::multiply(src1_roi, src2_roi, dst1_roi); |
|
cv::ocl::multiply(gsrc1, gsrc2, gdst1); |
|
Near(0); |
|
} |
|
} |
|
|
|
TEST_P(Mul, Scalar) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::multiply(val[0], src1_roi, dst1_roi); |
|
cv::ocl::multiply(val[0], gsrc1, gdst1); |
|
|
|
Near(gdst1.depth() >= CV_32F ? 1e-3 : 1); |
|
} |
|
} |
|
|
|
|
|
TEST_P(Mul, Mat_Scalar) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::multiply(src1_roi, src2_roi, dst1_roi, val[0]); |
|
cv::ocl::multiply(gsrc1, gsrc2, gdst1, val[0]); |
|
|
|
Near(gdst1.depth() >= CV_32F ? 1e-3 : 1); |
|
} |
|
} |
|
|
|
//////////////////////////////// Div ///////////////////////////////////////////////// |
|
|
|
typedef ArithmTestBase Div; |
|
|
|
TEST_P(Div, Mat) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::divide(src1_roi, src2_roi, dst1_roi); |
|
cv::ocl::divide(gsrc1, gsrc2, gdst1); |
|
Near(1); |
|
} |
|
} |
|
|
|
TEST_P(Div, Scalar) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::divide(val[0], src1_roi, dst1_roi); |
|
cv::ocl::divide(val[0], gsrc1, gdst1); |
|
|
|
Near(gdst1.depth() >= CV_32F ? 1e-3 : 1); |
|
} |
|
} |
|
|
|
|
|
TEST_P(Div, Mat_Scalar) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::divide(src1_roi, src2_roi, dst1_roi, val[0]); |
|
cv::ocl::divide(gsrc1, gsrc2, gdst1, val[0]); |
|
|
|
Near(gdst1.depth() >= CV_32F ? 1e-3 : 1); |
|
} |
|
} |
|
|
|
//////////////////////////////// Absdiff ///////////////////////////////////////////////// |
|
|
|
typedef ArithmTestBase Absdiff; |
|
|
|
TEST_P(Absdiff, Mat) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::absdiff(src1_roi, src2_roi, dst1_roi); |
|
cv::ocl::absdiff(gsrc1, gsrc2, gdst1); |
|
Near(0); |
|
} |
|
} |
|
|
|
TEST_P(Absdiff, Mat_Scalar) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::absdiff(src1_roi, val, dst1_roi); |
|
cv::ocl::absdiff(gsrc1, val, gdst1); |
|
Near(1e-5); |
|
} |
|
} |
|
|
|
//////////////////////////////// CartToPolar ///////////////////////////////////////////////// |
|
|
|
typedef ArithmTestBase CartToPolar; |
|
|
|
TEST_P(CartToPolar, angleInDegree) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::cartToPolar(src1_roi, src2_roi, dst1_roi, dst2_roi, true); |
|
cv::ocl::cartToPolar(gsrc1, gsrc2, gdst1, gdst2, true); |
|
Near(.5); |
|
Near1(.5); |
|
} |
|
} |
|
|
|
TEST_P(CartToPolar, angleInRadians) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::cartToPolar(src1_roi, src2_roi, dst1_roi, dst2_roi); |
|
cv::ocl::cartToPolar(gsrc1, gsrc2, gdst1, gdst2); |
|
Near(.5); |
|
Near1(.5); |
|
} |
|
} |
|
|
|
//////////////////////////////// PolarToCart ///////////////////////////////////////////////// |
|
|
|
typedef ArithmTestBase PolarToCart; |
|
|
|
TEST_P(PolarToCart, angleInDegree) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::polarToCart(src1_roi, src2_roi, dst1_roi, dst2_roi, true); |
|
cv::ocl::polarToCart(gsrc1, gsrc2, gdst1, gdst2, true); |
|
|
|
Near(.5); |
|
Near1(.5); |
|
} |
|
} |
|
|
|
TEST_P(PolarToCart, angleInRadians) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::polarToCart(src1_roi, src2_roi, dst1_roi, dst2_roi); |
|
cv::ocl::polarToCart(gsrc1, gsrc2, gdst1, gdst2); |
|
|
|
Near(.5); |
|
Near1(.5); |
|
} |
|
} |
|
|
|
//////////////////////////////// Magnitude ///////////////////////////////////////////////// |
|
|
|
typedef ArithmTestBase Magnitude; |
|
|
|
TEST_P(Magnitude, Mat) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::magnitude(src1_roi, src2_roi, dst1_roi); |
|
cv::ocl::magnitude(gsrc1, gsrc2, gdst1); |
|
Near(depth == CV_64F ? 1e-5 : 1e-2); |
|
} |
|
} |
|
|
|
//////////////////////////////// Transpose ///////////////////////////////////////////////// |
|
|
|
typedef ArithmTestBase Transpose; |
|
|
|
TEST_P(Transpose, Mat) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::transpose(src1_roi, dst1_roi); |
|
cv::ocl::transpose(gsrc1, gdst1); |
|
|
|
Near(1e-5); |
|
} |
|
} |
|
|
|
TEST_P(Transpose, SquareInplace) |
|
{ |
|
cv::RNG &rng = TS::ptr()->get_rng(); |
|
int value = randomInt(MIN_VALUE, MAX_VALUE); |
|
src1 = randomMat(rng, Size(value, value), CV_MAKE_TYPE(depth, cn), 5, 16, false); |
|
|
|
if (use_roi) |
|
{ |
|
roirows = roicols = randomInt(1, src1.cols); |
|
|
|
src1x = randomInt(0, src1.cols - roicols); |
|
src1y = randomInt(0, src1.rows - roirows); |
|
} |
|
else |
|
{ |
|
roicols = roirows = src1.cols; |
|
src1x = src1y = 0; |
|
} |
|
|
|
Rect r(src1x, src1y, roicols, roirows); |
|
src1_roi = src1(r); |
|
gdst1_whole = src1; |
|
gdst1 = gdst1_whole(r); |
|
|
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
cv::transpose(src1_roi, src1_roi); |
|
cv::ocl::transpose(gdst1, gdst1); |
|
|
|
EXPECT_MAT_NEAR(src1, Mat(gdst1_whole), 0.0); |
|
EXPECT_MAT_NEAR(src1_roi, Mat(gdst1), 0.0); |
|
} |
|
} |
|
|
|
//////////////////////////////// Flip ///////////////////////////////////////////////// |
|
|
|
typedef ArithmTestBase Flip; |
|
|
|
TEST_P(Flip, X) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::flip(src1_roi, dst1_roi, 0); |
|
cv::ocl::flip(gsrc1, gdst1, 0); |
|
Near(1e-5); |
|
} |
|
} |
|
|
|
TEST_P(Flip, Y) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::flip(src1_roi, dst1_roi, 1); |
|
cv::ocl::flip(gsrc1, gdst1, 1); |
|
Near(1e-5); |
|
} |
|
} |
|
|
|
TEST_P(Flip, BOTH) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::flip(src1_roi, dst1_roi, -1); |
|
cv::ocl::flip(gsrc1, gdst1, -1); |
|
Near(1e-5); |
|
} |
|
} |
|
|
|
//////////////////////////////// MinMax ///////////////////////////////////////////////// |
|
|
|
typedef ArithmTestBase MinMax; |
|
|
|
TEST_P(MinMax, MAT) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
double minVal, maxVal; |
|
|
|
if (src1.depth() != CV_8S) |
|
cv::minMaxIdx(src1_roi, &minVal, &maxVal, NULL, NULL); |
|
else |
|
{ |
|
minVal = std::numeric_limits<double>::max(); |
|
maxVal = -std::numeric_limits<double>::max(); |
|
for (int i = 0; i < src1_roi.rows; ++i) |
|
for (int j = 0; j < src1_roi.cols; ++j) |
|
{ |
|
signed char val = src1_roi.at<signed char>(i, j); |
|
if (val < minVal) minVal = val; |
|
else if (val > maxVal) maxVal = val; |
|
} |
|
} |
|
|
|
double minVal_, maxVal_; |
|
cv::ocl::minMax(gsrc1, &minVal_, &maxVal_); |
|
|
|
EXPECT_DOUBLE_EQ(minVal_, minVal); |
|
EXPECT_DOUBLE_EQ(maxVal_, maxVal); |
|
} |
|
} |
|
|
|
TEST_P(MinMax, DISABLED_MASK) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
double minVal, maxVal; |
|
cv::Point minLoc, maxLoc; |
|
|
|
if (src1.depth() != CV_8S) |
|
cv::minMaxLoc(src1_roi, &minVal, &maxVal, &minLoc, &maxLoc, mask_roi); |
|
else |
|
{ |
|
minVal = std::numeric_limits<double>::max(); |
|
maxVal = -std::numeric_limits<double>::max(); |
|
for (int i = 0; i < src1_roi.rows; ++i) |
|
for (int j = 0; j < src1_roi.cols; ++j) |
|
{ |
|
signed char val = src1_roi.at<signed char>(i, j); |
|
unsigned char m = mask_roi.at<unsigned char>(i, j); |
|
if (val < minVal && m) minVal = val; |
|
if (val > maxVal && m) maxVal = val; |
|
} |
|
} |
|
|
|
double minVal_, maxVal_; |
|
cv::ocl::minMax(gsrc1, &minVal_, &maxVal_, gmask); |
|
|
|
EXPECT_DOUBLE_EQ(minVal, minVal_); |
|
EXPECT_DOUBLE_EQ(maxVal, maxVal_); |
|
} |
|
} |
|
|
|
//////////////////////////////// MinMaxLoc ///////////////////////////////////////////////// |
|
|
|
typedef ArithmTestBase MinMaxLoc; |
|
|
|
TEST_P(MinMaxLoc, MAT) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
double minVal, maxVal; |
|
cv::Point minLoc, maxLoc; |
|
int depth = src1.depth(); |
|
|
|
if (depth != CV_8S) |
|
cv::minMaxLoc(src1_roi, &minVal, &maxVal, &minLoc, &maxLoc); |
|
else |
|
{ |
|
minVal = std::numeric_limits<double>::max(); |
|
maxVal = -std::numeric_limits<double>::max(); |
|
for (int i = 0; i < src1_roi.rows; ++i) |
|
for (int j = 0; j < src1_roi.cols; ++j) |
|
{ |
|
signed char val = src1_roi.at<signed char>(i, j); |
|
if (val < minVal) |
|
{ |
|
minVal = val; |
|
minLoc.x = j; |
|
minLoc.y = i; |
|
} |
|
if (val > maxVal) |
|
{ |
|
maxVal = val; |
|
maxLoc.x = j; |
|
maxLoc.y = i; |
|
} |
|
} |
|
} |
|
|
|
double minVal_, maxVal_; |
|
cv::Point minLoc_, maxLoc_; |
|
cv::ocl::minMaxLoc(gsrc1, &minVal_, &maxVal_, &minLoc_, &maxLoc_, cv::ocl::oclMat()); |
|
|
|
double error0 = 0., error1 = 0., minlocVal = 0., minlocVal_ = 0., maxlocVal = 0., maxlocVal_ = 0.; |
|
if (depth == 0) |
|
{ |
|
minlocVal = src1_roi.at<unsigned char>(minLoc); |
|
minlocVal_ = src1_roi.at<unsigned char>(minLoc_); |
|
maxlocVal = src1_roi.at<unsigned char>(maxLoc); |
|
maxlocVal_ = src1_roi.at<unsigned char>(maxLoc_); |
|
error0 = ::abs(src1_roi.at<unsigned char>(minLoc_) - src1_roi.at<unsigned char>(minLoc)); |
|
error1 = ::abs(src1_roi.at<unsigned char>(maxLoc_) - src1_roi.at<unsigned char>(maxLoc)); |
|
} |
|
if (depth == 1) |
|
{ |
|
minlocVal = src1_roi.at<signed char>(minLoc); |
|
minlocVal_ = src1_roi.at<signed char>(minLoc_); |
|
maxlocVal = src1_roi.at<signed char>(maxLoc); |
|
maxlocVal_ = src1_roi.at<signed char>(maxLoc_); |
|
error0 = ::abs(src1_roi.at<signed char>(minLoc_) - src1_roi.at<signed char>(minLoc)); |
|
error1 = ::abs(src1_roi.at<signed char>(maxLoc_) - src1_roi.at<signed char>(maxLoc)); |
|
} |
|
if (depth == 2) |
|
{ |
|
minlocVal = src1_roi.at<unsigned short>(minLoc); |
|
minlocVal_ = src1_roi.at<unsigned short>(minLoc_); |
|
maxlocVal = src1_roi.at<unsigned short>(maxLoc); |
|
maxlocVal_ = src1_roi.at<unsigned short>(maxLoc_); |
|
error0 = ::abs(src1_roi.at<unsigned short>(minLoc_) - src1_roi.at<unsigned short>(minLoc)); |
|
error1 = ::abs(src1_roi.at<unsigned short>(maxLoc_) - src1_roi.at<unsigned short>(maxLoc)); |
|
} |
|
if (depth == 3) |
|
{ |
|
minlocVal = src1_roi.at<signed short>(minLoc); |
|
minlocVal_ = src1_roi.at<signed short>(minLoc_); |
|
maxlocVal = src1_roi.at<signed short>(maxLoc); |
|
maxlocVal_ = src1_roi.at<signed short>(maxLoc_); |
|
error0 = ::abs(src1_roi.at<signed short>(minLoc_) - src1_roi.at<signed short>(minLoc)); |
|
error1 = ::abs(src1_roi.at<signed short>(maxLoc_) - src1_roi.at<signed short>(maxLoc)); |
|
} |
|
if (depth == 4) |
|
{ |
|
minlocVal = src1_roi.at<int>(minLoc); |
|
minlocVal_ = src1_roi.at<int>(minLoc_); |
|
maxlocVal = src1_roi.at<int>(maxLoc); |
|
maxlocVal_ = src1_roi.at<int>(maxLoc_); |
|
error0 = ::abs(src1_roi.at<int>(minLoc_) - src1_roi.at<int>(minLoc)); |
|
error1 = ::abs(src1_roi.at<int>(maxLoc_) - src1_roi.at<int>(maxLoc)); |
|
} |
|
if (depth == 5) |
|
{ |
|
minlocVal = src1_roi.at<float>(minLoc); |
|
minlocVal_ = src1_roi.at<float>(minLoc_); |
|
maxlocVal = src1_roi.at<float>(maxLoc); |
|
maxlocVal_ = src1_roi.at<float>(maxLoc_); |
|
error0 = ::abs(src1_roi.at<float>(minLoc_) - src1_roi.at<float>(minLoc)); |
|
error1 = ::abs(src1_roi.at<float>(maxLoc_) - src1_roi.at<float>(maxLoc)); |
|
} |
|
if (depth == 6) |
|
{ |
|
minlocVal = src1_roi.at<double>(minLoc); |
|
minlocVal_ = src1_roi.at<double>(minLoc_); |
|
maxlocVal = src1_roi.at<double>(maxLoc); |
|
maxlocVal_ = src1_roi.at<double>(maxLoc_); |
|
error0 = ::abs(src1_roi.at<double>(minLoc_) - src1_roi.at<double>(minLoc)); |
|
error1 = ::abs(src1_roi.at<double>(maxLoc_) - src1_roi.at<double>(maxLoc)); |
|
} |
|
|
|
EXPECT_DOUBLE_EQ(minVal_, minVal); |
|
EXPECT_DOUBLE_EQ(maxVal_, maxVal); |
|
EXPECT_DOUBLE_EQ(minlocVal_, minlocVal); |
|
EXPECT_DOUBLE_EQ(maxlocVal_, maxlocVal); |
|
|
|
EXPECT_DOUBLE_EQ(error0, 0.0); |
|
EXPECT_DOUBLE_EQ(error1, 0.0); |
|
} |
|
} |
|
|
|
TEST_P(MinMaxLoc, MASK) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
double minVal, maxVal; |
|
cv::Point minLoc, maxLoc; |
|
int depth = src1.depth(); |
|
if (depth != CV_8S) |
|
cv::minMaxLoc(src1_roi, &minVal, &maxVal, &minLoc, &maxLoc, mask_roi); |
|
else |
|
{ |
|
minVal = std::numeric_limits<double>::max(); |
|
maxVal = -std::numeric_limits<double>::max(); |
|
for (int i = 0; i < src1_roi.rows; ++i) |
|
for (int j = 0; j < src1_roi.cols; ++j) |
|
{ |
|
signed char val = src1_roi.at<signed char>(i, j); |
|
unsigned char m = mask_roi.at<unsigned char>(i , j); |
|
if (val < minVal && m) |
|
{ |
|
minVal = val; |
|
minLoc.x = j; |
|
minLoc.y = i; |
|
} |
|
if (val > maxVal && m) |
|
{ |
|
maxVal = val; |
|
maxLoc.x = j; |
|
maxLoc.y = i; |
|
} |
|
} |
|
} |
|
|
|
double minVal_, maxVal_; |
|
cv::Point minLoc_, maxLoc_; |
|
cv::ocl::minMaxLoc(gsrc1, &minVal_, &maxVal_, &minLoc_, &maxLoc_, gmask); |
|
|
|
double error0 = 0., error1 = 0., minlocVal = 0., minlocVal_ = 0., maxlocVal = 0., maxlocVal_ = 0.; |
|
if (minLoc_.x == -1 || minLoc_.y == -1 || maxLoc_.x == -1 || maxLoc_.y == -1) continue; |
|
if (depth == 0) |
|
{ |
|
minlocVal = src1_roi.at<unsigned char>(minLoc); |
|
minlocVal_ = src1_roi.at<unsigned char>(minLoc_); |
|
maxlocVal = src1_roi.at<unsigned char>(maxLoc); |
|
maxlocVal_ = src1_roi.at<unsigned char>(maxLoc_); |
|
error0 = ::abs(src1_roi.at<unsigned char>(minLoc_) - src1_roi.at<unsigned char>(minLoc)); |
|
error1 = ::abs(src1_roi.at<unsigned char>(maxLoc_) - src1_roi.at<unsigned char>(maxLoc)); |
|
} |
|
if (depth == 1) |
|
{ |
|
minlocVal = src1_roi.at<signed char>(minLoc); |
|
minlocVal_ = src1_roi.at<signed char>(minLoc_); |
|
maxlocVal = src1_roi.at<signed char>(maxLoc); |
|
maxlocVal_ = src1_roi.at<signed char>(maxLoc_); |
|
error0 = ::abs(src1_roi.at<signed char>(minLoc_) - src1_roi.at<signed char>(minLoc)); |
|
error1 = ::abs(src1_roi.at<signed char>(maxLoc_) - src1_roi.at<signed char>(maxLoc)); |
|
} |
|
if (depth == 2) |
|
{ |
|
minlocVal = src1_roi.at<unsigned short>(minLoc); |
|
minlocVal_ = src1_roi.at<unsigned short>(minLoc_); |
|
maxlocVal = src1_roi.at<unsigned short>(maxLoc); |
|
maxlocVal_ = src1_roi.at<unsigned short>(maxLoc_); |
|
error0 = ::abs(src1_roi.at<unsigned short>(minLoc_) - src1_roi.at<unsigned short>(minLoc)); |
|
error1 = ::abs(src1_roi.at<unsigned short>(maxLoc_) - src1_roi.at<unsigned short>(maxLoc)); |
|
} |
|
if (depth == 3) |
|
{ |
|
minlocVal = src1_roi.at<signed short>(minLoc); |
|
minlocVal_ = src1_roi.at<signed short>(minLoc_); |
|
maxlocVal = src1_roi.at<signed short>(maxLoc); |
|
maxlocVal_ = src1_roi.at<signed short>(maxLoc_); |
|
error0 = ::abs(src1_roi.at<signed short>(minLoc_) - src1_roi.at<signed short>(minLoc)); |
|
error1 = ::abs(src1_roi.at<signed short>(maxLoc_) - src1_roi.at<signed short>(maxLoc)); |
|
} |
|
if (depth == 4) |
|
{ |
|
minlocVal = src1_roi.at<int>(minLoc); |
|
minlocVal_ = src1_roi.at<int>(minLoc_); |
|
maxlocVal = src1_roi.at<int>(maxLoc); |
|
maxlocVal_ = src1_roi.at<int>(maxLoc_); |
|
error0 = ::abs(src1_roi.at<int>(minLoc_) - src1_roi.at<int>(minLoc)); |
|
error1 = ::abs(src1_roi.at<int>(maxLoc_) - src1_roi.at<int>(maxLoc)); |
|
} |
|
if (depth == 5) |
|
{ |
|
minlocVal = src1_roi.at<float>(minLoc); |
|
minlocVal_ = src1_roi.at<float>(minLoc_); |
|
maxlocVal = src1_roi.at<float>(maxLoc); |
|
maxlocVal_ = src1_roi.at<float>(maxLoc_); |
|
error0 = ::abs(src1_roi.at<float>(minLoc_) - src1_roi.at<float>(minLoc)); |
|
error1 = ::abs(src1_roi.at<float>(maxLoc_) - src1_roi.at<float>(maxLoc)); |
|
} |
|
if (depth == 6) |
|
{ |
|
minlocVal = src1_roi.at<double>(minLoc); |
|
minlocVal_ = src1_roi.at<double>(minLoc_); |
|
maxlocVal = src1_roi.at<double>(maxLoc); |
|
maxlocVal_ = src1_roi.at<double>(maxLoc_); |
|
error0 = ::abs(src1_roi.at<double>(minLoc_) - src1_roi.at<double>(minLoc)); |
|
error1 = ::abs(src1_roi.at<double>(maxLoc_) - src1_roi.at<double>(maxLoc)); |
|
} |
|
|
|
EXPECT_DOUBLE_EQ(minVal_, minVal); |
|
EXPECT_DOUBLE_EQ(maxVal_, maxVal); |
|
EXPECT_DOUBLE_EQ(minlocVal_, minlocVal); |
|
EXPECT_DOUBLE_EQ(maxlocVal_, maxlocVal); |
|
|
|
EXPECT_DOUBLE_EQ(error0, 0.0); |
|
EXPECT_DOUBLE_EQ(error1, 0.0); |
|
} |
|
} |
|
|
|
//////////////////////////////// Sum ///////////////////////////////////////////////// |
|
|
|
typedef ArithmTestBase Sum; |
|
|
|
TEST_P(Sum, DISABLED_MAT) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
Scalar cpures = cv::sum(src1_roi); |
|
Scalar gpures = cv::ocl::sum(gsrc1); |
|
|
|
//check results |
|
EXPECT_NEAR(cpures[0], gpures[0], 0.1); |
|
EXPECT_NEAR(cpures[1], gpures[1], 0.1); |
|
EXPECT_NEAR(cpures[2], gpures[2], 0.1); |
|
EXPECT_NEAR(cpures[3], gpures[3], 0.1); |
|
} |
|
} |
|
|
|
//////////////////////////////// CountNonZero ///////////////////////////////////////////////// |
|
|
|
typedef ArithmTestBase CountNonZero; |
|
|
|
TEST_P(CountNonZero, MAT) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
int cpures = cv::countNonZero(src1_roi); |
|
int gpures = cv::ocl::countNonZero(gsrc1); |
|
|
|
EXPECT_DOUBLE_EQ((double)cpures, (double)gpures); |
|
} |
|
} |
|
|
|
//////////////////////////////// Phase ///////////////////////////////////////////////// |
|
|
|
typedef ArithmTestBase Phase; |
|
|
|
TEST_P(Phase, DISABLED_Mat) |
|
{ |
|
for (int angelInDegrees = 0; angelInDegrees < 2; angelInDegrees++) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
cv::phase(src1_roi, src2_roi, dst1_roi, angelInDegrees ? true : false); |
|
cv::ocl::phase(gsrc1, gsrc2, gdst1, angelInDegrees ? true : false); |
|
Near(1e-2); |
|
} |
|
} |
|
} |
|
|
|
//////////////////////////////// Bitwise_and ///////////////////////////////////////////////// |
|
|
|
typedef ArithmTestBase Bitwise_and; |
|
|
|
TEST_P(Bitwise_and, Mat) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::bitwise_and(src1_roi, src2_roi, dst1_roi); |
|
cv::ocl::bitwise_and(gsrc1, gsrc2, gdst1); |
|
Near(0); |
|
} |
|
} |
|
|
|
TEST_P(Bitwise_and, Mat_Mask) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::bitwise_and(src1_roi, src2_roi, dst1_roi, mask_roi); |
|
cv::ocl::bitwise_and(gsrc1, gsrc2, gdst1, gmask); |
|
Near(0); |
|
} |
|
} |
|
|
|
TEST_P(Bitwise_and, Scalar) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::bitwise_and(src1_roi, val, dst1_roi); |
|
cv::ocl::bitwise_and(gsrc1, val, gdst1); |
|
Near(1e-5); |
|
} |
|
} |
|
|
|
TEST_P(Bitwise_and, Scalar_Mask) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::bitwise_and(src1_roi, val, dst1_roi, mask_roi); |
|
cv::ocl::bitwise_and(gsrc1, val, gdst1, gmask); |
|
Near(1e-5); |
|
} |
|
} |
|
|
|
//////////////////////////////// Bitwise_or ///////////////////////////////////////////////// |
|
|
|
typedef ArithmTestBase Bitwise_or; |
|
|
|
TEST_P(Bitwise_or, Mat) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::bitwise_or(src1_roi, src2_roi, dst1_roi); |
|
cv::ocl::bitwise_or(gsrc1, gsrc2, gdst1); |
|
Near(0); |
|
} |
|
} |
|
|
|
TEST_P(Bitwise_or, Mat_Mask) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::bitwise_or(src1_roi, src2_roi, dst1_roi, mask_roi); |
|
cv::ocl::bitwise_or(gsrc1, gsrc2, gdst1, gmask); |
|
Near(0); |
|
} |
|
} |
|
|
|
TEST_P(Bitwise_or, Scalar) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::bitwise_or(src1_roi, val, dst1_roi); |
|
cv::ocl::bitwise_or(gsrc1, val, gdst1); |
|
Near(1e-5); |
|
} |
|
} |
|
|
|
TEST_P(Bitwise_or, Scalar_Mask) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::bitwise_or(src1_roi, val, dst1_roi, mask_roi); |
|
cv::ocl::bitwise_or(gsrc1, val, gdst1, gmask); |
|
Near(1e-5); |
|
} |
|
} |
|
|
|
//////////////////////////////// Bitwise_xor ///////////////////////////////////////////////// |
|
|
|
typedef ArithmTestBase Bitwise_xor; |
|
|
|
TEST_P(Bitwise_xor, Mat) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::bitwise_xor(src1_roi, src2_roi, dst1_roi); |
|
cv::ocl::bitwise_xor(gsrc1, gsrc2, gdst1); |
|
Near(0); |
|
} |
|
} |
|
|
|
TEST_P(Bitwise_xor, Mat_Mask) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::bitwise_xor(src1_roi, src2_roi, dst1_roi, mask_roi); |
|
cv::ocl::bitwise_xor(gsrc1, gsrc2, gdst1, gmask); |
|
Near(0); |
|
} |
|
} |
|
|
|
TEST_P(Bitwise_xor, Scalar) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::bitwise_xor(src1_roi, val, dst1_roi); |
|
cv::ocl::bitwise_xor(gsrc1, val, gdst1); |
|
Near(1e-5); |
|
} |
|
} |
|
|
|
TEST_P(Bitwise_xor, Scalar_Mask) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::bitwise_xor(src1_roi, val, dst1_roi, mask_roi); |
|
cv::ocl::bitwise_xor(gsrc1, val, gdst1, gmask); |
|
Near(1e-5); |
|
} |
|
} |
|
|
|
//////////////////////////////// Bitwise_not ///////////////////////////////////////////////// |
|
|
|
typedef ArithmTestBase Bitwise_not; |
|
|
|
TEST_P(Bitwise_not, Mat) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::bitwise_not(src1_roi, dst1_roi); |
|
cv::ocl::bitwise_not(gsrc1, gdst1); |
|
Near(0); |
|
} |
|
} |
|
|
|
//////////////////////////////// Compare ///////////////////////////////////////////////// |
|
|
|
typedef ArithmTestBase Compare; |
|
|
|
TEST_P(Compare, Mat) |
|
{ |
|
int cmp_codes[] = { CMP_EQ, CMP_GT, CMP_GE, CMP_LT, CMP_LE, CMP_NE }; |
|
int cmp_num = sizeof(cmp_codes) / sizeof(int); |
|
|
|
for (int i = 0; i < cmp_num; ++i) |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
cv::compare(src1_roi, src2_roi, dst1_roi, cmp_codes[i]); |
|
cv::ocl::compare(gsrc1, gsrc2, gdst1, cmp_codes[i]); |
|
|
|
Near(0); |
|
} |
|
} |
|
|
|
//////////////////////////////// Pow ///////////////////////////////////////////////// |
|
|
|
typedef ArithmTestBase Pow; |
|
|
|
TEST_P(Pow, Mat) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
double p = 4.5; |
|
cv::pow(src1_roi, p, dst1_roi); |
|
cv::ocl::pow(gsrc1, p, gdst1); |
|
Near(1); |
|
} |
|
} |
|
|
|
//////////////////////////////// AddWeighted ///////////////////////////////////////////////// |
|
|
|
typedef ArithmTestBase AddWeighted; |
|
|
|
TEST_P(AddWeighted, Mat) |
|
{ |
|
for (int j = 0; j < LOOP_TIMES; j++) |
|
{ |
|
random_roi(); |
|
|
|
const double alpha = 2.0, beta = 1.0, gama = 3.0; |
|
|
|
cv::addWeighted(src1_roi, alpha, src2_roi, beta, gama, dst1_roi); |
|
cv::ocl::addWeighted(gsrc1, alpha, gsrc2, beta, gama, gdst1); |
|
|
|
Near(1e-5); |
|
} |
|
} |
|
|
|
//////////////////////////////////////// Instantiation ///////////////////////////////////////// |
|
|
|
INSTANTIATE_TEST_CASE_P(Arithm, Lut, Combine(testing::Range(CV_8U, CV_USRTYPE1), testing::Range(1, 5), Bool(), Bool())); // + |
|
INSTANTIATE_TEST_CASE_P(Arithm, Exp, Combine(testing::Values(CV_32F, CV_64F), testing::Range(1, 5), Bool())); // + |
|
INSTANTIATE_TEST_CASE_P(Arithm, Log, Combine(testing::Values(CV_32F, CV_64F), testing::Range(1, 5), Bool())); // + |
|
INSTANTIATE_TEST_CASE_P(Arithm, Add, Combine(testing::Range(CV_8U, CV_USRTYPE1), testing::Range(1, 5), Bool())); // + |
|
INSTANTIATE_TEST_CASE_P(Arithm, Sub, Combine(testing::Range(CV_8U, CV_USRTYPE1), testing::Range(1, 5), Bool())); // + |
|
INSTANTIATE_TEST_CASE_P(Arithm, Mul, Combine(testing::Range(CV_8U, CV_USRTYPE1), testing::Range(1, 5), Bool())); |
|
INSTANTIATE_TEST_CASE_P(Arithm, Div, Combine(testing::Range(CV_8U, CV_USRTYPE1), testing::Range(1, 5), Bool())); |
|
INSTANTIATE_TEST_CASE_P(Arithm, Absdiff, Combine(testing::Range(CV_8U, CV_USRTYPE1), testing::Range(1, 5), Bool())); // + |
|
INSTANTIATE_TEST_CASE_P(Arithm, CartToPolar, Combine(Values(CV_32F, CV_64F), testing::Range(1, 5), Bool())); // + |
|
INSTANTIATE_TEST_CASE_P(Arithm, PolarToCart, Combine(Values(CV_32F, CV_64F), testing::Range(1, 5), Bool())); // + |
|
INSTANTIATE_TEST_CASE_P(Arithm, Magnitude, Combine(Values(CV_32F, CV_64F), testing::Range(1, 5), Bool())); // + |
|
INSTANTIATE_TEST_CASE_P(Arithm, Transpose, Combine(testing::Range(CV_8U, CV_USRTYPE1), testing::Range(1, 5), Bool())); // + |
|
INSTANTIATE_TEST_CASE_P(Arithm, Flip, Combine(testing::Range(CV_8U, CV_USRTYPE1), testing::Range(1, 5), Bool())); // + |
|
INSTANTIATE_TEST_CASE_P(Arithm, MinMax, Combine(testing::Range(CV_8U, CV_USRTYPE1), Values(1), Bool())); |
|
INSTANTIATE_TEST_CASE_P(Arithm, MinMaxLoc, Combine(testing::Range(CV_8U, CV_USRTYPE1), Values(1), Bool())); // + |
|
INSTANTIATE_TEST_CASE_P(Arithm, Sum, Combine(testing::Range(CV_8U, CV_USRTYPE1), testing::Range(1, 5), Bool())); |
|
INSTANTIATE_TEST_CASE_P(Arithm, CountNonZero, Combine(testing::Range(CV_8U, CV_USRTYPE1), Values(1), Bool())); // + |
|
INSTANTIATE_TEST_CASE_P(Arithm, Phase, Combine(Values(CV_32F, CV_64F), testing::Range(1, 5), Bool())); // + |
|
INSTANTIATE_TEST_CASE_P(Arithm, Bitwise_and, Combine(testing::Range(CV_8U, CV_USRTYPE1), testing::Range(1, 5), Bool())); // + |
|
INSTANTIATE_TEST_CASE_P(Arithm, Bitwise_or, Combine(testing::Range(CV_8U, CV_USRTYPE1), testing::Range(1, 5), Bool())); // + |
|
INSTANTIATE_TEST_CASE_P(Arithm, Bitwise_xor, Combine(testing::Range(CV_8U, CV_USRTYPE1), testing::Range(1, 5), Bool())); // + |
|
INSTANTIATE_TEST_CASE_P(Arithm, Bitwise_not, Combine(testing::Range(CV_8U, CV_USRTYPE1), testing::Range(1, 5), Bool())); // + |
|
INSTANTIATE_TEST_CASE_P(Arithm, Compare, Combine(testing::Range(CV_8U, CV_USRTYPE1), Values(1), Bool())); // + |
|
INSTANTIATE_TEST_CASE_P(Arithm, Pow, Combine(Values(CV_32F, CV_64F), testing::Range(1, 5), Bool())); // + |
|
INSTANTIATE_TEST_CASE_P(Arithm, AddWeighted, Combine(testing::Range(CV_8U, CV_USRTYPE1), testing::Range(1, 5), Bool())); // + |
|
|
|
#endif // HAVE_OPENCL
|
|
|