HomeSort by relevance Sort by last modified time
    Searched refs:parameter_blocks (Results 1 - 25 of 38) sorted by null

1 2

  /external/ceres-solver/internal/ceres/
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...]
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...]
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...]
solver_impl_test.cc 98 EXPECT_EQ(&x, problem.program().parameter_blocks()[0]->state());
99 EXPECT_EQ(&y, problem.program().parameter_blocks()[1]->state());
100 EXPECT_EQ(&z, problem.program().parameter_blocks()[2]->state());
101 EXPECT_EQ(&w, problem.program().parameter_blocks()[3]->state());
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.h 74 const vector<ParameterBlock*>& parameter_blocks,
111 ParameterBlock* const* parameter_blocks() const { function in class:ceres::internal::ResidualBlock
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...]
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);
residual_block_utils.cc 58 const int parameter_block_size = block.parameter_blocks()[i]->Size();
93 const int parameter_block_size = block.parameter_blocks()[i]->Size();
129 const int parameter_block_size = block.parameter_blocks()[i]->Size();
block_evaluate_preparer.cc 69 if (!residual_block->parameter_blocks()[j]->IsConstant()) {
dynamic_numeric_diff_cost_function_test.cc 85 vector<double*> parameter_blocks(2);
86 parameter_blocks[0] = &param_block_0[0];
87 parameter_blocks[1] = &param_block_1[0];
88 EXPECT_TRUE(cost_function.Evaluate(&parameter_blocks[0],
116 vector<double*> parameter_blocks(2);
117 parameter_blocks[0] = &param_block_0[0];
118 parameter_blocks[1] = &param_block_1[0];
129 EXPECT_TRUE(cost_function.Evaluate(parameter_blocks.data(),
183 vector<double*> parameter_blocks(2);
184 parameter_blocks[0] = &param_block_0[0]
    [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);
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...]
dynamic_autodiff_cost_function_test.cc 85 vector<double*> parameter_blocks(2);
86 parameter_blocks[0] = &param_block_0[0];
87 parameter_blocks[1] = &param_block_1[0];
88 EXPECT_TRUE(cost_function.Evaluate(&parameter_blocks[0],
115 vector<double*> parameter_blocks(2);
116 parameter_blocks[0] = &param_block_0[0];
117 parameter_blocks[1] = &param_block_1[0];
128 EXPECT_TRUE(cost_function.Evaluate(parameter_blocks.data(),
182 vector<double*> parameter_blocks(2);
183 parameter_blocks[0] = &param_block_0[0]
    [all...]
scratch_evaluate_preparer.cc 67 residual_block->parameter_blocks()[j];
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...]
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];
problem.cc 48 const vector<double*>& parameter_blocks) {
51 parameter_blocks);
238 void Problem::GetParameterBlocks(vector<double*>* parameter_blocks) const {
239 problem_impl_->GetParameterBlocks(parameter_blocks);
249 vector<double*>* parameter_blocks) const {
251 parameter_blocks);
residual_block_test.cc 101 EXPECT_EQ(parameters[0], residual_block.parameter_blocks()[0]);
102 EXPECT_EQ(parameters[1], residual_block.parameter_blocks()[1]);
103 EXPECT_EQ(parameters[2], residual_block.parameter_blocks()[2]);
240 EXPECT_EQ(parameters[0], residual_block.parameter_blocks()[0]);
241 EXPECT_EQ(parameters[1], residual_block.parameter_blocks()[1]);
242 EXPECT_EQ(parameters[2], residual_block.parameter_blocks()[2]);
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...]
problem_impl.h 77 const vector<double*>& parameter_blocks);
153 void GetParameterBlocks(vector<double*>* parameter_blocks) const;
158 vector<double*>* parameter_blocks) const;
  /external/ceres-solver/include/ceres/
cost_function_to_functor.h 181 internal::FixedArray<const double*> parameter_blocks(2);
182 parameter_blocks[0] = x0;
183 parameter_blocks[1] = x1;
184 return cost_function_->Evaluate(parameter_blocks.get(), residuals, NULL);
201 internal::FixedArray<const double*> parameter_blocks(3);
202 parameter_blocks[0] = x0;
203 parameter_blocks[1] = x1;
204 parameter_blocks[2] = x2;
205 return cost_function_->Evaluate(parameter_blocks.get(), residuals, NULL);
223 internal::FixedArray<const double*> parameter_blocks(4)
    [all...]
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/
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 252 milliseconds

1 2