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

39 results about "Connected dominating set" patented technology

In graph theory, a connected dominating set and a maximum leaf spanning tree are two closely related structures defined on an undirected graph.

Accurate positioning method for calibration point center coordinate

ActiveCN108205395AHigh precision solutionMeet the problem of positioning accuracyInput/output processes for data processingConnected dominating setComputer science
The present invention relates to a precise positioning method for a calibration point center coordinate. The method comprises the steps of: drawing a calibration point and acquiring a grayscale imageof the calibration point; performing a thresholding operation and connected domain detection on the grayscale image to obtain a calibration point region; calculating to obtain the center coordinate ofthe connected domain of the calibration point and the circumscribed rectangle of the connected domain, and expanding the size of the circumscribed rectangle; according to the size of the circumscribed rectangle and the center coordinate, extracting the contour corresponding to the connected domain of the calibration point of the corresponding region in the grayscale image; carrying out circular fitting to obtain the initial center point of the contour; taking the center point as the center, emitting radiation to the surrounding area, and calculating the gradient amplitude; traversing all thestar rays to obtain the maximum point of the gradient value on each star ray, marking the maximum point as a key point, and completing the circular fitting through the key point to obtain a circle; and reviewing the obtained circle and verifying the positioning result. According to the method disclosed by the present invention, the problems of solving the center coordinate of the positioning areawith high precision and satisfying the positioning accuracy to a great degree are implemented.
Owner:安徽慧视金瞳科技有限公司

Satellite network multicast routing method and system based on minimum connected dominating set

The invention discloses a satellite network multicast routing method and system based on a minimum connected dominating set. The method comprises the following steps: obtaining specific parameters of a three-layer satellite network, and simulating the operation condition of a satellite in the STK software to obtain an on-off condition table of a satellite node within a whole period; constructing a space-time diagram model by time slot division based on the on-off condition table to obtain time link information and space link information of the satellite network; and performing multicast routing service by using a preset MCDS routing algorithm based on the minimum connected dominating set according to the obtained time link information and the space link information of the satellite network. By adoption of the satellite network multicast routing method and system, the waste of resources is reduced, the broadcast storm is avoided, the routing cost caused by the increase of node number under the condition of a single time slot is reduced, and in the case that the number of the time slots is increased, the routing cost is also effectively reduced, and a balance is obtained between two performance index, that is the routing cost and the end-to-end hop number, and in addition, the implementation complexity of the algorithm is low.
Owner:HARBIN INST OF TECH SHENZHEN GRADUATE SCHOOL

MCDS approximation algorithm-based multicast route method with minimized resource consumption

The invention belongs to a route optimization technique in wireless network communication, relates to the problem of saving energy and bandwidth resource consumption of the wireless broadcast transmission in a wireless network, and provides a construction method for a distributive multicast tree with minimized network communication resource consumption based on the problem of MCDS (minimum connected dominating set) in a graph theory. Based on the established multicast tree, the MCDS approximation algorithm-based multicast route method with minimized resource consumption finds a maximum independent set MIS, and then finds all MIS nodes connected with of a dominating node set so as to obtain a dominating multicast tree. The method optimizes the resource consumption of the multicast communication in the communication network. Due to the broadcasting nature of a wireless medium, the bandwidth and energy consumption in the multicast communication mainly depends on the message relay times in the multicast tree. Therefore, the method achieves the aim of reducing the network resource consumption through the reduction of the number of the nodes undertaking the relay mission in the multicast tree.
Owner:WESTERN MINING CO LTD

MCDS (minimum connected dominating set)-based method for constructing delay limit multicast forwarding structure

The invention relates to a problem of minimizing the cost of a multicast routing forwarding structure in an AdHoc network, and construction of a delay limit multicast forwarding structure in a wireless network based on an MCDS (minimum connected dominating set) algorithm in a graph theory. According to particularity of a wireless signal transmission method, the cost and delay function in the wireless multicast routing are redefined. In the method for constructing the delay limit multicast forwarding structure based on the vertex coloring ideas in the graph theory, which is proposed based on the MCDS theory in the graph theory, by solving the MCDS, the purpose of constructing a multicast routing structure with the minimum cost is achieved, the concept of multicast routing delay limit is proposed, and the MCDS is constructed under the constraint. The algorithm is proved to be correct by the theoretical derivation, and the algorithm is proved to be effective by a lower approximate ratio compared with the similar algorithm. At the same time, the algorithm has a time complexity of O(n) and a message complexity of O(n), thus the high efficiency of the algorithm is proved further; and the algorithm has the advantage of adapting to flexible Adhoc networks.
Owner:青海西部矿业科技有限公司

Pressure vessel air tightness detection method based on connected domain determination

The invention discloses a pressure vessel air tightness detection method based on connected domain determination. The method comprises the following steps of step1, setting the original pressure valueof a pressure vessel to be P0, setting the pressure value after T time to be P1, and when P0-P1</=delta, setting the delta as a pressure difference threshold, which expresses a unpressurized state; when P0-P1>delta, expressing that the pressure is being applied and an air tightness test begins; step2, taking the N frames of the images of a video after the air tightness test is started, wherein the n equals to t*f, the t is test time and the f is a video frame rate; and taking the N frames of the images as I1, I2,..., In, graying Ii and acquiring a corresponding grey-scale map Gi, wherein thei equals to 1, 2,...,n; and step3, considering the continuity of bubbles, calculating the number Q of connected images Fj in which the number of connected domains wj is greater than k in the n framesof the connected images Fj, if the Q is greater than a threshold T, considering that there is an air leakage condition. The method has an advantage that based on the connected domain determination, through combining the sizes and the number of the bubbles, and a dynamic characteristic, whether a pressure vessel has the air leakage condition can be accurately determined.
Owner:ZHEJIANG UNIV OF TECH

Image processing method and system of detecting tyre rubber geometric impurities

The invention discloses an image processing method and system for detecting geometric impurities in tire rubber. The method includes: step 1, obtaining a binarized image of the tire rubber; step 2, according to different characteristics of rubber pixel points and carbon black pixel points value, obtain the connected domain of carbon black pixels in the binarized image; step 3, calculate the area A and width d of each connected domain; step 4, calculate each connected domain according to the area A and width d of each connected domain The slender length S of the connected domain; Step 5, compare the calculated slender length of each connected domain with a preset threshold, and the connected domain whose slender length exceeds the preset threshold is a geometry with carbon black pixels in the binarized image shape impurities. The beneficial effects of the present invention are: processing the binarized image by using the slender length of the connected domain, the geometric impurities such as straight lines, circles and curves in the binarized image can be identified and image-segmented, and the obtained binarized image is more accurate. It can reflect the distribution of carbon black in rubber.
Owner:WUHAN UNIV OF TECH

Online detection method for time and space abnormal events by river network

The invention discloses an online detection method for time and space abnormal events by a river network. The online detection method comprises the following steps of firstly, selecting backbone nodes by using a connected dominating set algorithm, and only detecting the states of the backbone nodes in each time stamp sensor network; secondly, detecting whether the time and space abnormal events occur in the backbone nodes or not; if the backbone nodes have time abnormality, adding child nodes of the backbone nodes in a detected candidate set; detecting whether the backbone nodes having the time abnormality are deviated from the spatial relation obtained by learning or not by comparing the expected state obtained by Bayesian network learning with the observation state; if the spatial abnormality occurs, adding one to a time and space abnormality counter; at next time stamp, widening the detection range including the backbone nodes and nodes in the candidate set, and continuously detecting whether the space abnormality or the time abnormality occurs or not; finally, when the number of the backbone nodes and the nodes of the candidate set of the backbone nodes with the time and space abnormalities reaches a threshold Q, considering that the time and space abnormal events occur.
Owner:HOHAI UNIV

Ad Hoc network virtual backbone node identification method

The invention relates to an Ad Hoc network virtual backbone node identification method, which belongs to the technical field of communication and solves the problem that the Ad Hoc network backbone nodes cannot be effectively identified in the prior art. The Ad Hoc network virtual backbone node identification method comprises the following steps: distinguishing and locating the nodes in the Ad Hocnetwork through a radio locating method, so as to obtain the number of the nodes, the location information of the nodes, and the size of the node deployment area; obtaining an important communicationdistance according to the number of the nodes and the size of the node deployment area; performing network physical topology inference according to the location information of the nodes and the important communication distance; and performing identification on the virtual backbone nodes using a unified connected dominating set according to the result of the network physical topology inference. The Ad Hoc network virtual backbone node identification method realizes automatic identification of the virtual backbone nodes in the Ad Hoc network. The result obtained by the Ad Hoc network virtual backbone node identification method is beneficial to the protection of the backbone nodes in the network, and improves the overall performance of the Ad Hoc network by improving the operational capability and information processing capability of the backbone nodes.
Owner:NAT UNIV OF DEFENSE TECH

Vehicle video analysis method and system thereof

The invention provides a vehicle video analysis method and a system thereof. The method comprises the following steps: (1) extraction of a target area: in a V channel of HSV space, carrying out normalization on a ratio graph of a present frame and a background graph and mapping the ratio graph to a 0-255 range, obtaining an average value u and a variance delta of the ratio graph through histogramstatistics and Gaussian fitting, and taking a part except for u+ / - Kdelta in the ratio graph as the target area, wherein, K is a coefficient related to image noise; (2) removal of a shadow: dividing directions of the shadow into four directions; with regards to removal of the shadow at left and right directions, carrying out breaking and segmentation according to width of the shadow and a vehiclebody in a same connected domain, and with regards to removal of the shadow at front and back directions, comparing gradient sum of each row and a gradient row average value of the whole connected domain in a same connected domain and carrying out segmentation. According to the video analysis method, a complete body area can be extracted, obstruction of realizing subsequent video analysis functions of analyzing behaviors of pressing a line, changing a lane, running a red light and the like of a vehicle is eliminated, and misjudgement of the functions is avoided.
Owner:ANHUI CHAOYUAN INFORMATION TECH

Text line extraction method and text line extraction equipment

The invention discloses a text line extraction method and a piece of text line extraction equipment. The text line extraction method of the invention comprises the following steps: extracting connected domains in an input document image; determining the potential link between the connected domains; adjusting a spanning tree constituted by the potential link; and optimizing a text line corresponding to the spanning tree based on the adjusted spanning tree to minimize the total difference between the characters in the text line. Through the text line extraction method and the text line extraction equipment of the invention, a text line in a document image can be extracted accurately and robustly.
Owner:FUJITSU LTD

Ad Hoc network virtual backbone node identification system

The invention relates to an Ad Hoc network virtual backbone node identification system, belongs to the technical field of communication, and solves the problem that an Ad Hoc network backbone node cannot be effectively identified in the prior art. The system comprises a receiving unit, a signal processing unit, a network physical topology inference unit and a backbone node identification unit. A signal in a working frequency band of an Ad Hoc network is received through the receiving unit; the number of nodes, node position information and the size of a node deployment area are obtained through the signal processing unit; the network physical topology inference unit is used for conducting network physical topology inference; and through the backbone node identification unit, a unified connected dominating set is used for identifying virtual backbone nodes according to a network physical topology inference result. The method can realize automatic identification of the virtual backbone nodes in the Ad Hoc network; the obtained result is beneficial to special protection for the backbone nodes; and the operation capability and the information processing capability of the backbone nodesare improved, so that the overall performance of the Ad Hoc network is improved.
Owner:NAT UNIV OF DEFENSE TECH

Gateway node selection method, node and device and medium

The invention discloses a gateway node selection method, a node, a device and a medium. The method comprises: cluster head DS nodes obtaining local area information through neighbor monitoring information and constructing a local area three-hop topology, the DS nodes being DS nodes elected through a cluster head selection algorithm in a self-organizing network, and other nodes being all one-hop neighbors of one or more cluster head nodes; the DS node selecting a gateway CS node for a strict two-hop DS neighbor according to the connection information; selecting CS nodes for strict three-hop DSneighbor nodes, strict two-hop DS neighbors of the nodes refering to DS nodes with the shortest communication distance of two hops away from the nodes, and strict three-hop DS neighbors of the nodes referring to DS nodes with the shortest communication distance of three hops away from the nodes; a DS node and a CS node forming a connected dominating set. According to the invention, the number of redundant gateway nodes can be reduced.
Owner:DATANG MOBILE COMM EQUIP CO LTD

Low-voltage power line carrier communication reliable networking method considering equipment communication performance

The present invention relates to a low-voltage power line carrier communication reliable networking method considering equipment communication performance. The method includes the following specific steps that: (1) a network analysis model is constructed; (2) initialization is performed; (3), weights are assigned to carrier equipment, so that a weighted network can be formed; (4) the minimum connected dominating set of a power line carrier network is solved; and (5) network optimization is performed, and the method terminates. According to the method of the present invention, a bi-directionalcommunication low-voltage power line carrier communication network is modeled as an undirected connected graph; with an inverse proportion relationship between the signal to noise ratios of the equipment and the bit error rates of carrier communication considered, a weighted network reliability analysis model with the signal to noise ratios of the equipment adopted as the weights is established; on the basis of the minimum connected dominating set in the graph theory, a minimum connected dominating set method for solving a maximal weight is adopted; and therefore, the reliable networking of the low-voltage power line carrier network of an electric power information acquisition system can be realized, a communication error rate can be low, and the utilization rate of network resources can be improved.
Owner:ELECTRIC POWER SCI & RES INST OF STATE GRID TIANJIN ELECTRIC POWER CO +2

A Topology Construction Method for Wireless Sensor Networks Based on Mixed Integer Programming

The invention provides a wireless sensing network topological construction method based on mixed integer programming. The wireless sensing network topological construction method comprises the following steps of: 1) firstly, abstractly converting a problem of searching an optimal virtual backbone network of a wireless sensing network in a random network environment into a problem of a minimum connected dominating set of the wireless sensing network; 2) defining a sign stream, and determining an optimizing function using a product of a sign distribution number and node energy consumption as a target, so as to obtain a minimum generation tree for assigning all the other nodes in a current wireless sensing network; 3) constructing an assignment constraint set: ruling that each node has at least one assignment component as a neighbor node; and 4) constructing a generation tree constraint set: defining the generation tree constraint set, so that the connectivity of a final topological structure can be ensured, and constructing the generation tree constraint set by means of meeting all rules of the sign stream. The wireless sensing network topological construction method provided by the invention does not need any random pre-treatment process and has the advantages of relatively small structural scale, relatively small energy consumption and relatively long network service life.
Owner:ZHEJIANG SCI-TECH UNIV

Vehicle video analysis method and system thereof

The invention provides a vehicle video analysis method and a system thereof. The method comprises the following steps: (1) extraction of a target area: in a V channel of HSV space, carrying out normalization on a ratio graph of a present frame and a background graph and mapping the ratio graph to a 0-255 range, obtaining an average value u and a variance delta of the ratio graph through histogramstatistics and Gaussian fitting, and taking a part except for u+ / - Kdelta in the ratio graph as the target area, wherein, K is a coefficient related to image noise; (2) removal of a shadow: dividing directions of the shadow into four directions; with regards to removal of the shadow at left and right directions, carrying out breaking and segmentation according to width of the shadow and a vehiclebody in a same connected domain, and with regards to removal of the shadow at front and back directions, comparing gradient sum of each row and a gradient row average value of the whole connected domain in a same connected domain and carrying out segmentation. According to the video analysis method, a complete body area can be extracted, obstruction of realizing subsequent video analysis functions of analyzing behaviors of pressing a line, changing a lane, running a red light and the like of a vehicle is eliminated, and misjudgement of the functions is avoided.
Owner:ANHUI CHAOYUAN INFORMATION TECH
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