Skip to main content

Depth Image Denoising via Collaborative Graph Fourier Transform

  • Conference paper
  • First Online:
Book cover Digital TV and Wireless Multimedia Communication (IFTC 2017)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 815))

Abstract

Depth maps offer partial geometric information of a 3D scene, and thus have been widely used in various image processing and computer vision task. However, due to the limitation of capturing devices, depth images usually suffer from noises. How to remove noises containing in depth images become an important problem, which will benefit many practical applications. Depth image denoising is ill-posed, whose performance largely relies on the prior knowledge of depth images. In this paper, we propose a patch-wise depth image denoising algorithm which exploits intra-patch and inter-patch correlations represented by graph. Specifically, we first cluster similar patches in a depth map, and then stack them together into a 3D group. For each patch, a fully-connected 2D graph is built to model the intra-patch correlation among pixels. Furthermore, the employ the inter-patch correlation, we construct 1D fully connected graph, in which each node represents a patch in the collected group. Finally, a collaborative filtering based on 3D graph Fourier transform (GFT) is conducted on the 3D patch group. We conduct shrinkage of the transform coefficients to get the denoised patches. Experimental results demonstrate that our proposed approach outperforms state-of-the-art image denoising methods in both objective results and subjective visual quality.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 89.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 119.00
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

References

  1. Tian, D., Lai, P.L., Lopez, P., Gomila, C.: View synthesis techniques for 3D video. Proceedings of SPIE, vol. 7443, 74430T–1 (2009)

    Google Scholar 

  2. Rudin, L.I., Osher, S., Fatemi, E.: Nonlinear total variation based noise removal algorithms. Phys. D 60(1–4), 259–268 (1992)

    Article  MathSciNet  MATH  Google Scholar 

  3. Aharon, M., Elad, M., Bruckstein, A.: K-SVD: an algorithm for designing overcomplete dictionaries for sparse representation. IEEE Trans. Signal Process. 54(11), 4311–4322 (2006)

    Article  MATH  Google Scholar 

  4. Dong, W., Zhang, L., Shi, G.: Centralized sparse representation for image restoration. In: 2011 IEEE International Conference on Computer Vision (ICCV), pp. 1259–1266. IEEE (2011)

    Google Scholar 

  5. Dong, W., Zhang, L., Shi, G., Wu, X.: Image deblurring and super-resolution by adaptive sparse domain selection and adaptive regularization. IEEE Trans. Image Process. 20(7), 1838–1857 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  6. Yang, J., Wright, J., Huang, T.S., Ma, Y.: Image super-resolution via sparse representation. IEEE Trans. Image Process. 19(11), 2861–2873 (2010)

    Article  MathSciNet  MATH  Google Scholar 

  7. Shuman, D.I., Narang, S.K., Frossard, P., Ortega, A., Vandergheynst, P.: The emerging field of signal processing on graphs: extending high-dimensional data analysis to networks and other irregular domains. IEEE Signal Process. Mag. 30(3), 83–98 (2013)

    Article  Google Scholar 

  8. Sandryhaila, A., Moura, J.M.: Discrete signal processing on graphs. IEEE Trans. Signal Process. 61(7), 1644–1656 (2013)

    Article  MathSciNet  Google Scholar 

  9. Kheradmand, A., Milanfar, P.: A general framework for kernel similarity-based image denoising. In: 2013 IEEE Global Conference on Signal and Information Processing (GlobalSIP), pp. 415–418. IEEE (2013)

    Google Scholar 

  10. Liu, X., Zhai, D., Zhao, D., Zhai, G., Gao, W.: Progressive image denoising through hybrid graph laplacian regularization: a unified framework. IEEE Trans. Image Process. 23(4), 1491–1503 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kheradmand, A., Milanfar, P.: A general framework for regularized, similarity-based image restoration. IEEE Trans. Image Process. 23(12), 5136–5151 (2014)

    Article  MathSciNet  MATH  Google Scholar 

  12. Hu, W., Cheung, G., Li, X., Au, O.C.: Graph-based joint denoising and super-resolution of generalized piecewise smooth images. In: 2014 IEEE International Conference on Image Processing (ICIP), pp. 2056–2060. IEEE (2014)

    Google Scholar 

  13. Mao, Y., Cheung, G., Ortega, A., Ji, Y.: Expansion hole filling in depth-image-based rendering using graph-based interpolation. In: ICASSP 2013, pp. 1859–1863 (2013)

    Google Scholar 

  14. Mao, Y., Cheung, G., Ji, Y.: Image interpolation for DIBR viewsynthesis using graph fourier transform. In: 3DTV-Conference: The True Vision-Capture, Transmission and Display of 3D Video (3DTV-CON 2014), pp. 1–4. IEEE (2014)

    Google Scholar 

  15. Hu, W., Cheung, G., Kazui, M.: Graph-based dequantization of block-compressed piecewise smooth images. IEEE Signal Process. Lett. 23(2), 242–246 (2016)

    Article  Google Scholar 

  16. Pang, J., Cheung, G., Hu, W., Au, O.: Redefining self-similarity in natural images for denoising using graph signal gradient. In: APSIPA ASC, December 2014

    Google Scholar 

  17. Pang, J., Cheung, G., Ortega, A., Au, O.: Optimal graph Laplacian regularization for natural image denoising. In: IEEE International Conference on Acoustics, Speech and Signal Processing, April 2015

    Google Scholar 

  18. Dabov, K., Foi, A., Katkovnik, V., Egiazarian, K.: Image denoising by sparse 3-D transform-domain collaborative filtering. IEEE Trans. Image Process. 16(8), 2080–2095 (2007)

    Article  MathSciNet  Google Scholar 

  19. Shuman, D., Narang, S., Frossard, P., Ortega, A., Vandergheynst, P.: The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains. IEEE Signal Process. Mag. 30(3), 83–98 (2013)

    Article  Google Scholar 

  20. Liu, X., Cheung, G., Wu, X., Zhao, D.: Random walk graph laplacian-based smoothness prior for soft decoding of JPEG images. IEEE Trans. Image Process. 26(2), 509–524 (2017)

    Article  MathSciNet  Google Scholar 

  21. Hu, W., Li, X., Cheung, G., Au, O.: Depth map denoising using graph-based transform and group sparsity. In: IEEE International Workshop on Multimedia Signal Processing, Pula, Italy, October 2013

    Google Scholar 

Download references

Acknowledgements

This work is supported by the Major State Basic Research Development Program of China (973 Program 2015CB351804), the National Science Foundation of China under Grants 61502122 and 61672193, and in part by the Fundamental Research Funds for the Central Universities (Grant No. HIT. NSRIF. 2015067).

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xianming Liu .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Chen, R., Liu, X., Zhai, D., Zhao, D. (2018). Depth Image Denoising via Collaborative Graph Fourier Transform. In: Zhai, G., Zhou, J., Yang, X. (eds) Digital TV and Wireless Multimedia Communication. IFTC 2017. Communications in Computer and Information Science, vol 815. Springer, Singapore. https://doi.org/10.1007/978-981-10-8108-8_12

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-8108-8_12

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-8107-1

  • Online ISBN: 978-981-10-8108-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics