{"title":"在基于量规的光度立体测量中加速表查找的桶网格结构","authors":"H. C. G. Leitão, R. Saracchini, J. Stolfi","doi":"10.1109/SIBGRAPI.2007.16","DOIUrl":null,"url":null,"abstract":"In this paper, we show how to speed up the table lookup step in gauge-based multi-image photometric stereo. In that step, one must find a pixel of a gauge object, of known shape and color, whose appearance under m different illumination fields is similar to that of a given scene pixel. This search reduces to finding the closest match to a given m- vector in a table with a thousand or more m-vectors. Our speed-up method exploits the fact that the table is in fact a fairly flat two-dimensional manifold in m-dimensional space, so that the search can be efficiently solved with a two-dimensional bucket grid structure.","PeriodicalId":434632,"journal":{"name":"XX Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2007)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2007-10-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A Bucket Grid Structure to Speed Up Table Lookup in Gauge-Based Photometric Stereo\",\"authors\":\"H. C. G. Leitão, R. Saracchini, J. Stolfi\",\"doi\":\"10.1109/SIBGRAPI.2007.16\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we show how to speed up the table lookup step in gauge-based multi-image photometric stereo. In that step, one must find a pixel of a gauge object, of known shape and color, whose appearance under m different illumination fields is similar to that of a given scene pixel. This search reduces to finding the closest match to a given m- vector in a table with a thousand or more m-vectors. Our speed-up method exploits the fact that the table is in fact a fairly flat two-dimensional manifold in m-dimensional space, so that the search can be efficiently solved with a two-dimensional bucket grid structure.\",\"PeriodicalId\":434632,\"journal\":{\"name\":\"XX Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2007)\",\"volume\":\"8 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-10-07\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"XX Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2007)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIBGRAPI.2007.16\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"XX Brazilian Symposium on Computer Graphics and Image Processing (SIBGRAPI 2007)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIBGRAPI.2007.16","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Bucket Grid Structure to Speed Up Table Lookup in Gauge-Based Photometric Stereo
In this paper, we show how to speed up the table lookup step in gauge-based multi-image photometric stereo. In that step, one must find a pixel of a gauge object, of known shape and color, whose appearance under m different illumination fields is similar to that of a given scene pixel. This search reduces to finding the closest match to a given m- vector in a table with a thousand or more m-vectors. Our speed-up method exploits the fact that the table is in fact a fairly flat two-dimensional manifold in m-dimensional space, so that the search can be efficiently solved with a two-dimensional bucket grid structure.