| /external/ceres-solver/internal/ceres/ |
| problem_test.cc | 32 #include "ceres/problem.h"
109 TEST(Problem, AddResidualWithNullCostFunctionDies) {
112 Problem problem; local
113 problem.AddParameterBlock(x, 3);
114 problem.AddParameterBlock(y, 4);
115 problem.AddParameterBlock(z, 5);
117 EXPECT_DEATH_IF_SUPPORTED(problem.AddResidualBlock(NULL, NULL, x),
121 TEST(Problem, AddResidualWithIncorrectNumberOfParameterBlocksDies) {
124 Problem problem local
138 Problem problem; local
149 Problem problem; local
162 Problem problem; local
177 Problem problem; local
190 Problem problem; local
213 Problem problem; local
241 Problem problem; local
264 Problem problem; local
320 Problem problem; local
[all...] |
| solver_impl_test.cc | 77 ProblemImpl problem; local
82 problem.AddParameterBlock(&x, 1);
83 problem.AddParameterBlock(&y, 1);
84 problem.AddParameterBlock(&z, 1);
85 problem.AddResidualBlock(new UnaryCostFunction(), NULL, &x);
86 problem.AddResidualBlock(new BinaryCostFunction(), NULL, &x, &y);
87 problem.AddResidualBlock(new TernaryCostFunction(), NULL, &x, &y, &z);
96 Program program(*problem.mutable_program());
108 ProblemImpl problem; local
111 problem.AddParameterBlock(&x, 1)
130 ProblemImpl problem; local
157 ProblemImpl problem; local
188 ProblemImpl problem; local
220 ProblemImpl problem; local
260 ProblemImpl problem; local
316 ProblemImpl problem; local
390 ProblemImpl problem; local
447 ProblemImpl problem; local
469 ProblemImpl problem; local
784 ProblemImpl problem; local
[all...] |
| linear_least_squares_problems.cc | 62 LOG(FATAL) << "Unknown problem id requested " << id;
77 LinearLeastSquaresProblem* problem = new LinearLeastSquaresProblem; local
81 problem->A.reset(new BlockSparseMatrix(A));
83 problem->A.reset(new TripletSparseMatrix(A));
85 problem->A.reset(new CompressedRowSparseMatrix(A));
89 problem->b.reset(new double[problem_proto.b_size()]);
91 problem->b[i] = problem_proto.b(i);
96 problem->D.reset(new double[problem_proto.d_size()]);
98 problem->D[i] = problem_proto.d(i);
104 problem->x_D.reset(new double[problem_proto.x_size()])
154 LinearLeastSquaresProblem* problem = new LinearLeastSquaresProblem; local
254 LinearLeastSquaresProblem* problem = new LinearLeastSquaresProblem; local
359 LinearLeastSquaresProblem* problem = new LinearLeastSquaresProblem; local
493 LinearLeastSquaresProblem* problem = new LinearLeastSquaresProblem; local
[all...] |
| iterative_schur_complement_solver_test.cc | 62 scoped_ptr<LinearLeastSquaresProblem> problem(
65 CHECK_NOTNULL(problem.get());
66 A_.reset(down_cast<BlockSparseMatrix*>(problem->A.release()));
67 b_.reset(problem->b.release());
68 D_.reset(problem->D.release());
72 num_eliminate_blocks_ = problem->num_eliminate_blocks;
|
| evaluator_test.cc | 168 void EvaluateAndCompare(ProblemImpl *problem,
176 CreateEvaluator(problem->mutable_program()));
224 EvaluateAndCompare(&problem,
239 ProblemImpl problem; member in struct:ceres::internal::EvaluatorTest
248 problem.AddResidualBlock(new ParameterIgnoringCostFunction<1, 3, 2, 3, 4>,
276 problem.AddParameterBlock(x, 2);
277 problem.AddParameterBlock(y, 3);
278 problem.AddParameterBlock(z, 4);
284 // for a long time, since by chance most users added parameters to the problem
286 problem.AddResidualBlock(new ParameterIgnoringCostFunction<1, 3, 4, 3, 2>
622 ProblemImpl problem; local
[all...] |
| unsymmetric_linear_solver_test.cc | 48 scoped_ptr<LinearLeastSquaresProblem> problem(
51 CHECK_NOTNULL(problem.get());
52 A_.reset(down_cast<TripletSparseMatrix*>(problem->A.release()));
53 b_.reset(problem->b.release());
54 D_.reset(problem->D.release());
55 sol_unregularized_.reset(problem->x.release());
56 sol_regularized_.reset(problem->x_D.release());
|
| schur_eliminator_test.cc | 57 problem(CreateLinearLeastSquaresProblemFromId(id));
58 CHECK_NOTNULL(problem.get());
59 SetupHelper(problem.get());
64 problem(CreateLinearLeastSquaresProblemFromFile(filename));
65 CHECK_NOTNULL(problem.get());
66 SetupHelper(problem.get());
69 void SetupHelper(LinearLeastSquaresProblem* problem) {
70 A.reset(down_cast<BlockSparseMatrix*>(problem->A.release()));
71 b.reset(problem->b.release());
72 D.reset(problem->D.release())
[all...] |
| block_sparse_matrix_test.cc | 49 scoped_ptr<LinearLeastSquaresProblem> problem(
51 CHECK_NOTNULL(problem.get());
52 A_.reset(down_cast<BlockSparseMatrix*>(problem->A.release()));
54 problem.reset(CreateLinearLeastSquaresProblemFromId(1));
55 CHECK_NOTNULL(problem.get());
56 B_.reset(down_cast<TripletSparseMatrix*>(problem->A.release()));
|
| implicit_schur_complement_test.cc | 58 scoped_ptr<LinearLeastSquaresProblem> problem(
61 CHECK_NOTNULL(problem.get());
62 A_.reset(down_cast<BlockSparseMatrix*>(problem->A.release()));
63 b_.reset(problem->b.release());
64 D_.reset(problem->D.release());
68 num_eliminate_blocks_ = problem->num_eliminate_blocks;
|
| schur_complement_solver_test.cc | 50 scoped_ptr<LinearLeastSquaresProblem> problem(
53 CHECK_NOTNULL(problem.get());
54 A.reset(down_cast<BlockSparseMatrix*>(problem->A.release()));
55 b.reset(problem->b.release());
56 D.reset(problem->D.release());
60 num_eliminate_blocks = problem->num_eliminate_blocks;
|
| /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/examples/ |
| 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;
66 // Build the problem.
67 Problem problem; local
71 problem.AddResidualBlock(
83 Solve(options, &problem, &summary);
|
| quadratic_numeric_diff.cc | 43 using ceres::Problem;
77 // Build the problem.
78 Problem problem; local
79 problem.AddResidualBlock(cost, NULL, &x);
87 Solve(options, &problem, &summary);
|
| powell.cc | 54 using ceres::Problem;
111 Problem problem; local
112 // Add residual terms to the problem using the using the autodiff
115 problem.AddResidualBlock(new AutoDiffCostFunction<F1, 1, 1, 1>(new F1),
118 problem.AddResidualBlock(new AutoDiffCostFunction<F2, 1, 1, 1>(new F2),
121 problem.AddResidualBlock(new AutoDiffCostFunction<F3, 1, 1, 1>(new F3),
124 problem.AddResidualBlock(new AutoDiffCostFunction<F4, 1, 1, 1>(new F4),
142 Solve(options, &problem, &summary);
|
| denoising.cc | 86 // Creates a Fields of Experts MAP inference problem.
89 Problem* problem,
98 problem->AddResidualBlock(cost_function,
127 problem->AddResidualBlock(cost_function[alpha_index],
135 // Solves the FoE problem using Ceres and post-processes it to make sure the
137 void SolveProblem(Problem* problem, PGMImage<double>* solution) {
151 ceres::Solve(options, problem, &summary);
203 ceres::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);
|
| /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;
|
| OAuthProblemException.java | 25 * Describes an OAuth-related problem, using a set of named parameters. One
26 * parameter identifies the basic problem, and the others provide supplementary
29 * href="http://wiki.oauth.net/ProblemReporting">Problem Reporting
42 public OAuthProblemException(String problem) {
43 super(problem);
44 if (problem != null) {
45 parameters.put(OAUTH_PROBLEM, problem);
|
| /external/ceres-solver/docs/ |
| nnlsq.tex | 11 is a Non-linear least squares problem~\footnote{Ceres can solve a more general version of this problem, but for pedagogical reasons, we will restrict ourselves to this class of problems for now. See section~\ref{chapter:overview} for a full description of the problems that Ceres can solve}. Here $\|\cdot\|$ denotes the Euclidean norm of a vector.
13 Such optimization problems arise in almost every area of science and engineering. Whenever there is data to be analyzed, curves to be fitted, there is usually a linear or a non-linear least squares problem lurking in there somewhere.
15 Perhaps the simplest example of such a problem is the problem of Ordinary Linear Regression, where given observations $(x_1,y_1),\hdots, (x_k,y_k)$, we wish to find the line $y = mx + c$, that best explains $y$ as a function of $x$. One way to solve this problem is to find the solution to the following optimization problem
19 With a little bit of calculus, this problem can be solved easily by hand. But what if, instead of a line we were interested in a more complicated relationship between $x$ and $y$, say for example $y = e^{mx + c}$. Then the optimization problem becomes
23 This is a non-linear regression problem and solving it by hand is much more tedious. Ceres is designed to help you model and solve proble (…)
[all...] |
| helloworld.tex | 4 To get started, let us consider the problem of finding the minimum of the function
8 This is a trivial problem, whose minimum is easy to see is located at $x = 10$, but it is a good place to start to illustrate the basics of solving a problem with Ceres\footnote{Full working code for this and other examples in this manual can be found in the \texttt{examples} directory. Code for this example can be found in \texttt{examples/quadratic.cc}}.
11 Let us write this problem as a non-linear least squares problem by defining the scalar residual function $f_1(x) = 10 - x$. Then $F(x) = [f_1(x)]$ is a residual vector with exactly one component.
13 When solving a problem with Ceres, the first thing to do is to define a subclass of \texttt{CostFunction}. It is responsible for computing the value of the residual function and its derivative (also known as the Jacobian) with respect to $x$.
38 Once we have a way of computing the residual vector, it is now time to construct a Non-linear least squares problem using it and have Ceres solve it.
42 ceres::Problem problem;
44 // The problem object takes ownership of the newly allocate
[all...] |
| /frameworks/base/core/java/android/view/ |
| InputEventConsistencyVerifier.java | 24 * Logs a description of each problem detected.
26 * When a problem is detected, the event is tainted. This mechanism prevents the same
40 // The number of recent events to log when a problem is detected.
217 problem("ACTION_DOWN but key is already down and this event "
228 problem("ACTION_UP but key was not down.");
237 problem("Invalid action " + KeyEvent.actionToString(action)
269 problem("ACTION_DOWN but trackball is already down.");
279 problem("ACTION_UP but trackball is not down.");
291 problem("Invalid action " + MotionEvent.actionToString(action)
297 problem("Trackball is down but pressure is not greater than 0.")
656 private void problem(String message) { method in class:InputEventConsistencyVerifier
[all...] |
| /external/oauth/core/src/main/java/net/oauth/client/ |
| OAuthResponseMessage.java | 87 } catch (OAuthProblemException problem) {
88 problem.getParameters().putAll(getDump());
89 throw problem;
|
| /external/clang/test/Analysis/inlining/ |
| path-notes.cpp | 173 int problem = 1 / getZero(); // expected-warning {{Division by zero}} local
180 int problem = 1 / getZeroByRef(); // expected-warning {{Division by zero}} local
[all...] |
