Austin Schuh | 70cc955 | 2019-01-21 19:46:48 -0800 | [diff] [blame] | 1 | // Ceres Solver - A fast non-linear least squares minimizer |
| 2 | // Copyright 2015 Google Inc. All rights reserved. |
| 3 | // http://ceres-solver.org/ |
| 4 | // |
| 5 | // Redistribution and use in source and binary forms, with or without |
| 6 | // modification, are permitted provided that the following conditions are met: |
| 7 | // |
| 8 | // * Redistributions of source code must retain the above copyright notice, |
| 9 | // this list of conditions and the following disclaimer. |
| 10 | // * Redistributions in binary form must reproduce the above copyright notice, |
| 11 | // this list of conditions and the following disclaimer in the documentation |
| 12 | // and/or other materials provided with the distribution. |
| 13 | // * Neither the name of Google Inc. nor the names of its contributors may be |
| 14 | // used to endorse or promote products derived from this software without |
| 15 | // specific prior written permission. |
| 16 | // |
| 17 | // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" |
| 18 | // AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
| 19 | // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE |
| 20 | // ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR CONTRIBUTORS BE |
| 21 | // LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR |
| 22 | // CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF |
| 23 | // SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS |
| 24 | // INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN |
| 25 | // CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) |
| 26 | // ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
| 27 | // POSSIBILITY OF SUCH DAMAGE. |
| 28 | // |
| 29 | // Author: sameeragarwal@google.com (Sameer Agarwal) |
| 30 | |
| 31 | #include "ceres/gradient_problem.h" |
Austin Schuh | 1d1e6ea | 2020-12-23 21:56:30 -0800 | [diff] [blame^] | 32 | |
Austin Schuh | 70cc955 | 2019-01-21 19:46:48 -0800 | [diff] [blame] | 33 | #include "ceres/local_parameterization.h" |
| 34 | #include "glog/logging.h" |
| 35 | |
| 36 | namespace ceres { |
| 37 | |
| 38 | GradientProblem::GradientProblem(FirstOrderFunction* function) |
| 39 | : function_(function), |
| 40 | parameterization_( |
| 41 | new IdentityParameterization(function_->NumParameters())), |
Austin Schuh | 1d1e6ea | 2020-12-23 21:56:30 -0800 | [diff] [blame^] | 42 | scratch_(new double[function_->NumParameters()]) {} |
Austin Schuh | 70cc955 | 2019-01-21 19:46:48 -0800 | [diff] [blame] | 43 | |
| 44 | GradientProblem::GradientProblem(FirstOrderFunction* function, |
| 45 | LocalParameterization* parameterization) |
Austin Schuh | 1d1e6ea | 2020-12-23 21:56:30 -0800 | [diff] [blame^] | 46 | : function_(function), |
| 47 | parameterization_(parameterization), |
| 48 | scratch_(new double[function_->NumParameters()]) { |
Austin Schuh | 70cc955 | 2019-01-21 19:46:48 -0800 | [diff] [blame] | 49 | CHECK_EQ(function_->NumParameters(), parameterization_->GlobalSize()); |
| 50 | } |
| 51 | |
| 52 | int GradientProblem::NumParameters() const { |
| 53 | return function_->NumParameters(); |
| 54 | } |
| 55 | |
| 56 | int GradientProblem::NumLocalParameters() const { |
| 57 | return parameterization_->LocalSize(); |
| 58 | } |
| 59 | |
Austin Schuh | 70cc955 | 2019-01-21 19:46:48 -0800 | [diff] [blame] | 60 | bool GradientProblem::Evaluate(const double* parameters, |
| 61 | double* cost, |
| 62 | double* gradient) const { |
| 63 | if (gradient == NULL) { |
| 64 | return function_->Evaluate(parameters, cost, NULL); |
| 65 | } |
| 66 | |
| 67 | return (function_->Evaluate(parameters, cost, scratch_.get()) && |
Austin Schuh | 1d1e6ea | 2020-12-23 21:56:30 -0800 | [diff] [blame^] | 68 | parameterization_->MultiplyByJacobian( |
| 69 | parameters, 1, scratch_.get(), gradient)); |
Austin Schuh | 70cc955 | 2019-01-21 19:46:48 -0800 | [diff] [blame] | 70 | } |
| 71 | |
| 72 | bool GradientProblem::Plus(const double* x, |
| 73 | const double* delta, |
| 74 | double* x_plus_delta) const { |
| 75 | return parameterization_->Plus(x, delta, x_plus_delta); |
| 76 | } |
| 77 | |
| 78 | } // namespace ceres |