HomeSort by relevance Sort by last modified time
    Searched defs:residual_blocks (Results 1 - 9 of 9) sorted by null

  /external/ceres-solver/internal/ceres/
parameter_block_ordering.cc 97 const vector<ResidualBlock*>& residual_blocks = program.residual_blocks(); local
98 for (int i = 0; i < residual_blocks.size(); ++i) {
99 const ResidualBlock* residual_block = residual_blocks[i];
block_jacobian_writer.cc 60 const vector<ResidualBlock*>& residual_blocks = program.residual_blocks(); local
67 for (int i = 0; i < residual_blocks.size(); ++i) {
68 ResidualBlock* residual_block = residual_blocks[i];
95 for (int i = 0; i < residual_blocks.size(); ++i) {
96 const ResidualBlock* residual_block = residual_blocks[i];
166 const vector<ResidualBlock*>& residual_blocks = local
167 program_->residual_blocks();
169 bs->rows.resize(residual_blocks.size());
170 for (int i = 0; i < residual_blocks.size(); ++i)
    [all...]
coordinate_descent_minimizer.cc 100 const vector<ResidualBlock*>& residual_blocks = program.residual_blocks(); local
101 for (int i = 0; i < residual_blocks.size(); ++i) {
102 ResidualBlock* residual_block = residual_blocks[i];
compressed_row_jacobian_writer.cc 44 const vector<ResidualBlock*>& residual_blocks = local
45 program_->residual_blocks();
52 for (int i = 0; i < residual_blocks.size(); ++i) {
53 ResidualBlock* residual_block = residual_blocks[i];
80 for (int i = 0; i < residual_blocks.size(); ++i) {
81 const ResidualBlock* residual_block = residual_blocks[i];
146 row_blocks.resize(residual_blocks.size());
147 for (int i = 0; i < residual_blocks.size(); ++i) {
148 row_blocks[i] = residual_blocks[i]->NumResiduals();
165 program_->residual_blocks()[residual_id]
    [all...]
gradient_checking_cost_function.cc 269 const vector<ResidualBlock*>& residual_blocks = program->residual_blocks(); local
270 for (int i = 0; i < residual_blocks.size(); ++i) {
271 ResidualBlock* residual_block = residual_blocks[i];
program.cc 62 const vector<ResidualBlock*>& Program::residual_blocks() const { function in class:ceres::internal::Program
program_evaluator.h 165 const ResidualBlock* residual_block = program_->residual_blocks()[i];
293 const vector<ResidualBlock*>& residual_blocks = program.residual_blocks(); local
296 for (int i = 0; i < residual_blocks.size(); ++i) {
297 const int num_residuals = residual_blocks[i]->NumResiduals();
solver_impl_test.cc 242 ResidualBlock *expected_removed_block = program.residual_blocks()[0];
285 const vector<ResidualBlock*>& residual_blocks = local
286 problem.program().residual_blocks();
294 expected_residual_blocks.push_back(residual_blocks[4]);
295 expected_residual_blocks.push_back(residual_blocks[1]);
296 expected_residual_blocks.push_back(residual_blocks[0]);
297 expected_residual_blocks.push_back(residual_blocks[5]);
298 expected_residual_blocks.push_back(residual_blocks[2]);
299 expected_residual_blocks.push_back(residual_blocks[3]);
309 EXPECT_EQ(residual_blocks.size(), expected_residual_blocks.size())
353 const vector<ResidualBlock*>& residual_blocks = local
425 const vector<ResidualBlock*>& residual_blocks = local
    [all...]
solver_impl.cc 537 const vector<ResidualBlock*>& residual_blocks = program.residual_blocks(); local
540 if (!IsParameterBlockSetIndependent(e_blocks, residual_blocks)) {
551 const vector<ResidualBlock*>& residual_blocks) {
556 for (vector<ResidualBlock*>::const_iterator it = residual_blocks.begin();
557 it != residual_blocks.end();
599 vector<ResidualBlock*>* residual_blocks = local
602 for (int i = 0; i < residual_blocks->size(); ++i) {
603 ResidualBlock* residual_block = (*residual_blocks)[i];
618 (*residual_blocks)[j++] = (*residual_blocks)[i]
963 vector<ResidualBlock*>* residual_blocks = program->mutable_residual_blocks(); local
    [all...]

Completed in 191 milliseconds