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

2
modules/calib3d/test/test_cameracalibration.cpp
View File

@@ -478,7 +478,7 @@ void CV_CameraCalibrationTest::run( int start_from )
values_read = fscanf(file,"%lf",goodDistortion+2); CV_Assert(values_read == 1);
values_read = fscanf(file,"%lf",goodDistortion+3); CV_Assert(values_read == 1);
/* Read good Rot matrixes */
/* Read good Rot matrices */
for( currImage = 0; currImage < numImages; currImage++ )
{
for( i = 0; i < 3; i++ )

4
modules/contrib/src/basicretinafilter.hpp
View File

@@ -439,8 +439,8 @@ namespace cv
#ifdef MAKE_PARALLEL
/******************************************************
** IF some parallelizing thread methods are available, then, main loops are parallelized using these functors
** ==> main idea paralellise main filters loops, then, only the most used methods are parallelized... TODO : increase the number of parallelised methods as necessary
** ==> functors names = Parallel_$$$ where $$$= the name of the serial method that is parallelised
** ==> main idea parallelize main filters loops, then, only the most used methods are parallelized... TODO : increase the number of parallelized methods as necessary
** ==> functors names = Parallel_$$$ where $$$= the name of the serial method that is parallelized
** ==> functors constructors can differ from the parameters used with their related serial functions
*/

4
modules/contrib/src/magnoretinafilter.hpp
View File

@@ -195,8 +195,8 @@ namespace cv
#ifdef MAKE_PARALLEL
/******************************************************
** IF some parallelizing thread methods are available, then, main loops are parallelized using these functors
** ==> main idea paralellise main filters loops, then, only the most used methods are parallelized... TODO : increase the number of parallelised methods as necessary
** ==> functors names = Parallel_$$$ where $$$= the name of the serial method that is parallelised
** ==> main idea parallelize main filters loops, then, only the most used methods are parallelized... TODO : increase the number of parallelized methods as necessary
** ==> functors names = Parallel_$$$ where $$$= the name of the serial method that is parallelized
** ==> functors constructors can differ from the parameters used with their related serial functions
*/
class Parallel_amacrineCellsComputing: public cv::ParallelLoopBody

4
modules/contrib/src/parvoretinafilter.hpp
View File

@@ -219,8 +219,8 @@ private:
#ifdef MAKE_PARALLEL
/******************************************************
** IF some parallelizing thread methods are available, then, main loops are parallelized using these functors
** ==> main idea paralellise main filters loops, then, only the most used methods are parallelized... TODO : increase the number of parallelised methods as necessary
** ==> functors names = Parallel_$$$ where $$$= the name of the serial method that is parallelised
** ==> main idea parallelize main filters loops, then, only the most used methods are parallelized... TODO : increase the number of parallelized methods as necessary
** ==> functors names = Parallel_$$$ where $$$= the name of the serial method that is parallelized
** ==> functors constructors can differ from the parameters used with their related serial functions
*/
class Parallel_OPL_OnOffWaysComputing: public cv::ParallelLoopBody

4
modules/contrib/src/retinacolor.hpp
View File

@@ -259,8 +259,8 @@ namespace cv
#ifdef MAKE_PARALLEL
/******************************************************
** IF some parallelizing thread methods are available, then, main loops are parallelized using these functors
** ==> main idea paralellise main filters loops, then, only the most used methods are parallelized... TODO : increase the number of parallelised methods as necessary
** ==> functors names = Parallel_$$$ where $$$= the name of the serial method that is parallelised
** ==> main idea parallelize main filters loops, then, only the most used methods are parallelized... TODO : increase the number of parallelized methods as necessary
** ==> functors names = Parallel_$$$ where $$$= the name of the serial method that is parallelized
** ==> functors constructors can differ from the parameters used with their related serial functions
*/

4
modules/core/test/test_ds.cpp
View File

@@ -1357,7 +1357,7 @@ int Core_SetTest::test_set_ops( int iters )
(cvset->total == 0 || cvset->total >= prev_total),
"The total number of cvset elements is not correct" );
// CvSet and simple set do not neccessary have the same "total" (active & free) number,
// CvSet and simple set do not necessary have the same "total" (active & free) number,
// so pass "set->total" to skip that check
test_seq_block_consistence( struct_idx, (CvSeq*)cvset, cvset->total );
update_progressbar();
@@ -1779,7 +1779,7 @@ int Core_GraphTest::test_graph_ops( int iters )
(graph->edges->total == 0 || graph->edges->total >= prev_edge_total),
"The total number of graph vertices is not correct" );
// CvGraph and simple graph do not neccessary have the same "total" (active & free) number,
// CvGraph and simple graph do not necessary have the same "total" (active & free) number,
// so pass "graph->total" (or "graph->edges->total") to skip that check
test_seq_block_consistence( struct_idx, (CvSeq*)graph, graph->total );
test_seq_block_consistence( struct_idx, (CvSeq*)graph->edges, graph->edges->total );

4
modules/gpu/include/opencv2/gpu/gpu.hpp
View File

@@ -733,11 +733,11 @@ CV_EXPORTS void cornerMinEigenVal(const GpuMat& src, GpuMat& dst, GpuMat& Dx, Gp
int borderType=BORDER_REFLECT101, Stream& stream = Stream::Null());
//! performs per-element multiplication of two full (not packed) Fourier spectrums
//! supports 32FC2 matrixes only (interleaved format)
//! supports 32FC2 matrices only (interleaved format)
CV_EXPORTS void mulSpectrums(const GpuMat& a, const GpuMat& b, GpuMat& c, int flags, bool conjB=false, Stream& stream = Stream::Null());
//! performs per-element multiplication of two full (not packed) Fourier spectrums
//! supports 32FC2 matrixes only (interleaved format)
//! supports 32FC2 matrices only (interleaved format)
CV_EXPORTS void mulAndScaleSpectrums(const GpuMat& a, const GpuMat& b, GpuMat& c, int flags, float scale, bool conjB=false, Stream& stream = Stream::Null());
//! Performs a forward or inverse discrete Fourier transform (1D or 2D) of floating point matrix.

2
modules/highgui/src/cap_tyzx.cpp
View File

@@ -163,7 +163,7 @@ IplImage * CvCaptureCAM_TYZX::retrieveFrame(int)
{
if(!isOpened() || !g_tyzx_camera) return 0;
if(!image && !alocateImage())
if(!image && !allocateImage())
return 0;
// copy camera image into buffer.

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);

2
modules/nonfree/src/opencl/surf.cl
View File

@@ -956,7 +956,7 @@ void icvCalcOrientation(
// This reduction searches for the longest wavelet response vector. The first
// step uses all of the work items in the workgroup to narrow the search
// down to the three candidates. It requires s_mod to have a few more
// elements alocated past the work-group size, which are pre-initialized to
// elements allocated past the work-group size, which are pre-initialized to
// 0.0f above.
for(int t = ORI_RESPONSE_REDUCTION_WIDTH; t >= 3; t /= 2) {
if (tid < t) {

2
modules/photo/src/denoising.cpp
View File

@@ -133,7 +133,7 @@ static void fastNlMeansDenoisingMultiCheckPreconditions(
{
CV_Error(CV_StsBadArg,
"imgToDenoiseIndex and temporalWindowSize "
"should be choosen corresponding srcImgs size!");
"should be chosen corresponding srcImgs size!");
}
for (int i = 1; i < src_imgs_size; i++) {

2
modules/ts/misc/chart.py
View File

@@ -168,7 +168,7 @@ if __name__ == "__main__":
print >> sys.stderr, "%4s: %s" % (i, name)
i += 1
if names1:
print >> sys.stderr, "Other suits in this log (can not be choosen):"
print >> sys.stderr, "Other suits in this log (can not be chosen):"
for name in sorted(names1):
print >> sys.stderr, "%4s: %s" % (i, name)
i += 1