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

  /external/ceres-solver/internal/ceres/
residual_block.h 74 const vector<ParameterBlock*>& parameter_blocks,
111 ParameterBlock* const* parameter_blocks() const { function in class:ceres::internal::ResidualBlock
parameter_block_ordering.cc 50 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.size(); ++i)
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...]
parameter_block_ordering_test.cc 85 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[0]) != neighbors.end())
139 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); local
    [all...]
reorder_program_test.cc 161 const vector<ParameterBlock*>& parameter_blocks = program->parameter_blocks(); local
163 EXPECT_EQ(parameter_blocks.size(), 3);
164 EXPECT_EQ(parameter_blocks[0]->user_state(), &x);
165 EXPECT_EQ(parameter_blocks[1]->user_state(), &z);
166 EXPECT_EQ(parameter_blocks[2]->user_state(), &y);
block_jacobian_writer.cc 74 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()[j]->index() != -1)
    [all...]
coordinate_descent_minimizer.cc 89 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];
reorder_program.cc 63 ParameterBlock* parameter_block = residual_block->parameter_blocks()[i];
77 const vector<ParameterBlock*>& parameter_blocks,
96 for (int i = 0; i < parameter_blocks.size(); ++i) {
99 parameter_blocks[i]->mutable_user_state()));
152 vector<ParameterBlock*>* parameter_blocks = local
154 parameter_blocks->clear();
175 parameter_blocks->push_back(parameter_block_it->second);
272 vector<ParameterBlock*>& parameter_blocks = local
275 for (int i = 0; i < parameter_blocks.size(); ++i) {
278 parameter_blocks[i]->mutable_user_state()))
408 vector<ParameterBlock*>& parameter_blocks = local
    [all...]
residual_block_utils_test.cc 49 vector<ParameterBlock*> parameter_blocks; local
50 parameter_blocks.push_back(&parameter_block);
54 parameter_blocks,
compressed_row_jacobian_writer.cc 45 const vector<ParameterBlock*>& parameter_blocks = local
46 program->parameter_blocks();
48 col_blocks.resize(parameter_blocks.size());
49 for (int i = 0; i < parameter_blocks.size(); ++i) {
50 col_blocks[i] = parameter_blocks[i]->LocalSize();
72 residual_block->parameter_blocks()[j];
95 ParameterBlock* parameter_block = residual_block->parameter_blocks()[j];
127 ParameterBlock* parameter_block = residual_block->parameter_blocks()[j];
155 program_->parameter_blocks()[parameter_indices[j]];
202 program_->parameter_blocks()[evaluated_jacobian_blocks[i].first]
    [all...]
gradient_checking_cost_function.cc 262 const vector<ParameterBlock*>& parameter_blocks = program->parameter_blocks(); local
263 for (int i = 0; i < parameter_blocks.size(); ++i) {
264 ParameterBlock* parameter_block = parameter_blocks[i];
288 vector<double*> parameter_blocks; local
290 ParameterBlock* parameter_block = residual_block->parameter_blocks()[j];
291 parameter_blocks.push_back(parameter_block->mutable_user_state());
310 parameter_blocks);
program_test.cc 357 vector<double*> parameter_blocks; local
360 parameter_blocks.push_back(x + i);
365 parameter_blocks);
solver_impl.cc 380 if (reduced_program->parameter_blocks().size() < 2) {
611 const vector<ParameterBlock*>& parameter_blocks = program.parameter_blocks(); local
612 for (vector<ParameterBlock*>::const_iterator it = parameter_blocks.begin();
613 it != parameter_blocks.end();
648 ParameterBlock* const* parameter_blocks = (*it)->parameter_blocks(); local
653 parameter_blocks[i]->mutable_user_state());
    [all...]
evaluator_test.cc 477 vector<ParameterBlock*>* parameter_blocks = local
483 ParameterBlock* parameter_block_z = parameter_blocks->back();
484 parameter_blocks->pop_back();
519 parameter_blocks->push_back(parameter_block_z);
program.cc 60 const vector<ParameterBlock*>& Program::parameter_blocks() const { function in class:ceres::internal::Program
130 residual_block->parameter_blocks()[j]->set_index(-1);
311 ParameterBlock* parameter_block = residual_block->parameter_blocks()[k];
371 ParameterBlock* const* parameter_blocks = (*it)->parameter_blocks(); local
376 parameter_blocks[i]->mutable_user_state());
399 ParameterBlock* const* parameter_blocks = local
400 residual_block->parameter_blocks();
403 if (parameter_blocks[j]->IsConstant()) {
416 const int r = parameter_blocks[j]->index()
    [all...]
problem_impl.cc 163 residual_block->parameter_blocks()[i]
241 const vector<double*>& parameter_blocks) {
243 CHECK_EQ(parameter_blocks.size(),
251 CHECK_EQ(parameter_block_sizes.size(), parameter_blocks.size())
256 vector<double*> sorted_parameter_blocks(parameter_blocks);
263 for (int i = 0; i < parameter_blocks.size(); ++i) {
264 blocks += StringPrintf(" %p ", parameter_blocks[i]);
274 vector<ParameterBlock*> parameter_block_ptrs(parameter_blocks.size());
275 for (int i = 0; i < parameter_blocks.size(); ++i) {
277 InternalAddParameterBlock(parameter_blocks[i]
623 vector<ParameterBlock*>& parameter_blocks = local
    [all...]
problem_test.cc 142 "parameter_blocks.size");
386 return problem->program().parameter_blocks()[block];
552 vector<double*> parameter_blocks; local
553 problem.GetParameterBlocks(&parameter_blocks);
554 EXPECT_EQ(parameter_blocks.size(), 2);
555 EXPECT_NE(parameter_blocks[0], parameter_blocks[1]);
556 EXPECT_TRUE(parameter_blocks[0] == x || parameter_blocks[0] == y);
557 EXPECT_TRUE(parameter_blocks[1] == x || parameter_blocks[1] == y)
944 vector<double*> parameter_blocks; local
    [all...]
  /external/ceres-solver/include/ceres/
problem.h 180 // the sizes of the parameter blocks listed in parameter_blocks. The
216 const vector<double*>& parameter_blocks);
330 // parameter_blocks().size() and parameter_block_sizes().size().
356 // Fills the passed parameter_blocks vector with pointers to the
359 void GetParameterBlocks(vector<double*>* parameter_blocks) const;
369 vector<double*>* parameter_blocks) const;
391 // jacobian matrix. If parameter_blocks is empty, then it is
402 vector<double*> parameter_blocks; member in struct:ceres::Problem::EvaluateOptions
  /external/ceres-solver/examples/
ellipse_approximation.cc 414 std::vector<double*> parameter_blocks(1 + num_segments);
415 parameter_blocks[0] = NULL;
417 parameter_blocks[i + 1] = X.data() + 2 * i;
420 parameter_blocks[0] = &t[i];
424 parameter_blocks); local
robot_pose_mle.cc 214 vector<double*>* parameter_blocks) {
219 parameter_blocks->clear();
221 parameter_blocks->push_back(&((*odometry_values)[i]));
292 vector<double*> parameter_blocks; local
295 i, range_readings[i], &odometry_values, &parameter_blocks);
296 problem.AddResidualBlock(range_cost_function, NULL, parameter_blocks);

Completed in 2804 milliseconds