24小时热门版块排行榜    

查看: 503  |  回复: 1

xiyue6911

新虫 (小有名气)

[交流] 分割图的邻接矩阵仿真

小弟最近研究基于对象的目标检测,第一步进行多尺度分割,
右图为待转化的分割图像,左图为邻接矩阵,行和列表示[1 2 3 4 5 6 7];
关键是,区域相连判断,思路:遍历区域边界,unique边界点的8邻域;
现存问题:如何将邻接矩阵进行可视化,要用labview吗?
自己写的将分割好的图像转化为邻接矩阵:
CODE:
x = repmat(uint8(0),[512 512]);
x(1:512,256)=255;x(170,1:256)=255;x(340,1:256)=255;x(85,256:356)=255;x(170,356:512)=255;x(340,356:512)=255;
x(85:340,356)=255;x(390,356:456)=255;x(450,356:456)=255;x(390:450,356)=255;x(390:450,456)=255;
x = ~im2bw(x);
[L num] = bwlabel(x,8);%邻接区域个数
regionmat = zeros(num);%存储邻接矩阵
imshow(L);
stats = regionprops(L);%构造区域个节点;
for i = 1:num
    node(i).id = i;
    node(i).data = stats(i);
    node(i).relaedge = [1 1 1];
    node(i).weight = [1 1 1];
end
[r c] = find(L==0);%遍历所有边界点
%遍历边界点的8邻域,构造区域邻接集合
[r1 c1] = size(L);
L_new = zeros(r1+2,c1+2);
L_new(2:(size(L_new,1)-1),2:(size(L_new,2)-1)) = L;
col = 8;%最多连通区域;
for i = 1:(size(r,1))
    temp = [L_new(r(i)-1+1,c(i)-1+1) L_new(r(i)-1+1,c(i)+1) L_new(r(i)-1+1,c(i)+1+1);
                    L_new(r(i)+1,c(i)-1+1) L_new(r(i)+1,c(i)+1) L_new(r(i)+1,c(i)+1+1);
                    L_new(r(i)+1+1,c(i)-1+1) L_new(r(i)+1+1,c(i)+1) L_new(r(i)+1+1,c(i)+1+1);];
    p = zeros(1,col);
    temp = unique(temp(:));
    temp = setdiff(temp,0);
    p(1:length(temp)) = temp;
    relas(i,:) = p;
end
relas = unique(relas,'rows');
%赋值邻接矩阵
for i = 1:size(relas,1)
    temp =setdiff(relas(i,:),0);
    cn = nchoosek(temp,2);
    for j =1:size(cn,1)
        regionmat(cn(j,1),cn(j,2)) = 1;
    end
end
disp('regionmat:');disp(regionmat);

分割图的邻接矩阵仿真
测试.JPG

[ Last edited by dbb627 on 2015-11-14 at 14:46 ]
回复此楼
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖

xiyue6911

新虫 (小有名气)

升级版本
直接运行可以生成可视化图形结构
%分割图的邻接矩阵仿真
CODE:
x = repmat(uint8(0),[512 512]);
x(1:512,256)=255;x(170,1:256)=255;x(340,1:256)=255;x(85,256:356)=255;x(170,356:512)=255;x(340,356:512)=255;
x(85:340,356)=255;x(390,356:456)=255;x(450,356:456)=255;x(390:450,356)=255;x(390:450,456)=255;
locations = [85,128;265,128;425,128;425,400;265,300;265,400;85,400];
x = ~im2bw(x);
[L num] = bwlabel(x,8);%邻接区域个数
regionmat = zeros(num);%存储邻接矩阵
figure(1),imshow(L);
for i = 1:size(locations,1)
    text(locations(i,2),locations(i,1),num2str(i));
end
stats = regionprops(L);%构造区域个节点;
for i = 1:num
    node(i).id = i;
    node(i).data = stats(i);
    node(i).relaedge = [1 1 1];
    node(i).weight = [1 1 1];
end
[r c] = find(L==0);%遍历所有边界点
%遍历边界点的8邻域,构造区域邻接集合
[r1 c1] = size(L);
L_new = zeros(r1+2,c1+2);
L_new(2:(size(L_new,1)-1),2:(size(L_new,2)-1)) = L;
col = 8;%最多连通区域;
for i = 1:(size(r,1))
    temp = [L_new(r(i)-1+1,c(i)-1+1) L_new(r(i)-1+1,c(i)+1) L_new(r(i)-1+1,c(i)+1+1);
                    L_new(r(i)+1,c(i)-1+1) L_new(r(i)+1,c(i)+1) L_new(r(i)+1,c(i)+1+1);
                    L_new(r(i)+1+1,c(i)-1+1) L_new(r(i)+1+1,c(i)+1) L_new(r(i)+1+1,c(i)+1+1);];
    p = zeros(1,col);
    temp = unique(temp(:));
    temp = setdiff(temp,0);
    p(1:length(temp)) = temp;
    relas(i,:) = p;
end
relas = unique(relas,'rows');
%赋值邻接矩阵
for i = 1:size(relas,1)
    temp =setdiff(relas(i,:),0);
    cn = nchoosek(temp,2);
    for j =1:size(cn,1)
        regionmat(cn(j,1),cn(j,2)) = 1;
    end
end
disp('regionmat:');disp(regionmat);
%邻接矩阵图形化;
vertexs = [1 1;1 3;2 .5;2 3.5;3 1;3 3;3.5 2];
[r c] = find(regionmat ~= 0);
%绘制节点
figure(2),
axis([0 5 0 5]);
for i = 1:size(vertexs,1)
    hold on,plot(vertexs(i,1),vertexs(i,2),'go','markersize',10);
    hold on,plot(vertexs(i,1),vertexs(i,2),'gx','markersize',10);
    hold on,text(vertexs(i,1),vertexs(i,2)-0.2,num2str(i));
end
%绘制边界
for i = 1:size(r,1)
    line([vertexs(c(i),1) vertexs(r(i),1)],[vertexs(c(i),2) vertexs(r(i),2)],'color','r','linestyle','-.');
end

分割图的邻接矩阵仿真-1
邻接图示例.JPG
2楼2015-10-27 21:44:06
已阅   回复此楼   关注TA 给TA发消息 送TA红花 TA的回帖
相关版块跳转 我要订阅楼主 xiyue6911 的主题更新
普通表情 高级回复 (可上传附件)
信息提示
请填处理意见