{"title":"内禀图像的非局部稀疏模型","authors":"Che-Han Chang, Yu-Ting Cheng, Yung-Yu Chuang","doi":"10.1109/ACPR.2013.20","DOIUrl":null,"url":null,"abstract":"This paper deals with the intrinsic image decomposition problem, a long-standing ill-posed problem that decomposes an input image into shading and reflectance ones. Based on the observation that colors in the scene are usually dominated by a set of representative material colors, we sample material colors in the scene and recover a set of dominant material colors through a voting scheme. With this set of material colors, based on the assumption that pixels with similar chroma likely have similar reflectance values, we adopt global sparsity and non-local constraints on the reflectance and formulate the problem as a least-square minimization problem. We show the effectiveness of our method on a benchmark and demonstrate its use on a few applications.","PeriodicalId":365633,"journal":{"name":"2013 2nd IAPR Asian Conference on Pattern Recognition","volume":"11 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-11-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A Non-local Sparse Model for Intrinsic Images\",\"authors\":\"Che-Han Chang, Yu-Ting Cheng, Yung-Yu Chuang\",\"doi\":\"10.1109/ACPR.2013.20\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper deals with the intrinsic image decomposition problem, a long-standing ill-posed problem that decomposes an input image into shading and reflectance ones. Based on the observation that colors in the scene are usually dominated by a set of representative material colors, we sample material colors in the scene and recover a set of dominant material colors through a voting scheme. With this set of material colors, based on the assumption that pixels with similar chroma likely have similar reflectance values, we adopt global sparsity and non-local constraints on the reflectance and formulate the problem as a least-square minimization problem. We show the effectiveness of our method on a benchmark and demonstrate its use on a few applications.\",\"PeriodicalId\":365633,\"journal\":{\"name\":\"2013 2nd IAPR Asian Conference on Pattern Recognition\",\"volume\":\"11 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-11-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 2nd IAPR Asian Conference on Pattern Recognition\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ACPR.2013.20\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 2nd IAPR Asian Conference on Pattern Recognition","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACPR.2013.20","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
This paper deals with the intrinsic image decomposition problem, a long-standing ill-posed problem that decomposes an input image into shading and reflectance ones. Based on the observation that colors in the scene are usually dominated by a set of representative material colors, we sample material colors in the scene and recover a set of dominant material colors through a voting scheme. With this set of material colors, based on the assumption that pixels with similar chroma likely have similar reflectance values, we adopt global sparsity and non-local constraints on the reflectance and formulate the problem as a least-square minimization problem. We show the effectiveness of our method on a benchmark and demonstrate its use on a few applications.