Ripple push method for graph cut
US11934459B2 · kind B2 · utility
Assignee
Inventors
Key dates
| Filing date | Sep 22, 2021 |
| Grant date | Mar 19, 2024 |
| Priority date | — |
| Expiry date | Sep 22, 2041 |
Classification
- Technology area (CPC G)Physics
- CPC primaryG06T2207/20072
- WIPO fieldComputer technology
- WIPO sectorElectrical engineering
Abstract
A ripple push method for a graph cut includes: obtaining an excess flow ef(v) of a current node v; traversing four edges connecting the current node v in top, bottom, left and right directions, and determining whether each of the four edges is a pushable edge; calculating, according to different weight functions, a maximum push value of each of the four edges by efw=ef(v)*W, where W denotes a weight function; and traversing the four edges, recording a pushable flow of each of the four edges, and pushing out a calculated flow. The ripple push method explores different push weight functions, and significantly improves the actual parallelism of the push-relabel algorithm.
Source: USPTO / EPO open patent data. Objective bibliographic and citation counts.