Guillaume Gales, S. Chambon, Alain Crouzil, J. McDonald
{"title":"基于传播的立体匹配可靠性测度","authors":"Guillaume Gales, S. Chambon, Alain Crouzil, J. McDonald","doi":"10.1109/WIAMIS.2012.6226761","DOIUrl":null,"url":null,"abstract":"Seed propagation-based stereo matching can help to reduce ambiguity occuring when a pixel from one image has different putative correspondents in the other one due to difficult areas (repetitive patterns, homogeneous areas, occlusions and depth discontinuities). They rely on previously computed matches (seeds) to reduce the size of the search area, and thus the number of candidates. One approach of these iterative methods selects the “best” seed at each iteration to prevent the propagation of errors. However, little attention has been brought to this best-first selection criterion for which a correlation score is usually employed. This value itself does not consider any ambiguity and is not well-suited to select the most reliable seed. Therefore, in this paper we introduce a reliability measure. It has the advantage of taking into account information from the other candidates, and leads, according to the provided experimental evaluation, to better results than the correlation score alone.","PeriodicalId":346777,"journal":{"name":"2012 13th International Workshop on Image Analysis for Multimedia Interactive Services","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-05-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"5","resultStr":"{\"title\":\"Reliability measure for propagation-based stereo matching\",\"authors\":\"Guillaume Gales, S. Chambon, Alain Crouzil, J. McDonald\",\"doi\":\"10.1109/WIAMIS.2012.6226761\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Seed propagation-based stereo matching can help to reduce ambiguity occuring when a pixel from one image has different putative correspondents in the other one due to difficult areas (repetitive patterns, homogeneous areas, occlusions and depth discontinuities). They rely on previously computed matches (seeds) to reduce the size of the search area, and thus the number of candidates. One approach of these iterative methods selects the “best” seed at each iteration to prevent the propagation of errors. However, little attention has been brought to this best-first selection criterion for which a correlation score is usually employed. This value itself does not consider any ambiguity and is not well-suited to select the most reliable seed. Therefore, in this paper we introduce a reliability measure. It has the advantage of taking into account information from the other candidates, and leads, according to the provided experimental evaluation, to better results than the correlation score alone.\",\"PeriodicalId\":346777,\"journal\":{\"name\":\"2012 13th International Workshop on Image Analysis for Multimedia Interactive Services\",\"volume\":\"22 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2012-05-23\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"5\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2012 13th International Workshop on Image Analysis for Multimedia Interactive Services\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WIAMIS.2012.6226761\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2012 13th International Workshop on Image Analysis for Multimedia Interactive Services","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WIAMIS.2012.6226761","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Reliability measure for propagation-based stereo matching
Seed propagation-based stereo matching can help to reduce ambiguity occuring when a pixel from one image has different putative correspondents in the other one due to difficult areas (repetitive patterns, homogeneous areas, occlusions and depth discontinuities). They rely on previously computed matches (seeds) to reduce the size of the search area, and thus the number of candidates. One approach of these iterative methods selects the “best” seed at each iteration to prevent the propagation of errors. However, little attention has been brought to this best-first selection criterion for which a correlation score is usually employed. This value itself does not consider any ambiguity and is not well-suited to select the most reliable seed. Therefore, in this paper we introduce a reliability measure. It has the advantage of taking into account information from the other candidates, and leads, according to the provided experimental evaluation, to better results than the correlation score alone.