Advertisement

Fast Super-Resolution via Dense Local Training and Inverse Regressor Search

  • Eduardo Pérez-PelliteroEmail author
  • Jordi Salvador
  • Iban Torres-Xirau
  • Javier Ruiz-Hidalgo
  • Bodo Rosenhahn
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9005)

Abstract

Regression-based Super-Resolution (SR) addresses the upscaling problem by learning a mapping function (i.e. regressor) from the low-resolution to the high-resolution manifold. Under the locally linear assumption, this complex non-linear mapping can be properly modeled by a set of linear regressors distributed across the manifold. In such methods, most of the testing time is spent searching for the right regressor within this trained set. In this paper we propose a novel inverse-search approach for regression-based SR. Instead of performing a search from the image to the dictionary of regressors, the search is done inversely from the regressors’ dictionary to the image patches. We approximate this framework by applying spherical hashing to both image and regressors, which reduces the inverse search into computing a trained function. Additionally, we propose an improved training scheme for SR linear regressors which improves perceived and objective quality. By merging both contributions we improve speed and quality compared to the state-of-the-art.

Keywords

Anchor Point Image Patch Super Resolution Bicubic Interpolation Global Regression 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

References

  1. 1.
    Tsai, R., Huang, T.: Multiple frame image restoration and registration. In: Proceedings of the Advances in Computer Vision and Image Processing, vol. 1, pp. 317–339 (1984)Google Scholar
  2. 2.
    Irani, M., Peleg, S.: Improving resolution by image registration. CVGIP Graph. Models Image Process. 53, 231–239 (1991)CrossRefGoogle Scholar
  3. 3.
    Baker, S., Kanade, T.: Limits on super-resolution and how to break them. IEEE Trans. Pattern Anal. Mach. Intell. 24, 1167–1183 (2002)CrossRefGoogle Scholar
  4. 4.
    Lin, Z., Shum, H.Y.: Fundamental limits of reconstruction-based superresolution algorithms under local translation. IEEE Trans. Pattern Anal. Mach. Intell. 26, 83–97 (2004)CrossRefGoogle Scholar
  5. 5.
    Freeman, W., Jones, T., Pasztor, E.: Example-based super-resolution. IEEE Trans. Comput. Graph. Appl. 22, 56–65 (2002)CrossRefGoogle Scholar
  6. 6.
    Glasner, D., Bagon, S., Irani, M.: Super-resolution from a single image. In: Proceedings of the IEEE International Conference on Computer Vision (2009)Google Scholar
  7. 7.
    Freedman, G., Fattal, R.: Image and video upscaling from local self-examples. ACM Trans. Graph. 30, 12:1–12:11 (2011)CrossRefGoogle Scholar
  8. 8.
    Yang, J., Lin, Z., Cohen, S.: Fast image super-resolution based on in-place example regression. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (2013)Google Scholar
  9. 9.
    Yang, J., Wright, J., Huang, T.S., Ma, Y.: Image super-resolution via sparse representation. IEEE Trans. Image Process. 19, 2861–2873 (2010)CrossRefMathSciNetGoogle Scholar
  10. 10.
    Zeyde, R., Elad, M., Protter, M.: On single image scale-up using sparserepresentations. In: Proceedings of the International Conference on Curves and Surfaces (2012)Google Scholar
  11. 11.
    Chang, H., Yeung, D.Y., Xiong, Y.: Super-resolution through neighbor embedding. (2004)Google Scholar
  12. 12.
    Timofte, R., Smet, V.D., Goool, L.V.: Anchored neighborhood regression for fast example-based super-resolution. In: Proceedings of the IEEE International Conference on Computer Vision (2013)Google Scholar
  13. 13.
    Aharon, M., Elad, M., Bruckstein, A.: K-SVD: an algorithm for designing overcomplete dictionaries for sparse representation. IEEE Trans. Sig. Process. 54, 4311–4322 (2006)CrossRefGoogle Scholar
  14. 14.
    Peyré, G.: Manifold models for signals and images. Comput. Vis. Image Underst. 113, 249–260 (2009)CrossRefGoogle Scholar
  15. 15.
    Breiman, L.: Random forests. Mach. Learn. 45, 5–32 (2001)CrossRefzbMATHGoogle Scholar
  16. 16.
    Heo, J.P., Lee, Y., He, J., Chang, S.F., Yoon, S.E.: Spherical hashing. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (2012)Google Scholar
  17. 17.
    Indyk, P., Motwani, R.: Approximate nearest neighbors: towards removing the curse of dimensionality. In: Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing, STOC 1998, pp. 604–613 (1998)Google Scholar
  18. 18.
    Wang, J., Kumar, S., Chang, S.F.: Semi-supervised hashing for scalable image retrieval (2010)Google Scholar
  19. 19.
    Weiss, Y., Torralba, A., Fergus, R.: Spectral hashing (2008)Google Scholar
  20. 20.
    He, K., Sun, J.: Computing nearest-neighbor fields via propagation-assisted kd-trees. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition (2012)Google Scholar
  21. 21.
    Bevilacqua, M., Roumy, A., Guillemot, C., Alberi-Morel, M.L.: Low-complexity single-image super-resolution based on nonnegative neighbor embedding. In: Proceedings of the British Machine Vision Conference, pp. 1–10 (2012)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Eduardo Pérez-Pellitero
    • 1
    • 2
    Email author
  • Jordi Salvador
    • 1
  • Iban Torres-Xirau
    • 1
  • Javier Ruiz-Hidalgo
    • 3
  • Bodo Rosenhahn
    • 2
  1. 1.Technicolor R&I HannoverHannoverGermany
  2. 2.TNT LabLeibniz Universität HannoverHannoverGermany
  3. 3.Image Processing GroupUniversitat Politècnica de CatalunyaBarcelonaSpain

Personalised recommendations