Searched refs:ceres (Results 51 - 75 of 339) sorted by relevance

1234567891011>>

/external/ceres-solver/examples/
H A Dhelloworld_analytic_diff.cc3 // http://code.google.com/p/ceres-solver/
36 #include "ceres/ceres.h"
39 using ceres::CostFunction;
40 using ceres::SizedCostFunction;
41 using ceres::Problem;
42 using ceres::Solver;
43 using ceres::Solve;
H A Dcircle_fit.cc3 // http://code.google.com/p/ceres-solver/
56 #include "ceres/ceres.h"
60 using ceres::AutoDiffCostFunction;
61 using ceres::CauchyLoss;
62 using ceres::CostFunction;
63 using ceres::LossFunction;
64 using ceres::Problem;
65 using ceres::Solve;
66 using ceres
[all...]
H A Dpowell.cc3 // http://code.google.com/p/ceres-solver/
48 #include "ceres/ceres.h"
52 using ceres::AutoDiffCostFunction;
53 using ceres::CostFunction;
54 using ceres::Problem;
55 using ceres::Solver;
56 using ceres::Solve;
128 LOG_IF(FATAL, !ceres::StringToMinimizerType(FLAGS_minimizer,
134 options.linear_solver_type = ceres
[all...]
H A Dfields_of_experts.h3 // http://code.google.com/p/ceres-solver/
50 #include "ceres/loss_function.h"
51 #include "ceres/cost_function.h"
52 #include "ceres/sized_cost_function.h"
56 namespace ceres { namespace
62 class FieldsOfExpertsCost : public ceres::CostFunction {
79 class FieldsOfExpertsLoss : public ceres::LossFunction {
116 ceres::CostFunction* NewCostFunction(int alpha_index) const;
119 ceres::LossFunction* NewLossFunction(int alpha_index) const;
143 } // namespace ceres
[all...]
H A Ddenoising.cc3 // http://code.google.com/p/ceres-solver/
48 #include "ceres/ceres.h"
63 namespace ceres { namespace
70 class QuadraticCostFunction : public ceres::SizedCostFunction<1, 1> {
97 ceres::CostFunction* cost_function =
107 std::vector<ceres::LossFunction*> loss_function(foe.NumFilters());
108 std::vector<ceres::CostFunction*> cost_function(foe.NumFilters());
140 // These parameters may be experimented with. For example, ceres::DOGLEG tends
143 ceres
[all...]
H A Drobot_pose_mle.cc3 // http://code.google.com/p/ceres-solver/
132 #include "ceres/ceres.h"
133 #include "ceres/dynamic_autodiff_cost_function.h"
138 using ceres::AutoDiffCostFunction;
139 using ceres::DynamicAutoDiffCostFunction;
140 using ceres::CauchyLoss;
141 using ceres::CostFunction;
142 using ceres::LossFunction;
143 using ceres
[all...]
/external/ceres-solver/include/ceres/
H A Dcrs_matrix.h3 // http://code.google.com/p/ceres-solver/
35 #include "ceres/internal/port.h"
36 #include "ceres/internal/disable_warnings.h"
38 namespace ceres { namespace
82 } // namespace ceres
84 #include "ceres/internal/reenable_warnings.h"
H A Dnormal_prior.h3 // http://code.google.com/p/ceres-solver/
37 #include "ceres/cost_function.h"
38 #include "ceres/internal/eigen.h"
39 #include "ceres/internal/disable_warnings.h"
41 namespace ceres { namespace
74 } // namespace ceres
76 #include "ceres/internal/reenable_warnings.h"
/external/ceres-solver/internal/ceres/
H A Dblas.h3 // http://code.google.com/p/ceres-solver/
36 namespace ceres { namespace
55 } // namespace ceres
H A Dblock_structure.cc3 // http://code.google.com/p/ceres-solver/
31 #include "ceres/block_structure.h"
33 namespace ceres { namespace
44 } // namespace ceres
H A Ddynamic_compressed_row_finalizer.h3 // http://code.google.com/p/ceres-solver/
34 #include "ceres/casts.h"
35 #include "ceres/dynamic_compressed_row_sparse_matrix.h"
37 namespace ceres { namespace
49 } // namespace ceres
H A Dsingle_linkage_clustering.h3 // http://code.google.com/p/ceres-solver/
35 #include "ceres/internal/port.h"
39 #include "ceres/collections_port.h"
40 #include "ceres/graph.h"
42 namespace ceres { namespace
71 } // namespace ceres
H A Darray_utils.h3 // http://code.google.com/p/ceres-solver/
46 #include "ceres/internal/port.h"
48 namespace ceres { namespace
86 } // namespace ceres
H A Dblock_evaluate_preparer.h3 // http://code.google.com/p/ceres-solver/
39 #include "ceres/scratch_evaluate_preparer.h"
41 namespace ceres { namespace
75 } // namespace ceres
H A Dcanonical_views_clustering.h3 // http://code.google.com/p/ceres-solver/
45 #include "ceres/internal/port.h"
51 #include "ceres/collections_port.h"
52 #include "ceres/graph.h"
54 namespace ceres { namespace
133 } // namespace ceres
H A Dcorrector.h3 // http://code.google.com/p/ceres-solver/
38 namespace ceres { namespace
88 } // namespace ceres
H A Ddynamic_compressed_row_sparse_matrix.h3 // http://code.google.com/p/ceres-solver/
44 #include "ceres/compressed_row_sparse_matrix.h"
46 namespace ceres { namespace
97 } // namespace ceres
H A Devaluator_test_utils.h3 // http://code.google.com/p/ceres-solver/
34 namespace ceres { namespace
60 } // namespace ceres
H A Dfile.h3 // http://code.google.com/p/ceres-solver/
37 #include "ceres/internal/port.h"
39 namespace ceres { namespace
50 } // namespace ceres
H A Dgradient_checking_cost_function.h3 // http://code.google.com/p/ceres-solver/
36 #include "ceres/cost_function.h"
38 namespace ceres { namespace
83 } // namespace ceres
H A Dincomplete_lq_factorization.h3 // http://code.google.com/p/ceres-solver/
36 #include "ceres/compressed_row_sparse_matrix.h"
38 namespace ceres { namespace
88 } // namespace ceres
H A Dlapack.h3 // http://code.google.com/p/ceres-solver/
35 #include "ceres/internal/port.h"
36 #include "ceres/linear_solver.h"
38 namespace ceres { namespace
98 } // namespace ceres
H A Dlinear_operator.h3 // http://code.google.com/p/ceres-solver/
36 #include "ceres/types.h"
38 namespace ceres { namespace
57 } // namespace ceres
H A Dresidual_block_utils.h3 // http://code.google.com/p/ceres-solver/
47 #include "ceres/internal/port.h"
49 namespace ceres { namespace
78 } // namespace ceres
/external/ceres-solver/scripts/
H A Dmake_release5 # http://code.google.com/p/ceres-solver/
41 TMP="/tmp/ceres-solver-$1"
42 DOCS_TMP="/tmp/ceres-solver-docs-$1"
49 VERSION_IN_HEADER=$(grep '#define CERES_VERSION' include/ceres/ceres.h | \
52 include/ceres/ceres.h | \
54 VERSION_IN_SPEC=$(grep '^Version:' scripts/ceres-solver.spec | \
66 echo "ERROR: CERES_VERSION version from include/ceres/ceres
[all...]

Completed in 5764 milliseconds

1234567891011>>