39 results about "Bit blit" patented technology

The invention provides a reversible watermark method based on histogram shifting and has significant practical values for protecting multimedia copyrights. By means of the reversible watermark method, traditional histogram shifting algorithms are improved in two aspects, firstly, 1 and 0 in a bite map are more imbalanced by arranging a generation process of the bit map on watermark embedding rather than in a non-pretreatment stage, so that compression is easier, and embedding capacity is improved; and secondly, the reversible watermark method is a two-step embedding method. The watermark blind extraction is achieved and troubles that the histogram shifting method needs extra side information transmitting are solved by dividing an image into an upper large area and a lower large area, subjecting the upper area to the watermark embedding, embedding the generated side information into the lowest significant bit containing watermark pixels in the area, and embedding the left watermark information and the replaced lowest significant information into the lower area.

The invention relates to a method for hiding running coding of confidential information. The method comprises a process of embedding the confidential information of a sender and a process of extracting the confidential information of a receiver. The figure 1 represents a general flow diagram provided in the invention; the confidential information and carrier data are both taken as bit streams by the sender, that is, each confidential bit can be represented by a series of continuous carrier bits; and after the receiver receives graphics containing the confidential information, the receiver extracts the confidential data according to the secret key shared by the sender and the receiver. The method provided by the invention can be used for hiding the information by taking digital images such as grey, color and the like as carriers, and is an efficient and safe information hiding method.

The invention discloses a low-bit-width HDR image generation method and device, a storage medium and a terminal. The method comprises the steps of determining a to-be-processed high-bit-width HDR image; splitting the HDR image with the high bit width to obtain N frames of split images; performing bit width reduction processing on the split images from the first frame to the Nth frame to obtain N frames of low-bit-width images; and synthesizing the N frames of low-bit-width images to obtain the low-bit-width HDR image. According to the scheme, when the bit width of the data is reduced, the precision loss of the graph is effectively reduced, and a better image processing effect is achieved.

The invention discloses a method for increasing the terminal blacklist capacity and the retrieval speed. The method for increasing the terminal blacklist capacity and the retrieval speed comprises the specific steps: (1) designing a blacklist storage solution, storing a unique identifier UID in a blacklist of a cartoon company in a segmented and cellular way, storing a relatively concentrated blacklist in a bitmap format way, and storing a relatively discrete blacklist in a discrete form way; (2) generating blacklist data according to the storage solution and downloading to an offline terminal; (3) when the offline terminal accepts the transaction of a card, firstly retrieving whether the segment to which the UID belongs has the blacklist, if not, determining that the blacklist does not exist, stopping the retrieving, and continuing to search in the blacklist of the segment if the segment has the blacklist; if the segment of the blacklist is stored in the bitmap format way, finding corresponding bits according to the relative position of the UID in the segment, judging whether the blacklist exists according to 1 or 0 value of the bits, and if the segment of the blacklist is stored in the discrete form way, finding the corresponding offset.

The invention belongs to the technical field of image processing units, and particularly relates to a mask operation method of an explicit independent mask register in a GPU (Graphics Processing Unit), which comprises the following steps: S1, each GPU hardware thread can access respective eight 128-bit wide independent mask registers, and the eight 128-bit wide independent mask registers are recorded as m0-m7; according to the mask operation instruction of the explicit independent mask register in the GPU, each hardware thread in the GPU can access respective eight 128-bit wide independent mask registers, and four groups of mask operation instruction users can use the mask operation instruction to realize reduction operation, extension operation, logic operation and data movement among universal vector registers of the mask register respectively; the instruction can realize the generation of a branch mask in condition control, and meanwhile, the mask value is solved, so that the instruction transmitting process in the programmable core is optimized, invalid operand reading and pipeline operation execution are avoided, and the programmable power consumption is reduced.

The invention discloses a data query and storage method and system. The data storage method comprises the steps that when an agreed event is triggered, a bitmap is read from a storage device, each bitmap is used for storing information that the agreed event is triggered within a period of time, and each bit in the bitmap corresponds to whether the agreed event is triggered or not within an agreedtime; the position of a bit needing to be operated in the bitmap is calculated according to the time when the agreed event is triggered, and the bit of the position in the bitmap is set as a value representing that the agreed event is triggered; and the modified bitmap is written back to the storage device to replace the bitmap before modification.

The invention discloses a convolution operation acceleration method for carrying out weight splitting according to bit precision, and the method comprises the following steps: 1), carrying out the traversal and comparison of each bit of each weight W in a convolution kernel, marking non-zero elements ck * k'and q in all bit data, marking input feature map data FIk * k 'corresponding to the weightWk * k' to which the position belongs, transmitting the marked input feature map data FIk * k 'to FIk * k' and q ', and supplementing the unmarked FIk * k' and q 'with' 0 '; 2) for each bit, accumulating all input data classified and given to the current bit; 3) multiplying the accumulation result under each q bit by 2q; 4) accumulating results obtained by shift calculation again to obtain outputfeature map data FO of the current convolution operation; and iteratively repeating the steps 1) to 4) to generate output feature map data of all convolution channels. According to the invention, theconvolution operation gets rid of the dependence on on-chip DSP resources, and the upper limit of the calculation parallelism degree that the convolution operation can reach is improved.

The invention provides a method for updating a register. The method comprises the following steps: providing a bit mapping register; providing a target register; establishing mapping between each bitin the bit mapping register and a corresponding target content block in the target register; providing a register update instruction, wherein the register update instruction comprises: one or more flag bits at a specified location, each flag bit corresponds to a bit in the bit mapping register, and indicates whether the target content block corresponding to the bit needs to be updated, and for each to-be-updated target content block indicated by the bit, the register update instruction further comprises new content of the target content block or a source of the new content; writing one or moreflag bits in the register update instruction into the bit mapping register; and executing, by an update controller, the register update instruction according to the bit in the bit mapping register toupdate the target content block in the target register, wherein only each to-be-updated target content block indicated by the bit is updated.

The invention relates to a solid state disk mapping table delay updating method and device, computer equipment and a storage medium, and the method comprises the steps: obtaining a user write command, and distributing a temporary mapping table and a corresponding mapping table item bitmap for the write command; allocating an address for the write command, updating a temporary mapping table, setting a corresponding bit in the corresponding mapping table item bitmap, and identifying the corresponding bit as a valid mapping table item; when the system is idle, traversing all the temporary mapping tables and loading mapping pages corresponding to the temporary mapping tables; combining effective mapping table items in a temporary mapping table indicated in the mapping table item bitmap into the loaded mapping table; and releasing the temporary mapping table. In the process of processing the write command, when the system is idle, the mapping page corresponding to the temporary mapping cache is loaded from the NAND and combined to generate the newest mapping table, so that the mapping table is prevented from being loaded in the process of responding to the write command of the host, and the write performance of the system can be effectively improved.

The embodiment of the invention provides a target object determination method and device, and the method comprises the steps: determining an object list containing an initial object, and determining feature data corresponding to a target feature of the initial object from the object list, the feature data corresponding to the target features are processed according to a bitmap algorithm to obtain a data set, the data set comprises the processed feature data, a target threshold value is determined, target bitmap data are determined from the data set according to the target threshold value, and a target object is determined from the initial objects according to the target bitmap data. By using a bitmap algorithm, the feature data is represented by bits, the storage space is reduced, and the calculation efficiency is ensured by using the natural advantage of extremely high bit operation performance of a computer.

The invention discloses a service processing method and device based on a distributed lock, and the method comprises the steps: obtaining the distributed lock during the service processing, wherein the data corresponding to the distributed lock comprises a bitmap, the bitmap comprises a plurality of bits, and each bit corresponds to one resource; and judging whether the numerical value of each resource required by the service on the corresponding bit on the bitmap is a first value or not, if so, updating the numerical value to a second value and then releasing the distributed lock, and if not, directly releasing the distributed lock. According to the invention, the situation of lock waiting during interlocking can be reduced, and the service processing efficiency can be improved.

The invention discloses a snapshot method and device of a storage system, electronic equipment and a readable storage medium. The method comprises the steps that when it is detected that a copy-on-write snapshot is created, a corresponding bitmap is automatically allocated to a source volume; the bits of the bitmap are in one-to-one correspondence with the data blocks of the source volume; when a data write-in request is received, whether copy-on-write needs to be carried out or not is judged according to the flag bit of the bitmap and the data backup failure record information; if copy-on-write needs to be carried out, firstly data in the source volume is copied to the snapshot volume, the bitmap is updated, and then to-be-written data corresponding to the data writing request is written into the source volume; and if the copy-on-write does not need to be carried out, the data to be written is directly written into the source volume. According to the method and the device, data backup can be realized in a copy-on-write snapshot mode on the basis of not influencing the host service.

The invention discloses a block size self-adaptive video steganography method, which comprises the following steps: preprocessing secret information data to be embedded to obtain a secret informationbit string, screening a candidate embedded block from a first coded block according to a transform block segmentation characteristic of the coded block, and expressing a segmentation mark of the candidate embedded block in a bit string form; taking two bits out from the secret information bit string sequence to serve as current secret information to be embedded, and embedding the current secret information to be embedded into the current candidate embedded block transformation segmentation mark bit sequence according to a preset embedding rule; extracting three bits from the remaining transform segmentation bits of the current candidate embedded block to serve as a next embedded carrier; if the number of the remaining bits is not enough, taking the remaining bits from the next candidate embedded block in sequence. According to the processing mode, the application of the carrier video in a secret information extraction scene and a secret information non-extraction scene is guaranteed, video distortion caused by information embedding is reduced to the maximum extent, and the video steganography embedding capacity is improved.

The invention discloses a solid state disk bad block query method and device and a computer readable storage medium. The method comprises the steps that in the running process of the solid state disk, when it is detected that bad blocks exist, bits corresponding to the bad blocks are marked on the basis of nand particle parameters of the solid state disk, and a bit marking result is stored in a bitmap. When the bad block query instruction is received, the bitmap is queried according to the target bad block information in the bad block query instruction, and the query result of the target bad block is obtained, the bad block information can be queried efficiently and accurately, and the SSD performance is improved.

The invention discloses a bit-rate-compatible multivariate LDPC (Low Density Parity Check) code bit-level punching method in the technical field of electronic communication, which comprises the following steps of: acquiring the number of iterations, and performing grouping processing on variable nodes of a binary mirror image matrix according to the number of iterations; according to the method, the bit rate is effectively reduced, the decoding effect is enhanced while the code rate of the multivariate LDPC code is improved, and the method has the advantages that the information recovery error probability of the punching node during decoding is low, the bit rate is low and the like.

The invention discloses a compression method and device of a pixel compensation table. The method comprises the following steps: acquiring a plurality of compensation data from a pixel compensation table; converting each compensation data into a binary code to obtain a plurality of binary codes in one-to-one correspondence with the plurality of compensation data, wherein each binary code comprisesa plurality of bits; splicing the values at the same bit in the plurality of binary codes into a character string to obtain a plurality of character strings; splicing the plurality of character strings into a binary string; and performing quantization coding on the binary string to obtain a compressed pixel compensation table. According to the invention, the compression ratio can be improved, theresource occupation of the pixel compensation table is reduced, the requirement for a hardware system is reduced, and the time consumption of transmission and burning is reduced.

The embodiment of the invention provides an image data processing method and device, equipment and a storage medium. A target preset interval to which the pixel data belongs is determined from a plurality of preset intervals based on the value of the pixel data of the image data, wherein the preset interval represents the value range of the pixel data; different preset intervals correspond to different unit numbers; the number of units corresponding to the target preset interval is a target number of units; and the pixel data is mapped into a bit sequence formed by the target unit number of bit units. The bit unit comprises a preset number of bits; therefore, the specified bits of the bit sequence represent the number of the target units. Pixel data with different values are mapped into a bit sequence comprising different target unit numbers of bit units, so that the number of bits occupied by image data is reduced.

The invention provides a list data storage method and related equipment, and belongs to the technical field of data storage, and the method comprises the following steps: setting the number of bits of bitmaps in each storage area as a preset number; obtaining a digital number of to-be-stored list data; determining a target storage area corresponding to the list data in each storage area; when the number is smaller than or equal to the preset number, determining a target bit corresponding to the number on the bitmap; and setting the value on the target bit as a preset value. According to the method and the device, the numerical number of the list data has the corresponding bit in the bitmap, the value of the bit is set as the preset value to represent that the list data is stored, the bit is one-eighth byte, and the storage space occupied by storing the list data is small; the number of bits of the bitmap in the storage area is set to be the preset number, the preset number is smaller than the maximum number of the bits contained in the storage area, and storage resources occupied by list data storage are further reduced.