Max-flow/min-cut solution algorithm for early terminating push-relabel algorithm

A computer vision method, implemented by a processor, employing a max-flow/min-cut solution algorithm for early terminating a push-relabel algorithm, used for an application that does not require an exact maximum flow, comprising:

• defining, by the processor, an early termination condition of the push-relabel algorithm by a separation condition and a stable condition;
• mapping, by the processor, image pixels onto a plurality of nodes;
• assuming, by the processor, that all nodes v of the plurality of nodes reachable to a sink node t of the plurality of nodes in a residual graph constitute a set T and other nodes of the plurality of nodes constitute a set S;
• determining, by the processor, that the separation condition is satisfied when there is no source node s, s∈S, in the set T at any time in an operation process of the push-relabel algorithm;
• determining, by the processor, that the stable condition is satisfied when there is no active node in the set T;
• and
• terminating, by the processor, the push-relabel algorithm when the separation condition and the stability condition are satisfied to reduce computations implemented by the processor to perform the computer vision method on the image pixels;
• wherein the separation condition is defined as an absence of an augmenting path from a source node to the sink node in the residual graph;
• and
• the stable condition is defined as an absence of an augmenting path from any active node to the sink node in the residual graph.