Science China Information Sciences

, Volume 56, Issue 11, pp 1–12 | Cite as

Boundary-representable partition of unity for image magnification

  • Yukie Nagai
  • Yutaka Ohtake
  • Hideo Yokota
  • Hiromasa Suzuki
Research Paper

Abstract

This paper proposes a simple yet effective algorithm to magnify 2D/3D images with preserving discontinuities of intensity. Our algorithm is based on the partition of unity (PU) approximation, which offers many advantages such as smooth representation, noise-robustness, and precise representation. Unfortunately, PU encounters difficulties when scaling images and maintaining boundaries within images owing to the nature of its approximation. To overcome this problem, we propose an approximation that preserves discontinuities. This is realized by dividing the local spherical support of PU into two parts along a locally detected discontinuity and by individually approximating intensities on each side of the discontinuity. This algorithm is suitable for magnifying a variety of images, including scanned documents, pictures, and CT-scanned images. To demonstrate the effectiveness of the proposed method, we show some experimental results for 2D/3D images.

Keywords

image approximation partition of unity piecewise smooth function volume data magnification 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Dori D, Liu W. Sparse pixel vectorization: an algorithm and its performance evaluation. IEEE Trans Patt Anal Mach Intell, 1999, 21: 202–215CrossRefGoogle Scholar
  2. 2.
    Demaret L, Dyn N, Iske A. Image compression by linear splines over adaptive triangulations. Signal Process, 2006, 86: 1604–1616CrossRefMATHGoogle Scholar
  3. 3.
    Lecot G, Lévy B. ARDECO: automatic region detection and conversion. In: 17th Eurographics Symposium on Rendering, Cyprus, 2006. 349–360Google Scholar
  4. 4.
    Xia T, Liao B, Yu Y. Patch-based image vectorization with automatic curvilinear feature alignment. ACM Trans Graph, 2009, 28: 1–10CrossRefGoogle Scholar
  5. 5.
    Lai Y-K, Hu S-M, Martin R R. Automatic and topology-preserving gradient mesh generation for image vectorization. ACM Trans Graph, 2009, 28: 1–8CrossRefGoogle Scholar
  6. 6.
    Sun J, Liang L, Wen F, et al. Image vectorization using optimized gradient meshes. ACM Trans Graph, 2007, 26: 11CrossRefGoogle Scholar
  7. 7.
    Orzan A, Bousseau A, Winnemöller H, et al. Diffusion curves: a vector representation for smooth-shaded images. In: SIGGRAPH’08. New York: ACM, 2008. 1–8Google Scholar
  8. 8.
    Donoho D L. Wedgelets: nearly-minimax estimation of edges. Ann Stat, 1999, 27: 859–897MathSciNetCrossRefMATHGoogle Scholar
  9. 9.
    Tumblin J, Choudhury P. Bixels: picture samples with sharp embedded boundaries. In: Proceedings of the 15th Eurographics Conference on Rendering Techniques. Switzerland: Eurographics Association Aire-la-Ville, 2004. 255–264Google Scholar
  10. 10.
    Pavic D, Kobbelt L. Two-colored pixels. Comput Graph Forum, 2010, 29: 743–752CrossRefGoogle Scholar
  11. 11.
    Shukla R, Dragotti P L, Do M N, et al. Rate-distortion optimized tree-structured compression algorithms for piecewise polynomial images. IEEE Trans Image Process, 2005, 14: 343–359MathSciNetCrossRefGoogle Scholar
  12. 12.
    Pauly M, Keiser R, Kobbelt L P, et al. Shape modeling with point-sampled geometry. ACM Trans Graph, 2003, 22: 641–650CrossRefGoogle Scholar
  13. 13.
    Wang L, Zhou K, Yu Y, et al. Vector solid textures. ACM Trans Graph, 2010, 29: 86Google Scholar
  14. 14.
    Zhang G-X, Lai Y-K, Hu S-M. Efficient synthesis of gradient solid textures. Graph Models, 2013, 75: 104–117CrossRefGoogle Scholar
  15. 15.
    Ohtake Y, Belyaev A, Alexa M, et al. Multi-level partition of unity implicits. ACM Trans Graph, 2003, 22: 463–470CrossRefGoogle Scholar
  16. 16.
    Paris S, Kornprobst P, Tumblin J, et al. A gentle introduction to bilateral filtering and its applications. In: SIGGRAPH’ 08. New York: ACM, 2008. 1–50CrossRefGoogle Scholar
  17. 17.
    Liu Y J, Luo X, Xuan Y M, et al. Image retargeting quality assessment. Comput Graph Forum, 2011, 30: 583–592CrossRefGoogle Scholar
  18. 18.
    Wang Z, Bovik A C, Sheikh H R, et al. Image quality assessment: from error visibility to structural similarity. IEEE Trans Image Process, 2004, 13: 600–612CrossRefGoogle Scholar
  19. 19.
    Fleishman S, Cohen-Or D, Silva C T. Robust moving least-squares fitting with sharp features. ACM Trans Graph, 2005, 24: 544–552CrossRefGoogle Scholar
  20. 20.
    Guennebaud G, Gross M. Algebraic point set surfaces. ACM Trans Graph, 2007, 26: 23CrossRefGoogle Scholar

Copyright information

© Science China Press and Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Yukie Nagai
    • 1
  • Yutaka Ohtake
    • 1
  • Hideo Yokota
    • 2
  • Hiromasa Suzuki
    • 3
  1. 1.School of EngineeringThe University of TokyoTokyoJapan
  2. 2.Bio-Research Infrastructure Construction TeamASI, RIKENSaitamaJapan
  3. 3.RCASTThe University of TokyoTokyoJapan

Personalised recommendations