Skip to main content

Patch Selection for Single Image Deblurring Based on a Coalitional Game

  • Conference paper
  • First Online:
Advances in Visual Computing (ISVC 2015)

Part of the book series: Lecture Notes in Computer Science ((LNIP,volume 9475))

Included in the following conference series:

  • 1917 Accesses

Abstract

Most single-image deblurring methods estimate the blur kernel using whole image, however, that may lead to incorrect estimation and more computations. In this paper, we focus on accelerating the blind deconvolution algorithm and increasing the accuracy of kernel estimation by using only a small region in image to perform the process of kernel estimation. Then, the problem now is to find the most proper region. At first, we found informative pixels to locate useful patches. Inspiring by game theory, we propose a coalitional game based patch selection method to choose a group of patches for kernel estimation. In this game, each patch represents a player, and our purpose is to find a coalition that has the maximal payoff. Shapley Value is applied to fairly distribute the utility to each player. We show the speed-up and the quality improvement of our method both on real-world and synthetic images.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Similar content being viewed by others

References

  1. Fergus, R., Singh, B., Hertzmann, A., Roweis, S.T., Freeman, W.T.: Removing camera shake from a single photograph. ACM Trans. Graph. (TOG) 25(3), 787–794 (2006). ACM

    Article  Google Scholar 

  2. Shan, Q., Jia, J., Agarwala, A.: High-quality motion deblurring from a single image. ACM Trans. Graph. (TOG) 27(3), 73 (2008). ACM

    Article  Google Scholar 

  3. Xu, L., Jia, J.: Two-phase kernel estimation for robust motion deblurring. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010, Part I. LNCS, vol. 6311, pp. 157–170. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  4. Krishnan, D., Tay, T., Fergus, R.: Blind deconvolution using a normalized sparsity measure. In: 2011 IEEE Conference on Computer Vision and Pattern Recognition (CVPR), pp. 233–240. IEEE, June 2011

    Google Scholar 

  5. Jia, J.: Single image motion deblurring using transparency. In: CVPR 2007 IEEE Conference on Computer Vision and Pattern Recognition, pp. 1–8. IEEE, June 2007

    Google Scholar 

  6. Bae, H., Fowlkes, C.C., Chou, P.H.: Patch mosaic for fast motion deblurring. In: Lee, K.M., Matsushita, Y., Rehg, J.M., Hu, Z. (eds.) ACCV 2012, Part III. LNCS, vol. 7726, pp. 322–335. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  7. Gupta, A., Joshi, N., Lawrence Zitnick, C., Cohen, M., Curless, B.: Single image deblurring using motion density functions. In: Daniilidis, K., Maragos, P., Paragios, N. (eds.) ECCV 2010, Part I. LNCS, vol. 6311, pp. 171–184. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  8. Cho, S., Lee, S.: Fast motion deblurring. ACM Transactions on Graphics (TOG) 28(5), 145 (2009). ACM

    Article  Google Scholar 

  9. Joshi, N., Szeliski, R., Kriegman, D.J.: PSF estimation using sharp edge prediction. In: Computer Vision and Pattern Recognition, CVPR 2008, pp. 1–8. IEEE, June 2008

    Google Scholar 

  10. Köhler, R., Hirsch, M., Mohler, B., Schölkopf, B., Harmeling, S.: Recording and playback of camera shake: benchmarking blind deconvolution with a real-world database. In: Fitzgibbon, A., Lazebnik, S., Perona, P., Sato, Y., Schmid, C. (eds.) ECCV 2012, Part VII. LNCS, vol. 7578, pp. 27–40. Springer, Heidelberg (2012)

    Chapter  Google Scholar 

  11. Levin, A., Weiss, Y., Durand, F., Freeman, W.T.: Understanding and evaluating blind deconvolution algorithms. In: IEEE Conference on Computer Vision and Pattern Recognition, CVPR 2009, pp. 1964–1971. IEEE, June 2009

    Google Scholar 

  12. Shapley, L.S.: A Value for n-person Games. In: Contributions to the Theory of Games, vol. II, by H.W. Kuhn and A.W. Tucker, editors. Annals of Mathematical Studies v. 28, pp. 307–317. Princeton University Press (1953)

    Google Scholar 

Download references

Acknowledgment

This study is conducted under the “Online and Offline integrated Smart Commerce Platform (2/4)” of the Institute for Information Industry which is subsidized by the Ministry of Economy Affairs of the Republic of China

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Jung-Hsuan Lin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Lin, JH., Wang, RS., Wang, Jw. (2015). Patch Selection for Single Image Deblurring Based on a Coalitional Game. In: Bebis, G., et al. Advances in Visual Computing. ISVC 2015. Lecture Notes in Computer Science(), vol 9475. Springer, Cham. https://doi.org/10.1007/978-3-319-27863-6_48

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-27863-6_48

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-27862-9

  • Online ISBN: 978-3-319-27863-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics