{"title":"皮肤检测的统计模型","authors":"B. Jedynak, Huicheng Zheng, M. Daoudi","doi":"10.1109/CVPRW.2003.10094","DOIUrl":null,"url":null,"abstract":"We consider a sequence of three models for skin detection built from a large collection of labelled images. Each model is a maximum entropy model with respect to constraints concerning marginal distributions. Our models are nested. The first model is well known from practitioners. Pixels are considered as independent. The second model is a Hidden Markov Model. It includes constraints that force smoothness of the solution. The third model is a first order model. The full color gradient is included. Parameter estimation as well as optimization cannot be tackled without approximations. We use thoroughly Bethe tree approximation of the pixel lattice. Within it , parameter estimation is eradicated and the belief propagation algorithm permits to obtain exact and fast solution for skin probability at pixel locations. We then assess the performance on the Compaq database.","PeriodicalId":121249,"journal":{"name":"2003 Conference on Computer Vision and Pattern Recognition Workshop","volume":"386 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-06-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"43","resultStr":"{\"title\":\"Statistical Models for Skin Detection\",\"authors\":\"B. Jedynak, Huicheng Zheng, M. Daoudi\",\"doi\":\"10.1109/CVPRW.2003.10094\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We consider a sequence of three models for skin detection built from a large collection of labelled images. Each model is a maximum entropy model with respect to constraints concerning marginal distributions. Our models are nested. The first model is well known from practitioners. Pixels are considered as independent. The second model is a Hidden Markov Model. It includes constraints that force smoothness of the solution. The third model is a first order model. The full color gradient is included. Parameter estimation as well as optimization cannot be tackled without approximations. We use thoroughly Bethe tree approximation of the pixel lattice. Within it , parameter estimation is eradicated and the belief propagation algorithm permits to obtain exact and fast solution for skin probability at pixel locations. We then assess the performance on the Compaq database.\",\"PeriodicalId\":121249,\"journal\":{\"name\":\"2003 Conference on Computer Vision and Pattern Recognition Workshop\",\"volume\":\"386 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-06-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"43\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2003 Conference on Computer Vision and Pattern Recognition Workshop\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/CVPRW.2003.10094\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2003 Conference on Computer Vision and Pattern Recognition Workshop","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CVPRW.2003.10094","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
We consider a sequence of three models for skin detection built from a large collection of labelled images. Each model is a maximum entropy model with respect to constraints concerning marginal distributions. Our models are nested. The first model is well known from practitioners. Pixels are considered as independent. The second model is a Hidden Markov Model. It includes constraints that force smoothness of the solution. The third model is a first order model. The full color gradient is included. Parameter estimation as well as optimization cannot be tackled without approximations. We use thoroughly Bethe tree approximation of the pixel lattice. Within it , parameter estimation is eradicated and the belief propagation algorithm permits to obtain exact and fast solution for skin probability at pixel locations. We then assess the performance on the Compaq database.