Home
last modified time | relevance | path

Searched refs:residual_blocks (Results 1 – 22 of 22) sorted by relevance

/external/ceres-solver/internal/ceres/
Dcompressed_row_jacobian_writer.cc53 const vector<ResidualBlock*>& residual_blocks = in PopulateJacobianRowAndColumnBlockVectors() local
54 program->residual_blocks(); in PopulateJacobianRowAndColumnBlockVectors()
56 row_blocks.resize(residual_blocks.size()); in PopulateJacobianRowAndColumnBlockVectors()
57 for (int i = 0; i < residual_blocks.size(); ++i) { in PopulateJacobianRowAndColumnBlockVectors()
58 row_blocks[i] = residual_blocks[i]->NumResiduals(); in PopulateJacobianRowAndColumnBlockVectors()
67 program->residual_blocks()[residual_id]; in GetOrderedParameterBlocks()
82 const vector<ResidualBlock*>& residual_blocks = in CreateJacobian() local
83 program_->residual_blocks(); in CreateJacobian()
90 for (int i = 0; i < residual_blocks.size(); ++i) { in CreateJacobian()
91 ResidualBlock* residual_block = residual_blocks[i]; in CreateJacobian()
[all …]
Dblock_jacobian_writer.cc60 const vector<ResidualBlock*>& residual_blocks = program.residual_blocks(); in BuildJacobianLayout() local
67 for (int i = 0; i < residual_blocks.size(); ++i) { in BuildJacobianLayout()
68 ResidualBlock* residual_block = residual_blocks[i]; in BuildJacobianLayout()
95 for (int i = 0; i < residual_blocks.size(); ++i) { in BuildJacobianLayout()
96 const ResidualBlock* residual_block = residual_blocks[i]; in BuildJacobianLayout()
166 const vector<ResidualBlock*>& residual_blocks = in CreateJacobian() local
167 program_->residual_blocks(); in CreateJacobian()
169 bs->rows.resize(residual_blocks.size()); in CreateJacobian()
170 for (int i = 0; i < residual_blocks.size(); ++i) { in CreateJacobian()
171 const ResidualBlock* residual_block = residual_blocks[i]; in CreateJacobian()
Dreorder_program_test.cc87 const vector<ResidualBlock*>& residual_blocks = in TEST() local
88 problem.program().residual_blocks(); in TEST()
96 expected_residual_blocks.push_back(residual_blocks[4]); in TEST()
97 expected_residual_blocks.push_back(residual_blocks[1]); in TEST()
98 expected_residual_blocks.push_back(residual_blocks[0]); in TEST()
99 expected_residual_blocks.push_back(residual_blocks[5]); in TEST()
100 expected_residual_blocks.push_back(residual_blocks[2]); in TEST()
101 expected_residual_blocks.push_back(residual_blocks[3]); in TEST()
111 EXPECT_EQ(residual_blocks.size(), expected_residual_blocks.size()); in TEST()
113 EXPECT_EQ(residual_blocks[i], expected_residual_blocks[i]); in TEST()
Dreorder_program.cc191 vector<ResidualBlock*>* residual_blocks = program->mutable_residual_blocks(); in LexicographicallyOrderResidualBlocks() local
192 vector<int> min_position_per_residual(residual_blocks->size()); in LexicographicallyOrderResidualBlocks()
193 for (int i = 0; i < residual_blocks->size(); ++i) { in LexicographicallyOrderResidualBlocks()
194 ResidualBlock* residual_block = (*residual_blocks)[i]; in LexicographicallyOrderResidualBlocks()
208 CHECK_EQ(offsets.back(), residual_blocks->size()) in LexicographicallyOrderResidualBlocks()
226 (*residual_blocks).size(), static_cast<ResidualBlock*>(NULL)); in LexicographicallyOrderResidualBlocks()
227 for (int i = 0; i < residual_blocks->size(); ++i) { in LexicographicallyOrderResidualBlocks()
238 reordered_residual_blocks[offsets[bucket]] = (*residual_blocks)[i]; in LexicographicallyOrderResidualBlocks()
Dproblem_impl.cc522 CHECK(std::find(program_->residual_blocks().begin(), in RemoveResidualBlock()
523 program_->residual_blocks().end(), in RemoveResidualBlock()
524 residual_block) != program_->residual_blocks().end()) in RemoveResidualBlock()
616 ((evaluate_options.residual_blocks.size() > 0) in Evaluate()
617 ? evaluate_options.residual_blocks : program_->residual_blocks()); in Evaluate()
810 vector<ResidualBlockId>* residual_blocks) const { in GetResidualBlocks()
811 CHECK_NOTNULL(residual_blocks); in GetResidualBlocks()
812 *residual_blocks = program().residual_blocks(); in GetResidualBlocks()
828 vector<ResidualBlockId>* residual_blocks) const { in GetResidualBlocksForParameterBlock()
836 CHECK_NOTNULL(residual_blocks)->resize( in GetResidualBlocksForParameterBlock()
[all …]
Dproblem_test.cc389 return problem->program().residual_blocks()[block]; in GetResidualBlock()
400 find(problem->program().residual_blocks().begin(), in HasResidualBlock()
401 problem->program().residual_blocks().end(), in HasResidualBlock()
402 residual_block) != problem->program().residual_blocks().end(); in HasResidualBlock()
885 vector<ResidualBlockId> residual_blocks; in ExpectProblemHasResidualBlocks() local
886 problem.GetResidualBlocks(&residual_blocks); in ExpectProblemHasResidualBlocks()
887 ExpectVectorContainsUnordered(expected_residual_blocks, residual_blocks); in ExpectProblemHasResidualBlocks()
945 vector<ResidualBlockId> residual_blocks; in TEST_P() local
961 &residual_blocks); in TEST_P()
964 residual_blocks); in TEST_P()
[all …]
Dparameter_block_ordering.cc123 const vector<ResidualBlock*>& residual_blocks = program.residual_blocks(); in CreateHessianGraph() local
124 for (int i = 0; i < residual_blocks.size(); ++i) { in CreateHessianGraph()
125 const ResidualBlock* residual_block = residual_blocks[i]; in CreateHessianGraph()
Dprogram_evaluator.h190 const ResidualBlock* residual_block = program_->residual_blocks()[i]; in Evaluate()
336 const vector<ResidualBlock*>& residual_blocks = program.residual_blocks(); in BuildResidualLayout() local
339 for (int i = 0; i < residual_blocks.size(); ++i) { in BuildResidualLayout()
340 const int num_residuals = residual_blocks[i]->NumResiduals(); in BuildResidualLayout()
Dgradient_checking_cost_function.cc279 const vector<ResidualBlock*>& residual_blocks = program->residual_blocks(); in CreateGradientCheckingProblemImpl() local
280 for (int i = 0; i < residual_blocks.size(); ++i) { in CreateGradientCheckingProblemImpl()
281 ResidualBlock* residual_block = residual_blocks[i]; in CreateGradientCheckingProblemImpl()
Dcoordinate_descent_minimizer.cc100 const vector<ResidualBlock*>& residual_blocks = program.residual_blocks(); in Init() local
101 for (int i = 0; i < residual_blocks.size(); ++i) { in Init()
102 ResidualBlock* residual_block = residual_blocks[i]; in Init()
Dproblem.cc243 vector<ResidualBlockId>* residual_blocks) const { in GetResidualBlocks()
244 problem_impl_->GetResidualBlocks(residual_blocks); in GetResidualBlocks()
256 vector<ResidualBlockId>* residual_blocks) const { in GetResidualBlocksForParameterBlock()
258 residual_blocks); in GetResidualBlocksForParameterBlock()
Dsolver_impl.cc625 const vector<ResidualBlock*>& residual_blocks = program.residual_blocks(); in IsOrderingValid() local
628 if (!IsParameterBlockSetIndependent(e_blocks, residual_blocks)) { in IsOrderingValid()
640 const vector<ResidualBlock*>& residual_blocks) { in IsParameterBlockSetIndependent() argument
645 for (vector<ResidualBlock*>::const_iterator it = residual_blocks.begin(); in IsParameterBlockSetIndependent()
646 it != residual_blocks.end(); in IsParameterBlockSetIndependent()
Dgradient_checking_cost_function_test.cc394 for (int i = 0; i < program.residual_blocks().size(); ++i) { in TEST()
397 program.residual_blocks()[i]; in TEST()
399 gradient_checking_program.residual_blocks()[i]; in TEST()
Dproblem_impl.h154 void GetResidualBlocks(vector<ResidualBlockId>* residual_blocks) const;
162 vector<ResidualBlockId>* residual_blocks) const;
Dprogram.h64 const vector<ResidualBlock*>& residual_blocks() const;
Ddense_jacobian_writer.h78 program_->residual_blocks()[residual_id]; in Write()
Ddynamic_compressed_row_jacobian_writer.cc72 program_->residual_blocks()[residual_id]; in Write()
Dsolver_impl.h115 const vector<ResidualBlock*>& residual_blocks);
Dprogram_test.cc225 ResidualBlock *expected_removed_block = problem.program().residual_blocks()[0]; in TEST()
Dprogram.cc64 const vector<ResidualBlock*>& Program::residual_blocks() const { in residual_blocks() function in ceres::internal::Program
/external/ceres-solver/include/ceres/
Dproblem.h364 void GetResidualBlocks(vector<ResidualBlockId>* residual_blocks) const;
379 vector<ResidualBlockId>* residual_blocks) const;
413 vector<ResidualBlockId> residual_blocks; member
/external/ceres-solver/docs/source/
Dmodeling.rst1447 residual_blocks().size().
1474 .. function:: void Problem::GetResidualBlocks(vector<ResidualBlockId>* residual_blocks) const
1476 Fills the passed `residual_blocks` vector with pointers to the
1478 `residual_blocks.size() == NumResidualBlocks`.
1485 …sidualBlocksForParameterBlock(const double* values, vector<ResidualBlockId>* residual_blocks) const
1546 .. member:: vector<ResidualBlockId> Problem::EvaluateOptions::residual_blocks
1551 residual_blocks is empty, then it is assumed to be equal to the