| /external/ceres-solver/internal/ceres/ |
| runtime_numeric_diff_cost_function.cc | 54 double** jacobians) {
66 Map<JacobianMatrix> parameter_jacobian(jacobians[parameter_block],
148 double** jacobians) const {
155 if (!jacobians) {
181 if (!jacobians[block]) {
192 jacobians)) {
|
| numeric_diff_test_utils.cc | 66 double *jacobians[2] = { &dydx1[0], &dydx2[0] }; local
72 &jacobians[0]));
136 double *jacobians[2] = { &dydx1[0], &dydx2[0] }; local
142 &jacobians[0]));
|
| dense_jacobian_writer.h | 57 // functions, use scratch space to store the jacobians temporarily then copy
71 double **jacobians,
82 // Now copy the jacobians for each parameter into the dense jacobian matrix.
92 ConstMatrixRef parameter_jacobian(jacobians[j],
|
| residual_block_test.cc | 57 double** jacobians) const {
61 if (jacobians) {
63 if (jacobians[k] != NULL) {
64 MatrixRef jacobian(jacobians[k],
172 double** jacobians) const {
176 if (jacobians) {
178 // The jacobians here are full sized, but they are transformed in the
181 // from these jacobians. Put values in the jacobian that make this
182 // obvious; in particular, make the jacobians like this:
188 if (jacobians[k] != NULL)
[all...] |
| autodiff_test.cc | 196 double *jacobians[] = { J_PX }; local
198 b, parameters, 2, ad_x1, jacobians)));
211 double *jacobians[] = { J_P, J_X }; local
213 b, parameters, 2, ad_x2, jacobians)));
219 // Now compare the jacobians we got.
318 double *jacobians[] = { J_q, J_c, J_X }; local
320 b, parameters, 2, ad_x, jacobians)));
358 double *jacobians[] = { J_x }; local
370 functor, parameters, num_residuals, residuals, jacobians)));
520 double* jacobians[10] local
[all...] |
| normal_prior_test.cc | 81 // Compare the jacobians
107 double* jacobians[1]; local
108 jacobians[0] = NULL;
113 prior.Evaluate(&x, residuals.data(), jacobians);
|
| residual_block.h | 78 // components in *residuals, and the jacobians between the parameters and
79 // residuals in jacobians[i], in row-major order. If residuals is NULL, the
80 // residuals are not computed. If jacobians is NULL, no jacobians are
81 // computed. If jacobians[i] is NULL, then the jacobian for that parameter is
92 // The returned cost and jacobians have had robustification and local
102 double** jacobians,
|
| evaluator_test.cc | 62 double** jacobians) const {
66 if (jacobians) {
68 // The jacobians here are full sized, but they are transformed in the
71 // from these jacobians. Put values in the jacobian that make this
72 // obvious; in particular, make the jacobians like this:
79 // between Jacobians of different residuals for the same parameter.
80 if (jacobians[k] != NULL) {
81 MatrixRef jacobian(jacobians[k],
544 double** jacobians) const {
550 if (jacobians != NULL)
[all...] |
| trust_region_minimizer_test.cc | 319 double** jacobians) const {
332 if (jacobians == NULL) {
337 if (jacobians[i] != NULL) {
354 jacobians[i][dim] = 0.;
357 jacobians[i][dim] -= u[dim] / norm_u;
361 jacobians[i][dim] += v[dim] / norm_v;
|
| c_api.cc | 85 double** jacobians) const {
89 jacobians);
|
| gradient_checking_cost_function.cc | 101 double** jacobians) const {
102 if (!jacobians) {
109 // Make space for the jacobians of the two methods.
141 // Accumulate the error message for all the jacobians, since it won't get
145 // Copy the original jacobian blocks into the jacobians array.
146 if (jacobians[k] != NULL) {
147 MatrixRef(jacobians[k],
|
| covariance_test.cc | 137 double** jacobians) const {
142 if (jacobians == NULL) {
146 if (jacobians[0] != NULL) {
147 copy(jacobian_.begin(), jacobian_.end(), jacobians[0]);
176 double** jacobians) const {
181 if (jacobians == NULL) {
185 if (jacobians[0] != NULL) {
186 copy(jacobian1_.begin(), jacobian1_.end(), jacobians[0]);
189 if (jacobians[1] != NULL) {
190 copy(jacobian2_.begin(), jacobian2_.end(), jacobians[1])
[all...] |
| compressed_row_jacobian_writer.cc | 157 double **jacobians,
202 jacobians[argument] + r * parameter_block_size;
|
| cost_function_to_functor_test.cc | 64 scoped_array<double> jacobians(new double[num_parameters * num_residuals]);
80 jacobian_blocks[i] = jacobians.get() + num_parameters * num_residuals;
108 EXPECT_NEAR(jacobians[i], actual_jacobians[i], kTolerance)
110 << jacobians[i] << " " << actual_jacobians[i];
|
| numeric_diff_cost_function_test.cc | 157 double** jacobians) const {
|
| problem_test.cc | 67 double** jacobians) const {
88 double** jacobians) const {
111 double** jacobians) const {
315 double** jacobians) const {
795 double** jacobians) const {
803 if (jacobians == NULL) {
808 if (jacobians[j] != NULL) {
809 MatrixRef(jacobians[j], kNumResiduals, kNumResiduals) =
[all...] |
| parameter_block_ordering_test.cc | 55 double** jacobians) const {
|
| schur_ordering_test.cc | 55 double** jacobians) const {
|
| solver_impl_test.cc | 50 double** jacobians) const {
52 if (jacobians != NULL && jacobians[0] != NULL) {
53 jacobians[0][0] = 1.0;
66 double** jacobians) const {
[all...] |
| /external/ceres-solver/examples/ |
| fields_of_experts.cc | 56 double** jacobians) const {
63 if (jacobians != NULL) {
65 if (jacobians[i] != NULL) {
66 jacobians[i][0] = filter_[i];
|
| denoising.cc | 76 double** jacobians) const {
79 if (jacobians != NULL && jacobians[0] != NULL) {
80 jacobians[0][0] = sqrta_;
|
| fields_of_experts.h | 69 double** jacobians) const;
|
| /external/ceres-solver/include/ceres/ |
| c_api.h | 56 double** jacobians);
|
| numeric_diff_cost_function.h | 32 // Create CostFunctions as needed by the least squares framework with jacobians
200 double** jacobians) const {
219 if (!jacobians) {
257 if (N ## block && jacobians[block] != NULL) { \
268 jacobians[block])) { \
|
| /external/ceres-solver/include/ceres/internal/ |
| autodiff.h | 138 // the Jacobian parameters, meaning that those Jacobians will not be computed.
213 T **jacobians) {
291 if (jacobians[i]) { \
296 jacobians[i]); \
|
