Abstract
We present an efficient and fast algorithm for computing approximate nearest neighbor fields between two images. Our method builds on the concept of Coherency-Sensitive Hashing (CSH), but uses a recent hashing scheme, Spherical Hashing (SpH), which is known to be better adapted to the nearest-neighbor problem for natural images. Cascaded Spherical Hashing concatenates different configurations of SpH to build larger Hash Tables with less elements in each bin to achieve higher selectivity. Our method is able to amply outperform existing techniques like PatchMatch and CSH. The parallelizable scheme has been straight-forwardly implemented in OpenCL, and the experimental results show that our algorithm is faster and more accurate than existing methods.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Heo, J.P., Lee, Y., He, J., Chang, S.F., Yoon, S.: Spherical hashing. In: IEEE International Conference on Computer Vision and Pattern Recognition (CVPR) (2012)
Korman, S., Avidan, S.: Coherency sensitive hashing. In: Proceedings of the 2011 International Conference on Computer Vision, ICCV 2011, pp. 1607–1614. IEEE Computer Society, Washington, DC (2011)
Barnes, C., Shechtman, E., Finkelstein, A., Goldman, D.B.: PatchMatch: a randomized correspondence algorithm for structural image editing. ACM Trans. Graph. (Proc. SIGGRAPH) 28, 24:1–24:11 (2009)
Efros, A.A., Leung, T.K.: Texture synthesis by non-parametric sampling. In: Proceedings of the International Conference on Computer Vision, ICCV 1999, vol. 2, pp. 1033–1038. IEEE Computer Society, Washington, DC (1999)
Efros, A.A., Freeman, W.T.: Image quilting for texture synthesis and transfer. In: Proceedings of the 28th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 2001, pp. 341–346. ACM, New York (2001)
Kwatra, V., Schödl, A., Essa, I., Turk, G., Bobick, A.: Graphcut textures: image and video synthesis using graph cuts. In: ACM SIGGRAPH 2003 Papers, SIGGRAPH 2003, pp. 277–286. ACM, New York (2003)
Wexler, Y., Shechtman, E., Irani, M.: Space-time completion of video. IEEE Trans. Pattern Anal. Mach. Intell. 29, 463–476 (2007)
Ashikhmin, M.: Synthesizing natural textures. In: Proceedings of the 2001 Symposium on Interactive 3D Graphics, I3D 2001, pp. 217–226. ACM, New York (2001)
Tong, X., Zhang, J., Liu, L., Wang, X., Guo, B., Shum, H.Y.: Synthesis of bidirectional texture functions on arbitrary surfaces. ACM Trans. Graph. 21, 665–672 (2002)
Slaney, M., Casey, M.: Locality-sensitive hashing for finding nearest neighbors [lecture notes]. IEEE Sig. Process. Mag. 25, 128–131 (2008)
Datar, M., Immorlica, N., Indyk, P., Mirrokni, V.S.: Locality-sensitive hashing scheme based on p-stable distributions. In: Proceedings of the Twentieth Annual Symposium on Computational Geometry, SCG 2004, pp. 253–262. ACM, New York (2004)
Sun, J.: Computing nearest-neighbor fields via propagation-assisted kd-trees. In: Proceedings of the 2012 IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2012, pp. 111–118. IEEE Computer Society, Washington, DC (2012)
Friedman, J.H., Bentley, J.L., Finkel, R.A.: An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw. 3, 209–226 (1977)
Freund, Y., Schapire, R.E.: A decision-theoretic generalization of on-line learning and an application to boosting. J. Comput. Syst. Sci. 55, 119–139 (1997)
Korman, S., Avidan, S.: Csh website.@ONLINE (2011)
Acknowledgment
We thank the anonymous reviewers for their constructive feedback, which resulted in an improved manuscript.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Torres-Xirau, I., Salvador, J., Pérez-Pellitero, E. (2015). Fast Approximate Nearest-Neighbor Field by Cascaded Spherical Hashing. In: Cremers, D., Reid, I., Saito, H., Yang, MH. (eds) Computer Vision -- ACCV 2014. ACCV 2014. Lecture Notes in Computer Science(), vol 9006. Springer, Cham. https://doi.org/10.1007/978-3-319-16817-3_30
Download citation
DOI: https://doi.org/10.1007/978-3-319-16817-3_30
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-16816-6
Online ISBN: 978-3-319-16817-3
eBook Packages: Computer ScienceComputer Science (R0)