{"title":"速率约束下含噪图像的高斯混合模型聚类","authors":"K. Ozonat","doi":"10.1109/ACSSC.2005.1599957","DOIUrl":null,"url":null,"abstract":"We consider the problem of classification based on Gauss mixture models for a simple network of two sensors with noisy observations. The goal of each sensor is to give a classification decision based on its noisy observation and the help it receives from the other sensor under the given rate constraint. We formulate the problem as a vector quantization problem and design a Lloyd optimal quantizer, minimizing the classification error for the given rate constraint. Our cross-validated simulations, using a set of aerial images, indicate an improvement in the classification performance (for the given rate constraints) when compared with simple extensions of previously published GMM-based algorithms.","PeriodicalId":326489,"journal":{"name":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","volume":"16 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Gauss Mixture Model Clustering for Noisy Images under Rate Constraints\",\"authors\":\"K. Ozonat\",\"doi\":\"10.1109/ACSSC.2005.1599957\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider the problem of classification based on Gauss mixture models for a simple network of two sensors with noisy observations. The goal of each sensor is to give a classification decision based on its noisy observation and the help it receives from the other sensor under the given rate constraint. We formulate the problem as a vector quantization problem and design a Lloyd optimal quantizer, minimizing the classification error for the given rate constraint. Our cross-validated simulations, using a set of aerial images, indicate an improvement in the classification performance (for the given rate constraints) when compared with simple extensions of previously published GMM-based algorithms.\",\"PeriodicalId\":326489,\"journal\":{\"name\":\"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.\",\"volume\":\"16 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACSSC.2005.1599957\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Conference Record of the Thirty-Ninth Asilomar Conference onSignals, Systems and Computers, 2005.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSSC.2005.1599957","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Gauss Mixture Model Clustering for Noisy Images under Rate Constraints
We consider the problem of classification based on Gauss mixture models for a simple network of two sensors with noisy observations. The goal of each sensor is to give a classification decision based on its noisy observation and the help it receives from the other sensor under the given rate constraint. We formulate the problem as a vector quantization problem and design a Lloyd optimal quantizer, minimizing the classification error for the given rate constraint. Our cross-validated simulations, using a set of aerial images, indicate an improvement in the classification performance (for the given rate constraints) when compared with simple extensions of previously published GMM-based algorithms.