| /external/opencv3/samples/cpp/ |
| D | squares.cpp | 48 static void findSquares( const Mat& image, vector<vector<Point> >& squares ) in findSquares() argument
50 squares.clear(); in findSquares()
121 squares.push_back(approx); in findSquares()
130 static void drawSquares( Mat& image, const vector<vector<Point> >& squares ) in drawSquares() argument
132 for( size_t i = 0; i < squares.size(); i++ ) in drawSquares()
134 const Point* p = &squares[i][0]; in drawSquares()
135 int n = (int)squares[i].size(); in drawSquares()
149 vector<vector<Point> > squares; in main() local
160 findSquares(image, squares); in main()
161 drawSquares(image, squares); in main()
|
| /external/opencv3/samples/tapi/ |
| D | squares.cpp | 35 static void findSquares( const UMat& image, vector<vector<Point> >& squares ) in findSquares() argument
37 squares.clear(); in findSquares()
108 squares.push_back(approx); in findSquares()
116 static void drawSquares( UMat& _image, const vector<vector<Point> >& squares ) in drawSquares() argument
119 for( size_t i = 0; i < squares.size(); i++ ) in drawSquares()
121 const Point* p = &squares[i][0]; in drawSquares()
122 int n = (int)squares[i].size(); in drawSquares()
169 vector<vector<Point> > squares; in main() local
184 findSquares(image, squares); in main()
189 findSquares(image, squares); in main()
[all …]
|
| /external/v8/test/mjsunit/ |
| D | sin-cos.js | 133 var squares = []; variable
140 squares.push(err_sin*err_sin + err_cos*err_cos);
144 while (squares.length > 1) {
146 if (squares.length % 2 == 1) reduced.push(squares.pop());
148 while(squares.length > 1) reduced.push(squares.pop() + squares.pop());
149 squares = reduced;
152 var err_rms = Math.sqrt(squares[0] / test_inputs.length / 2);
|
| /external/opencv3/samples/python2/ |
| D | squares.py | 19 squares = []
35 squares.append(cnt)
36 return squares
42 squares = find_squares(img) variable
43 cv2.drawContours( img, squares, -1, (0, 255, 0), 3 )
|
| /external/ceres-solver/docs/source/ |
| D | bibliography.rst | 35 pseudo-inverses and nonlinear least squares problems whose
58 nonlinear problems in least squares**, *Quart. Appl. Math*,
62 preconditioner for large sparse least squares problems**, *SIAM
66 nonlinear least squares problems**, 2004.
71 .. [Marquardt] D.W. Marquardt, **An algorithm for least squares
94 nonlinear least squares problems**, Siam Review, 22(3):318–337,
101 squares**, *The Annals of Statistics*, 9(3):465-474, 1981.
|
| D | history.rst | 7 Ceres Solver grew out of the need for general least squares solving at
24 method of least squares to correctly predict when and where the
|
| D | index.rst | 27 large complicated `nonlinear least squares`_ problems. It is a feature
42 .. _nonlinear least squares: http://en.wikipedia.org/wiki/Non-linear_least_squares
|
| D | tutorial.rst | 11 Ceres solves robustified non-linear bounds constrained least squares
46 the solution of non-linear least squares problems.
50 the more familiar `non-linear least squares problem
92 to construct a non-linear least squares problem using it and have
454 with no data. The original purpose of least squares and non-linear
455 least squares analysis was fitting curves to data. It is only
542 Least squares curve fitting.
590 least squares fit.
608 problem is usually formulated as a non-linear least squares problem,
|
| D | features.rst | 30 - **Robust Loss Functions** Most non-linear least squares problems
68 non-linear least squares solvers.
|
| /external/skia/gm/ |
| D | thinrects.cpp | 100 static const SkRect squares[] = { in DrawSquares() local
110 for (size_t j = 0; j < SK_ARRAY_COUNT(squares); ++j) { in DrawSquares()
111 canvas->drawRect(squares[j], p); in DrawSquares()
|
| /external/ceres-solver/scripts/ |
| D | ceres-solver.spec | 7 Summary: A non-linear least squares minimizer
35 large complicated nonlinear least squares problems. Features include:
55 Summary: A non-linear least squares minimizer
|
| /external/fec/ |
| D | sumsq_mmx_assist.s | 7 # Evaluate sum of squares of signed 16-bit input samples
49 # Evaluate sum of squares of signed 16-bit input samples
|
| D | sumsq_sse2_assist.s | 6 # Evaluate sum of squares of signed 16-bit input samples
|
| /external/ceres-solver/ |
| D | README | 1 Ceres Solver - A non-linear least squares minimizer
|
| D | README.google | 8 least squares solver, developed at Google. It is now open-source.
|
| D | NOTICE | 1 Ceres Solver - A fast non-linear least squares minimizer
|
| /external/opencv/cvaux/src/ |
| D | cvlmeds.cpp | 197 icvCubic( double a2, double a1, double a0, double *squares ) in icvCubic() argument
203 if( !squares ) in icvCubic()
245 squares[i] = x[i][i % 2]; in icvCubic()
305 squares[t++] = x[i][0]; in icvCubic()
306 squares[t++] = x[i][1]; in icvCubic()
1700 double squares[6]; in icvPoint7() local
1729 icvCubic( a2, a1, a0, squares ); in icvPoint7()
1734 if( REAL_ZERO( squares[i * 2 + 1] )) in icvPoint7()
1740 F[*amount + j] = (float) (squares[i] * solutions[j] + in icvPoint7()
1741 (1 - squares[i]) * solutions[j + 9]); in icvPoint7()
|
| /external/opencv3/modules/objdetect/src/opencl/ |
| D | objdetect_hog.cl | 160 const float threshold, __local float *squares)
169 squares[tid] = elem * elem;
172 __local float* smem = squares + boffset;
189 squares[tid] = elem * elem;
255 __global float* block_hists, const float threshold, __local float *squares)
268 squares[tid] = elem * elem;
271 float sum = reduce_smem(squares, nthreads);
277 squares[tid] = elem * elem;
280 sum = reduce_smem(squares, nthreads);
|
| /external/opencv3/doc/py_tutorials/py_ml/py_svm/py_svm_opencv/ |
| D | py_svm_opencv.markdown | 37 gradient is quantized to 16 integer values. Divide this image to four sub-squares. For each
39 sub-square gives you a vector containing 16 values. Four such vectors (of four sub-squares) together
50 # Divide to 4 sub-squares
|
| /external/libvpx/libvpx/vp9/encoder/x86/ |
| D | vp9_error_sse2.asm | 35 ; individual errors are max. 15bit+sign, so squares are 30bit, and
96 ; individual errors are max. 15bit+sign, so squares are 30bit, and
|
| D | vp9_highbd_error_avx.asm | 52 ; Individual errors are max 15bit+sign, so squares are 30bit, and
126 ; Individual errors are max 15bit+sign, so squares are 30bit, and
209 ; individual errors are max. 15bit+sign, so squares are 30bit, and
|
| /external/eigen/doc/ |
| D | TutorialLinearAlgebra.dox | 168 \section TutorialLinAlgLeastsquares Least squares solving
170 The best way to do least squares solving is with a SVD decomposition. Eigen provides one as the Jac…
171 is doing least-squares solving.
183 of the normal matrix. In any case, just read any reference text on least squares, and it will be ve…
184 to implement any linear least squares computation on top of Eigen.
|
| /external/ceres-solver/data/nist/ |
| D | MGH09.dat | 13 -14.07..., -inf, -inf) with final sum of squares
|
| D | MGH17.dat | 20 Some aspects of nonlinear least squares
|
| /external/ceres-solver/docs/ |
| D | CMakeLists.txt | 1 # Ceres Solver - A fast non-linear least squares minimizer
|