/external/ceres-solver/examples/ |
helloworld.cc | 41 using ceres::Problem; 64 // Build the problem. 65 Problem problem; local 71 problem.AddResidualBlock(cost_function, NULL, &x); 77 Solve(options, &problem, &summary);
|
helloworld_numeric_diff.cc | 40 using ceres::Problem; 60 // Build the problem. 61 Problem problem; local 67 problem.AddResidualBlock(cost_function, NULL, &x); 73 Solve(options, &problem, &summary);
|
quadratic.cc | 41 using ceres::Problem; 75 // Build the problem. 76 Problem problem; local 78 problem.AddResidualBlock(new SimpleCostFunction, NULL, &x); 86 Solve(options, &problem, &summary);
|
quadratic_auto_diff.cc | 43 using ceres::Problem; 67 // Build the problem. 68 Problem problem; local 72 problem.AddResidualBlock( 84 Solve(options, &problem, &summary);
|
quadratic_numeric_diff.cc | 42 using ceres::Problem; 69 // Build the problem. 70 Problem problem; local 71 problem.AddResidualBlock(cost, NULL, &x); 79 Solve(options, &problem, &summary);
|
curve_fitting.c | 160 ceres_problem_t* problem; local 165 problem = ceres_create_problem(); 170 problem, 181 ceres_solve(problem); 182 ceres_free_problem(problem);
|
curve_fitting.cc | 36 using ceres::Problem; 143 Problem problem; local 145 problem.AddResidualBlock( 158 Solve(options, &problem, &summary);
|
data_fitting.cc | 36 using ceres::Problem; 145 Problem problem; local 147 problem.AddResidualBlock( 160 Solve(options, &problem, &summary);
|
helloworld_analytic_diff.cc | 41 using ceres::Problem; 69 // For this simple problem it is overkill to check if jacobians[0] 89 // Build the problem. 90 Problem problem; local 94 problem.AddResidualBlock(cost_function, NULL, &x); 100 Solve(options, &problem, &summary);
|
powell.cc | 54 using ceres::Problem; 110 Problem problem; local 111 // Add residual terms to the problem using the using the autodiff 114 problem.AddResidualBlock(new AutoDiffCostFunction<F1, 1, 1, 1>(new F1), 117 problem.AddResidualBlock(new AutoDiffCostFunction<F2, 1, 1, 1>(new F2), 120 problem.AddResidualBlock(new AutoDiffCostFunction<F3, 1, 1, 1>(new F3), 123 problem.AddResidualBlock(new AutoDiffCostFunction<F4, 1, 1, 1>(new F4), 145 Solve(options, &problem, &summary);
|
robust_curve_fitting.cc | 119 using ceres::Problem; 145 Problem problem; local 150 problem.AddResidualBlock(cost_function, NULL, &m, &c); 158 Solve(options, &problem, &summary);
|
bundle_adjuster.cc | 31 // An example of solving a dynamically sized problem with various 39 // The problem being solved here is known as a Bundle Adjustment 40 // problem in computer vision. Given a set of 3d points X_1, ..., X_n, 50 // The problem used here comes from a collection of bundle adjustment 246 void BuildProblem(BALProblem* bal_problem, Problem* problem) { 289 problem->AddResidualBlock(cost_function, 295 problem->AddResidualBlock(cost_function, loss_function, camera, point); 303 problem->SetParameterization(cameras + camera_block_size * i, 311 Problem problem local [all...] |
circle_fit.cc | 47 // There are closed form solutions [1] to this problem which you may want to 64 using ceres::Problem; 128 Problem problem; local 143 problem.AddResidualBlock(cost, loss, &x, &y, &m); 149 // Build and solve the problem. 154 Solve(options, &problem, &summary);
|
denoising.cc | 88 // Creates a Fields of Experts MAP inference problem. 91 Problem* problem, 100 problem->AddResidualBlock(cost_function, 129 problem->AddResidualBlock(cost_function[alpha_index], 137 // Solves the FoE problem using Ceres and post-processes it to make sure the 139 void SolveProblem(Problem* problem, PGMImage<double>* solution) { 157 ceres::Solve(options, problem, &summary); 209 ceres::Problem problem local [all...] |
nist.cc | 39 // The problem data themselves can be found at 44 // Medium and Hard. For each problem there are two starting guesses, 48 // A problem is considered successfully solved, if every components of 427 // Each NIST problem comes with multiple starting points, so we 428 // construct the problem from scratch for each case and solve it. 433 ceres::Problem problem; local 435 problem.AddResidualBlock( 444 Solve(options, &problem, &summary);
|
simple_bundle_adjuster.cc | 190 // Create residuals for each observation in the bundle adjustment problem. The 192 ceres::Problem problem; local 201 problem.AddResidualBlock(cost_function, 215 ceres::Solve(options, &problem, &summary);
|
/external/openssh/ |
auth-krb5.c | 61 krb5_error_code problem; local 64 problem = krb5_init_context(&authctxt->krb5_ctx); 65 if (problem) 66 return (problem); 78 krb5_error_code problem; local 89 problem = krb5_init(authctxt); 90 if (problem) 93 problem = krb5_parse_name(authctxt->krb5_ctx, client, 95 if (problem) 99 problem = krb5_cc_gen_new(authctxt->krb5_ctx, &krb5_mcc_ops, &ccache) [all...] |
gss-serv-krb5.c | 66 krb5_error_code problem; local 71 problem = krb5_init_context(&krb_context); 72 if (problem) { 119 krb5_error_code problem; local 133 if ((problem = krb5_cc_gen_new(krb_context, &krb5_fcc_ops, &ccache))) { 135 krb5_get_err_text(krb_context, problem)); 139 if ((problem = ssh_krb5_cc_gen(krb_context, &ccache))) { 141 krb5_get_err_text(krb_context, problem)); 146 if ((problem = krb5_parse_name(krb_context, 149 krb5_get_err_text(krb_context, problem)); [all...] |
/external/ceres-solver/internal/ceres/ |
c_api_test.cc | 143 ceres_problem_t* problem = ceres_create_problem(); local 146 problem, 157 ceres_solve(problem); 162 ceres_free_problem(problem); 197 ceres_problem_t* problem = ceres_create_problem(); local 200 problem, 211 ceres_solve(problem); 217 ceres_free_problem(problem);
|
c_api.cc | 42 #include "ceres/problem.h" 47 using ceres::Problem; 57 return reinterpret_cast<ceres_problem_t*>(new Problem); 60 void ceres_free_problem(ceres_problem_t* problem) { 61 delete reinterpret_cast<Problem*>(problem); 142 ceres_problem_t* problem, 151 Problem* ceres_problem = reinterpret_cast<Problem*>(problem); 175 Problem* problem = reinterpret_cast<Problem*>(c_problem); local [all...] |
evaluator_test.cc | 110 void EvaluateAndCompare(ProblemImpl *problem, 118 CreateEvaluator(problem->mutable_program())); 166 EvaluateAndCompare(&problem, 181 ProblemImpl problem; member in struct:ceres::internal::EvaluatorTest 190 problem.AddResidualBlock(new ParameterIgnoringCostFunction<1, 3, 2, 3, 4>, 218 problem.AddParameterBlock(x, 2); 219 problem.AddParameterBlock(y, 3); 220 problem.AddParameterBlock(z, 4); 226 // for a long time, since by chance most users added parameters to the problem 228 problem.AddResidualBlock(new ParameterIgnoringCostFunction<1, 3, 4, 3, 2> 564 ProblemImpl problem; local [all...] |
linear_least_squares_problems.cc | 60 LOG(FATAL) << "Unknown problem id requested " << id; 84 LinearLeastSquaresProblem* problem = new LinearLeastSquaresProblem; local 87 problem->b.reset(new double[3]); 88 problem->D.reset(new double[2]); 90 problem->x.reset(new double[2]); 91 problem->x_D.reset(new double[2]); 113 problem->A.reset(A); 115 problem->b[0] = 8; 116 problem->b[1] = 18; 117 problem->b[2] = -18 184 LinearLeastSquaresProblem* problem = new LinearLeastSquaresProblem; local 289 LinearLeastSquaresProblem* problem = new LinearLeastSquaresProblem; local 423 LinearLeastSquaresProblem* problem = new LinearLeastSquaresProblem; local [all...] |
/external/oauth/core/src/main/java/net/oauth/ |
SimpleOAuthValidator.java | 78 OAuthProblemException problem = new OAuthProblemException("version_rejected"); local 79 problem.setParameter("oauth_acceptable_versions", minVersion + "-" + maxVersion); 80 throw problem; 94 OAuthProblemException problem = new OAuthProblemException("timestamp_refused"); local 95 problem.setParameter("oauth_acceptable_timestamps", min + "-" + max); 96 throw problem;
|
OAuthMessage.java | 240 OAuthProblemException problem = new OAuthProblemException(OAuth.Problems.PARAMETER_ABSENT); local 241 problem.setParameter(OAuth.Problems.OAUTH_PARAMETERS_ABSENT, OAuth.percentEncode(absent)); 242 throw problem;
|
/external/e2fsprogs/e2fsck/ |
pass5.c | 14 #include "problem.h" 69 static void print_bitmap_problem(e2fsck_t ctx, int problem, 72 switch (problem) { 77 problem = PR_5_BLOCK_RANGE_UNUSED; 83 problem = PR_5_BLOCK_RANGE_USED; 89 problem = PR_5_INODE_RANGE_UNUSED; 95 problem = PR_5_INODE_RANGE_USED; 98 fix_problem(ctx, problem, pctx); 114 int problem, save_problem, fixit, had_problem; local 210 problem = PR_5_BLOCK_UNUSED 340 int problem, save_problem, fixit, had_problem; local [all...] |