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

typos

Browse Source
This commit is contained in:
Ilya Lavrenov
2014-03-02 21:04:17 +04:00
parent 879c0196d4
commit eedf86402d
18 changed files with 30 additions and 30 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
modules/legacy/src/clique.cpp
View File

@@ -343,7 +343,7 @@ int cvFindNextMaximalClique( CvCliqueFinder* finder )
break;
case NEXT:
//here we will look for candidate to translate into not
//s[k] now contains index of choosen candidate
//s[k] now contains index of chosen candidate
{
int* new_ = All[k+1];
if( nod[k] != 0 )
@@ -590,7 +590,7 @@ void cvBronKerbosch( CvGraph* graph )
break;
case NEXT:
//here we will look for candidate to translate into not
//s[k] now contains index of choosen candidate
//s[k] now contains index of chosen candidate
{
int* new_ = All[k+1];
if( nod[k] != 0 )

2
modules/legacy/src/epilines.cpp
View File

@@ -3621,7 +3621,7 @@ int cvComputeEpipolesFromFundMatrix(CvMatr32f fundMatr,
CvMat* matrV = cvCreateMat(3,3,CV_MAT32F);
/* From svd we need just last vector of U and V or last row from U' and V' */
/* We get transposed matrixes U and V */
/* We get transposed matrices U and V */
cvSVD(&fundMatrC,matrW,matrU,matrV,CV_SVD_V_T|CV_SVD_U_T);
/* Get last row from U' and compute epipole1 */

2
modules/legacy/src/lmeds.cpp
View File

@@ -1180,7 +1180,7 @@ icvSingularValueDecomposition( int M,
} /* for */
} /* if */
/* Iterations QR-algorithm for bidiagonal matrixes
/* Iterations QR-algorithm for bidiagonal matrices
W[i] - is the main diagonal
rv1[i] - is the top diagonal, rv1[0]=0.
*/

12
modules/legacy/src/trifocal.cpp
View File

@@ -905,7 +905,7 @@ int icvComputeProjectMatricesNPoints( CvMat* points1,CvMat* points2,CvMat* poin
tmpProjMatr[1] = cvMat(9,4,CV_64F,tmpProjMatr_dat+36);
tmpProjMatr[2] = cvMat(9,4,CV_64F,tmpProjMatr_dat+72);
/* choosen points */
/* chosen points */
while( wasCount < NumSamples )
{
@@ -1497,7 +1497,7 @@ void GetGeneratorReduceFundSolution(CvMat* points1,CvMat* points2,CvMat* fundRed
matrV = cvMat(5,5,CV_64F,matrV_dat);
/* From svd we need just two last vectors of V or two last row V' */
/* We get transposed matrixes U and V */
/* We get transposed matrices U and V */
cvSVD(&matrA,&matrW,0,&matrV,CV_SVD_V_T);
@@ -1532,7 +1532,7 @@ int GetGoodReduceFundamMatrFromTwo(CvMat* fundReduceCoef1,CvMat* fundReduceCoef2
CV_ERROR( CV_StsUnsupportedFormat, "Input parameters must be a matrices" );
}
/* using two fundamental matrix comute matrixes for det(F)=0 */
/* using two fundamental matrix comute matrices for det(F)=0 */
/* May compute 1 or 3 matrices. Returns number of solutions */
/* Here we will use case F=a*F1+(1-a)*F2 instead of F=m*F1+l*F2 */
@@ -1670,7 +1670,7 @@ void GetProjMatrFromReducedFundamental(CvMat* fundReduceCoefs,CvMat* projMatrCoe
matrV = cvMat(3,3,CV_64F,matrV_dat);
/* From svd we need just last vector of V or last row V' */
/* We get transposed matrixes U and V */
/* We get transposed matrices U and V */
cvSVD(&matrA,&matrW,0,&matrV,CV_SVD_V_T);
@@ -1736,7 +1736,7 @@ void GetProjMatrFromReducedFundamental(CvMat* fundReduceCoefs,CvMat* projMatrCoe
matrV1 = cvMat(6,6,CV_64F,matrV_dat1);
/* From svd we need just last vector of V or last row V' */
/* We get transposed matrixes U and V */
/* We get transposed matrices U and V */
cvSVD(&matrK,&matrW1,0,&matrV1,CV_SVD_V_T);
@@ -2037,7 +2037,7 @@ void icvComputeTransform4D(CvMat* points1,CvMat* points2,CvMat* transMatr)
}
/* From svd we need just two last vectors of V or two last row V' */
/* We get transposed matrixes U and V */
/* We get transposed matrices U and V */
cvSVD(matrA,matrW,0,&matrV,CV_SVD_V_T);