38 results about "Maximum weight matching" patented technology

The invention belongs to video search technique area especially, related to the new method for searching video based on a segment of video. Aim at disadvantages of current technique such as low searches precision and slow searches speed, the invention puts forward and solves two difficult problems under frame of optimal matching in graph theory: automatic obtaining similar segments and evaluating degree of similarity between two segments. Model of weighted bipartite graph is built. Examining continuity of similar frames obtains similar segments in preliminary. Maximum weighted matching between these segments and queried segment is calculated out by using Kuhn_Munkres method. The match determines whether two segments are similar or not as well as boundary of similar segments. Maximum weight shows degree of similarity between two segments. Comparing with prior art, experimental result indicates the invention obtains higher precision ratio, recall ratio and quicker searching speed.

The invention discloses an optimal relay selection method based on a two-way auction model. The method includes the steps of firstly, informing beginning of action through an auctioneer, determining a respective offer or a respective asked price through each node according to a respective resource condition, then, defining an energy efficiency function between contracting parties according to an actual situation, setting up a complete weight pre-matching bipartite graph; obtaining a maximum energy efficiency matching relationship between nodes by utilizing a maximum weight matching algorithm; and finally, deleting a virtual paring relationship according to an actual relationship, and obtaining finally successful trade. The two-way auction model is utilized to achieve the optimal relay selection method which aims at the optimal relay mode selection of an edge user to obtain high energy efficiency and expand a communication range. Energy consumption of a system and nodes is effectively reduced, the maximum weight matching algorithm is utilized to help the system to select an optimal energy efficiency matching combination and obtain the final deal matching relationship through deletion of virtual matching. Energy consumption of an individual user and even the whole system is effectively reduced, and network performance is improved.

The invention provides a disjoint-view object matching method based on a corrected weighted bipartite graph. The method relates to the field of computer vision. The method expresses a disjoint-view object matching problem as a maximum posterior probability problem, so that an object observation model and time-space constraints of a surveillance network are combined, and the maximum posterior probability problem is resolved through solving the maximum weight matching of a weighted bipartite graph. To solve the problem that construction of a common weighted bipartite graph is liable to introduction of incorrect matching, the method provides a corrected weighted bipartite graph construction method based on an adaptive threshold, so that incorrect matching is prevented from being introduced during construction of the weighted bipartite graph as much as possible. Aimed at the defect of a conventional KM method that the amount of computation is too large during large-scale weighted bipartite graph matching problem solving, the method brings forward a MH sampling-based method for approximating and solving the maximum weight matching of the weighted bipartite graph, so that a disjoint-view object matching relationship is obtained.

The present invention requests protection of a resource allocation method based on full-duplex D2D communication in a cellular network. The introduction of full-duplex (Full Duplex, FD) D2D (Device-to-Device) communication in the cellular network can reduce the burden on the base station, reduce the energy consumption of the terminal, and expand the coverage of the cell. However, sharing resources between D2D users and cellular users brings certain co-channel interference to the system, and the mutual interference can be reduced through reasonable resource allocation. A resource allocation algorithm based on maximum weight matching is proposed in this paper. Under the premise that the algorithm can guarantee the quality of service requirements of cellular users, it also guarantees the minimum requirements for D2D link communication. The resource allocation relationship between cellular users and D2D users in the system is equivalent to the vertex pairing relationship in graph theory. The maximum weight matching algorithm in the algorithm reasonably allocates wireless resources between D2D user pairs and cellular users, effectively reduces the interference between cellular users and D2D users, obtains better fairness, and maximizes the throughput of the system at the same time.

The invention discloses a D2D resource allocation method based on uplink and downlink spectrum joint multiplexing, and belongs to the technical field of wireless communication. The invention firstly models the D2D channel allocation variables and related constraints; respectively models the transmission rates of the D2D users and the cellular users in the multiplexing mode, aiming at maximizing the throughput of the D2D network, the D2D resources are allocated The problem is constructed as a mixed integer nonlinear programming problem Φ; the problem Φ is decomposed into a power allocation problem Φ 1 and the channel assignment problem Φ 2 ; use Lagrange duality theory to convert the problem Φ 1 Converted to a convex optimization problem; the problem Φ 1 Substitute the solution into Φ to get the problem Φ 2 , transform it into a bipartite graph maximum weight matching problem, and then use the Hopcroft-Karp algorithm to solve until the optimal channel resource allocation for all D2D users is achieved, thereby maximizing the throughput of the D2D network.