2results about How to "Efficient coding" patented technology

The invention provides a graph data representation method based on multiple virtual nodes and random hash propagation, and relates to the field of graph data representation, and the method comprises the steps: carrying out node importance evaluation and feature similarity clustering on an original graph, and dividing the nodes into a plurality of node clusters; introducing at least one virtual node for each node cluster, constructing a connection relationship between the virtual node and all real nodes in the cluster, and forming a structure enhancement graph; maintaining a sketch vector of which the fixed dimension is K for each real node and each virtual node on the structure enhancement graph; based on a random hash function family, performing multi-round propagation and updating on the sketch vector, and generating node representation fusing node attributes and multi-order structure information; and directly applying the node representation to a graph data processing task. According to the technical scheme, joint modeling of the node attribute information and the multi-order structure information in the complex graph structure is achieved.

The application discloses a point cloud isolated point coding method, a decoding method and a device, and the method comprises the following steps: obtaining an isolated node flag bit and a context set of the isolated node according to to-be-coded point cloud data and an occupation condition of a node of a previous layer; coding the point cloud isolated node flag bit according to the context set of the isolated node flag bit, so as to obtain a binary code stream corresponding to the point cloud isolated node flag bit; coding coordinates of the isolated node according to the point cloud isolated node flag bit; and updating the occupation condition of a node of a next layer corresponding to the isolated node according to the coordinates of the isolated node. The application codes the point cloud isolated node based on the context set, can realize efficient coding of the isolated node flag bit through the context, and does not miss the actual non-empty neighbor node, so that the performance of entropy coding is improved.