289 lines
8.1 KiB
C++
289 lines
8.1 KiB
C++
|
/*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.
|
||
|
// Copyright (C) 2013, Alfonso Sanchez-Beato, 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"
|
||
|
|
||
|
namespace opencv_test { namespace {
|
||
|
|
||
|
#define REG_DEBUG_OUTPUT 0
|
||
|
|
||
|
|
||
|
class RegTest : public testing::Test
|
||
|
{
|
||
|
public:
|
||
|
void loadImage(int dstDataType = CV_32FC3);
|
||
|
|
||
|
void testShift();
|
||
|
void testEuclidean();
|
||
|
void testSimilarity();
|
||
|
void testAffine();
|
||
|
void testProjective();
|
||
|
private:
|
||
|
Mat img1;
|
||
|
};
|
||
|
|
||
|
void RegTest::testShift()
|
||
|
{
|
||
|
Mat img2;
|
||
|
|
||
|
// Warp original image
|
||
|
Vec<double, 2> shift(5., 5.);
|
||
|
MapShift mapTest(shift);
|
||
|
mapTest.warp(img1, img2);
|
||
|
|
||
|
// Register
|
||
|
Ptr<Mapper> mapper = makePtr<MapperGradShift>();
|
||
|
MapperPyramid mappPyr(mapper);
|
||
|
Ptr<Map> mapPtr = mappPyr.calculate(img1, img2);
|
||
|
|
||
|
// Print result
|
||
|
Ptr<MapShift> mapShift = MapTypeCaster::toShift(mapPtr);
|
||
|
#if REG_DEBUG_OUTPUT
|
||
|
cout << endl << "--- Testing shift mapper ---" << endl;
|
||
|
cout << Mat(shift) << endl;
|
||
|
cout << Mat(mapShift->getShift()) << endl;
|
||
|
#endif
|
||
|
// Check accuracy
|
||
|
Ptr<Map> mapInv(mapShift->inverseMap());
|
||
|
mapTest.compose(mapInv);
|
||
|
double shNorm = cv::norm(mapTest.getShift());
|
||
|
EXPECT_LE(shNorm, 0.1);
|
||
|
}
|
||
|
|
||
|
void RegTest::testEuclidean()
|
||
|
{
|
||
|
Mat img2;
|
||
|
|
||
|
// Warp original image
|
||
|
double theta = 3*CV_PI/180;
|
||
|
double cosT = cos(theta);
|
||
|
double sinT = sin(theta);
|
||
|
Matx<double, 2, 2> linTr(cosT, -sinT, sinT, cosT);
|
||
|
Vec<double, 2> shift(5., 5.);
|
||
|
MapAffine mapTest(linTr, shift);
|
||
|
mapTest.warp(img1, img2);
|
||
|
|
||
|
// Register
|
||
|
Ptr<Mapper> mapper = makePtr<MapperGradEuclid>();
|
||
|
MapperPyramid mappPyr(mapper);
|
||
|
Ptr<Map> mapPtr = mappPyr.calculate(img1, img2);
|
||
|
|
||
|
// Print result
|
||
|
Ptr<MapAffine> mapAff = MapTypeCaster::toAffine(mapPtr);
|
||
|
#if REG_DEBUG_OUTPUT
|
||
|
cout << endl << "--- Testing Euclidean mapper ---" << endl;
|
||
|
cout << Mat(linTr) << endl;
|
||
|
cout << Mat(shift) << endl;
|
||
|
cout << Mat(mapAff->getLinTr()) << endl;
|
||
|
cout << Mat(mapAff->getShift()) << endl;
|
||
|
#endif
|
||
|
// Check accuracy
|
||
|
Ptr<Map> mapInv(mapAff->inverseMap());
|
||
|
mapTest.compose(mapInv);
|
||
|
double shNorm = cv::norm(mapTest.getShift());
|
||
|
EXPECT_LE(shNorm, 0.1);
|
||
|
double linTrNorm = cv::norm(mapTest.getLinTr());
|
||
|
EXPECT_LE(linTrNorm, sqrt(2.) + 0.01);
|
||
|
EXPECT_GE(linTrNorm, sqrt(2.) - 0.01);
|
||
|
}
|
||
|
|
||
|
void RegTest::testSimilarity()
|
||
|
{
|
||
|
Mat img2;
|
||
|
|
||
|
// Warp original image
|
||
|
double theta = 3*CV_PI/180;
|
||
|
double scale = 0.95;
|
||
|
double a = scale*cos(theta);
|
||
|
double b = scale*sin(theta);
|
||
|
Matx<double, 2, 2> linTr(a, -b, b, a);
|
||
|
Vec<double, 2> shift(5., 5.);
|
||
|
MapAffine mapTest(linTr, shift);
|
||
|
mapTest.warp(img1, img2);
|
||
|
|
||
|
// Register
|
||
|
Ptr<Mapper> mapper = makePtr<MapperGradSimilar>();
|
||
|
MapperPyramid mappPyr(mapper);
|
||
|
Ptr<Map> mapPtr = mappPyr.calculate(img1, img2);
|
||
|
|
||
|
// Print result
|
||
|
Ptr<MapAffine> mapAff = MapTypeCaster::toAffine(mapPtr);
|
||
|
#if REG_DEBUG_OUTPUT
|
||
|
cout << endl << "--- Testing similarity mapper ---" << endl;
|
||
|
cout << Mat(linTr) << endl;
|
||
|
cout << Mat(shift) << endl;
|
||
|
cout << Mat(mapAff->getLinTr()) << endl;
|
||
|
cout << Mat(mapAff->getShift()) << endl;
|
||
|
#endif
|
||
|
|
||
|
// Check accuracy
|
||
|
Ptr<Map> mapInv(mapAff->inverseMap());
|
||
|
mapTest.compose(mapInv);
|
||
|
double shNorm = cv::norm(mapTest.getShift());
|
||
|
EXPECT_LE(shNorm, 0.1);
|
||
|
double linTrNorm = cv::norm(mapTest.getLinTr());
|
||
|
EXPECT_LE(linTrNorm, sqrt(2.) + 0.01);
|
||
|
EXPECT_GE(linTrNorm, sqrt(2.) - 0.01);
|
||
|
}
|
||
|
|
||
|
void RegTest::testAffine()
|
||
|
{
|
||
|
Mat img2;
|
||
|
|
||
|
// Warp original image
|
||
|
Matx<double, 2, 2> linTr(1., 0.1, -0.01, 1.);
|
||
|
Vec<double, 2> shift(1., 1.);
|
||
|
MapAffine mapTest(linTr, shift);
|
||
|
mapTest.warp(img1, img2);
|
||
|
|
||
|
// Register
|
||
|
Ptr<Mapper> mapper = makePtr<MapperGradAffine>();
|
||
|
MapperPyramid mappPyr(mapper);
|
||
|
Ptr<Map> mapPtr = mappPyr.calculate(img1, img2);
|
||
|
|
||
|
// Print result
|
||
|
Ptr<MapAffine> mapAff = MapTypeCaster::toAffine(mapPtr);
|
||
|
#if REG_DEBUG_OUTPUT
|
||
|
cout << endl << "--- Testing affine mapper ---" << endl;
|
||
|
cout << Mat(linTr) << endl;
|
||
|
cout << Mat(shift) << endl;
|
||
|
cout << Mat(mapAff->getLinTr()) << endl;
|
||
|
cout << Mat(mapAff->getShift()) << endl;
|
||
|
#endif
|
||
|
|
||
|
// Check accuracy
|
||
|
Ptr<Map> mapInv(mapAff->inverseMap());
|
||
|
mapTest.compose(mapInv);
|
||
|
double shNorm = cv::norm(mapTest.getShift());
|
||
|
EXPECT_LE(shNorm, 0.1);
|
||
|
double linTrNorm = cv::norm(mapTest.getLinTr());
|
||
|
EXPECT_LE(linTrNorm, sqrt(2.) + 0.01);
|
||
|
EXPECT_GE(linTrNorm, sqrt(2.) - 0.01);
|
||
|
}
|
||
|
|
||
|
|
||
|
void RegTest::testProjective()
|
||
|
{
|
||
|
Mat img2;
|
||
|
|
||
|
// Warp original image
|
||
|
Matx<double, 3, 3> projTr(1., 0., 0., 0., 1., 0., 0.0001, 0.0001, 1);
|
||
|
MapProjec mapTest(projTr);
|
||
|
mapTest.warp(img1, img2);
|
||
|
|
||
|
// Register
|
||
|
Ptr<Mapper> mapper = makePtr<MapperGradProj>();
|
||
|
MapperPyramid mappPyr(mapper);
|
||
|
Ptr<Map> mapPtr = mappPyr.calculate(img1, img2);
|
||
|
|
||
|
// Print result
|
||
|
Ptr<MapProjec> mapProj = MapTypeCaster::toProjec(mapPtr);
|
||
|
mapProj->normalize();
|
||
|
#if REG_DEBUG_OUTPUT
|
||
|
cout << endl << "--- Testing projective transformation mapper ---" << endl;
|
||
|
cout << Mat(projTr) << endl;
|
||
|
cout << Mat(mapProj->getProjTr()) << endl;
|
||
|
#endif
|
||
|
|
||
|
// Check accuracy
|
||
|
Ptr<Map> mapInv(mapProj->inverseMap());
|
||
|
mapTest.compose(mapInv);
|
||
|
double projNorm = cv::norm(mapTest.getProjTr());
|
||
|
EXPECT_LE(projNorm, sqrt(3.) + 0.01);
|
||
|
EXPECT_GE(projNorm, sqrt(3.) - 0.01);
|
||
|
}
|
||
|
|
||
|
void RegTest::loadImage(int dstDataType)
|
||
|
{
|
||
|
const string imageName = cvtest::TS::ptr()->get_data_path() + "reg/home.png";
|
||
|
|
||
|
img1 = imread(imageName, -1);
|
||
|
ASSERT_TRUE(!img1.empty());
|
||
|
img1.convertTo(img1, dstDataType);
|
||
|
}
|
||
|
|
||
|
|
||
|
TEST_F(RegTest, shift)
|
||
|
{
|
||
|
loadImage();
|
||
|
testShift();
|
||
|
}
|
||
|
|
||
|
TEST_F(RegTest, euclidean)
|
||
|
{
|
||
|
loadImage();
|
||
|
testEuclidean();
|
||
|
}
|
||
|
|
||
|
TEST_F(RegTest, similarity)
|
||
|
{
|
||
|
loadImage();
|
||
|
testSimilarity();
|
||
|
}
|
||
|
|
||
|
TEST_F(RegTest, affine)
|
||
|
{
|
||
|
loadImage();
|
||
|
testAffine();
|
||
|
}
|
||
|
|
||
|
TEST_F(RegTest, projective)
|
||
|
{
|
||
|
loadImage();
|
||
|
testProjective();
|
||
|
}
|
||
|
|
||
|
TEST_F(RegTest, projective_dt64fc3)
|
||
|
{
|
||
|
loadImage(CV_64FC3);
|
||
|
testProjective();
|
||
|
}
|
||
|
|
||
|
TEST_F(RegTest, projective_dt64fc1)
|
||
|
{
|
||
|
loadImage(CV_64FC1);
|
||
|
testProjective();
|
||
|
}
|
||
|
|
||
|
}} // namespace
|