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

156 results about "Adjacency relation" patented technology

Adjacency Relation. The set of edges of a loopless graph , being a set of unordered pairs of elements of , constitutes an adjacency relation on . Formally, an adjacency relation is any relation which is irreflexive and symmetric.

Method for segmenting different objects in three-dimensional scene

The invention discloses a method for segmenting different objects in a three-dimensional scene. The method comprises the following steps of: establishing adjacency relations and a spatial searching mechanism of point cloud data to estimate a normal vector and a residual of each point for the outdoor scene three-dimensional point cloud data acquired by laser scanning; determining the point with the minimum residual as a seed point and performing plane clustering by using a plane consistency restrictive condition and a region growing strategy to form the state that the entire plane building is segmented from other objects in the three-dimensional scene; establishing locally connected search for a plane building region for the segmented entire building part, and clustering the points with connectivity in the same plane by using different seed point rules to realize the detailed segmentation of the plane of the building; and constructing distance label-based initial cluster blocks for the other segmented objects and establishing weighting control restriction for cluster merging to realize the optimal segmentation result of trees. Tests on a plurality of data sets show that the method can be used for effectively segmenting the trees and buildings in the three-dimensional scene.
Owner:INST OF AUTOMATION CHINESE ACAD OF SCI +1

Method for multi-dimension segmentation of remote sensing image and representation of segmentation result hierarchical structure

The invention provides a multi-scale image segmentation method for a remote sensing image, in particular for the remote sensing image with high spatial resolution, and constructs a relation among hierarchical structures of the segmentation results of different scales with consistent segmentation boundary. The method comprises the following steps: obtaining an initial segmentation result by a basic image segmentation method, scanning the segmented regions to establish an adjacency relation among segmented blocks, generating an initial bottom small-scale region structure, and subsequently adding features such as gray scale, texture, shape and the like on the basis to merge, adjust, and form a second-layer larger-scale segmented region structure and a third-layer large-scale segmented region structure. The course can be performed by iteration until the required-scale segmentation hierarchy and structure are formed. The generated hierarchical structures of the multi-scale segmentation regions can realize quick switching and access among the segmentation regions of different scales, and the structures are not only suitable for a watershed image segmentation algorithm, but also suitable for other segmentation methods to construct the hierarchical structures of the multi-scale segmented regions.
Owner:REMOTE SENSING APPLIED INST CHINESE ACAD OF SCI

Airborne laser point cloud classification method based on high-order conditional random field

The invention provides an airborne laser point cloud classification method based on a high-order conditional random field. The airborne laser point cloud classification method specifically comprises the following steps: (1) point cloud segmentation based on DBSCAN clustering; (2) point cloud over-segmentation based on the K-means cluster; (3) construction of a point set adjacency relation based onthe Meanshift clustering; and (4) construction of a point cloud classification method of a high-order conditional random field based on the multi-level point set. The method has the advantages that:(1) a multi-layer clustering point set structure construction method is provided, and a connection relation between point sets is constructed by introducing a Meanshift point set cluster constrained by category labels, so that the categories of the point sets can be classified more accurately; (2) a multi-level point set of the non-linear point cloud number can be adaptively constructed, and information such as the structure and the shape of a point cloud target can be more completely represented; and (3) a CRF model is constructed by taking the point set as a first-order item, and higher efficiency and a classification effect are achieved, so that a higher framework is integrated, and a better effect is obtained.
Owner:NANJING FORESTRY UNIV

Method for automatically stitching unmanned aerial vehicle remote sensing images based on flight control information

The invention provides a method for automatically stitching unmanned aerial vehicle remote sensing images based on flight control information, which in particular realizes automatic correction and stitching of the unmanned aerial vehicle remote sensing images according to attitude parameters acquired by a flight control system. The method comprises the following steps of: correcting aircraft yaws of the images and determining adjacency relation of the images according to the attitude parameters acquired by an unmanned aerial vehicle flight control system; extracting characteristic points from the corrected images, matching the characteristic points with those of adjacent images and extracting identical points; calculating a range of the output images according to an image calculating model, comparing the range with the range determined by the attitude parameters, and if the difference is within a tolerance range, considering that the number and the quality of the identical points between the adjacent images meet the stitching requirement and the images are connected; sequentially calculating connection relation among all images and solving the maximum connection component among the images; and determining a transformation parameter by performing model calculation according to the connection component and outputting a stitched image of a research region.
Owner:REMOTE SENSING APPLIED INST CHINESE ACAD OF SCI

Multi-rate opportunistic routing method for wireless mesh network

The invention provides a multi-rate wireless mesh network routing method for opportunistic forwarding based on characteristics of radio broadcasting, which comprises the following steps: after a node transmits data, a plurality of nodes are selected as forwarding nodes; in the early stage of network setup, the nodes acquire a direct link delivery fraction via probe packets and set up an adjacency relation; an adjacency matrix of the total network is set up by using link status packets to switch link information; a node forwarding probability analysis system model is used to deduce a measurement (integrated transmission number) applicable to the presence of arbitrary paths, and a forwarding node selection strategy and a forwarding strategy are established on the basis of the integrated transmission number; the optimal path algorithm is used to select a major path, the nodes closer to the destination node than the source node can be selected into a forwarding list, and the forwarding nodes can be confined to the vicinity of the major path according to a certain screening rule; the forwarding node closest to the destination node is set to have the highest forwarding priority, and the forwarding priority is lowered with the increase of the distance from the destination node; and the destination node transmits an end-to-end response to the source node based on a certain rule to inform the source node of the number of the received packets, and the source node performs adaptive regulation on the transmission rate according to the data.
Owner:BEIJING UNIV OF POSTS & TELECOMM

Method and device for fake-license-plate analysis

The invention provides a method for fake-license-plate analysis. The method comprises the steps that (1) information of all shooting checkpoints and information of the shooting time of license plates, to be analyzed, in a monitoring system are obtained; (2) the checkpoints are sequenced according to the sequence of the shooting time of the license plates; (3) whether information of a checkpoint adjacent to any checkpoint of the sequenced checkpoints is consistent with prestored checkpoint communicating information or not is judged, if yes, the license plates are real, and if not, the step (4) is executed, wherein the checkpoint communicating information is used for recording adjacency relation of the checkpoints; (4) all reachable paths from any inconsistent checkpoint to a checkpoint adjacent to the inconsistent checkpoint are determined according to the prestored checkpoint communicating information, whether a path meeting the requirement that the number of the checkpoints on the path is smaller than or equal to a preset value N exists in the reachable paths or not is judged, if yes, the license plates are real, and if not, fake license plates exist in the license plates. The method for fake-license-plate analysis overcomes the defect caused by fake-license-plate analysis through time track collisions.
Owner:ZHEJIANG UNIVIEW TECH CO LTD

Fast generation method for wireless cell coverage distribution

ActiveCN101541013AIgnoring factors that cover less influentialEfficiently obtainedNetwork planningLongitudeAdjacency relation
The invention belongs to a fast generation method for wireless cell coverage distribution in the field of mobile communication. The method is realized through the following steps: collecting effective base-station information; collecting target-boundary information; analyzing and filtering the collected information so as to determine effective base stations and wireless cells; estimating the regional coverage of each wireless cell, finishing and outputting the estimated regional coverage of each wireless cell in a coordinate mode; calculating the coverage adjacency relation between each wireless cell and the surrounding wireless cells thereof according to the estimated regional coverage of each wireless cell, and generating an adjacency matrix of base-station adjacency relation; adopting smoothing algorithm to accurately calculate the coverage boundaries of the wireless cells; and generating a wireless-cell closed coverage boundary with continuous coordinate points taking latitude and longitude as a unit. The method is simple to realize, can fast and effectively generate multilevel actual coverage-distribution fitting graphs of wireless cells, base stations, base-station controllers and mobile switches, and can be widely applied to GIS application analysis, mobile network optimization and other fields.
Owner:CHINA MOBILE COMM CORP TIANJIN

Rural resident point information extraction method based on high-resolution remote-sensing image

The invention discloses a rural resident point information extraction method based on a high-resolution remote-sensing image. The rural resident point information extraction method comprises the following steps: firstly, carrying out Canny edge detection on the high-resolution remote-sensing image, and obtaining a vector edge line through chain code tracking; then, carrying out Douglas-Peucker abbreviation on a vector edge to extract straight-line segments, and rejecting shorter straight-line segments and keeping longer straight-line segments according to length constraints; secondly, according to adjacency relation between the straight-line segments and included angle constraints, extracting straight angle points, calculating the density characteristics of the straight angle points within a certain space region range, and generating a straight angle point density characteristic image, wherein the characteristic image and the input high-resolution remote-sensing image have same spatial range and spatial resolution; and finally, carrying out binarization processing on the density characteristic image by utilizing Otsu, extracting rural resident point vector pattern spots through connected component analysis so as to extract rural resident point information. Precision and effects are improved, and robustness and universality are better.
Owner:SHANDONG LINYI TOBACCO

Trust management system based trusted reconstructing method of IP routing protocol

InactiveCN101888328AFusion of trust valueData switching networksPacket lossNetwork topology
The invention discloses a trust management system based trusted reconstructing method of an Open Shortest Path First (OSPF) routing protocol, which comprises the following steps of: (1) before each router is added into a network, registering to the trust management system, and sending corresponding trust certificates to the routers by the trust management system, the trust certificates including comprehensive trust values of the routers and each being calculated according to safe parameters and configuration parameters of the routers and all the subjective trust value of the neighbor router to the routers by the trust management system; (2) transferring the trust certificates among the routers through hello information, wherein an adjacency relation is not established for the router without the trust certificate, all the routers in the network are ensured to have own trust certificates; (3) each router calculating the subjective trust value of the neighbor router based on network real time parameters including link flow, packet loss probability, retardation, transmission rate of the packet and reliability of the packet, during an interactive work with the neighbor router, calculating a total trust value of the neighbor router by using the comprehensive trust value and the subjective trust value of the neighbor router, and modifying a metric field of a link-state announcement Router_LSA packet as the total trust value and synchronizing a link-state data base;(4) modifying a Dijkstra algorithm, using a reciprocal of the total trust value between the routers as the parameter for the arithmetic computation, selecting the router with higher trust value to generate a shortest path tree, and forming a trust routing list; (5) periodically reporting the subjective trust value of the neighbor routers to the trust management system by each router, simultaneously obtaining the parameter required for computing the subjective trust value, updating the trust certificate of each router at fixed time, and eliminating the router with the overdue trust certificate out of the network to maintain the topological structure of the whole network.
Owner:BEIJING UNIV OF POSTS & TELECOMM

Particle spring structure based universal garment three-dimensional model simulation method and system

The invention discloses a particle spring structure based universal garment three-dimensional model simulation method. The method comprises: obtaining information of a top point and a triangular surface of a garment model, constructing an adjacency relation, and establishing a particle spring structure model of a garment; and based on a numerical solving algorithm, obtaining a motion track of a mass point at t moment by iterative operation. The invention furthermore discloses a particle spring structure based universal garment three-dimensional model simulation system. According to the simulation method and system, a spring model is simplified into a structure spring and a bending spring, so that while a simulation result is not influenced, the calculation amount is reduced and the simulation efficiency is improved; a particle motion prediction mechanism is introduced, so that the reliability and error correction capability of simulation are improved, and the simulation result better conforms to physical properties of garment cloth; and particle velocity data do not need to be calculated and only the position of the top point on the triangular surface needs to be calculated, so that the simulation speed is increased.
Owner:BEIJING INSTITUTE OF CLOTHING TECHNOLOGY

Malicious software feature fusion analytical method and system based on shared behavior segments

The invention discloses a malicious software feature fusion analytical method and a system based on shared behavior segments. The method includes deploying, collecting and analyzing nodes of malicious software, and constructing a distributed hash table (DHT) module; collecting samples of the malicious software and segmented into segment sets, and calculating local statistical properties; sharing to the DHT, gathering global features of the behavior segments, and returning to source nodes; the source nodes calculating candidate neighbor node sets and performing similar calculation of behavior characteristics through remote nodes of the candidate neighbor node sets to construct an adjacency relation diagram of the behavior characteristics; and generating an aggregation three for aggregation based on the adjacency relation diagram of the behavior characteristics, and outputting root behavior characteristics. The system comprises a plurality of nodes, each node comprises a characteristic segmenting module, the DHT module, a behavior segment synergy sharing module, a neighbor behavior characteristic discovering module and a behavior characteristic gradual aggregation module. The method and the system have the advantages of being high in analytical accuracy and performances and good in expandability.
Owner:NAT UNIV OF DEFENSE TECH

Automatic topology realisation method based on topological bucket algorithm

The invention discloses an automatic topology realisation method based on topological bucket algorithm, belongs to the field of computer network management, and is particularly suitable for network topology management of an Ethernet exchanger. The invention solves the technical problem of quick formation of wide area automatic topology. The invention comprises the steps of optionally selecting a network apparatus in a topological seed bucket as a seed net element, sending a message for inquiring apparatus adjacency relation to the seed net element, obtaining the apparatus adjacency relation, adding the inquired adjacent apparatus in a temporary topological queue, orderly constructing net elements and apparatus icons on a topological plane, and establishing a topological relation; comparing the apparatuses in the temporary topological queue with the apparatuses in the topological bucket and the topological seed bucket, then orderly taking out the adjacent apparatuses as seed net elements from the to-be-topological queue, continuously searching and circulating, and accomplishing topology until the temporary topological queue, the to-be-topological queue and the topological seed bucket are blank. The technical proposal of the invention has the advantages of high efficiency, high flexibility and high accuracy, and the topology is relatively intuitive.
Owner:东土科技(宜昌)有限公司

Power grid subarea division method based on dynamic electricity prices

The invention discloses a power grid subarea division method based on dynamic electricity prices. The method comprises the steps of: obtaining load data of certain time dimensions; calculating a power transmission and distribution factor matrix; using an optical trend model with the target of the lowest power purchase cost of a power grid company to calculate a marginal price of each node in a power grid in each time intervals; setting an expected subarea number, and carrying out initialization to ensure each subarea to be empty; improving a K-means clustering algorithm, and considering adjacency relations of nodes in the subarea division process; utilizing the improved K-means clustering algorithm to carrying out subarea division on the power grid based on the dynamic marginal price of each node; carrying out deviation analysis on a subarea division result, if the largest relative deviation is smaller than a set limit value, indicating that the subarea division is completed, and otherwise, changing the subarea number and carrying out subarea division again; and obtaining the nodes and the regional electricity price of each subarea. The subarea division obtained by the method ensures that nodes in the area are mutually connected and the electricity price loss of the nodes is in an allowable range, so that a market participant can conveniently carry out settling.
Owner:NORTHWEST BRANCH OF STATE GRID POWER GRID CO +1

Method for identifying monocular visual spaces in terrestrial gravitational field environments

The invention discloses a method for identifying monocular visual spaces in terrestrial gravitational field environments. The method is characterized by comprising steps of firstly, dividing ultra-pixels of images on the basis of CIELAB color space values L, a and b of pixels and coordinate values x and y of the pixels to generate ultra-pixel images; secondly, reducing dimensions of the divided and formed ultra-pixel images by a general clustering algorithm on the basis of vector distances from color characteristics to feature characteristics of the ultra-pixels and adjacency relations, and generating large image blocks; thirdly, respectively multiplying pixels of the obtained large image blocks by fuzzy distribution density functions of gravitational fields and solving expected values of the large image blocks so as to initially classify the sky, the ground and vertical objects; fourthly, extracting classified images of the sky, the ground and the vertical objects by the aid of single-layer wavelet sampling and characteristics of the Manhattan direction; fifthly, generating spatial depth perception images on the basis of wavelet imaging models and ground linear perspective information. The fuzzy distribution density functions of the gravitational fields represent the sky, the ground and the vertical objects. The method has the advantages of simplicity, feasibility, high resolution and wide application range.
Owner:NANJING YUANJUE INFORMATION & TECH CO NANJING

Section layering method based on STL model

The invention provides a section layering method based on an STL model and solves the problem of slow layering speed in the prior art. The method comprises the steps of: determining a layering number of sections; determining the layer number where each triangular face is located of the STL model; establishing a grouping matrix aiming at each layer of sections and generating an active triangular face table, wherein the grouping matrix comprises a triangular face set having a section direction which is intersected with the plane of the sections, and index numbers of all triangular faces in the grouping matrix are stored in the active triangular face table; determining an adjacency relation of respective triangular faces in each layer based on the active triangular face table, after intersecting each layer of sections, generating a profile ring corresponding to each layer of sections by combining with the adjacency relation to obtain a whole section profile. By establishing the grouping matrix in a layering manner, and establishing the active triangular face table of the grouping matrix, based on the adjacency relation, a topological relation is established in a smaller triangular face range, position judging times and calculated amount are reduced and the layering efficiency is effectively improved.
Owner:QINGDAO UNIQUE PRODS DEV
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