The problem we address in this paper is to label datapoints when the information about them is provided primarily in terms of their subsets or groups. The knowledge we have for a group is a numerical weight or likelihood value for each group member to belong to same class. These likelihood values are computed given a class specific model, either explicit or implicit, of the pattern we wish to learn. By defining a Conditional Random Field (CRF) over the labels of data, we formulate the problem as an Markov Network inference problem. We present experimental results for analytical model estimation and object localization where the proposed method produces improved performances over other methods. © 2011 Springer-Verlag.
CITATION STYLE
Parag, T., & Elgammal, A. (2011). Higher order Markov networks for model estimation. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6938 LNCS, pp. 246–258). https://doi.org/10.1007/978-3-642-24028-7_23
Mendeley helps you to discover research relevant for your work.