(label, scores, bboxes,
                    glabels, gbboxes, gdifficults,
                    matching_threshold=0.5, scope=None)
Matching a collection of detected boxes with groundtruth values.
    Does not accept batched-inputs.
    The algorithm goes as follows: for every detected box, check
    if one grountruth box is matching. If none, then considered as False Positive.
    If the grountruth box is already matched with another one, it also counts
    as a False Positive. We refer the Pascal VOC documentation for the details.

    Args:
      rclasses, rscores, rbboxes: N(x4) Tensors. Detected objects, sorted by score;
      glabels, gbboxes: Groundtruth bounding boxes. May be zero padded, hence
        zero-class objects are ignored.
      matching_threshold: Threshold for a positive match.
    Return: Tuple of:
       n_gbboxes: Scalar Tensor with number of groundtruth boxes (may difer from
         size because of zero padding).
       tp_match: (N,)-shaped boolean Tensor containing with True Positives.
       fp_match: (N,)-shaped boolean Tensor containing with False Positives.
Matching a collection of detected boxes with groundtruth values.
    Does not accept batched-inputs.
    The algorithm goes as follows: for every detected box, check
    if one grountruth box is matching. If none, then considered as False Positive.
    If the grountruth box is already matched with another one, it also counts
    as a False Positive. We refer the Pascal VOC documentation for the details.
Matching a collection of detected boxes with groundtruth values . Does not accept batched - inputs . The algorithm goes as follows : for every detected box check if one grountruth box is matching . If none then considered as False Positive . If the grountruth box is already matched with another one it also counts as a False Positive . We refer the Pascal VOC documentation for the details .
def bboxes_matching(label, scores, bboxes,
                    glabels, gbboxes, gdifficults,
                    matching_threshold=0.5, scope=None):
    """Matching a collection of detected boxes with groundtruth values.
    Does not accept batched-inputs.
    The algorithm goes as follows: for every detected box, check
    if one grountruth box is matching. If none, then considered as False Positive.
    If the grountruth box is already matched with another one, it also counts
    as a False Positive. We refer the Pascal VOC documentation for the details.

    Args:
      rclasses, rscores, rbboxes: N(x4) Tensors. Detected objects, sorted by score;
      glabels, gbboxes: Groundtruth bounding boxes. May be zero padded, hence
        zero-class objects are ignored.
      matching_threshold: Threshold for a positive match.
    Return: Tuple of:
       n_gbboxes: Scalar Tensor with number of groundtruth boxes (may difer from
         size because of zero padding).
       tp_match: (N,)-shaped boolean Tensor containing with True Positives.
       fp_match: (N,)-shaped boolean Tensor containing with False Positives.
    """
    with tf.name_scope(scope, 'bboxes_matching_single',
                       [scores, bboxes, glabels, gbboxes]):
        rsize = tf.size(scores)
        rshape = tf.shape(scores)
        rlabel = tf.cast(label, glabels.dtype)
        # Number of groundtruth boxes.
        gdifficults = tf.cast(gdifficults, tf.bool)
        n_gbboxes = tf.count_nonzero(tf.logical_and(tf.equal(glabels, label),
                                                    tf.logical_not(gdifficults)))
        # Grountruth matching arrays.
        gmatch = tf.zeros(tf.shape(glabels), dtype=tf.bool)
        grange = tf.range(tf.size(glabels), dtype=tf.int32)
        # True/False positive matching TensorArrays.
        sdtype = tf.bool
        ta_tp_bool = tf.TensorArray(sdtype, size=rsize, dynamic_size=False, infer_shape=True)
        ta_fp_bool = tf.TensorArray(sdtype, size=rsize, dynamic_size=False, infer_shape=True)

        # Loop over returned objects.
        def m_condition(i, ta_tp, ta_fp, gmatch):
            r = tf.less(i, rsize)
            return r

        def m_body(i, ta_tp, ta_fp, gmatch):
            # Jaccard score with groundtruth bboxes.
            rbbox = bboxes[i]
            jaccard = bboxes_jaccard(rbbox, gbboxes)
            jaccard = jaccard * tf.cast(tf.equal(glabels, rlabel), dtype=jaccard.dtype)

            # Best fit, checking it's above threshold.
            idxmax = tf.cast(tf.argmax(jaccard, axis=0), tf.int32)
            jcdmax = jaccard[idxmax]
            match = jcdmax > matching_threshold
            existing_match = gmatch[idxmax]
            not_difficult = tf.logical_not(gdifficults[idxmax])

            # TP: match & no previous match and FP: previous match | no match.
            # If difficult: no record, i.e FP=False and TP=False.
            tp = tf.logical_and(not_difficult,
                                tf.logical_and(match, tf.logical_not(existing_match)))
            ta_tp = ta_tp.write(i, tp)
            fp = tf.logical_and(not_difficult,
                                tf.logical_or(existing_match, tf.logical_not(match)))
            ta_fp = ta_fp.write(i, fp)
            # Update grountruth match.
            mask = tf.logical_and(tf.equal(grange, idxmax),
                                  tf.logical_and(not_difficult, match))
            gmatch = tf.logical_or(gmatch, mask)

            return [i+1, ta_tp, ta_fp, gmatch]
        # Main loop definition.
        i = 0
        [i, ta_tp_bool, ta_fp_bool, gmatch] = \
            tf.while_loop(m_condition, m_body,
                          [i, ta_tp_bool, ta_fp_bool, gmatch],
                          parallel_iterations=1,
                          back_prop=False)
        # TensorArrays to Tensors and reshape.
        tp_match = tf.reshape(ta_tp_bool.stack(), rshape)
        fp_match = tf.reshape(ta_fp_bool.stack(), rshape)

        # Some debugging information...
        # tp_match = tf.Print(tp_match,
        #                     [n_gbboxes,
        #                      tf.reduce_sum(tf.cast(tp_match, tf.int64)),
        #                      tf.reduce_sum(tf.cast(fp_match, tf.int64)),
        #                      tf.reduce_sum(tf.cast(gmatch, tf.int64))],
        #                     'Matching (NG, TP, FP, GM): ')
        return n_gbboxes, tp_match, fp_match
def bboxes_matching ( label , scores , bboxes , glabels , gbboxes , gdifficults , matching_threshold = 0.5 , scope = None ) : with tf . name_scope ( scope , 'bboxes_matching_single' , [ scores , bboxes , glabels , gbboxes ] ) : rsize = tf . size ( scores ) rshape = tf . shape ( scores ) rlabel = tf . cast ( label , glabels . dtype ) # Number of groundtruth boxes. gdifficults = tf . cast ( gdifficults , tf . bool ) n_gbboxes = tf . count_nonzero ( tf . logical_and ( tf . equal ( glabels , label ) , tf . logical_not ( gdifficults ) ) ) # Grountruth matching arrays. gmatch = tf . zeros ( tf . shape ( glabels ) , dtype = tf . bool ) grange = tf . range ( tf . size ( glabels ) , dtype = tf . int32 ) # True/False positive matching TensorArrays. sdtype = tf . bool ta_tp_bool = tf . TensorArray ( sdtype , size = rsize , dynamic_size = False , infer_shape = True ) ta_fp_bool = tf . TensorArray ( sdtype , size = rsize , dynamic_size = False , infer_shape = True ) # Loop over returned objects. def m_condition ( i , ta_tp , ta_fp , gmatch ) : r = tf . less ( i , rsize ) return r def m_body ( i , ta_tp , ta_fp , gmatch ) : # Jaccard score with groundtruth bboxes. rbbox = bboxes [ i ] jaccard = bboxes_jaccard ( rbbox , gbboxes ) jaccard = jaccard * tf . cast ( tf . equal ( glabels , rlabel ) , dtype = jaccard . dtype ) # Best fit, checking it's above threshold. idxmax = tf . cast ( tf . argmax ( jaccard , axis = 0 ) , tf . int32 ) jcdmax = jaccard [ idxmax ] match = jcdmax > matching_threshold existing_match = gmatch [ idxmax ] not_difficult = tf . logical_not ( gdifficults [ idxmax ] ) # TP: match & no previous match and FP: previous match | no match. # If difficult: no record, i.e FP=False and TP=False. tp = tf . logical_and ( not_difficult , tf . logical_and ( match , tf . logical_not ( existing_match ) ) ) ta_tp = ta_tp . write ( i , tp ) fp = tf . logical_and ( not_difficult , tf . logical_or ( existing_match , tf . logical_not ( match ) ) ) ta_fp = ta_fp . write ( i , fp ) # Update grountruth match. mask = tf . logical_and ( tf . equal ( grange , idxmax ) , tf . logical_and ( not_difficult , match ) ) gmatch = tf . logical_or ( gmatch , mask ) return [ i + 1 , ta_tp , ta_fp , gmatch ] # Main loop definition. i = 0 [ i , ta_tp_bool , ta_fp_bool , gmatch ] = tf . while_loop ( m_condition , m_body , [ i , ta_tp_bool , ta_fp_bool , gmatch ] , parallel_iterations = 1 , back_prop = False ) # TensorArrays to Tensors and reshape. tp_match = tf . reshape ( ta_tp_bool . stack ( ) , rshape ) fp_match = tf . reshape ( ta_fp_bool . stack ( ) , rshape ) # Some debugging information... # tp_match = tf.Print(tp_match, #                     [n_gbboxes, #                      tf.reduce_sum(tf.cast(tp_match, tf.int64)), #                      tf.reduce_sum(tf.cast(fp_match, tf.int64)), #                      tf.reduce_sum(tf.cast(gmatch, tf.int64))], #                     'Matching (NG, TP, FP, GM): ') return n_gbboxes , tp_match , fp_match