Fast Non-Local Mean Filter Algorithm Based on Recursive Calculation of Similarity Weights
- 36 Downloads
Abstract—A theoretically derived technique for acceleration of the original non-local means image denoising algorithm based on calculation of recursive patch similarity weights is proposed. A significant amount of computation in the non-local means scheme is dedicated to estimation of the patch similarity between pixel neighborhoods. The proposed recursive weights calculation scheme adopts the classic recursive mean calculation scheme for a multidimensional shift-vector in order to lower the computational complexity of the original non-local means method, thus speeding up this algorithm more than tenfold. Note that the output of the proposed algorithm is exactly the same as that of the original non-local means method. Hence this algorithm belongs to the class of true fast algorithms, unlike methods approaching to a certain degree the resul of the original algorithm.
- 9.C. Tomasi and R. Manduchi, “Bilateral filtering for gray and color images,” in Proc. Sixth Int. Conf. on Comput. Vision (ICCV), Bombay, India, Jan. 1998 (IEEE, New York, 1998), pp. 839–846.Google Scholar
- 10.A. Buades, B. Coll, and J.-M. Morel, “A non-local algorithm for image denoising,” in Proc. IEEE Comput. Soc. Conf. on Computer Vision and Pattern Recognition (CVPR), 2005 (IEEE, New York, 2005), Vol. 2, pp. 60–65.Google Scholar
- 12.W. Zuo, L. Zhang, C. Song, and D. Zhang, “Texture enhanced image denoising via gradient histogram preservation,” in Proc. IEEE Conf. Comput. Vision & Pattern Recogn., Iune, 2013, (IEEE, New York, 2013), pp. 1203–1210.Google Scholar