提交 ef8218be 编写于 作者: B barrierye

update docs test=develop

上级 19b68de7
...@@ -42,8 +42,9 @@ Generate a similarity focus mask with the same shape of input using the followin ...@@ -42,8 +42,9 @@ Generate a similarity focus mask with the same shape of input using the followin
2. For each index, find the largest numbers in the tensor T, so that the same 2. For each index, find the largest numbers in the tensor T, so that the same
row and same column has at most one number(what it means is that if the row and same column has at most one number(what it means is that if the
largest number has been found in the i-th row and the j-th column, then largest number has been found in the i-th row and the j-th column, then
the numbers in the i-th or j-th column will be skipped. Obviously there the numbers in the i-th row or j-th column will be skipped. And then the
will be min(B, C) numbers), and mark the corresponding position of the next largest number will be selected from the remaining numbers. Obviously
there will be min(B, C) numbers), and mark the corresponding position of the
3-D similarity focus mask as 1, otherwise as 0. Do elementwise-or for 3-D similarity focus mask as 1, otherwise as 0. Do elementwise-or for
each index. each index.
3. Broadcast the 3-D similarity focus mask to the same shape of input X. 3. Broadcast the 3-D similarity focus mask to the same shape of input X.
......
...@@ -7567,8 +7567,9 @@ def similarity_focus(input, axis, indexes, name=None): ...@@ -7567,8 +7567,9 @@ def similarity_focus(input, axis, indexes, name=None):
2. For each index, find the largest numbers in the tensor T, so that the same 2. For each index, find the largest numbers in the tensor T, so that the same
row and same column has at most one number(what it means is that if the row and same column has at most one number(what it means is that if the
largest number has been found in the i-th row and the j-th column, then largest number has been found in the i-th row and the j-th column, then
the numbers in the i-th or j-th column will be skipped. Obviously there the numbers in the i-th row or j-th column will be skipped. And then the
will be min(B, C) numbers), and mark the corresponding position of the next largest number will be selected from the remaining numbers. Obviously
there will be min(B, C) numbers), and mark the corresponding position of the
3-D similarity focus mask as 1, otherwise as 0. Do elementwise-or for 3-D similarity focus mask as 1, otherwise as 0. Do elementwise-or for
each index. each index.
3. Broadcast the 3-D similarity focus mask to the same shape of input X. 3. Broadcast the 3-D similarity focus mask to the same shape of input X.
......
Markdown is supported
0% .
You are about to add 0 people to the discussion. Proceed with caution.
先完成此消息的编辑!
想要评论请 注册