Searched defs:parameter_blocks (Results 1 - 19 of 19) sorted by relevance

/external/ceres-solver/internal/ceres/
H A Dschur_ordering.cc52 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); local
55 for (int i = 0; i < parameter_blocks.size(); ++i) {
56 ParameterBlock* parameter_block = parameter_blocks[i];
68 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); local
69 for (int i = 0; i < parameter_blocks.size(); ++i) {
70 ParameterBlock* parameter_block = parameter_blocks[i];
80 ParameterBlock* const* parameter_blocks = local
81 residual_block->parameter_blocks();
[all...]
H A Dparameter_block_ordering.cc50 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); local
52 for (int i = 0; i < parameter_blocks.size(); ++i) {
53 if (vertices.count(parameter_blocks[i]) > 0) {
54 ordering->push_back(parameter_blocks[i]);
61 for (int i = 0; i < parameter_blocks.size(); ++i) {
62 ParameterBlock* parameter_block = parameter_blocks[i];
77 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); local
80 for (int i = 0; i < parameter_blocks
93 const vector<ParameterBlock*> parameter_blocks = program.parameter_blocks(); local
115 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); local
127 ParameterBlock* const* parameter_blocks = local
[all...]
H A Dresidual_block.h74 const vector<ParameterBlock*>& parameter_blocks,
111 ParameterBlock* const* parameter_blocks() const { function in class:ceres::internal::ResidualBlock
H A Dparameter_block_ordering_test.cc85 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); local
92 EXPECT_TRUE(vertices.find(parameter_blocks[i]) != vertices.end());
96 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[0]);
98 EXPECT_TRUE(neighbors.find(parameter_blocks[2]) != neighbors.end());
99 EXPECT_TRUE(neighbors.find(parameter_blocks[3]) != neighbors.end());
103 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[1]);
105 EXPECT_TRUE(neighbors.find(parameter_blocks[2]) != neighbors.end());
109 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[2]);
111 EXPECT_TRUE(neighbors.find(parameter_blocks[
139 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); local
[all...]
H A Dresidual_block.cc54 const vector<ParameterBlock*>& parameter_blocks,
62 std::copy(parameter_blocks.begin(),
63 parameter_blocks.end(),
52 ResidualBlock(const CostFunction* cost_function, const LossFunction* loss_function, const vector<ParameterBlock*>& parameter_blocks, int index) argument
H A Dresidual_block_utils_test.cc49 vector<ParameterBlock*> parameter_blocks; local
50 parameter_blocks.push_back(&parameter_block);
54 parameter_blocks,
H A Dschur_ordering_test.cc85 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); local
92 EXPECT_TRUE(vertices.find(parameter_blocks[i]) != vertices.end());
96 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[0]);
98 EXPECT_TRUE(neighbors.find(parameter_blocks[2]) != neighbors.end());
99 EXPECT_TRUE(neighbors.find(parameter_blocks[3]) != neighbors.end());
103 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[1]);
105 EXPECT_TRUE(neighbors.find(parameter_blocks[2]) != neighbors.end());
109 const VertexSet& neighbors = graph->Neighbors(parameter_blocks[2]);
111 EXPECT_TRUE(neighbors.find(parameter_blocks[
139 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); local
[all...]
H A Dblock_jacobian_writer.cc74 ParameterBlock* parameter_block = residual_block->parameter_blocks()[j];
102 ParameterBlock* parameter_block = residual_block->parameter_blocks()[j];
152 const vector<ParameterBlock*>& parameter_blocks = local
153 program_->parameter_blocks();
156 bs->cols.resize(parameter_blocks.size());
157 for (int i = 0, cursor = 0; i < parameter_blocks.size(); ++i) {
158 CHECK_NE(parameter_blocks[i]->index(), -1);
159 CHECK(!parameter_blocks[i]->IsConstant());
160 bs->cols[i].size = parameter_blocks[i]->LocalSize();
182 if (residual_block->parameter_blocks()[
[all...]
H A Dcompressed_row_jacobian_writer.cc57 ParameterBlock* parameter_block = residual_block->parameter_blocks()[j];
89 ParameterBlock* parameter_block = residual_block->parameter_blocks()[j];
117 program_->parameter_blocks()[parameter_indices[j]];
138 const vector<ParameterBlock*>& parameter_blocks = local
139 program_->parameter_blocks();
141 col_blocks.resize(parameter_blocks.size());
142 for (int i = 0; i < parameter_blocks.size(); ++i) {
143 col_blocks[i] = parameter_blocks[i]->LocalSize();
179 residual_block->parameter_blocks()[j];
194 program_->parameter_blocks()[evaluated_jacobian_block
[all...]
H A Dcoordinate_descent_minimizer.cc89 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); local
90 for (int i = 0; i < parameter_blocks.size(); ++i) {
91 if (!ordering.IsMember(parameter_blocks[i]->mutable_user_state())) {
92 parameter_blocks_.push_back(parameter_blocks[i]);
105 ParameterBlock* parameter_block = residual_block->parameter_blocks()[j];
H A Dprogram.cc58 const vector<ParameterBlock*>& Program::parameter_blocks() const { function in class:ceres::internal::Program
128 residual_block->parameter_blocks()[j]->set_index(-1);
194 residual_block->parameter_blocks()[j]->LocalSize();
H A Devaluator_test.cc452 vector<ParameterBlock*>* parameter_blocks = local
458 ParameterBlock* parameter_block_z = parameter_blocks->back();
459 parameter_blocks->pop_back();
494 parameter_blocks->push_back(parameter_block_z);
H A Dgradient_checking_cost_function.cc252 const vector<ParameterBlock*>& parameter_blocks = program->parameter_blocks(); local
253 for (int i = 0; i < parameter_blocks.size(); ++i) {
254 ParameterBlock* parameter_block = parameter_blocks[i];
278 vector<double*> parameter_blocks; local
280 ParameterBlock* parameter_block = residual_block->parameter_blocks()[j];
281 parameter_blocks.push_back(parameter_block->mutable_user_state());
300 parameter_blocks);
H A Dproblem.cc48 const vector<double*>& parameter_blocks) {
51 parameter_blocks);
217 void Problem::GetParameterBlocks(vector<double*>* parameter_blocks) const {
218 problem_impl_->GetParameterBlocks(parameter_blocks);
45 AddResidualBlock( CostFunction* cost_function, LossFunction* loss_function, const vector<double*>& parameter_blocks) argument
H A Dsolver_impl_test.cc427 const vector<ParameterBlock*>& parameter_blocks = local
428 reduced_program->parameter_blocks();
434 EXPECT_EQ(reduced_program->parameter_blocks().size(), 2);
442 EXPECT_NE(parameter_blocks[i]->mutable_user_state(), &z);
490 const vector<ParameterBlock*>& parameter_blocks = program->parameter_blocks(); local
492 EXPECT_EQ(parameter_blocks.size(), 3);
493 EXPECT_EQ(parameter_blocks[0]->user_state(), &x);
494 EXPECT_EQ(parameter_blocks[1]->user_state(), &z);
495 EXPECT_EQ(parameter_blocks[
956 vector<double*> parameter_blocks; local
[all...]
H A Dproblem_impl.cc221 const vector<double*>& parameter_blocks) {
223 CHECK_EQ(parameter_blocks.size(),
231 CHECK_EQ(parameter_block_sizes.size(), parameter_blocks.size())
236 vector<double*> sorted_parameter_blocks(parameter_blocks);
243 for (int i = 0; i < parameter_blocks.size(); ++i) {
244 blocks += StringPrintf(" %p ", parameter_blocks[i]);
254 vector<ParameterBlock*> parameter_block_ptrs(parameter_blocks.size());
255 for (int i = 0; i < parameter_blocks.size(); ++i) {
257 InternalAddParameterBlock(parameter_blocks[i],
282 for (int i = 0; i < parameter_blocks
218 AddResidualBlock( CostFunction* cost_function, LossFunction* loss_function, const vector<double*>& parameter_blocks) argument
558 vector<ParameterBlock*>& parameter_blocks = local
[all...]
H A Dproblem_test.cc142 "parameter_blocks.size()");
386 return problem->program().parameter_blocks()[block];
521 vector<double*> parameter_blocks; local
522 problem.GetParameterBlocks(&parameter_blocks);
523 EXPECT_EQ(parameter_blocks.size(), 2);
524 EXPECT_NE(parameter_blocks[0], parameter_blocks[1]);
525 EXPECT_TRUE(parameter_blocks[0] == x || parameter_blocks[0] == y);
526 EXPECT_TRUE(parameter_blocks[
[all...]
H A Dsolver_impl.cc540 if (reduced_program->parameter_blocks().size() < 2) {
918 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); local
919 for (vector<ParameterBlock*>::const_iterator it = parameter_blocks.begin();
920 it != parameter_blocks.end();
955 ParameterBlock* const* parameter_blocks = (*it)->parameter_blocks(); local
960 parameter_blocks[i]->mutable_user_state());
976 vector<ParameterBlock*>* parameter_blocks = local
988 for (int i = 0; i < parameter_blocks
1037 vector<ParameterBlock*>* parameter_blocks = local
1505 vector<ParameterBlock*>* parameter_blocks = local
1552 ParameterBlock* const* parameter_blocks = local
1631 vector<ParameterBlock*>& parameter_blocks = local
1690 vector<ParameterBlock*>& parameter_blocks = local
[all...]
/external/ceres-solver/include/ceres/
H A Dproblem.h175 // the sizes of the parameter blocks listed in parameter_blocks. The
211 const vector<double*>& parameter_blocks);
316 // parameter_blocks().size() and parameter_block_sizes().size().
339 // Fills the passed parameter_blocks vector with pointers to the
342 void GetParameterBlocks(vector<double*>* parameter_blocks) const;
354 // jacobian matrix. If parameter_blocks is empty, then it is
365 vector<double*> parameter_blocks; member in struct:ceres::Problem::EvaluateOptions

Completed in 202 milliseconds