test_distancetransform.cpp 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452
  1. /*M///////////////////////////////////////////////////////////////////////////////////////
  2. //
  3. // IMPORTANT: READ BEFORE DOWNLOADING, COPYING, INSTALLING OR USING.
  4. //
  5. // By downloading, copying, installing or using the software you agree to this license.
  6. // If you do not agree to this license, do not download, install,
  7. // copy or use the software.
  8. //
  9. //
  10. // Intel License Agreement
  11. // For Open Source Computer Vision Library
  12. //
  13. // Copyright (C) 2000, Intel Corporation, all rights reserved.
  14. // Third party copyrights are property of their respective owners.
  15. //
  16. // Redistribution and use in source and binary forms, with or without modification,
  17. // are permitted provided that the following conditions are met:
  18. //
  19. // * Redistribution's of source code must retain the above copyright notice,
  20. // this list of conditions and the following disclaimer.
  21. //
  22. // * Redistribution's in binary form must reproduce the above copyright notice,
  23. // this list of conditions and the following disclaimer in the documentation
  24. // and/or other materials provided with the distribution.
  25. //
  26. // * The name of Intel Corporation may not be used to endorse or promote products
  27. // derived from this software without specific prior written permission.
  28. //
  29. // This software is provided by the copyright holders and contributors "as is" and
  30. // any express or implied warranties, including, but not limited to, the implied
  31. // warranties of merchantability and fitness for a particular purpose are disclaimed.
  32. // In no event shall the Intel Corporation or contributors be liable for any direct,
  33. // indirect, incidental, special, exemplary, or consequential damages
  34. // (including, but not limited to, procurement of substitute goods or services;
  35. // loss of use, data, or profits; or business interruption) however caused
  36. // and on any theory of liability, whether in contract, strict liability,
  37. // or tort (including negligence or otherwise) arising in any way out of
  38. // the use of this software, even if advised of the possibility of such damage.
  39. //
  40. //M*/
  41. #include "test_precomp.hpp"
  42. #include <numeric>
  43. namespace opencv_test { namespace {
  44. class CV_DisTransTest : public cvtest::ArrayTest
  45. {
  46. public:
  47. CV_DisTransTest();
  48. protected:
  49. void get_test_array_types_and_sizes( int test_case_idx, vector<vector<Size> >& sizes, vector<vector<int> >& types );
  50. double get_success_error_level( int test_case_idx, int i, int j );
  51. void run_func();
  52. void prepare_to_validation( int );
  53. void get_minmax_bounds( int i, int j, int type, Scalar& low, Scalar& high );
  54. int prepare_test_case( int test_case_idx );
  55. int mask_size;
  56. int dist_type;
  57. int fill_labels;
  58. float mask[3];
  59. };
  60. CV_DisTransTest::CV_DisTransTest()
  61. {
  62. test_array[INPUT].push_back(NULL);
  63. test_array[OUTPUT].push_back(NULL);
  64. test_array[OUTPUT].push_back(NULL);
  65. test_array[REF_OUTPUT].push_back(NULL);
  66. test_array[REF_OUTPUT].push_back(NULL);
  67. optional_mask = false;
  68. element_wise_relative_error = true;
  69. }
  70. void CV_DisTransTest::get_test_array_types_and_sizes( int test_case_idx,
  71. vector<vector<Size> >& sizes, vector<vector<int> >& types )
  72. {
  73. RNG& rng = ts->get_rng();
  74. cvtest::ArrayTest::get_test_array_types_and_sizes( test_case_idx, sizes, types );
  75. types[INPUT][0] = CV_8UC1;
  76. types[OUTPUT][0] = types[REF_OUTPUT][0] = CV_32FC1;
  77. types[OUTPUT][1] = types[REF_OUTPUT][1] = CV_32SC1;
  78. if( cvtest::randInt(rng) & 1 )
  79. {
  80. mask_size = 3;
  81. }
  82. else
  83. {
  84. mask_size = 5;
  85. }
  86. dist_type = cvtest::randInt(rng) % 3;
  87. dist_type = dist_type == 0 ? CV_DIST_C : dist_type == 1 ? CV_DIST_L1 : CV_DIST_L2;
  88. // for now, check only the "labeled" distance transform mode
  89. fill_labels = 0;
  90. if( !fill_labels )
  91. sizes[OUTPUT][1] = sizes[REF_OUTPUT][1] = cvSize(0,0);
  92. }
  93. double CV_DisTransTest::get_success_error_level( int /*test_case_idx*/, int /*i*/, int /*j*/ )
  94. {
  95. Size sz = test_mat[INPUT][0].size();
  96. return dist_type == CV_DIST_C || dist_type == CV_DIST_L1 ? 0 : 0.01*MAX(sz.width, sz.height);
  97. }
  98. void CV_DisTransTest::get_minmax_bounds( int i, int j, int type, Scalar& low, Scalar& high )
  99. {
  100. cvtest::ArrayTest::get_minmax_bounds( i, j, type, low, high );
  101. if( i == INPUT && CV_MAT_DEPTH(type) == CV_8U )
  102. {
  103. low = Scalar::all(0);
  104. high = Scalar::all(10);
  105. }
  106. }
  107. int CV_DisTransTest::prepare_test_case( int test_case_idx )
  108. {
  109. int code = cvtest::ArrayTest::prepare_test_case( test_case_idx );
  110. if( code > 0 )
  111. {
  112. // the function's response to an "all-nonzeros" image is not determined,
  113. // so put at least one zero point
  114. Mat& mat = test_mat[INPUT][0];
  115. RNG& rng = ts->get_rng();
  116. int i = cvtest::randInt(rng) % mat.rows;
  117. int j = cvtest::randInt(rng) % mat.cols;
  118. mat.at<uchar>(i,j) = 0;
  119. }
  120. return code;
  121. }
  122. void CV_DisTransTest::run_func()
  123. {
  124. cvDistTransform( test_array[INPUT][0], test_array[OUTPUT][0], dist_type, mask_size,
  125. dist_type == CV_DIST_USER ? mask : 0, test_array[OUTPUT][1] );
  126. }
  127. static void
  128. cvTsDistTransform( const CvMat* _src, CvMat* _dst, int dist_type,
  129. int mask_size, float* _mask, CvMat* /*_labels*/ )
  130. {
  131. int i, j, k;
  132. int width = _src->cols, height = _src->rows;
  133. const float init_val = 1e6;
  134. float mask[3];
  135. CvMat* temp;
  136. int ofs[16] = {0};
  137. float delta[16];
  138. int tstep, count;
  139. CV_Assert( mask_size == 3 || mask_size == 5 );
  140. if( dist_type == CV_DIST_USER )
  141. memcpy( mask, _mask, sizeof(mask) );
  142. else if( dist_type == CV_DIST_C )
  143. {
  144. mask_size = 3;
  145. mask[0] = mask[1] = 1.f;
  146. }
  147. else if( dist_type == CV_DIST_L1 )
  148. {
  149. mask_size = 3;
  150. mask[0] = 1.f;
  151. mask[1] = 2.f;
  152. }
  153. else if( mask_size == 3 )
  154. {
  155. mask[0] = 0.955f;
  156. mask[1] = 1.3693f;
  157. }
  158. else
  159. {
  160. mask[0] = 1.0f;
  161. mask[1] = 1.4f;
  162. mask[2] = 2.1969f;
  163. }
  164. temp = cvCreateMat( height + mask_size-1, width + mask_size-1, CV_32F );
  165. tstep = temp->step / sizeof(float);
  166. if( mask_size == 3 )
  167. {
  168. count = 4;
  169. ofs[0] = -1; delta[0] = mask[0];
  170. ofs[1] = -tstep-1; delta[1] = mask[1];
  171. ofs[2] = -tstep; delta[2] = mask[0];
  172. ofs[3] = -tstep+1; delta[3] = mask[1];
  173. }
  174. else
  175. {
  176. count = 8;
  177. ofs[0] = -1; delta[0] = mask[0];
  178. ofs[1] = -tstep-2; delta[1] = mask[2];
  179. ofs[2] = -tstep-1; delta[2] = mask[1];
  180. ofs[3] = -tstep; delta[3] = mask[0];
  181. ofs[4] = -tstep+1; delta[4] = mask[1];
  182. ofs[5] = -tstep+2; delta[5] = mask[2];
  183. ofs[6] = -tstep*2-1; delta[6] = mask[2];
  184. ofs[7] = -tstep*2+1; delta[7] = mask[2];
  185. }
  186. for( i = 0; i < mask_size/2; i++ )
  187. {
  188. float* t0 = (float*)(temp->data.ptr + i*temp->step);
  189. float* t1 = (float*)(temp->data.ptr + (temp->rows - i - 1)*temp->step);
  190. for( j = 0; j < width + mask_size - 1; j++ )
  191. t0[j] = t1[j] = init_val;
  192. }
  193. for( i = 0; i < height; i++ )
  194. {
  195. uchar* s = _src->data.ptr + i*_src->step;
  196. float* tmp = (float*)(temp->data.ptr + temp->step*(i + (mask_size/2))) + (mask_size/2);
  197. for( j = 0; j < mask_size/2; j++ )
  198. tmp[-j-1] = tmp[j + width] = init_val;
  199. for( j = 0; j < width; j++ )
  200. {
  201. if( s[j] == 0 )
  202. tmp[j] = 0;
  203. else
  204. {
  205. float min_dist = init_val;
  206. for( k = 0; k < count; k++ )
  207. {
  208. float t = tmp[j+ofs[k]] + delta[k];
  209. if( min_dist > t )
  210. min_dist = t;
  211. }
  212. tmp[j] = min_dist;
  213. }
  214. }
  215. }
  216. for( i = height - 1; i >= 0; i-- )
  217. {
  218. float* d = (float*)(_dst->data.ptr + i*_dst->step);
  219. float* tmp = (float*)(temp->data.ptr + temp->step*(i + (mask_size/2))) + (mask_size/2);
  220. for( j = width - 1; j >= 0; j-- )
  221. {
  222. float min_dist = tmp[j];
  223. if( min_dist > mask[0] )
  224. {
  225. for( k = 0; k < count; k++ )
  226. {
  227. float t = tmp[j-ofs[k]] + delta[k];
  228. if( min_dist > t )
  229. min_dist = t;
  230. }
  231. tmp[j] = min_dist;
  232. }
  233. d[j] = min_dist;
  234. }
  235. }
  236. cvReleaseMat( &temp );
  237. }
  238. void CV_DisTransTest::prepare_to_validation( int /*test_case_idx*/ )
  239. {
  240. CvMat _input = cvMat(test_mat[INPUT][0]), _output = cvMat(test_mat[REF_OUTPUT][0]);
  241. cvTsDistTransform( &_input, &_output, dist_type, mask_size, mask, 0 );
  242. }
  243. TEST(Imgproc_DistanceTransform, accuracy) { CV_DisTransTest test; test.safe_run(); }
  244. BIGDATA_TEST(Imgproc_DistanceTransform, large_image_12218)
  245. {
  246. const int lls_maxcnt = 79992000; // labels's maximum count
  247. const int lls_mincnt = 1; // labels's minimum count
  248. int i, j, nz;
  249. Mat src(8000, 20000, CV_8UC1), dst, labels;
  250. for( i = 0; i < src.rows; i++ )
  251. for( j = 0; j < src.cols; j++ )
  252. src.at<uchar>(i, j) = (j > (src.cols / 2)) ? 0 : 255;
  253. distanceTransform(src, dst, labels, cv::DIST_L2, cv::DIST_MASK_3, DIST_LABEL_PIXEL);
  254. double scale = (double)lls_mincnt / (double)lls_maxcnt;
  255. labels.convertTo(labels, CV_32SC1, scale);
  256. Size size = labels.size();
  257. nz = cv::countNonZero(labels);
  258. EXPECT_EQ(nz, (size.height*size.width / 2));
  259. }
  260. TEST(Imgproc_DistanceTransform, wide_image_22732)
  261. {
  262. Mat src = Mat::zeros(1, 4099, CV_8U); // 4099 or larger used to be bad
  263. Mat dist(src.rows, src.cols, CV_32F);
  264. distanceTransform(src, dist, DIST_L2, DIST_MASK_PRECISE, CV_32F);
  265. int nz = countNonZero(dist);
  266. EXPECT_EQ(nz, 0);
  267. }
  268. TEST(Imgproc_DistanceTransform, large_square_22732)
  269. {
  270. Mat src = Mat::zeros(8000, 8005, CV_8U), dist;
  271. distanceTransform(src, dist, DIST_L2, DIST_MASK_PRECISE, CV_32F);
  272. int nz = countNonZero(dist);
  273. EXPECT_EQ(dist.size(), src.size());
  274. EXPECT_EQ(dist.type(), CV_32F);
  275. EXPECT_EQ(nz, 0);
  276. Point p0(src.cols-1, src.rows-1);
  277. src.setTo(1);
  278. src.at<uchar>(p0) = 0;
  279. distanceTransform(src, dist, DIST_L2, DIST_MASK_PRECISE, CV_32F);
  280. EXPECT_EQ(dist.size(), src.size());
  281. EXPECT_EQ(dist.type(), CV_32F);
  282. bool first = true;
  283. int nerrs = 0;
  284. for (int y = 0; y < dist.rows; y++)
  285. for (int x = 0; x < dist.cols; x++) {
  286. float d = dist.at<float>(y, x);
  287. double dx = (double)(x - p0.x), dy = (double)(y - p0.y);
  288. float d0 = (float)sqrt(dx*dx + dy*dy);
  289. if (std::abs(d0 - d) > 1) {
  290. if (first) {
  291. printf("y=%d, x=%d. dist_ref=%.2f, dist=%.2f\n", y, x, d0, d);
  292. first = false;
  293. }
  294. nerrs++;
  295. }
  296. }
  297. EXPECT_EQ(0, nerrs) << "reference distance map is different from computed one at " << nerrs << " pixels\n";
  298. }
  299. BIGDATA_TEST(Imgproc_DistanceTransform, issue_23895_3x3)
  300. {
  301. Mat src = Mat::zeros(50000, 50000, CV_8U), dist;
  302. distanceTransform(src.col(0), dist, DIST_L2, DIST_MASK_3);
  303. int nz = countNonZero(dist);
  304. EXPECT_EQ(nz, 0);
  305. }
  306. BIGDATA_TEST(Imgproc_DistanceTransform, issue_23895_5x5)
  307. {
  308. Mat src = Mat::zeros(50000, 50000, CV_8U), dist;
  309. distanceTransform(src.col(0), dist, DIST_L2, DIST_MASK_5);
  310. int nz = countNonZero(dist);
  311. EXPECT_EQ(nz, 0);
  312. }
  313. BIGDATA_TEST(Imgproc_DistanceTransform, issue_23895_5x5_labels)
  314. {
  315. Mat src = Mat::zeros(50000, 50000, CV_8U), dist, labels;
  316. distanceTransform(src.col(0), dist, labels, DIST_L2, DIST_MASK_5);
  317. int nz = countNonZero(dist);
  318. EXPECT_EQ(nz, 0);
  319. }
  320. TEST(Imgproc_DistanceTransform, max_distance_3x3)
  321. {
  322. Mat src = Mat::ones(1, 70000, CV_8U), dist;
  323. src.at<uint8_t>(0, 0) = 0;
  324. distanceTransform(src, dist, DIST_L2, DIST_MASK_3);
  325. double minVal, maxVal;
  326. minMaxLoc(dist, &minVal, &maxVal);
  327. EXPECT_GE(maxVal, 65533);
  328. }
  329. TEST(Imgproc_DistanceTransform, max_distance_5x5)
  330. {
  331. Mat src = Mat::ones(1, 70000, CV_8U), dist;
  332. src.at<uint8_t>(0, 0) = 0;
  333. distanceTransform(src, dist, DIST_L2, DIST_MASK_5);
  334. double minVal, maxVal;
  335. minMaxLoc(dist, &minVal, &maxVal);
  336. EXPECT_GE(maxVal, 65533);
  337. }
  338. TEST(Imgproc_DistanceTransform, max_distance_5x5_labels)
  339. {
  340. Mat src = Mat::ones(1, 70000, CV_8U), dist, labels;
  341. src.at<uint8_t>(0, 0) = 0;
  342. distanceTransform(src, dist, labels, DIST_L2, DIST_MASK_5);
  343. double minVal, maxVal;
  344. minMaxLoc(dist, &minVal, &maxVal);
  345. EXPECT_GE(maxVal, 65533);
  346. }
  347. TEST(Imgproc_DistanceTransform, precise_long_dist)
  348. {
  349. static const int maxDist = 1 << 16;
  350. Mat src = Mat::ones(1, 70000, CV_8U), dist;
  351. src.at<uint8_t>(0, 0) = 0;
  352. distanceTransform(src, dist, DIST_L2, DIST_MASK_PRECISE, CV_32F);
  353. Mat expected(src.size(), CV_32F);
  354. std::iota(expected.begin<float>(), expected.end<float>(), 0.f);
  355. expected.colRange(maxDist, expected.cols).setTo(maxDist);
  356. EXPECT_EQ(cv::norm(expected, dist, NORM_INF), 0);
  357. }
  358. TEST(Imgproc_DistanceTransform, ipp_deterministic_corner)
  359. {
  360. setNumThreads(1);
  361. Mat src(1, 4096, CV_8U, Scalar(255)), dist;
  362. src.at<uint8_t>(0, 0) = 0;
  363. distanceTransform(src, dist, DIST_L2, DIST_MASK_PRECISE);
  364. for (int i = 0; i < src.cols; ++i)
  365. {
  366. float expected = static_cast<float>(i);
  367. ASSERT_EQ(expected, dist.at<float>(0, i)) << cv::format("diff: %e", expected - dist.at<float>(0, i));
  368. }
  369. }
  370. TEST(Imgproc_DistanceTransform, ipp_deterministic)
  371. {
  372. setNumThreads(1);
  373. RNG& rng = TS::ptr()->get_rng();
  374. Mat src(1, 800, CV_8U, Scalar(255)), dist;
  375. int p1 = cvtest::randInt(rng) % src.cols;
  376. int p2 = cvtest::randInt(rng) % src.cols;
  377. int p3 = cvtest::randInt(rng) % src.cols;
  378. src.at<uint8_t>(0, p1) = 0;
  379. src.at<uint8_t>(0, p2) = 0;
  380. src.at<uint8_t>(0, p3) = 0;
  381. distanceTransform(src, dist, DIST_L2, DIST_MASK_PRECISE);
  382. for (int i = 0; i < src.cols; ++i)
  383. {
  384. float expected = static_cast<float>(min(min(abs(i - p1), abs(i - p2)), abs(i - p3)));
  385. ASSERT_EQ(expected, dist.at<float>(0, i)) << cv::format("diff: %e", expected - dist.at<float>(0, i));
  386. }
  387. }
  388. }} // namespace