| /external/ceres-solver/internal/ceres/ |
| residual_block_utils.cc | 52 const int num_residuals = block.NumResiduals(); local
55 InvalidateArray(num_residuals, residuals);
59 InvalidateArray(num_residuals * parameter_block_size, jacobians[i]);
73 const int num_residuals = block.NumResiduals(); local
78 num_parameter_blocks, num_residuals);
89 AppendArrayToString(num_residuals, residuals, &result);
100 for (int k = 0; k < num_residuals; ++k) {
121 const int num_residuals = block.NumResiduals(); local
123 if (!IsArrayValid(num_residuals, residuals)) {
130 if (!IsArrayValid(num_residuals * parameter_block_size, jacobians[i]))
[all...] |
| dense_jacobian_writer.h | 80 int num_residuals = residual_block->NumResiduals(); local
93 num_residuals,
99 num_residuals,
|
| dynamic_compressed_row_jacobian_writer.cc | 49 const int num_residuals = program_->NumResiduals(); local
53 new DynamicCompressedRowSparseMatrix(num_residuals,
73 const int num_residuals = residual_block->NumResiduals(); local
81 jacobian->ClearRows(residual_offset, num_residuals);
92 for (int r = 0; r < num_residuals; ++r) {
|
| residual_block.cc | 73 const int num_residuals = cost_function_->num_residuals(); local
90 scratch += num_residuals * parameter_block->Size();
134 double squared_norm = VectorRef(residuals, num_residuals).squaredNorm();
147 num_residuals,
152 jacobians[i], 0, 0, num_residuals, parameter_block->LocalSize());
182 correct.CorrectJacobian(num_residuals,
192 correct.CorrectResiduals(num_residuals, residuals);
|
| scratch_evaluate_preparer.cc | 63 int num_residuals = residual_block->NumResiduals(); local
72 jacobian_block_cursor += num_residuals * parameter_block->LocalSize();
|
| block_jacobian_writer.cc | 69 const int num_residuals = residual_block->NumResiduals(); local
79 f_block_pos += num_residuals * parameter_block->LocalSize();
97 const int num_residuals = residual_block->NumResiduals(); local
108 num_residuals * parameter_block->LocalSize();
|
| cost_function_to_functor_test.cc | 42 EXPECT_EQ(cost_function.num_residuals(),
43 actual_cost_function.num_residuals());
44 const int num_residuals = cost_function.num_residuals(); local
63 scoped_array<double> residuals(new double[num_residuals]);
64 scoped_array<double> jacobians(new double[num_parameters * num_residuals]);
66 scoped_array<double> actual_residuals(new double[num_residuals]);
68 (new double[num_parameters * num_residuals]);
80 jacobian_blocks[i] = jacobians.get() + num_parameters * num_residuals;
82 actual_jacobians.get() + num_parameters * num_residuals;
[all...] |
| compressed_row_jacobian_writer.cc | 92 const int num_residuals = residual_block->NumResiduals(); local
97 num_jacobian_nonzeros += num_residuals * parameter_block->LocalSize();
144 const int num_residuals = residual_block->NumResiduals(); local
145 for (int j = 0; j < num_residuals; ++j) {
158 for (int r = 0; r < num_residuals; ++r) {
169 row_pos += num_residuals;
190 const int num_residuals = residual_block->NumResiduals(); local
207 for (int r = 0; r < num_residuals; ++r) {
|
| gradient_checking_cost_function.cc | 102 set_num_residuals(function->num_residuals());
103 finite_diff_cost_function->SetNumResiduals(num_residuals());
117 int num_residuals = function_->num_residuals(); local
126 term_jacobians[i].resize(num_residuals, block_sizes[i]);
128 finite_difference_jacobians[i].resize(num_residuals, block_sizes[i]);
|
| evaluator_test.cc | 64 for (int i = 0; i < Base::num_residuals(); ++i) {
83 Base::num_residuals(),
144 int num_residuals = expected_num_rows; local
149 Vector residuals(num_residuals);
|
| program.cc | 437 int num_residuals = 0; local
439 num_residuals += residual_blocks_[i]->NumResiduals();
441 return num_residuals;
|
| program_evaluator.h | 236 int num_residuals = residual_block->NumResiduals(); local
247 num_residuals,
340 const int num_residuals = residual_blocks[i]->NumResiduals(); local
342 residual_pos += num_residuals;
|
| trust_region_minimizer.cc | 152 const int num_residuals = evaluator->NumResiduals(); local
154 Vector residuals(num_residuals);
159 Vector model_residuals(num_residuals);
|
| autodiff_test.cc | 343 for (int i = 0; i < num_residuals; ++i) {
349 int num_residuals; member in struct:ceres::internal::VaryingResidualFunctor
364 for (int num_residuals = 1; num_residuals < kMaxResiduals; ++num_residuals) {
366 functor.num_residuals = num_residuals;
370 functor, parameters, num_residuals, residuals, jacobians)));
373 for (int i = 0; i < num_residuals; ++i) {
|
| /external/ceres-solver/include/ceres/ |
| cost_function.h | 123 int num_residuals() const { function in class:ceres::CostFunction
132 void set_num_residuals(int num_residuals) {
133 num_residuals_ = num_residuals;
|
| cost_function_to_functor.h | 112 CHECK_EQ(cost_function->num_residuals(), kNumResiduals);
685 const int num_residuals = cost_function_->num_residuals(); local
689 internal::FixedArray<double> jacobians(num_residuals * kNumParameters);
691 internal::FixedArray<double> residuals(num_residuals);
703 jacobian_ptr += num_residuals * parameter_block_sizes[i];
730 for (int i = 0; i < num_residuals; ++i) {
|
| gradient_checker.h | 120 CHECK_EQ(M, term->num_residuals());
121 const int num_residuals = M; local
167 results->term_jacobians[i].resize(num_residuals, block_sizes[i]);
170 num_residuals, block_sizes[i]);
174 results->cost.resize(num_residuals, 1);
|
| dynamic_numeric_diff_cost_function.h | 96 void SetNumResiduals(int num_residuals) {
97 set_num_residuals(num_residuals);
103 CHECK_GT(num_residuals(), 0)
164 int num_residuals = this->num_residuals(); local
167 num_residuals,
197 ResidualVector residuals(num_residuals);
224 Map<const ResidualVector>(residuals_at_eval_point, num_residuals);
|
| solver.h | 827 int num_residuals; member in struct:ceres::Solver::Summary
[all...] |
| /external/ceres-solver/examples/ |
| libmv_bundle_adjuster.cc | 680 int num_residuals = 0; local
715 num_residuals++;
717 LOG(INFO) << "Number of residuals: " << num_residuals;
719 if (!num_residuals) {
|
