Label is denoted by disparity and the energy function is established.Then the problem of matching can be transformed into that of energy function minimization.A network is constructed such that the energies can be related to the capacities of the cuts of the network.Finally

the minimal energy is obtained by the network-flows theory

and hence the disparity data are solved.Comparing with some known algorithms based on graph cuts

the algorithm in this paper extends the label from 1 dimension vector to 2 dimension vector

and adapts vision matching of more general conditions;furthermore the algorithm can gain the minimization in global.Experimental results show that the algorithm has a high accuracy.