test_bipartite_match_op.py 5.2 KB
Newer Older
1
#  Copyright (c) 2018 PaddlePaddle Authors. All Rights Reserved.
2 3 4 5 6 7 8 9 10 11 12 13 14 15
#
#Licensed under the Apache License, Version 2.0 (the "License");
#you may not use this file except in compliance with the License.
#You may obtain a copy of the License at
#
#    http://www.apache.org/licenses/LICENSE-2.0
#
#Unless required by applicable law or agreed to in writing, software
#distributed under the License is distributed on an "AS IS" BASIS,
#WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
#See the License for the specific language governing permissions and
#limitations under the License.
import unittest
import numpy as np
16
from op_test import OpTest
17 18


19
def bipartite_match(distance, match_indices, match_dist):
20 21 22 23 24
    """Bipartite Matching algorithm.
    Arg:
        distance (numpy.array) : The distance of two entries with shape [M, N].
        match_indices (numpy.array): the matched indices from column to row
            with shape [1, N], it must be initialized to -1.
25
        match_dist (numpy.array): The matched distance from column to row
26 27 28 29 30 31 32 33 34 35 36 37 38
            with shape [1, N], it must be initialized to 0.
    """
    match_pair = []
    row, col = distance.shape
    for i in range(row):
        for j in range(col):
            match_pair.append((i, j, distance[i][j]))

    match_sorted = sorted(match_pair, key=lambda tup: tup[2], reverse=True)

    row_indices = -1 * np.ones((row, ), dtype=np.int)

    idx = 0
39
    for i, j, dist in match_sorted:
40 41
        if idx >= row:
            break
42
        if match_indices[j] == -1 and row_indices[i] == -1 and dist > 0:
43 44
            match_indices[j] = i
            row_indices[i] = j
45
            match_dist[j] = dist
46 47 48
            idx += 1


49 50
def argmax_match(distance, match_indices, match_dist, threshold):
    r, c = distance.shape
51
    for j in range(c):
52 53 54 55 56 57 58 59 60 61 62
        if match_indices[j] != -1:
            continue
        col_dist = distance[:, j]
        indices = np.argwhere(col_dist >= threshold).flatten()
        if len(indices) < 1:
            continue
        match_indices[j] = indices[np.argmax(col_dist[indices])]
        match_dist[j] = col_dist[match_indices[j]]


def batch_bipartite_match(distance, lod, match_type=None, dist_threshold=None):
63 64 65 66 67
    """Bipartite Matching algorithm for batch input.
    Arg:
        distance (numpy.array) : The distance of two entries with shape [M, N].
        lod (list of int): The offsets of each input in this batch.
    """
68
    n = len(lod)
69 70
    m = distance.shape[1]
    match_indices = -1 * np.ones((n, m), dtype=np.int)
71
    match_dist = np.zeros((n, m), dtype=np.float32)
72 73 74 75
    cur_offset = 0
    for i in range(n):
        bipartite_match(distance[cur_offset:(cur_offset + lod[i]), :],
                        match_indices[i, :], match_dist[i, :])
76
        if match_type == 'per_prediction':
77 78 79
            argmax_match(distance[cur_offset:(cur_offset + lod[i]), :],
                         match_indices[i, :], match_dist[i, :], dist_threshold)
        cur_offset += lod[i]
80
    return match_indices, match_dist
81 82


83
class TestBipartiteMatchOpWithLoD(OpTest):
84 85
    def setUp(self):
        self.op_type = 'bipartite_match'
86
        lod = [[5, 6, 12]]
87 88
        dist = np.random.random((23, 217)).astype('float32')
        match_indices, match_dist = batch_bipartite_match(dist, lod[0])
89

90
        self.inputs = {'DistMat': (dist, lod)}
91
        self.outputs = {
92 93
            'ColToRowMatchIndices': match_indices,
            'ColToRowMatchDist': match_dist,
94 95 96 97 98 99 100 101 102
        }

    def test_check_output(self):
        self.check_output()


class TestBipartiteMatchOpWithoutLoD(OpTest):
    def setUp(self):
        self.op_type = 'bipartite_match'
103
        lod = [[8]]
104 105
        dist = np.random.random((8, 17)).astype('float32')
        match_indices, match_dist = batch_bipartite_match(dist, lod[0])
106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122

        self.inputs = {'DistMat': dist}
        self.outputs = {
            'ColToRowMatchIndices': match_indices,
            'ColToRowMatchDist': match_dist,
        }

    def test_check_output(self):
        self.check_output()


class TestBipartiteMatchOpWithoutLoDLargeScaleInput(OpTest):
    def setUp(self):
        self.op_type = 'bipartite_match'
        lod = [[300]]
        dist = np.random.random((300, 17)).astype('float32')
        match_indices, match_dist = batch_bipartite_match(dist, lod[0])
123

124
        self.inputs = {'DistMat': dist}
125
        self.outputs = {
126
            'ColToRowMatchIndices': match_indices,
D
dangqingqing 已提交
127
            'ColToRowMatchDist': match_dist,
128 129 130 131 132 133
        }

    def test_check_output(self):
        self.check_output()


134 135 136
class TestBipartiteMatchOpWithPerPredictionType(OpTest):
    def setUp(self):
        self.op_type = 'bipartite_match'
137
        lod = [[5, 6, 12]]
138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155
        dist = np.random.random((23, 237)).astype('float32')
        match_indices, match_dist = batch_bipartite_match(dist, lod[0],
                                                          'per_prediction', 0.5)

        self.inputs = {'DistMat': (dist, lod)}
        self.outputs = {
            'ColToRowMatchIndices': match_indices,
            'ColToRowMatchDist': match_dist,
        }
        self.attrs = {
            'match_type': 'per_prediction',
            'dist_threshold': 0.5,
        }

    def test_check_output(self):
        self.check_output()


156 157
if __name__ == '__main__':
    unittest.main()