| /external/eigen/failtest/ |
| eigensolver_cplx.cpp | 13 EigenSolver<Matrix<SCALAR,Dynamic,Dynamic> > eig(Matrix<SCALAR,Dynamic,Dynamic>::Random(10,10));
|
| eigensolver_int.cpp | 13 EigenSolver<Matrix<SCALAR,Dynamic,Dynamic> > eig(Matrix<SCALAR,Dynamic,Dynamic>::Random(10,10));
|
| /external/opencv/cv/src/ |
| cvfeatureselect.cpp | 81 CvMat eig_stub, *eig = (CvMat*)eigImage; local
92 if( eig )
94 CV_CALL( eig = cvGetMat( eig, &eig_stub, &coi2 ));
99 eig = _eigImg;
125 CV_MAT_CN(eig->type) != 1 ||
130 CV_MAT_DEPTH(eig->type) != CV_32F )
144 CV_CALL( cvCornerHarris( img, eig, block_size, 3, harris_k ));
148 CV_CALL( cvCornerMinEigenVal( img, eig, block_size, 3 ));
150 CV_CALL( cvMinMaxLoc( eig, 0, &max_val, 0, 0, mask ))
[all...] |
| /external/opencv3/modules/imgproc/src/ |
| featureselect.cpp | 77 UMat eig, maxEigenValue; local
79 cornerHarris( _image, eig, blockSize, 3, harrisK );
81 cornerMinEigenVal( _image, eig, blockSize, 3 );
93 CV_Assert(eig.type() == CV_32FC1);
111 ocl::KernelArg eigarg = ocl::KernelArg::ReadOnlyNoSize(eig),
117 k.args(eigarg, eig.cols, (int)eig.total(), dbarg, maskarg);
119 k.args(eigarg, eig.cols, (int)eig.total(), dbarg);
144 ocl::KernelArg eigarg = ocl::KernelArg::ReadOnlyNoSize(eig),
277 Mat image = _image.getMat(), eig, tmp; local
[all...] |
| /external/eigen/lapack/ |
| eigenvalues.cpp | 63 SelfAdjointEigenSolver<PlainMatrixType> eig(mat,computeVectors?ComputeEigenvectors:EigenvaluesOnly);
65 if(eig.info()==NoConvergence)
74 vector(w,*n) = eig.eigenvalues();
76 matrix(a,*n,*n,*lda) = eig.eigenvectors();
|
| /external/eigen/unsupported/test/ |
| mpreal_support.cpp | 46 SelfAdjointEigenSolver<MatrixXmp> eig(S);
47 VERIFY_IS_EQUAL(eig.info(), Success);
48 VERIFY( (S.selfadjointView<Lower>() * eig.eigenvectors()).isApprox(eig.eigenvectors() * eig.eigenvalues().asDiagonal(), NumTraits<mpreal>::dummy_precision()*1e3) );
|
| /external/opencv3/modules/cudaimgproc/src/cuda/ |
| gftt.cu | 94 int findCorners_gpu(PtrStepSzf eig, float threshold, PtrStepSzb mask, float2* corners, int max_count)
101 bindTexture(&eigTex, eig);
104 dim3 grid(divUp(eig.cols, block.x), divUp(eig.rows, block.y));
107 findCorners<<<grid, block>>>(threshold, SingleMask(mask), corners, max_count, eig.rows, eig.cols);
109 findCorners<<<grid, block>>>(threshold, WithOutMask(), corners, max_count, eig.rows, eig.cols);
131 void sortCorners_gpu(PtrStepSzf eig, float2* corners, int count)
133 bindTexture(&eigTex, eig);
[all...] |
| /external/eigen/test/ |
| eigensolver_generic.cpp | 77 EigenSolver<MatrixType> eig; local
78 VERIFY_RAISES_ASSERT(eig.eigenvectors());
79 VERIFY_RAISES_ASSERT(eig.pseudoEigenvectors());
80 VERIFY_RAISES_ASSERT(eig.pseudoEigenvalueMatrix());
81 VERIFY_RAISES_ASSERT(eig.eigenvalues());
84 eig.compute(a, false);
85 VERIFY_RAISES_ASSERT(eig.eigenvectors());
86 VERIFY_RAISES_ASSERT(eig.pseudoEigenvectors());
|
| eigensolver_generalized_real.cpp | 35 GeneralizedEigenSolver<MatrixType> eig(spdA, spdB);
37 VERIFY_IS_EQUAL(eig.eigenvalues().imag().cwiseAbs().maxCoeff(), 0);
39 VectorType realEigenvalues = eig.eigenvalues().real();
|
| eigensolver_complex.cpp | 93 ComplexEigenSolver<MatrixType> eig; local
94 VERIFY_RAISES_ASSERT(eig.eigenvectors());
95 VERIFY_RAISES_ASSERT(eig.eigenvalues());
98 eig.compute(a, false);
99 VERIFY_RAISES_ASSERT(eig.eigenvectors());
|
| /external/eigen/Eigen/src/Eigen2Support/ |
| LeastSquares.h | 157 SelfAdjointEigenSolver<CovMatrixType> eig(covMat);
158 result->normal() = eig.eigenvectors().col(0);
160 *soundness = eig.eigenvalues().coeff(0)/eig.eigenvalues().coeff(1);
|
| /external/eigen/bench/ |
| eig33.cpp | 181 SelfAdjointEigenSolver<Mat> eig(A);
182 BENCH(t, tries, rep, eig.compute(A));
191 std::cerr << (evals - eig.eigenvalues()).transpose() << "\n";
193 if(evecs.col(k).dot(eig.eigenvectors().col(k))<0)
195 std::cerr << evecs - eig.eigenvectors() << "\n\n";
|
| /external/eigen/unsupported/Eigen/src/IterativeSolvers/ |
| DGMRES.h | 413 ComplexVector eig(it);
419 eig(j) = std::complex<RealScalar>(T(j,j),RealScalar(0));
424 eig(j) = std::complex<RealScalar>(T(j,j),T(j+1,j));
425 eig(j+1) = std::complex<RealScalar>(T(j,j+1),T(j+1,j+1));
429 if (j < it-1) eig(j) = std::complex<RealScalar>(T(j,j),RealScalar(0));
430 return eig;
443 ComplexVector eig(it);
445 eig = this->schurValues(schurofH);
449 for (int j=0; j<it; ++j) modulEig(j) = std::abs(eig(j));
461 if(eig(perm(it-nbrEig-1)).imag() == RealScalar(0)) nbrEig++;
[all...] |
| /external/opencv3/modules/python/test/ |
| transformations.py | 262 l, V = numpy.linalg.eig(M[:3, :3])
268 l, V = numpy.linalg.eig(M)
337 l, W = numpy.linalg.eig(R33.T)
343 l, Q = numpy.linalg.eig(R)
421 l, V = numpy.linalg.eig(M33)
430 l, V = numpy.linalg.eig(M)
535 l, V = numpy.linalg.eig(M)
542 l, V = numpy.linalg.eig(M33)
549 l, V = numpy.linalg.eig(M33.T)
674 l, V = numpy.linalg.eig(M33
[all...] |
| /external/opencv/cvaux/src/ |
| cveigenobjects.cpp | 1376 IplImage *eig = eigens[i]; local
1460 IplImage *eig = eigens[i]; local
1643 IplImage *eig = eigens[i]; local
1760 IplImage *eig = eigens[i]; local
[all...] |
| cvtrifocal.cpp | [all...] |
| /external/opencv3/modules/cudaimgproc/src/ |
| gftt.cpp | 58 int findCorners_gpu(PtrStepSzf eig, float threshold, PtrStepSzb mask, float2* corners, int max_count);
59 void sortCorners_gpu(PtrStepSzf eig, float2* corners, int count);
|
| /external/eigen/Eigen/src/Eigenvalues/ |
| SelfAdjointEigenSolver.h | 491 static inline void run(SolverType& eig, const typename SolverType::MatrixType& A, int options)
492 { eig.compute(A,options); }
|
| /external/boringssl/src/crypto/perlasm/ |
| x86_64-xlate.pl | 201 $self->{value} =~ s/(0b[0-1]+)/oct($1)/eig;
619 $var=~s/^(0b[0-1]+)/oct($1)/eig;
633 map(s/(0b[0-1]+)/oct($1)/eig,@str);
[all...] |
