38 results about "Maximum weight matching" patented technology

The invention provides a video clip retrieval method and a system, and the method comprises the following steps: original video clips are frame-sampled; sample frames selected from each original video clip are clustered, a frame of image is selected from each cluster as a representative frame, and the proportion value of the representative frame is calculated according to the quantity of intraframe images in each cluster; a weighted bipartite graph is built according to the representative frames of two video clips to be compared, and the weight of the weighted bipartite graph is determined by similarity between the representative frames and the proportion value of the representative frame in the corresponding cluster; maximum weight matching is carried out on the weighted ratio bipartite graph so that the similarity between the two video clips is obtained; and the video clips similar to the input video clips are searched in a database by the analysis of the similarity of the video clips. The video clip retrieval method and the system can accurately give similarity between video clips even in case of greater changes in video clip duration, and provide effective video retrieval results.

The invention relates to a document similarity calculation method and a near-duplicate document detection method and device. The calculation method comprises the following steps: performing word segmentation processing on two documents to be detected to obtain respective participle sets of the documents to be detected; calculating the edition similarity of all participle pairs in the two participle sets, wherein two participles in each participle pair come from the two participle sets respectively; establishing sides among the participle pairs of which the edition similarity meets a certain requirement in all the participle pairs to obtain a weighted biograph, wherein the edition similarity is the weights of the sides of corresponding participle pairs; calculating the maximum weighted matching value of the weighted bi-graph; calculating the similarity between the documents to be detected by using the maximum weighted matching value. By adopting the document similarity calculation method and the near-duplicate document detection method and device provided by the invention, high accuracy is achieved, near-duplicate texts comprising participle set edition errors can be identified effectively, the near-duplicate document detection accuracy is increased, the calculation complexity is lowered, and the calculation efficiency is optimized.

The invention requests for protecting a resource distribution method based on full-duplex D2D communication in a cellular network. Full-duplex (FD) D2D (Device-to-device) communication is introduced in the cellular network; therefore, the burden of a base station can be reduced; the energy consumption of a terminal can be reduced; the cell coverage range can be enlarged; but, resource sharing of D2D users and cellular users brings about a certain same-frequency interference to a system; mutual interference can be reduced through reasonable resource distribution; a resource distribution algorithm having the maximum weight matching is provided in the invention; on the premise that the service quality requirements of the cellular users are ensured through the algorithm, the lowest requirements of D2D link communication can also be ensured through the algorithm; the resource distribution relationship of the cellular users and the D2D users in the system is equivalent to the vertex matching relationship in a graph theory; wireless resources are reasonably distributed between D2D user pairs and the cellular users by utilizing the maximum weight matching algorithm in the graph theory; interference between the cellular users and the D2D users can be effectively reduced; the relatively good fairness can be obtained; and simultaneously, the throughput capacity of the system is maximized.

The invention discloses a Storm-based stream computing bipartite graph task scheduling method. The method is characterized in that Storm DAJG (Directed Acyclic Job Graph) nodes and cluster physical machine UNG (Undirected Node Graph) nodes are seen as two types of vertexes of a bipartite graph; a bipartite graph model is built; and in combination with computing capabilities of nodes of physical machines in a cluster and network transmission delay in the cluster, and according to schedulable relationships between tasks and node resources, task scheduling is performed by adopting an algorithm for solving maximum weight matching of the bipartite graph. According to the method, under the condition of ensuring resource load balance of the physical machines in the cluster, the network delay in adata stream migration process during task execution is shortened, so that the overall performance of a system is improved.

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 a D2D resource allocation method based on uplink and downlink spectrum joint multiplexing, and belongs to the technical field of wireless communication. The method comprises the following steps: firstly, modeling D2D channel allocation variables and related constraint conditions; modeling the transmission rates of the D2D user and the cellular user in the multiplexing moderespectively, and constructing a D2D resource allocation problem into a mixed integer nonlinear programming problem phi by taking maximization of the throughput of the D2D network as a target; decomposing the problem phi into a power allocation problem phi 1 and a channel allocation problem phi 2; converting a problem phi 1 into a convex optimization problem by utilizing a Lagrange duality theory;and substituting the solution of the problem phi 1 into phi to obtain a problem phi 2, converting the problem phi 2 into a bipartite graph maximum weight matching problem, and then solving by utilizing a Hopcroft-Karp algorithm until optimal channel resource allocation of all D2D users is realized, thereby realizing maximization of D2D network throughput.

The invention discloses a multi-attribute coding and dynamic weight-based graph matching method. The method comprises the steps of inputting two to-be-compared graph objects and converting the graph objects into edge attribute adjacency graphs; according to information of vertexes and edges in the edge attribute adjacency graphs, performing multi-attribute coding including basic attributes and adjacency attributes for the vertexes in the edge attribute adjacency graphs; hierarchically calculating the similarity between every two vertexes in the edge attribute adjacency graphs by adopting a dynamic weight method, and performing storage to form a vertex similarity mapping matrix; and when a weighted sum of maximum weight matching of the vertex similarity mapping matrix is maximum, obtaininga similarity distance between the two graphs and corresponding edges. The basic attributes and the adjacency attributes of the edges of the graphs are comprehensively considered, and the coding and the similarity calculation are performed according to the respective characteristics, so that the stability and reliability of graph matching are improved and the application range is expanded.

The invention discloses a resource allocation method used for a full duplex cellular network physical layer safe scene, aims at a full duplex cellular network where a plurality of upstream users, downstream users and eavesdroppers, adopts BGRA(Bipartite Graph Based Resource Allocation Scheme), constructs a bipartite graph according to a full duplex cellular network, converts the multi-user resource allocation problem into the bipartite graph maximum weight matching problem, an optimal subgraph is a subgraph with the sum of all edge weights being the largest, and through an acquired optical subgraph G' of a bipartite graph, reasonably allocates Resource Blocks (RBs) and power resources. The resource allocation method used for the full duplex cellular network physical layer safe scene can realize mutual cooperation of uplinks and downlinks in the full duplex system, thereby enhancing safety performance of the physical layer; and can also obtain quasi-optimal safety capacity of a full duplex cellular system with relatively low computation complexity, thereby achieving the purpose of improving the system safety capacity.

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 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 present invention relates to the field of communication middleware. The invention discloses a parallel processing method suitable for distributed communication middleware, which maps the joint relationship between Agent sets and resource libraries into geometric graph theory, establishes models, and finds out The maximum weight matching of the original graph is to establish the agent parallel processing model in the system, so that each agent can call the system resource library without conflict while performing the task to the greatest extent. The invention also discloses an Agent structure suitable for parallel processing of the distributed communication middleware, which enables the Agent to use the system resource library without conflict to the greatest extent.

The invention discloses a time delay and energy efficiency sensitive service-oriented distributed wireless network task collaborative allocation method. The method comprises the following three steps:1, establishing a distributed wireless network model; 2, locally performing task priority ranking and emergency task priority processing on each distributed node by adopting an analytic hierarchy process, and then sequentially transmitting the task information with the highest current priority to a central node by each node; and 3, the central node constructing a bipartite graph maximum weight matching model for the state information, the task information and the network information of each distributed node, and reallocating the tasks by using a task allocation method based on a KM algorithm.According to the time delay and energy efficiency sensitive service-oriented distributed wireless network task collaborative allocation method, the task allocation target can be flexibly determined according to the requirements of users and the characteristics of tasks, and the task execution time or energy consumption in distributed nodes is effectively reduced.

The invention discloses a spectrum resource allocation method based on auction. The spectrum resource allocation method based on the auction uses two layers of auction models, wherein the first layer auction is based on a main user and a relay node, and the second layer is between the relay node and a secondary user. The spectrum resource allocation method based on the auction comprises the following steps: the second layer auction is performed virtually; the relay node collects the budget, the quotation, and the demand for resources of the secondary user; the amount of collected money is calculated; the secondary users are randomly divided into two sets, and the victorious secondary user set is confirmed firstly; the relay node competes for the main user spectrum resource after collecting the amount of the secondary user; the main user submits the price of the spectrum resource, and the relay node submits the budget for the resource, so that a two division graph is set up, and the difference of the price and the budget is used as the weight of the two division graph; the maximum weighted matching algorithm is used for the two division graph, and the VCG auction algorithm is used to calculate the final payment amount of the relay node; and after the relay node competes for the main user successfully, the second layer auction is carried out again to assign the competitive spectrum resources to the final victorious secondary user.

The present invention provides an electric power communication network cache optimization method facing content. The method comprises: employing a central controller to obtain bandwidth information and capacity and position information of content and cache nodes; according to the content and cache node information, generating request decision vectors and position decision vectors, and creating a bipartite graph for each file; and aiming at each server node, constructing a bipartite graph according to an actual situation, after constructing one bipartite graph for each file, performing processing according to the time efficiency descending order, completing the bipartite graph maximum weight matching under the restriction of node capacity and flow cost, and completing distribution. The algorithm is operated at the central controller of the electric power communication network and takes the minimization of total transmission time delay in a power grid special network domain as a target on the premise of obeying the restriction of disc space and access line capacity of distributed cache nodes to execute cache deployment decision. Through execution of the algorithm, the scheduling is reasonably and rapidly performed to optimize the storage position and allow subscribers to access the nearest cache nodes so as to reduce the transmission time delay.

The invention is applicable to the technical field of offline map matching, and provides an offline map matching method. The method models an offline map matching problem into a shortest path problemtaking minimization of a total matching difference value between moving track data and a matching path as an optimization target, so that on one hand, the problem of arc crossing in offline map matching is solved, and on the other hand, the problem of arc crossing in offline map matching is solved; on the other hand, compared with an incremental matching method which only considers the informationof the adjacent GPS positioning points or the adjacent track segments to match the current GPS positioning points or the track segments, the offline map matching method provided by the embodiment ofthe invention has the advantages that a driving path with the minimum total matching difference value with the moving track data is found from the global perspective, a high matching precision is obtained, and in the process, a plurality of candidate matching positions do not need to be set for each GPS positioning point, and only one shortest path from the starting node to the destination node needs to be calculated, so that compared with a global maximum weight matching method, the method of the invention omits a large amount of shortest path calculation and greatly improves the map matchingefficiency.

The invention provides an energy consumption and user fairness combined content delivery method in a D2D (Device-to-Device) cache network and belongs to the technical field of wireless communication.The method comprises the realization steps of simulating a two-way selection process between request users and cache users in a content delivery process into the maximum weight matching problem in a bipartite graph; and carrying out content delivery through D2D, assuming that at the same time, a file f<k> in a network has M request users and N cache users, and when the content delivery is carriedout, carrying out the following condition that when the M is smaller than or equal to the N, M users are selected from the cache users for matching with the requests users, when the M is greater thanthe N, N users are selected form the request users for matching with the cache users, and it is ensured that weight sum of the matching users is the maximum. According to the method, in the content delivery process of a cellular and D2D network based on cache, energy consumption resulting from unsuccessful transmission is taken into consideration, and fairness for the users to obtain content is also taken into consideration, so energy consumption can be reduced, and the fairness for the users to obtain the content also can be ensured.

The invention discloses an event discovery and display method based on a knowledge graph. The method comprises the following steps: S100, preprocessing each piece of government service hotline data; s200, dividing the government service hotline data in the time period selected by the user into data frames according to a time interval specified by the user, and performing event detection on the government service hotline data in each frame through a community discovery algorithm to obtain each city event; and S300, based on a bipartite graph maximum weight matching algorithm, matching events of front and back frames, establishing an event chain of each city event evolution, analyzing z-score values of each city event in the event chain, determining emergencies and emergency degrees of each city event, and performing early warning and multi-dimensional visualization on the city emergencies therein. According to the invention, various events occurring in a city can be clearly known, and detection and early warning can be carried out on emergencies in the city.

The invention discloses an in-vehicle heterogeneous network resource collaborative optimization method based on a graph theory. The method comprises the following steps: determining whether communication between a vehicle and a base station is single-hop communication or two-hop communication, and performing classified collection to form a single-hop communication set and a two-hop communication set; combining the single-hop communication set and the two-hop communication set into a bipartite graph according to the graph theory, calculating amount of service of each single-hop communication and two-hop communication, and then, ranking the amount of service of links in the single-hop communication set according to size; selecting vehicle nodes with minimum value of the amount of service toform a DV vehicle set, forming a RV vehicle set with the other vehicles, and taking the DV vehicle set and the RV vehicle set as peaks to form a weighted bipartite graph; calculating weight of each side between the peaks of the weighted bipartite graph, further looking for an overall maximum weight matching scheme of the weighted bipartite graph through a KM algorithm, and setting a delay-limitingconstraint condition in a matching process; and performing iterative updating for the number of the DV vehicles through a binary search method, and according to an iterative updating result, judgingwhether an optimal collaborative scheme of communication between the vehicle and the base station is found.

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 invention belongs to the technical field of data mining, and discloses a high-order control chart mode detection method and system, a storage medium and an application. The method comprises the steps: classifying a connection edge relation of each layer in a complex system into a key edge, a common edge and a redundant edge from the perspective of structural controllability based on a maximummatching recognition method of a chart; measuring the consistency of common edges among multiple layers by using quantitative indexes, and constructing a multi-layer consistency control network with weight; providing an improved maximum weight matching detection method, and identifying a set of matching edges in each layer of network composed of common edges; and detecting a high-order control chart mode of the consistent control network in combination with the matching edge and the key edge of each layer. The method has the advantages of high efficiency, data noise resistance and unique determinacy of the detected high-order control graph mode, and provides tool support for knowledge discovery in a multi-layer complex system; and generality and characteristics of the multi-layer network can be described.

The invention relates to the technical field of object three-dimensional measurement, in particular to a phase unwrapping method based on a Goldstein branch cutting method. Obtaining a truncated phase diagram; a Goldstein branch cutting method is adopted to identify residual error points in the truncated phase diagram; constructing a weighted bipartite graph, and converting the problem of constructing the branch tangent with the shortest total length into the problem of solving the maximum weight matching of the weighted bipartite graph; a Kuhn-Munkres algorithm is used to solve the maximum weight matching of the weighted bipartite graph; according to the maximum weight matching connection residual error points, constructing branch tangent lines; and selecting a pixel point which is not on the branch tangent line as a starting point to perform phase unwrapping. The branch tangent line with the shortest total length can be constructed, and the island phenomenon can be eliminated, so that a better phase unwrapping result is obtained, and the three-dimensional measurement precision is improved.

The invention discloses a link priority virtual network mapping method based on maximum weighted matching, relates to the technical field of computer networks, in particular to virtual network mapping, and the method can effectively reduce the number of physical links of virtual links. On the basis of the link priority mapping method, the present invention changes the random link mapping into a mapping method with the goal of minimizing the link distance, and defines a new link comprehensive bandwidth measurement index, which comprehensively considers the bandwidth of the link itself And the bandwidth of the adjacent link, and then map the first virtual link in the maximum weighted matching to the physical link with the largest comprehensive bandwidth metric, so as to improve the success probability of subsequent mapping. Through the above solution, the present invention can effectively reduce the average number of physical links of the virtual links in the virtual network mapping result, and improve the acceptance rate of the virtual network.

The invention provides a method of a through-the-wall radar for multi-moving target real-time tracking in complex environment. First a Kalman filter is utilized to predict the positions and energy ofall trajectories at a current moment, two neighborhood domains with position and energy predicted values as centers are built respectively, and all targets in the two neighborhoods at the same time are associated with the corresponding trajectory; an improved nearest neighborhood domain method based on position and energy information and a bipartite graph maximum weight matching algorithm are thenutilized to find out a target realizing optimal matching with each motion trail among the associated targets; then current states of the trajectories are judge according to trajectory quality based on a log-likelyhood ratio, thereby determining trajectory maintenance, new trajectory generation or trajectory deletion; and finally, the Kalman filter is utilized to perform smooth processing on an existing trajectory. The method provided by the invention is simple and is high in execution efficiency, is suitable for tracking of multiple moving human body targets by a portable through-the-wall radar through partition walls, and can effectively improve work efficiency of the wall-penetrating radar.

The invention discloses an automatic problem solving method and device for connection matching test questions.The automatic problem solving method for the connection matching test questions.The automatic problem solving method for the connection matching test questionscomprises the steps that text information of the connection matching test questions.The text information is subjected to structural processing to obtain at least two to-be-matched text information sets textsa, textsb...; calculating text feature information in text information sets textsa, textsb,... of all the parts for judging which algorithm is adopted for matching and scoring; matching texts in the text information sets textsa, textsb,..., of all the parts by adopting a maximum weight matching algorithm according to a matching scoring result; and backtracking the structure information of the connection matching test questions to generate an automatic question solving answer. According to the automatic question solving method for the connection matching test questions, automatic answering of the connection matching test questions of different question types is achieved, different algorithms are adopted for different question types, and the accuracy of automatic answering of the connection matching test questions is ensured.

The invention proposes a content distribution method combining energy consumption and user fairness under a D2D cache network, which belongs to the technical field of wireless communication. The implementation steps include: first, simulate the two-way selection process between the requesting user and the cache user in the content distribution process as a maximum weight matching problem in a bipartite graph; then, carry out content distribution through D2D. file k There are M requesting users and N cached users; including the following situations: when M≤N, select M users from the cached users to match the requesting users; when M>N, first select N from the requesting users The user is matched with the cached user; the sum of the weights of the matched users is guaranteed to be the largest. In the content distribution process based on the cached cellular and D2D network, the present invention considers the energy consumption caused by the transmission failure, and also considers the fairness of the content obtained by the user, which can not only save energy consumption, but also ensure the fairness of the content obtained by the user.

A cross-social-network virtual user identity alignment method based on spatio-temporal behavior data mainly comprises the following steps: 1) preprocessing spatio-temporal behavior data generated by auser on a social network to generate a user spatio-temporal behavior sequence; 2) defining and calculating the similarity of any two users between the social networks based on the spatio-temporal behavior sequence data; 3) constructing a bipartite graph taking social network users as nodes, the same social network user nodes are edgeless, and the weight of edges between different social network user nodes is equal to the user similarity; 4) calculating the maximum weight matching of the bipartite graph; and 5) generating a virtual identity alignment result based on the maximum weight matchingresult. The method can provide important theoretical basis and technical support for comprehensively analyzing the role played by the user in the social network and accurately estimating the real attribute of the user, the required data is easy to obtain in the real social network, the calculation process is easy to carry out through a distributed framework, and the calculation efficiency is improved. Virtual user identity alignment can be quickly achieved in a large-scale complex network.

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.