Searched refs:block_sizes (Results 1 - 3 of 3) sorted by relevance
/external/ceres-solver/include/ceres/ |
H A D | dynamic_numeric_diff_cost_function.h | 107 const vector<int32>& block_sizes = parameter_block_sizes(); local 108 CHECK(!block_sizes.empty()) 118 int parameters_size = accumulate(block_sizes.begin(), block_sizes.end(), 0); 120 vector<double*> parameters_references_copy(block_sizes.size()); 122 for (int block = 1; block < block_sizes.size(); ++block) { 124 + block_sizes[block - 1]; 128 for (int block = 0; block < block_sizes.size(); ++block) { 131 block_sizes[block] * sizeof(*parameters[block])); 134 for (int block = 0; block < block_sizes [all...] |
H A D | gradient_checker.h | 122 const vector<int32>& block_sizes = term->parameter_block_sizes(); local 123 const int num_blocks = block_sizes.size(); 128 CHECK_EQ(N0, block_sizes[0]); 134 CHECK_EQ(N1, block_sizes[1]); 140 CHECK_EQ(N2, block_sizes[2]); 146 CHECK_EQ(N3, block_sizes[3]); 152 CHECK_EQ(N4, block_sizes[4]); 167 results->term_jacobians[i].resize(num_residuals, block_sizes[i]); 170 num_residuals, block_sizes[i]);
|
/external/ceres-solver/internal/ceres/ |
H A D | gradient_checking_cost_function.cc | 120 const vector<int32>& block_sizes = function_->parameter_block_sizes(); local 121 vector<Matrix> term_jacobians(block_sizes.size()); 122 vector<Matrix> finite_difference_jacobians(block_sizes.size()); 123 vector<double*> term_jacobian_pointers(block_sizes.size()); 124 vector<double*> finite_difference_jacobian_pointers(block_sizes.size()); 125 for (int i = 0; i < block_sizes.size(); i++) { 126 term_jacobians[i].resize(num_residuals, block_sizes[i]); 128 finite_difference_jacobians[i].resize(num_residuals, block_sizes[i]); 154 for (int k = 0; k < block_sizes.size(); k++) {
|
Completed in 34 milliseconds