全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

基于WSSD的不规则图像块快速匹配

DOI: 10.11834/jig.20100321

Keywords: 不规则,块匹配,图像修复

Full-Text   Cite this paper   Add to My Lib

Abstract:

传统的图像块匹配加速算法都要求待匹配的图像块具有预先定义好的形状。但有时候由于数据损坏、丢失等原因,待匹配块的形状是不规则的(如图像修复)。针对这种情况,提出了一种无损精度的不规则块匹配加速算法,将不规则块匹配扩展为一求最小加权平方差和(WSSD)的问题,块的形状间接地通过每个像素的权重来控制,这使得图像块都能被统一地当成矩形块。为了进行加速,提出了用快速傅里叶变换(FFT)计算WSSD的方法。并利用待匹配块及其权重在傅里叶变换过程中需大面积补零的特殊性改进了FFT算法,在不损失精度的前提下,进一步降低了其复杂度。最后以图像修复为例,说明WSSD是比SSD更一般的图像块相似度,并为各种图像块匹配的应用提供了一种统一的处理框架。

References

[1]  Wei L Y,Levoy M,Fast texture synthesis using tree structured vector quantization,New York,USA:ACM Prese/Addison-Wesley Publishing,2000.
[2]  Kwatra V,Essa I,Bobick A,Texture optimization for ezample-based synthesis,ACM Transactions on Graphics,2005(3).
[3]  Viola P,Jones M,Robust real-time object detection,International Journal of Computer Vision,2001(2).
[4]  Dellaert F,Kwatra V,Oh S M,Mixture trees for modeling and fast conditional sampling with applications in vision and graphics,New York,USA:IEEE Computer Society,2005.
[5]  Hel-Or Y,Hel-Or H,Real time pattern matching using projection kernels,IEEE Transactions on Pattern Analysis and Machine Intelligence,2005(9).
[6]  Rnfael C,Gonzales,Richard E W,Digital Image Processing,Boston,MA,USA:Addison-Wesley Longman Publishing Co.,Inc,1987.
[7]  Hertzmann A,Jacobs C E,Oliver N,Image analogies,New York,US:ACM Press,2001.
[8]  Criminisi A,Perez P,Toyama K,Object removal by exemplarbased inpainting,New York,USA:IEEE Computer Society,2003.
[9]  Kilthan S L,Drew M,Moller T,Full search content independent block matching based on the fast fourier transform,New York:McGraw-Hill Book Company,Inc,2002.
[10]  Arya S,Mount D M,Netanyahu N S,An optimal algorithm for approximate nearest neighbor searching in fixed dimensions,Journal of the ACM,1998(6).
[11]  Komodakis N,Tziritas G,Image completion using global optimization,New York,USA:IEEE Computer Society,2006.
[12]  Bertalm M,Sapiro G,Caselles V,Image inpainting,New York,USA:ACM Press/Addison-Wesley Publishing,2000.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133