[1]MALIK J, BELONGIE S, LEUNG T, et al. Contour and texture analysis for image segmentation [J].International Journal of Computer Vision, 2001, 43(1): 7-27.
[2]SHI J, MALIK J. Normalized cuts and image segmentation [J].IEEE Transactions on Pattern Analysis and Machine Intelligence, 2000, 22(8): 888-905.
[3]CRISTIANINI N, SHAWE-TAYLOR J, KANDOLA J. Spectral kernel methods for clustering[C]// NIPS'01: Proceedings of the Neural Information Processing Systems. Cambridge: MIT Press, 2002: 649-655.
[4]NG A Y, JORDAN M I, WEISS Y. On spectral clustering: analysis and an algorithm[C]// Advances in Neural Information Processing Systems. Cambridge: MIT Press, 2002: 849-856.
[5]王玲, 薄列峰, 焦李成. 密度敏感的谱聚类[J].电子学报, 2007, 35(8): 1577-1581.
[6]CHEN WEIFU, FENG GUOCAN. Spectral clustering with discriminant cuts [J].Knowledge-Based Systems,2011, 28: 27-37.
[7]谢皝, 张平伟, 罗晟. 基于全局K-means的谱聚类算法[J].JOCA, 2010, 30(7): 1936-1940.
[8]FIEDLER M. Algebraic connectivity of graphs [J].Czechoslovak Mathematical Journal, 1973, 23(98): 298-305.
[9]赵凤, 焦李成, 刘汉强,等. 半监督谱聚类特征向量选择算法[J].模式识别与人工智能, 2011, 24(1): 48-56.
[10]HENDRICKSON B, LELAND R. An improved spectral graph partitioning algorithm for mapping parallel computation[J].SIAM Journal on Scientifical Computing, 1995, 16(2): 452-469.
[11]HAGEN L, KAHNG A B. New spectral methods for ratio cut partitioning and clustering [J].IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 1992, 11(9): 1074-1085.
[12]徐森,卢志茂,顾国昌. 基于矩阵谱分析的文本聚类集成算法[J].模式识别与人工智能, 2009, 22(5): 780-786.
[13]DING C, HE X F, ZHA H Y, et al. Unsupervised learning: self-aggregation in scaled principal component space [C]// PKDD '02: Proceedings of the 6th European Conference on Principles of Data Mining and Knowledge Discovery. Berlin: Springer-Verlag, 2002: 79-112.
[14]FOWLKES C, BELONGIE S, CHUNG F, et al. Spectral grouping using the Nystrm method[J].IEEE Transactions on Pattern Analysis and Machine Intelligence, 2004, 26(2): 214-225.
[15]SARKAR S, SOUNDARARAJAN P. Supervised learning of large perceptual organization: graph spectral partitioning and learning automata[J].IEEE Transactions on Pattern Analysis and Machine Intelligence, 2000, 22(5): 504-525.
[16]MEIL M, SHI J. A random walks view of spectral segmentation [EB/OL]. [2012-03-05]. http://citeseer.ist.psu.edu/viewdoc/summary?doi=10.1.1.33.1501.
[17]WU Z, LEAHY R. An optimal graph theoretic approach to data clustering: theory and its application to image segmentation [J].IEEE Transactions on Pattern Analysis Machine Intelligence, 1993, 15(11): 1101-1113.
[18]DING C H Q, HE X, ZHA H, et al. A min-max cut algorithm for graph partitioning and data clustering [C]// ICDM 2001: Proceedings IEEE International Conference on Data Mining. Washington, DC: IEEE Computer Society, 2001: 107-114.
[19]邹小林, 陈伟福, 冯国灿. 判别割(Dcut)的图像分割及其快速分割算法 [J].中国图象图形学报, 2012,17(2): 222-228.
[20]NIE F P, DING C, LUO D, et al. Improved MinMax cut graph clustering with nonnegative relaxation [C]// ECML PKDD'10: Proceedings of the 2010 European Conference on Machine Learning and Knowledge Discovery in Databases: Part II. Berlin: Springer-Verlag, 2010: 451-466.
[21]XIE F, SHEN Y, HE X. K-way min-max cut for image clustering and junk images filtering from Google images [EB/OL]. [2012-03-05]. http://dl.acm.org/citation.cfm?id=1874083.
[22]PERONA P, FREEMAN W T. A factorization approach to grouping[C]// ECCV '98: Proceedings of the 5th European Conference on Computer Vision. Berlin: Springer-Verlag, 1998, 1: 655-670.
[23]KANNAN R, VEMPALA S, VETTA A. On clustering: good, bad and spectral[J].Journal of the ACM, 2004, 51(3): 497-515.
[24]LIU WEI, WANG YUNHONG, LI S Z, et al. Null space approach of Fisher discriminant analysis for face recognition[EB/OL]. [2012-01-12]. http://www.ee.columbia.edu/~wliu/ECCV04_LiuWei.pdf.
[25]LEVINE M D, NAZIF A M. Dynamic measurement of computer generated image segmentations[J].IEEE Transactions on Pattern Analysis and Machine Intelligence, 1985, 7(2): 155-164. |