61 results about "Tree code" patented technology

An apparatus and method for image data compression performs a modified zero-tree coding on a range of image bit plane values from the largest to a defined smaller value, and a vector quantizer codes the remaining values and lossless coding is performed on the results of the two coding steps. The defined smaller value can be adjusted iteratively to meet a preselected compressed image size criterion or to meet a predefined level of image quality, as determined by any suitable metric. If the image to be compressed is in RGB color space, the apparatus converts the RGB image to a less redundant color space before commencing further processing.

The invention provides a method for parallel space query based on grid division and a system of the same. The method comprises the steps that the grid division and numbering are carried out to query space objects and a space scope in which a target space object set is located according to a quad tree; a space fragmented index is constructed for each space object; and according to the number of a minimum grid in the space fragmented index, a target space object which has an intersection relation with the minimum grid corresponding to the query space object is acquired from the target space object set. According to the invention, the quad tree is used for the space grid division and the grid numbering, so that each space object is contained in a corresponding quad tree grid, and thus a boundary object processing problem is eliminated; and meanwhile, according to a space topological relation hidden in a quad tree code, the space objects which obviously cannot satisfy query conditions can be filtered out, so that the candidate target space objects can be pre-filtered, task candidate sets can be reduced, and parallel query efficiency can be increased once again.

An apparatus for and a method of coding the bit-planes of an array of numbers. The values in the array of numbers are converted to binary. The binary values are truncated to a predetermined level of accuracy. The number of bit-planes is determined based on the largest absolute value. A tree structured description of the array is generated based on a modified quad-tree coding technique. An SNR (signal to noise ratio) scalable encoding of the significance information for each bit-plane is generated by describing new branches and leaves of the tree corresponding to each bit-plane in a bottom-up-depth-first manner. An encoding of refinement information for each bit-plane is generated. A SNR scalable description of the array is generated by concatenating the encoding of the significance information and the refinement information generated for each bit-plane.

The invention discloses a universal tree structure storage analysis method, relates to the field of computer application and solves the technical problems of huge calculated amount, complex storage code, complex logic, non-visual data tree structure and the like in the prior art since a recursion way is adopted to analyze tree structure data. The method mainly comprises the following steps that: through a temporary variable, circularly traversing a data list generated by hierarchy associated data; reading the root data of the data list; utilizing tree node characteristics in the data list to combine with a temporary data set to construct a threshold value condition; setting a tree code for the tree node which conforms to the threshold value condition in a progressive increase way in sequence; storing the tree code corresponding to the current tree node in the data list into the temporary data set; after circulation ends, obtaining an integral tree temporary data set relative to the data list; and searching the temporary data set by corresponding to the root data to obtain the root tree node and all subtree nodes of the tree structure. The method has the characteristics of being simple, easy in use and high in maintainability and maneuverability.

The present principles generally relate to encoding and decoding of a point cloud representing the geometry of a point cloud representing a 3D object. According to the invention, prediction is used in the encoding process of the splitting information of the local octree-based structure and / or in the 10 encoding process of the occupancy information of the leaf cubes of the local octree-based structure. A predictor of the local octree-based structure is used for determining the context of the context-dependent entropy encoding in order to reduce the number of bits needed for the octree encoding.

The invention relates to an embedded zero-tree coding mode and its circuit structure. It divides the embedded zero-tree coding into two processing stages, and simultaneously makes coding multiple bit planes in parallel. In the first-stage processing, firstly reading wavelet transform coefficients in a mode of scanning from low layer subband to high layer subband group by group, layer by layer and tree by tree; then executing multistage quantization for corresponding multiple threshold values; preprocessing the quantized data; after processing, independently coding the processed data on their respective bit planes; registering the symbols generated by data coding in an output buffer; after all the wavelet transform coefficients of a wavelet tree are allocated with symbols and stored into the output buffer, starting the second-stage processing; according to the scanning sequence from high layer subband to low layer subband, screening effective coded symbol output. It can raise coding rate, reduce coding time, has low requirements for IC performance and resources and is flexible to apply and easy to implement. It can be applied to the field of video data compression or image data compression.

The invention discloses a Tag-tree coding method based on JPEG2000 which relates to the technical field of the image processing. The invention has the coding processes: interception on every layer is firstly carried out on code stream of T1 coding to count layer information which is included by each code block for the first time; inclusion information of all the code blocks in a wavelet subband is secondly caused to form a leaf node sequence of a Tag-tree, and tree building is carried out on inclusion information in the leaf node sequence to form a parent node thereof; coding is carried out on the leaf node sequence of the Tag-tree according to the parent node; and coding results of nodes in the leaf node sequence of the Tag-tree are finally separated to coated heads of every layer. The invention simplifies the corresponding relation of the parent node and child nodes, enhances the coding speed, and can be used for image compression coding of various digital equipment.

For most large 3D engineering models, the instance positions of repeating instances of connected components show significant multiple spatial aggregation. The invention uses several KD-trees, each for one cluster of points which are spatially aggregated. The multiple KD-trees generate a relatively short data stream, and thus improve the total compression ratio. A method for encoding points of a 3D mesh model comprises steps of determining that the mesh model comprises repeating instances of a connected component, and determining for each repeating instance at least one reference point, clustering the reference points of the repeating instances into one or more clusters, and encoding the clustered reference points using KD-tree coding, wherein for each cluster a separate KD-tree is generated.

The invention provides a method and system for automatically generating behavior tree codes. The method comprises the step of: S1: defining behavior tree nodes which need to be used; S2: configuring artificial intelligence data, and particularly, according to the behavior tree nodes defined in the step S1, constituting an artificial intelligence behavior tree; S3: loading an artificial intelligence configuration file, and according to various nodes and a relationship among the nodes, which are described in a data text, sequentially constructing operational behavior tree codes; S4: repeating the step S3 to carry out compiling, and after finishing traversing, returning an integral set of constructed behavior tree codes. According to the method and the system which are provided by the invention, the lua codes are automatically generated accoding to the lua data text, so that the writing work of a great quantity of codes is reduced, and the generation process of the behavior tree is simpler and easier to understand. Therefore, artificial intelligence behaviors in a game can be more effectively implemented, a game development progress is accelerated, and the method and the system are convenient to upgrade and maintain the codes.

The invention discloses a load balance control method used for a storage system. The load balance control method includes steps of (1) encoding by a multi-branch tree structure; (2) randomly generating an initial population comprising a plurality of individuals; (3) determining whether iteration end conditions are met or not, if not, entering a step (4), and if yes, outputting results; (4) calculating adaptability of each individual; (5) selecting the individual of the next step according to a roulette selecting method; (6) subjecting the selected individual to crossover operation; (7) subjecting gene positions of the population to heteromorphosis; (8) removing the individuals with the minimum adaptability in the population, guaranteeing the scale of the population, generating a new population and returning to the step (3). By applying tree code rules to the mapping relation of physical nodes and virtual nodes and redesigning crossover operators and heteromorphosis operators in genetic algorithm, a mapping scheme meeting load balance is obtained, system output, disk utilization efficiency and user access service quality are remarkably improved.

Systems, methods, and computer-readable storage media for maintaining palette predictors for palette coding are described. An example method can include determining a current palette coding block of a single tree coded slice of a picture is encoded according to a local dual tree; determining, after an update of a palette predictor associated with the current palette coding block, a first number of palette predictor entries for a first image component of the current palette coding block and a second number of palette predictor entries for a second image component of the current palette coding block; determining the first number of palette predictor entries is greater than the second number of palette predictor entries; and based on the first number being greater than the second number, modifying the updated palette predictor to include a same number of palette predictor entries for the first and second image component.

The invention relates to the technical field of the remote medical video communication, and specifically relates to an intra-frame fast coding method based on quality scalable video coding QSHVC. Themethod comprises the following steps: excluding the depth with small possibility by using relevance; judging whether a residual coefficient meets Laplace distribution by using a distribution fitting check method; if the residual coefficient meets the Laplace distribution, adopting an inter-layer ILR prediction mode, and skipping the intra-frame Intra prediction mode to realize the early termination; if the residual coefficient does not meet the Laplace distribution, traversing the inter-layer ILR prediction mode and the intra-frame Intra prediction mode, computing a rate-distortion value, andselecting an appropriate depth value through comparison. Through the fast coding method disclosed by the invention, the high computing complexity problem caused by a recursive quad-tree coding unit division in the coding is mainly solved. In the premise of guaranteeing the quality of the video, the coding speed is obviously improved, the method can be used for video conference, remote consultation, remote education, remote medical treatment and video on-demand.

The invention discloses a reversible data hiding method combining adaptive quad-tree coding. The method mainly comprises two steps including encoding-end information embedding and decoding-end information extracting. An image content adaptive strategy is employed so that the embedding capacity of reversible data hiding is improved compared to that of a non-adaptive method, and the image performance is more obviously improved especially for special images with enormous smooth areas and complex texture areas and obviously distribution of the two kinds of areas, such as medical images.

The invention discloses a method for indexing spatial data in a cloud computing environment. The method comprises the following steps of: 1) establishing a data storing table on the basis of the spatial data; 2) building an R+-tree index on the basis of spatial object distribution; 3) building a grid index on the basis of spatial object coverage range; 4) carrying out dimensionality reduction andcoding on the R+-tree index and the grid index by utilizing a Z curve; 5) establishing a code mapping table of R+- trees and grids; 6) establishing an index table on the basis of R+- tree codes and spatial objects ID; and 7) carrying out spatial range query. The method has the beneficial effects of making full use of the data organization characteristics of a NoSQL (Not Only Structured Query Language) database, optimizing the traditional spatial index and realizing the efficient access of the spatial data in the cloud environment.

The invention relates to the field of network communication, in particular to a multiple-constraint multicast routing algorithm based on iteration coding. The multiple-constraint multicast routing algorithm based on iteration coding is applied to a communication network with multiple-constraint requirements aiming at the problems existing in the prior art. According to the method, a multicast tree coding method capable of eliminating a loop and high in coding and decoding applicability is designed, and meanwhile, the method can also eliminate a loop of a generated multicast tree. According to the method, a new multicast tree is generated by combining two multicast trees, and the new multicast tree is output after it is confirmed that the new multicast tree meets a routing constraint condition or the calculating process reaches iteration times.

The invention discloses a stream transmission method for a three-dimension model facing a mobile terminal. The method comprises the steps of conducting global parameterization on the three-dimension model by utilization of the MAPS algorithm, partitioning the three-dimension model into geometrical information, parameter information and connectedness information, and building a self-adaptive approximate semi-canonical model; then conducting inverse improved loop small wave conversion on the semi-canonical model to obtain a base grid and side-play mount, conducting zero-tree coding on the side-play mount to further conduct entropy coding, and based on a mobile terminal platform, compressing the base grid through single resolution based on the edge breaker algorithm; finally decoding through the inverse process simplified by the grid, and drawing an original model. The stream transmission method is moderate in calculated amount and high in decompression speed, is mainly applied to a PC on a mobile network to transmit complex three-dimension model to the mobile terminal, and improves the topology compression ratio and the geometry compression ratio to a certain degree.

The invention provides a method for querying a checkpoint. The method for querying the checkpoint comprises the following steps that A, information, input by a user, of the checkpoint to be queried is received, and the organization tree code corresponding to the checkpoint information is queried; B, according to the organization tree code, a database is searched for corresponding checkpoint data, wherein the database records the organization tree codes of checkpoints, an organization tree comprises a root node, leaf nodes and middle modes which are arranged between the root node and the leaf nodes, each node is provided with a symbol corresponding to the node, each leaf node represents one checkpoint, the root node and the middle nodes represent the organizations which the checkpoints belong to, an organization hierarchical relationship exists between the nodes on the paths from the root node to the leaf nodes, and the checkpoint organization tree code is a character string which is formed after the symbols of all the nodes on the path from the root node to the checkpoint are ranked in sequence. By the adoption of the method for querying the checkpoint, all the checkpoints under one organization can be queried, the limitation of the number of the checkpoints does not exist, massive checkpoints can be queried under a few of query conditions, mixed query of the checkpoint and the organization is flexible and convenient, and the usability is high.

The invention relates to a word language managing technique and a computer data structure technique, in particularly a method for constructing a word language structure tree. The method includes steps as follows: a rule for converting the word language to a space position and converting; a rule design construction of a word language structure tree code information; a method for synthesizing and managing the word language structure tree code information; a method for analyzing and identifying the word language structure tree code information; processing the word language through the computer or other devices that can calculate and store for obtaining the word language tree junction. The method can manage word language simply, directly and efficiently, the user can use the word language tree for reaching same effect when the user manages the word language. The word language tree has certain regularity that can increase efficiency greatly in processing the word language tree. The method has strong practicability.

The invention provides a video coding method, which comprises the following steps: receiving a video image frame, and obtaining at least one tree coding unit of the video image frame; dividing the tree-shaped coding units according to different video prediction unit division rules so as to obtain video prediction units with different sizes of the tree-shaped coding units; performing primary selection on the predicted brightness directions of intra-frame prediction of the video prediction units of different sizes to obtain the set number of intra-frame prediction primary selection brightness directions of the video prediction units of different sizes; setting an intra-frame prediction optimal brightness direction of a video prediction unit of the current size; selecting predicted chrominance directions of intra-frame prediction of video prediction units of different sizes to obtain an intra-frame prediction optimal chrominance direction of the video prediction units of different sizes;and performing intra-frame prediction coding on the current video image frame according to the intra-frame prediction optimal brightness direction and the intra-frame prediction optimal chromaticity direction.

The invention belongs to the field of industrial big data, and particularly discloses an industrial data compression method and system, a storage medium and a terminal. The method comprises S100, acquiring equipment data required by a user, and converting the equipment data through a BWT algorithm to obtain integer digital throttling of the equipment data, S200, carrying out wavelet transformationon the integer digital throttling, designing a wavelet coefficient tree, constructing a wavelet coefficient table, and writing parameters in the modeling process of the wavelet coefficient table intoa model parameter table, S300, introducing the wavelet coefficient table and a position mask table into embedded zero-tree coding to generate a main scanning symbol table and an auxiliary scanning symbol table, S400, performing Huffman encoding on the one or more main scanning symbol tables generated in the step S300 in combination with the model parameter table, and outputting an encoded code stream, and S500, writing the code stream into a two-dimensional code of a numerical control system to complete compression of the equipment data. The industrial data compression method provided by theinvention has a high compression ratio on the premise of no data distortion.

The invention relates to a JavaScript code obfuscation method of a custom obfuscation scheme. The obfuscation method comprises three obfuscation schemes which are independently selected by a user, namely the syntax tree code obfuscation, the variable replacement code obfuscation and the combined code obfuscation. According to the obfuscation method, the obfuscation of the initial JavaScript codesis completed through any one scheme, and an obfuscated JavaScript code, an auxiliary JavaScript code and an obfuscation program are generated. The information verification interaction between a clientand a server is realized by the auxiliary JavaScript code and the obfuscation program, and when a visitor normally accesses a web application, the client and the server can also perform verificationin real time to ensure that the access of the visitor is authorized. According to the invention, the complexity of the code obfuscation, the security of the verification and the operability of a userare improved.

For most large 3D engineering models, the instance positions of repeating instances of connected components show significant multiple spatial aggregation. The invention uses several KD-trees, each for one cluster of points which are spatially aggregated. The multiple KD-trees generate a relatively short data stream, and thus improve the total compression ratio. A method for encoding points of a 3D mesh model comprises steps of determining that the mesh model comprises repeating instances of a connected component, and determining for each repeating instance at least one reference point, clustering the reference points of the repeating instances into one or more clusters, and encoding the clustered reference points using KD-tree coding, wherein for each cluster a separate KD-tree is generated.

The invention discloses an intelligent contract processing method and device and a computer readable storage medium, and the method comprises the steps: carrying out the detection of an intelligent contract code, so as to obtain the type of the intelligent contract code and a target code type; performing modeling according to the type of the smart contract code and the type of the target code to generate an abstract interface and mode; analyzing the smart contract code to separate the service code from the language characteristic of the smart contract code; analyzing the language characteristics in a symbol analysis mode to obtain a syntax tree of the intelligent contract code; converting the syntax tree of the smart contract code into a target syntax tree code by using a code conversion framework, and generating a target code of the smart contract according to the target syntax tree code, the service code, the abstract interface and the mode; and outputting the target code of the smart contract. The processing method can solve the problems of seamless migration of intelligent contracts of different block chains, contract cross-language compatibility and contract development cost reduction.

A method and apparatus for block partition are disclosed. If a cross-colour component prediction mode is allowed, the luma block and the chroma block are partitioned into one or more luma leaf blocks and chroma leaf blocks. If a cross-colour component prediction mode is allowed, whether to enable an LM (Linear Model) mode for a target chroma leaf block is determined based on a first split type applied to an ancestor chroma node of the target chroma leaf block and a second split type applied to a corresponding ancestor luma node. According to another method, after the luma block and the chroma block are partitioned using different partition tress, determine whether one or more exception conditions to allow an LM for a target chroma leaf block are satisfied when the chroma partition tree uses a different split type, a different partition direction, or both from the luma partition tree.

The invention discloses a method and a device for determining a sampling point adaptive compensation mode. The method comprises the following steps: acquiring a motion vector contained in a first tree coding block, and acquiring a reference frame of a video frame of the first coding block; acquiring a video resolution and a frame rate, calculating a threshold value according to the video resolution and the frame rate, and judging whether the motion vector is greater than the threshold value or not according to a preset rule; if not, determining a second tree coding block according to the motion vector; sequentially calculating a first probability that coding blocks in the preset direction of all second codes start a sampling point self-adaptive compensation mode, and calculating a second probability that all coding blocks in the preset direction of the first coding block start a compensation mode; determining whether the compensation mode is credible according to the first probabilities and the second probabilities; and if yes, obtaining compensation modes of all the second coding blocks, and using all the obtained types of compensation modes as the compensation modes of the first tree coding block. The time consumed in the encoding process can be reduced.

The invention discloses a browser fuzzy test sample set acquisition method. The method comprises the following steps of (1) preprocessing a document, and counting html file elements to obtain an inputvector and element statistical data; and (2) performing deep learning by using an LSTM neural network, and decoding the generated sample to obtain a generated sample. (3) performing tree coding on the generated sample to obtain a parent population, and calculating a fitness function; and (4) optimizing the parent population by using the optimized genetic operator until a termination result is met. The method can be used for browser vulnerability mining, the mining direction is more targeted, and mining efficiency is higher.

The invention provides an image processing method and apparatus. The method includes S1 acquiring the current scanning window in the processed image including the face image, the current scanning window is any one of M scanning windows; S2 acquiring the segment scanning parameter P which is 1 / N of the preset cycle parameter Q of the current scanning window; S3 calculating the first address stored in the memory of the tree code, and obtaining the corresponding tree code data from the first address; S4 calculating a second address of the pixel in the memory based on the tree code data, and obtaining the corresponding pixel data from the second address; S5 after the predetermined number of times is reached in step S3-S4, calculating the index value from the pixel data; S6 acquiring the threshold value data based on the index value and obtaining the lookup table data; and S7 comparing the threshold value data and the lookup table data. The image processing method and apparatus can realize the face identification to reduce the demand of the memory, so that the limitation brought by the hardware can be reduced.

The invention provides a fast prediction direction decision method for efficient video coding and relates to the technical field of video coding. The method aims to solve the problem that the existinghigh-efficiency video coding technology has high coding complexity, fails to utilize correlation of the PU in the prediction direction between adjacent tree coding layers to complete a fast prediction direction decision, and fails to utilize the relationship between the predication direction and the corresponding Hadamard transform cost value to complete a fast prediction direction decision. Thefast prediction direction decision method for efficient video coding in the invention utilizes the correlation between the prediction directions of the PU and the correlation of the PU in the prediction direction in the adjacent tree coding layer to construct an initial candidate prediction direction list for the PU. The relationship between the prediction direction and the corresponding Hadamardtransform cost value is used for reducing the number of prediction directions that need to be processed by RQT. Experiments have shown that the method in the present invention can significantly reducethe coding time of the HEVC standard without affecting the coding efficiency. The method in the invention is applied to the field of prediction direction decision making for high-efficiency video coding.

The invention discloses a comprehensive wiring information management method based on a multi-way tree algorithm. Upstream and downstream relations of comprehensive wiring are established. By adoptionof a multi-way tree algorithm, the line association relationship of the comprehensive wiring is determined according to the hierarchical relationship and the relative position relationship of the multi-way tree. According to the technical scheme, the multi-way tree coding information library is established, the coding information of each node in the multi-way tree is established, so that the incidence relation between levels and between regions or equipment in the levels can be easily obtained by maintaining one multi-way tree coding information library, and the comprehensive wiring information can be managed more clearly and efficiently. A multi-way tree algorithm coding method is adopted, comprehensive wiring information management is carried out by maintaining a comprehensive wiring architecture node coding method, the problems of information consistency and intercommunication among large areas and the logic complexity of information in small areas are solved, and the clarity and high efficiency of information management are achieved.