Abstract: A method for segmenting a digital image includes initializing object and background seed nodes in an image, where the image is represented as a graph G=(V, E) whose nodes i?V correspond to image points and whose edges e?E connect adjacent points, where set M?V contains locations of nodes marked as seeds, set U?V contains locations of unmarked nodes, set O?M contains locations of object seed nodes, and set B?M contains locations of background seed nodes, assigning to each seed node a membership value such that ?i?O,xi=1 and ?i?B,xi=0, where each node i?V is associated with a membership xi?[0,1], and finding a membership vector x?, whose ith entry is given by xi that minimizes E p ? ( x ) = ? eij ? E ? w ij ? ? x i - x j ? pij , where each edge eij?E connecting nodes i and j in V is associated with a weight wij and an exponent pij, and ?eij?E,1?pij<?, such that xi=1 if i?O and xi=0 if i?B.

Abstract: Methods for segmentation of an object from a background in an image are disclosed. Segmentation is achieved by an adapted Random Walker segmentation method using directed edges in a graph. The segmentation applies the minimization of an approximation of an energy function. A minimizer of the approximated energy function can be found by using iterative steps. Weights are assigned to an edge between two nodes. The weights are dependent on the direction of an edge. A system for segmentation of an object from a background is also disclosed.

Abstract: A method for segmenting a digital image includes initializing object and background seed nodes in an image, where the image is represented as a graph G=(V, E) whose nodes i?V correspond to image points and whose edges e?E connect adjacent points, where set M?V contains locations of nodes marked as seeds, set U?V contains locations of unmarked nodes, set O?M contains locations of object seed nodes, and set B?M contains locations of background seed nodes, assigning to each seed node a membership value such that ?i?O,xi=1 and ?i?B, xi=0, where each node i?V is associated with a membership xi?[0,1], and finding a membership vector x?, whose ith entry is given by xi that minimizes E p ? ( x ) = ? eij ? E ? w ij ? ? x i - x j ? pij , where each edge eij?E connecting nodes i and j in V is associated with a weight wij and an exponent pij, and ?eij?E,1?pij<?, such that xi=1 if i?O and xi=0 if i?B.

Abstract: Methods for segmentation of an object from a background in an image are disclosed. Segmentation is achieved by an adapted Random Walker segmentation method using directed edges in a graph. The segmentation applies the minimization of an approximation of an energy function. A minimizer of the approximated energy function can be found by using iterative steps. Weights are assigned to an edge between two nodes. The weights are dependent on the direction of an edge. A system for segmentation of an object from a background is also disclosed.