Statistical Modeling of Texture Sketch

  • Ying Nian Wu
  • Song Chun Zhu
  • Cheng-en Guo
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2352)


Recent results on sparse coding and independent component analysis suggest that human vision first represents a visual image by a linear superposition of a relatively small number of localized, elongate, oriented image bases. With this representation, the sketch of an image consists of the locations, orientations, and elongations of the image bases, and the sketch can be visually illustrated by depicting each image base by a linelet of the same length and orientation. Built on the insight of sparse and independent component analysis, we propose a two-level generative model for textures. At the bottom-level, the texture image is represented by a linear superposition of image bases. At the top-level, a Markov model is assumed for the placement of the image bases or the sketch, and the model is characterized by a set of simple geometrical feature statistics.


Independent component analysis Matching pursuit Minimax entropy learning Sparse coding Texture modeling 


  1. 1.
    A. J. Bell and T.J. Sejnowski, “An information maximization approach to blind separation and blind deconvolution”, Neural Computation, 7(6): 1129–1159, 1995.CrossRefGoogle Scholar
  2. 2.
    F. Bergeaud and S. Mallat, “Matching pursuit: adaptive representation of images and sounds.” Comp. Appl. Math., 15, 97–109. 1996.zbMATHGoogle Scholar
  3. 3.
    A. Berger, V. Della Pietra, and S. Della Pietra, “A maximum entropy approach to natural language processing”, Computational Linguistics, vol. 22, no. 1 1996.Google Scholar
  4. 4.
    E. J. Candès and D. L. Donoho, “Curvelets-A Surprisingly Effective Nonadaptive Representation for Objects with Edges”, Curves and Surfaces, L. L. Schumaker et al. (eds), Vanderbilt University Press, Nashville, TN.Google Scholar
  5. 5.
    A. P. Dempster, N.M. Laird, and D. B. Rubin, “Maximum likelihood from incomplete data via the EM algorithm”, Journal of the Royal Statistical Society series B, 39:1–38, 1977.zbMATHMathSciNetGoogle Scholar
  6. 6.
    A. A. Efros and T. Leung, “Texture synthesis by non-parametric sampling”, ICCV, Corfu, Greece, 1999.Google Scholar
  7. 7.
    A. A. Efros and W. T. Freeman, “Image Quilting for Texture Synthesis and Transfer”, SIGGRAPH 2001.Google Scholar
  8. 8.
    S. Geman and D. Geman. “Stochastic relaxation, Gibbs distributions and the Bayesian restoration of images”. IEE Trans. PAMI 6. pp 721–741. 1984.zbMATHGoogle Scholar
  9. 9.
    C. E. Guo, S. C. Zhu, and Y. N. Wu, “Visual learning by integrating descriptive and generative methods”, ICCV, Vancouver, CA, July, 2001.Google Scholar
  10. 10.
    D. J. Heeger and J. R. Bergen, “Pyramid-based texture analysis/synthesis”, SIGGRAPHS, 1995.Google Scholar
  11. 11.
    M. S. Lewicki and B. A. Olshausen, “A probabilistic framework for the adaptation and comparison of image codes”, JOSA, A. 16(7): 1587–1601, 1999.CrossRefGoogle Scholar
  12. 12.
    L. Liang, C. Liu, Y. Xu, B.N. Guo, H.Y. Shum, “Real-Time Texture Synthesis By Patch-Based Sampling”, MSR-TR-2001-40, March 2001.Google Scholar
  13. 13.
    J. Malik, and P. Perona, “Preattentive texture discrimination with early vision mechanisms”, J. of Optical Society of America A, vol 7. no. 5, May, 1990.Google Scholar
  14. 14.
    S. G. Mallat, “A theory for multiresolution signal decomposition: the wavelet representation”, IEEE Trans. on PAMI, vol. 11, no. 7, 674–693, 1989.zbMATHGoogle Scholar
  15. 15.
    S. Mallat and Z. Zhang, “Matching pursuit in a time-frequency dictionary”, IEEE trans. on Signal Processing, vol. 41, pp 3397–3415, 1993.zbMATHCrossRefGoogle Scholar
  16. 16.
    D. Marr, Vision, W.H. Freeman and Company, 1982.Google Scholar
  17. 17.
    D. B. Mumford “The Statistical Description of Visual Signals” in ICIAM 95, edited by K. Kirchgassner, O. Mahrenholtz and R. Mennicken, Akademie Verlag, 1996.Google Scholar
  18. 18.
    B. A. Olshausen and D. J. Field, “Emergence of simple-cell receptive field properties by learning a sparse code for natural images” Nature, 381, 607–609, 1996.CrossRefGoogle Scholar
  19. 19.
    K. Popat and R. W. Picard, “Novel Cluster-Based Probability Model for Texture Synthesis, Classification, and Compression.” Proc. of the SPIE Visual Comm. and Image Proc., Boston, MA, pp. 756–768, 1993.Google Scholar
  20. 20.
    J. Portilla and E. P. Simoncelli, “A parametric texture model based on joint statistics of complex wavelet coefficients”, IJCV, 40(1), 2000.Google Scholar
  21. 21.
    Y. Wu, S. C. Zhu, and X. Liu, (2000) “Equivalence of Julesz texture ensembles and FRAME models”, IJCV, 38(3), 247–265.zbMATHCrossRefGoogle Scholar
  22. 22.
    S. C. Zhu, Y. N. Wu and D. B. Mumford, “Minimax entropy principle and its application to texture modeling”, Neural Computation Vol. 9, no 8, Nov. 1997.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Ying Nian Wu
    • 1
  • Song Chun Zhu
    • 2
  • Cheng-en Guo
    • 2
  1. 1.Dept. of StatisticsUniv. of CaliforniaLos AngelesUSA
  2. 2.Dept. of Comp. and Info. Sci.Ohio State Univ.ColumbusUSA

Personalised recommendations