三维离散集的近似向量中值  

Reduced complexity algorithm for approximate vector medians of three-dimensional discrete sets

作　　者：邵承会[1] 唐可洪[1] 阚君武[1] 

机构地区：[1]吉林大学机械科学与工程学院,长春130025

出　　处：《哈尔滨工业大学学报》2009年第5期172-174,184,共4页Journal of Harbin Institute of Technology

基　　金：国家高技术研究发展计划资助项目(2002AA423150)

摘　　要：针对向量中值滤波的瓶颈问题,应用灰度直方图求近似向量中值,并从理论上证明了若符合连通条件,所求中值即为向量中值.这种近似向量中值算法极大提高了计算速度,计算复杂度为O(n),实验结果显示时间消耗仅为向量中值滤波原型(VMF)的6.92%,和VMF客观指标PSNR、SNR、MAE、MSE、NCD、NMSE实验值几乎相同.它既有VMF的滤波性能,又大幅度缩短计算时间,所以有广阔的应用前景.A fast running algorithm based on the local window histogram was employed to implement approximate vector median filtering for multichannel image processing. The computational complexity of the algorithm is only 0 （n）, so the median computation is not a bottleneck anymore for large image filters. Moreover, we prove that if the three-dimensional discrete set satisfies some connection conditions, the median obtained is a vector median. Otherwise, it is a scalar median of the window. The experimental results show that by means of the PSNR,SNR,MAE,MSE, NCD and NMSE coefficients, the effectiveness of the algorithm is almost as the same as VMF for the reduction of mutichannel impulsive noise in color images.

关 键 词：三维离散集 向量中值 灰度直方图 

分 类 号：TN713.7[电子电信—电路与系统] O158[理学—数学]