US 12,223,691 B2
Max-flow/min-cut solution algorithm for early terminating push-relabel algorithm
Xinzhe Liu, Shanghai (CN); Guangyao Yan, Shanghai (CN); and Yajun Ha, Shanghai (CN)
Assigned to SHANGHAITECH UNIVERSITY, Shanghai (CN)
Appl. No. 17/798,898
Filed by SHANGHAITECH UNIVERSITY, Shanghai (CN)
PCT Filed Sep. 22, 2021, PCT No. PCT/CN2021/119508
§ 371(c)(1), (2) Date Aug. 11, 2022,
PCT Pub. No. WO2022/222367, PCT Pub. Date Oct. 27, 2022.
Claims priority of application No. 202110421777.5 (CN), filed on Apr. 20, 2021.
Prior Publication US 2024/0112443 A1, Apr. 4, 2024
Int. Cl. G06V 10/762 (2022.01); G06V 10/764 (2022.01); G06V 10/96 (2022.01)
CPC G06V 10/7635 (2022.01) [G06V 10/764 (2022.01); G06V 10/96 (2022.01)] 2 Claims
OG exemplary drawing
 
1. 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.