| /external/ceres-solver/internal/ceres/ |
| H A D | blas.cc | 3 // http://code.google.com/p/ceres-solver/
31 #include "ceres/blas.h"
32 #include "ceres/internal/port.h"
46 namespace ceres { namespace
79 } // namespace ceres
|
| H A D | block_evaluate_preparer.cc | 3 // http://code.google.com/p/ceres-solver/
31 #include "ceres/block_evaluate_preparer.h"
34 #include "ceres/block_sparse_matrix.h"
35 #include "ceres/casts.h"
36 #include "ceres/parameter_block.h"
37 #include "ceres/residual_block.h"
38 #include "ceres/sparse_matrix.h"
40 namespace ceres { namespace
83 } // namespace ceres
|
| H A D | block_jacobi_preconditioner.h | 3 // http://code.google.com/p/ceres-solver/
35 #include "ceres/preconditioner.h"
37 namespace ceres { namespace
78 } // namespace ceres
|
| H A D | block_random_access_dense_matrix.h | 3 // http://code.google.com/p/ceres-solver/
34 #include "ceres/block_random_access_matrix.h"
38 #include "ceres/internal/macros.h"
39 #include "ceres/internal/port.h"
40 #include "ceres/internal/scoped_ptr.h"
42 namespace ceres { namespace
96 } // namespace ceres
|
| H A D | callbacks.h | 3 // http://code.google.com/p/ceres-solver/
35 #include "ceres/iteration_callback.h"
36 #include "ceres/internal/port.h"
38 namespace ceres { namespace
69 } // namespace ceres
|
| H A D | compressed_row_jacobian_writer.h | 3 // http://code.google.com/p/ceres-solver/
36 #include "ceres/evaluator.h"
37 #include "ceres/scratch_evaluate_preparer.h"
39 namespace ceres { namespace
107 } // namespace ceres
|
| H A D | dense_normal_cholesky_solver.h | 3 // http://code.google.com/p/ceres-solver/
37 #include "ceres/linear_solver.h"
38 #include "ceres/internal/macros.h"
40 namespace ceres { namespace
105 } // namespace ceres
|
| H A D | evaluator.cc | 3 // http://code.google.com/p/ceres-solver/
32 #include "ceres/block_evaluate_preparer.h"
33 #include "ceres/block_jacobian_writer.h"
34 #include "ceres/compressed_row_jacobian_writer.h"
35 #include "ceres/compressed_row_sparse_matrix.h"
36 #include "ceres/crs_matrix.h"
37 #include "ceres/dense_jacobian_writer.h"
38 #include "ceres/dynamic_compressed_row_finalizer.h"
39 #include "ceres/dynamic_compressed_row_jacobian_writer.h"
40 #include "ceres/evaluato
46 namespace ceres { namespace
[all...] |
| H A D | iterative_schur_complement_solver.h | 3 // http://code.google.com/p/ceres-solver/
34 #include "ceres/linear_solver.h"
35 #include "ceres/internal/eigen.h"
36 #include "ceres/internal/scoped_ptr.h"
37 #include "ceres/types.h"
39 namespace ceres { namespace
90 } // namespace ceres
|
| H A D | levenberg_marquardt_strategy.h | 3 // http://code.google.com/p/ceres-solver/
34 #include "ceres/internal/eigen.h"
35 #include "ceres/trust_region_strategy.h"
37 namespace ceres { namespace
85 } // namespace ceres
|
| H A D | line_search_direction.h | 3 // http://code.google.com/p/ceres-solver/
34 #include "ceres/internal/eigen.h"
35 #include "ceres/line_search_minimizer.h"
36 #include "ceres/types.h"
38 namespace ceres { namespace
70 } // namespace ceres
|
| H A D | line_search_minimizer.h | 3 // http://code.google.com/p/ceres-solver/
34 #include "ceres/minimizer.h"
35 #include "ceres/solver.h"
36 #include "ceres/types.h"
37 #include "ceres/internal/eigen.h"
40 namespace ceres { namespace
75 } // namespace ceres
|
| H A D | linear_least_squares_problems.h | 3 // http://code.google.com/p/ceres-solver/
36 #include "ceres/sparse_matrix.h"
37 #include "ceres/internal/port.h"
38 #include "ceres/internal/scoped_ptr.h"
40 namespace ceres { namespace
82 } // namespace ceres
|
| H A D | low_rank_inverse_hessian.h | 3 // http://code.google.com/p/ceres-solver/
39 #include "ceres/internal/eigen.h"
40 #include "ceres/linear_operator.h"
42 namespace ceres { namespace
106 } // namespace ceres
|
| H A D | preconditioner.cc | 3 // http://code.google.com/p/ceres-solver/
31 #include "ceres/preconditioner.h"
34 namespace ceres { namespace
73 } // namespace ceres
|
| H A D | random.h | 3 // http://code.google.com/p/ceres-solver/
37 #include "ceres/internal/port.h"
39 namespace ceres { namespace
68 } // namespace ceres
|
| H A D | reorder_program.h | 3 // http://code.google.com/p/ceres-solver/
35 #include "ceres/internal/port.h"
36 #include "ceres/parameter_block_ordering.h"
37 #include "ceres/problem_impl.h"
38 #include "ceres/types.h"
40 namespace ceres { namespace
99 } // namespace ceres
|
| H A D | sparse_matrix.h | 3 // http://code.google.com/p/ceres-solver/
37 #include "ceres/linear_operator.h"
38 #include "ceres/internal/eigen.h"
39 #include "ceres/types.h"
41 namespace ceres { namespace
105 } // namespace ceres
|
| H A D | stringprintf.h | 3 // http://code.google.com/p/ceres-solver/
44 #include "ceres/internal/port.h"
46 namespace ceres { namespace
87 } // namespace ceres
|
| /external/ceres-solver/examples/ |
| H A D | ellipse_approximation.cc | 3 // http://code.google.com/p/ceres-solver/
40 #include "ceres/ceres.h"
270 ceres::ConstMatrixRef kY(kYData, kYRows, kYCols);
272 class PointToLineSegmentContourCostFunction : public ceres::CostFunction {
312 ceres::MatrixRef(jacobians[i + 1], 2, 2).setZero();
325 static ceres::CostFunction* Create(const int num_segments,
350 static ceres::CostFunction* Create(const double& sqrt_weight) {
351 return new ceres::AutoDiffCostFunction<EuclideanDistanceFunctor, 2, 2, 2>(
359 bool SolveWithFullReport(ceres
[all...] |
| H A D | fields_of_experts.cc | 3 // http://code.google.com/p/ceres-solver/
41 namespace ceres { namespace
142 ceres::CostFunction* FieldsOfExperts::NewCostFunction(int alpha_index) const {
146 ceres::LossFunction* FieldsOfExperts::NewLossFunction(int alpha_index) const {
152 } // namespace ceres
|
| H A D | bal_problem.h | 3 // http://code.google.com/p/ceres-solver/
42 namespace ceres { namespace
105 } // namespace ceres
|
| H A D | nist.cc | 3 // http://code.google.com/p/ceres-solver/
77 #include "ceres/ceres.h"
119 namespace ceres { namespace
408 const ceres::Solver::Options& options) {
425 ceres::Problem problem;
428 new ceres::AutoDiffCostFunction<Model, num_residuals, num_parameters>(
435 ceres::Solver::Summary summary;
475 void SetMinimizerOptions(ceres::Solver::Options* options) {
476 CHECK(ceres
[all...] |
| /external/ceres-solver/include/ceres/ |
| H A D | fpclassify.h | 3 // http://code.google.com/p/ceres-solver/
46 namespace ceres { namespace
85 } // namespace ceres
|
| H A D | iteration_callback.h | 3 // http://code.google.com/p/ceres-solver/
38 #include "ceres/types.h"
39 #include "ceres/internal/disable_warnings.h"
41 namespace ceres { namespace
221 } // namespace ceres
223 #include "ceres/internal/reenable_warnings.h"
|