Searched refs:ptidx (Results 1 – 6 of 6) sorted by relevance
78 const int ptidx = blockIdx.x * blockDim.y + threadIdx.y; in HarrisResponses() local80 if (ptidx < npoints) in HarrisResponses()82 const short2 loc = loc_[ptidx]; in HarrisResponses()121 …response[ptidx] = ((float)a * b - (float)c * c - harris_k * ((float)a + b) * ((float)a + b)) * sca… in HarrisResponses()161 const int ptidx = blockIdx.x * blockDim.y + threadIdx.y; in IC_Angle() local163 if (ptidx < npoints) in IC_Angle()167 const short2 loc = loc_[ptidx]; in IC_Angle()203 angle[ptidx] = kp_dir; in IC_Angle()347 const int ptidx = blockIdx.y * blockDim.y + threadIdx.y; in computeOrbDescriptor() local349 if (ptidx < npoints && descidx < dsize) in computeOrbDescriptor()[all …]
135 size_t ptidx, ptsize = pts.size(); in HarrisResponses() local150 for( ptidx = 0; ptidx < ptsize; ptidx++ ) in HarrisResponses()152 int x0 = cvRound(pts[ptidx].pt.x); in HarrisResponses()153 int y0 = cvRound(pts[ptidx].pt.y); in HarrisResponses()154 int z = pts[ptidx].octave; in HarrisResponses()168 pts[ptidx].response = ((float)a * b - (float)c * c - in HarrisResponses()179 size_t ptidx, ptsize = pts.size(); in ICAngles() local181 for( ptidx = 0; ptidx < ptsize; ptidx++ ) in ICAngles()183 const Rect& layer = layerinfo[pts[ptidx].octave]; in ICAngles()184 …const uchar* center = &img.at<uchar>(cvRound(pts[ptidx].pt.y) + layer.y, cvRound(pts[ptidx].pt.x) … in ICAngles()[all …]
339 for (int ptidx=0; ptidx<contourMat.cols; ptidx++) in extractSCD() local343 if (ptidx==cmp) continue; in extractSCD()346 if (queryInliers[ptidx]==0 || queryInliers[cmp]==0) continue; //avoid outliers in extractSCD()352 if (disMatrix.at<float>(ptidx, cmp)<logspaces[i]) in extractSCD()360 if (angleMatrix.at<float>(ptidx, cmp)<angspaces[i]) in extractSCD()369 descriptors.at<float>(ptidx, idx)++; in extractSCD()
238 for( int ptidx = range.start; ptidx < range.end; ptidx++ ) in operator ()() local240 Point2f prevPt = prevPts[ptidx]*(float)(1./(1 << level)); in operator ()()245 nextPt = nextPts[ptidx]*(float)(1./(1 << level)); in operator ()()250 nextPt = nextPts[ptidx]*2.f; in operator ()()251 nextPts[ptidx] = nextPt; in operator ()()264 status[ptidx] = false; in operator ()()266 err[ptidx] = 0; in operator ()()491 err[ptidx] = (float)minEig; in operator ()()496 status[ptidx] = false; in operator ()()514 status[ptidx] = false; in operator ()()[all …]
519 const float* KDTree::getPoint(int ptidx, int* label) const in getPoint() argument521 CV_Assert( (unsigned)ptidx < (unsigned)points.rows); in getPoint()523 *label = labels[ptidx]; in getPoint()524 return points.ptr<float>(ptidx); in getPoint()
83 const float* getPoint(int ptidx, int* label = 0) const;