1
// Ceres Solver - A fast non-linear least squares minimizer
2
// Copyright 2010, 2011, 2012 Google Inc. All rights reserved.
3
// http://code.google.com/p/ceres-solver/
5
// Redistribution and use in source and binary forms, with or without
6
// modification, are permitted provided that the following conditions are met:
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.
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.
29
// Author: keir@google.com (Keir Mierle)
31
#include "ceres/block_evaluate_preparer.h"
34
#include "ceres/block_sparse_matrix.h"
35
#include "ceres/casts.h"
36
#include "ceres/parameter_block.h"
37
#include "ceres/residual_block.h"
38
#include "ceres/sparse_matrix.h"
43
void BlockEvaluatePreparer::Init(int** jacobian_layout) {
44
jacobian_layout_ = jacobian_layout;
47
// Point the jacobian blocks directly into the block sparse matrix.
48
void BlockEvaluatePreparer::Prepare(const ResidualBlock* residual_block,
49
int residual_block_index,
50
SparseMatrix* jacobian,
51
double** jacobians) const {
52
CHECK(jacobian != NULL);
53
double* jacobian_values =
54
down_cast<BlockSparseMatrix*>(jacobian)->mutable_values();
56
const int* jacobian_block_offset = jacobian_layout_[residual_block_index];
57
const int num_parameter_blocks = residual_block->NumParameterBlocks();
58
for (int j = 0; j < num_parameter_blocks; ++j) {
59
if (!residual_block->parameter_blocks()[j]->IsConstant()) {
60
jacobians[j] = jacobian_values + *jacobian_block_offset;
62
// The jacobian_block_offset can't be indexed with 'j' since the code
63
// that creates the layout strips out any blocks for inactive
64
// parameters. Instead, bump the pointer for active parameters only.
65
jacobian_block_offset++;
72
} // namespace internal
added
removed
internal/ceres/block_evaluate_preparer.cc
