58 results about "Graph Edge" patented technology

Provided is a process including: obtaining a first graph comprising nodes and edges, each of the first-graph edges linking two of the first-graph nodes and denoting semantic similarity of unstructured text in documents corresponding to the two linked first-graph nodes; for each of the first-graph nodes, selecting nodes for a second graph from attributes of the unstructured text documents to which the first-graph node corresponds, wherein the attributes are entities mentioned in the unstructured text documents, and wherein each of the second-graph nodes corresponds to a respective selected attribute; and for each pair of the second-graph nodes, determining a respective edge weight indicating similarity between a first entity corresponding to a first node of the respective pair and a second entity corresponding to a second node of the respective pair.

The invention discloses a method for eliminating a colorful edge of a display graph and a display device. The method for eliminating the colorful edge of the display graph comprises the steps of obtaining multiple edge pixels corresponding to a display graph edge in a display screen, respectively obtaining first pixels and second pixels which are in the same line with the edge pixels and are adjacent and third pixels and fourth pixels which are in the same column and are adjacent, adopting the edge pixels corresponding to the first pixels, the second pixels, the third pixels and the fourth pixels to perform compensation algorithm processing so as to obtain gray-scale values after the edge pixels are processed, adjusting the gray-scale values of the multiple edge pixels to be corresponding processed gray-scale values. By the adoption of the technical scheme, the advantage of eliminating the colorful edge of the display graph in the display screen is achieved.

A method and system are provided. The method includes storing, in a memory, temporal data for a temporal graph. The memory includes a temporal graph storage structure having a set of buckets. The temporal data stored in the buckets includes respective data segments implemented using graph edges. Each of the graph edges has a start time and an end time associated therewith. The method further includes the methods, performed by a processor, of: forming an index that categorizes the graph edges based on the end times of the graph edges; positioning the graph edges within respective ones of the buckets for storage using the index such that the graph edges are positioned in the respective ones of the buckets in a chronological order that is based on the end times; and accessing the temporal graph storage structure using the index responsive to a temporal graph query.

The invention relates to systems and methods for navigating, outputting and displaying non-linearly connected groups of transmedia content. Specifically, the invention involves retrieving, from a database, an ordered group of transmedia content data objects comprising a plurality of transmedia content data objects and linking data, whereby each element of the linking data defines a directional link from one of the transmedia content data objects to another of the transmedia content data objects; generating a two-dimensional graph structure representing the ordered group of transmedia content data objects whereby each graph node corresponds to a transmedia content data object and each graph edge corresponds to an element of the linking data; and outputting the graph structure on a display screen.

A graph database is described. The graph database includes one or more symbolic data stores and one or more key-value data stores. Each symbolic data store is configured to symbolically store sets of multiple hyper-graph nodes. Each key-value data store is configured to store attribute information for hyper-graph nodes and hyper-graph edges.

The invention belongs to the technical field of knowledge graph application, and particularly provides a network fraud identification method and system based on a knowledge graph, and the method comprises the steps: constructing a mode layer of a network fraud knowledge graph from top to bottom; loading data to the data layer of the network fraud knowledge graph; based on the constructed network fraud knowledge graph, fusing a third-party knowledge base in a data layer, and expanding the data volume of the data layer of the network fraud knowledge graph; discretizing and normalizing attribute frequency values of key behavior relationships in the network fraud knowledge graph, and converting the attribute frequency values into weight values of graph edges; and based on a network fraud case graph, by utilizing a spark graphics graph and an LPA algorithm, identifying a criminal gang, and then by utilizing a PageRank algorithm, identifying core members in the gang. The network fraud case and the criminal gang can be effectively organized through entities, relationships and attributes by using the strong relevance of the knowledge graph. The case detection efficiency is improved, and the occurrence rate of network fraud cases is reduced.

The invention provides an image stitching processing method, a device, and an electronic system. The method comprises the steps of obtaining a first overlapping image and a second overlapping image corresponding to overlapping areas of a first image and a second image to be stitched respectively; determining a fusion energy diagram corresponding to the first overlapping image and the second overlapping image; determining a minimum energy path corresponding to the first graph edge to the second graph edge of the fused energy graph; determining a first mask corresponding to the first overlapping image and a second mask corresponding to the second overlapping image based on the minimum energy path; and stitching the first image and the second image based on the first mask and the second mask. According to the invention, the area through which the abutted seam passes is optimized to a certain extent, and the image splicing effect is improved.

A graph display system that represents graph nodes as grid cells in a two-dimensional grid. Graph edges are represented by placing the edge's nodes in adjacent grid cells, thus eliminating the entanglement of edges that are typically drawn as lines between scattered nodes. Relatedness of two nodes sharing an edge is indicated by the edge's weight. The display system prioritizes placement of higher weight edges such that more related information is grouped together in nearby grid cells. Any graph with n nodes and e edges can be displayed and browsed.

The invention discloses a distributed graph calculation method, a terminal, a distributed graph calculation system and a storage medium. The embodiment of the invention is based on graph data preprocessing, a graph division algorithm and an incremental graph edge sorting algorithm. According to the method, the original graph data is converted into the computer readable intermediate graph data, sothat subsequent graph division can be performed quickly, high-quality graph division is provided, the communication overhead of the generated high-quality partition is greatly reduced, and the calculation and analysis speed of the distributed graph is increased.

The invention discloses a room segmentation method based on internal circles and an adjacency graph, and the method comprises the steps: carrying out distance transformation on a two-dimensional occupancy probability grid map obtained through laser scanning, and calculating the distance value of a nearest occupancy point of each pixel; filling a free space with internal circles, and constructing internal circle approximation of the indoor free space; constructing an indoor topology network based on the adjacency relation of the internal circles, and constructing the incidence relation between the internal circles by a weighted undirected adjacency graph; adding and deleting undirected graph edges based on rules, and achieving connected sub-graph segmentation of the graph; and combining the internal circle connected sub-graphs to obtain different adjacent circle clusters, endowing the adjacent circle clusters with different room semantic information, and finally realizing semantic segmentation of an indoor free space (namely, a room). The method can be applied to room segmentation and task planning of the indoor space in the laser scanning process of a mobile robot.

The invention discloses a banknote denomination identification method and device. The banknote denomination identification method mainly comprises a training part and an identification part. The training part is characterized in that feature extraction can be carried out automatically after enough samples are collected, human intervention is not needed, and the recognition efficiency is greatly improved. The identification part is characterized by comprising the following steps: acquiring graph edge information; finding graph coordinates through edge information fitting, and performing plane transformation according to the coordinate information to obtain transformed graph coordinates; obtaining and calculating one-dimensional feature information of the image according to a preset method;and matching with one-dimensional feature information of a standard image, and judging whether the matching feature is abnormal or not. According to the invention, the feature two-dimensional featuresare converted into a plurality of one-dimensional features, the denomination one-dimensional features are calculated, and the calculated one-dimensional features are matched with the standard denomination one-dimensional features. The invention does not depend on the image type, is not affected by the CIS type and the difference between the new bank note and the old bank note, and has high adaptability to old bank notes, residual bank notes and stained bank notes.

The invention provides a two-dimensional Euler diagram generation method and device for a one-stroke game, and the method comprises the steps: generating points meeting all parameter values accordingto all input parameter values of a two-dimensional Euler diagram; carrying out random distribution on each point to generate an initial two-dimensional Euler diagram edge set; obtaining the degree ofeach point, and adding a new edge to the edge set which does not meet the degree of the one-stroke game point; modifying a connection graph in the edge set after the new edge is added, and determininga modified two-dimensional Euler diagram; symmetrically overturning the modified two-dimensional Euler diagram to obtain a final two-dimensional Euler diagram; and generating a stroke sequence on thefinal two-dimensional Euler diagram by using a Flory algorithm. Through parameter input of the two-dimensional Euler diagram, generation of two-dimensional coordinates of all points and generation ofan edge set meeting the degree limitation of the two-dimensional Euler diagram points, the final two-dimensional Euler diagram is obtained, the attractiveness is improved, public aesthetic appreciation is met, and users can accept the two-dimensional Euler diagram more easily; meanwhile, the content generation efficiency of one-stroke games is improved, and the yield is increased.

The invention discloses an OPC method for a specific graph side wave effect, which comprises the following steps of S1, setting an exposure threshold of an OPC model, inputting a target graph, simulating light intensity distribution of the exposed target graph by utilizing the OPC model, selecting a rectangular graph of which the light intensity meets a set light intensity condition as a selected graph, and outputting the selected graph, S2, taking the two long edges of which the distance between the two long edges in the selected graph meets a set distance condition as graph edges, S3, taking the graph edge as a target graph edge, generating a scattering strip in the selected graph, and enabling the scattering strip to be parallel to the graph edge, and S4, with the target graph as a target and the scattering strips as auxiliary graphs, conducting model-based OPC correction to obtain a final OPC graph. The invention further discloses an OPC processing method for the through hole layer. The light intensity distribution is changed by adding the auxiliary patterns (scattering strips), so that the final exposure result can reach the target size, and the generation of extra exposure patterns can be avoided.

The invention relates to an image data processing method, a pixel image obtained by the image data processing method and an application system. According to the method, graph pixels are decomposed into five basic elements, namely black points, white points, geometric points, semi-angular points and full-angular points, and then data processing and generation are carried out. The method comprises the following steps: 1, classifying graphs; 2, carrying out proper region division on the graphs; 3, respectively processing and calculating the size and the pixel density of graph zone bit to form zone bit pixel sorting and data logic relationship processing; 4, performing comprehensive calculation to obtain a basic pixel graph and a pixel application data value; 5, processing external data by using the basic pixel elements for editing, importing each area bit graph, and combining and encrypting to form a main storage area; and meanwhile, color, sound or 3D graphic processing is added according to design requirements. 6, scanning and analyzing rows and columns after the main storage area is filled, and completing automatic positioning and error correction; 7, forming a graph edge boundarythrough operation to distinguish a main storage identification area; 8, clearing pixel error codes and internal and external messy codes of the graph; and 9, outputting a complete pixel graph.

Infrastructure attacks based on graph edge context are identified by receiving an execution graph constructed by a central service based on behaviors monitored by a plurality of agents deployed on respective systems including a first system. The execution graph comprises a plurality of execution trails. One or more tags are applied to each edge of an execution trail of the execution graph based on at least one of temporal context or spatial context associated with the edge. One or more behaviors associated with the edge of the execution trail happen across an enterprise infrastructure involving the first system. The execution trail enriched with the one or more tags is analyzed. An action that is performed to mitigate security risks in the execution graph is determined based on the analysis.

The invention discloses a method and a device for realizing handwritten numeral recognition based on graph edge detection, and mainly solves the problems that more numeral samples are required, a deeplearning model is complex and the accuracy is difficult to guarantee in the existing deep learning OCR handwritten numeral recognition technology in the prior art. The method comprises the followingsteps of: preprocessing a hand drawing to obtain a binary image; then extracting a contour line of a single number in the binary image; calculating an outer frame of a single number and then carryingout ascending sort on the outer frame; and finally, identifying the numbers in the outer frame, and connecting the single numbers to form an integral number. Through the scheme, the purposes of simplemodel and high recognition accuracy are achieved, and the method has very high practical value and promotional value.