HomeSort by relevance Sort by last modified time
    Searched full:diagonal (Results 226 - 250 of 657) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/ImageMagick/www/api/
feature.html 145 <p>Use HoughLineImage() in conjunction with any binary edge extracted image (we recommand Canny) to identify lines in the image. The algorithm accumulates counts for every white pixel for every possible orientation (for angles from 0 to 179 in 1 degree increments) and distance from the center of the image to the corner (in 1 px increments) and stores the counts in an accumulator matrix of angle vs distance. The size of the accumulator is 180x(diagonal/2). Next it searches this space for peaks in counts and converts the locations of the peaks to slope and intercept in the normal x,y input image space. Use the slope/intercepts to find the endpoints clipped to the bounds of the image. The lines are then drawn. The counts are a measure of the length of the lines</p>
feature.php 141 <p>Use HoughLineImage() in conjunction with any binary edge extracted image (we recommand Canny) to identify lines in the image. The algorithm accumulates counts for every white pixel for every possible orientation (for angles from 0 to 179 in 1 degree increments) and distance from the center of the image to the corner (in 1 px increments) and stores the counts in an accumulator matrix of angle vs distance. The size of the accumulator is 180x(diagonal/2). Next it searches this space for peaks in counts and converts the locations of the peaks to slope and intercept in the normal x,y input image space. Use the slope/intercepts to find the endpoints clipped to the bounds of the image. The lines are then drawn. The counts are a measure of the length of the lines</p>
  /external/apache-commons-math/src/main/java/org/apache/commons/math/linear/
BigMatrix.java 283 * trace</a> of the matrix (the sum of the elements on the main diagonal).
BigMatrixImpl.java     [all...]
LUDecompositionImpl.java 155 // Divide the lower elements by the "winning" diagonal elt.
SingularValueDecompositionImpl.java 30 * p &times; p diagonal matrix with positive or null elements, V is a p &times;
  /external/clang/utils/ABITest/
Enumeration.py 105 # Conceptually we want to slide a diagonal line across a
  /external/eigen/Eigen/src/Core/util/
ForwardDeclarations.h 104 template<typename MatrixType, int Index = 0> class Diagonal;
  /external/eigen/doc/
TutorialLinearAlgebra.dox 256 on the decomposition but is typically the diagonal size times machine epsilon. While this is the best default we
  /external/eigen/unsupported/Eigen/src/NonLinearOptimization/
lmpar.h 271 // we could almost use this here, but the diagonal is outside qr, in sdiag[]
  /external/libopus/silk/fixed/
main_FIX.h 251 /* Add noise to matrix diagonal */
  /external/libopus/silk/float/
main_FLP.h 248 /* Add noise to matrix diagonal */
  /external/opencv/cvaux/src/
cvcorrespond.cpp 254 case 1: /* to diagonal */
  /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/PBQP/
Math.h 209 /// \brief Returns the diagonal of the matrix as a vector.
  /frameworks/av/media/libstagefright/codecs/on2/h264dec/omxdl/arm11/vc/m4p10/src/
armVCM4P10_InterpolateLuma_HalfDiagHorVer4x4_unsafe_s.s 52 ;// Implements diagonal interpolation for a block of size 4x4. Input and output should
armVCM4P10_InterpolateLuma_HalfDiagVerHor4x4_unsafe_s.s 49 ;// Implements diagonal interpolation for a block of size 4x4. Input and output should
  /libcore/tools/upstream/
oj_upstream_comparison.py 90 # only considering array elements within D cells of the diagonal.
  /packages/inputmethods/LatinIME/java/src/com/android/inputmethod/keyboard/internal/
GestureStrokeRecognitionPoints.java 84 // TODO: Find an appropriate base metric for these length. Maybe diagonal length of the key?
  /prebuilts/misc/windows/sdl2/test/
testsprite2.c 186 /* Test diagonal lines */
  /external/deqp/framework/common/
tcuMatrix.hpp 319 // Initialize to diagonal matrix.
337 // Initialize to diagonal matrix.
  /external/eigen/Eigen/src/CholmodSupport/
CholmodSupport.h 332 /** Sets the shift parameter that will be used to adjust the diagonal coefficients during the numerical factorization.
334 * During the numerical factorization, an offset term is added to the diagonal coefficients:\n
  /external/eigen/Eigen/src/Householder/
HouseholderSequence.h 249 dst.diagonal().setOnes();
261 // clear the off diagonal vector
  /external/eigen/Eigen/src/OrderingMethods/
Amd.h 91 * Note that the input matrix \a C must be complete, that is both the upper and lower parts have to be stored, as well as the diagonal entries.
163 else if(d > dense || !has_diag) /* node i is dense or has no structural diagonal element */
  /external/eigen/Eigen/src/SparseCore/
SparseSelfAdjointView.h 308 // handle diagonal coeff
332 // handle diagonal coeff
  /external/eigen/Eigen/src/SparseQR/
SparseQR.h 427 // Note: if the diagonal entry does not exist, then its contribution must be explicitly added,
428 // thus the trick with found_diag that permits to do one more iteration on the diagonal element if this one has not been found.

Completed in 1166 milliseconds

1 2 3 4 5 6 7 8 91011>>