/external/ceres-solver/include/ceres/ |
H A D | autodiff_cost_function.h | 178 // residuals ("M") in favor of the "num_residuals" argument provided. 182 AutoDiffCostFunction(CostFunctor* functor, int num_residuals) argument 187 ::set_num_residuals(num_residuals); 210 ::num_residuals(),
|
H A D | cost_function.h | 122 int num_residuals() const { function in class:ceres::CostFunction 131 void set_num_residuals(int num_residuals) { argument 132 num_residuals_ = num_residuals;
|
H A D | 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);
|
H A D | 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) {
|
H A D | dynamic_autodiff_cost_function.h | 89 void SetNumResiduals(int num_residuals) { argument 90 set_num_residuals(num_residuals); 96 CHECK_GT(num_residuals(), 0) 115 // num_residuals() derivatives. This is done with small, fixed-size jets. 123 vector<Jet<double, Stride> > output_jets(num_residuals()); 228 for (int k = 0; k < num_residuals(); ++k) { 245 for (int k = 0; k < num_residuals(); ++k) {
|
H A D | solver.h | 766 int num_residuals; member in struct:ceres::Solver::Summary
|
/external/ceres-solver/internal/ceres/ |
H A D | scratch_evaluate_preparer.cc | 63 int num_residuals = residual_block->NumResiduals(); local 72 jacobian_block_cursor += num_residuals * parameter_block->LocalSize();
|
H A D | 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]); 91 const int num_residuals = block.NumResiduals(); local 96 num_parameter_blocks, num_residuals); 107 AppendArrayToString(num_residuals, residuals, &result); 118 for (int k = 0; k < num_residuals; ++k) { 139 const int num_residuals = block.NumResiduals(); local 141 if (!IsArrayValid(num_residuals, residuals)) { 148 if (!IsArrayValid(num_residuals * parameter_block_siz [all...] |
H A D | dense_jacobian_writer.h | 80 int num_residuals = residual_block->NumResiduals(); local 93 num_residuals, 99 num_residuals,
|
H A D | 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);
|
H A D | residual_block_test.cc | 45 TernaryCostFunction(int num_residuals, argument 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(),
|
H A D | 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();
|
H A D | compressed_row_jacobian_writer.cc | 54 const int num_residuals = residual_block->NumResiduals(); local 59 num_jacobian_nonzeros += num_residuals * parameter_block->LocalSize(); 106 const int num_residuals = residual_block->NumResiduals(); local 107 for (int j = 0; j < num_residuals; ++j) { 120 for (int r = 0; r < num_residuals; ++r) { 131 row_pos += num_residuals; 168 const int num_residuals = residual_block->NumResiduals(); local 199 for (int r = 0; r < num_residuals; ++r) {
|
H A D | 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...] |
H A D | program.cc | 152 int num_residuals = 0; local 154 num_residuals += residual_blocks_[i]->NumResiduals(); 156 return num_residuals;
|
H A D | runtime_numeric_diff_cost_function.cc | 64 int num_residuals = function->num_residuals(); local 67 num_residuals, 96 ResidualVector residuals(num_residuals); 122 Map<const ResidualVector>(residuals_at_eval_point, num_residuals); 141 set_num_residuals(function->num_residuals());
|
H A D | c_api.cc | 70 int num_residuals, 75 set_num_residuals(num_residuals); 147 int num_residuals, 156 num_residuals, 68 CallbackCostFunction(ceres_cost_function_t cost_function, void* user_data, int num_residuals, int num_parameter_blocks, int* parameter_block_sizes) argument 141 ceres_problem_add_residual_block( ceres_problem_t* problem, ceres_cost_function_t cost_function, void* cost_function_data, ceres_loss_function_t loss_function, void* loss_function_data, int num_residuals, int num_parameter_blocks, int* parameter_block_sizes, double** parameters) argument
|
H A D | evaluator_test.cc | 63 for (int i = 0; i < Base::num_residuals(); ++i) { 82 Base::num_residuals(), 119 int num_residuals = expected_num_rows; local 124 Vector residuals(num_residuals);
|
H A D | gradient_checking_cost_function.cc | 94 set_num_residuals(function->num_residuals()); 107 int num_residuals = function_->num_residuals(); local 116 term_jacobians[i].resize(num_residuals, block_sizes[i]); 118 finite_difference_jacobians[i].resize(num_residuals, block_sizes[i]);
|
H A D | gradient_checking_cost_function_test.cc | 267 UnaryCostFunction(int num_residuals, int16 parameter_block_size) { argument 268 set_num_residuals(num_residuals); 276 for (int i = 0; i < num_residuals(); ++i) { 286 BinaryCostFunction(int num_residuals, argument 289 set_num_residuals(num_residuals); 297 for (int i = 0; i < num_residuals(); ++i) { 307 TernaryCostFunction(int num_residuals, argument 311 set_num_residuals(num_residuals); 320 for (int i = 0; i < num_residuals(); ++i) {
|
H A D | program_evaluator.h | 227 int num_residuals = residual_block->NumResiduals(); local 238 num_residuals, 321 const int num_residuals = residual_blocks[i]->NumResiduals(); local 323 residual_pos += num_residuals;
|
H A D | trust_region_minimizer.cc | 95 const int num_residuals = evaluator->NumResiduals(); local 101 Vector residuals(num_residuals); 106 Vector model_residuals(num_residuals);
|
H A D | covariance_test.cc | 127 UnaryCostFunction(const int num_residuals, argument 130 : jacobian_(jacobian, jacobian + num_residuals * parameter_block_size) { 131 set_num_residuals(num_residuals); 138 for (int i = 0; i < num_residuals(); ++i) { 160 BinaryCostFunction(const int num_residuals, argument 166 jacobian1 + num_residuals * parameter_block1_size), 168 jacobian2 + num_residuals * parameter_block2_size) { 169 set_num_residuals(num_residuals); 177 for (int i = 0; i < num_residuals(); ++i) {
|
H A D | 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) {
|
H A D | problem_test.cc | 59 UnaryCostFunction(int num_residuals, int16 parameter_block_size) { argument 60 set_num_residuals(num_residuals); 68 for (int i = 0; i < num_residuals(); ++i) { 78 BinaryCostFunction(int num_residuals, argument 81 set_num_residuals(num_residuals); 89 for (int i = 0; i < num_residuals(); ++i) { 99 TernaryCostFunction(int num_residuals, argument 103 set_num_residuals(num_residuals); 112 for (int i = 0; i < num_residuals(); ++i) {
|