HomeSort by relevance Sort by last modified time
    Searched full:step_size (Results 1 - 25 of 32) sorted by null

1 2

  /external/ceres-solver/include/ceres/
dynamic_numeric_diff_cost_function.h 174 ParameterVector step_size = x.array().abs() * relative_step_size; local
177 // the mean step_size for the other dimensions.
178 double fallback_step_size = step_size.sum() / step_size.rows();
181 // relative step_size as absolute step_size and hope for the best.
188 if (step_size(j) == 0.0) {
190 // mean step_size from the other parameters. This can break in
193 step_size(j) = fallback_step_size;
195 x_plus_delta(j) = x(j) + step_size(j)
    [all...]
solver.h 230 // If during the line search, the step_size falls below this
241 // sufficiently. More precisely, we are looking for a step_size
244 // f(step_size) <= f(0) + sufficient_decrease * f'(0) * step_size
250 // new_step_size >= max_line_search_step_contraction * step_size
260 // new_step_size <= min_line_search_step_contraction * step_size
285 // is that we seek a step_size s.t.
287 // |f'(step_size)| <= sufficient_curvature_decrease * |f'(0)|
290 // of f w.r.t step_size (d f / d step_size)
    [all...]
iteration_callback.h 57 step_size(0.0),
129 double step_size; member in struct:ceres::IterationSummary
  /external/llvm/test/CodeGen/PowerPC/
ldtoc-inv.ll 8 define void @test(i32* nocapture %out, i32 zeroext %step_size) #0 {
10 %shl = shl i32 %step_size, 2
23 %shl1 = shl i32 %0, %step_size
  /external/ceres-solver/include/ceres/internal/
numeric_diff.h 122 ParameterVector step_size = x.array().abs() * relative_step_size; local
125 // the mean step_size for the other dimensions. If all the
129 (step_size.sum() == 0)
131 : step_size.sum() / step_size.rows();
139 (step_size(j) == 0.0) ? fallback_step_size : step_size(j);
  /external/ceres-solver/internal/ceres/
line_search.h 86 // sufficiently. More precisely, we are looking for a step_size
89 // f(step_size) <= f(0) + sufficient_decrease * f'(0) * step_size
94 // new_step_size >= max_step_contraction * step_size
104 // new_step_size <= min_step_contraction * step_size
111 // If during the line search, the step_size falls below this
127 // is that we seek a step_size s.t.
129 // |f'(step_size)| <= sufficient_curvature_decrease * |f'(0)|
132 // of f w.r.t step_size (d f / d step_size)
    [all...]
line_search_minimizer.h 56 step_size(0.0) {
65 double step_size; member in struct:ceres::internal::LineSearchMinimizer::State
line_search.cc 147 // Returns step_size \in [min_step_size, max_step_size] which minimizes the
213 double step_size = 0.0, unused_min_value = 0.0; local
215 &step_size, &unused_min_value);
216 return step_size;
233 // Note initial_cost & initial_gradient are evaluated at step_size = 0,
282 const double step_size = local
291 if (step_size * descent_direction_max_norm < options().min_step_size) {
293 StringPrintf("Line search failed: step_size too small: %.5e "
294 "with descent_direction_max_norm: %.5e.", step_size,
301 current.x = step_size;
597 const double step_size = local
    [all...]
callbacks.cc 75 summary.step_size,
line_search_minimizer.cc 328 current_state.step_size = line_search_summary.optimal_step_size;
329 delta = current_state.step_size * current_state.search_direction;
365 iteration_summary.step_size = current_state.step_size;
line_search_direction.cc 120 previous.search_direction * previous.step_size,
174 const Vector delta_x = previous.search_direction * previous.step_size;
  /packages/apps/Camera2/src/com/android/camera/util/
Gusterpolator.java 60 private static final float STEP_SIZE = 1.0f / (VALUES.length - 1);
76 float quantized = position * STEP_SIZE;
78 float weight = difference / STEP_SIZE;
  /external/v8/src/heap/
gc-idle-time-handler-unittest.cc 54 size_t step_size = GCIdleTimeHandler::EstimateMarkingStepSize(1, 0); local
58 step_size); local
64 size_t step_size = GCIdleTimeHandler::EstimateMarkingStepSize( local
68 step_size); local
73 size_t step_size = GCIdleTimeHandler::EstimateMarkingStepSize( local
76 step_size); local
81 size_t step_size = GCIdleTimeHandler::EstimateMarkingStepSize( local
84 step_size); local
gc-idle-time-handler.h 39 static GCIdleTimeAction IncrementalMarking(intptr_t step_size) {
42 result.parameter = step_size;
gc-idle-time-handler.cc 169 size_t step_size = EstimateMarkingStepSize( local
171 return GCIdleTimeAction::IncrementalMarking(step_size);
  /build/tools/releasetools/
test_common.py 25 def random_string_with_holes(size, block_size, step_size):
27 for begin in range(0, size, step_size):
39 step_size = 4 * megabytes
41 size, block_size, step_size)
  /external/speex/include/speex/
speex_jitter.h 119 * @param step_size Starting value for the size of concleanment packets and delay
124 JitterBuffer *jitter_buffer_init(int step_size);
  /external/webp/src/enc/
filter.c 234 const int step_size = (delta_max - delta_min >= 4) ? 4 : 1; local
249 for (d = delta_min; d <= delta_max; d += step_size) {
  /pdk/apps/TestingCamera2/src/com/android/testingcamera2/v1/
TestingCamera2.java 79 private static final int STEP_SIZE = 100;
537 curSensitivity = (curSensitivity / STEP_SIZE ) * STEP_SIZE;
  /external/speex/libspeex/
jitter.c 272 EXPORT JitterBuffer *jitter_buffer_init(int step_size)
281 jitter->delay_step = step_size;
282 jitter->concealment_size = step_size;
  /art/runtime/
debugger.h 94 SingleStepControl(JDWP::JdwpStepSize step_size, JDWP::JdwpStepDepth step_depth,
96 : step_size_(step_size), step_depth_(step_depth),
    [all...]
  /external/ceres-solver/docs/source/
solving.rst     [all...]
  /hardware/qcom/media/mm-video-v4l2/vidc/venc/src/
video_encoder_device.cpp 615 unsigned long *max, unsigned long *step_size)
629 *step_size = cap_ltr_count.step_size;
630 DEBUG_PRINT_HIGH("LTR Capability: min=%x, max=%d, step_size=%d",
631 *min, *max, *step_size);
    [all...]
omx_video_encoder.cpp     [all...]
  /hardware/qcom/msm8x74/kernel-headers/linux/
msm_vidc_enc.h 290 unsigned long step_size; member in struct:venc_range

Completed in 1284 milliseconds

1 2