Searched refs:radius_ (Results 1 - 6 of 6) sorted by relevance

/external/ceres-solver/internal/ceres/
H A Dlevenberg_marquardt_strategy.cc50 radius_(options.initial_radius),
86 lm_diagonal_ = (diagonal_ / radius_).array().sqrt();
145 radius_ = radius_ / std::max(1.0 / 3.0,
147 radius_ = std::min(max_radius_, radius_);
153 radius_ = radius_ / decrease_factor_;
159 return radius_;
H A Ddogleg_strategy.cc54 radius_(options.initial_radius),
119 // || D * step || <= radius_ .
205 if (gauss_newton_norm <= radius_) {
210 << " radius: " << radius_; local
217 if (gradient_norm * alpha_ >= radius_) {
218 dogleg_step = -(radius_ / gradient_norm) * gradient_;
219 dogleg_step_norm_ = radius_;
222 << " radius: " << radius_; local
242 (pow(radius_, 2.0) - a_squared_norm));
247 : (radius_ * radius
253 << " radius: " << radius_; local
284 << " radius: " << radius_; local
314 << " radius: " << radius_; local
364 << " radius: " << radius_; local
[all...]
H A Dlevenberg_marquardt_strategy.h71 double radius_; member in class:ceres::internal::LevenbergMarquardtStrategy
81 Vector lm_diagonal_; // lm_diagonal_ = diagonal_ / radius_;
H A Ddogleg_strategy.h98 double radius_; member in class:ceres::internal::DoglegStrategy
/external/chromium_org/third_party/libwebp/utils/
H A Dquant_levels_dec.c51 int radius_; // filter radius (=delay) member in struct:__anon13301
113 const int r = p->radius_;
238 p->radius_ = radius;
270 if (p.row_ >= p.radius_) {
/external/webp/src/utils/
H A Dquant_levels_dec.c51 int radius_; // filter radius (=delay) member in struct:__anon33398
113 const int r = p->radius_;
238 p->radius_ = radius;
270 if (p.row_ >= p.radius_) {

Completed in 162 milliseconds