Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Hiro

61 results about "Bipartite graph matching" patented technology

A matching in a Bipartite Graph is a set of the edges chosen in such a way that no two edges share an endpoint. A maximum matching is a matching of maximum size (maximum number of edges).

Network selection method based on weighted optimal bipartite graph matching

The invention provides a network selection method based on weighted optimal bipartite graph matching. The network selection method based on weighted optimal bipartite graph matching comprises the following steps that (1) the parameters of user present service quality, service demands and network performance all serve as input parameters and applied to the network selection process in a cloud processing center; (2) if the number of users is larger than the number of candidate networks, multi-user fair scheduling is conducted firstly; (3) a bipartite graph model is created for the network selection question; (4) the matching degree of the demands and the network performance of each pair of users is calculated, and network selection based on bipartite graph optimal matching is achieved; (5) the network load conditions are detected, and other networks are reselected for the users in an overload network and the users with access being blocked. According to the network selection method based on weighted optimal bipartite graph matching, a heterogeneous network convergence scene is combined with the multi-user scheduling technology, a complicated problem is divided into simple partial problems to be solved, and low-complexity optical network selection integrating the user demand and the network performance is achieved.
Owner:SOUTHEAST UNIV

Disjoint-view object matching method based on corrected weighted bipartite graph

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.
Owner:SOUTHEAST UNIV

PCB image color migration device and method based on clustering analysis

The invention provides a PCB image color migration device and method based on clustering analysis, and the device comprises an image collection module which obtains a source image and a target image;a RGB color image acquisition module which is used for respectively acquiring RGB color images converted from the source image and the target image; a color space conversion module which converts theRGB color image into an LAB color image; a color clustering module which is used for setting and clustering the LAB color images by utilizing the number of color clusters to generate a color cluster category list; a color cluster matching module which performs PCB bipartite graph matching on the list of the source image and the target image to obtain a matching result; a color mapping module whichcalculates a transformation matrix according to a matching result, and maps the LAB color image to a new color according to the matrix; and a color space inverse transformation module which convertsthe mapped color into an image after RGB color migration. According to the device, colors in an image are divided into different categories by clustering, color migration is carried out on the colorsof the different categories respectively, and a good image registration effect is achieved.
Owner:TSINGHUA UNIV

Image style brush realization method and device

Embodiments of the invention provide an image style brush realization method and device. The method comprises the following steps of: obtaining matched corresponding points of an input image and a reference image according to density correspondence between the input image and the reference image; determining a first superpixel set of the input image and a second superpixel set of the reference image according to the matched corresponding points, and further determining a superpixel bipartite graph; carrying out bipartite graph matching on the superpixel bipartite graph so as to determine mutually matched superpixel pairs in the first superpixel set of the input image and the second superpixel set of the reference image; and carrying out color conversion on superpixels of the input image according to a first color space and the superpixel pairs so as to obtain a result image. According to the method and device, style conversion is carried out on the input image according to multiple style elements of the reference image so as to obtain the result image, so the multiple style elements in the reference image are directly and completely converted onto the input image, the visual effect related to the color, greyscale and contrast ratio of the input image is changed, and then the result image further has the style of the reference image.
Owner:PEKING UNIV

Bipartite graph based in-vehicle network distributed storage method

The invention discloses a bipartite graph based in-vehicle network distributed storage method. According to the bipartite graph based in-vehicle network distributed storage method, a distributed storage problem is firstly modeled, and bipartite graph matching is performed, so that optimal in-vehicle network distributed storage of in-vehicle request identification information sent by each in-vehicle node can be achieved under different conditions, and in-vehicle network can respond to maximum in-vehicle request identification information; subsequently, repeated network information stored by roadside units is cleared, resource waste generated by the fact that multiple roadside units respond to the same in-vehicle request identification information is avoided, and meanwhile, in-vehicle request identification information which is met is not affected; finally, in-vehicle request identification information which is not met is collected, and secondary allocation is performed on spare storage space obtained by clearing the roadside units until each roadside unit has no spare storage space, or all the in-vehicle request identification information received by the roadside units is responded, or remaining in-vehicle request identification information cannot be met; a storage resource utilization rate and a data response data are increased, and data service qualities of an in-vehicle network are guaranteed.
Owner:深圳市千方航实科技有限公司

Online cross-scale multi-fluid target matching and tracking method

The invention relates to an online cross-scale multi-fluid target matching and tracking method, which comprises the following steps of: extracting an associated object by adopting a sliding window, matching and tracking specific characteristics on an associated object image, and extracting fluid target characteristics of different scales; selecting basic characteristic parameters for characteristic extraction according to fluid target characteristics of different scales; calculating a composite association weight according to the feature information of the two continuous frames, extracting spatial association and time association information between different body targets through the composite association weight, and constructing a weighted bipartite graph based on the two adjacent framesbased on the association information; performing online target matching by adopting a sparse weighted bipartite graph matching algorithm, and constructing a sparse weighted bipartite graph based on the matched target; and performing target tracking and trajectory prediction by adopting a Kalman filtering algorithm based on the constructed sparse weighted bipartite graph. According to the invention, the multi-fluid target matching tracking precision can be effectively improved; the running time of the method is reduced to the second level, and the online algorithm requirement is met.
Owner:CHINA ELECTRONICS TECH GRP CORP NO 14 RES INST
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products