Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched refs:num_observations (Results 1 - 8 of 8) sorted by null

/external/ceres-solver/examples/
bal_problem.h	71 int num_observations() const { return num_observations_; } function in class:ceres::examples::BALProblem
curve_fitting.c	52 int num_observations = 67; variable 168 for (i = 0; i < num_observations; ++i) {
simple_bundle_adjuster.cc	55 int num_observations() const { return num_observations_; } function in class:BALProblem 193 for (int i = 0; i < bal_problem.num_observations(); ++i) {
ellipse_approximation.cc	404 const int num_observations = kY.rows(); local 405 VectorXd t(num_observations); 406 for (int i = 0; i < num_observations; ++i) { 419 for (int i = 0; i < num_observations; ++i) {
bundle_adjuster.cc	256 // Observations is 2*num_observations long array observations = 261 for (int i = 0; i < bal_problem->num_observations(); ++i) {
nist.cc	236 int num_observations() const { return predictor_.rows(); } function in class:ceres::examples::NISTProblem 426 for (int i = 0; i < nist_problem.num_observations(); ++i) {
/external/ceres-solver/internal/ceres/
c_api_test.cc	39 int num_observations = 67; variable 144 for (int i = 0; i < num_observations; ++i) { 198 for (int i = 0; i < num_observations; ++i) {
system_test.cc	338 int num_observations() const { return num_observations_; } function in class:ceres::internal::BundleAdjustmentProblem 386 for (int i = 0; i < num_observations(); ++i) {

Completed in 143 milliseconds