compositor.m

来自「一种新的ABO编码算法实现」· M 代码 · 共 23 行

function [bitplane,y]=compositor(x)
[m,n]=size(x);
bitplane(1,1)=0;
for i=1:m
    for j=1:n
      if    i<=m & j~=n
        if x(i,j)>x(i,j+1)
            [x(i,j),x(i,j+1)]=changex(x(i,j),x(i,j+1)); 
            bitplane(i,j+1)=1;
        else
            bitplane(i,j+1)=0;
        end
      elseif i~=m & j==n
          if x(i,n)>x(i+1,1)
             [x(i,j),x(i+1,1)]=changex(x(i,j),x(i+1,1));
             bitplane(i+1,1)=1;
          else
             bitplane(i+1,1)=0;
          end 
      end
    end
end
y=x;