Segmentation process for SAR Imagery Based on Graph Cuts Algorithm
This paper proposes a method that comes from the minimum cut problem in network flow theory to minimize the MRF energy of posteriori probability. Then maximum flow or minimum cut algorithm is used to deal with MRF segmentation. Experiments on SAR images prove that the proposed method has better accuracy and faster efficiency than standard algorithms.
SAR MRF Graph cuts
Wu Tao Ding Jianlin Liu Junwei Chen Xi Ruan Xiangwei Niu Lei
East China Research Institute of Electronic Engineering, Hefei, China, 230088
国际会议
2011 IEEE CIE International Conference on Radar(2011年IEEE国际雷达会议RADAR 2011)
成都
英文
1627-1630
2011-10-24(万方平台首次上网日期,不代表论文的发表时间)