A Latent-Variable Lattice Model

2015/12/23 by Masatran, Rajasekaran
#Computer Vision and Pattern Recognition (cs.CV) #FOS: Computer and information sciences #Machine Learning (cs.LG) #Machine Learning (stat.ML)

paper · doi:10.48550/arxiv.1512.07587

Abstract

Markov random field (MRF) learning is intractable, and its approximation algorithms are computationally expensive. We target a small subset of MRF that is used frequently in computer vision. We characterize this subset with three concepts: Lattice, Homogeneity, and Inertia; and design a non-markov model as an alternative. Our goal is robust learning from small datasets. Our learning algorithm uses vector quantization and, at time complexity O(U log U) for a dataset of U pixels, is much faster than that of general-purpose MRF.

Related

• A discriminative view of MRF pre-processing algorithms
• Learning Deep Structured Models
• Bypassing the Noisy Parity Barrier: Learning Higher-Order Markov Random Fields from Dynamics
• Structure Learning of Markov Random Fields through Grow-Shrink Maximum Pseudolikelihood Estimation
• A novel approach for Markov Random Field with intractable normalising constant on large lattices