A graph theoretic approach to simulation and classification
Loading...
Date
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.
Link to Related Item
Abstract
Description
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.
Item Type
http://purl.org/coar/resource_type/c_6501 http://purl.org/coar/version/c_71e4c1898caa6e32 http://purl.org/coar/version/c_b1a7d7d4d402bcce
Alternative
License
Other License Text / Link
© 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
en