发明名称 |
Efficiently labelling image pixels using graph cuts |
摘要 |
A method of solving an energy minimization problem, the method comprising: a. constructing a graph representative comprising a set of nodes; two terminals; a set of N-links each connecting a pair of the nodes; and a set of T-links each connecting one of the terminals with one of the nodes; b. assigning a capacity to each of the N-links; c. assigning a capacity to each of the T-links; d. determining a first minimum cut/maximum flow solution which partitions the nodes into subsets, each subset containing one of the terminals; e. changing the capacity assigned to at least one of the N-links and at least one of the T-links in response to a change in the problem; and f. dynamically updating the first minimum cut/maximum flow solution determined in step d. to take into account the changed capacities.
|
申请公布号 |
US2006291721(A1) |
申请公布日期 |
2006.12.28 |
申请号 |
US20060471117 |
申请日期 |
2006.06.20 |
申请人 |
OXFORD BROOKES UNIVERSITY |
发明人 |
TORR PHILIP H.S.;KOHLI PUSHMEET |
分类号 |
G06K9/34;G06K9/46 |
主分类号 |
G06K9/34 |
代理机构 |
|
代理人 |
|
主权项 |
|
地址 |
|