Files
ceres-solver/internal/ceres/tiny_solver_test.cc
T

165 lines
4.7 KiB
C++
Raw Normal View History

2017-10-10 02:15:25 -07:00
// Ceres Solver - A fast non-linear least squares minimizer
2023-09-19 15:29:34 -07:00
// Copyright 2023 Google Inc. All rights reserved.
2017-10-10 02:15:25 -07:00
// http://ceres-solver.org/
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions are met:
//
// * Redistributions of source code must retain the above copyright notice,
// this list of conditions and the following disclaimer.
// * Redistributions 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.
// * Neither the name of Google Inc. nor the names of its contributors may 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 COPYRIGHT OWNER 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.
//
// Author: mierle@gmail.com (Keir Mierle)
#include "ceres/tiny_solver.h"
#include <algorithm>
#include <cmath>
#include "ceres/tiny_solver_test_util.h"
2017-10-10 02:15:25 -07:00
#include "gtest/gtest.h"
namespace ceres {
2022-02-20 02:22:17 +01:00
using Vec2 = Eigen::Matrix<double, 2, 1>;
using Vec3 = Eigen::Matrix<double, 3, 1>;
using VecX = Eigen::VectorXd;
2017-10-10 02:15:25 -07:00
class ExampleStatic {
public:
2022-02-20 02:22:17 +01:00
using Scalar = double;
2017-10-10 02:15:25 -07:00
enum {
// Can also be Eigen::Dynamic.
NUM_RESIDUALS = 2,
2017-10-11 16:03:15 -07:00
NUM_PARAMETERS = 3,
2017-10-10 02:15:25 -07:00
};
bool operator()(const double* parameters,
double* residuals,
double* jacobian) const {
return EvaluateResidualsAndJacobians(parameters, residuals, jacobian);
}
};
class ExampleParametersDynamic {
public:
2022-02-20 02:22:17 +01:00
using Scalar = double;
2017-10-10 02:15:25 -07:00
enum {
NUM_RESIDUALS = 2,
2017-10-11 16:03:15 -07:00
NUM_PARAMETERS = Eigen::Dynamic,
2017-10-10 02:15:25 -07:00
};
int NumParameters() const { return 3; }
2017-10-10 02:15:25 -07:00
bool operator()(const double* parameters,
double* residuals,
double* jacobian) const {
return EvaluateResidualsAndJacobians(parameters, residuals, jacobian);
}
};
class ExampleResidualsDynamic {
public:
2022-02-20 02:22:17 +01:00
using Scalar = double;
2017-10-10 02:15:25 -07:00
enum {
NUM_RESIDUALS = Eigen::Dynamic,
2017-10-11 16:03:15 -07:00
NUM_PARAMETERS = 3,
2017-10-10 02:15:25 -07:00
};
int NumResiduals() const { return 2; }
2017-10-10 02:15:25 -07:00
bool operator()(const double* parameters,
double* residuals,
double* jacobian) const {
return EvaluateResidualsAndJacobians(parameters, residuals, jacobian);
}
};
class ExampleAllDynamic {
public:
2022-02-20 02:22:17 +01:00
using Scalar = double;
2017-10-10 02:15:25 -07:00
enum {
NUM_RESIDUALS = Eigen::Dynamic,
2017-10-11 16:03:15 -07:00
NUM_PARAMETERS = Eigen::Dynamic,
2017-10-10 02:15:25 -07:00
};
int NumResiduals() const { return 2; }
2017-10-10 02:15:25 -07:00
int NumParameters() const { return 3; }
2017-10-11 16:03:15 -07:00
2017-10-10 02:15:25 -07:00
bool operator()(const double* parameters,
double* residuals,
double* jacobian) const {
return EvaluateResidualsAndJacobians(parameters, residuals, jacobian);
}
};
template <typename Function, typename Vector>
2017-10-10 02:15:25 -07:00
void TestHelper(const Function& f, const Vector& x0) {
Vector x = x0;
Vec2 residuals;
2022-02-02 13:17:29 -08:00
f(x.data(), residuals.data(), nullptr);
2017-10-22 22:04:24 -07:00
EXPECT_GT(residuals.squaredNorm() / 2.0, 1e-10);
2017-10-10 02:15:25 -07:00
TinySolver<Function> solver;
2017-10-11 16:03:15 -07:00
solver.Solve(f, &x);
2017-10-22 22:04:24 -07:00
EXPECT_NEAR(0.0, solver.summary.final_cost, 1e-10);
2017-10-10 02:15:25 -07:00
}
// A test case for when the cost function is statically sized.
TEST(TinySolver, SimpleExample) {
Vec3 x0(0.76026643, -30.01799744, 0.55192142);
ExampleStatic f;
TestHelper(f, x0);
}
// A test case for when the number of parameters is dynamically sized.
TEST(TinySolver, ParametersDynamic) {
VecX x0(3);
x0 << 0.76026643, -30.01799744, 0.55192142;
ExampleParametersDynamic f;
TestHelper(f, x0);
}
// A test case for when the number of residuals is dynamically sized.
TEST(TinySolver, ResidualsDynamic) {
Vec3 x0(0.76026643, -30.01799744, 0.55192142);
ExampleResidualsDynamic f;
TestHelper(f, x0);
}
// A test case for when the number of parameters and residuals is
// dynamically sized.
TEST(TinySolver, ParametersAndResidualsDynamic) {
VecX x0(3);
x0 << 0.76026643, -30.01799744, 0.55192142;
ExampleAllDynamic f;
TestHelper(f, x0);
}
2017-12-07 16:44:35 -08:00
} // namespace ceres