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.

In a method and a device for coding binary matrices, in particular sparse binary matrices, a matrix is gradually partitioned into sub-matrices During the gradual partitioning the number of binary ones are counted for each resulting sub-matrix. If a resulting sub-matrix does not consist of mixed symbols no further partitioning of that sub-matrix is required. The counted number of binary ones for each sub-matrix is then coded and transmitted. The method provides an efficient coding particularly for sparse binary matrices such as bi-level images or bit maps.

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.

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 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.

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.