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

  /external/ceres-solver/internal/ceres/
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...]
schur_ordering.cc 76 const vector<ResidualBlock*>& residual_blocks = program.residual_blocks(); local
77 for (int i = 0; i < residual_blocks.size(); ++i) {
78 const 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];
147 row_blocks.resize(residual_blocks.size());
148 for (int i = 0; i < residual_blocks.size(); ++i) {
149 row_blocks[i] = residual_blocks[i]->NumResiduals();
166 program_->residual_blocks()[residual_id]
    [all...]
parameter_block_ordering.cc 123 const vector<ResidualBlock*>& residual_blocks = program.residual_blocks(); local
124 for (int i = 0; i < residual_blocks.size(); ++i) {
125 const ResidualBlock* residual_block = residual_blocks[i];
program.h 62 const vector<ResidualBlock*>& residual_blocks() const;
solver_impl_test.cc 242 ResidualBlock *expected_removed_block = program.residual_blocks()[0];
290 const vector<ResidualBlock*>& residual_blocks = local
291 problem.program().residual_blocks();
299 expected_residual_blocks.push_back(residual_blocks[4]);
300 expected_residual_blocks.push_back(residual_blocks[1]);
301 expected_residual_blocks.push_back(residual_blocks[0]);
302 expected_residual_blocks.push_back(residual_blocks[5]);
303 expected_residual_blocks.push_back(residual_blocks[2]);
304 expected_residual_blocks.push_back(residual_blocks[3]);
314 EXPECT_EQ(residual_blocks.size(), expected_residual_blocks.size())
358 const vector<ResidualBlock*>& residual_blocks = local
425 const vector<ResidualBlock*>& residual_blocks = local
    [all...]
program_evaluator.h 181 const ResidualBlock* residual_block = program_->residual_blocks()[i];
317 const vector<ResidualBlock*>& residual_blocks = program.residual_blocks(); local
320 for (int i = 0; i < residual_blocks.size(); ++i) {
321 const int num_residuals = residual_blocks[i]->NumResiduals();
solver_impl.cc 932 const vector<ResidualBlock*>& residual_blocks = program.residual_blocks(); local
995 vector<ResidualBlock*>* residual_blocks = local
1315 vector<ResidualBlock*>* residual_blocks = program->mutable_residual_blocks(); local
1548 const vector<ResidualBlock*>& residual_blocks = program->residual_blocks(); local
    [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];
dense_jacobian_writer.h 78 program_->residual_blocks()[residual_id];
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];
problem_test.cc 389 return problem->program().residual_blocks()[block];
393 return find(problem->program().residual_blocks().begin(),
394 problem->program().residual_blocks().end(),
395 residual_block) != problem->program().residual_blocks().end();
    [all...]
gradient_checking_cost_function_test.cc 394 for (int i = 0; i < program.residual_blocks().size(); ++i) {
397 program.residual_blocks()[i];
399 gradient_checking_program.residual_blocks()[i];
solver_impl.h 139 const vector<ResidualBlock*>& residual_blocks);
program.cc 62 const vector<ResidualBlock*>& Program::residual_blocks() const { function in class:ceres::internal::Program
problem_impl.cc 551 ((evaluate_options.residual_blocks.size() > 0)
552 ? evaluate_options.residual_blocks : program_->residual_blocks());
  /external/ceres-solver/include/ceres/
problem.h 324 // residual_blocks().size().
369 // jacobian are ordered. If residual_blocks is empty, then it is
376 vector<ResidualBlockId> residual_blocks; member in struct:ceres::Problem::EvaluateOptions

Completed in 3573 milliseconds