Baum-Eagon inequality in probabilistic labeling problems

This work illustrates an approach to the study of labeling, aka “object classification”. This kind of parallel computing problem well suites to AI applications (pattern recognition, edge detection, etc.) Our target consists in simplifying an overly computationally costly algorithm proposed by Faugeras and Berthod; using Baum-Eagon theorem, we obtained a reduced algorithm which produces results comparable with other more complex approaches.