• DocumentCode
    2338311
  • Title

    Tree-structured clustered probability models for texture

  • Author

    Picard, Rosalind W. ; Popat, Kris

  • Author_Institution
    Media Lab., MIT, Cambridge, MA, USA
  • fYear
    1994
  • fDate
    27-29 Oct 1994
  • Firstpage
    21
  • Abstract
    Summary form only given, as follows. A cluster-based probability model has been found to perform extremely well at capturing the complex structures in natural textures (e.g., better than Markov random field models). Its success is mainly due to its ability to handle high dimensionality, via large conditioning neighborhoods over multiple scales, and to generalize salient characteristics from limited training data. Imposing a tree structure on this model provides not only the benefit of reducing computational complexity, but also a new benefit, the trees are mutable, allowing us to mix and match models for different sources. This flexibility is of increasing importance in emerging applications such as database retrieval for sound, image and video
  • Keywords
    computational complexity; image texture; probability; tree data structures; cluster-based probability model; computational complexity reduction; database retrieval; high dimensionality; image; large conditioning neighborhoods; limited training data; multiple scales; mutable trees; natural textures; sound; tree-structured clustered probability models; video; Computational complexity; Image databases; Image retrieval; Information retrieval; Laboratories; Markov random fields; National electric code; Random media; Training data; Tree data structures;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Information Theory and Statistics, 1994. Proceedings., 1994 IEEE-IMS Workshop on
  • Conference_Location
    Alexandria, VA
  • Print_ISBN
    0-7803-2761-6
  • Type

    conf

  • DOI
    10.1109/WITS.1994.513861
  • Filename
    513861