HomeSort by relevance Sort by last modified time
    Searched full:adjustment (Results 126 - 150 of 615) sorted by null

1 2 3 4 56 7 8 91011>>

  /external/llvm/include/llvm/CodeGen/
RegisterScavenging.h 117 /// adjustment due to call frame, it's passed along to eliminateFrameIndex().
  /external/llvm/test/CodeGen/Thumb2/
aligned-spill.ll 31 ; Stack pointer adjustment for the stack frame contents.
  /external/qemu/distrib/sdl-1.2.15/docs/html/
sdlmixaudio.html 130 adjustment, and overflow clipping. The <TT
  /external/skia/src/sfnt/
SkOTUtils.cpp 149 // Update the checksum adjustment in the head table.
  /external/sonivox/arm-hybrid-22k/lib_src/
ARM-E_interpolate_noloop_gnu.s 89 @ This section performs a gain adjustment of -12dB for 16-bit samples
  /external/sonivox/arm-wt-22k/lib_src/
ARM-E_interpolate_noloop_gnu.s 89 @ This section performs a gain adjustment of -12dB for 16-bit samples
  /external/speex/include/speex/
speex_jitter.h 120 adjustment steps. Can be changed at any time using JITTER_BUFFER_SET_DELAY_STEP
  /frameworks/av/media/libeffects/lvm/lib/SpectrumAnalyzer/src/
LVPSA_QPD_Process.c 158 /* Adjustment for 11025Hz input, 220,5 is normally
  /frameworks/av/media/libstagefright/codecs/m4v_h263/enc/src/
rate_control.h 71 Int Qdep; /* smooth Q adjustment */
  /frameworks/base/core/java/com/android/internal/widget/
TextProgressBar.java 155 // Calculate any adjustment based on gravity
  /frameworks/base/docs/html/training/keyboard-input/
visibility.jd 116 <p>You can combine the adjustment specification with the <a
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/research/
Replayer.java 83 // The adjustment needed to translate times from the original recorded time to the current
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/
taskstats.h 93 * Uses time intervals seen by the kernel i.e. no adjustment
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/sys/
time.h 85 of time adjustment remaining to be done from the last `adjtime' call.
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/linux/
taskstats.h 93 * Uses time intervals seen by the kernel i.e. no adjustment
  /prebuilts/gcc/linux-x86/host/i686-linux-glibc2.7-4.6/sysroot/usr/include/sys/
time.h 85 of time adjustment remaining to be done from the last `adjtime' call.
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/linux/
taskstats.h 93 * Uses time intervals seen by the kernel i.e. no adjustment
  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.7-4.6/sysroot/usr/include/sys/
time.h 85 of time adjustment remaining to be done from the last `adjtime' call.
  /system/core/libcorkscrew/arch-mips/
backtrace-mips.c 110 ALOGV("@0x%08x: found stack adjustment=%d\n", addr, stack_size);
  /frameworks/base/services/java/com/android/server/power/
DisplayPowerController.java 81 // If true, enables the use of the screen auto-brightness adjustment setting.
85 // The maximum range of gamma adjustment possible using the screen
86 // auto-brightness adjustment setting.
92 // If true, enables the use of the current time as an auto-brightness adjustment.
100 // Specifies the maximum magnitude of the time of day adjustment.
105 // threshold of perceptibility and so that the adjustment has maximum effect
208 // The auto-brightness spline adjustment.
    [all...]
  /external/harfbuzz_ng/src/hb-old/
harfbuzz-shaper.cpp 923 HB_Fixed adjustment = positions[i].x_advance; local
926 adjustment = HB_FIXED_ROUND(adjustment);
929 ; //advances[i] = adjustment;
931 advances[i] += adjustment;
    [all...]
  /external/ceres-solver/docs/
solving.tex 259 While it is possible to use \texttt{SPARSE\_NORMAL\_CHOLESKY} to solve bundle adjustment problems, bundle adjustment problem have a special structure, and a more efficient scheme for solving~\eqref{eq:normal} can be constructed.
263 A key characteristic of the bundle adjustment problem is that there is no term $f_{i}$ that includes two or more point blocks. This in turn implies that the matrix $H$ is of the form
319 allow bundle adjustment algorithms to significantly scale up over those based on dense
330 Another option for bundle adjustment problems is to apply PCG to the reduced camera matrix $S$ instead of $H$. One reason to do this is that $S$ is a much smaller matrix than $H$, but more importantly, it can be shown that $\kappa(S)\leq \kappa(H)$. Ceres implements PCG on $S$ as the \texttt{ITERATIVE\_SCHUR} solver. When the user chooses \texttt{ITERATIVE\_SCHUR} as the linear solver, Ceres automatically switches from the exact step algorithm to an inexact step algorithm.
342 Equation~\eqref{eq:schurtrick1} is closely related to {\em Domain Decomposition methods} for solving large linear systems that arise in structural engineering and partial differential equations. In the language of Domain Decomposition, each point in a bundle adjustment problem is a domain, and the cameras form the interface between these domains. The iterative solution of the Schur complement then falls within the sub-category of techniques known as Iterative Sub-structuring~\cite{saad2003iterative,mathew2008domain}.
345 The convergence rate of Conjugate Gradients for solving~\eqref{eq:normal} depends on the distribution of eigenvalues of $H$~\cite{saad2003iterative}. A useful upper bound is $\sqrt{\kappa(H)}$, where, $\kappa(H)$f is the condition number of the matrix $H$. For most bundle adjustment problems, $\kappa(H)$ is high and a direct application of Conjugate Gradients to~\eqref{eq:normal} results in extremely poor performance.
356 For bundle adjustment problems arising in reconstruction from community photo collections, more effective preconditioners can be constructed by analyzing and exploiting the camera-point visibility structure of the scene~\cite{kushal2012}. Ceres implements the two visibility based preconditioners described by Kushal \& Agarwal as \texttt{CLUSTER\_JACOBI} and \texttt{CLUSTER\_TRIDIAGONAL}. These are fairly new preconditioners and Ceres' implementation of them is in its early stages and is not as mature as the other preconditioners described above.
419 should be as large as possible. For standard bundle adjustment
    [all...]
  /external/ceres-solver/internal/ceres/
system_test.cc 35 // adjustment problem with 16 cameras and two thousand cameras. The
302 // access to a bundle adjustment problem. It is based on
  /external/clang/lib/CodeGen/
CGCXXABI.h 100 /// pointer. Apply the this-adjustment and set 'This' to the
160 /// support an ABI that allows this). Returns null if no adjustment
  /external/icu4c/layout/
LEGlyphStorage.h 421 * @param xAdjust the adjustment to the glyph's X position
422 * @param yAdjust the adjustment to the glyph's Y position

Completed in 1175 milliseconds

1 2 3 4 56 7 8 91011>>