66 results about "Ternary tree" patented technology

A new vehicle target identification feature extraction based on a new profile comprises an overall shape information, local statistical information and direction information compound identification feature. It puts forward a composite dual valve value identification method with quick algorithm. It uses C-Mean dynamic clustering and ternary tree principle to form an optimized matching sequence to greatly improve the identification efficiency and speed. It can be widely used in remote image identification, remote monitoring, intelligent traffic management, military scout, and so on.

The present invention relates to an image encoding / decoding method. The image decoding method includes splitting a coding tree unit (CTU) into at least one coding unit (CU) according to a block splitting structure and performing CU-based decoding, in which the block partition structure is configured such that at least one of binary tree splitting and ternary tree splitting is performed after quadtree splitting is performed.

The present invention relates to a key management method based on wireless Mesh network, which is characterized in that the method includes procedures below: As relation amongst communication nodes of a mesh cluster varies, an auxiliary updating node is selected from a key tree in correspondence with the Mesh cluster. Wherein, the key tree is provided with a ternary tree structure. A key and a blind key of the auxiliary updating node are created at random. Keys and blind keys at all key nodes in a key path of the key tree are calculated for the auxiliary updating node. Besides, all key nodes of the key tree broadcast to blind keys of all key nodes on the key path. Each leaf node of the key tree updates its own keys and blind keys and works out cluster keys. The technic proposal of the present invention provides parameters of total information length while nodes are added and leaves, password calculation quantity, total combined cluster information length and so on lower than those of prior arts, thus eliminating conflicts of safety demands of prior arts with expansibility and QoS demands.

The invention provides an image feature based eyeground image registering method. The method comprises that a retina eyeground image is obtained and processed to form a binary image; binary images of an image to be registered and a reference image are searched to obtain a binary tree based blood vessel registering point set, a ternary tree based blood vessel registering point set or a binary and ternary tree based mixed blood vessel registering point set; vectors corresponding to all the obtained blood vessel registering point sets are calculated; similarity measuring degrees between all the vectors corresponding to the blood vessel registering point sets in the binary images of the image to be registered and the vectors corresponding to the blood vessel registering point set in the binary image of the reference image; the similarity measuring degrees are ordered, and according to the minimal similarity measuring degree, an optimal registering point set pair of the binary image of the image to be registered and the binary image of the reference image is obtained; and according to node coordinates in the optimal registering point set pair, image registering is carried out on the basis of affine transformation.

Interpersonal relationship is a significant field in social network research, and is increasingly attended by many scholars. The word 'connection' is increasingly popular, and the 'connection' has become an indispensable social resource of people. The digital modeling and searching method for personal relationships and events belongs to an application foundation type research field of social computing, and provides support service for establishment and application of a practical digital personal relationship network. The digital modeling and searching method comprises the following steps of: defining an event concept model, and excavating and analyzing the relevant personal relationship of the event concept model based on a method for establishing a relevant role chain, establishing a personal relationship concept model based on a characteristic ternary tree structure, providing a digital system implementation method of the personal relationship concept model, constructing a personal family relationship network, and constructing a personal social relationship network according to personal life cycle event connection; and excavating and computing family culture, family connection relationship, social relationship connected with the family and the connection number and connection degree of the social relationship, comprehensively reflecting the personal connection information, and providing a specific searching method.

The invention provides a ternary tree planning calculation method for solving a three-dimensional packing problem. Based on an existing technology, X, Y and Z axes of a three-dimensional space are converted into three branches of a tree diagram of a ternary tree for study through creative problem solving ideas, and a packing sequence can be naturally formed; the level-wise search can be implemented, and the calculation process can be simplified; and meanwhile, by adopting the scheme, all directional constraint conditions can be taken into account, packed objects of which the front sides, rightsides and upper sides are spaces to be packed can be classified into the category, and a binary tree packing scheme parallel to the height direction can also be classified into the category. The technical scheme of the invention can make up for the problem of 'combination explosion' of multi-constraint conditions of the packing scheme; and compared with an existing packing scheme, the method hasthe following advantages: a ternary tree structure can be formed, and the packing sequence can be naturally formed; the level-wise search can be implemented, and the entire calculation process is simple and effective; through optimization calculations, a complete optimization result can be obtained; and the packing schemes of objects to be packed in different directionality can be proposed.

The invention relates to an extracting and analyzing method for a horizontal nystagmus signal, a vertical nystagmus signal and a rotating nystagmus signal based on a nystagmus image. The method comprises the steps of decoding and normalizing; detecting and compensating reflection points; performing coarse positioning on an iris area; calculating a brightness gradient distribution matrix; constructing a shuttle-shaped ternary tree; calculating an optimal path; detecting the boundary of a pupil and the boundary of an iris; extracting the horizontal nystagmus signal and the vertical nystagmus signal; extracting the characteristic of the iris and coding and extracting the rotating nystagmus signal. According to the method, the nystagmus image is used as a processing object. Through video analysis and digital image processing technology, the nystagmus signals are extracted and visually displayed on a computer screen in a curve map manner, thereby supplying medically beneficial reference information.

The invention discloses a multi-level hierarchical DSmT rapid approximate reasoning fusion method. Aiming at the condition that only a monad focal element has the belief assignment in an ultra power set space, a binary tree and trinomial tree grouping technique is applied to perform the rigid grouping to realize the mapping of different granular focal elements. In the meantime, the belief assignment summation is performed to each grouping focal element corresponding to each information source, two information sources of a coarsing ultra power set space are fused by applying the DSmT rule and the proportion distributing conflict rule, a fusion result is stored to be used as a connecting weight between a father node and a child node, and then the normalized treatment is performed to each grouping focal element belief assignment. The multi-level hierarchical frequency is determined through setting the depth of the tree. The invention has the advantages of simple computation, high computational efficiency, good robustness of the approximate computing result and the like, and solves the problem that the DSmT evidential reasoning has the computational bottleneck along with the increase of discrimination frame focal elements.

The embodiment of the invention discloses image data coding and decoding methods and devices, which relate to the field of image processing and solve the problem of high coding complexity. The image data decoding method particularly comprises steps: a code stream containing image data is obtained; the code stream is parsed to obtain node partition mode information of a first-level coding tree; thecode stream is parsed to obtain node partition mode information of a second-level coding tree; if the node partition mode information of the second-level coding tree indicates that the partition modecorresponding to a first node in the second-level coding tree is ternary tree partition, the code stream is parsed to obtain the coding information of three sub nodes in the first node, wherein one sub node in the first node is corresponding to a coding unit; and according to the coding information of the three sub nodes in the first node, the coding unit is decoded and rebuilt to obtain an imagecorresponding to the image data.

The invention discloses a high-efficiency abnormal time series data extraction method, which can be used for finding exceptions from electrocardiogram (ECG) data to detect a heart disease. The method includes: allowing a distance function in a system to adopt DTW (Dynamic Time Warping) distance to replace the conventional Euclidean distance so as to reduce phase displacement errors; mapping original time series data (ECG) into a series of character string sequences through the SAX technique, and storing the character string sequences into an Array data structure and a Trie ternary tree data structure; finding the most likely abnormal sequences as candidate exceptions through the Array and the Trie ternary tree; finding the nearest neighbor distance of the first candidate exception as a first threshold distance from the ECG data through secondary screening; verifying the candidate exception as the final inquired exception through nest inner and outer circulation, otherwise updating the candidate exception; and finally obtaining abnormal time series in the ECG data after the inner and outer circulation is completely executed. The method can solve the problem that rapid accurate finding of exceptions is difficult to achieve in mass ECG data due to high DTW distance redundancy.

In one method, the current block is partitioned into multiple final sub-blocks using one or more stages of sub-tree partition comprising ternary tree partition and at least one other-type partition, where ternary partition tree is excluded from the sub-tree partition if a current sub-tree depth associated with a current sub-block is greater than a first threshold and the first threshold is an integer greater than or equal to 1. In another method, if a test condition is satisfied, the current block is encoded or decoded using a current Inter mode selected from a modified group of Inter tools, where the modified group of Inter tools is derived from an initial group of Inter tools by removing one or more first Inter tools from the initial group of Inter tools, replacing one or more second Inter tools with one or more complexity-reduced Inter tools, or both.

The invention relates to a tag anti-collision method based on a self-adaptive hybrid query tree in an RFID (radio frequency identification) system. The tag anti-collision method includes firstly, establishing a binary-to-ternary conversion method for electronic product codes (EPCs) of electronic tags, secondly, providing a method for constructing a ternary query tree to identify the tags, thirdly, valuing according to lengths of the EPCs to construct the hybrid query tree method to solve the problem of coexistence of a binary tree and a ternary tree, and finally, setting entry and departure mechanisms to acquire the tag anti-collision method of the self-adaptive hybrid query tree according to mobility of the tags. The tag anti-collision method based on the self-adaptive hybrid query tree in the RFID (radio frequency identification) system has the advantages that the ternary tree method has optimized performance in the tag anti-collision method based on a tree structure, the problem that complete ternary conversion of the EPCs fails is solved, the difficulty in identifying the moving tags is overcome, time delay of identification is shortened well, and the colliding and idling processes are reduced. In addition, the tag anti-collision method is suitable for RFID scenes with large-scale movable tags.

High throughput in data computations and processing is maintained while minimizing latency. A binary tree architecture is provided in which two trees are used simultaneously, and initiation of the trees is staggered to allow for optimal use of bandwidth. These techniques are desirable for erasure codes and other computations where the addition operator is commutative. Additionally, a ternary tree architecture may be used, in which three trees co-exist on the same set of nodes to maintain high throughput while further improving latency.

The invention relates to a method for automatically drawing a single line diagram of a multi-intelligent distribution system, in particular to a method for automatically drawing a single line diagrambased on a triple tree and a collision avoidance algorithm, belonging to the field of power system dispatching automation. The advantage of this method is that it can be used to draw single-line diagrams for different distribution systems of different suppliers. Single Line Diagram (SLD) is an important method of power system visualization, which can be used to control and monitor the fault location, identification, separation and service recovery of distribution system. First, the distribution system diagram is converted to a standard grid common information model CIM at the client, and thensent to the server. At the server side, a single line graph is drawn by using the method of automatically draw a single line graph, and finally, the single line graph is sent back to the client side,and is verified by the client side.

The invention discloses a fast VVC (Video Video Coding) intra-frame coding method with low complexity. According to the method, a CU division module based on context correlation firstly divides a CU into a complex block and a simple block according to texture features of a current CU block; all types of division are terminated in advance for a simple block, and binary tree division and ternary tree division are continued for a complex block, so that the problem of overhigh complexity caused by multi-type tree division is solved. In addition, the encoder decides the optimal mode of the current CU. The method comprises the following steps: firstly, optimizing an intra-frame roughing part, selecting a central angle every four angles in an angle mode of which the index value of an intra-frame angle prediction mode is 2-67, and then respectively adding two angle mode searches before and after a small range based on the central angle; and then, optimizing a finely selected part in the frame by utilizing a probability distribution characteristic of a most probable mode (MPM). According to the method disclosed by the invention, the complexity of VVC coding is reduced while the coding quality is ensured, and particularly, the method has very good coding performance for a high-resolution video.

The invention discloses a quick image scrambling method based on a local equilibrium ternary tree theory, wherein the scrambling method comprises the following steps: a first element of an original image is used as a root node of a ternary tree, three elements closely neighbored to the first element are used as left, middle and right subnodes of the root node; three elements closely neighbored to the middle node are used as left, middle and right subnodes of the node; one element closely neighbored to the left node is used as the subnode of the node, one element closely neighbored to the right node is used as the subnode of the node; by parity of reasoning, the entire image matdix is used as a local equilibrium ternary tree. An ergodic process comprises the following steps: the root node is traversed; the traverse is carried out according to the level of the tree, every layer is sequentially traversed according to the middle, left and right nodes. The traversed elements are stored in a one-dimensional numerical group; the one-dimensional numerical group is transformed to the size of the original image to finish the positive scrambling of the image. The method can quickly reach an ideal scrambling effect, and the scrambling is stable, the image recovered after scrambling is free from loss; the method has relatively strong ability in shear resistance, compression, wave filtering and noise attack.

The invention discloses a ternary tree traversal-based lane line detection method and relates to the field of image processing. According to the method, candidate feature points which represent the center line of a lane line are extracted, and the number of pixel points required to be processed is reduced. The calculation efficiency of the algorithm is improved. The feature points of lane lines and noises are analyzed, and a method for filtering pseudo feature points irrelevant to the parameter space is provided. In this way, the parameter space conversion and the complex mathematical operation are avoided. The accuracy of lane line detection is improved. Meanwhile, a lane line prediction model is provided for carrying out lane line prediction in special road conditions. The internal memory is stored in the model. According to the change tendency of an image sequence from the past to the current, a lane line in a special road condition can be predicted. The lane line is predicted properly and reasonably. The accuracy of the detection result is improved.

A method of providing predictive search query recommendations for a search query. The method can be implemented via execution of computer instructions configured to run at one or more processing modules and configured to be stored at one or more non-transitory memory storage modules. The method can include receiving the search query from a user. The method also can include determining the predictive search query recommendations for the search query using a tree data structure. At least one top layer of the tree data structure can include at least one trie query node and bottom layers of the tree data structure can include ternary tree query nodes. The method further can include sending the predictive search query recommendations to the user. Other embodiments of related systems and methods are also disclosed.

The invention discloses a multi-type tree structure block division mode selection early termination method. The method comprises the following steps: S1, taking a first frame in an image group as a key frame to obtain an optimal decision threshold; S2, initializing all optional division modes of the current CU; S3, selecting the ith mode from all selectable division modes S as the division mode of the current CU; S4, performing corresponding judgment according to whether the selected mode is horizontal division or vertical division so as to perform quick partition decision; S5, carrying out corresponding judgment according to whether the selected mode is binary tree division or ternary tree division so as to carry out rapid partition decision. Threshold control is performed through the first frame of the image group so that the threshold is enabled to be more suitable for the current image frame, unnecessary division mode prediction can be avoided by using the spatial domain texture information of the image, the computational complexity of the coding algorithm can be effectively reduced on the premise of ensuring the coding effect, and the coding efficiency can be enhanced, the encoding time is greatly saved, and the encoding performance loss can be ignored.

A dipole patch antenna based on a ternary tree arc-shaped fractal structure is composed of a front surface and a back surface. The front surface comprises a first antenna oscillator which is composed of a ternary tree one-order arc-shaped structure, a two-order arc-shaped structure, and an antenna linear structure. The front surface further comprises an impedance matching part, a microstrip transmission input line, a Balun feeding structure and the like. The back surface of the antenna is provided with a second antenna oscillator in complete axial symmetry with the structure of the first antenna oscillator. The back surface further comprises an impedance matching part, a microstrip transmission output line, etc. According to the dipole patch antenna, a microstrip Balun feeding manner is utilized, and a two-order fractal dipole patch antenna is designed by means of the ternary tree and arc-shaped structures. Self similarity and spatial filling performance of the fractal structure are utilized so that smaller dimension is realized under a precondition that technological indexes such as antenna gain, directional diagram input impedance and radiation uniformity are satisfied, and a requirement for small size of the antenna is satisfied. The antenna structure has advantages of easy realization, stable performance and relatively wide application prospect in an RFID field.

The invention belongs to the field of digital image watermarking technology and copyright protection, and provides a wavelet domain color multi-watermarking technology, which can adjust the balance among invisibility, robustness and capacity of watermarks, and can also effectively resist known noise attacks, shearing attacks, rotation attacks and other attacks. Therefore, according to the grey wolf optimization algorithm and complete ternary tree structure wavelet domain color multi-watermark method, in the watermark embedding process, three color watermark images are firstly encrypted into agrey level image through a ternary tree encryption technology; then, wavelet transformation is carried out on the color host image, a selected frequency part is transformed into a YCbCr color space, then singular value decomposition is carried out, and the multiple encrypted color watermarks are embedded into a singular value part of the carrier image; and finally, the singular value part containing the secret image is combined with the feature vector, and inverse wavelet transform is performed to obtain a carrier image containing the secret image. The method is mainly applied to occasions where image watermarks are embedded.

According to the fast coding unit division method for H.266 / VVC intra-frame prediction coding, the texture complexity of a current coding CU is judged according to a texture descriptor, if the current coding CU is a flat region, division of the current CU is terminated, quadtree division is carried out on a CU block with the size of 64 * 64 to obtain a CU block with the size of 32 * 32, horizontal and vertical activity degrees are calculated, and the CU block with the size of 32 * 32 is obtained. If the difference between the horizontal activity degree and the vertical activity degree is smaller than a set threshold value, a VTM default mode is adopted, if the horizontal activity degree is larger than the vertical activity degree, texture activity degrees of quadtree division, horizontal binary tree division and horizontal ternary tree division are calculated, and if the vertical activity degree is larger than the horizontal activity degree, texture activity degrees of quadtree division, horizontal binary tree division and horizontal ternary tree division are calculated; the texture activity degrees of quadtree division, vertical binary tree division and vertical ternary tree division are calculated, the texture activity degrees are judged, a corresponding division mode is selected, and otherwise, a VTM default mode is adopted; according to the method, flat CU block division can be terminated in advance, a large amount of cost calculation is skipped, and the coding time is simply and effectively saved.

The invention discloses an optimizing method of a split-radix FFT (fast fourier transform) algorithm based on a ternary tree. The optimizing method comprises the following steps of 1, defining the ternary tree and information of tree nodes; 2, according to the particular FFT computing scale, enabling the ternary tree to generate computing information; 3, browsing the ternary tree by a width priority searching algorithm, obtaining the information in the computing process, and storing the computing information into a chain list; 4, utilizing the computing information of the nodes in the chain list to optimize the split-radix FFT algorithm. The optimizing method has the advantages that the problem of low efficiency in the traditional recursion is solved, the system expense is reduced when the recursion calls up the subfunction, the division of computing tasks in the split-radix algorithm is completed in advance, and the efficiency is improved.

A method and apparatus for partitioning a block to permit the encoding or decoding of a video sequence includes partitioning the block using a split-to-square partition pattern, a horizontal binary tree partition pattern, or a horizontal ternary tree partition pattern to generate a set of sub-blocks, wherein a same priority is allocated to the split-to-square partition pattern, the horizontal binary tree partition pattern, and the horizontal ternary tree partition pattern such that the split-to-square partition pattern may be used before, after, or interleaved with the horizontal binary tree partition pattern and the horizontal ternary tree partition pattern. Encoding or decoding the video sequence is performed based on partitioning the block using the split-to-square partition pattern, the horizontal binary tree partition pattern, or the horizontal ternary tree partition pattern.

According to the present invention, there is provided a video signal processing method of dividing an input image on a per-block basis for encoding, the method including: determining, at a division determination step, whether to divide a current block; dividing, at a block division step, the current block into multiple sub blocks on the basis of the determination; generating block division information on division of the current block; and encoding, at an encoding step, the block division information, the current block, or the sub blocks. Examples of division of the block according to the present invention include division using N-ary tree structures, such as the quad tree structure, the binary tree structure, and / or the triple tree structure.

The invention discloses a method for dividing an image. The method comprises following steps: determining whether to divide a first coding block into a plurality of second coding blocks by tree-basedblock division; based on the result, dividing the first coding block into a plurality of second coding blocks, wherein the tree-based block division includes at least one of binary tree division or ternary tree division, the binary tree division represents a division type of dividing the first coding block into two second coding blocks, and the ternary tree division represents a division type of dividing the first coding block into three second coding blocks.

The invention discloses an image description generation method capable of generating a dependency tree. The method comprises the following steps: modeling a ternary tree of a dependency tree of an image description text, extracting image features from an input image, generating a root node of the ternary tree based on the image features, generating three child nodes of the root node, generating three child nodes of each node in a recursive manner in the same manner, generating the ternary tree, and converting the generated ternary tree into a dependency tree of an image description text; preferably, each local image feature is dynamically assigned a weight by an attention module when each node is generated. According to the method and device, the dependency path generated by the nodes is shorter than that generated by a sequence model, important words can be generated preferentially in the generation process, the generation mode is closer to human beings, and the performance higher than that of a reference model is achieved.

The invention belongs to the technical field of information security, and particularly relates to a tree structure electronic cash construction method of the electronic cash. According to the method,firstly an electronic cash system common parameter setting method is given, then the tree structure of the electronic cash of which the denomination is 3n is given, and the electronic cash is constructed according to the tree structure. The user is enabled to buy single electronic cash of which the denomination is 3n from an electronic cash issuing agency and complete payment for the electronic cash by multiple times.

The invention provides a ground digital TV five-channel merging modulator which includes power adjustment, where 0-3dB power adjustment and 0.5dB stepping are employed to realize FPGA of IQ two paths of each channel multiplying by a fixed coefficient; upper sampling by inserting three zeros in each two sampling points to realize four-time up-sampling of baseband signals, and by suppressing mirror image frequency spectrum by a cascade Nyquist filter after interpolation; low-intermediate frequency modulation by employing a direct digital frequency synthesizer to generate orthogonal frequency signals required for modulating 15 frequency points; and merging amplitude limit by employing a ternary tree structure to optimize an adder, conducting amplitude limiting processing for the output of the adder, outputting to DA from orthogonal modulation and power amplification to radio frequency output. Compared with five independent modulators, the ground digital TV five-channel merging modulator has the same performance, substantially reduces cost and power consumption, and has higher practical value.