Abstract
In this paper, we propose a parallel-friendly algorithm for k-nearest neighbor based patch match. Based on jump flooding algorithm, an efficient pattern of communication, our algorithm is fully parallelized at patch-level. To improve the performance, we propose and analyze its variants, and implement them with GPU. Compared with state-of-the-art approximate patch match algorithm, the GPU implementation of our algorithm achieves up to 100 times speedup over its CPU implementation, and 5 times faster than the GPU implementation of Barnes’s algorithm, a most recently benchmark algorithm.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Garcia, V., Debreuve, E., Nielsen, F., Barlaud, M.: K-nearest neighbor search: Fast gpu-based implementations and application to highdimensional feature matching. In: International Conference on Image Processing, pp. 3757–3760. IEEE Press, Hong Kong (2010)
Buades, A., Coll, B., Morel, J.: A non-local algorithm for image denoising. In: IEEE Computer Society Conference on Computer Vision and Pattern Recognition, vol. 2, pp. 60–65. IEEE Press, San Diego (2005)
Dabov, K., Foi, A., Katkovnik, V., Egiazarian, K.: Image denoising by sparse 3-D transform-domain collaborative filtering. IEEE Trans. Image Process. 16, 2080–2095 (2007)
Barnes, C., Shechtman, E., Finkelstein, A., Goldman, D.: PatchMatch: a randomized correspondence algorithm for structural image editing. ACM Trans. Graphics 28, 24:1–24:11 (2009)
Hertzmann, A., Jacobs, C., Oliver, N., Curless, B., Salesin, D.: Image analogies. In: Proceedings of ACM SIGGRAPH, pp. 327–340. ACM Press (2001)
Barnes, C., Shechtman, E., Goldman, D.B., Finkelstein, A.: The generalized patchmatch correspondence algorithm. In: 11th European Conference on Computer Vision, pp. 2049–2056. IEEE Press, Crete (2010)
Rong, G., Tan, T.-S.: Jump flooding in gpu with applications to vornoi diagram and distance transform. In: Proceedings of the Symposium on Interactive 3D Graphics and Games, pp. 109–116. ACM Press, New York (2006)
Caltech-256 Object Category Dataset, http://www.vision.caltech.edu/Image_Datasets/Caltech256/
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Yu, P., Yang, X., Chen, L. (2012). Parallel-Friendly Patch Match Based on Jump Flooding. In: Zhang, W., Yang, X., Xu, Z., An, P., Liu, Q., Lu, Y. (eds) Advances on Digital Television and Wireless Multimedia Communications. Communications in Computer and Information Science, vol 331. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-34595-1_3
Download citation
DOI: https://doi.org/10.1007/978-3-642-34595-1_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-34594-4
Online ISBN: 978-3-642-34595-1
eBook Packages: Computer ScienceComputer Science (R0)