{"title":"遥感图像的无监督小波特征马尔可夫聚类算法","authors":"Zhaohui Wang","doi":"10.1109/ISSPIT51521.2020.9408754","DOIUrl":null,"url":null,"abstract":"Wavelet-feature Markov clustering algorithm for the remotely sensed data is based on an accurate description of abrupt spectral features and an optimized Markov clustering in the wavelet feather space. The peak points can be captured and identified by applying wavelet transform on the expanded multispectral data. The correlation ratio between the two samples is a statistical calculation of the matched peak point positions on the wavelet-feature within an adjustable spectrum domain or a range of wavelet scales. The evenly sampled data can be used to create class centers, depending on the correlation ratio threshold at each Markov step, accelerating the clustering speed by avoiding computation of Euclidean distance for traditional clustering algorithms, such as K-means and ISODATA. By applying a simulated annealing method and gradually shrunk clustering size, Markov clustering leads to the best class centers quickly at each clustering temperature. The experimental results about TM data have verified its acceptable clustering accuracy and high convergence velocity.","PeriodicalId":111385,"journal":{"name":"2020 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-12-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Unsupervised Wavelet-Feature Markov Clustering Algorithm for Remotely Sensed Images\",\"authors\":\"Zhaohui Wang\",\"doi\":\"10.1109/ISSPIT51521.2020.9408754\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Wavelet-feature Markov clustering algorithm for the remotely sensed data is based on an accurate description of abrupt spectral features and an optimized Markov clustering in the wavelet feather space. The peak points can be captured and identified by applying wavelet transform on the expanded multispectral data. The correlation ratio between the two samples is a statistical calculation of the matched peak point positions on the wavelet-feature within an adjustable spectrum domain or a range of wavelet scales. The evenly sampled data can be used to create class centers, depending on the correlation ratio threshold at each Markov step, accelerating the clustering speed by avoiding computation of Euclidean distance for traditional clustering algorithms, such as K-means and ISODATA. By applying a simulated annealing method and gradually shrunk clustering size, Markov clustering leads to the best class centers quickly at each clustering temperature. The experimental results about TM data have verified its acceptable clustering accuracy and high convergence velocity.\",\"PeriodicalId\":111385,\"journal\":{\"name\":\"2020 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)\",\"volume\":\"14 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-12-09\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2020 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISSPIT51521.2020.9408754\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE International Symposium on Signal Processing and Information Technology (ISSPIT)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISSPIT51521.2020.9408754","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Unsupervised Wavelet-Feature Markov Clustering Algorithm for Remotely Sensed Images
Wavelet-feature Markov clustering algorithm for the remotely sensed data is based on an accurate description of abrupt spectral features and an optimized Markov clustering in the wavelet feather space. The peak points can be captured and identified by applying wavelet transform on the expanded multispectral data. The correlation ratio between the two samples is a statistical calculation of the matched peak point positions on the wavelet-feature within an adjustable spectrum domain or a range of wavelet scales. The evenly sampled data can be used to create class centers, depending on the correlation ratio threshold at each Markov step, accelerating the clustering speed by avoiding computation of Euclidean distance for traditional clustering algorithms, such as K-means and ISODATA. By applying a simulated annealing method and gradually shrunk clustering size, Markov clustering leads to the best class centers quickly at each clustering temperature. The experimental results about TM data have verified its acceptable clustering accuracy and high convergence velocity.