System and method for optimizing single and dynamic markov random fields with primal dual strategies

摘要

A method for determining an optimal labeling of pixels in computer vision includes modeling an image by a graph having interior nodes and edges where each image point p is associated with a graph node, each pair of nearest neighbor points p, q is connected by a graph edge, each graph node p is associated with a singleton potential c(p), and each graph edge is associated with a pairwise potential function d(p,q). A label is randomly assigned to each point to initialize unary variables including an indicator function that indicates which label is assigned to which point and dual variables including height variables associated with each node p and label a, and balance variables associated with each edge (p,q) and label a. For each label, a new label c is selected, a capacitated graph is constructed and solved. The label selection divides the image into disjoint regions.