{"title":"基于局部几何特征的流形光谱聚类图像分割算法","authors":"张荣国, 姚晓玲, 赵建, 胡静, 刘小君","doi":"10.16451/J.CNKI.ISSN1003-6059.202004004","DOIUrl":null,"url":null,"abstract":"To improve the accuracy and timeliness of spectral clustering image segmentation,an algorithm of manifold spectral clustering image segmentation based on local geometry features is proposed.Firstly,considering the manifold structure of image data,the relationship of data intrinsic dimensions is obtained by performing spectral clustering based on local principal components analysis in the k-nearest neighbor region of data points.Then,the local linear reconstruction technique in manifold learning is introduced,and the similarity of local tangent space between data is obtained via mixed linear analyzers,and the similarity matrix with local geometric features is constructed by merging the intrinsic dimension and the local tangent space.Nystr m technique is utilized to approximate eigenvectors of the image to be segmented,and spectral clustering is performed on the constructed k principal eigenvectors.Finally,experiments on Berkeley dataset show the advantages of the proposed algorithm in accuracy and timeliness.","PeriodicalId":34917,"journal":{"name":"模式识别与人工智能","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Manifold Spectral Clustering Image Segmentation Algorithm Based on Local Geometry Features\",\"authors\":\"张荣国, 姚晓玲, 赵建, 胡静, 刘小君\",\"doi\":\"10.16451/J.CNKI.ISSN1003-6059.202004004\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"To improve the accuracy and timeliness of spectral clustering image segmentation,an algorithm of manifold spectral clustering image segmentation based on local geometry features is proposed.Firstly,considering the manifold structure of image data,the relationship of data intrinsic dimensions is obtained by performing spectral clustering based on local principal components analysis in the k-nearest neighbor region of data points.Then,the local linear reconstruction technique in manifold learning is introduced,and the similarity of local tangent space between data is obtained via mixed linear analyzers,and the similarity matrix with local geometric features is constructed by merging the intrinsic dimension and the local tangent space.Nystr m technique is utilized to approximate eigenvectors of the image to be segmented,and spectral clustering is performed on the constructed k principal eigenvectors.Finally,experiments on Berkeley dataset show the advantages of the proposed algorithm in accuracy and timeliness.\",\"PeriodicalId\":34917,\"journal\":{\"name\":\"模式识别与人工智能\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"模式识别与人工智能\",\"FirstCategoryId\":\"1093\",\"ListUrlMain\":\"https://doi.org/10.16451/J.CNKI.ISSN1003-6059.202004004\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Computer Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"模式识别与人工智能","FirstCategoryId":"1093","ListUrlMain":"https://doi.org/10.16451/J.CNKI.ISSN1003-6059.202004004","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Computer Science","Score":null,"Total":0}
Manifold Spectral Clustering Image Segmentation Algorithm Based on Local Geometry Features
To improve the accuracy and timeliness of spectral clustering image segmentation,an algorithm of manifold spectral clustering image segmentation based on local geometry features is proposed.Firstly,considering the manifold structure of image data,the relationship of data intrinsic dimensions is obtained by performing spectral clustering based on local principal components analysis in the k-nearest neighbor region of data points.Then,the local linear reconstruction technique in manifold learning is introduced,and the similarity of local tangent space between data is obtained via mixed linear analyzers,and the similarity matrix with local geometric features is constructed by merging the intrinsic dimension and the local tangent space.Nystr m technique is utilized to approximate eigenvectors of the image to be segmented,and spectral clustering is performed on the constructed k principal eigenvectors.Finally,experiments on Berkeley dataset show the advantages of the proposed algorithm in accuracy and timeliness.