2011-02-09 21:55:11 +01: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.
|
|
|
|
// Copyright (C) 2009, Willow Garage Inc., all rights reserved.
|
|
|
|
// Third party copyrights are property of their respective owners.
|
|
|
|
//
|
|
|
|
// Redistribution and use in source and binary forms, with or without modification,
|
|
|
|
// are permitted provided that the following conditions are met:
|
|
|
|
//
|
|
|
|
// * Redistribution's of source code must retain the above copyright notice,
|
|
|
|
// this list of conditions and the following disclaimer.
|
|
|
|
//
|
|
|
|
// * Redistribution's in binary form must reproduce the above copyright notice,
|
|
|
|
// this list of conditions and the following disclaimer in the documentation
|
|
|
|
// and/or other materials provided with the distribution.
|
|
|
|
//
|
|
|
|
// * The name of 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 <string>
|
|
|
|
#include <limits>
|
|
|
|
|
|
|
|
using namespace cv;
|
|
|
|
using namespace std;
|
|
|
|
|
|
|
|
template<class T> double thres() { return 1.0; }
|
2012-10-17 09:12:04 +02:00
|
|
|
template<> double thres<float>() { return 1e-5; }
|
2011-02-09 21:55:11 +01:00
|
|
|
|
|
|
|
class CV_ReprojectImageTo3DTest : public cvtest::BaseTest
|
|
|
|
{
|
|
|
|
public:
|
|
|
|
CV_ReprojectImageTo3DTest() {}
|
|
|
|
~CV_ReprojectImageTo3DTest() {}
|
2012-10-17 09:12:04 +02:00
|
|
|
protected:
|
|
|
|
|
2011-02-09 21:55:11 +01:00
|
|
|
|
|
|
|
void run(int)
|
2012-10-17 09:12:04 +02:00
|
|
|
{
|
2011-02-09 21:55:11 +01:00
|
|
|
ts->set_failed_test_info(cvtest::TS::OK);
|
|
|
|
int progress = 0;
|
|
|
|
int caseId = 0;
|
|
|
|
|
|
|
|
progress = update_progress( progress, 1, 14, 0 );
|
|
|
|
runCase<float, float>(++caseId, -100.f, 100.f);
|
|
|
|
progress = update_progress( progress, 2, 14, 0 );
|
|
|
|
runCase<int, float>(++caseId, -100, 100);
|
|
|
|
progress = update_progress( progress, 3, 14, 0 );
|
|
|
|
runCase<short, float>(++caseId, -100, 100);
|
|
|
|
progress = update_progress( progress, 4, 14, 0 );
|
|
|
|
runCase<unsigned char, float>(++caseId, 10, 100);
|
|
|
|
progress = update_progress( progress, 5, 14, 0 );
|
|
|
|
|
|
|
|
runCase<float, int>(++caseId, -100.f, 100.f);
|
|
|
|
progress = update_progress( progress, 6, 14, 0 );
|
|
|
|
runCase<int, int>(++caseId, -100, 100);
|
|
|
|
progress = update_progress( progress, 7, 14, 0 );
|
|
|
|
runCase<short, int>(++caseId, -100, 100);
|
|
|
|
progress = update_progress( progress, 8, 14, 0 );
|
|
|
|
runCase<unsigned char, int>(++caseId, 10, 100);
|
|
|
|
progress = update_progress( progress, 10, 14, 0 );
|
|
|
|
|
|
|
|
runCase<float, short>(++caseId, -100.f, 100.f);
|
|
|
|
progress = update_progress( progress, 11, 14, 0 );
|
|
|
|
runCase<int, short>(++caseId, -100, 100);
|
|
|
|
progress = update_progress( progress, 12, 14, 0 );
|
|
|
|
runCase<short, short>(++caseId, -100, 100);
|
|
|
|
progress = update_progress( progress, 13, 14, 0 );
|
2012-10-17 09:12:04 +02:00
|
|
|
runCase<unsigned char, short>(++caseId, 10, 100);
|
2011-02-09 21:55:11 +01:00
|
|
|
progress = update_progress( progress, 14, 14, 0 );
|
|
|
|
}
|
|
|
|
|
|
|
|
template<class U, class V> double error(const Vec<U, 3>& v1, const Vec<V, 3>& v2) const
|
|
|
|
{
|
|
|
|
double tmp, sum = 0;
|
|
|
|
double nsum = 0;
|
|
|
|
for(int i = 0; i < 3; ++i)
|
|
|
|
{
|
|
|
|
tmp = v1[i];
|
2012-10-17 09:12:04 +02:00
|
|
|
nsum += tmp * tmp;
|
2011-02-09 21:55:11 +01:00
|
|
|
|
|
|
|
tmp = tmp - v2[i];
|
|
|
|
sum += tmp * tmp;
|
2012-10-17 09:12:04 +02:00
|
|
|
|
|
|
|
}
|
2011-02-09 21:55:11 +01:00
|
|
|
return sqrt(sum)/(sqrt(nsum)+1.);
|
|
|
|
}
|
|
|
|
|
|
|
|
template<class InT, class OutT> void runCase(int caseId, InT min, InT max)
|
2012-10-17 09:12:04 +02:00
|
|
|
{
|
2011-02-09 21:55:11 +01:00
|
|
|
typedef Vec<OutT, 3> out3d_t;
|
|
|
|
|
2012-10-17 09:12:04 +02:00
|
|
|
bool handleMissingValues = (unsigned)theRNG() % 2 == 0;
|
2011-02-09 21:55:11 +01:00
|
|
|
|
|
|
|
Mat_<InT> disp(Size(320, 240));
|
|
|
|
randu(disp, Scalar(min), Scalar(max));
|
|
|
|
|
|
|
|
if (handleMissingValues)
|
|
|
|
disp(disp.rows/2, disp.cols/2) = min - 1;
|
2012-10-17 09:12:04 +02:00
|
|
|
|
2011-02-09 21:55:11 +01:00
|
|
|
Mat_<double> Q(4, 4);
|
|
|
|
randu(Q, Scalar(-5), Scalar(5));
|
|
|
|
|
|
|
|
Mat_<out3d_t> _3dImg(disp.size());
|
2012-10-17 09:12:04 +02:00
|
|
|
|
2011-02-09 21:55:11 +01:00
|
|
|
CvMat cvdisp = disp; CvMat cv_3dImg = _3dImg; CvMat cvQ = Q;
|
|
|
|
cvReprojectImageTo3D( &cvdisp, &cv_3dImg, &cvQ, handleMissingValues );
|
|
|
|
|
|
|
|
if (numeric_limits<OutT>::max() == numeric_limits<float>::max())
|
|
|
|
reprojectImageTo3D(disp, _3dImg, Q, handleMissingValues);
|
2012-10-17 09:12:04 +02:00
|
|
|
|
2011-02-09 21:55:11 +01:00
|
|
|
for(int y = 0; y < disp.rows; ++y)
|
|
|
|
for(int x = 0; x < disp.cols; ++x)
|
|
|
|
{
|
2012-10-17 09:12:04 +02:00
|
|
|
InT d = disp(y, x);
|
2011-02-09 21:55:11 +01:00
|
|
|
|
|
|
|
double from[4] = { x, y, d, 1 };
|
|
|
|
Mat_<double> res = Q * Mat_<double>(4, 1, from);
|
|
|
|
res /= res(3, 0);
|
|
|
|
|
|
|
|
out3d_t pixel_exp = *(Vec3d*)res.data;
|
|
|
|
out3d_t pixel_out = _3dImg(y, x);
|
|
|
|
|
2012-10-17 09:12:04 +02:00
|
|
|
const int largeZValue = 10000; /* see documentation */
|
2011-02-09 21:55:11 +01:00
|
|
|
|
2012-10-17 09:12:04 +02:00
|
|
|
if (handleMissingValues && y == disp.rows/2 && x == disp.cols/2)
|
|
|
|
{
|
2011-02-09 21:55:11 +01:00
|
|
|
if (pixel_out[2] == largeZValue)
|
|
|
|
continue;
|
|
|
|
|
|
|
|
ts->printf(cvtest::TS::LOG, "Missing values are handled improperly\n");
|
2012-10-17 09:12:04 +02:00
|
|
|
ts->set_failed_test_info( cvtest::TS::FAIL_BAD_ACCURACY );
|
2011-02-09 21:55:11 +01:00
|
|
|
return;
|
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
double err = error(pixel_out, pixel_exp), t = thres<OutT>();
|
|
|
|
if ( err > t )
|
|
|
|
{
|
|
|
|
ts->printf(cvtest::TS::LOG, "case %d. too big error at (%d, %d): %g vs expected %g: res = (%g, %g, %g, w=%g) vs pixel_out = (%g, %g, %g)\n",
|
|
|
|
caseId, x, y, err, t, res(0,0), res(1,0), res(2,0), res(3,0),
|
|
|
|
(double)pixel_out[0], (double)pixel_out[1], (double)pixel_out[2]);
|
|
|
|
ts->set_failed_test_info( cvtest::TS::FAIL_BAD_ACCURACY );
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
}
|
2012-10-17 09:12:04 +02:00
|
|
|
}
|
2011-02-09 21:55:11 +01:00
|
|
|
}
|
2012-10-17 09:12:04 +02:00
|
|
|
};
|
|
|
|
|
2011-02-09 21:55:11 +01:00
|
|
|
TEST(Calib3d_ReprojectImageTo3D, accuracy) { CV_ReprojectImageTo3DTest test; test.safe_run(); }
|
|
|
|
|