最短路径模型下的双目立体匹配算法研究.pdfVIP

ISSN 1673—9418 CODEN JKYTA8 E—mail：fcst@vip．163．com JournalofFrontiersofComputerScienceandTechnologv http：／／www．ceaj．org 1673—9418／2011／05 04 一0374．1l TeI：+86—10—5l616056 DOI：10．3778~．issn．1673—9418．2011．04．009 最短路径模型下的双 目立体匹配算法研究 徐 异 ，云 挺，业 宁 南京林业大学 信息科学与技术学院，南京 210037 ResearchofStereoM atchingAlgorithm throughtheShortestPathM Ode1 xuSheng ，YUNTing YENing ， CollegeofInformationScienceandTechnology , NanjingForestryUniversity，Nanjing210037，China + Correspondingauthor：E-mail：座机电话号码7@qq ． COrn xu sheng，YUN Ting，YE Ning · Research ofstere。matchingalgorithm through thesh。rtestpathmOde1 ． JournalofFrontiersofComputerScienceandTechnology, 2011，5 4 ：374．384． Abstract：TradiI_ionalstereomatchingalgorithmsaretofindthecorrespondencebetwe enleftandrightpixelsbv caJcuJat1ngthedegreeofsimilarity betweenpixels ． Toimprovethematchingaccuracy thecu~entstrategiesfor ， sOIVmgthestereomatchingproblemsareoftentransformedintosolvingtheenergyequationmi nimizationproblem ， and then optimize the global space ． These algorithms include scanline optimizatioI1 algorithm ． dynaInic programmmg algorithm ，graph cutalgorithm and beliefpropagation algorithm ， buteach algo—thm hasits0wn ef1c】ences-HoweVer‘onlythoughtfrom theoriginalmodelitisdiffi culttochangetheirshortc0mings ， ． Fr m the perspectVeofm mm zingtheenergy equationthispaperestablishesanew modelcalledthesh ortestDathmOde1． fheenergyequatonwillbemappedtoadirectedgraph andthenthestereomatchingproblem can besolvedbv ， solVmgtheshortestpath · Afterdescribingtheprincipleofthealgorithm and steps ， thispapershowsthea1gorithm dagram from theangJeofdisparity space ． Experimentsshow thattheshortestpath algorithm overC0mesmanv nnerentdefectsoftheabovefourmethodsandhashigherprecisionandlowertimecOmplexitv ， ． KeywOrds：stere0matchng；energyequationminimi zation；globaloptimization；disparityspace；th eshortestDath 摘 要：传统的双 目立体匹配算法， 是通过计算像素点间的相似程度来找出左图像素点和右图像素点的匹 *TheN lscienceF。undati0n。fJiangsuProvinceunderGr antN。．BK座机电话号码 江苏省 自然科学基金 Received2010—