The message to be hidden is a binary matrix of size N × N.
The result was a binary matrix X 0, 1) containing information about the presence or absence of a particular tag to describe a given song.
The adjacency matrix (A(G)=[a_{ij}]) of G is a binary matrix of order n such that (a_{ij}=1) if the vertex (v_{i}) is adjacent to the vertex (v_{j}), and 0 otherwise.
The qualitative prior in Table 1 (thin frame) is a binary matrix with entries set to 1 where an input may be required to produce an output, and 0 where this is not the case.
The qualitative prior is a binary matrix with entries initially set to one where an input may be required to produce an output, and zero where this is not the case.
Note that the confidence map is a binary matrix, in which the location of the movement turbulence is set to 0 and the location of the moving object is set to 1.
The result E = (E 1,E 2,…,E,…,E t ) represents the edge points according to each frame, where E t is a binary matrix, E t (x t,y t ) = 1 represents the point (x t,y t ) in F t as an edge point.
More precisely, the ideal mask is a binary matrix, where "1" indicates that the energy of the target is higher than the energy of the interference inside the corresponding TF unit and "0" indicates the opposite [7, 8, 9, 10]: M t,;f) = left{ {begin{array}{ll} 1 & {{text{if}};s t,;f) - n t,;f) > theta}, 0 & {{text{else}}}.
