Lines Matching full:rows
285 gaussWindow = Mat::zeros(warpedImage.rows, warpedImage.cols, CV_32F);
289 for (ii=0; ii<diffIm.rows; ii++)
299 Mat appIm(diffIm.rows, diffIm.cols, CV_32F);
300 for (ii=0; ii<diffIm.rows; ii++)
405 cv::Mat mask(disMatrix.rows, disMatrix.cols, CV_8U);
490 hungarian(costMat, matches, inliers1, inliers2, descriptors1.rows, descriptors2.rows);
502 std::vector<int> free(costMatrix.rows, 0), collist(costMatrix.rows, 0);
503 std::vector<int> matches(costMatrix.rows, 0), colsol(costMatrix.rows), rowsol(costMatrix.rows);
504 std::vector<float> d(costMatrix.rows), pred(costMatrix.rows), v(costMatrix.rows);
513 for (j = costMatrix.rows-1; j >= 0; j--)
515 // find minimum cost over rows.
518 for (i = 1; i < costMatrix.rows; i++)
538 for (i=0; i<costMatrix.rows; i++)
550 for (j=0; j<costMatrix.rows; j++)
579 for (j=1; j<costMatrix.rows; j++)
637 for (j = 0; j < costMatrix.rows; j++)
653 for (k = up; k < costMatrix.rows; k++)
687 for (k = up; k < costMatrix.rows; k++)
736 for (int nrow=0; nrow<trueCostMatrix.rows; nrow++)
742 leftcost /= trueCostMatrix.rows;
