给定一个仅由 0 和 1 组成的矩阵A（在算法的第 4 步之后应该拥有该矩阵，您可以通过以下方式实现第 5 步：

% find column with the maximum number of ones. sum down the rows of the
% matrix and find the column with the largest sum
[ry,xo] = max(sum(A));
% find the corresponding row; do the same thing except sum across the
% matrix's columns
[rx,yo] = max(sum(A,2));
% the values "rx" and "ry" above contain the sums of the row and column
% (respectively) that have the maximum number of ones. divide them by
% 2 according to your algorithm in step 5
rx = rx / 2;
ry = ry / 2;

在上述（未经测试）之后，然后xo, yo, rx, 和ry应填充您的算法指示的值。