A Fast Algorithm for Binary Image Restoration

摘要：

In this paper, we consider the problem to recover a binary digital image u ∈ Rm×n when the observed image g is corrupted with noise such as Gaussian or salt and pepper. By explicitly using the a priori knowledge for binary image, we propose a novel minimization model. Based on this new model, we present a novel fast iterative projection algorithm for binary image restoration. The main computation at each iteration is one fast Fourier transform (FFT) and one inverse fast Fourier transform (IFFT). Experimental results show that the proposed method is feasible and effective for binary image restoration. All of the results can be obtained within one second.

作者: Jianjun Zhang Wanzhou Ye

作者单位: Department of Mathematics, Shanghai University, Shanghai 200444

会议类型: 国际会议

会议名称: 2011 4th International Congress on Image and Signal Processing(第四届图像与信号处理国际学术会议 CISP 2011)

会议地点: 上海

会议语种:英文

页码: 601-604

在线出版日期: 2011-10-15（万方平台首次上网日期，不代表论文的发表时间）