After applying the biclustering algorithm to the input data matrix, the columns and rows are clustered giving category and voxel clusters respectively. Each intersection of row and column cluster is a row-column subspace called bicluster. For each voxel (row) cluster, we can find the category (column) winner bicluster, defined by the column cluster that gives maximum mean value. Likewise, for each column cluster, we can also have the voxel (row) winner bicluster.
An interesting question to ask is "Is there any biclusters that are both the category and voxel winner?" This can be found by intersecting the category winner bicluster with the voxel winner bicluster. The "survival" clusters are called "robust winner biclusters" because they are both the winner in category and voxel cluster.
(click at the figure for better resolution.)
Figure above shows: