CN115955569A - Monitoring video data transmission method for animal quarantine center - Google Patents
Monitoring video data transmission method for animal quarantine center Download PDFInfo
- Publication number
- CN115955569A CN115955569A CN202310237684.6A CN202310237684A CN115955569A CN 115955569 A CN115955569 A CN 115955569A CN 202310237684 A CN202310237684 A CN 202310237684A CN 115955569 A CN115955569 A CN 115955569A
- Authority
- CN
- China
- Prior art keywords
- sequence
- coded
- pixel
- pixel value
- run
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02A—TECHNOLOGIES FOR ADAPTATION TO CLIMATE CHANGE
- Y02A40/00—Adaptation technologies in agriculture, forestry, livestock or agroalimentary production
- Y02A40/70—Adaptation technologies in agriculture, forestry, livestock or agroalimentary production in livestock or poultry
Abstract
The invention relates to the technical field of video coding compression, in particular to a monitoring video data transmission method for an animal quarantine center, which comprises the following steps: acquiring a first pixel value sequence and a second run length sequence according to a key frame in a monitoring video of an animal quarantine center; updating the first pixel value sequence and the second run length sequence to further obtain a suffix code of the run length and a suffix code of the pixel value; acquiring a sequence to be coded, coding one or more elements in the sequence to be coded according to the suffix code of the run length and the suffix code of the pixel value to obtain a code word of the element to be coded or the pixel string to be coded, acquiring a compressed frame according to the code word, and transmitting the compressed frame. The invention has high compression efficiency and ensures that the monitoring video data of the animal quarantine center can be quickly transmitted.
Description
Technical Field
The invention relates to the technical field of video coding compression, in particular to a monitoring video data transmission method for an animal quarantine center.
Background
The animal quarantine center undertakes the related works such as national animal epidemic situation analysis and treatment, major animal epidemic disease prevention and control, livestock and poultry product scrambling safety detection and the like, and in order to ensure the work traceability of the animal quarantine center, the monitoring videos of all units of the animal quarantine center need to be transmitted to a special server for storage.
The existing video compression algorithm divides a video into key frames and predictive coding frames according to the inter-frame redundancy characteristic to realize the compression of the video. Since the key frame is a complete image, the key frame can be compressed separately to achieve further compression of the video. Local pixel points in the key frame have similarity, so the run length of pixel values in the key frame is longer.
The existing compression method such as LZ coding allocates different suffix codes to different characters in data, and codes the existing segment number and the suffix of the character in a coding dictionary to form a code word of one character or a plurality of characters in the data in a mode of constructing the coding dictionary while coding, thereby realizing the compression of the data. However, LZ encoding is not suitable for encoding strings with longer runs, and a long run of strings may be encoded into a plurality of codewords. The compression of key frames using LZ encoding is inefficient.
Disclosure of Invention
The invention provides a monitoring video data transmission method for an animal quarantine center, which aims to solve the existing problems.
The invention relates to a monitoring video data transmission method for an animal quarantine center, which adopts the following technical scheme:
one embodiment of the invention provides a monitoring video data transmission method for an animal quarantine center, which comprises the following steps:
acquiring a first pixel value sequence and a second run length sequence according to a key frame in a monitoring video of an animal quarantine center; updating the first pixel value sequence and the second run-length sequence according to the first pixel value sequence and the second run-length sequence; acquiring suffix codes of each run length and each pixel value according to the first pixel value sequence and the second run length sequence; acquiring a single pixel value and a pixel group in a first pixel value sequence according to the first run length sequence to form a sequence to be coded;
constructing an empty coding dictionary; taking a first element in a sequence to be coded as an element to be coded, and carrying out coding operation according to the element to be coded, wherein the coding operation comprises the following steps:
s1: when the element to be coded does not exist in the coding dictionary, obtaining a code word of the element to be coded according to the pixel value and the suffix code of the run length; adding an element to be coded and a code word of the element to be coded into a coding dictionary; taking the next element of the element to be coded in the sequence to be coded as a new element to be coded;
s2: when the element to be coded exists in the coding dictionary, taking the element to be coded as a prefix; and judging the next element of the prefix in the sequence to be coded, wherein the judgment comprises the following steps:
s201: when the next element of the prefix in the sequence to be coded is a pixel group, acquiring a code word of the prefix; adding the prefix and the code word of the prefix into a coding dictionary; taking the next element of the prefix in the sequence to be coded as a new element to be coded;
s202: when the next element of the prefix in the sequence to be coded is a single pixel value, taking the next element of the prefix in the sequence to be coded as a suffix, and taking a pixel string formed by splicing the prefix and the suffix as a pixel string to be coded; judging the pixel string to be encoded to obtain a new element to be encoded;
s3: repeating the encoding operation according to the new element to be encoded until all elements in the sequence to be encoded are traversed, and stopping iteration;
taking a sequence formed by binary strings corresponding to all code words in the coding dictionary as a compression frame; the compressed frame is transmitted.
Preferably, the step of obtaining the first pixel value sequence and the second run-length sequence according to the key frame in the monitoring video of the animal quarantine center includes the following specific steps:
acquiring a key frame in a monitoring video of an animal quarantine center, and forming a first pixel value sequence by pixel values corresponding to all pixel points on the key frame; running statistics is carried out on pixel values in the first pixel value sequence from a first pixel value in the first pixel value sequence to obtain a first run length sequence; and deleting all 1 s and all 2 s in the first run-length sequence to obtain a second run-length sequence.
Preferably, the updating the first pixel value sequence and the second run-length sequence according to the first pixel value sequence and the second run-length sequence includes the following specific steps:
recording the number of the types of the run lengths in the second run length sequence as N, and recording the number of the types of the pixel values in the first pixel value sequence as M;
when M + N + 1-straw 256 and 0 is not in the first sequence of pixel values, the first sequence of pixel values and the second sequence of runlengths need not be updated; when the M + N + 1-woven fabric is 256 and 0 is in the first pixel value sequence, the second run-length sequence is not required to be updated, the pixel values of all pixel points with the pixel values of 0 in the key frame are adjusted to be 1, and the first pixel value sequence is obtained again;
when M + N +1 is more than or equal to 256, if 0 is in the first pixel value sequence, adjusting the pixel values of all pixel points with pixel values of 0 in the key frame to be 1; if 0 is not in the first sequence of pixel values, then no adjustment is made to the key frame; drawing a pixel value histogram according to the frequency of each pixel value in a key frame, when the frequency of one pixel value in the pixel value histogram is smaller than a preset threshold value and a pixel value with the frequency larger than the frequency of the pixel value exists in the range of 10 adjacent pixel values, acquiring the pixel value which is closest to the pixel value in the pixel value histogram and has the frequency larger than the pixel value as a combined pixel value corresponding to the pixel value, and modifying the pixel value of a pixel point corresponding to the pixel value in the key frame into the combined pixel value; re-acquiring the first pixel value sequence according to the modified key frame; when the pixel value type number M of the updated first pixel value sequence meets the condition of M + N + 1-straw 256, the second run-length sequence does not need to be updated; when the pixel value number M of the updated first pixel value sequence does not satisfy the condition of M + N +1 stra 256, counting the frequency of each run length in the second run length sequence, obtaining (M + N-255) run lengths with the minimum frequency as split run lengths, splitting each split run length into other run lengths in two second run length sequences, and updating the second run length sequences according to the split result.
Preferably, the obtaining of the suffix code of each run length and the suffix code of each pixel value according to the first pixel value sequence and the second run length sequence includes the following specific steps:
obtaining all integers within the range of (0,255) but not belonging to the first sequence of pixel values, forming a second sequence of pixel values, selecting a pixel value for each run length in the second sequence of run lengths that is not randomly replaced in the second sequence of pixel values, converting the selected pixel value to an eight-bit binary number as a suffix code for the corresponding run length, and encoding the 8-bit binary number for each pixel value occurring in the first sequence of pixel values as a suffix for each pixel value.
Preferably, the obtaining of the single pixel value and the pixel group in the first pixel value sequence according to the first run-length sequence to form the sequence to be encoded includes the following steps:
and dividing a plurality of corresponding same pixel values in the first pixel value sequence into a pixel group according to each run length in the second run length sequence, and forming a sequence to be coded by all the pixel groups and all the single pixel values which are not divided into the pixel groups.
Preferably, when the element to be coded does not exist in the coding dictionary, the method for obtaining the code word of the element to be coded according to the pixel value and the suffix coding of the run length includes the following specific steps:
when the element to be coded does not exist in the coding dictionary and the element to be coded is a single pixel value, coding 0 and a suffix of the element to be coded to form a code word of the element to be coded; and when the element to be coded does not exist in the coding dictionary and the element to be coded is a pixel group, coding suffixes of pixel values in the pixel group and suffixes of run lengths corresponding to the pixel group to form a code word of the element to be coded.
Preferably, when the next element of the prefix in the sequence to be encoded is a pixel group, acquiring the codeword of the prefix includes the following specific steps:
and combining the segment number of the prefix in the coding dictionary with 0 to form a prefix code word, wherein the segment number is the row number of the prefix in the coding dictionary.
Preferably, the determining operation of the pixel string to be encoded to obtain a new element to be encoded includes the following specific steps:
when the pixel string to be coded does not exist in the coding dictionary, the segment number of the prefix in the coding dictionary and the suffix of the suffix are coded to form a code word of the pixel string to be coded; adding the pixel strings to be coded and the code words of the pixel strings to be coded into a coding dictionary; taking the next element of the suffix in the sequence to be coded as a new element to be coded;
and when the pixel string to be coded exists in the coding dictionary, the pixel string to be coded is used as a new prefix, the judgment operation of the suffix in the next element of the sequence to be coded is repeated, and the iteration is stopped until the new element to be coded is obtained or the suffix is the last element of the sequence to be coded.
Preferably, the step of using a sequence formed by binary strings corresponding to all code words in the coding dictionary as a compression frame includes the following specific steps:
and splicing binary numbers corresponding to the contents of the two parts of each code word in the coding dictionary into a binary string, and taking a sequence formed by the binary strings corresponding to all the code words as a compression frame.
The technical scheme of the invention has the beneficial effects that: the invention improves the LZ coding by combining the run length, allocates suffix coding for the run length in the second run length sequence according to the type of the pixel value in the key frame, ensures that the suffix coding of each run length is consistent with the length of the suffix coding of the pixel value but different in content, reduces the number of obtained code words when the key frame is compressed by combining the suffix coding of the run length, and does not increase the length of the code words, thereby improving the compression efficiency; and as the number of the code words obtained by coding is reduced, the number of lines in the coding dictionary is reduced, and the content of the first part in all the code words is further smaller, so that the length of the first part in the code words after being converted into binary numbers is reduced, namely the length of the binary string corresponding to the finally obtained code words is reduced, thereby further improving the compression efficiency and ensuring that the monitoring video data of the animal quarantine center can be quickly transmitted.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the embodiments or the prior art descriptions will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present invention, and other drawings can be obtained by those skilled in the art without creative efforts.
FIG. 1 is a flow chart illustrating the steps of a surveillance video data transmission method for an animal quarantine center according to the present invention;
FIG. 2 is a diagram of a run-length dictionary according to an embodiment of the present invention;
FIG. 3 is a diagram of a first encoding dictionary according to an embodiment of the present invention;
FIG. 4 is a diagram of a second encoding dictionary provided by an embodiment of LZ encoding.
Detailed Description
To further illustrate the technical means and effects of the present invention adopted to achieve the predetermined objects, the following detailed description, the structure, the features and the effects of the method for transmitting surveillance video data for animal quarantine centers according to the present invention will be provided with reference to the accompanying drawings and the preferred embodiments. In the following description, different "one embodiment" or "another embodiment" refers to not necessarily the same embodiment. Furthermore, the particular features, structures, or characteristics may be combined in any suitable manner in one or more embodiments.
Unless defined otherwise, all technical and scientific terms used herein have the same meaning as commonly understood by one of ordinary skill in the art to which this invention belongs.
The following describes a specific scheme of the monitoring video data transmission method for the animal quarantine center in detail with reference to the accompanying drawings.
Referring to fig. 1, a flow chart of steps of a monitoring video data transmission method for an animal quarantine center according to an embodiment of the present invention is shown, where the method includes the following steps:
s001, acquiring a key frame in a monitoring video of an animal quarantine center.
It should be noted that the video is divided into a plurality of groups of pictures, and each group of pictures contains a key frame and a plurality of predictive coding frames. The predictive coding frame is the difference between the image of the current frame and the key frame or the previous and the next frames, and due to the spatial redundancy of the video, the difference between the adjacent frames in the video or the image frames in one image group is very small, so that most positions in the predictive coding frame are 0, and the numerical values of the rest positions are also small, and the compression of the predictive coding frame is realized. The embodiment of the invention compresses the key frame aiming at the fact that the key frame is a complete image. The embodiment of the invention aims at that the key frame is a gray image, and if the key frame is a color image, the image of each channel of the key frame is respectively regarded as a gray image to be compressed.
In the embodiment of the invention, the monitoring video shot by the camera deployed in the animal quarantine center is obtained, and the key frame of the monitoring video is obtained.
S002, acquiring a first run length sequence of the key frame, and setting a run length dictionary according to the first run length sequence.
It should be noted that LZ encoding assigns different suffix codes to different characters in data, and encodes an existing segment number and a suffix of a character in a coding dictionary to form a codeword of one or more characters in data by a method of constructing the coding dictionary while encoding, thereby implementing data compression. However, the key frame is a complete image, and the local pixel points in the key frame have similarity, so that the run length of the pixel values in the key frame is longer. If the key frame is compressed by LZ encoding, a plurality of pixel values corresponding to a longer run will be compressed into a plurality of parts, for example, the run length of 3,3,3,3,3,3,3,3,3,3 is 10, but if the key frame is compressed by LZ encoding, the key frame will be encoded into a code word by {3}, {3,3}, {3,3,3}, and {3,3,3,3}, respectively, which is inefficient in compression. To further improve the compression efficiency of LZ encoding, embodiments of the present invention improve LZ encoding in conjunction with runs.
In the embodiment of the invention, firstly, a key frame is scanned by using a first scanning mode, pixel values corresponding to pixel points at each scanning position are sequentially obtained, and all the obtained pixel values form a first pixel value sequence. In the embodiment of the present invention, the first scanning manner includes, but is not limited to, hilbert scanning and raster scanning, and in other embodiments, the implementer may set the first scanning manner as needed.
Starting from the first pixel value in the first pixel value sequence, run statistics is performed on the pixel values in the first pixel value sequence, and all the obtained run lengths are combined into a first run length sequence, for example, if the first pixel value sequence is {65,65,65,126,47,47,47,47,45,45,46,65,65,65,43}, the first run length sequence is {3,1,4,2,1,3,1}.
It should be noted that the pixel value with the run length of 1 is encoded into a code word when compressed by LZ encoding or encoded into a code word together with other pixel values, and at this time, the compression efficiency is maximized, and the run length is not needed for compression. When the pixel value with the run length of 2 is compressed by using LZ coding, the pixel value can be coded into two code words together with other pixel values, and at the moment, the pixel value is compressed by combining the run length, so that the compression efficiency is not greatly improved.
In the embodiment of the present invention, all 1 s and all 2 s in the first run-length sequence are deleted as the second run-length sequence. For example, the first run-length sequence is {3,1,4,2,1,3,1} and the second run-length sequence after all 1's and 2's are deleted is {3,4,3}. And taking all the same run lengths in the second run length sequence as a run length, and counting the number N of the types of the run lengths in the second run length sequence. And taking all the same pixel values as one pixel value, and counting the number M of the types of the pixel values in the first pixel value sequence.
It should be noted that, in order to improve the compression rate of LZ encoding in conjunction with runs, a suffix encoding may be assigned to each run length, and in the course of performing compression, a suffix encoding of a character and a suffix encoding of a run length are used to encode codewords of a plurality of characters constituting the run length, so that a plurality of characters corresponding to a longer run are compressed into one result, thereby improving the compression rate of LZ encoding. When an image is compressed by using LZ encoding, each pixel value in the image is regarded as a character to be compressed, and a suffix allocated to each different character (i.e., each pixel value) is encoded as a result of converting each pixel value into a fixed-length binary number. Since the key frame is a complete image, and the value range of the pixel value of each pixel point in the key frame is [0,255], the length of the suffix code of each pixel value in the key frame is eight-bit binary number, and the suffix code of each pixel value is one of 00000000, 00000001, 00000010, and. To ensure that decompression can be successful subsequently, the length of the suffix code assigned to each run length needs to be the same as the length of the suffix code of the pixel value, and the content of the suffix code assigned to each run length is different from the content of the suffix code of the pixel value. Since there is no 8-bit binary number other than 00000000, 00000001, 00000010,.. 11111111, the length of the suffix code for each pixel value in the key frame needs to be increased to ensure that the length of the suffix code for each run-length assignment is the same as the length of the suffix code for the pixel value and that the content of the suffix code for each run-length assignment is different from the content of the suffix code for the pixel value. However, this method tends to increase the length of the finally obtained codeword, so that the compression efficiency becomes low. Therefore, the embodiment of the invention combines the pixel values which do not appear in the key frame or the pixel values with very small occurrence frequency to allocate the suffix code with the length of 8 bits for each run length, so that the length of the finally obtained code word cannot be increased, thereby ensuring the compression efficiency.
In the embodiment of the present invention, a specific method for assigning suffix codes to each run length is as follows:
the number of classes of run lengths is N and the number of classes of pixel values is M.
When M + N +1 s 256 are formed, the number of types of pixel values not present in the key frame is greater than or equal to the number of types of runlengths, and all integers within the range of (0,255) but not belonging to the first sequence of pixel values are obtained to form a second sequence of pixel values, the pixel values in the second sequence of pixel values being the pixel values not present in the key frame, selecting a pixel value for each of the runlengths in the second sequence of runlengths that is not randomly replaced in the second sequence of pixel values, converting the selected pixel value to an eight-bit binary number as a suffix code for the corresponding runlength, encoding all of the runlengths in the second sequence of runlengths and their corresponding suffixes to form a dictionary runlength, the schematic diagram of a run-length dictionary provided in the embodiment of the present invention is shown in fig. 2, where fig. 2 is a run-length dictionary corresponding to a first pixel value sequence of {65,65,65,126,47,47,47,47,45,45,46,65,65,65,43} and a second run-length sequence of {3,4,3}. When 0 is not in the first sequence of pixel values, no adjustment is made to the key frame.
When M + N +1 is more than or equal to 256, the number of the types of the pixel values which do not appear in the key frame is less than the number of the types of the run lengths, and at this time, 8-bit suffix coding cannot be allocated to all the run lengths, so that the pixel values in the key frame need to be adjusted, the number of the types of the pixel values which do not appear in the key frame is increased, and 8-bit suffix coding is allocated to all the run lengths. The specific steps of adjusting the pixel values in the key frame are as follows:
and when 0 is in the first pixel value sequence, adjusting the pixel values of all the pixel points with the pixel values of 0 in the key frame to be 1. When 0 is not in the first sequence of pixel values, then no adjustment is made to the key frame at this time. Drawing a pixel value histogram according to the frequency of each pixel value in a key frame, when the frequency of one pixel value in the pixel value histogram is smaller than a preset threshold value and a pixel value with the frequency larger than the frequency of the pixel value exists in the range of 10 adjacent pixel values, acquiring the pixel value which is closest to the pixel value in the pixel value histogram and has the frequency larger than the pixel value as a combined pixel value corresponding to the pixel value, and modifying the pixel value of a pixel point corresponding to the pixel value in the key frame into the combined pixel value, wherein the range of 10 adjacent pixel values refers to 5 pixel values on the left side and 5 pixel values on the right side of the pixel value in the pixel value histogram. And similarly, modifying all the pixel values meeting the conditions in the key frame into the corresponding merged pixel values. And reacquires the first sequence of pixel values based on the modified keyframe. In the embodiment of the present invention, the preset threshold is 0.00005, and in other embodiments, the implementer may set the preset threshold as needed.
It should be noted that, when the embodiment of the present invention adjusts the key frame, the frequency of the pixel values and the distance between the pixel values are combined, so that the pixel values of only a few pixel points in the key frame are ensured to be adjusted, and the adjustment amplitude of the pixel values in the key frame is ensured to be very small, so that the difference between the key frame after adjustment and the key frame before adjustment is very small, and visual loss can be ensured.
When the pixel value type number M of the first pixel value sequence meets the condition of M + N +1< -256 >, a run length dictionary is obtained; when the number M of pixel value types of the first pixel value sequence does not satisfy the condition of M + N +1< -256 >, the second run-length sequence is adjusted, the frequency of each run-length in the second run-length sequence is counted, the (M + N-255) run-lengths with the smallest frequency are obtained as split run-lengths, and when each split run-length is split into the other run-lengths in two second run-length sequences, the run-length 10 is split into the run- lengths 5 and 5, for example. It should be noted that, when the split run length cannot be split into other run lengths in the two second run length sequences, the split run length is split into other run lengths in the two first run length sequences. And updating the second run-length sequence according to the splitting result, and rejecting all 1 s and all 2 s in the second run-length sequence. At this time, the finally obtained variety number N of the run lengths in the second run length sequence and the pixel value variety number M of the first pixel value sequence satisfy the condition of M + N + 1-straw 256, and at this time, a run length dictionary is obtained.
Thus, a run-length dictionary is obtained.
It should be noted that, in the embodiment of the present invention, by combining the types of the pixel values in the key frame, suffix codes are allocated to the run lengths in the second run length sequence, so as to construct a run length dictionary, and it is ensured that the suffix codes of each run length in the run length dictionary have the same length but different content from the suffix codes of the pixel values, so that when the key frame is compressed by subsequently combining the suffix codes of the run lengths, the number of obtained code words is reduced, and the code word length is not increased, thereby ensuring the compression efficiency.
And S003, compressing the key frame according to the run length dictionary to obtain a compressed frame.
The key frame adjusted in step S002 is compressed. The specific method for compressing the key frame comprises the following steps:
each pixel value occurring in the first sequence of pixel values is first assigned a suffix code, and an 8-bit binary number of each pixel value occurring in the first sequence of pixel values is used as a suffix code for that pixel value.
And constructing an empty coding dictionary, wherein the coding dictionary comprises three columns which are respectively a segment number, a pixel string and a code word, the segment number is used for recording the line number of the coding dictionary, the pixel string is used for recording the content coded by the current line, and the code word is used for recording the result coded by the current line.
Each run length in the second run length sequence corresponds to a plurality of identical pixel values in the first pixel value sequence, and the plurality of identical pixel values in the first pixel value sequence are divided into a pixel group according to each run length in the second run length sequence. And all the pixel values which are not divided into pixel groups and all the pixel groups form a sequence to be coded according to the sequence of the pixel values in the first pixel value sequence. For example, the second run length sequence is {3,4,3}, the first pixel value sequence is {65,65,65,126,47,47,47,47,45,45,46,65,65,65,43}, then 65,65,65 is divided into a pixel group, 47,47,47,47 is divided into a pixel group, 65,65,65 is divided into a pixel group, and the sequence to be encoded is { (65,65,65), 126, (47,47,47,47), 45,45,46, (65,65,65), 43}.
Taking a first element in a sequence to be coded as an element to be coded, and carrying out coding operation according to the element to be coded:
1. when the element to be encoded does not exist in the pixel series of the encoding dictionary, a row is inserted at the end of the encoding dictionary, the element to be encoded is filled into the pixel series of the inserted row, and the row number of the row is filled into the segment number column, for example, the row number of the ith row is i, and the segment number of the corresponding row is i. When the element to be coded is a single pixel value, 0 and the suffix of the element to be coded are coded to form a code word of the element to be coded, the code word of the element to be coded is filled into a code word column of a row where the element to be coded is located in a coding dictionary, for example, when the element to be coded is 126, the suffix of the element to be coded is coded as 01111110, and the code word is (0,01111110); when the element to be encoded is a pixel group, the suffix of the pixel value in the pixel group is encoded and the suffix of the run length corresponding to the pixel group is encoded to form a code word of the element to be encoded, and the code word of the element to be encoded is filled into a code word column of the row of the element to be encoded in the encoding dictionary, for example, when the element to be encoded is 65,65,65, the run length is 3, the suffix of the pixel value 65 is encoded as 01000001, and if the suffix of the run length 3 is encoded as 10000000, the code word is (01000001,10000000). And taking the next element of the element to be coded in the sequence to be coded as a new element to be coded.
2. When the element to be coded exists in the pixel string of the coding dictionary, the element to be coded is taken as a prefix P. And judging the next element of the prefix P in the sequence to be coded, wherein the judgment comprises the following steps:
2.1, when the next element of the prefix P in the sequence to be coded is a pixel group, inserting a row at the end of the coding dictionary, filling the prefix P into the pixel string of the inserted row, filling the row number of the row into the segment number column, forming a codeword of the prefix P by the segment number corresponding to the prefix P in the coding dictionary and 0, and filling the codeword into the coding dictionary, for example, the prefix P is 65,65,65, and assuming that 65,65,65 exists in the coding dictionary and the segment number is 1, the codeword is (1,0). Taking the next element of the prefix P in the sequence to be coded as a new element to be coded;
2.2, when the next element of the prefix P in the sequence to be coded is a single pixel value, taking the next element of the prefix P in the sequence to be coded as a suffix C, taking a pixel string formed by splicing the prefix P and the suffix C as a pixel string to be coded, and judging whether the pixel string to be coded exists in a pixel string of the coding dictionary or not:
when the pixel string to be coded does not exist in the pixel string of the coding dictionary, inserting a row at the end of the coding dictionary, filling the pixel string to be coded into the pixel string of the inserted row, filling the row number of the row into a segment number column, coding a segment number corresponding to the coding dictionary by a prefix P and a suffix of a suffix C to form a code word of the pixel string to be coded, and filling the code word into the coding dictionary, wherein for example, the prefix P is 65,65,65, the suffix C is 43, and the suffix of the suffix C is 00101011, and if 65,65,65 already exists in the coding dictionary and the segment number is 1, the code word is (1,00101011); taking the next element of the suffix C in the sequence to be coded as a new element to be coded;
and when the pixel string to be coded exists in the pixel string of the coding dictionary, taking the pixel string to be coded as a new prefix P, and repeatedly judging the next element of the suffix C in the sequence to be coded until a new element to be coded is obtained or the suffix is the last element in the sequence to be coded.
3. And repeating the encoding operation according to the new element to be encoded until the iteration is stopped when all elements in the sequence to be encoded have traversed.
Referring to fig. 3, fig. 3 shows a first pixel value sequence {65,65,65,126,47,47,47,47,45,45,46,65,65,65,43}, a second run-length sequence {3,4,3}, and a corresponding code dictionary when the run-length dictionary is shown in fig. 2.
If LZ encoding is applied to the first sequence of pixel values {65,65,65,126,47,47,47,47,45,45,46,65,65,65,43}, the resulting encoding dictionary is shown in fig. 4. As can be seen from fig. 3 and 4, the number of lines of the finally obtained coding dictionary is small, the number of corresponding code words is small, and the compression efficiency is higher than that of LZ coding.
Each code word in the finally obtained coding dictionary is divided into two parts, the first part is suffix coding of 0 or segment number or pixel value, and the second part is suffix coding of pixel value or suffix coding of 0 or run. The content of the first part of all the code words is uniformly converted into fixed-length binary numbers, the length L of the fixed-length binary numbers depends on the maximum value B in the content of the first part of all the code words (the suffix code of the pixel value in the first part can be converted into decimal number to be compared with other values in the first part so as to screen the maximum value B, and the maximum value B is decimal number),
wherein
Is an up value symbol. And uniformly converting the contents of the second parts of all the code words into 8-bit binary numbers. And splicing the fixed-length binary number of the first part of each code word and the 8-bit binary number of the second part of each code word together to obtain a binary string as an encoding result of the pixel string corresponding to the code word. And the coding results of all pixel strings in the coding dictionary form a one-dimensional sequence in sequence, and the sequence is recorded as a compressed frame. The compressed frame is the result of compressing the key frame.
At this point, a compressed frame is obtained.
It should be noted that, in the embodiment of the present invention, a key frame is compressed by combining run length and LZ encoding, and a suffix encoding with a certain length is allocated to a run length, so that the length of the second part of content of an obtained codeword is ensured to be consistent with the length of the second part of content of a codeword obtained by only LZ encoding. And as the number of the code words is reduced, the segment numbers in the coding dictionary are reduced, and the maximum value in the contents of the first part in all the code words is further reduced, so that the length of the contents of the first part in the code words after being converted into binary numbers is reduced, namely the length of the finally obtained coding result of the pixel string is reduced, and the compression efficiency is further improved.
And S004, acquiring and transmitting the compressed data, and decompressing the compressed data.
And transmitting the compressed frame and the predictive coding frame in the monitoring video as compressed data to a storage server for storage, and transmitting the run length dictionary to the storage server for storage in order to ensure decompression. When decompression is needed, firstly, the compressed frames in the compressed data are decompressed. The specific decompression process is as follows:
the compressed frame is a result of compressing the key frame, the compressed frame is a one-dimensional sequence, each element in the compressed frame is a coding result, and each coding result corresponds to a pixel string. The length of each coding result is equal, and the length of the coding result is marked as C. And splitting each coding result into two parts, wherein the first part is a result of converting the front (C-8) bit binary number in the coding result into a decimal number, and the second part is a rear 8 bit binary number in the coding result. And forming a code word by the first part and the second part of each coding result, and forming all the code words into a code word sequence.
And acquiring the number T of code words in the compressed frame. And constructing a coding dictionary, wherein the coding dictionary comprises three columns which are respectively a segment number, a pixel string and a code word, the coding dictionary comprises T rows, the segment number of each row is respectively the row number of the row, and the code word of each row is respectively each code word in a code word sequence.
Decoding each codeword in turn, the specific steps comprising:
and when the second part of the code word is in the run-length dictionary, the second part of the code word is subjected to postfix coding of the run length, the first part of the code word is a pixel value, the corresponding run length S of the second part of the code word in the run-length dictionary is obtained, and a pixel string is obtained according to the pixel value and the run length S. If the pixel value is 2 and the run length S =4, the pixel string is 2,2,2,2. The pixel string is the decoding result of the code word, and the pixel string is filled into the pixel string of the row of the code word in the coding dictionary.
And when the second part of the code word is not in the run-length dictionary and is not 00000000, the second part of the code word is suffix coding of the pixel value, the suffix coding is converted into a decimal number to obtain the pixel value, and when the first part of the code word is not 0, the first part of the code word is a segment number, and the pixel string in the row corresponding to the segment number in the coding dictionary is obtained. And splicing the obtained pixel value with the pixel string to obtain a new pixel string, wherein the new pixel string is a decoding result of the code word, and the new pixel string is filled into the pixel string of the row of the code word in the coding dictionary.
When the second part of the codeword is not in the run length dictionary and is not 00000000, the second part of the codeword is a suffix code of the pixel values, which is converted to a decimal number to obtain the pixel values when the first part of the codeword is 0. The pixel value corresponding to the second part of the code word is the decoding result of the code word, and the pixel value is filled into the pixel string of the row of the code word in the coding dictionary.
When the second part of the code word is 00000000, the first part of the code word is a segment number, and a pixel string in a row corresponding to the segment number in the coding dictionary is obtained, and the pixel string is a decoding result of the code word. And filling the pixel string into the pixel string of the row of the code word in the coding dictionary.
And splicing the contents of the pixel string column in the finally obtained coding dictionary according to the sequence of the contents in the coding dictionary to obtain a one-dimensional pixel value sequence. The one-dimensional sequence of pixel values is the pixel values in the key frame.
The size of the key frame is the same as that of the predictive coding frame, so that a two-dimensional matrix which is the same as the predictive coding frame in size and is empty is constructed, the two-dimensional matrix is scanned by utilizing a first scanning mode, each pixel value in the pixel value sequence is sequentially filled into each scanning position of the two-dimensional matrix, and the finally obtained filled two-dimensional matrix is the key frame.
And obtaining the monitoring video of the animal quarantine center according to the key frame and the predictive coding frame.
Through the steps, the coding compression and decompression of the monitoring video of the animal quarantine center are completed.
According to the method and the device, the suffix codes are distributed for the run lengths in the second run length sequence by combining the types of the pixel values in the key frame, so that the lengths of the suffix codes of all the run lengths are consistent but the contents of the suffix codes are different, the number of the obtained code words is reduced when the key frame is compressed by combining the suffix codes of the run lengths, the length of the code words cannot be increased, and the compression efficiency is improved; and as the number of the code words obtained by coding is reduced, the number of lines in the coding dictionary is reduced, and the content of the first part in all the code words is further smaller, so that the length of the first part in the code words after being converted into binary numbers is reduced, namely the length of the binary string corresponding to the finally obtained code words is reduced, thereby further improving the compression efficiency and ensuring that the monitoring video data of the animal quarantine center can be quickly transmitted.
The above description is only for the purpose of illustrating the preferred embodiments of the present invention and should not be taken as limiting the scope of the present invention, which is intended to cover any modifications, equivalents, improvements, etc. within the spirit and scope of the present invention.
Claims (9)
1. A monitoring video data transmission method for an animal quarantine center is characterized by comprising the following steps:
acquiring a first pixel value sequence and a second run length sequence according to a key frame in a monitoring video of an animal quarantine center; updating the first pixel value sequence and the second run-length sequence according to the first pixel value sequence and the second run-length sequence; acquiring suffix codes of each run length and each pixel value according to the first pixel value sequence and the second run length sequence; acquiring a single pixel value and a pixel group in a first pixel value sequence according to the first run length sequence to form a sequence to be coded;
constructing an empty coding dictionary; taking a first element in a sequence to be coded as an element to be coded, and carrying out coding operation according to the element to be coded, wherein the coding operation comprises the following steps:
s1: when the element to be coded does not exist in the coding dictionary, obtaining a code word of the element to be coded according to the pixel value and the suffix code of the run length; adding the element to be coded and the code word of the element to be coded into a coding dictionary; taking the next element of the element to be coded in the sequence to be coded as a new element to be coded;
s2: when the element to be coded exists in the coding dictionary, taking the element to be coded as a prefix; the judgment operation is carried out on the next element of the prefix in the sequence to be coded, and comprises the following steps:
s201: when the next element of the prefix in the sequence to be coded is a pixel group, acquiring a code word of the prefix; adding the prefix and the code word of the prefix into a coding dictionary; taking the next element of the prefix in the sequence to be coded as a new element to be coded;
s202: when the next element of the prefix in the sequence to be coded is a single pixel value, taking the next element of the prefix in the sequence to be coded as a suffix, and taking a pixel string formed by splicing the prefix and the suffix as a pixel string to be coded; judging the pixel string to be encoded to obtain a new element to be encoded;
s3: repeating the encoding operation according to the new element to be encoded until all elements in the sequence to be encoded are traversed, and stopping iteration;
taking a sequence formed by binary strings corresponding to all code words in the coding dictionary as a compression frame; the compressed frame is transmitted.
2. The method for transmitting the monitoring video data for the animal quarantine center according to claim 1, wherein the step of obtaining the first pixel value sequence and the second run-length sequence according to the key frame in the monitoring video of the animal quarantine center comprises the following specific steps:
acquiring a key frame in a monitoring video of an animal quarantine center, and forming a first pixel value sequence by pixel values corresponding to all pixel points on the key frame; running statistics is carried out on pixel values in the first pixel value sequence from a first pixel value in the first pixel value sequence to obtain a first run length sequence; and deleting all 1 s and all 2 s in the first run-length sequence to obtain a second run-length sequence.
3. The method of claim 1, wherein the step of updating the first sequence of pixel values and the second sequence of run lengths according to the first sequence of pixel values and the second sequence of run lengths comprises the steps of:
recording the number of the types of the run lengths in the second run length sequence as N, and recording the number of the types of the pixel values in the first pixel value sequence as M;
when M + N + 1-256 and 0 are not in the first sequence of pixel values, the first sequence of pixel values and the second sequence of run lengths need not be updated; when the M + N + 1-woven fabric is 256 and 0 is in the first pixel value sequence, the second run-length sequence is not required to be updated, the pixel values of all pixel points with the pixel values of 0 in the key frame are adjusted to be 1, and the first pixel value sequence is obtained again;
when M + N +1 is more than or equal to 256, if 0 is in the first pixel value sequence, adjusting the pixel values of all pixel points with pixel values of 0 in the key frame to be 1; if 0 is not in the first sequence of pixel values, then no adjustment is made to the key frame; drawing a pixel value histogram according to the frequency of each pixel value in a key frame, when the frequency of one pixel value in the pixel value histogram is smaller than a preset threshold value and a pixel value with the frequency larger than the frequency of the pixel value exists in the range of 10 adjacent pixel values, acquiring the pixel value which is closest to the pixel value in the pixel value histogram and has the frequency larger than the pixel value as a combined pixel value corresponding to the pixel value, and modifying the pixel value of a pixel point corresponding to the pixel value in the key frame into the combined pixel value; re-acquiring the first pixel value sequence according to the modified key frame; when the pixel value type number M of the updated first pixel value sequence satisfies the condition of M + N + 1-256, it is not necessary to update the second run-length sequence; when the pixel value number M of the updated first pixel value sequence does not satisfy the condition of M + N +1 stra 256, counting the frequency of each run length in the second run length sequence, obtaining (M + N-255) run lengths with the minimum frequency as split run lengths, splitting each split run length into other run lengths in two second run length sequences, and updating the second run length sequences according to the split result.
4. The method for transmitting the surveillance video data for the animal quarantine inspection center according to claim 1, wherein the obtaining of the suffix code for each run length and the suffix code for each pixel value according to the first and second run length sequences comprises the following steps:
obtaining all integers within the range of (0,255) but not belonging to the first sequence of pixel values, forming a second sequence of pixel values, selecting a pixel value for each run length in the second sequence of run lengths that is not randomly replaced in the second sequence of pixel values, converting the selected pixel value to an eight-bit binary number as a suffix code for the corresponding run length, and encoding the 8-bit binary number for each pixel value occurring in the first sequence of pixel values as a suffix for each pixel value.
5. The method for transmitting the monitoring video data for the animal quarantine center according to claim 1, wherein the method for acquiring the single pixel value and the pixel group in the first pixel value sequence according to the first run-length sequence to form the sequence to be coded comprises the following specific steps:
and dividing a plurality of corresponding same pixel values in the first pixel value sequence into a pixel group according to each run length in the second run length sequence, and forming a sequence to be coded by all the pixel groups and all the single pixel values which are not divided into the pixel groups.
6. The method for transmitting the surveillance video data for the animal quarantine inspection center according to claim 1, wherein when the element to be coded does not exist in the coding dictionary, the code word of the element to be coded is obtained according to the suffix coding of the pixel value and the run length, and the method comprises the following specific steps:
when the element to be coded does not exist in the coding dictionary and the element to be coded is a single pixel value, coding 0 and a suffix of the element to be coded to form a code word of the element to be coded; and when the element to be coded does not exist in the coding dictionary and the element to be coded is a pixel group, coding suffixes of pixel values in the pixel group and suffixes of run lengths corresponding to the pixel group to form a code word of the element to be coded.
7. The method for transmitting the surveillance video data for the animal quarantine inspection center according to claim 1, wherein the step of obtaining the code word of the prefix when the next element of the prefix in the sequence to be coded is the pixel group comprises the following specific steps:
and combining the segment number of the prefix in the coding dictionary with 0 to form a code word of the prefix, wherein the segment number is the row number of the prefix in the coding dictionary.
8. The method for transmitting the monitoring video data for the animal quarantine inspection center according to claim 1, wherein the operation of judging the pixel string to be encoded to obtain the new element to be encoded comprises the following specific steps:
when the pixel string to be coded does not exist in the coding dictionary, the segment number of the prefix in the coding dictionary and the suffix of the suffix are coded to form a code word of the pixel string to be coded; adding pixel strings to be coded and code words of the pixel strings to be coded into a coding dictionary; taking the next element of the suffix in the sequence to be coded as a new element to be coded;
and when the pixel string to be coded exists in the coding dictionary, the pixel string to be coded is used as a new prefix, the judgment operation of the suffix in the next element of the sequence to be coded is repeated, and the iteration is stopped until the new element to be coded is obtained or the suffix is the last element of the sequence to be coded.
9. The method for transmitting the monitoring video data for the animal quarantine inspection center according to claim 1, wherein the step of using the sequence formed by the binary strings corresponding to all the code words in the coding dictionary as the compressed frame comprises the following specific steps:
and splicing binary numbers corresponding to the contents of the two parts of each code word in the coding dictionary into a binary string, and taking a sequence formed by the binary strings corresponding to all the code words as a compression frame.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310237684.6A CN115955569B (en) | 2023-03-14 | 2023-03-14 | Monitoring video data transmission method for animal epidemic prevention quarantine center |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202310237684.6A CN115955569B (en) | 2023-03-14 | 2023-03-14 | Monitoring video data transmission method for animal epidemic prevention quarantine center |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN115955569A true CN115955569A (en) | 2023-04-11 |
| CN115955569B CN115955569B (en) | 2023-05-23 |
Family
ID=85903325
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202310237684.6A Active CN115955569B (en) | 2023-03-14 | 2023-03-14 | Monitoring video data transmission method for animal epidemic prevention quarantine center |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN115955569B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116320499A (en) * | 2023-04-17 | 2023-06-23 | 吉林省艾优数字科技有限公司 | Communication method and system |
| CN116388769A (en) * | 2023-06-06 | 2023-07-04 | 莱芜职业技术学院 | Computer storage optimization method for environment detection data |
| CN116506629A (en) * | 2023-06-27 | 2023-07-28 | 上海伯镭智能科技有限公司 | Road condition data compression method for mine unmanned mine car cooperative control |
| CN117119120A (en) * | 2023-10-25 | 2023-11-24 | 上海伯镭智能科技有限公司 | Cooperative control method based on multiple unmanned mine cars |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6597812B1 (en) * | 1999-05-28 | 2003-07-22 | Realtime Data, Llc | System and method for lossless data compression and decompression |
| US20100030796A1 (en) * | 2008-07-31 | 2010-02-04 | Microsoft Corporation | Efficient column based data encoding for large-scale data storage |
| JP2010074444A (en) * | 2008-09-17 | 2010-04-02 | Ricoh Co Ltd | Image compression apparatus and method, image decoding apparatus and method, and computer program |
| CN103746706A (en) * | 2014-01-01 | 2014-04-23 | 安庆师范学院 | Testing data compressing and decompressing method on basis of double-run-length alternate coding |
| CN103997651A (en) * | 2014-05-17 | 2014-08-20 | 北京中和卓远科技有限公司 | Data compression method and device for composite images |
| CN112399181A (en) * | 2019-08-19 | 2021-02-23 | 华为技术有限公司 | Image coding and decoding method, device and chip |
| CN114092577A (en) * | 2021-11-05 | 2022-02-25 | 杭州太美星程医药科技有限公司 | Image data processing method, image data processing device, computer equipment and storage medium |
| CN114614833A (en) * | 2022-03-16 | 2022-06-10 | 程一飞 | Test data compression and decompression method for self-adaptive run-length coding |
| CN114614832A (en) * | 2022-03-16 | 2022-06-10 | 吴海峰 | Test data compression and decompression method based on front and back run length coding |
-
2023
- 2023-03-14 CN CN202310237684.6A patent/CN115955569B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6597812B1 (en) * | 1999-05-28 | 2003-07-22 | Realtime Data, Llc | System and method for lossless data compression and decompression |
| US20100030796A1 (en) * | 2008-07-31 | 2010-02-04 | Microsoft Corporation | Efficient column based data encoding for large-scale data storage |
| JP2010074444A (en) * | 2008-09-17 | 2010-04-02 | Ricoh Co Ltd | Image compression apparatus and method, image decoding apparatus and method, and computer program |
| CN103746706A (en) * | 2014-01-01 | 2014-04-23 | 安庆师范学院 | Testing data compressing and decompressing method on basis of double-run-length alternate coding |
| CN103997651A (en) * | 2014-05-17 | 2014-08-20 | 北京中和卓远科技有限公司 | Data compression method and device for composite images |
| CN112399181A (en) * | 2019-08-19 | 2021-02-23 | 华为技术有限公司 | Image coding and decoding method, device and chip |
| CN114092577A (en) * | 2021-11-05 | 2022-02-25 | 杭州太美星程医药科技有限公司 | Image data processing method, image data processing device, computer equipment and storage medium |
| CN114614833A (en) * | 2022-03-16 | 2022-06-10 | 程一飞 | Test data compression and decompression method for self-adaptive run-length coding |
| CN114614832A (en) * | 2022-03-16 | 2022-06-10 | 吴海峰 | Test data compression and decompression method based on front and back run length coding |
Non-Patent Citations (3)
| Title |
|---|
| JIAWEI ZHANG: "Improvement of data compression technology for power dispatching based on run length encoding", PROCEDIA COMPUTER SCIENCE * |
| 叶益群;梁华国;祝沈财;张念;詹凯华;: "分组频率Golomb码测试数据压缩研究", 计算机应用 * |
| 詹文法: "一种混合定变长虚拟块游程编码的测试数据压缩方案", 计算机研究与发展 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN116320499A (en) * | 2023-04-17 | 2023-06-23 | 吉林省艾优数字科技有限公司 | Communication method and system |
| CN116320499B (en) * | 2023-04-17 | 2024-01-09 | 深圳市嘉立方科技有限公司 | Communication method and system |
| CN116388769A (en) * | 2023-06-06 | 2023-07-04 | 莱芜职业技术学院 | Computer storage optimization method for environment detection data |
| CN116388769B (en) * | 2023-06-06 | 2023-12-29 | 莱芜职业技术学院 | Computer storage optimization method for environment detection data |
| CN116506629A (en) * | 2023-06-27 | 2023-07-28 | 上海伯镭智能科技有限公司 | Road condition data compression method for mine unmanned mine car cooperative control |
| CN116506629B (en) * | 2023-06-27 | 2023-08-25 | 上海伯镭智能科技有限公司 | Road condition data compression method for mine unmanned mine car cooperative control |
| CN117119120A (en) * | 2023-10-25 | 2023-11-24 | 上海伯镭智能科技有限公司 | Cooperative control method based on multiple unmanned mine cars |
| CN117119120B (en) * | 2023-10-25 | 2023-12-22 | 上海伯镭智能科技有限公司 | Cooperative control method based on multiple unmanned mine cars |
Also Published As
| Publication number | Publication date |
|---|---|
| CN115955569B (en) | 2023-05-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN115955569B (en) | Monitoring video data transmission method for animal epidemic prevention quarantine center | |
| US7365658B2 (en) | Method and apparatus for lossless run-length data encoding | |
| EP1285399B1 (en) | Enhanced compression of gray-level images | |
| CN1126268C (en) | Method of and device for coding digital information signal | |
| CN101039374B (en) | Image lossless compression method | |
| GB2286942A (en) | Compression of palletized images using reindexing and context modelling | |
| CN116723337B (en) | HDMI high definition data optimized transmission method and system | |
| CN1155221C (en) | Method and system for encoding and decoding method and system | |
| US6614939B1 (en) | Image compression apparatus and decoding apparatus suited to lossless image compression | |
| CN115866287B (en) | Efficient data transmission method for intelligent campus management platform | |
| JP2831888B2 (en) | HDTV decoder | |
| US5594435A (en) | Permutation-based data compression | |
| CN112565749A (en) | Video coding method, device and system and computer readable storage medium | |
| CN1256043A (en) | Lossless image compression with tree coding | |
| KR100636370B1 (en) | Apparatus and method for coding using bit-precision, and apparatus and method for decoding according to the same | |
| Sayood et al. | A differential lossless image compression scheme | |
| Kommey et al. | Lossy codecs for digital image signatures | |
| GB2319689A (en) | An entropy encoder using context modelling with data reordering | |
| CN114463450A (en) | Computer image compression method and system based on artificial intelligence | |
| CN106941610B (en) | Binary ROI mask coding method based on improved block coding | |
| CN113256747B (en) | Bitmap index compression method, bitmap index decompression equipment and bitmap index medium | |
| Liaghati et al. | Improved distance coding of binary images by run length coding of the most probable interval | |
| CN115514967B (en) | Image compression method and image decompression method based on binary block bidirectional coding | |
| Arnaud et al. | Pattern Matching Image Compression with Predication Loop: Preliminary Experimental Results | |
| Bist et al. | IMPROVED IMAGE COMPRESSION USING LOSSLESS HUFFMAN ENCODING (I2COM) |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |