[1]YIN K. Study on SAR image pressing and ground target recognition technology[D]. Xi'an: Xidian University, 2011. (尹奎英. SAR图像处理机地面目标识别技术研究[D].西安:西安电子科技大学,2011.)
[2]COMANICIU D, MEER P. Mean Shift: a robust approach toward feature space analysis[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2002, 24(5):603-619.
[3]CHENG Y. Mean Shift, mode seeking, and clustering[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1995, 17(8): 790-799.
[4]LI Y, SUN J, TANG C, et al. Lazy snapping[J].ACM Transactions on Graphics, 2004, 23(3): 303-308.
[5]COMANICIU D, MEER P. Mean Shift analysis and application[C]// Proceedings of the 7th IEEE International Conference on Computer Vision. Piscataway: IEEE, 1999: 1197-1203.
[6]PAN Z. Research on detection and automatic target recognition in SAR images[D]. Beijing: Chinese Academy of Sciences Institute of Electronics, 2008: 48-51.(潘卓. SAR目标检测与自动识别相关技术研究[D].北京:中国科学院电子学研究所,2008: 48-51.)
[7]GEMANS S, GEMANS D. Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1984, 6(6):721-741.
[8]BESAG J. Spatial interaction and the statistical analysis of lattice system[J]. Journal of the Royal Statistical Society, Series B: Methodological, 1974, 36(2):192-236.
[9]LIU S, YIN F. The basic principle and its new advances of image segmentation methods based on graph cuts[J]. Acta Automatica Sinca, 2012, 38(6): 911-922. (刘松涛,殷福亮. 基于图割的图像分割方法及其新进展[J].自动化学报, 2012,38(6): 911-922.)
[10]KOLMOGOROV V, ZABIN R. What energy functions can be minimized via graph cuts?[J]. IEEE Transactions on Pattern Analysis and Machine Intelligence, 2004, 26(2):147-159.
[11]BOYKOV Y, JOLLY M. Interactive graph cuts for optimal boundary and region segmentation of objects in N-D images[C]// Proceedings of the 8th IEEE International Conference on Computer Vision. Piscataway: IEEE: 2001: 105-112.
[12]ZHENG J, CHEN Z .Connectivity constrained graph-cut for fast interactive image segmentation[J]. Journal of Computer-Aided Design and Computer Graphics, 2011,23(3): 399-401. (郑加明,陈昭炯.带连通性约束的快速交互Graph-Cut算法[J].计算机辅助设计与图形学学报, 2011,23(3): 399-401.)
[13]Sandia National Laboratory. A portfolio of fine resolution Ka-band SAR images: partΙ[EB/OL]. [2013-06-20]. http://www.sandia.gov/radar/minisar.html. |