/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;
|
dynamic_autodiff_cost_function.h | 90 void SetNumResiduals(int num_residuals) { 91 set_num_residuals(num_residuals); 97 CHECK_GT(num_residuals(), 0) 116 // num_residuals() derivatives. This is done with small, fixed-size jets. 124 vector<Jet<double, Stride> > output_jets(num_residuals()); 229 for (int k = 0; k < num_residuals(); ++k) { 246 for (int k = 0; k < num_residuals(); ++k) {
|
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);
|
autodiff_cost_function.h | 180 // kNumResiduals in favor of the "num_residuals" argument provided. 184 AutoDiffCostFunction(CostFunctor* functor, int num_residuals) 192 ::set_num_residuals(num_residuals); 216 N5, N6, N7, N8, N9>::num_residuals(),
|
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);
|
c_api.h | 131 int num_residuals,
|
numeric_diff_cost_function.h | 194 int num_residuals = kNumResiduals, 203 ::set_num_residuals(num_residuals); 284 N5, N6, N7, N8, N9>::num_residuals(), \
|
/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...] |
conditioned_cost_function.cc | 54 set_num_residuals(wrapped_cost_function_->num_residuals()); 59 CHECK_EQ(wrapped_cost_function_->num_residuals(), conditioners_.size()); 60 for (int i = 0; i < wrapped_cost_function_->num_residuals(); i++) { 62 CHECK_EQ(1, conditioners[i]->num_residuals()); 86 for (int r = 0; r < wrapped_cost_function_->num_residuals(); r++) {
|
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) {
|
normal_prior.cc | 55 VectorRef r(residuals, num_residuals()); 61 MatrixRef(jacobians[0], num_residuals(), parameter_block_sizes()[0]) = A_;
|
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();
|
dense_jacobian_writer.h | 80 int num_residuals = residual_block->NumResiduals(); local 93 num_residuals, 99 num_residuals,
|
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...] |
c_api.cc | 70 int num_residuals, 75 set_num_residuals(num_residuals); 147 int num_residuals, 156 num_residuals,
|
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_test.cc | 267 UnaryCostFunction(int num_residuals, int32 parameter_block_size) { 268 set_num_residuals(num_residuals); 276 for (int i = 0; i < num_residuals(); ++i) { 286 BinaryCostFunction(int num_residuals, 289 set_num_residuals(num_residuals); 297 for (int i = 0; i < num_residuals(); ++i) { 307 TernaryCostFunction(int num_residuals, 311 set_num_residuals(num_residuals); 320 for (int i = 0; i < num_residuals(); ++i) {
|
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();
|
residual_block.h | 95 // is num_residuals by 3 instead of num_residuals by 4. 121 int NumResiduals() const { return cost_function_->num_residuals(); }
|
summary_utils.cc | 54 summary->num_residuals = program.NumResiduals();
|
conditioned_cost_function_test.cc | 98 EXPECT_EQ(difference_cost_function->num_residuals(), 99 conditioned_cost_function.num_residuals());
|
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]);
|
residual_block_test.cc | 45 TernaryCostFunction(int num_residuals, 49 set_num_residuals(num_residuals); 58 for (int i = 0; i < num_residuals(); ++i) { 65 num_residuals(), 173 for (int i = 0; i < num_residuals(); ++i) { 190 num_residuals(),
|
/external/ceres-solver/include/ceres/internal/ |
numeric_diff.h | 93 int num_residuals, 101 const int NUM_RESIDUALS = 102 (kNumResiduals != ceres::DYNAMIC ? kNumResiduals : num_residuals); 115 NUM_RESIDUALS, 136 ResidualVector residuals(NUM_RESIDUALS); 169 Map<const ResidualVector>(residuals_at_eval_point, NUM_RESIDUALS); 194 const int num_residuals,
|