{"title":"基于有限广义Dirichlet混合鲁棒建模的图像数据库分类","authors":"M. Ismail, H. Frigui","doi":"10.1109/IPTA.2010.5586778","DOIUrl":null,"url":null,"abstract":"We propose a novel image database categorization approach using a possibilistic clustering algorithm. The proposed algorithm is based on a robust data modeling using the Generalized Dirichlet (GD) finite mixture and generates two types of membership degrees. The first one is a posterior probability that indicates the degree to which the point fits the estimated distribution. The second membership represents the degree of “typicality” and is used to indentify and discard noise points. The algorithm minimizes one objective function to optimize GD mixture parameters and possibilistic membership values. This optimization is done iteratively by dynamically updating the density mixture parameters and the membership values in each iteration. The performance of the proposed algorithm is illustrated by using it to categorize a collection of 500 color images. The results are compared with those obtained by the Fuzzy C-means algorithm.","PeriodicalId":236574,"journal":{"name":"2010 2nd International Conference on Image Processing Theory, Tools and Applications","volume":"132 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-07-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Image database categorization using robust modeling of finite Generalized Dirichlet mixture\",\"authors\":\"M. Ismail, H. Frigui\",\"doi\":\"10.1109/IPTA.2010.5586778\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We propose a novel image database categorization approach using a possibilistic clustering algorithm. The proposed algorithm is based on a robust data modeling using the Generalized Dirichlet (GD) finite mixture and generates two types of membership degrees. The first one is a posterior probability that indicates the degree to which the point fits the estimated distribution. The second membership represents the degree of “typicality” and is used to indentify and discard noise points. The algorithm minimizes one objective function to optimize GD mixture parameters and possibilistic membership values. This optimization is done iteratively by dynamically updating the density mixture parameters and the membership values in each iteration. The performance of the proposed algorithm is illustrated by using it to categorize a collection of 500 color images. The results are compared with those obtained by the Fuzzy C-means algorithm.\",\"PeriodicalId\":236574,\"journal\":{\"name\":\"2010 2nd International Conference on Image Processing Theory, Tools and Applications\",\"volume\":\"132 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-07-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2010 2nd International Conference on Image Processing Theory, Tools and Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IPTA.2010.5586778\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2010 2nd International Conference on Image Processing Theory, Tools and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IPTA.2010.5586778","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Image database categorization using robust modeling of finite Generalized Dirichlet mixture
We propose a novel image database categorization approach using a possibilistic clustering algorithm. The proposed algorithm is based on a robust data modeling using the Generalized Dirichlet (GD) finite mixture and generates two types of membership degrees. The first one is a posterior probability that indicates the degree to which the point fits the estimated distribution. The second membership represents the degree of “typicality” and is used to indentify and discard noise points. The algorithm minimizes one objective function to optimize GD mixture parameters and possibilistic membership values. This optimization is done iteratively by dynamically updating the density mixture parameters and the membership values in each iteration. The performance of the proposed algorithm is illustrated by using it to categorize a collection of 500 color images. The results are compared with those obtained by the Fuzzy C-means algorithm.