检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西安电子科技大学计算机学院,西安710071
出 处:《西安交通大学学报》2005年第12期1340-1343,1357,共5页Journal of Xi'an Jiaotong University
基 金:陕西省自然科学基金资助项目(2001x06)
摘 要:针对Bayesian算法以误差分散核为先验、时空复杂度高的缺点,提出一种逆半调改进算法. 首先根据误差分散半调图的噪声特性设计去噪预处理器,然后以预处理图像为初始值,依据最大后验概率准则,采用基于矩阵运算的迭代方法估计逆半调图像. 所构造的逆半调算法与Bayesian算法相比,逆半调图像平滑且边缘清晰,时空复杂度大大降低. 仿真结果表明:N×N维图像的空间复杂度由8N2降至81N,运行时间降为原来的15%左右;采用Floyd-Steinberg 半调图,该算法的峰值信噪比(PSNR)与小波算法相当,采用Jarvis半调图,PSNR值较小波算法提高了0.3~3 dB.To overcome Bayesian algorithm's shortcomings of requiring the knowledge of halftone kernel and high computational complexity and memory buffer, an improved method via maximum a posteriori was proposed. According to the characteristic of error-diffused halftone noise a denoising preprocessor was first designed to provide an initial image. Then the inverse halftoning image was obtained by updating the initial with matrix-based iteration scheme. Compared to the Bayesian algorithm, the resulting image of the proposed algorithm is smooth with sharp edges, while computational complexity and memory buffer are quite reduced. Experiments show that memory requirement is decreased from 8N2 to 81N and run time is reduced to 15% or so for an image of size N× N. The peak signal noise ratio performance for Floyd-Steinberg is almost the same as that of the wavelet algorithm, but for other kernels like Jarvis it is increased by 0.3 to 3 dB.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.14.64.102