| /external/webkit/Source/WebCore/platform/gtk/ |
| MainFrameScrollbarGtk.cpp | 40 // as GtkScrolledWindow). The adjustment may also be null, in which case there
45 MainFrameScrollbarGtk::MainFrameScrollbarGtk(ScrollableArea* scrollableArea, ScrollbarOrientation orientation, GtkAdjustment* adjustment)
49 attachAdjustment(adjustment);
61 void MainFrameScrollbarGtk::attachAdjustment(GtkAdjustment* adjustment)
63 if (m_adjustment.get() == adjustment)
68 m_adjustment = adjustment;
|
| GtkVersioning.c | 32 void gtk_adjustment_configure(GtkAdjustment* adjustment, gdouble value, gdouble lower, gdouble upper,
35 g_object_freeze_notify(G_OBJECT(adjustment));
37 g_object_set(adjustment,
45 g_object_thaw_notify(G_OBJECT(adjustment));
47 gtk_adjustment_changed(adjustment);
48 gtk_adjustment_value_changed(adjustment);
|
| ScrollbarThemeGtk2.cpp | 111 // The adjustment controls the rendering of the scrollbar thumb. If it's not set
113 GtkAdjustment* adjustment = gtk_range_get_adjustment(GTK_RANGE(widget)); local
114 gtk_adjustment_set_value(adjustment, scrollbar->currentPos());
115 gtk_adjustment_set_lower(adjustment, 0);
116 gtk_adjustment_set_upper(adjustment, scrollbar->maximum());
120 gtk_adjustment_set_page_size(adjustment, rect.height());
123 gtk_adjustment_set_page_size(adjustment, rect.width());
|
| GtkVersioning.h | 106 void gtk_adjustment_configure(GtkAdjustment* adjustment, gdouble value, gdouble lower, gdouble upper,
|
| /frameworks/base/core/java/android/gesture/ |
| Instance.java | 96 float adjustment = -orientation; local
101 if (Math.abs(delta) < Math.abs(adjustment)) {
102 adjustment = delta;
108 GestureUtils.rotate(pts, adjustment);
|
| /external/libvpx/libvpx/vp8/encoder/ |
| denoising.c | 30 * adjustment = filtered_value - current_raw
39 * The adjustment vs. diff curve becomes flat very quick when diff increases.
44 * diff adjustment w/o motion correction adjustment w/ motion correction
70 * increasing the adjustment for each level. */
82 int adjustment = 0; local
97 adjustment = adj_val[0];
99 adjustment = adj_val[1];
101 adjustment = adj_val[2];
105 if ((sig[c] + adjustment) > 255
[all...] |
| /external/webkit/Source/WebKit/gtk/tests/ |
| testwebview.c | 146 GtkAdjustment* adjustment; local
170 adjustment = gtk_scrolled_window_get_vadjustment(GTK_SCROLLED_WINDOW(scrolled_window));
171 g_assert_cmpfloat(gtk_adjustment_get_value(adjustment), ==, 0.0);
177 action is performed and afterward it is checked if the adjustment
189 g_assert_cmpfloat(gtk_adjustment_get_value(adjustment), !=, 0.0);
202 GtkAdjustment* adjustment; local
235 adjustment = gtk_scrolled_window_get_vadjustment(GTK_SCROLLED_WINDOW(scrolled_window));
236 g_assert_cmpfloat(gtk_adjustment_get_value(adjustment), ==, 0.0);
238 lower = gtk_adjustment_get_lower(adjustment);
239 upper = gtk_adjustment_get_upper(adjustment);
[all...] |
| /external/e2fsprogs/lib/uuid/ |
| gen_uuid.c | 308 THREAD_LOCAL int adjustment = 0; local
356 adjustment = a;
373 adjustment = 0;
377 if (adjustment >= MAX_ADJUSTMENT)
379 adjustment++;
381 adjustment = 0;
385 clock_reg = tv.tv_usec*10 + adjustment;
390 adjustment += *num - 1;
391 last.tv_usec += adjustment / 10;
392 adjustment = adjustment % 10
[all...] |
| /external/ceres-solver/docs/ |
| further.tex | 4 For a short but informative introduction to the subject we recommend the booklet by Madsel et al.~\cite{madsen2004methods}. For a general introduction to non-linear optimization we recommend the text by Nocedal \& Wright~\cite{nocedal2000numerical}. Bj{\"o}rck's book remains the seminal reference on least squares problems~\cite{bjorck1996numerical}. Trefethen \& Bau's book is our favourite text on introductory numerical linear algebra~\cite{trefethen1997numerical}. Triggs et al., provide a thorough coverage of the bundle adjustment problem~\cite{triggs-etal-1999}.
|
| bundleadjustment.tex | 2 \chapter{Bundle Adjustment}
4 One of the main reasons for writing Ceres was our need to solve large scale bundle adjustment problems~\cite{hartley-zisserman-book-2004,triggs-etal-1999}.
6 Given a set of measured image feature locations and correspondences, the goal of bundle adjustment is to find 3D point positions and camera parameters that minimize the reprojection error. This optimization problem is usually formulated as a non-linear least squares problem, where the error is the squared $L_2$ norm of the difference between the observed feature location and the projection of the corresponding 3D point on the image plane of the camera. Ceres has extensive support for solving bundle adjustment problems.
69 Given this functor, the bundle adjustment problem can be constructed as follows:
71 // Create residuals for each observation in the bundle adjustment problem. The
89 Again note that that the problem construction for bundle adjustment is very similar to the curve fitting example.
91 One way to solve this problem is to set \texttt{Solver::Options::linear\_solver\_type} to \texttt{SPARSE\_NORMAL\_CHOLESKY} and call \texttt{Solve}. And while this is a reasonable thing to do, bundle adjustment problems have a special sparsity structure that can be exploited to solve them much more efficiently. Ceres provides three specialized solvers (collectively known as Schur based solvers) for this task. The example code uses the simplest of them \texttt{DENSE\_SCHUR}.
101 For a more sophisticated bundle adjustment example which demonstrates the use of Ceres' more advanced features including its various linear solvers, robust loss functions and local parameterizations see \texttt{examples/bundle\_adjuster.cc}.
|
| 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...] |
| /frameworks/base/services/java/com/android/server/am/ |
| ProcessList.java | 91 // The system process runs at the default adjustment.
214 long getMemLevel(int adjustment) {
216 if (adjustment <= mOomAdj[i]) {
|
| /external/chromium/base/ |
| utf_offset_string_conversions.cc | 53 adjustments.push_back(AdjustOffset::Adjustment(
58 // Make offset adjustment.
214 AdjustOffset::Adjustment::Adjustment(size_t location,
227 size_t adjustment = 0;
241 adjustment += (i->old_length - i->new_length);
243 offset -= adjustment;
|
| /development/samples/ApiDemos/src/com/example/android/apis/accessibility/ |
| ClockBackService.java | 390 int adjustment = volumePercent % 10; local
391 if (adjustment < 5) {
392 volumePercent -= adjustment;
393 } else if (adjustment > 5) {
394 volumePercent += (10 - adjustment);
|
| /external/webkit/Source/WebKit/gtk/WebCoreSupport/ |
| FullscreenVideoController.cpp | 513 GtkAdjustment* adjustment = gtk_range_get_adjustment(GTK_RANGE(m_timeHScale)); local
514 gtk_adjustment_set_value(adjustment, value);
548 GtkAdjustment* adjustment = GTK_ADJUSTMENT(gtk_adjustment_new(0.0, 0.0, 100.0, 0.1, 1.0, 1.0)); local
549 m_timeHScale = gtk_hscale_new(adjustment);
|
| /packages/apps/Gallery/src/com/android/camera/ |
| HighlightView.java | 303 float adjustment = (mImageRect.width() - r.width()) / 2F; local
304 dx = adjustment;
310 float adjustment = (mImageRect.height() - r.height()) / 2F; local
311 dy = adjustment;
|
| /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/sonivox/arm-hybrid-22k/lib_src/ |
| ARM-E_interpolate_loop_gnu.s | 97 @ This section performs a gain adjustment of -12dB for 16-bit samples
|
| 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_loop_gnu.s | 97 @ This section performs a gain adjustment of -12dB for 16-bit samples
|
| ARM-E_interpolate_noloop_gnu.s | 89 @ This section performs a gain adjustment of -12dB for 16-bit samples
|
| /ndk/sources/host-tools/make-3.81/ |
| remake.c | 1283 FILE_TIMESTAMP adjustment = FAT_ADJ_OFFSET << FILE_TIMESTAMP_LO_BITS; local
1290 FILE_TIMESTAMP adjustment = (((FILE_TIMESTAMP_S (adjusted_mtime) & 1) == 0 local
[all...] |
| /external/chromium/chrome/browser/resources/ |
| bug_report.js | 96 // adjustment is needed on selectedIndex.
|
| /external/libvpx/libvpx/vp8/encoder/x86/ |
| quantize_mmx.asm | 251 ; eob adjustment begins here
|
| /external/harfbuzz/src/ |
| harfbuzz-shaper.cpp | 1285 HB_Fixed adjustment = positions[i].x_advance; local
[all...] |
