challenge/2019_COCO_DensePose/densepose_cocoeval.py [1074:1111]:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    def getDistances(self, cVertsGT, cVerts):
        
        ClosestVertsTransformed = self.PDIST_transform[cVerts.astype(int)-1]
        ClosestVertsGTTransformed = self.PDIST_transform[cVertsGT.astype(int)-1]
        #
        ClosestVertsTransformed[cVerts<0] = 0
        ClosestVertsGTTransformed[cVertsGT<0] = 0
        #
        cVertsGT = ClosestVertsGTTransformed
        cVerts = ClosestVertsTransformed
        #
        n = 27554
        dists = []
        for d in range(len(cVertsGT)):
            if cVertsGT[d] > 0:
                if cVerts[d] > 0:
                    i = cVertsGT[d] - 1
                    j = cVerts[d] - 1
                    if j == i:
                        dists.append(0)
                    elif j > i:
                        ccc = i
                        i = j
                        j = ccc
                        i = n-i-1
                        j = n-j-1
                        k = (n*(n-1)/2) - (n-i)*((n-i)-1)/2 + j - i - 1
                        k =  ( n*n - n )/2 -k -1
                        dists.append(self.Pdist_matrix[int(k)][0])
                    else:
                        i= n-i-1
                        j= n-j-1
                        k = (n*(n-1)/2) - (n-i)*((n-i)-1)/2 + j - i - 1
                        k =  ( n*n - n )/2 -k -1
                        dists.append(self.Pdist_matrix[int(k)][0])
                else:
                    dists.append(np.inf)
        return np.array(dists).squeeze()
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -



detectron/datasets/densepose_cocoeval.py [783:820]:
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
    def getDistances(self, cVertsGT, cVerts):
        
        ClosestVertsTransformed = self.PDIST_transform[cVerts.astype(int)-1]
        ClosestVertsGTTransformed = self.PDIST_transform[cVertsGT.astype(int)-1]
        #
        ClosestVertsTransformed[cVerts<0] = 0
        ClosestVertsGTTransformed[cVertsGT<0] = 0
        #
        cVertsGT = ClosestVertsGTTransformed
        cVerts = ClosestVertsTransformed
        #
        n = 27554
        dists = []
        for d in range(len(cVertsGT)):
            if cVertsGT[d] > 0:
                if cVerts[d] > 0:
                    i = cVertsGT[d] - 1
                    j = cVerts[d] - 1
                    if j == i:
                        dists.append(0)
                    elif j > i:
                        ccc = i
                        i = j
                        j = ccc
                        i = n-i-1
                        j = n-j-1
                        k = (n*(n-1)/2) - (n-i)*((n-i)-1)/2 + j - i - 1
                        k =  ( n*n - n )/2 -k -1
                        dists.append(self.Pdist_matrix[int(k)][0])
                    else:
                        i= n-i-1
                        j= n-j-1
                        k = (n*(n-1)/2) - (n-i)*((n-i)-1)/2 + j - i - 1
                        k =  ( n*n - n )/2 -k -1
                        dists.append(self.Pdist_matrix[int(k)][0])
                else:
                    dists.append(np.inf)
        return np.array(dists).squeeze()
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -