156 results about "Adjacency relation" patented technology

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.

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.

The invention provides a method for planning a path in an urban road traffic network. The method comprises the steps of dividing a region to be searched, which is determined according to a start point and a final point, into multiple sub regions according to a given road network density; then mapping the multiple sub regions into one-dimensional discrete points, and forming a Voronoi graph based on the discrete points; determining an adjacency relation between every two of all the sub regions according to the Voronoi graph, and judging the connectivity between every two adjacent sub regions; constructing a new road network according to a set of the selected adjacent sub regions which are communicated, and searching an optimal path between the start point and the final point in the new constructed road network. According to the method, the construction time of a road network topological structure is shortened; furthermore, the search range of the path is narrowed, the search time is shortened and the search efficiency is improved.

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.

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.

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.

The invention discloses an image sequence category labeling method based on a mixed graph model. The method comprises a step of performing superpixel segmentation of an image sequence and characteristic description of superpixels; a step of performing nearest neighbor matching of inter-frame superpixels of a two-continuous-frame image; a step of using the mixed graph model to carry out global optimization modeling of the image sequence category labeling based on the spatial domain adjacency relation among superpixels of a single frame image and the time domain matching relation among superpiexels of a multi-frame image; and a step of using a linear method to solve a global optimization problem to obtain category labels of superpixles of a continuous multi-frame image. Compared with previous graph models, the mixed graph model created by the invention can describe the first-order and symmetric relation among superpixels in a single frame image and also the high-order and non-symmetric relation among superpixels in a two-continuous-frame image; the linear method is used for solution; and a category label which is better in consistency of time domain and higher in accuracy is effectively provided for each superpixel of an image sequence.

The invention provides a multi-scale image segmentation method for a remote sensing image with boundary maintenance characteristics. The method comprises the following steps of: filtering the image by using an orthogonal filter bank and then solving a preprocessing method for a local energy diagram of the image; accurately positioning and detecting a ground feature boundary; performing watershed segmentation on the preprocessed image to obtain an initial segmentation result; vectoring the initial segmentation result to generate a segmentation vector diagram layer so as to express each segmentation region by using a polygonal vector and establish adjacency relation between vector polygons; constructing a diagram for a polygonal vector diagram layer; combining the segmentation regions by combining threshold control based on a minimal spanning tree algorithm of the diagram; and iteratively performing the diagram combination process until the required scale segmentation hierarchy and structure are formed.

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.

The present invention discloses method of creating complete spherical panorama based on six drum shaped image frames. The method includes the following steps: the first establishing of three-dimensional spherical space model; taking six drum shaped image frames in specific requirement; the subsequent determining of image frame adjacency relations and optimal point pair set between adjacent image frames; establishing and solving the optimizing equations based on the optimal point pair set; and finally creating the panorama. The present invention can solves the problem of automatically splicing drum shaped image frames and the problem of incomplete top and bottom information to create complete spherical panorama fast.

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.

The invention provides a method and device for collecting topological information in an SDN network. The method and device are applied to first exchange equipment in the SDN network. The first exchange equipment and second exchange equipment are adjacent, and the first exchange equipment is connected with a second interface of the second exchange equipment through a first interface. The method comprises the steps that a second equipment identification and a second interface IP address of the second exchange equipment are acquired; first adjacency information is generated according to the second equipment identification and the second interface IP address, and the adjacency information is sent to a controller, wherein the adjacency information carries the first adjacency information, so that when the first adjacency information and the second adjacency information sent by the second exchange equipment are matched, the controller generates the adjacency relation between the first exchange equipment and the second exchange equipment. According to the method and device, the three layers of topological information of the SDN network can be directly connected.

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.

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.

The application discloses a network topology discovery method and device. The method comprises the following steps: acquiring at least two network protocol data existing in a network and capable of reflecting adjacency relation between adjacent network equipment, wherein at least two protocol data comprises link state database; performing network topology discovery according to at least two protocol data so as to acquire the network topology of the network. By using the method and device disclosed by the application, the network topology discovery can be performed, and the precision ratio of the network topology is improved.

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.

The invention discloses a system and a method for abnormal network positioning of an autonomous system. The system comprises an analysis unit and a routing information collecting probe, wherein the analysis unit is used for constructing a topology according to collected OSPF LSA, finding the change of the topology according to an OSPF Update message which is received by the routing information collecting probe and causes the topology to change after the construction of the topology and then positioning the abnormal network combining with an OSPE protocol; the routing information collecting probe is used for communicating with the network through a tunnel by an OSPF area which is physically disposed to the autonomous system, establishing an adjacency relation with a router operating the OSPE protocol in each OSPE area, passively collecting flooding LSA message in the OSPE area in real time and sending the collected LSA message to the analysis unit. The invention utilizes the OSPE LSA to position abnormal network in the autonomous system and finds the change of the network topology so as to assist the positioning of abnormal network.

The invention discloses a method for matching envelope images. The method comprises the following steps of: respectively representing two envelope images to be matched by using graphs so that the calculation of the degree of similarity between the images is changed into graph matching, and calculating a distance between two graphs by using a bipartite graph matching algorithm based on the minimum weight value. The method comprises the specific steps of segmenting the envelop images, and constructing the graphical representation of the images based on a segmentation result, wherein each vertex of the graph represents an area in the envelope image, and each edge of the graph is used for representing an adjacency relation between two areas. Because the graphical representation of a plurality of images which correspond to the same envelope can be different under the influence of factors such as noise in the acquisition process of the images, a non-accurate graph matching algorithm is adopted in the method. Lots of experimental results show that: the method has relatively higher robustness in illumination, inclining, rotation and the like; and letter information query based on the envelope images can be efficiently realized.

The invention relates to a space target index constructing method, a space target collision pre-warning method, a space target region query region and a space target nearest neighbor query method, belonging to the technical field of space target data processing. The method comprises the following steps: performing spherical equal longitude and latitude mesh generation on the outer space of the Earth and numbering each space mesh, and numbering each space mesh; establishing a corresponding target list for each space mesh for storing a space target passing through the space mesh; and counting numbers of all space meshes where the space target passes through and recording the space target falling into the space meshes in the target list corresponding to each space mesh to establish a space-time index of the space target. According to the method, the spherical equal longitude and latitude meshes for construction are adopted, the structure is simple and the adjacency relation is clear, and the stable indexing of a high-speed moving target is realized, so that a foundation is laid for queries of the space target.

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.

The invention discloses a digital accurate dental restoration manufacturing method. The method includes: at a clinical end, adopting easy-to-grind materials such as high-strength wax, a resin-based ceramic composite material and resin in appropriate strength, color, toughness and hardness to quickly make a crown; taking the own gum of each patient as a dental articulator and taking the crown clinically and digitally manufactured by fine adjustment through clinical communication and examination of doctors and patients to establish correct restoration geometric shape, color, marginal adaption, adjacency relation, occluding relation, morphology required by early-stage healing of the gum, so that temporary restoration effects including protection, maintaining and stabilizing are achieved; at adoctor end, performing secondary accurate scanning on the crown with well adjusted morphology, occlusion and adjacency relation, fusing secondary scanning data and digital wax pattern data designed before to obtain accurate dental restoration digital design, and accurately duplicating a bionic zirconium oxide false tooth, so that zero-grind-adjustment accurate restoration is realized at the doctor end.

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.

The invention relates to a new Chinese word recognition method based on a graph structure. The method comprises the steps that (1) a document set is abstracted into a weighted digraph according to the adjacency relation between words; (2) all points of the weighted digraph are traversed, and an alternative new word of each point is selected based on the concurrence rate; (3) the alternative new words are subjected to path expansion, maximum-weight paths are found, the concurrence rate of the maximum-weight paths is always larger than a threshold, and then complete alternative new words are obtained; (4) the complete alternative new words are filtered according to information entropy, and a final alternative new word set is obtained. The method that the document set is abstracted into the graph structure for new word discovery and recognition is put forward for the first time, new word discovery is converted into maximum-weight path discovery in the weighted digraph, the characteristics of the digraph are well utilized, and the new word discovery and recognition method is low in time complexity and high in recall rate and accuracy rate.

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.

The invention relates to a method capable of preventing accident touch on a touch control panel. In order to prevent a palm from accidentally touching the touch control panel, a plurality of areas of the touch control panel is scanned one by one so as to detect a plurality of touched areas among the plurality of areas; and the adjacency relation of the plurality of touched areas is detected so as to determine a plurality of blocks. If the plurality of blocks comprises a large-sized block, the large-sized block is excluded, and a current coordinate is generated according to a small-sized block which is possible to be touched by a finger or a touch control pen.

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.

The present invention provides maintenance control plane accessibility information method in automatic exchange optical network. It contains in current structure basic, increasing one control plane accessibility information data base and one adjacency relation detect subfunction module to each node route control module; using adjacency relation detect subfunction module real time detecting local node and adjacent nodes adjacency relation variation; and in detecting variation generation, updating adjacency relation list in local adjacency relational data base, diffusing transmitting changed Adjacency node listing, realizing all control node Adjacency relational data base updating; synchronizing Adjacency relational data base and recalculating accessibility relation between node according to updated Adjacency relational data base, using calculative result as route querying constraint condition. The present invention can avoid route miscount duo to control node or control channel gone wrong, raising connection establishment success ratio and shortening connection establishment time.

In packet transfer network based on T-MPLS technique, the disclosed method can implement link track for tracking user's traffic flow. The method includes following steps: (1) after receiving configuration command of starting up link track (LT) down sent from network management, the starting point maintenance entity point (MEP) initiates LT request; destination address is a MEP address pointed by network management; (2) nodes requested by LT return LT responses back to starting point MEP; (3) based on LT responses, the starting point MEP reports link information to network management. The method reflects actual connected state of traffic in current T-MPLS network and adjacency relation between nodes effectively. The invention can determine whether prospective traffic flow is matched to actual traffic flow so that network manager can carry out fault analysis and fault location better.

The invention discloses an automatic generation method of a stratum boundary map layer. The method comprises the following steps of (1) based on deposition, a volcanic stratum boundary map layer and a metamorphic stratum unit map layer, searching all the adjacent stratums in the map layers and constructing a stratum adjacency relation map; (2) based on the stratum adjacency relation map, extracting a common boundary of the adjacent stratums and generating a stratum boundary; (3) based on a faultage map layer, identifying a faultage contact relation; (4) based on a occurrence map layer, identifying a basic contact relation and completing automatic generation of the stratum boundary map layer. Compared to a manually-made method, by using the method in the invention, the generated stratum boundary map layer is high-efficient and fast; through reducing a manual participation degree, introducing of a manual error is avoided as far as possible; and a need of geologic map space database stratum boundary map layer making is satisfied.

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.