基于样本的数字图像修复技术研究
|
摘要
数字图像修复是指计算机按照某种特定的方式对图像中丢失信息的区域进行自动填充,并要求其修复痕迹不为人眼所察觉的一种半自动化的图像处理技术。图像修复其本质是通过不完全信息重构出完全信息,这一直是计算机视觉和人工智能领域一个梦寐以求的目标,同时也是许多其他图像处理技术需要处理的问题。研究数字图像修复技术对于缺乏一定先验知识但又能有效估计信号情况的计算机视觉和人工智能问题具有重要的理论研究意义及广阔的应用前景。
本文研究工作围绕基于样本的图像修复技术展开,对基于样本的图像修复技术的基本理论和现有方法进行了阐述和总结。从算法修复效率和修复质量这两方面展开研究工作,针对现有方法中存在的不足之处,分别从贪婪填充策略和全局建模优化这两个角度提出了一些新的算法和解决方案,并从理论和实验的角度分析和验证了新算法的有效性和普遍适用性。主要的创新工作体现在以下几个方面：
1)提出了基于局部平均灰度熵的快速图像修复算法,在不影响修复质量的前提下,加快传统图像修复算法的计算机执行速度。分析现有图像修复算法的复杂度可知,在每次迭代计算中,样本块与待修复块的一一匹配操作是图像修复算法耗时的主要原因,因此样本块集合的大小,即样本搜索采样范围对计算运行时间至关重要。本文根据局部平均灰度值的一维熵来度量待修复区域周围已知信息的复杂程度,在每次迭代计算中根据此邻域复杂度来自动选择搜索采样范围大小以提高修复速度。
2)提出了基于色差分析和特征统计的图像修复算法,较现有算法而言能较好连接破损边缘和保持结构完整性。分析了现有的基于样本的图像修复算法所采用的修复优先权方法的不足之处以及其对图像修复质量的影响,根据局部色差分析,提出了两种基于特征统计的修复优先权方法：基于距离统计的修复优先权方法和基于相似性统计的修复优先权方法。实验证明,提出的方法较经典的基于等照度线的修复优先权方法而言能更好得分辨图像的结构成分,修复图像的主要结构信息、连接边缘,之后再修复纹理成分,获得令人满意的修复结果。
3)提出了动态加权匹配的图像修复算法,更好得利用了图像的已知信息,提高了图像修复质量。分析了现有的最优匹配块选择方法存在的问题：使用单个样本块的填充方法未能充分利用图像的已知信息；根据距离确定加权系数的加权合成方法可能会模糊修复结果。同时,为了更好地保持填入信息与原有信息的一致性,引入一致性和一阶梯度信息作为约束条件。
4)提出了仅仅旋转位于边缘样本块的算法,以平衡修复质量的提高和计算代价的降低之间的冲突矛盾。为了更充分利用图像的已知信息,采用旋转的方法增加样本空间以提高最终的修复质量,但旋转全体样本块必定大大增加计算开销。为了兼顾计算速度,考虑到自然图像的一些特性,提出只旋转位于边缘的样本块以增加样本空间,并用实验证明所提算法的合理性和优越性。
5)提出了改进的基于置信传播的图像修复算法,更好衡量块与块之间的相似性,提高最终的修复质量。分析了采用贪婪填充策略进行图像修复的不足之处,以及现有的采用图像全局能量建模的置信传播算法进行图像修复存在的两个问题：仅用欧几里得距离度量图像块与块之间的近似程度不足以衡量视觉上的相似性：能量函数的平滑项和数据项的权重一致性不足以表达已知邻域信息的重要性。本文从这两个问题着手,改进了基于置信传播的图像修复算法,并用有环置信传播方法求解其最优近似解。
Image inpainting, which is a semi-automatic image reconstruction technology, is an art of modifying an image or video in a form that is not easily detectable by an ordinary observer, and has become a fundamental research area in image processing. Although stating the image inpainting problem is very simple, the task that actually tries to successfully solve it is far from being a trivial thing to achieve. It is essentially to reconstruct the missing information from the known part, which is not only the desired aim of image processing and computer vision but also the problem with which the image processing would be involved.The study on the image inpainting is of significance in both the theoretical research and practical applications such as special effect, image editing and compression, super-resolution image reconstruction and so on.
This dissertation mainly focuses on the exemplar-based image inpainting which is also known as image completion, explores and sums up some existing theory and schemes, and pro-poses several novel exemplar-based inpainting algorithms based upon greedy filling-in strategy and global optimization to overcome certain limitations of existing inpainting methods. A large number of experiments are used to validate the effectiveness and universality of our proposed algorithms. The main innovation is as follows:
1) We propose a novel rapid image inpainting scheme that could cut down the compu-tation time without reducing the quality of inpainted results. In each iteration, the matching operation between the target patches and the source patch one by one is the primary reason of the high computation cost; as a result, the size of target patch set, namely the area where the target patches are from, is quite important. This paper determines adaptively the area where the algorithms samples target patches in accordance with the entropy of local average distribution of pixel values around the missing region.
2) We analyze the influence of the current isophote-driven filling-in order on the perfor-mance and propose two novel inpainting priority methods according to the statistics of color distribution:distance-based and similarity-based. The experiments show that our proposed methods can identify the structures, inpaint the main missing structure, connect the broken edges in a better way and achieve impressive results.
3) We propose a novel algorithm to generate the best matching patch to fill in the cor-responding missing position of source patch, which can better utilize the known information and improve the quality of inpainted results. Existing representative methods have some prob-lems because they merely use a single target patch as the best matching patch or they simply reconstruct target patch with a weighted similarity function.
4) To make better use of the known information, we propose a novel scheme to extend the sample space through rotating existing target patches. However, the rotation step would make the computation cost intolerable because the original sample space is so large. To take into account both inpainting performance and computation cost, we propose to rotate the tar-get patches on the edges under the considerations of several characteristics of natural images. Moreover, we validate the feasibility and superiority of our proposed algorithm.
5) We improve the inpainting algorithm proposed by Komodakis and use the loopy belief propagation method to get the optimal solution. Current algorithms which minimize a global energy of the MRF have certain problems, for example, the Euclidean distance is not enough to measure the similarity of two patches and the same weight coefficients of the two terms in the energy function do not show their respective signification. The experiments show that our proposed algorithms enhance the quality of inpainted results.
本文研究工作围绕基于样本的图像修复技术展开,对基于样本的图像修复技术的基本理论和现有方法进行了阐述和总结。从算法修复效率和修复质量这两方面展开研究工作,针对现有方法中存在的不足之处,分别从贪婪填充策略和全局建模优化这两个角度提出了一些新的算法和解决方案,并从理论和实验的角度分析和验证了新算法的有效性和普遍适用性。主要的创新工作体现在以下几个方面：
1)提出了基于局部平均灰度熵的快速图像修复算法,在不影响修复质量的前提下,加快传统图像修复算法的计算机执行速度。分析现有图像修复算法的复杂度可知,在每次迭代计算中,样本块与待修复块的一一匹配操作是图像修复算法耗时的主要原因,因此样本块集合的大小,即样本搜索采样范围对计算运行时间至关重要。本文根据局部平均灰度值的一维熵来度量待修复区域周围已知信息的复杂程度,在每次迭代计算中根据此邻域复杂度来自动选择搜索采样范围大小以提高修复速度。
2)提出了基于色差分析和特征统计的图像修复算法,较现有算法而言能较好连接破损边缘和保持结构完整性。分析了现有的基于样本的图像修复算法所采用的修复优先权方法的不足之处以及其对图像修复质量的影响,根据局部色差分析,提出了两种基于特征统计的修复优先权方法：基于距离统计的修复优先权方法和基于相似性统计的修复优先权方法。实验证明,提出的方法较经典的基于等照度线的修复优先权方法而言能更好得分辨图像的结构成分,修复图像的主要结构信息、连接边缘,之后再修复纹理成分,获得令人满意的修复结果。
3)提出了动态加权匹配的图像修复算法,更好得利用了图像的已知信息,提高了图像修复质量。分析了现有的最优匹配块选择方法存在的问题：使用单个样本块的填充方法未能充分利用图像的已知信息；根据距离确定加权系数的加权合成方法可能会模糊修复结果。同时,为了更好地保持填入信息与原有信息的一致性,引入一致性和一阶梯度信息作为约束条件。
4)提出了仅仅旋转位于边缘样本块的算法,以平衡修复质量的提高和计算代价的降低之间的冲突矛盾。为了更充分利用图像的已知信息,采用旋转的方法增加样本空间以提高最终的修复质量,但旋转全体样本块必定大大增加计算开销。为了兼顾计算速度,考虑到自然图像的一些特性,提出只旋转位于边缘的样本块以增加样本空间,并用实验证明所提算法的合理性和优越性。
5)提出了改进的基于置信传播的图像修复算法,更好衡量块与块之间的相似性,提高最终的修复质量。分析了采用贪婪填充策略进行图像修复的不足之处,以及现有的采用图像全局能量建模的置信传播算法进行图像修复存在的两个问题：仅用欧几里得距离度量图像块与块之间的近似程度不足以衡量视觉上的相似性：能量函数的平滑项和数据项的权重一致性不足以表达已知邻域信息的重要性。本文从这两个问题着手,改进了基于置信传播的图像修复算法,并用有环置信传播方法求解其最优近似解。
Image inpainting, which is a semi-automatic image reconstruction technology, is an art of modifying an image or video in a form that is not easily detectable by an ordinary observer, and has become a fundamental research area in image processing. Although stating the image inpainting problem is very simple, the task that actually tries to successfully solve it is far from being a trivial thing to achieve. It is essentially to reconstruct the missing information from the known part, which is not only the desired aim of image processing and computer vision but also the problem with which the image processing would be involved.The study on the image inpainting is of significance in both the theoretical research and practical applications such as special effect, image editing and compression, super-resolution image reconstruction and so on.
This dissertation mainly focuses on the exemplar-based image inpainting which is also known as image completion, explores and sums up some existing theory and schemes, and pro-poses several novel exemplar-based inpainting algorithms based upon greedy filling-in strategy and global optimization to overcome certain limitations of existing inpainting methods. A large number of experiments are used to validate the effectiveness and universality of our proposed algorithms. The main innovation is as follows:
1) We propose a novel rapid image inpainting scheme that could cut down the compu-tation time without reducing the quality of inpainted results. In each iteration, the matching operation between the target patches and the source patch one by one is the primary reason of the high computation cost; as a result, the size of target patch set, namely the area where the target patches are from, is quite important. This paper determines adaptively the area where the algorithms samples target patches in accordance with the entropy of local average distribution of pixel values around the missing region.
2) We analyze the influence of the current isophote-driven filling-in order on the perfor-mance and propose two novel inpainting priority methods according to the statistics of color distribution:distance-based and similarity-based. The experiments show that our proposed methods can identify the structures, inpaint the main missing structure, connect the broken edges in a better way and achieve impressive results.
3) We propose a novel algorithm to generate the best matching patch to fill in the cor-responding missing position of source patch, which can better utilize the known information and improve the quality of inpainted results. Existing representative methods have some prob-lems because they merely use a single target patch as the best matching patch or they simply reconstruct target patch with a weighted similarity function.
4) To make better use of the known information, we propose a novel scheme to extend the sample space through rotating existing target patches. However, the rotation step would make the computation cost intolerable because the original sample space is so large. To take into account both inpainting performance and computation cost, we propose to rotate the tar-get patches on the edges under the considerations of several characteristics of natural images. Moreover, we validate the feasibility and superiority of our proposed algorithm.
5) We improve the inpainting algorithm proposed by Komodakis and use the loopy belief propagation method to get the optimal solution. Current algorithms which minimize a global energy of the MRF have certain problems, for example, the Euclidean distance is not enough to measure the similarity of two patches and the same weight coefficients of the two terms in the energy function do not show their respective signification. The experiments show that our proposed algorithms enhance the quality of inpainted results.
引文
[1]Emile-Male G. The restorer's handbook of easel painting [M]. New York:Van Nostrand Reinhold,1976.
[2]Bertalmio M, Sapiro G, Caselles V, et al. Image inpainting [C]. Proceedings of Proceed-ings of ACM SIGGRAPH, New Orleans:ACM,2000.417-424.
[3]Sivitil K. A digital fix for damaged artwork [EB/OL]. Discovery Magazine,2002.
[4]Wexler Y, Shechtman E, Irani M. Space-time video completion [C]. Proceedings of 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Washington:IEEE,2004.120-127.
[5]Fadili M. J, Starck J. L. EM algorithm for sparse representation-based image inpainting [C]. Proceedings of IEEE International Conference on Image Processing, Italy:IEEE, 2005.61-64.
[6]Cheung S. S, Zhao J, Venkatesh M. V. Efficient object-based video inpainting [C]. Pro-ceedings of 2006 IEEE International Conference on Image Processing, Atlanta:IEEE, 2006.705-708.
[7]顾建平.图像修复快速算法研究[D].北京：中国科学院自动化研究所,2005.
[8]Desolneux A, Moisan L, Morel J. M. From Gestalt theory to image analysis [M]. New York:Springer,2008.
[9]景晓军,李剑锋,张苏慧.图像智能化的目标检测技术(Ⅰ)目标-背景视觉模型[J].北京邮电大学学报,2003,26(增)：1-7.
[10]Koffka K. Principles of gestalt psychology[M]. New York:Harcourt,1935.
[11]Kanizsa G. Organization in Vision [M]. New York:Praeger,1979.
[12]Bertero M, Poggio T. A, Torre V. Ⅲ-posed problems in early vision [C]. Proceedings of the IEEE, USA:IEEE,1988.869-889.
[13]Teschke G, Ramlau R. An iterative algorithm for nonlinear inverse problems with joint sparsity constraints in vector-valued regimes and an application to color image inpainting [J]. Inverse Problems,2007,23(5):1851-1870.
[14]Nitzberg M,Mumford T. Filtering, Segmentation, and Depth [M]. Proceedings of Lecture Notes in Computer Science, Berlin:Springer-Verlag,1993.
[15]Park S. C, Park M. K, Kang M. G. Super-resolution image reconstruction:a technical overview [J]. IEEE Signal Processing Magazine,2003,20(3):21-36.
[16]Masnou S, Morel J. M. Level-lines based disocclusion [C]. Proceedings of 5th IEEE International Conference on Image Processing, Chicago:IEEE.1998.259-263.
[17]Vese L. A study in the BV space of a denoising-deblurring variational problem[J]. Applied Mathematics Optimization.2001,44(2):131-161.
[18]Barcelos C. A. Z, Batista M. A. Image restoration using digital inpainting and noise removal [J]. Image and Vision Computing,2007,25(1):61 -69.
[19]Fornasier M. Nonlinear projection recovery in digital inpainting for color image restora-tion [J]. Journal of Mathematical Imaging and Vision Archive,2006,24(3):359-373.
[20]Wang J. F, Hsu H. J, Liao S. C. A novel framework for object removal from digital photograph [C]. Proceedings of IEEE International Conference on Image Processing, Italy:IEEE,2005.73-76.
[21]Vevatua R, Babu K. R. Linear feature extraction and description [J]. Computer Graphics and Image Processing,1980,13(3):257-269.
[22]Yuille A. L, Hallinan P. W, Cohen D. S. Feature extraction from faces using deformable templates [C]. Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition, San Diego:IEEE,1989.104-109.
[23]Chan T. F, Shen J, Zhou H. Total variation wavelet inpainting [J]. Journal of Mathemati-cal Imaging and Vision,2006,25(1):107-125.
[24]Patwardhan K. A, Sapiro G. Projection based image and video inpainting using wavelet [C]. Proceedings of IEEE International Conference on Image Processing, Spain:IEEE, 2003.857-860.
[25]Chan Y. L, Hsieh C. T, Hsu C. H. Progressive image inpainting based on wavelet trans-form [J]. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,2005, E88-A(10):2826-2834.
[26]Wu J, Ruan Q. Q. Object removal by cross isophotes exemplar-based inpainting [C]. Proceedings of 18th International Conference on Pattern Recognition, Hong Kong:IEEE, 2006.810-813.
[27]Tschumperle D, Deriche R. Vector-valued image regularization with pdes:a common framework for different applications [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence,2005,27(4):506-517.
[28]Yedidia J. S, Freeman W. T, Weiss Y. Understanding belief propagation and its general-izations [R]. Japan:Mitsubishi Electric Research Laboratories,2001.
[29]Kennedy J, Eberhart R. Particle swarm optimization[C]. Proceedings of IEEE Interna-tional Conference on Neural Networks, Australia:IEEE,1995.1942-1948.
[30]Bernardo J. M, Smith A. Bayesian Theory [M]. USA:John Wiley and Sons,2000.
[31]Jensen F. V. An introduction to Bayesian networks [M]. USA:Springer,1996.
[32]Box G. E. P, Tiao G. C. Bayesian inference in statistical analysis [M]. USA:John Wiley and Sons,1993.
[33]Li S. Z. Markov Random Field Modeling in Image Analysis [M]. Tokyo:Springer,2001.
[34]Yasuda M, Ohkubo J, Tanaka K. Digital image inpainting based on markov random field [C]. Proceedings of Proceedings of International Conference on Computational Intelligence for Modeling, Control and Automation, and International Conference on Intelligent Agents, Web Technologies and Internet Commerce, Austra:IEEE,2005.747-752.
[35]Efros A. A, Freeman W. T. Image quilting for texture synthesis and transfer [C]. Proceed-ings of ACM Transactions on Graphics (SIGGRAPH 01), USA:ACM,2001.341-346.
[36]Efros A. A, Leung T. K. Texture synthesis by non-parametric sampling [C]. Proceedings of 7th IEEE International Conference on Computer Vision, Greece:IEEE,1992.1033-1038.
[37]Nocedal J, Wright S. J. Numerical optimization [M]. USA:Springer,1999.
[38]Ekeland I, Temam R. Convex analysis and variational problems [M]. Philadelphia: SAIM,1987.
[39]Rockafellar R. T, Wets R. J. B. Variational analysis [M]. USA:Springer,2004.
[40]Chan T, Shen J. Mathematical models for local non-texture inpainting [J]. SIAM Journal on Applied Mathematics,2002,62(3):1019-1043.
[41]Chan T, Shen J. Non-texture inpainting by curvature driven diffusion [J]. Journal of visual communication and image representation,2001,12(4):436-449.
[42]Ballester C, Bertalmio M, Caselles V, et al. Filling-in by joint interpolation of vector fields and gray levels [J]. IEEE Transactions on Image Processing,2001,10(8):1200-1211.
[43]Chan T. F, Kang S. H, Shen J. Euler's elastica and curvature based inpainting [J]. SIAM Journal of Applied Math,2002,63(2):564-592.
[44]Esedoglu S, Shen J. Digital image inpainting by the Mumford-Shah-Euler image model [J]. European Journal of Applied Mathematics,2002,13:353-370.
[45]Grossauer H, Schcrzer O. Using the complex Ginzburg-Landau equation for digital in-painting in 2D and 3D [C]. Proceedings of Scale Space Methods in Computer Vision, UK:Springer,2003.225-236.
[46]Bertozzi A. L, Esedoglu S. Gillette A. Inpainting of binary images using the cahn-hilliard equation[J]. IEEE Transactions on Image Processing,2007,16(1):285-291.
[47]Bertalmio M, Bertozzi A. L, Sapiro G. Navier-stokes, fluid dynamics and image and video inpainting [C]. Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Wisconsin:USA,2001.355-362.
[48]Auroux D, Masmoudi M. A one-shot inpainting algorithm based on the topological asymptotic analysis [J]. Computational and Applied Mathematics,2006,25(2):1-17.
[49]Galic I, Weickert J, Welk M, et al. Image compression with anisotropic diffusion [J]. Journal of Mathematical Imaging and vision,2008,31:255-269.
[50]Rares A, Reinders M. J. T, Biemond J. Edge-based image restoration [J]. IEEE Transac-tions on Image Processing,2005,14(10):1454-1468.
[51]Tschumperle D. Fast anisotropic smoothing of multi-valued images using curvature-preserving PDE's [J]. International Journal of Computer Vision,2006,68(1):65-82.
[52]Bornemann F, Marz F. Fast image inpainting based on coherence transport [J]. Journal of Mathematical Imaging and Vision,2007,28(3):259-278.
[53]Aujol J. F, Ladjal S, Masnou S. Exemplar-based inpainting from a variational point of view [J]. SIAM Journal on Mathematical Analysis,2010,42(3):1246-1285.
[54]Arias P, Caselles V, Sapiro G. A variational framework for non-local image inpainting [C]. Proceedings of 8th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition, Saint Petersburg:Springer,2009.345-358.
[55]Arias P, Facciolo G, Caselles V, et al. A variational framework for exemplar-based image inpainting [J]. International Journal of Computer Vision,2011,93(3):319-347.
[56]Kovesi P. Image features from phase congruency [J]. Journal of Visual Communication and Image Representation,1999,1(3):1-26.
[57]Bugeau A, Bertalmio M, Caselles V, et al. A comprehensive framework for image in-painting [J]. IEEE Transactions on Image Processing,2010,19(10):2634-2645.
[58]Guo B, Shum H, Xu Y. Q. Chaos mosaic:fast and memory efficient texture synthesis [R]. Proceedings of ACM Transactions on Graphics (SIGGRAPH 01), USA:Microsoft Research,2000.
[59]Liang L, Liu C, Xu Y. Q, et al. Real-time texture synthesis by patch-based sampling [J]. ACM Transactions on Graphics.2001.20(3):923-932.
[60]Ashikhmin M. Synthesizing natural textures [C]. Proceedings of ACM Symposium on Interactive 3D Graphics, California:ACM,2001.217-226.
[61]Wei L. Y, Levoy M. Fast texture synthesis using tree-structured vector quantization [C]. Proceedings of ACM Conference on Graphics (SIGGRAPH), New Orleans:ACM,2000. 479-488.
[62]Drori I, Cohen-Or D, Yeshrun H. Fragment-based image completion [C]. Proceedings of ACM SIGGRAPH, San Diego:ACM,2003.303-312.
[63]Jia J, Tang C. K. Image repairing:robust image synthesis by adaptive nd tensor voting [C]. Proceedings of 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Wisconsin:IEEE,2003.643-650.
[64]Wexler Y, Schechtman E, Irani M. Space-time completion of Video [J]. IEEE Transac-tions on Pattern Analysis and Machine Intelligence,2007,29(3):463-476.
[65]V. K, Schodl A, Essa I, et al. Graphcut textures:image and video synthesis using graph cuts [C]. Proceedings of ACM SIGGRAPH, Sandiego:ACM,2003.277-286.
[66]Criminisi A, Perez P, Toyama K. Object removal by exemplar-based image inpainting [C]. Proceedings of International Conference on Computer Vision, France:IEEE,2003. 721-728.
[67]Criminisi A, Perez P, Toyama K. Region filling and object removal by exemplar-based image inpainting [J]. IEEE Transactions on Image Processing,2004,19(3):1200-1212.
[68]Bertalmio M, Vese L, Sapiro G, et al. Simultaneous structure and texture image inpainting [J]. IEEE Transactions on Image Processing,2003,12(8):882-889.
[69]Wu J. Y, Ruan Q. Q. A novel exemplar-based image completion model [J]. Journal of Information Science and Engineering,2009,25(2):481-497.
[70]Nie D, L. M, Xiao S. Similarity based image inpainting method [C]. Proceedings of 12th international Conference on Multi-Media Modeling, Beijing:IEEE,2006.344-347.
[71]Pavic D, Schonefeld V, Kobbelt I. Interactive image completion with perspective correc-tion [J]. Visual Computer,2006,22(9):671-381.
[72]Wong A, Orchard J. A nonlocal-means approach to exemplar-based inpainting [C]. Pro-ceedings of 15th IEEE International Conference on Image Processing, California:IEEE, 2008.2600-2603.
[73]肖春霞,黄志勇,聂勇伟,et al.结合图像细节特征的的全局优化纹理合成[J].计算机学报,2009,32(6)：1]96-1205.
[74]陈中贵,刘利刚.王国瑾。基于全局优化的图像块填充修复方法[J].计算机研究与发展,2009,46(1)：144-15().
[75]Xu Z, Sun J. Image inpainting by patch propagation using patch sparsity [J]. IEEE Transactions on Image Processing,2010,19(5):1153-1165.
[76]Li X, Zhao M. Image inpainting with salient structure completion and texture propagation [J]. Pattern Recognition Letters,2011,32(9):1256-1266.
[77]Cao F, Gousseau Y, Masnou S, et al. Geometrically guided exemplar-based inpainting [J].2009.
[78]Ni K. Y. Variational PDE-based image segmentation and inpainting with applications in computer graphics [D]. California:University of California, Los Angeles,2008.
[79]Dobrosotskaya J. A, Bertozzi A. L. A wavelet-laplace variational technique for im-age deconvolution and inpainting [J]. IEEE Transactions on Image Processing,2008, 17(5):657-663.
[80]Cai J, Chan R, Shen Z. A framelet-based image inpainting algorithm [J]. Applied and Computational Harmonic Analysis,2008,24(2):131-149.
[81]Papandreou G, Maragos P, Kokaram A. Image inpainting with a wavelet domain hidden markov tree model [C]. Proceedings of 2008 IEEE international Conference on Acous-tics, Speech and Signal Processing, Las Vegas:IEEE,2008.773-776.
[82]Chan R. H, Wen Y, Yip A. M. A fast optimization transfer algorithm for image inpainting in wavelet domains [J]. IEEE Transactions on Image Processing,2009,18(7):1467-1476.
[83]Jiang L, Feng X, Yin H. Structure and texture image inpainting using sparse representa-tions and iterative curvelet thresholding approach [J]. International Journal of Wavelet, Multiresolution and Information Processing,2008,6(5):691-705.
[84]Hung K. M, Hsieh C. T. A novel image inpainting technique based on bandelet transform [C]. Proceedings of International Conference on Computer Modeling and Simulation, Hainan:IEEE,2010.133-137.
[85]Levin A, Zomet A, Weiss Y. Learning how to inpaint from global image statistics [C]. Proceedings of the ninth IEEE International Conference on Computer Vision, Tokyo: IEEE,2003.305-312.
[86]Wang Y, Zhu Q. F. Error control and concealment for video communication:a review [C]. Proceedings of the IEEE, Santa Clara:IEEE,1998.974-997.
[87]Chen L. Y, Chan S. C, Shum H. Y. A joint motion image inpainting method for error concealment in video coding [C]. Proceedings of International Conference on Image Processing, Atlanta:IEEE,2006.2241-2244.
[881 Wu G. L, Chen C, Chien S. Algorithm and architecture design of image inpainting engine for video error concealment applications[J]. IEEE Transactions on Circuits and Systems for Video Technology,2011,21(6):792-803.
[89]Wang C, Sun X, Wu F, et al. Image compression using structure-aware inpainting [C]. Proceedings of 2006 IEEE international Symposium on Circuit and System, Greece: IEEE,2006.1816-1819.
[90]Liu D, Sun X, Wu F, et al. Image compression with edge-based inpainting [J]. IEEE Transaction on Circuits and System for video technology,2007,17(10):1273-1287.
[91]Rane S. D, Sapiro G, Bertalmio M. Structure and texture filling-in of missing image blocks in wireless transmission and compression applications [J]. IEEE Transactions on Image Processing,2003,12(3):296-303.
[92]Chan T, Ng M. K, Yau A. C, et al. Super-resolution image reconstruction using fast in-painting algorithms [J]. Applied and Computational Harmonic Analysis,2007,23(1):3-24.
[93]Renaud R, Baroncini V, Gusmao A. A. Gusmao et al. Final report from the video qual-ity experts group on the validation of the objective models of video quality assessment [EB/OL]. the IEEE, http://www.wqeg.org.2005-01-10.
[94]Wang Z, Bovik A. C, Simoncelli E. P. Structural approaches to image quality assessment to appear in handbook of image and video processing (Second Edition) [M], New York: Academic Press,2002.1-33.
[95]佟雨兵,张其善,胡薇薇.视频质量评价方法综述[J].计算机辅助设计与图形学报,2006,18(5)：735-741.
[96]Wang Z, Simoncelli E. P, Bovik A. C. Multi-scale structural similarity for image quality assessment [C]. Proceedings of IEEE Asilomar Conference on Signals, System, and Computers, California:IEEE,2003.1398-1402.
[97]Wang Z, Li Q. Informatioin content weighting for perceptual image quality assessment [J]. IEEE Transactions on Image Processing,2011,20(3):1185-1198.
[98]Bertalmio M. Strong-continuzation, contrast-invariant inpainting with a third-order opti-mal PDE [J]. IEEE Transactions on Image Inpainting,2006,15(7):1934-1938.
[99]Chan T. F, Shen J. Variational image inpainting [J]. Communications on pure and applied mathematics,2005,58(5):579-619.
[100]Perona P, Malik J. Scale-space and edge detection using anisotropic diffusion [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence,1990,12(7):629-639.
[101]Gilboa G, Sochen N, Zeevi Y. Y. Forward-and-backward diffusion processes for adaptive image enhancement and denoising [J]. IEEE Transactions on Image Processing,2002, 11(7):689-703.
[102]Lee J. A, Geets X, Gregoire V, et al. Edge-preserving filtering of images with low pho- ton counts [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence,2008, 30(6):1014-1027.
[103]Nie X, Unbehauen R. Edge preserving filtering by combining nonlinear mean and median filters [J]. IEEE Transactions on Signal Processing,1991,39(11):2552-2554.
[104]Humphrey D, Tauhman D. A filtering approach to edge preserving MAP estimation of images [J]. IEEE Transactions on Signal Processing,2011,20(5):1234-1248.
[105]Albarez L, Lions P. L, Morel J. M. Image selective smoothing and edge detection by nonlinear diffusion [J]. SIAM Journal on Numerical Analysis,1992,29:845-866.
[106]Rudin S. Total variation based image restoration with free removal algorithms [J]. Phys-ica D,1992,60:259-268.
[107]Besag J. Spatial interaction and the statistical analysis of lattice system [J]. Journal of the Royal Statistical Society:Series B,1974,36:192-236.
[108]Cross G. R, Jain A. K. Markov random fields texture models [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence,1983,5(1):25-39.
[109]Freeman W, Pasztor E, Carmichael O. Learning low-level vision [J]. International Journal of Computer Vision,2000,40(1):25-47.
[110]Igehy H, Pereira L. Image replacement through texture synthesis [C]. Proceedings of International Conference on Image Processing, Washington:IEEE,1997.186-189.
[111]Bornard R, Lecan E, Laborelli L, et al. Missing data correction in still images and image sequences [C]. Proceedings of the 10th ACM International Conference on Multimedia, France:ACM,2002.355-361.
[112]Geman S, Graffigne C. Markov random field image models and their applications to com-puter vision [C]. Proceedings of the International Congress of Mathematicians, Berkley: IMU,1986.1496-1517.
[113]Gerhard W. Image analysis, random fields and markov chain monte carlo methods:a mathematical introduction [M]. New York:Springer-Verlag,2003.
[114]Szeliski R, Zabih R, Scharstein D, et al. A comparative study of energy minimization methods for markov random fields[C]. Proceedings of European Conference of Com-puter Vision, Austria:Springer,2006.16-29.
[115]Ho H. T, Goecke R. Automatic parametrisation for an image completion method based on markov random fields[C]. Proceedings of IEEE International Conference on Image Processing, Texas:IEEE,2007.541-544.
[116]Dai S. Baker S, Kang S. B. An MRF-based deinterlacing algorithm with exemplar-based refinement [J]. IEEE Transactions on Image Processing,2009,18(5):956-968.
[117]Noda H, Shirazi M. N, Kawaguchi E. Textured image segmentation using MRF in wavelet domain [C]. Proceedings of IEEE International Conference on Image Processing, Canada:IEEE,2000.572-575.
[118]Zou M. Y. Deconvolution and signal recovery [M]. Beijing:National Defence Industry Press,2001.
[119]Woods J. W. Two-dimensional discrete Markovian Fields [J]. IEEE Transactions on Information Theory,1972.18:232-240.
[120]Wang R, Gu D, Liu G, et al. A multi-scale image inpainting algorithm based on GMRF model [C]. Proceedings of 2009 International Conference on Robotics and Biomimentics, Tianjin:IEEE,2000.1844-1848.
[121]陈仁喜.图像缺损信息的修复方法研究[M].北京：中国科学遥感应用研究所,2006.
[122]Vese L, Osher S. Modeling textures with total variation minimization and oscillating patterns in image processing [J]. Journal of Scientific Computing,2003,19:553-572.
[123]Elad M, Starck J. L, Querre P, et al. Simultaneous cartoon and texture image inpaint-ing using morphological component analysis [J]. Applied and Computational Harmonic Analysis,2005,19:340-358.
[124]Guleryuz O. G. Nonlinear approximation based image recovery using adaptive sparse reconstructions [C]. Proceedings of 2003 International Conference on Image Processing, Spain:IEEE,2003.713-716.
[125]Guleryuz O. G. Nonlinear approximation based image recovery using adaptive sparse reconstructions and iterated denoising-part i:Theory [J]. IEEE Transactions on Image Processing,2006,15(3):539-554.
[126]Guleryuz O. G. Nonlinear approximation based image recovery using adaptive sparse re-constructions and iterated denoising-part ii:Adaptive algorithms [J]. IEEE Transactions on Image Processing,2006,15(5):555-571.
[127]Fadili M. J, Starck J. L, Murtagh F. Inpainting and zooming using sparse representations [J]. The Computer Journal,2009,52(1):64-79.
[128]Mallat S, Zhang Z. Matching pursuit with a time-frequency dictionary [J]. IEEE Trans-actions on Signal Processing,1993,41(12):3397-3415.
[129]Peyre G. Non-negative sparse modeling of textures [C]. Proceedings of Scale and Varia-tional Methods in Computer Vision, Italy:IEEE,2007.628-639.
[130]Chen S. S, Donoho D. L, Saunders M. A. Atomic decomposition by basis pursuit [J]. SIAM Journal on Scientific Computing.1999,20(1):33-61.
[131]Elad M. Aharon M. Image denoising via sparse and redundant representations over learned dictionaries[J]. IEEE Transactions on Image Processing,2006,15(12):3736-3745.
[132]Maire J, Elad M, Sapiro G. Sparse representation for color image restoration[J]. IEEE Transactions on Image Processing,2008,17(1):1057-1069.
[133]Ventura R. F, Vandergheynst P, Frossard P, et al. Color image scalable coding with match-ing pursuit [C]. Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing, Canada:IEEE,2004.53-69.
[134]Mairal J, Bach F, Ponce J, et al. Discriminative learned dictionary for local image analysis [C]. Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, Alaska:IEEE,2008.1-8.
[135]Sun J, Yuan L, Jia J, et al. Image completion with structure propagation [C]. Proceedings of ACM SIGGRAPH, Los Angeles:ACM,2005.861-868.
[136]Shen J. B, Jin X. G, Zhou C, et al. Gradient based image completion by solving the Poisson equation [J]. Computers and Graphics,2007,31(1):119-126.
[137]Kwatra V, Essa I, Bobick A, et al. Texture optimization for example-based synthesis [C]. Proceedings of ACM SIGGRAPH, Los Angeles:ACM,2005.795-802.
[138]Komodakis N, Tzurutas G. Image completion using efficient belief propagation via prior-ity scheduling and dynamic pruning [J]. IEEE Transactions on Image Processing,2007, 16(11):2649-2661.
[139]Bellman R. E. Dynamic programming [M]. New York:Princeton University Press,1957.
[140]Pearl J. Probabilistic reasoning in intelligent systems:networks of plausible inference [M]. California:Morgan Kaufman Publishers,1988.
[141]Qin A. K, Huang V. L, Suganthan P. N. Differential evolution algorithm with strategy adaptation for global numerical optimization [J]. IEEE Transactions on Evolutionary Computation,2009,13(2):398-417.
[142]Sun J, Shum H. Y, Zhang N. N. Stereo matching using belief propagation [C]. Pro-ceedings of European Conference on Computer Vision, Copenhagen:Springer.2002. 510-524.
[143]Perez P, Gangnet M, Blake A. Patchworks:example-based region tiling for image editing [R]. USA:Microsoft Research.2004.
[144]Perez P, Gangnet M, Blake A. Poisson image editing[C]. Proceedings of ACM SIG- GRAPH, San Diego:ACM,2003.
[145]Felzenszwalb P. F, HuttenIocher D. P. Efficient belief propagation for early vision [C]. Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Washington:ACM,2004.
[146]Sudderth E. B, Ihler A. T, Freeman W. T, et al. Nonparametric belief propagation[C]. Proceedings of 2003 IEEE Computer Society Conference on Computer Vision and Pat-tern Recognition, Madison:ACM,2003.
[147]Isard M. Pampas:real-valued graphical models for computer vision [C]. Proceedings of 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Madison:ACM,2003.
[148]Tao W. B, Tian J. W, Liu J. Image Segmentation by three-level thresholding based on maximum fuzzy entropy and genetic algorithm [J]. Pattern Recognition Letters,2003, 24(16):3069-3078.
[149]Pal N. R, K. P. S. A review on image segmentation techniques [J]. Pattern Recognition, 1993,26(9):1277-1294.
[150]Rivera M, Ocegueda O, Marroquin J. L. Entropy-controlled quadratic markov measure field models for efficient image segmentation [J]. IEEE Transactions on Image Process-ing,2007,16(12):3047-3057.
[151]Cheng M, Hsieh C, Lin S, et al. Robust algorithm for exemplar-based image inpaint-ing [C]. Proceedings of International Conference on Computer Graphics, Imaging and Visualization, Beijing:IEEE,2005.
[152]Barnes C, Shechtman E, Finkelstein A, et al. Patchmatch:a randomized correspondence algorithm for structural image editing [C]. Proceedings of ACM SIGGRAPH, Orleans: ACM,2009.
[153]Fang C, Lien J. J. Rapid image completion system using multiresolution patch-based directional and nondirectional approaches [J]. IEEE Transactions on Image Processing, 2009,18(12):2769-2779.
[154]石扬.基于相位信息的图像边缘检测算法研究[D].大连：大连理工大学,2007.
[155]Wolhlberg B. Inpainting by joint optimization of linear combinations of exemplars [J]. IEEE Signal Processing Letters,2011,18(1):75-78.
[156]Roweis S. T, Saul L. K. Nonlinear dimensionality reduction by locally linear embedding [J]. Science,2000,290(5500):2323-2326.
[157]Chang H, Yeung D. Y, Xiong Y. Super-resolution through neighbor embedding [C]. Washington:IEEE,2004.60-65.
[158]Chan T. M, Zhang J, Pu.1, et al. Neighbor embedding based super-resolution algo-rithm through edge detection and feature selection[J]. Pattern Recognition Letters,2009, 30(5):494-502.
[159]Parpinelli R. S, Lopes H. S, Freitas A. A. Data mining with an ant colony optimization algorithm [J]. IEEE Transactions on Evolutionary Computation,2002,6(4):321-332.
[160]Poli R, Kennedy J, Blackwell T. Particle swarm optimization [J]. Swarm Intelligence, 2007,1(1):33-57.
[161]Herrera F, Lozano M. Gradual distributed real-coded genetic algorithms [J]. IEEE Trans-actions on Evolutionary Computation,2000,4(l):43-63.
[162]宋晓峰,王爽,刘芳.基于区域MRF和贝叶斯置信传播的SAR图像分割[J].电子学报,2010,38(12)：2810-2815.
[163]Weiss Y, Freeman W. T. On the optimality of solutions of the max-product belief propa-gation algorithm in arbitrary graphs [J]. IEEE Transactions on Information Theory,2001, 47(2):723-735.
[164]Boykov Y, Veksler O, Zabih R. Fast approximate energy minimization via graph cuts [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence,2001,23(11):1222-1239.
[165]Wainwright M. J, Jaakkola T. S, Willsky A. S. Map estimation via agreement on hyper trees:message-passing and linear-programming approaches [J]. IEEE Transactions on Information Theory,2005,51(11):3697-3717.
[166]Kohnogorov V. Convergent tree-reweighted message passing for energy minimization [J]. Pattern Analysis and Machine Intelligence,2006,28(10):1568-1583.
[167]Kolmogorov V, Wainwright M. On the optimality of tree-reweighted max-product message-passing [C]. Edinburgh,2005.316-332.
[168]Yedidia J. S, Freeman W. T, Weiss Y. Generalized Belief Propagation [C]. Cambridge: MIT,2001.689-695.
[169]Yedidia J. S, Freeman W. T, Weiss Y. Constructing free-energy approximations and generalized belief propagation algorithms [J]. IEEE Transactions on Information Theory, 2005,51(7):2282-2312.
[170]Tappen M. F, Freeman W. T. Comparison of graph cuts with belief propagation for stereo, using identical MRF parameters[C]. Tokyo:IEEE,2003.900-906.
[171]Weiss Y, Freeman W. Correctness of belief propagation in Gaussian graphical models of arbitrary topology[J], Neural Computation,2001,13(10):2173-2200.
[172]Peyre G. Manifold models for signals and images [J]. Computer Vision and Image Understanding,2009,113(2):249-260.
[2]Bertalmio M, Sapiro G, Caselles V, et al. Image inpainting [C]. Proceedings of Proceed-ings of ACM SIGGRAPH, New Orleans:ACM,2000.417-424.
[3]Sivitil K. A digital fix for damaged artwork [EB/OL]. Discovery Magazine,2002.
[4]Wexler Y, Shechtman E, Irani M. Space-time video completion [C]. Proceedings of 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Washington:IEEE,2004.120-127.
[5]Fadili M. J, Starck J. L. EM algorithm for sparse representation-based image inpainting [C]. Proceedings of IEEE International Conference on Image Processing, Italy:IEEE, 2005.61-64.
[6]Cheung S. S, Zhao J, Venkatesh M. V. Efficient object-based video inpainting [C]. Pro-ceedings of 2006 IEEE International Conference on Image Processing, Atlanta:IEEE, 2006.705-708.
[7]顾建平.图像修复快速算法研究[D].北京：中国科学院自动化研究所,2005.
[8]Desolneux A, Moisan L, Morel J. M. From Gestalt theory to image analysis [M]. New York:Springer,2008.
[9]景晓军,李剑锋,张苏慧.图像智能化的目标检测技术(Ⅰ)目标-背景视觉模型[J].北京邮电大学学报,2003,26(增)：1-7.
[10]Koffka K. Principles of gestalt psychology[M]. New York:Harcourt,1935.
[11]Kanizsa G. Organization in Vision [M]. New York:Praeger,1979.
[12]Bertero M, Poggio T. A, Torre V. Ⅲ-posed problems in early vision [C]. Proceedings of the IEEE, USA:IEEE,1988.869-889.
[13]Teschke G, Ramlau R. An iterative algorithm for nonlinear inverse problems with joint sparsity constraints in vector-valued regimes and an application to color image inpainting [J]. Inverse Problems,2007,23(5):1851-1870.
[14]Nitzberg M,Mumford T. Filtering, Segmentation, and Depth [M]. Proceedings of Lecture Notes in Computer Science, Berlin:Springer-Verlag,1993.
[15]Park S. C, Park M. K, Kang M. G. Super-resolution image reconstruction:a technical overview [J]. IEEE Signal Processing Magazine,2003,20(3):21-36.
[16]Masnou S, Morel J. M. Level-lines based disocclusion [C]. Proceedings of 5th IEEE International Conference on Image Processing, Chicago:IEEE.1998.259-263.
[17]Vese L. A study in the BV space of a denoising-deblurring variational problem[J]. Applied Mathematics Optimization.2001,44(2):131-161.
[18]Barcelos C. A. Z, Batista M. A. Image restoration using digital inpainting and noise removal [J]. Image and Vision Computing,2007,25(1):61 -69.
[19]Fornasier M. Nonlinear projection recovery in digital inpainting for color image restora-tion [J]. Journal of Mathematical Imaging and Vision Archive,2006,24(3):359-373.
[20]Wang J. F, Hsu H. J, Liao S. C. A novel framework for object removal from digital photograph [C]. Proceedings of IEEE International Conference on Image Processing, Italy:IEEE,2005.73-76.
[21]Vevatua R, Babu K. R. Linear feature extraction and description [J]. Computer Graphics and Image Processing,1980,13(3):257-269.
[22]Yuille A. L, Hallinan P. W, Cohen D. S. Feature extraction from faces using deformable templates [C]. Proceedings of IEEE Computer Society Conference on Computer Vision and Pattern Recognition, San Diego:IEEE,1989.104-109.
[23]Chan T. F, Shen J, Zhou H. Total variation wavelet inpainting [J]. Journal of Mathemati-cal Imaging and Vision,2006,25(1):107-125.
[24]Patwardhan K. A, Sapiro G. Projection based image and video inpainting using wavelet [C]. Proceedings of IEEE International Conference on Image Processing, Spain:IEEE, 2003.857-860.
[25]Chan Y. L, Hsieh C. T, Hsu C. H. Progressive image inpainting based on wavelet trans-form [J]. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences,2005, E88-A(10):2826-2834.
[26]Wu J, Ruan Q. Q. Object removal by cross isophotes exemplar-based inpainting [C]. Proceedings of 18th International Conference on Pattern Recognition, Hong Kong:IEEE, 2006.810-813.
[27]Tschumperle D, Deriche R. Vector-valued image regularization with pdes:a common framework for different applications [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence,2005,27(4):506-517.
[28]Yedidia J. S, Freeman W. T, Weiss Y. Understanding belief propagation and its general-izations [R]. Japan:Mitsubishi Electric Research Laboratories,2001.
[29]Kennedy J, Eberhart R. Particle swarm optimization[C]. Proceedings of IEEE Interna-tional Conference on Neural Networks, Australia:IEEE,1995.1942-1948.
[30]Bernardo J. M, Smith A. Bayesian Theory [M]. USA:John Wiley and Sons,2000.
[31]Jensen F. V. An introduction to Bayesian networks [M]. USA:Springer,1996.
[32]Box G. E. P, Tiao G. C. Bayesian inference in statistical analysis [M]. USA:John Wiley and Sons,1993.
[33]Li S. Z. Markov Random Field Modeling in Image Analysis [M]. Tokyo:Springer,2001.
[34]Yasuda M, Ohkubo J, Tanaka K. Digital image inpainting based on markov random field [C]. Proceedings of Proceedings of International Conference on Computational Intelligence for Modeling, Control and Automation, and International Conference on Intelligent Agents, Web Technologies and Internet Commerce, Austra:IEEE,2005.747-752.
[35]Efros A. A, Freeman W. T. Image quilting for texture synthesis and transfer [C]. Proceed-ings of ACM Transactions on Graphics (SIGGRAPH 01), USA:ACM,2001.341-346.
[36]Efros A. A, Leung T. K. Texture synthesis by non-parametric sampling [C]. Proceedings of 7th IEEE International Conference on Computer Vision, Greece:IEEE,1992.1033-1038.
[37]Nocedal J, Wright S. J. Numerical optimization [M]. USA:Springer,1999.
[38]Ekeland I, Temam R. Convex analysis and variational problems [M]. Philadelphia: SAIM,1987.
[39]Rockafellar R. T, Wets R. J. B. Variational analysis [M]. USA:Springer,2004.
[40]Chan T, Shen J. Mathematical models for local non-texture inpainting [J]. SIAM Journal on Applied Mathematics,2002,62(3):1019-1043.
[41]Chan T, Shen J. Non-texture inpainting by curvature driven diffusion [J]. Journal of visual communication and image representation,2001,12(4):436-449.
[42]Ballester C, Bertalmio M, Caselles V, et al. Filling-in by joint interpolation of vector fields and gray levels [J]. IEEE Transactions on Image Processing,2001,10(8):1200-1211.
[43]Chan T. F, Kang S. H, Shen J. Euler's elastica and curvature based inpainting [J]. SIAM Journal of Applied Math,2002,63(2):564-592.
[44]Esedoglu S, Shen J. Digital image inpainting by the Mumford-Shah-Euler image model [J]. European Journal of Applied Mathematics,2002,13:353-370.
[45]Grossauer H, Schcrzer O. Using the complex Ginzburg-Landau equation for digital in-painting in 2D and 3D [C]. Proceedings of Scale Space Methods in Computer Vision, UK:Springer,2003.225-236.
[46]Bertozzi A. L, Esedoglu S. Gillette A. Inpainting of binary images using the cahn-hilliard equation[J]. IEEE Transactions on Image Processing,2007,16(1):285-291.
[47]Bertalmio M, Bertozzi A. L, Sapiro G. Navier-stokes, fluid dynamics and image and video inpainting [C]. Proceedings of the 2001 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Wisconsin:USA,2001.355-362.
[48]Auroux D, Masmoudi M. A one-shot inpainting algorithm based on the topological asymptotic analysis [J]. Computational and Applied Mathematics,2006,25(2):1-17.
[49]Galic I, Weickert J, Welk M, et al. Image compression with anisotropic diffusion [J]. Journal of Mathematical Imaging and vision,2008,31:255-269.
[50]Rares A, Reinders M. J. T, Biemond J. Edge-based image restoration [J]. IEEE Transac-tions on Image Processing,2005,14(10):1454-1468.
[51]Tschumperle D. Fast anisotropic smoothing of multi-valued images using curvature-preserving PDE's [J]. International Journal of Computer Vision,2006,68(1):65-82.
[52]Bornemann F, Marz F. Fast image inpainting based on coherence transport [J]. Journal of Mathematical Imaging and Vision,2007,28(3):259-278.
[53]Aujol J. F, Ladjal S, Masnou S. Exemplar-based inpainting from a variational point of view [J]. SIAM Journal on Mathematical Analysis,2010,42(3):1246-1285.
[54]Arias P, Caselles V, Sapiro G. A variational framework for non-local image inpainting [C]. Proceedings of 8th International Conference on Energy Minimization Methods in Computer Vision and Pattern Recognition, Saint Petersburg:Springer,2009.345-358.
[55]Arias P, Facciolo G, Caselles V, et al. A variational framework for exemplar-based image inpainting [J]. International Journal of Computer Vision,2011,93(3):319-347.
[56]Kovesi P. Image features from phase congruency [J]. Journal of Visual Communication and Image Representation,1999,1(3):1-26.
[57]Bugeau A, Bertalmio M, Caselles V, et al. A comprehensive framework for image in-painting [J]. IEEE Transactions on Image Processing,2010,19(10):2634-2645.
[58]Guo B, Shum H, Xu Y. Q. Chaos mosaic:fast and memory efficient texture synthesis [R]. Proceedings of ACM Transactions on Graphics (SIGGRAPH 01), USA:Microsoft Research,2000.
[59]Liang L, Liu C, Xu Y. Q, et al. Real-time texture synthesis by patch-based sampling [J]. ACM Transactions on Graphics.2001.20(3):923-932.
[60]Ashikhmin M. Synthesizing natural textures [C]. Proceedings of ACM Symposium on Interactive 3D Graphics, California:ACM,2001.217-226.
[61]Wei L. Y, Levoy M. Fast texture synthesis using tree-structured vector quantization [C]. Proceedings of ACM Conference on Graphics (SIGGRAPH), New Orleans:ACM,2000. 479-488.
[62]Drori I, Cohen-Or D, Yeshrun H. Fragment-based image completion [C]. Proceedings of ACM SIGGRAPH, San Diego:ACM,2003.303-312.
[63]Jia J, Tang C. K. Image repairing:robust image synthesis by adaptive nd tensor voting [C]. Proceedings of 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Wisconsin:IEEE,2003.643-650.
[64]Wexler Y, Schechtman E, Irani M. Space-time completion of Video [J]. IEEE Transac-tions on Pattern Analysis and Machine Intelligence,2007,29(3):463-476.
[65]V. K, Schodl A, Essa I, et al. Graphcut textures:image and video synthesis using graph cuts [C]. Proceedings of ACM SIGGRAPH, Sandiego:ACM,2003.277-286.
[66]Criminisi A, Perez P, Toyama K. Object removal by exemplar-based image inpainting [C]. Proceedings of International Conference on Computer Vision, France:IEEE,2003. 721-728.
[67]Criminisi A, Perez P, Toyama K. Region filling and object removal by exemplar-based image inpainting [J]. IEEE Transactions on Image Processing,2004,19(3):1200-1212.
[68]Bertalmio M, Vese L, Sapiro G, et al. Simultaneous structure and texture image inpainting [J]. IEEE Transactions on Image Processing,2003,12(8):882-889.
[69]Wu J. Y, Ruan Q. Q. A novel exemplar-based image completion model [J]. Journal of Information Science and Engineering,2009,25(2):481-497.
[70]Nie D, L. M, Xiao S. Similarity based image inpainting method [C]. Proceedings of 12th international Conference on Multi-Media Modeling, Beijing:IEEE,2006.344-347.
[71]Pavic D, Schonefeld V, Kobbelt I. Interactive image completion with perspective correc-tion [J]. Visual Computer,2006,22(9):671-381.
[72]Wong A, Orchard J. A nonlocal-means approach to exemplar-based inpainting [C]. Pro-ceedings of 15th IEEE International Conference on Image Processing, California:IEEE, 2008.2600-2603.
[73]肖春霞,黄志勇,聂勇伟,et al.结合图像细节特征的的全局优化纹理合成[J].计算机学报,2009,32(6)：1]96-1205.
[74]陈中贵,刘利刚.王国瑾。基于全局优化的图像块填充修复方法[J].计算机研究与发展,2009,46(1)：144-15().
[75]Xu Z, Sun J. Image inpainting by patch propagation using patch sparsity [J]. IEEE Transactions on Image Processing,2010,19(5):1153-1165.
[76]Li X, Zhao M. Image inpainting with salient structure completion and texture propagation [J]. Pattern Recognition Letters,2011,32(9):1256-1266.
[77]Cao F, Gousseau Y, Masnou S, et al. Geometrically guided exemplar-based inpainting [J].2009.
[78]Ni K. Y. Variational PDE-based image segmentation and inpainting with applications in computer graphics [D]. California:University of California, Los Angeles,2008.
[79]Dobrosotskaya J. A, Bertozzi A. L. A wavelet-laplace variational technique for im-age deconvolution and inpainting [J]. IEEE Transactions on Image Processing,2008, 17(5):657-663.
[80]Cai J, Chan R, Shen Z. A framelet-based image inpainting algorithm [J]. Applied and Computational Harmonic Analysis,2008,24(2):131-149.
[81]Papandreou G, Maragos P, Kokaram A. Image inpainting with a wavelet domain hidden markov tree model [C]. Proceedings of 2008 IEEE international Conference on Acous-tics, Speech and Signal Processing, Las Vegas:IEEE,2008.773-776.
[82]Chan R. H, Wen Y, Yip A. M. A fast optimization transfer algorithm for image inpainting in wavelet domains [J]. IEEE Transactions on Image Processing,2009,18(7):1467-1476.
[83]Jiang L, Feng X, Yin H. Structure and texture image inpainting using sparse representa-tions and iterative curvelet thresholding approach [J]. International Journal of Wavelet, Multiresolution and Information Processing,2008,6(5):691-705.
[84]Hung K. M, Hsieh C. T. A novel image inpainting technique based on bandelet transform [C]. Proceedings of International Conference on Computer Modeling and Simulation, Hainan:IEEE,2010.133-137.
[85]Levin A, Zomet A, Weiss Y. Learning how to inpaint from global image statistics [C]. Proceedings of the ninth IEEE International Conference on Computer Vision, Tokyo: IEEE,2003.305-312.
[86]Wang Y, Zhu Q. F. Error control and concealment for video communication:a review [C]. Proceedings of the IEEE, Santa Clara:IEEE,1998.974-997.
[87]Chen L. Y, Chan S. C, Shum H. Y. A joint motion image inpainting method for error concealment in video coding [C]. Proceedings of International Conference on Image Processing, Atlanta:IEEE,2006.2241-2244.
[881 Wu G. L, Chen C, Chien S. Algorithm and architecture design of image inpainting engine for video error concealment applications[J]. IEEE Transactions on Circuits and Systems for Video Technology,2011,21(6):792-803.
[89]Wang C, Sun X, Wu F, et al. Image compression using structure-aware inpainting [C]. Proceedings of 2006 IEEE international Symposium on Circuit and System, Greece: IEEE,2006.1816-1819.
[90]Liu D, Sun X, Wu F, et al. Image compression with edge-based inpainting [J]. IEEE Transaction on Circuits and System for video technology,2007,17(10):1273-1287.
[91]Rane S. D, Sapiro G, Bertalmio M. Structure and texture filling-in of missing image blocks in wireless transmission and compression applications [J]. IEEE Transactions on Image Processing,2003,12(3):296-303.
[92]Chan T, Ng M. K, Yau A. C, et al. Super-resolution image reconstruction using fast in-painting algorithms [J]. Applied and Computational Harmonic Analysis,2007,23(1):3-24.
[93]Renaud R, Baroncini V, Gusmao A. A. Gusmao et al. Final report from the video qual-ity experts group on the validation of the objective models of video quality assessment [EB/OL]. the IEEE, http://www.wqeg.org.2005-01-10.
[94]Wang Z, Bovik A. C, Simoncelli E. P. Structural approaches to image quality assessment to appear in handbook of image and video processing (Second Edition) [M], New York: Academic Press,2002.1-33.
[95]佟雨兵,张其善,胡薇薇.视频质量评价方法综述[J].计算机辅助设计与图形学报,2006,18(5)：735-741.
[96]Wang Z, Simoncelli E. P, Bovik A. C. Multi-scale structural similarity for image quality assessment [C]. Proceedings of IEEE Asilomar Conference on Signals, System, and Computers, California:IEEE,2003.1398-1402.
[97]Wang Z, Li Q. Informatioin content weighting for perceptual image quality assessment [J]. IEEE Transactions on Image Processing,2011,20(3):1185-1198.
[98]Bertalmio M. Strong-continuzation, contrast-invariant inpainting with a third-order opti-mal PDE [J]. IEEE Transactions on Image Inpainting,2006,15(7):1934-1938.
[99]Chan T. F, Shen J. Variational image inpainting [J]. Communications on pure and applied mathematics,2005,58(5):579-619.
[100]Perona P, Malik J. Scale-space and edge detection using anisotropic diffusion [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence,1990,12(7):629-639.
[101]Gilboa G, Sochen N, Zeevi Y. Y. Forward-and-backward diffusion processes for adaptive image enhancement and denoising [J]. IEEE Transactions on Image Processing,2002, 11(7):689-703.
[102]Lee J. A, Geets X, Gregoire V, et al. Edge-preserving filtering of images with low pho- ton counts [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence,2008, 30(6):1014-1027.
[103]Nie X, Unbehauen R. Edge preserving filtering by combining nonlinear mean and median filters [J]. IEEE Transactions on Signal Processing,1991,39(11):2552-2554.
[104]Humphrey D, Tauhman D. A filtering approach to edge preserving MAP estimation of images [J]. IEEE Transactions on Signal Processing,2011,20(5):1234-1248.
[105]Albarez L, Lions P. L, Morel J. M. Image selective smoothing and edge detection by nonlinear diffusion [J]. SIAM Journal on Numerical Analysis,1992,29:845-866.
[106]Rudin S. Total variation based image restoration with free removal algorithms [J]. Phys-ica D,1992,60:259-268.
[107]Besag J. Spatial interaction and the statistical analysis of lattice system [J]. Journal of the Royal Statistical Society:Series B,1974,36:192-236.
[108]Cross G. R, Jain A. K. Markov random fields texture models [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence,1983,5(1):25-39.
[109]Freeman W, Pasztor E, Carmichael O. Learning low-level vision [J]. International Journal of Computer Vision,2000,40(1):25-47.
[110]Igehy H, Pereira L. Image replacement through texture synthesis [C]. Proceedings of International Conference on Image Processing, Washington:IEEE,1997.186-189.
[111]Bornard R, Lecan E, Laborelli L, et al. Missing data correction in still images and image sequences [C]. Proceedings of the 10th ACM International Conference on Multimedia, France:ACM,2002.355-361.
[112]Geman S, Graffigne C. Markov random field image models and their applications to com-puter vision [C]. Proceedings of the International Congress of Mathematicians, Berkley: IMU,1986.1496-1517.
[113]Gerhard W. Image analysis, random fields and markov chain monte carlo methods:a mathematical introduction [M]. New York:Springer-Verlag,2003.
[114]Szeliski R, Zabih R, Scharstein D, et al. A comparative study of energy minimization methods for markov random fields[C]. Proceedings of European Conference of Com-puter Vision, Austria:Springer,2006.16-29.
[115]Ho H. T, Goecke R. Automatic parametrisation for an image completion method based on markov random fields[C]. Proceedings of IEEE International Conference on Image Processing, Texas:IEEE,2007.541-544.
[116]Dai S. Baker S, Kang S. B. An MRF-based deinterlacing algorithm with exemplar-based refinement [J]. IEEE Transactions on Image Processing,2009,18(5):956-968.
[117]Noda H, Shirazi M. N, Kawaguchi E. Textured image segmentation using MRF in wavelet domain [C]. Proceedings of IEEE International Conference on Image Processing, Canada:IEEE,2000.572-575.
[118]Zou M. Y. Deconvolution and signal recovery [M]. Beijing:National Defence Industry Press,2001.
[119]Woods J. W. Two-dimensional discrete Markovian Fields [J]. IEEE Transactions on Information Theory,1972.18:232-240.
[120]Wang R, Gu D, Liu G, et al. A multi-scale image inpainting algorithm based on GMRF model [C]. Proceedings of 2009 International Conference on Robotics and Biomimentics, Tianjin:IEEE,2000.1844-1848.
[121]陈仁喜.图像缺损信息的修复方法研究[M].北京：中国科学遥感应用研究所,2006.
[122]Vese L, Osher S. Modeling textures with total variation minimization and oscillating patterns in image processing [J]. Journal of Scientific Computing,2003,19:553-572.
[123]Elad M, Starck J. L, Querre P, et al. Simultaneous cartoon and texture image inpaint-ing using morphological component analysis [J]. Applied and Computational Harmonic Analysis,2005,19:340-358.
[124]Guleryuz O. G. Nonlinear approximation based image recovery using adaptive sparse reconstructions [C]. Proceedings of 2003 International Conference on Image Processing, Spain:IEEE,2003.713-716.
[125]Guleryuz O. G. Nonlinear approximation based image recovery using adaptive sparse reconstructions and iterated denoising-part i:Theory [J]. IEEE Transactions on Image Processing,2006,15(3):539-554.
[126]Guleryuz O. G. Nonlinear approximation based image recovery using adaptive sparse re-constructions and iterated denoising-part ii:Adaptive algorithms [J]. IEEE Transactions on Image Processing,2006,15(5):555-571.
[127]Fadili M. J, Starck J. L, Murtagh F. Inpainting and zooming using sparse representations [J]. The Computer Journal,2009,52(1):64-79.
[128]Mallat S, Zhang Z. Matching pursuit with a time-frequency dictionary [J]. IEEE Trans-actions on Signal Processing,1993,41(12):3397-3415.
[129]Peyre G. Non-negative sparse modeling of textures [C]. Proceedings of Scale and Varia-tional Methods in Computer Vision, Italy:IEEE,2007.628-639.
[130]Chen S. S, Donoho D. L, Saunders M. A. Atomic decomposition by basis pursuit [J]. SIAM Journal on Scientific Computing.1999,20(1):33-61.
[131]Elad M. Aharon M. Image denoising via sparse and redundant representations over learned dictionaries[J]. IEEE Transactions on Image Processing,2006,15(12):3736-3745.
[132]Maire J, Elad M, Sapiro G. Sparse representation for color image restoration[J]. IEEE Transactions on Image Processing,2008,17(1):1057-1069.
[133]Ventura R. F, Vandergheynst P, Frossard P, et al. Color image scalable coding with match-ing pursuit [C]. Proceedings of IEEE International Conference on Acoustics, Speech, and Signal Processing, Canada:IEEE,2004.53-69.
[134]Mairal J, Bach F, Ponce J, et al. Discriminative learned dictionary for local image analysis [C]. Proceedings of IEEE Conference on Computer Vision and Pattern Recognition, Alaska:IEEE,2008.1-8.
[135]Sun J, Yuan L, Jia J, et al. Image completion with structure propagation [C]. Proceedings of ACM SIGGRAPH, Los Angeles:ACM,2005.861-868.
[136]Shen J. B, Jin X. G, Zhou C, et al. Gradient based image completion by solving the Poisson equation [J]. Computers and Graphics,2007,31(1):119-126.
[137]Kwatra V, Essa I, Bobick A, et al. Texture optimization for example-based synthesis [C]. Proceedings of ACM SIGGRAPH, Los Angeles:ACM,2005.795-802.
[138]Komodakis N, Tzurutas G. Image completion using efficient belief propagation via prior-ity scheduling and dynamic pruning [J]. IEEE Transactions on Image Processing,2007, 16(11):2649-2661.
[139]Bellman R. E. Dynamic programming [M]. New York:Princeton University Press,1957.
[140]Pearl J. Probabilistic reasoning in intelligent systems:networks of plausible inference [M]. California:Morgan Kaufman Publishers,1988.
[141]Qin A. K, Huang V. L, Suganthan P. N. Differential evolution algorithm with strategy adaptation for global numerical optimization [J]. IEEE Transactions on Evolutionary Computation,2009,13(2):398-417.
[142]Sun J, Shum H. Y, Zhang N. N. Stereo matching using belief propagation [C]. Pro-ceedings of European Conference on Computer Vision, Copenhagen:Springer.2002. 510-524.
[143]Perez P, Gangnet M, Blake A. Patchworks:example-based region tiling for image editing [R]. USA:Microsoft Research.2004.
[144]Perez P, Gangnet M, Blake A. Poisson image editing[C]. Proceedings of ACM SIG- GRAPH, San Diego:ACM,2003.
[145]Felzenszwalb P. F, HuttenIocher D. P. Efficient belief propagation for early vision [C]. Proceedings of the 2004 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Washington:ACM,2004.
[146]Sudderth E. B, Ihler A. T, Freeman W. T, et al. Nonparametric belief propagation[C]. Proceedings of 2003 IEEE Computer Society Conference on Computer Vision and Pat-tern Recognition, Madison:ACM,2003.
[147]Isard M. Pampas:real-valued graphical models for computer vision [C]. Proceedings of 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, Madison:ACM,2003.
[148]Tao W. B, Tian J. W, Liu J. Image Segmentation by three-level thresholding based on maximum fuzzy entropy and genetic algorithm [J]. Pattern Recognition Letters,2003, 24(16):3069-3078.
[149]Pal N. R, K. P. S. A review on image segmentation techniques [J]. Pattern Recognition, 1993,26(9):1277-1294.
[150]Rivera M, Ocegueda O, Marroquin J. L. Entropy-controlled quadratic markov measure field models for efficient image segmentation [J]. IEEE Transactions on Image Process-ing,2007,16(12):3047-3057.
[151]Cheng M, Hsieh C, Lin S, et al. Robust algorithm for exemplar-based image inpaint-ing [C]. Proceedings of International Conference on Computer Graphics, Imaging and Visualization, Beijing:IEEE,2005.
[152]Barnes C, Shechtman E, Finkelstein A, et al. Patchmatch:a randomized correspondence algorithm for structural image editing [C]. Proceedings of ACM SIGGRAPH, Orleans: ACM,2009.
[153]Fang C, Lien J. J. Rapid image completion system using multiresolution patch-based directional and nondirectional approaches [J]. IEEE Transactions on Image Processing, 2009,18(12):2769-2779.
[154]石扬.基于相位信息的图像边缘检测算法研究[D].大连：大连理工大学,2007.
[155]Wolhlberg B. Inpainting by joint optimization of linear combinations of exemplars [J]. IEEE Signal Processing Letters,2011,18(1):75-78.
[156]Roweis S. T, Saul L. K. Nonlinear dimensionality reduction by locally linear embedding [J]. Science,2000,290(5500):2323-2326.
[157]Chang H, Yeung D. Y, Xiong Y. Super-resolution through neighbor embedding [C]. Washington:IEEE,2004.60-65.
[158]Chan T. M, Zhang J, Pu.1, et al. Neighbor embedding based super-resolution algo-rithm through edge detection and feature selection[J]. Pattern Recognition Letters,2009, 30(5):494-502.
[159]Parpinelli R. S, Lopes H. S, Freitas A. A. Data mining with an ant colony optimization algorithm [J]. IEEE Transactions on Evolutionary Computation,2002,6(4):321-332.
[160]Poli R, Kennedy J, Blackwell T. Particle swarm optimization [J]. Swarm Intelligence, 2007,1(1):33-57.
[161]Herrera F, Lozano M. Gradual distributed real-coded genetic algorithms [J]. IEEE Trans-actions on Evolutionary Computation,2000,4(l):43-63.
[162]宋晓峰,王爽,刘芳.基于区域MRF和贝叶斯置信传播的SAR图像分割[J].电子学报,2010,38(12)：2810-2815.
[163]Weiss Y, Freeman W. T. On the optimality of solutions of the max-product belief propa-gation algorithm in arbitrary graphs [J]. IEEE Transactions on Information Theory,2001, 47(2):723-735.
[164]Boykov Y, Veksler O, Zabih R. Fast approximate energy minimization via graph cuts [J]. IEEE Transactions on Pattern Analysis and Machine Intelligence,2001,23(11):1222-1239.
[165]Wainwright M. J, Jaakkola T. S, Willsky A. S. Map estimation via agreement on hyper trees:message-passing and linear-programming approaches [J]. IEEE Transactions on Information Theory,2005,51(11):3697-3717.
[166]Kohnogorov V. Convergent tree-reweighted message passing for energy minimization [J]. Pattern Analysis and Machine Intelligence,2006,28(10):1568-1583.
[167]Kolmogorov V, Wainwright M. On the optimality of tree-reweighted max-product message-passing [C]. Edinburgh,2005.316-332.
[168]Yedidia J. S, Freeman W. T, Weiss Y. Generalized Belief Propagation [C]. Cambridge: MIT,2001.689-695.
[169]Yedidia J. S, Freeman W. T, Weiss Y. Constructing free-energy approximations and generalized belief propagation algorithms [J]. IEEE Transactions on Information Theory, 2005,51(7):2282-2312.
[170]Tappen M. F, Freeman W. T. Comparison of graph cuts with belief propagation for stereo, using identical MRF parameters[C]. Tokyo:IEEE,2003.900-906.
[171]Weiss Y, Freeman W. Correctness of belief propagation in Gaussian graphical models of arbitrary topology[J], Neural Computation,2001,13(10):2173-2200.
[172]Peyre G. Manifold models for signals and images [J]. Computer Vision and Image Understanding,2009,113(2):249-260.