视差估计的快速图割算法

28th Picture Coding Symposium Pub Date : 2010-12-01 DOI:10.1109/PCS.2010.5702499

Cheng-Wei Chou, J. Tsai, H. Hang, Hung-Chih Lin

{"title":"视差估计的快速图割算法","authors":"Cheng-Wei Chou, J. Tsai, H. Hang, Hung-Chih Lin","doi":"10.1109/PCS.2010.5702499","DOIUrl":null,"url":null,"abstract":"In this paper, we propose a fast graph cut (GC) algorithm for disparity estimation. Two accelerating techniques are suggested: one is the early termination rule, and the other is prioritizing the α-β swap pair search order. Our simulations show that the proposed fast GC algorithm outperforms the original GC scheme by 210% in the average computation time while its disparity estimation quality is almost similar to that of the original GC.","PeriodicalId":255142,"journal":{"name":"28th Picture Coding Symposium","volume":"86 4","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"A fast graph cut algorithm for disparity estimation\",\"authors\":\"Cheng-Wei Chou, J. Tsai, H. Hang, Hung-Chih Lin\",\"doi\":\"10.1109/PCS.2010.5702499\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we propose a fast graph cut (GC) algorithm for disparity estimation. Two accelerating techniques are suggested: one is the early termination rule, and the other is prioritizing the α-β swap pair search order. Our simulations show that the proposed fast GC algorithm outperforms the original GC scheme by 210% in the average computation time while its disparity estimation quality is almost similar to that of the original GC.\",\"PeriodicalId\":255142,\"journal\":{\"name\":\"28th Picture Coding Symposium\",\"volume\":\"86 4\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2010-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"28th Picture Coding Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCS.2010.5702499\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"28th Picture Coding Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCS.2010.5702499","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

本文提出了一种用于视差估计的快速图割(GC)算法。提出了两种加速技术:一种是提前终止规则，另一种是优先考虑α-β交换对的搜索顺序。仿真结果表明，本文提出的快速GC算法在平均计算时间上比原GC方案提高了210%，而视差估计质量与原GC方案基本相当。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

A fast graph cut algorithm for disparity estimation

In this paper, we propose a fast graph cut (GC) algorithm for disparity estimation. Two accelerating techniques are suggested: one is the early termination rule, and the other is prioritizing the α-β swap pair search order. Our simulations show that the proposed fast GC algorithm outperforms the original GC scheme by 210% in the average computation time while its disparity estimation quality is almost similar to that of the original GC.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

28th Picture Coding Symposium

自引率

0.00%

发文量