A stochastic grammar of images
Foundations and Trends® in Computer Graphics and Vision
A new compositional technique for hand posture recognition
ICCOMP'09 Proceedings of the WSEAES 13th international conference on Computers
Predicate Logic Based Image Grammars for Complex Pattern Recognition
International Journal of Computer Vision
Using grammars for pattern recognition in images: A systematic review
ACM Computing Surveys (CSUR)
Hi-index | 0.01 |
We develop a new class of hierarchical stochastic image models called spatial random trees (SRTs) which admit polynomial-complexity exact inference algorithms. Our framework of multitree dictionaries is the starting point for this construction. SRTs are stochastic hidden tree models whose leaves are associated with image data. The states at the tree nodes are random variables, and, in addition, the structure of the tree is random and is generated by a probabilistic grammar. We describe an efficient recursive algorithm for obtaining the maximum a posteriori estimate of both the tree structure and the tree states given an image. We also develop an efficient procedure for performing one iteration of the expectation-maximization algorithm and use it to estimate the model parameters from a set of training images. We address other inference problems arising in applications such as maximization of posterior marginals and hypothesis testing. Our models and algorithms are illustrated through several image classification and segmentation experiments, ranging from the segmentation of synthetic images to the classification of natural photographs and the segmentation of scanned documents. In each case, we show that our method substantially improves accuracy over a variety of existing methods