A graph theoretic approach to simulation and classification

  • Author(s) / Creator(s)
  • A new class of discrete random fields designed for quick simulation and covariance inference under inhomogenous conditions is introduced and studied. Simulation of these correlated fields can be done in a single pass instead of relying on multi-pass convergent methods like the Gibbs Sampler or other Markov Chain Monte Carlo algorithms. The fields are constructed directly from an undirected graph with specified marginal probability mass functions and covariances between nearby vertices in a manner that makes simulation quite feasible yet maintains the desired properties. Special cases of these correlated fields have been deployed successfully in data authentication, object detection and CAPTCHA1 generation. Further applications in maximum likelihood estimation and classification such as optical character recognition are now given within.

  • Date created
  • Subjects / Keywords
  • Type of Item
    Article (Draft / Submitted)
  • DOI
  • License
    © 2014 Computational Statistics and Data Analysis. This version of this article is open access and can be downloaded and shared. The original author(s) and source must be cited.
  • Language
  • Citation for previous publication
    • M. A. Kouritzin, F. Newton and B. Wu. (2014), " A graph theoretic approach to simulation and classification '', Computational Statistics and Data Analysis in press.