基于随机游走算法的图像分割

Halcom

基于随机游走算法的图像分割：
代码经过，提炼抽取，请参考百度网盘：链接：https://pan.baidu.com/s/1Se-Rd7ccDk4gzH4PkO4OLw 提取码：t09e

1. function [mask,probabilities] = random_walker(img,seeds,labels,beta)
   
2. %
   
3. %Available at: http://www.cns.bu.edu/~lgrady/grady2006random.pdf
   
4. %
   
5. %Note: Requires installation of the Graph Analysis Toolbox available at:
   
6. %http://eslab.bu.edu/software/graphanalysis/
   
7. 
   
8. %Find image size
   
9. img=im2double(img);
   
10. [X Y Z]=size(img);
    
11. 
    
12. %Build graph
    
13. [points edges]=lattice(X,Y);
    
14. % save data.mat points edges
    
15. 
    
16. %Generate weights and Laplacian matrix
    
17. if(Z > 1) %Color images
    
18.     tmp=img(:,:,1);
    
19.     imgVals=tmp(:);
    
20.     tmp=img(:,:,2);
    
21.     imgVals(:,2)=tmp(:);
    
22.     tmp=img(:,:,3);
    
23.     imgVals(:,3)=tmp(:);
    
24. else
    
25.     imgVals=img(:);
    
26. end
    
27. weights=makeweights(edges,imgVals,beta);
    
28. L=laplacian(edges,weights);
    
29. %L=laplacian(edges,weights,length(points),1);
    
30. 
    
31. %Determine which label values have been used
    
32. label_adjust=min(labels); labels=labels-label_adjust+1; %Adjust labels to be > 0
    
33. labels_record(labels)=1;
    
34. labels_present=find(labels_record);
    
35. number_labels=length(labels_present);
    
36. 
    
37. %Set up Dirichlet problem
    
38. boundary=zeros(length(seeds),number_labels);
    
39. for k=1:number_labels
    
40.     boundary(:,k)=(labels(:)==labels_present(k));
    
41. end
    
42. 
    
43. %Solve for random walker probabilities by solving combinatorial Dirichlet
    
44. %problem
    
45. probabilities=dirichletboundary(L,seeds(:),boundary);
    
46. 
    
47. %Generate mask
    
48. [dummy mask]=max(probabilities,[],2);
    
49. mask=labels_present(mask)+label_adjust-1; %Assign original labels to mask
    
50. mask=reshape(mask,[X Y]);
    
51. probabilities=reshape(probabilities,[X Y number_labels]);

复制代码