Home
last modified time | relevance | path

Searched refs:parameter_blocks (Results 1 – 25 of 34) sorted by relevance

12

/external/ceres-solver/internal/ceres/
Dparameter_block_ordering.cc50 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); in ComputeStableSchurOrdering() local
52 for (int i = 0; i < parameter_blocks.size(); ++i) { in ComputeStableSchurOrdering()
53 if (vertices.count(parameter_blocks[i]) > 0) { in ComputeStableSchurOrdering()
54 ordering->push_back(parameter_blocks[i]); in ComputeStableSchurOrdering()
61 for (int i = 0; i < parameter_blocks.size(); ++i) { in ComputeStableSchurOrdering()
62 ParameterBlock* parameter_block = parameter_blocks[i]; in ComputeStableSchurOrdering()
77 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); in ComputeSchurOrdering() local
80 for (int i = 0; i < parameter_blocks.size(); ++i) { in ComputeSchurOrdering()
81 ParameterBlock* parameter_block = parameter_blocks[i]; in ComputeSchurOrdering()
93 const vector<ParameterBlock*> parameter_blocks = program.parameter_blocks(); in ComputeRecursiveIndependentSetOrdering() local
[all …]
Dparameter_block_ordering_test.cc85 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); in TEST_F() local
92 EXPECT_TRUE(vertices.find(parameter_blocks[i]) != vertices.end()); in TEST_F()
96 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[0]); in TEST_F()
98 EXPECT_TRUE(neighbors.find(parameter_blocks[2]) != neighbors.end()); in TEST_F()
99 EXPECT_TRUE(neighbors.find(parameter_blocks[3]) != neighbors.end()); in TEST_F()
103 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[1]); in TEST_F()
105 EXPECT_TRUE(neighbors.find(parameter_blocks[2]) != neighbors.end()); in TEST_F()
109 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[2]); in TEST_F()
111 EXPECT_TRUE(neighbors.find(parameter_blocks[0]) != neighbors.end()); in TEST_F()
112 EXPECT_TRUE(neighbors.find(parameter_blocks[1]) != neighbors.end()); in TEST_F()
[all …]
Dschur_ordering_test.cc85 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); in TEST_F() local
92 EXPECT_TRUE(vertices.find(parameter_blocks[i]) != vertices.end()); in TEST_F()
96 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[0]); in TEST_F()
98 EXPECT_TRUE(neighbors.find(parameter_blocks[2]) != neighbors.end()); in TEST_F()
99 EXPECT_TRUE(neighbors.find(parameter_blocks[3]) != neighbors.end()); in TEST_F()
103 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[1]); in TEST_F()
105 EXPECT_TRUE(neighbors.find(parameter_blocks[2]) != neighbors.end()); in TEST_F()
109 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[2]); in TEST_F()
111 EXPECT_TRUE(neighbors.find(parameter_blocks[0]) != neighbors.end()); in TEST_F()
112 EXPECT_TRUE(neighbors.find(parameter_blocks[1]) != neighbors.end()); in TEST_F()
[all …]
Dschur_ordering.cc52 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); in ComputeSchurOrdering() local
55 for (int i = 0; i < parameter_blocks.size(); ++i) { in ComputeSchurOrdering()
56 ParameterBlock* parameter_block = parameter_blocks[i]; in ComputeSchurOrdering()
68 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); in CreateHessianGraph() local
69 for (int i = 0; i < parameter_blocks.size(); ++i) { in CreateHessianGraph()
70 ParameterBlock* parameter_block = parameter_blocks[i]; in CreateHessianGraph()
80 ParameterBlock* const* parameter_blocks = in CreateHessianGraph() local
81 residual_block->parameter_blocks(); in CreateHessianGraph()
83 if (parameter_blocks[j]->IsConstant()) { in CreateHessianGraph()
88 if (parameter_blocks[k]->IsConstant()) { in CreateHessianGraph()
[all …]
Dblock_jacobian_writer.cc74 ParameterBlock* parameter_block = residual_block->parameter_blocks()[j]; in BuildJacobianLayout()
102 ParameterBlock* parameter_block = residual_block->parameter_blocks()[j]; in BuildJacobianLayout()
152 const vector<ParameterBlock*>& parameter_blocks = in CreateJacobian() local
153 program_->parameter_blocks(); in CreateJacobian()
156 bs->cols.resize(parameter_blocks.size()); in CreateJacobian()
157 for (int i = 0, cursor = 0; i < parameter_blocks.size(); ++i) { in CreateJacobian()
158 CHECK_NE(parameter_blocks[i]->index(), -1); in CreateJacobian()
159 CHECK(!parameter_blocks[i]->IsConstant()); in CreateJacobian()
160 bs->cols[i].size = parameter_blocks[i]->LocalSize(); in CreateJacobian()
182 if (residual_block->parameter_blocks()[j]->index() != -1) { in CreateJacobian()
[all …]
Dcompressed_row_jacobian_writer.cc57 ParameterBlock* parameter_block = residual_block->parameter_blocks()[j]; in CreateJacobian()
89 ParameterBlock* parameter_block = residual_block->parameter_blocks()[j]; in CreateJacobian()
117 program_->parameter_blocks()[parameter_indices[j]]; in CreateJacobian()
138 const vector<ParameterBlock*>& parameter_blocks = in CreateJacobian() local
139 program_->parameter_blocks(); in CreateJacobian()
141 col_blocks.resize(parameter_blocks.size()); in CreateJacobian()
142 for (int i = 0; i < parameter_blocks.size(); ++i) { in CreateJacobian()
143 col_blocks[i] = parameter_blocks[i]->LocalSize(); in CreateJacobian()
179 residual_block->parameter_blocks()[j]; in Write()
194 program_->parameter_blocks()[evaluated_jacobian_blocks[i].first]; in Write()
Dproblem_impl.cc221 const vector<double*>& parameter_blocks) { in AddResidualBlock() argument
223 CHECK_EQ(parameter_blocks.size(), in AddResidualBlock()
231 CHECK_EQ(parameter_block_sizes.size(), parameter_blocks.size()) in AddResidualBlock()
236 vector<double*> sorted_parameter_blocks(parameter_blocks); in AddResidualBlock()
243 for (int i = 0; i < parameter_blocks.size(); ++i) { in AddResidualBlock()
244 blocks += StringPrintf(" %p ", parameter_blocks[i]); in AddResidualBlock()
254 vector<ParameterBlock*> parameter_block_ptrs(parameter_blocks.size()); in AddResidualBlock()
255 for (int i = 0; i < parameter_blocks.size(); ++i) { in AddResidualBlock()
257 InternalAddParameterBlock(parameter_blocks[i], in AddResidualBlock()
282 for (int i = 0; i < parameter_blocks.size(); ++i) { in AddResidualBlock()
[all …]
Dsolver_impl.cc540 if (reduced_program->parameter_blocks().size() < 2) { in TrustRegionSolve()
918 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); in IsOrderingValid() local
919 for (vector<ParameterBlock*>::const_iterator it = parameter_blocks.begin(); in IsOrderingValid()
920 it != parameter_blocks.end(); in IsOrderingValid()
955 ParameterBlock* const* parameter_blocks = (*it)->parameter_blocks(); in IsParameterBlockSetIndependent() local
960 parameter_blocks[i]->mutable_user_state()); in IsParameterBlockSetIndependent()
976 vector<ParameterBlock*>* parameter_blocks = in RemoveFixedBlocksFromProgram() local
988 for (int i = 0; i < parameter_blocks->size(); ++i) { in RemoveFixedBlocksFromProgram()
989 (*parameter_blocks)[i]->set_index(-1); in RemoveFixedBlocksFromProgram()
1006 ParameterBlock* parameter_block = residual_block->parameter_blocks()[k]; in RemoveFixedBlocksFromProgram()
[all …]
Dgradient_checking_cost_function.cc252 const vector<ParameterBlock*>& parameter_blocks = program->parameter_blocks(); in CreateGradientCheckingProblemImpl() local
253 for (int i = 0; i < parameter_blocks.size(); ++i) { in CreateGradientCheckingProblemImpl()
254 ParameterBlock* parameter_block = parameter_blocks[i]; in CreateGradientCheckingProblemImpl()
278 vector<double*> parameter_blocks; in CreateGradientCheckingProblemImpl() local
280 ParameterBlock* parameter_block = residual_block->parameter_blocks()[j]; in CreateGradientCheckingProblemImpl()
281 parameter_blocks.push_back(parameter_block->mutable_user_state()); in CreateGradientCheckingProblemImpl()
300 parameter_blocks); in CreateGradientCheckingProblemImpl()
Ddynamic_autodiff_cost_function_test.cc85 vector<double*> parameter_blocks(2); in TEST() local
86 parameter_blocks[0] = &param_block_0[0]; in TEST()
87 parameter_blocks[1] = &param_block_1[0]; in TEST()
88 EXPECT_TRUE(cost_function.Evaluate(&parameter_blocks[0], in TEST()
115 vector<double*> parameter_blocks(2); in TEST() local
116 parameter_blocks[0] = &param_block_0[0]; in TEST()
117 parameter_blocks[1] = &param_block_1[0]; in TEST()
128 EXPECT_TRUE(cost_function.Evaluate(parameter_blocks.data(), in TEST()
182 vector<double*> parameter_blocks(2); in TEST() local
183 parameter_blocks[0] = &param_block_0[0]; in TEST()
[all …]
Dcoordinate_descent_minimizer.cc89 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); in Init() local
90 for (int i = 0; i < parameter_blocks.size(); ++i) { in Init()
91 if (!ordering.IsMember(parameter_blocks[i]->mutable_user_state())) { in Init()
92 parameter_blocks_.push_back(parameter_blocks[i]); in Init()
105 ParameterBlock* parameter_block = residual_block->parameter_blocks()[j]; in Init()
Dproblem_test.cc386 return problem->program().parameter_blocks()[block]; in GetParameterBlock()
521 vector<double*> parameter_blocks; in TEST() local
522 problem.GetParameterBlocks(&parameter_blocks); in TEST()
523 EXPECT_EQ(parameter_blocks.size(), 2); in TEST()
524 EXPECT_NE(parameter_blocks[0], parameter_blocks[1]); in TEST()
525 EXPECT_TRUE(parameter_blocks[0] == x || parameter_blocks[0] == y); in TEST()
526 EXPECT_TRUE(parameter_blocks[1] == x || parameter_blocks[1] == y); in TEST()
529 problem.GetParameterBlocks(&parameter_blocks); in TEST()
530 EXPECT_EQ(parameter_blocks.size(), 1); in TEST()
531 EXPECT_TRUE(parameter_blocks[0] == y); in TEST()
[all …]
Dresidual_block_test.cc101 EXPECT_EQ(parameters[0], residual_block.parameter_blocks()[0]); in TEST()
102 EXPECT_EQ(parameters[1], residual_block.parameter_blocks()[1]); in TEST()
103 EXPECT_EQ(parameters[2], residual_block.parameter_blocks()[2]); in TEST()
240 EXPECT_EQ(parameters[0], residual_block.parameter_blocks()[0]); in TEST()
241 EXPECT_EQ(parameters[1], residual_block.parameter_blocks()[1]); in TEST()
242 EXPECT_EQ(parameters[2], residual_block.parameter_blocks()[2]); in TEST()
Dresidual_block_utils_test.cc49 vector<ParameterBlock*> parameter_blocks; in CheckEvaluation() local
50 parameter_blocks.push_back(&parameter_block); in CheckEvaluation()
54 parameter_blocks, in CheckEvaluation()
Dresidual_block_utils.cc58 const int parameter_block_size = block.parameter_blocks()[i]->Size(); in InvalidateEvaluation()
111 const int parameter_block_size = block.parameter_blocks()[i]->Size(); in EvaluationToString()
147 const int parameter_block_size = block.parameter_blocks()[i]->Size(); in IsEvaluationValid()
Dsolver_impl_test.cc427 const vector<ParameterBlock*>& parameter_blocks = in TEST() local
428 reduced_program->parameter_blocks(); in TEST()
434 EXPECT_EQ(reduced_program->parameter_blocks().size(), 2); in TEST()
442 EXPECT_NE(parameter_blocks[i]->mutable_user_state(), &z); in TEST()
490 const vector<ParameterBlock*>& parameter_blocks = program->parameter_blocks(); in TEST() local
492 EXPECT_EQ(parameter_blocks.size(), 3); in TEST()
493 EXPECT_EQ(parameter_blocks[0]->user_state(), &x); in TEST()
494 EXPECT_EQ(parameter_blocks[1]->user_state(), &z); in TEST()
495 EXPECT_EQ(parameter_blocks[2]->user_state(), &y); in TEST()
752 EXPECT_EQ(&x, problem.program().parameter_blocks()[0]->state()); in TEST()
[all …]
Dresidual_block.h74 const vector<ParameterBlock*>& parameter_blocks,
111 ParameterBlock* const* parameter_blocks() const { in parameter_blocks() function
Dcost_function_to_functor_test.cc70 scoped_array<double*> parameter_blocks( in ExpectCostFunctionsAreEqual() local
79 parameter_blocks[i] = parameters.get() + num_parameters; in ExpectCostFunctionsAreEqual()
86 EXPECT_TRUE(cost_function.Evaluate(parameter_blocks.get(), in ExpectCostFunctionsAreEqual()
88 EXPECT_TRUE(actual_cost_function.Evaluate(parameter_blocks.get(), in ExpectCostFunctionsAreEqual()
96 EXPECT_TRUE(cost_function.Evaluate(parameter_blocks.get(), in ExpectCostFunctionsAreEqual()
99 EXPECT_TRUE(actual_cost_function.Evaluate(parameter_blocks.get(), in ExpectCostFunctionsAreEqual()
Dproblem.cc48 const vector<double*>& parameter_blocks) { in AddResidualBlock() argument
51 parameter_blocks); in AddResidualBlock()
217 void Problem::GetParameterBlocks(vector<double*>* parameter_blocks) const { in GetParameterBlocks()
218 problem_impl_->GetParameterBlocks(parameter_blocks); in GetParameterBlocks()
Dresidual_block.cc54 const vector<ParameterBlock*>& parameter_blocks, in ResidualBlock() argument
62 std::copy(parameter_blocks.begin(), in ResidualBlock()
63 parameter_blocks.end(), in ResidualBlock()
Dgradient_checking_cost_function_test.cc388 for (int i = 0; i < program.parameter_blocks().size(); ++i) { in TEST()
390 program.parameter_blocks()[i], in TEST()
391 gradient_checking_program.parameter_blocks()[i]); in TEST()
410 original_residual_block->parameter_blocks()[j], in TEST()
411 new_residual_block->parameter_blocks()[j]); in TEST()
Dprogram.cc58 const vector<ParameterBlock*>& Program::parameter_blocks() const { in parameter_blocks() function in ceres::internal::Program
128 residual_block->parameter_blocks()[j]->set_index(-1); in SetParameterOffsetsAndIndex()
194 residual_block->parameter_blocks()[j]->LocalSize(); in MaxDerivativesPerResidualBlock()
Dc_api.cc166 std::vector<double*> parameter_blocks(parameters, in ceres_problem_add_residual_block() local
171 parameter_blocks)); in ceres_problem_add_residual_block()
/external/ceres-solver/include/ceres/
Dcost_function_to_functor.h181 internal::FixedArray<const double*> parameter_blocks(2); in operator()
182 parameter_blocks[0] = x0; in operator()
183 parameter_blocks[1] = x1; in operator()
184 return cost_function_->Evaluate(parameter_blocks.get(), residuals, NULL); in operator()
201 internal::FixedArray<const double*> parameter_blocks(3); in operator()
202 parameter_blocks[0] = x0; in operator()
203 parameter_blocks[1] = x1; in operator()
204 parameter_blocks[2] = x2; in operator()
205 return cost_function_->Evaluate(parameter_blocks.get(), residuals, NULL); in operator()
223 internal::FixedArray<const double*> parameter_blocks(4); in operator()
[all …]
Dproblem.h211 const vector<double*>& parameter_blocks);
342 void GetParameterBlocks(vector<double*>* parameter_blocks) const;
365 vector<double*> parameter_blocks; member

12