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

  /external/ceres-solver/include/ceres/
problem.h 338 // residual_blocks().size().
361 // Fills the passed residual_blocks vector with pointers to the
363 // residual_blocks.size() == NumResidualBlocks.
364 void GetResidualBlocks(vector<ResidualBlockId>* residual_blocks) const;
379 vector<ResidualBlockId>* residual_blocks) const;
406 // jacobian are ordered. If residual_blocks is empty, then it is
413 vector<ResidualBlockId> residual_blocks; member in struct:ceres::Problem::EvaluateOptions
  /external/ceres-solver/internal/ceres/
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];
reorder_program_test.cc 87 const vector<ResidualBlock*>& residual_blocks = local
88 problem.program().residual_blocks();
96 expected_residual_blocks.push_back(residual_blocks[4]);
97 expected_residual_blocks.push_back(residual_blocks[1]);
98 expected_residual_blocks.push_back(residual_blocks[0]);
99 expected_residual_blocks.push_back(residual_blocks[5]);
100 expected_residual_blocks.push_back(residual_blocks[2]);
101 expected_residual_blocks.push_back(residual_blocks[3]);
111 EXPECT_EQ(residual_blocks.size(), expected_residual_blocks.size());
113 EXPECT_EQ(residual_blocks[i], expected_residual_blocks[i])
    [all...]
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];
reorder_program.cc 191 vector<ResidualBlock*>* residual_blocks = program->mutable_residual_blocks(); local
192 vector<int> min_position_per_residual(residual_blocks->size());
193 for (int i = 0; i < residual_blocks->size(); ++i) {
194 ResidualBlock* residual_block = (*residual_blocks)[i];
208 CHECK_EQ(offsets.back(), residual_blocks->size())
226 (*residual_blocks).size(), static_cast<ResidualBlock*>(NULL));
227 for (int i = 0; i < residual_blocks->size(); ++i) {
238 reordered_residual_blocks[offsets[bucket]] = (*residual_blocks)[i];
compressed_row_jacobian_writer.cc 53 const vector<ResidualBlock*>& residual_blocks = local
54 program->residual_blocks();
56 row_blocks.resize(residual_blocks.size());
57 for (int i = 0; i < residual_blocks.size(); ++i) {
58 row_blocks[i] = residual_blocks[i]->NumResiduals();
67 program->residual_blocks()[residual_id];
82 const vector<ResidualBlock*>& residual_blocks = local
83 program_->residual_blocks();
90 for (int i = 0; i < residual_blocks.size(); ++i) {
91 ResidualBlock* residual_block = residual_blocks[i]
    [all...]
gradient_checking_cost_function.cc 279 const vector<ResidualBlock*>& residual_blocks = program->residual_blocks(); local
280 for (int i = 0; i < residual_blocks.size(); ++i) {
281 ResidualBlock* residual_block = residual_blocks[i];
solver_impl.cc 625 const vector<ResidualBlock*>& residual_blocks = program.residual_blocks(); local
628 if (!IsParameterBlockSetIndependent(e_blocks, residual_blocks)) {
640 const vector<ResidualBlock*>& residual_blocks) {
645 for (vector<ResidualBlock*>::const_iterator it = residual_blocks.begin();
646 it != residual_blocks.end();
    [all...]
program.cc 64 const vector<ResidualBlock*>& Program::residual_blocks() const { function in class:ceres::internal::Program
program_evaluator.h 190 const ResidualBlock* residual_block = program_->residual_blocks()[i];
336 const vector<ResidualBlock*>& residual_blocks = program.residual_blocks(); local
339 for (int i = 0; i < residual_blocks.size(); ++i) {
340 const int num_residuals = residual_blocks[i]->NumResiduals();
problem_test.cc 389 return problem->program().residual_blocks()[block];
400 find(problem->program().residual_blocks().begin(),
401 problem->program().residual_blocks().end(),
402 residual_block) != problem->program().residual_blocks().end();
885 vector<ResidualBlockId> residual_blocks; local
886 problem.GetResidualBlocks(&residual_blocks);
887 ExpectVectorContainsUnordered(expected_residual_blocks, residual_blocks);
945 vector<ResidualBlockId> residual_blocks; local
    [all...]

Completed in 123 milliseconds