generic-library/opencv
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

fix bug #5599

Browse Source
This commit is contained in:
Viet Dinh 2015-11-01 11:08:01 -05:00
parent 021ff0efa6
commit fdf549b921
1 changed files with 5 additions and 5 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

10
modules/core/src/mathfuncs.cpp
View File

@ -2469,7 +2469,7 @@ int cv::solveCubic( InputArray _coeffs, OutputArray _roots )
double cv::solvePoly( InputArray _coeffs0, OutputArray _roots0, int maxIters ) double cv::solvePoly( InputArray _coeffs0, OutputArray _roots0, int maxIters )
{ {
typedef Complex<double> C; typedef Complex<double> C;
double maxDiff = 0; double maxDiff = 0;
int iter, i, j; int iter, i, j;
Mat coeffs0 = _coeffs0.getMat(); Mat coeffs0 = _coeffs0.getMat();
@ -2494,8 +2494,8 @@ double cv::solvePoly( InputArray _coeffs0, OutputArray _roots0, int maxIters )
for( i = 0; i <= n; i++ ) for( i = 0; i <= n; i++ )
coeffs[i] = C(rcoeffs[i], 0); coeffs[i] = C(rcoeffs[i], 0);
} }
C p(1, 0), r(1, 1); C p(1, 0), r(0.4, 0.9);
for( i = 0; i < n; i++ ) for( i = 0; i < n; i++ )
{ {
@ -2514,7 +2514,7 @@ double cv::solvePoly( InputArray _coeffs0, OutputArray _roots0, int maxIters )
for( j = 0; j < n; j++ ) for( j = 0; j < n; j++ )
{ {
num = num*p + coeffs[n-j-1]; num = num*p + coeffs[n-j-1];
if( j != i ) denom = denom * (p - roots[j]); if( j != i ) denom = denom * (p - roots[j]);
} }
num /= denom; num /= denom;
roots[i] = p - num; roots[i] = p - num;
@ -2523,7 +2523,7 @@ double cv::solvePoly( InputArray _coeffs0, OutputArray _roots0, int maxIters )
if( maxDiff <= 0 ) if( maxDiff <= 0 )
break; break;
} }
if( coeffs0.channels() == 1 ) if( coeffs0.channels() == 1 )
{ {
const double verySmallEps = 1e-100; const double verySmallEps = 1e-100;