mirror of
https://github.com/ceres-solver/ceres-solver.git
synced 2026-08-30 00:50:37 +08:00
Sameer Agarwal
2dd907744d
ResidualBlock evaluation has logic to ensure that CostFunction should always fill out the residual and jacobian arrays completely by using a special value to pre-populate these arrays. This works for CostFunctions with analytical Jacobians but not for AutoDiffCostFunction and NumericDiffCostFunction Jacobians. There is no way to fix this for NumericDiffCostFunctions without introducing significant performance penalties but the residual evaluation fails, which should be enough to catch such errors. For AutoDiffCostFunction the way the Jets are default initialized was sidestepping this check. So now, the Jet that is used to capture the output residuals is now initialized with kImpossibleValue, which will ensure that if the user forgets to fill all output fields, it triggers an evaluation error. This change required that ceres::internal::kImpossibleValue be moved out of array_utils.h/cc to types.h. Change-Id: I35bb0946cf0785a5d43c7b5459a2272848fb2a9b
109 lines
3.4 KiB
C++
109 lines
3.4 KiB
C++
// Ceres Solver - A fast non-linear least squares minimizer
|
|
// Copyright 2015 Google Inc. All rights reserved.
|
|
// 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: sameeragarwal@google.com (Sameer Agarwal)
|
|
|
|
#include "ceres/array_utils.h"
|
|
|
|
#include <algorithm>
|
|
#include <cmath>
|
|
#include <cstddef>
|
|
#include <string>
|
|
#include <vector>
|
|
#include "ceres/fpclassify.h"
|
|
#include "ceres/stringprintf.h"
|
|
#include "ceres/types.h"
|
|
namespace ceres {
|
|
namespace internal {
|
|
|
|
using std::string;
|
|
|
|
bool IsArrayValid(const int size, const double* x) {
|
|
if (x != NULL) {
|
|
for (int i = 0; i < size; ++i) {
|
|
if (!IsFinite(x[i]) || (x[i] == kImpossibleValue)) {
|
|
return false;
|
|
}
|
|
}
|
|
}
|
|
return true;
|
|
}
|
|
|
|
int FindInvalidValue(const int size, const double* x) {
|
|
if (x == NULL) {
|
|
return size;
|
|
}
|
|
|
|
for (int i = 0; i < size; ++i) {
|
|
if (!IsFinite(x[i]) || (x[i] == kImpossibleValue)) {
|
|
return i;
|
|
}
|
|
}
|
|
|
|
return size;
|
|
}
|
|
|
|
void InvalidateArray(const int size, double* x) {
|
|
if (x != NULL) {
|
|
for (int i = 0; i < size; ++i) {
|
|
x[i] = kImpossibleValue;
|
|
}
|
|
}
|
|
}
|
|
|
|
void AppendArrayToString(const int size, const double* x, string* result) {
|
|
for (int i = 0; i < size; ++i) {
|
|
if (x == NULL) {
|
|
StringAppendF(result, "Not Computed ");
|
|
} else {
|
|
if (x[i] == kImpossibleValue) {
|
|
StringAppendF(result, "Uninitialized ");
|
|
} else {
|
|
StringAppendF(result, "%12g ", x[i]);
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
void MapValuesToContiguousRange(const int size, int* array) {
|
|
std::vector<int> unique_values(array, array + size);
|
|
std::sort(unique_values.begin(), unique_values.end());
|
|
unique_values.erase(std::unique(unique_values.begin(),
|
|
unique_values.end()),
|
|
unique_values.end());
|
|
|
|
for (int i = 0; i < size; ++i) {
|
|
array[i] = std::lower_bound(unique_values.begin(),
|
|
unique_values.end(),
|
|
array[i]) - unique_values.begin();
|
|
}
|
|
}
|
|
|
|
} // namespace internal
|
|
} // namespace ceres
|