Home
last modified time | relevance | path

Searched refs:parameter_blocks (Results 1 – 25 of 39) 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 …]
Dreorder_program.cc63 ParameterBlock* parameter_block = residual_block->parameter_blocks()[i]; in MinParameterBlock()
77 const vector<ParameterBlock*>& parameter_blocks, in OrderingForSparseNormalCholeskyUsingSuiteSparse() argument
96 for (int i = 0; i < parameter_blocks.size(); ++i) { in OrderingForSparseNormalCholeskyUsingSuiteSparse()
99 parameter_blocks[i]->mutable_user_state())); in OrderingForSparseNormalCholeskyUsingSuiteSparse()
152 vector<ParameterBlock*>* parameter_blocks = in ApplyOrdering() local
154 parameter_blocks->clear(); in ApplyOrdering()
175 parameter_blocks->push_back(parameter_block_it->second); in ApplyOrdering()
272 vector<ParameterBlock*>& parameter_blocks = in MaybeReorderSchurComplementColumnsUsingSuiteSparse() local
275 for (int i = 0; i < parameter_blocks.size(); ++i) { in MaybeReorderSchurComplementColumnsUsingSuiteSparse()
278 parameter_blocks[i]->mutable_user_state())); in MaybeReorderSchurComplementColumnsUsingSuiteSparse()
[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 …]
Dproblem_impl.cc163 residual_block->parameter_blocks()[i] in InternalRemoveResidualBlock()
241 const vector<double*>& parameter_blocks) { in AddResidualBlock() argument
243 CHECK_EQ(parameter_blocks.size(), in AddResidualBlock()
251 CHECK_EQ(parameter_block_sizes.size(), parameter_blocks.size()) in AddResidualBlock()
256 vector<double*> sorted_parameter_blocks(parameter_blocks); in AddResidualBlock()
263 for (int i = 0; i < parameter_blocks.size(); ++i) { in AddResidualBlock()
264 blocks += StringPrintf(" %p ", parameter_blocks[i]); in AddResidualBlock()
274 vector<ParameterBlock*> parameter_block_ptrs(parameter_blocks.size()); in AddResidualBlock()
275 for (int i = 0; i < parameter_blocks.size(); ++i) { in AddResidualBlock()
277 InternalAddParameterBlock(parameter_blocks[i], in AddResidualBlock()
[all …]
Dcompressed_row_jacobian_writer.cc45 const vector<ParameterBlock*>& parameter_blocks = in PopulateJacobianRowAndColumnBlockVectors() local
46 program->parameter_blocks(); in PopulateJacobianRowAndColumnBlockVectors()
48 col_blocks.resize(parameter_blocks.size()); in PopulateJacobianRowAndColumnBlockVectors()
49 for (int i = 0; i < parameter_blocks.size(); ++i) { in PopulateJacobianRowAndColumnBlockVectors()
50 col_blocks[i] = parameter_blocks[i]->LocalSize(); in PopulateJacobianRowAndColumnBlockVectors()
72 residual_block->parameter_blocks()[j]; in GetOrderedParameterBlocks()
95 ParameterBlock* parameter_block = residual_block->parameter_blocks()[j]; in CreateJacobian()
127 ParameterBlock* parameter_block = residual_block->parameter_blocks()[j]; in CreateJacobian()
155 program_->parameter_blocks()[parameter_indices[j]]; in CreateJacobian()
202 program_->parameter_blocks()[evaluated_jacobian_blocks[i].first]; in Write()
Ddynamic_numeric_diff_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()
116 vector<double*> parameter_blocks(2); in TEST() local
117 parameter_blocks[0] = &param_block_0[0]; in TEST()
118 parameter_blocks[1] = &param_block_1[0]; in TEST()
129 EXPECT_TRUE(cost_function.Evaluate(parameter_blocks.data(), in TEST()
183 vector<double*> parameter_blocks(2); in TEST() local
184 parameter_blocks[0] = &param_block_0[0]; in TEST()
[all …]
Dgradient_checking_cost_function.cc262 const vector<ParameterBlock*>& parameter_blocks = program->parameter_blocks(); in CreateGradientCheckingProblemImpl() local
263 for (int i = 0; i < parameter_blocks.size(); ++i) { in CreateGradientCheckingProblemImpl()
264 ParameterBlock* parameter_block = parameter_blocks[i]; in CreateGradientCheckingProblemImpl()
288 vector<double*> parameter_blocks; in CreateGradientCheckingProblemImpl() local
290 ParameterBlock* parameter_block = residual_block->parameter_blocks()[j]; in CreateGradientCheckingProblemImpl()
291 parameter_blocks.push_back(parameter_block->mutable_user_state()); in CreateGradientCheckingProblemImpl()
310 parameter_blocks); in CreateGradientCheckingProblemImpl()
Dreorder_program_test.cc161 const vector<ParameterBlock*>& parameter_blocks = program->parameter_blocks(); in TEST() local
163 EXPECT_EQ(parameter_blocks.size(), 3); in TEST()
164 EXPECT_EQ(parameter_blocks[0]->user_state(), &x); in TEST()
165 EXPECT_EQ(parameter_blocks[1]->user_state(), &z); in TEST()
166 EXPECT_EQ(parameter_blocks[2]->user_state(), &y); in TEST()
Dsolver_impl_test.cc98 EXPECT_EQ(&x, problem.program().parameter_blocks()[0]->state()); in TEST()
99 EXPECT_EQ(&y, problem.program().parameter_blocks()[1]->state()); in TEST()
100 EXPECT_EQ(&z, problem.program().parameter_blocks()[2]->state()); in TEST()
101 EXPECT_EQ(&w, problem.program().parameter_blocks()[3]->state()); in TEST()
Dprogram.cc60 const vector<ParameterBlock*>& Program::parameter_blocks() const { in parameter_blocks() function in ceres::internal::Program
130 residual_block->parameter_blocks()[j]->set_index(-1); in SetParameterOffsetsAndIndex()
311 ParameterBlock* parameter_block = residual_block->parameter_blocks()[k]; in RemoveFixedBlocks()
371 ParameterBlock* const* parameter_blocks = (*it)->parameter_blocks(); in IsParameterBlockSetIndependent() local
376 parameter_blocks[i]->mutable_user_state()); in IsParameterBlockSetIndependent()
399 ParameterBlock* const* parameter_blocks = in CreateJacobianBlockSparsityTranspose() local
400 residual_block->parameter_blocks(); in CreateJacobianBlockSparsityTranspose()
403 if (parameter_blocks[j]->IsConstant()) { in CreateJacobianBlockSparsityTranspose()
416 const int r = parameter_blocks[j]->index(); in CreateJacobianBlockSparsityTranspose()
479 residual_block->parameter_blocks()[j]->LocalSize(); in MaxDerivativesPerResidualBlock()
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()
552 vector<double*> parameter_blocks; in TEST() local
553 problem.GetParameterBlocks(&parameter_blocks); in TEST()
554 EXPECT_EQ(parameter_blocks.size(), 2); in TEST()
555 EXPECT_NE(parameter_blocks[0], parameter_blocks[1]); in TEST()
556 EXPECT_TRUE(parameter_blocks[0] == x || parameter_blocks[0] == y); in TEST()
557 EXPECT_TRUE(parameter_blocks[1] == x || parameter_blocks[1] == y); in TEST()
562 problem.GetParameterBlocks(&parameter_blocks); in TEST()
563 EXPECT_EQ(parameter_blocks.size(), 1); in TEST()
564 EXPECT_TRUE(parameter_blocks[0] == y); in TEST()
[all …]
Dproblem.cc48 const vector<double*>& parameter_blocks) { in AddResidualBlock() argument
51 parameter_blocks); in AddResidualBlock()
238 void Problem::GetParameterBlocks(vector<double*>* parameter_blocks) const { in GetParameterBlocks()
239 problem_impl_->GetParameterBlocks(parameter_blocks); in GetParameterBlocks()
249 vector<double*>* parameter_blocks) const { in GetParameterBlocksForResidualBlock()
251 parameter_blocks); in GetParameterBlocksForResidualBlock()
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()
93 const int parameter_block_size = block.parameter_blocks()[i]->Size(); in EvaluationToString()
129 const int parameter_block_size = block.parameter_blocks()[i]->Size(); in IsEvaluationValid()
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()
Dresidual_block.h74 const vector<ParameterBlock*>& parameter_blocks,
111 ParameterBlock* const* parameter_blocks() const { in parameter_blocks() function
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()
/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.h216 const vector<double*>& parameter_blocks);
359 void GetParameterBlocks(vector<double*>* parameter_blocks) const;
369 vector<double*>* parameter_blocks) const;
402 vector<double*> parameter_blocks; member
/external/ceres-solver/examples/
Drobot_pose_mle.cc214 vector<double*>* parameter_blocks) { in Create()
219 parameter_blocks->clear(); in Create()
221 parameter_blocks->push_back(&((*odometry_values)[i])); in Create()
292 vector<double*> parameter_blocks; in main() local
295 i, range_readings[i], &odometry_values, &parameter_blocks); in main()
296 problem.AddResidualBlock(range_cost_function, NULL, parameter_blocks); in main()
Dellipse_approximation.cc414 std::vector<double*> parameter_blocks(1 + num_segments); in main() local
415 parameter_blocks[0] = NULL; in main()
417 parameter_blocks[i + 1] = X.data() + 2 * i; in main()
420 parameter_blocks[0] = &t[i]; in main()
424 parameter_blocks); in main()

12