Efficient Laplacian-based matting Using Gaussian KD-tree.doc

Efficient Laplacian-based matting Using Gaussian KD-tree.doc

ID:32090736

大小:1.63 MB

页数:12页

时间:2019-01-31

Efficient Laplacian-based matting Using Gaussian KD-tree.doc_第1页
Efficient Laplacian-based matting Using Gaussian KD-tree.doc_第2页
Efficient Laplacian-based matting Using Gaussian KD-tree.doc_第3页
Efficient Laplacian-based matting Using Gaussian KD-tree.doc_第4页
Efficient Laplacian-based matting Using Gaussian KD-tree.doc_第5页
资源描述:

《Efficient Laplacian-based matting Using Gaussian KD-tree.doc》由会员上传分享,免费在线阅读,更多相关内容在教育资源-天天文库

1、EfficientLaplacian-basedmattingUsingGaussianKD-treeAbstract:Weproposedaunifiedacceleratingmethodforlaplacian-basedmattingusingGaussianKD-tree.IntroductionRelatedwork本文的主要思想,流程(1)构建KD树(对图像进行采样)(GPU加速)(2)交互(前景点,背景点)(3)将交互的点集扩散到KD树上(GPU加速)(4)构建拉普拉斯矩阵时搜索最近领域(GPU加速)(5)求解拉普拉斯矩阵(GPU加速)(6)在低

2、分辨率matting的结果插值回原图像(GPU加速)在如下三个方面需要利用到最近领域搜索,都可利用GPU加速(1)将交互的点集扩散到KD树上(GPU加速)(2)构建拉普拉斯矩阵时搜索最近领域(GPU加速)(3)在低分辨率matting的结果插值回原图像(GPU加速)主要应用(1)图像的快速去雾(2)视频的快速去雾需要解决的问题(1)GMM模型用于采样及交互(2)更好的采样,参考,OptimizedColorSamplingforRobustMatting(CVPR07)(3)再修改laplacian-basedmatting,提出一个Bilateralweigh

3、tedclosed-formmatting现有方法的缺点CVPR2010.计算量大,耗内存,需要三分图,不适合videomattingClosed-formMattingBothPoissonmattingandGeodesicmattingapproachesinvolveestimatingforegroundandbackgroundcolors/distributionstosomeextent,whichmaysignificantlylowertheirperformancewhentheestimationsarenotaccurate.There

4、centlyproposedclosed-formmattingapproach[Levin06]avoidsthislimitationbyexplicitlyderivingacostfunctionfromlocalsmoothnessassumptionsonforegroundandbackgroundcolorsFandB,andshowthatintheresultingexpressionitispossibletoanalyticallyeliminateFandB,yieldingaquadraticcostfunctionin,whichc

5、anbeeasilysolvedasasparselinearsystemofequations.TheunderlyingassumptionmadeinthisapproachisthateachFandBisalinearmixtureoftwocolorsoverasmallwindow(typically3×3or5×5)aroundeachpixel,whichisreferredtoasthecolorlinemodel.Itisshownthatunderthisassumption,alphavaluesinasmallwindowwcanbe

6、expressedas,,wherereferstocolorchannels,andandareconstantsinthewindow.ThemattingcostfunctionisthendefinedasFurthermore,andcanbeeliminatedfromthecostfunction,yieldingaquadraticcostinthealone:,whereisanN×Nmatrix,whose(i,j)-thelementis:whereisa3×3covariancematrix,isa3×1meanvectoroftheco

7、lorsinawindow,andisthe3×3identitymatrix.ThematrixL,whichiscalledmattingLaplacian,isthemostimportantanalyticresultfromthisapproach.Theoptimalalphavaluesarethencomputedas,s.t.whichisessentiallyaproblemofminimizingaquadraticerrorscore,thuscanbesolvedbyoneofthelinearsystemsolverswhichwil

8、lbediscussed

当前文档最多预览五页,下载文档查看全文

此文档下载收益归作者所有

当前文档最多预览五页,下载文档查看全文
温馨提示:
1. 部分包含数学公式或PPT动画的文件,查看预览时可能会显示错乱或异常,文件下载后无此问题,请放心下载。
2. 本文档由用户上传,版权归属用户,天天文库负责整理代发布。如果您对本文档版权有争议请及时联系客服。
3. 下载前请仔细阅读文档内容,确认文档内容符合您的需求后进行下载,若出现内容与标题不符可向本站投诉处理。
4. 下载文档时可能由于网络波动等原因无法下载或下载错误,付费完成后未能成功下载的用户请联系客服处理。