Patents
Literature
Hiro is an intelligent assistant for R&D personnel, combined with Patent DNA, to facilitate innovative research.
Hiro

109 results about "Matrix encoding" patented technology

Basic Matrix, Coder/Encoder and Generation Method of the Low Density Parity Check Codes

The invention relates to a base matrix, a encoder / decoder of Low Density Parity Check (LDPC) codes and a generation method thereof. The encoder / decoder is determined uniquely by the parity check matrix of the LDPC codes. With different code sizes, said parity check matrix can be obtained by expanding different base matrixes, and also can be obtained by expanding a unique base matrix after correction. Elements of said base matrix must meet an inequation in which the girth value is up to the standard, e.g. when girth ≧6, for any element i, j, k, l in the matrix which forms the short loop having a length of 4 in anticlockwise, there are always mod(i−j+k−l, z) unequal to 0. By this invention, the girth of the constructed base matrix is made as large as possible, the amount of the shortest loops is as few as possible when it is the same girth, thus the curve of bit error ratio (BER) is dropped quickly, the error floor of the LDPC codes is eliminated effectively, and the optimal performance of the LDPC codes is obtained.
Owner:ZTE CORP

Image hiding and authentication method based on secret sharing

ActiveCN103761702AImprove securityDifferences in Statistical PropertiesImage data processing detailsPattern recognitionHash function
The invention discloses an image hiding and authentication method based on secret sharing, and belongs to the technical field of secret image sharing. The image hiding and authentication method is characterized by comprising the steps that firstly, difference Huffman encoding is conducted on a secret image, every three generated bit sequences are set to be one group to be converted into decimal numbers which are used as coefficients of a sharing polynomial in the Shamir (k, n) threshold scheme, the k and the n are positive integers, the k is smaller than or equal to the n, and n shadow images are generated; secondly, n significant carrier images are selected, the generated shadow images are embedded into the carrier images in a matrix encoding mode, authentication bits generated by the hash function are also embedded into the carrier images, and n disguise images are formed and are in the charge of n different participants respectively. The disguise images generated through the image hiding and authentication method has higher visual quality, existence of secret information cannot be perceived by attackers easily, and the safety of the secret information is ensured. Meanwhile, before the secret information is recovered, the disguise images provided by each participant need to be authenticated, only the disguise images passing through authentication can participate in recovery of the secret information, and the safety of the secret information is further strengthened.
Owner:TAIYUAN UNIVERSITY OF SCIENCE AND TECHNOLOGY

Coding and decoding methods of ode of tail-biting staircase codes

ActiveCN105429646AGuaranteed error correction performanceTroubleshoot issues where uncorrected errors are affecting overall performanceError correction/detection using convolutional codesError correction/detection by combining multiple code structuresComputer architectureBlock code
The invention relates to a tail-biting staircase code coding method. The tail-biting staircase code coding method comprises the following steps: 1) selecting an (n, k) linear block code as a component code, wherein n represents a code length, n belongs to (500, 5000), and k represents an information length before coding; and 2) grounding received information according to a mode in staircase codes, constructing a matrix B<1>, B<2>, B<3>, ..., B<n>, adding a full-zero matrix participating the coding to a lower part of B<1>, coding the residual matrix using the component code then, generating a check bit matrix while the coding, completing end-to-end connection of codes of a final matrix and a first matrix in a group then, finally replacing the full-zero matrix complemented in the B<1> with the check bit matrix, and completing the coding. The coding method is advantageous in that, through adoption of the novel coding scheme, the novel tail-biting staircase codes have a characteristic of the block code, coding processes between groups are mutually independent, information of each matrix in the groups is still contained in the two component codes, and error correction performance is guaranteed.
Owner:NANJING UNIV

Multi-heterogeneous unmanned aerial vehicle task allocation method based on improved genetic algorithm

The invention discloses a multi-heterogeneous unmanned aerial vehicle task allocation method based on an improved genetic algorithm, and belongs to the technical field of unmanned aerial vehicles. Themethod is characterized by establishing a task allocation optimization model by comprehensively considering multiple constraints such as resource consumption, task completion effect and load balancing, resource limitation and task priority; and encoding each feasible task allocation scheme into a complete chromosome by adopting a matrix encoding mode. Aiming at the problems that an existing genetic algorithm is insufficient in solving precision and too slow in solving speed, the concept of fuzzy elitibility is provided, all genetic operations are improved on the basis, the built optimizationmodel is solved through the improved genetic algorithm, and an optimal task allocation scheme is obtained within limited iteration times. The method has good universality in the field of multi-agent cooperative control, has the advantages of high solving speed and high solving precision, and can effectively solve the task allocation problem of a multi-heterogeneous unmanned aerial vehicle system with multiple constraints.
Owner:河北梓墨电子科技有限公司

Feature representation method based on dynamic facial expression sequence and K-order emotional intensity model

The invention discloses a feature representation method based on a dynamic facial expression sequence and a K-order emotional intensity model. The method is characterized in that the method comprises the steps of (1) extracting a Haar feature in a dynamic facial expression sequence set and carrying out feature dimensionality reduction by using PCA, (2) taking each column of a feature matrix which is subjected to dimensionality reduction as a clustering sample and carrying out K-Means clustering, obtaining the mean and variance of all features in each class, constructing the normal distribution of each class, and generating a K-order emotional intensity model, (3) extracting the Haar feature in a dynamic facial expression sequence to be extracted and then carrying out feature dimensionality reduction by using the PCA, (4) inputting the feature which is subjected to the dimensionality reduction into the K-order emotional intensity model and obtaining an output matrix, and (5) encoding the output matrix to obtain an encoding result which is the feature representation of dynamic facial expression sequence to be extracted. According to the method, the feature dimensionality and computation complexity can be effectively reduced, and the real-time performance of feature extraction is improved.
Owner:HEFEI UNIV OF TECH

Hamming code plus one-based information hiding method of HEVC video

ActiveCN104902281AGuarantee subjective and objective qualityReduce the impact of quality degradationDigital video signal modificationHamming codeVideo bitstream
The invention discloses a hamming code plus one-based information hiding method of an HEVC video. The method comprises the steps as follows: using a (1, 3,2 ) matrix encoding algorithm in steganography code to combine with an LSBMR algorithm to form a hamming code plus one algorithm, modifying a prediction mode according to three-bit secret information to be embedded to finish information embedding, embedding the three-bit secret information in four continuous 4X4 intra-frame luminance blocks. The hamming code plus one-based information hiding method of the invention not only ensures hiding capacity, but also reduces the impact that the video quality is reduced because of modifying the prediction mode to ensure the subjective and objective quality of the video well, and greatly reduces the impact of embedded secret information to a video bitstream. By analyzing an HEVC coding and decoding structure, modulating the predication node in an intra-frame prediction coding process as the predication node which meets an embedding condition and whose rate-distortion cost is the smallest in terms of a predication unit whose size is 4 plus 4, and using a Lagrange rate-distortion mode to adaptively select the type of the prediction unit of the coding unit, the secret information hiding manner could well ensure the subjective and objective quality of the video.
Owner:NINGBO UNIV

Construction method for multi-code low density verification LDPC code with fixed code length

The invention discloses a construction method for a multi-code rate low density verification LDPC code with a fixed code length, comprising steps of determining the number N of columns of a circulation coefficient array C according to a maximum bitrate of the multi-rate LDPC code to be constructed, choosing a prime number P greater than the column number N, determining the size L of a circulation replacement array and the code length n, constructing a limited domain according to the prime number, choosing a primitive element alpha on a limited domain to determine the circulation coefficient array Ck, utilizing an optimized algorithm to determine that the R is equal to three mask matrixes Bk of the LDPC code with various rate Rk, determining a basic matrix Dk of each code rate according to the circulation coefficient matrix Ck and the mask matrix Bk of each code rate, determining a check matrix Hk of the LDPC code of each code rate according to the basic matrix, and finally obtaining a group of check matrixes of the multi-rate LDPC code. Compared with the prior art, the code length of the constructed multi-rate LDPC code is fixed, and the invention can directly use the check matrix to perform coding, is easy to realize the hardware and is applicable to the satellite communication system and the cellular system.
Owner:XIDIAN UNIV

Animal ear tag matrix encoding identification method and device

InactiveCN106709487AAchieve readingRealize point-and-shootCharacter and pattern recognitionAnimal husbandryEar tagMatrix encoding
The invention discloses an animal ear tag matrix encoding identification method and device, and relates to the technical field of computers. The method comprises the following steps of: obtaining an image of an encoding region of animal tags; carrying out white-black binary processing on the image of the encoding region; determining the number of lines and number of rows of an encoding matrix in the encoding area after the binary processing by utilizing a protection segmentation algorithm; carrying out grid generation on the encoding region according to the determined number of lines and number of rows; and decoding the encoding matrix according to pixel values of pixel points in each grid, and identifying information of animals included in the encoding matrix. According to the method, the images of the encoding region of the animal tags is acquired, and the encoding matrix of the encoding region is divided and decoded by utilizing the projection segmentation method, so that the reading of animal tag matrix codes is realized; and the method is strong in university, is suitable for various devices capable of acquiring and processing images, is simple and convenient to apply, and can carry out real-time decoding to realize decoding during shooting.
Owner:ZHENGJIANG PUBLIC INFORMATION

SPDMD-based power system oscillation mode and modal identification method

The invention discloses a SPDMD-based power system oscillation mode and modal identification method comprising the steps: the energy weight corresponding to each oscillation mode is represented by thetime amplitude coefficient and the oscillation mode and the oscillation modal of high weight are selected out; a matrix formed by the previous N-1 columns of measurement data sequences is converted to calculate the initial amplitude coefficient, the penalty function term is introduced into the Frobenius norm term and the position of the non-zero elements in the initial amplitude coefficient is determined by ADMM, matrix encoding is performed on the initial amplitude coefficient and the value size of the non-zero elements in the initial amplitude coefficient is adjusted by using a pull multiplier method so as to obtain the optimal amplitude coefficient; and the dominant oscillation mode is determined by the correspondence between the non-zero elements in the optimal amplitude coefficient and each oscillation mode, and the collaborative identification and evaluation of the dominant oscillation mode, the dominant participation factor and the homology cluster are completed. The oscillation mode and modal identification of the power system can be realized, and the defect that the DMD algorithm cannot determine the number of the dominant oscillation mode can be overcome.
Owner:NORTHEAST DIANLI UNIVERSITY

Image steganography method and system for automatically learning distortion based on GAN network structure

The invention discloses an image steganography method and system for automatically learning distortion based on a GAN network structure, and the method comprises the steps: inputting an enhanced carrier image into a preset improved U-Net network, sequentially generating an initial pixel change probability graph and an initial secret-containing image, inputting the initial secret-containing image into a discrimination network, and obtaining a discrimination result, calculating the loss of the discrimination network according to the discrimination result, calculating a total loss function of the generative network according to the discrimination result and the current steganography capacity, optimizing the generative adversarial network by taking minimization of the loss function as a target, when the loss is reduced and kept stable, considering that the training is ended, extracting the generative network from the generative adversarial network after the training is ended, and inputting a to-be-transmitted original image into the generative network to obtain a pixel change probability, calculating embedded distortion corresponding to the pixel change probability, and coding the secret information and the to-be-transmitted original image by adopting a syndrome matrix coding technology according to the embedded distortion to obtain a steganographic image corresponding to the original image.
Owner:NANJING UNIV OF INFORMATION SCI & TECH

Homomorphic encryption matrix continuous multiplication safety outsourcing method based on cloud computing

The invention discloses a homomorphic encryption matrix continuous multiplication safety outsourcing method based on cloud computing, and belongs to the technical field of homomorphic encryption. Themethod comprises the following steps that: encryption is performed at a client, encoding and encrypting is carried out on a matrix and the matrix is uploaded to a cloud server; the cloud server executes homomorphic calculation, carries out ciphertext matrix continuous multiplication operation under the condition that decryption is not carried out, and returns a calculation result to the client side in a ciphertext form; and finally, the client executes a decryption module to obtain a value of matrix continuous multiplication. The matrix continuous multiplication calculation task can be outsourced to the cloud server under the condition that matrix elements, namely client private data, are not leaked, so that the security of client data is protected, and the calculation amount of the clientis reduced. The matrix is encoded into a ciphertext for operation, so that the space complexity is remarkably reduced, the ciphertext operation frequency is reduced, and the purpose of improving theefficiency is achieved.
Owner:ZHEJIANG SCI-TECH UNIV

Error compensation method of absolute code disc in matrix encoding manner

ActiveCN104655156AImprove bit error handling capabilityIncrease the counting circuit structureMitigation of undesired influencesFour quadrantsAutomatic control
The invention provides an error compensation method of an absolute code disc in a matrix encoding manner, and relates to the fields of photoelectric measurement and automatic control. The error compensation method disclosed by the invention solves the problem that the absolute code disc is insufficient in the capability of processing error codes. The error compensation method comprises the following steps: 1, reading a corresponding code value by utilizing a four-quadrant absolute code disc; 2, adopting a reading head of which the outermost circle has a difference of 90 degrees, and reading a value of an incremental code disc through a processing circuit of the incremental code disc; 3, setting a threshold, and calculating the difference of the two code values; 4, replacing the absolute code value exceeding the preset threshold with the corresponding incremental code value. According to the error compensation method disclosed by the invention, a real-time detection method is adopted, the original structure of the matrix encoding disc is utilized, and only a counting circuit structure of the incremental code disc is additionally added, so that the jump variation of the code value due to various factors can be compensated, the advantages of an absolute manner and an incremental manner are merged, the contradiction of the decoding of high code values and the size of the code disc is solved in a certain extent, and the added circuit is simple and reliable, and is convenient to maintain.
Owner:严格集团股份有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products