CN112565748B - Video coding method, device and system and computer readable storage medium - Google Patents
Video coding method, device and system and computer readable storage medium Download PDFInfo
- Publication number
- CN112565748B CN112565748B CN202011419561.7A CN202011419561A CN112565748B CN 112565748 B CN112565748 B CN 112565748B CN 202011419561 A CN202011419561 A CN 202011419561A CN 112565748 B CN112565748 B CN 112565748B
- Authority
- CN
- China
- Prior art keywords
- occurring
- pixel
- pixels
- frequently
- new
- 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.)
- Active
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
- H04N19/103—Selection of coding mode or of prediction mode
- H04N19/105—Selection of the reference unit for prediction within a chosen coding or prediction mode, e.g. adaptive choice of position and number of pixels used for prediction
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
- H04N19/146—Data rate or code amount at the encoder output
- H04N19/147—Data rate or code amount at the encoder output according to rate distortion criteria
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
- H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
- H04N19/176—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a block, e.g. a macroblock
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
- H04N19/182—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being a pixel
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
The application discloses a video coding method, a device, a system and a computer readable storage medium, wherein the video coding method comprises the following steps: acquiring a new frequently-occurring pixel and a historical frequently-occurring pixel list of a current block; constructing a common pixel list by using the new common pixels and at least part of the common pixels in the historical common pixel list as reusable common pixels; performing prediction classification on pixels in a current block by using a common pixel list, dividing all pixels in the current block into equivalent strings, unit base vector strings and unmatched pixels, and recording the hit times of prediction pixels or equivalent strings of each common pixel in the common pixel list; arranging according to the hit times of each frequently-occurring pixel from large to small to obtain a target frequently-occurring pixel list; and encoding the current block by using the target frequently-occurring pixel list to obtain the code stream of the current block. The method and the device have the advantage that the frequently-occurring pixels with high hit times are arranged in front of the list, so that the coding bit overhead is reduced.
Description
Technical Field
The present application relates to the field of video coding technologies, and in particular, to a video coding method, apparatus, system, and computer-readable storage medium.
Background
The video can be compressed by a video coding technology so as to reduce the data volume of the video, reduce the network bandwidth in the video transmission process and reduce the storage space. Generally, the video coding standard includes intra-frame prediction, inter-frame prediction, transformation, quantization, loop filtering, entropy coding, and other processes to achieve data compression.
The equivalent string level unit base vector string mode in the current SP prediction technology (string matching prediction technology) has the problems that: the fixation of the frequently-occurring pixel list leads the reused frequently-occurring pixels to be arranged in front of the list, and leads the newly frequently-occurring pixels to be arranged behind the list, so that the flexibility is not high. When the number of times of hitting the new frequently-occurring pixels is higher than the number of times of hitting the frequently-occurring pixels repeatedly, the coding bit overhead is large, and the video coding effect is influenced.
Disclosure of Invention
The application provides a video coding method, a video coding device, a video coding system and a computer readable storage medium.
In order to solve the above technical problem, a first technical solution provided by the present application is: there is provided a video encoding method including: acquiring a new frequently-occurring pixel and a historical frequently-occurring pixel list of a current block; constructing a new commonly-occurring pixel list by using the new commonly-occurring pixels and at least part of commonly-occurring pixels in the historical commonly-occurring pixel list as repeatedly-used commonly-occurring pixels; predicting and classifying the pixels in the current block by using the new frequently-occurring pixel list, dividing all the pixels in the current block into an equivalent string, a unit base vector string and an unmatched pixel, and recording the hit times of each frequently-occurring pixel in the new frequently-occurring pixel list for predicting the pixel or the equivalent string; arranging according to the number of times of hit of each frequently-occurring pixel from large to small to obtain a target frequently-occurring pixel list; and encoding the current block by using the target frequently-occurring pixel list to obtain the code stream of the current block.
In order to solve the above technical problem, a second technical solution provided by the present application is: the video coding device comprises a pixel acquisition module, a list construction module, a prediction classification module, an arrangement module and a coding module; the pixel obtaining module is used for obtaining a new frequently-occurring pixel and a historical frequently-occurring pixel list of the current block; the list construction module is used for constructing a new commonly-occurring pixel list by using the new commonly-occurring pixels and at least part of commonly-occurring pixels in the historical commonly-occurring pixel list as reusable commonly-occurring pixels; the prediction classification module is used for performing prediction classification on the pixels in the current block by using the new commonly-occurring pixel list, dividing all the pixels in the current block into an equivalent string, a unit base vector string and an unmatched pixel, and recording the hit frequency of each commonly-occurring pixel in the new commonly-occurring pixel list for predicting the pixel or the equivalent string; the arrangement module is used for arranging according to the hit times of each frequently-occurring pixel from large to small to obtain a target frequently-occurring pixel list; and the encoding module is used for encoding the current block by using the target frequently-occurring pixel list to obtain a code stream of the current block.
In order to solve the above technical problem, a third technical solution provided by the present application is: a video coding and decoding system is provided, which comprises a processor, and a memory connected with the processor, wherein the memory stores program instructions; the processor is configured to execute the program instructions stored by the memory to implement the video encoding method as described above.
In order to solve the above technical problem, a fourth technical solution provided by the present application is: there is provided a computer readable storage medium storing program instructions which, when executed, implement a video encoding method as described above.
According to the video coding method, a new frequently-occurring pixel and a historical frequently-occurring pixel list of a current block are obtained; constructing a new commonly-occurring pixel list by using the new commonly-occurring pixels and at least part of commonly-occurring pixels in the historical commonly-occurring pixel columns as the repeatedly-used commonly-occurring pixels; predicting and classifying pixels in the current block by using a new frequently-occurring pixel list, dividing all the pixels in the current block into equivalent strings, unit base vector strings and unmatched pixels, and recording the hit times of each frequently-occurring pixel prediction pixel or the equivalent strings in the new frequently-occurring pixel list; arranging according to the hit times of each frequently-occurring pixel from large to small to obtain a target frequently-occurring pixel list; and encoding the current block by using the target frequently-occurring pixel list to obtain the code stream of the current block. The method and the device have the advantage that the frequently-occurring pixels with high hit times are arranged in front of the list, so that the coding bit overhead is reduced.
Drawings
Fig. 1 is a schematic flowchart illustrating an embodiment of a video encoding method provided in the present application;
FIG. 2 is a schematic diagram of various types of pixel strings in the evs _ ubvs mode provided herein;
FIG. 3 is a schematic illustration of a horizontal arcuate scan pattern as provided herein;
FIG. 4 is a schematic diagram of the generation of a list of commonly occurring pixels provided herein;
fig. 5 is a schematic structural diagram of an embodiment of a video encoding apparatus provided in the present application;
FIG. 6 is a schematic block diagram of an embodiment of a video codec system of the present application;
fig. 7 is a schematic structural diagram of a computer-readable storage medium of the present application.
Detailed Description
The technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only a part of the embodiments of the present application, and not all of the embodiments. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present application.
The video codec standards are h.264/AVC, h.265/HEVC, h.266/VVC, VP8, VP9, AV1, AVs, etc., and the main purpose of the video codec is to compress the acquired video signals into data in different standard formats for transmission or storage. In order to apply the video coding technique to an actual scene, the rate control technique plays a crucial role in a video encoder, because it can adjust the target rate output by the encoder under the condition of limited communication bandwidth or storage space, thereby avoiding the condition that the coded video frame is too large or too small.
The present application will be described in detail with reference to the accompanying drawings and examples.
Referring to fig. 1, fig. 1 is a schematic flowchart illustrating a video encoding method according to an embodiment of the present disclosure.
The application provides a video coding method based on an existing equivalent string-level unit basis vector string (evs _ ubvs) mode, wherein a evs _ ubvs mode is a sub-mode under an SP prediction technology, and different from a common SP prediction mode, a evs _ ubvs mode does not predict a pixel string by using a string vector, but predicts the pixel string by using a common pixel or a unit basis vector. Thus, after prediction in the evs _ ubvs mode, the pixel string in the current block can be divided into the following two strings and unmatched pixels:
(1) equivalent value string (evs for short): a characteristic of such a pixel string is that all pixels in the pixel string take equal values, since all pixels in the pixel string are predicted using the same commonly occurring pixel.
(2) Unit basis vector string (ubvs for short): because the current scanning mode for the current block only has horizontal arc scanning, the current unit base vector string refers to the pixel string predicted by the (0, -1) vector.
(3) Unmatched pixels (unmatched pixels): if a pixel does not belong to either evs or ubvs, it is an unmatched pixel.
As shown in fig. 2, fig. 2 is a schematic diagram of various types of pixel strings in evs _ ubvs mode provided by the present application. The first two pixel strings (pixel string a and pixel string B) in the current block are predicted by two commonly occurring pixels, index0 and index1, in the commonly occurring pixel list, respectively, where the two strings are evs; the two pixels C of the third row are two unmatched pixels; the last row of pixel string D is one ubvs.
evs _ ubvs mode applies as follows: evs _ ubvs mode is only used for coding blocks with width and height greater than 4, and for pixel strings within a coding block that employs this mode, if evs strings are used, the frequent pixels that it references must be within the current coding block and the left-hand neighboring coding block; if it is a ubvs string, its reference string must be inside the current coding block.
Like the normal SP prediction mode, the evs _ ubvs mode only uses horizontal bow scan, and the total number of pixel strings and unmatched pixels in a coding block cannot exceed 1/4 of the total pixels of the coding block. In particular, please refer to fig. 3 for a horizontal bow scan manner described in the embodiments of the present disclosure.
In addition, to further simplify the hardware implementation, the following restrictions are made on the list of commonly occurring pixels built in the evs _ ubvs sub-mode: for the length of the current block common pixel list, the length of an encoding block of 8 x 8 is not more than 10, and the lengths of encoding blocks of other sizes are not more than 15; the length of the historical list of commonly occurring pixels does not exceed 28.
The video encoding method of the embodiments of the present disclosure can be used not only for SCC (screen content, mainly computer-generated images) scenes but also for natural image scenes and mixed scenes (SCC + natural images).
The video coding method of the embodiment of the disclosure includes the following specific steps:
step S11: new frequent pixels and a history frequent pixel list of the current block are obtained.
Step S12: and constructing a new commonly-occurring pixel list by using the new commonly-occurring pixels and part of commonly-occurring pixels in the historical commonly-occurring pixel list as the repeatedly-used commonly-occurring pixels.
In the embodiment of the present disclosure, the video encoding apparatus first obtains at least a part of the current pixels from the history current pixel list (PrevSrb) as the reusable current pixels to fill the current pixel list, and the specific process is as follows:
(1) for each pixel in the current block, traversing each history frequently-occurring pixel in the history frequently-occurring pixel list, calculating the difference value between each history frequently-occurring pixel and the current pixel in the current block, and selecting the history frequently-occurring pixel with the smallest absolute value of the difference value as the best history frequently-occurring pixel of the current pixel.
(2) When the difference value between the current pixel and the corresponding optimal historical frequently-occurring pixel is smaller than a preset threshold value i _ errorlimitt, the historical frequently-occurring pixel serving as the frequently-occurring pixel repeatedly meets the condition of adding a new frequently-occurring pixel list, and is determined as one hit. It should be noted that a common pixel may be hit by multiple pixel values in the current block, and the video coding apparatus needs to record the number of times each common pixel is hit.
(3) Repeating the steps (1) and (2) for each pixel in the current block, sorting the repeated use of the frequently-occurring pixels from large to small according to the number of hits after all the pixels are traversed, and storing the frequently-occurring pixels in a new frequently-occurring pixel list. Among them, these frequent pixels taken out from the history frequent pixel list are called reused frequent pixels, i.e., the frequent pixels are reused.
Then, the video encoding device obtains a new frequently-occurring pixel in the current block, where the new frequently-occurring pixel is a frequently-occurring pixel that does not appear in the history frequently-occurring pixel list, and fills the new frequently-occurring pixel into a temporary list p _ list _ sort, where the new frequently-occurring pixel in the embodiment of the disclosure is obtained by a clustering method, that is, pixels with similar pixel values in the current block are clustered into one class, and an average value of all pixels in each class is used as a representative pixel of the current class, and the specific process is as follows:
(1) for each pixel in the current block, traversing each frequently-occurring pixel in the new frequently-occurring pixel list, calculating the difference value between each frequently-occurring pixel and the current pixel, and selecting the frequently-occurring pixel with the minimum difference value as the best frequently-occurring pixel.
(2) And when the difference value between the current pixel and the best frequently-occurring pixel is greater than the threshold value i _ errorlimit, indicating that the current pixel is a new frequently-occurring pixel.
(3) If the current pixel is a new frequently-occurring pixel, the current pixel needs to be classified, and the classification method comprises the following steps: a SAD (Sum of Absolute Difference) value calculation is performed using the current pixel and the representative pixel of each class, and the class having the smallest SAD value is the class to which the current pixel is most likely to belong.
(4) Calculating a difference value between the current pixel and the representative pixel which is most probably attributed to the class, if the difference value is less than or equal to a threshold value i _ errorlimitt, attributing the current pixel value to the class, and updating the representative pixel; otherwise, if the difference value is larger than the threshold value i _ errorlimitt, the current pixel is taken as a new type.
(5) After all the pixels in the current block are clustered, all the classes are traversed, the classes are sorted according to the number of the pixels in the classes from most to least, and the sorted classes are stored in an independent list p _ list _ sort.
Further, the video encoding apparatus merges the reused frequently-occurring pixels and the newly frequently-occurring pixels into a new frequently-occurring pixel list, and the specific process is as follows: averaging and rounding all pixels of each type in the independent list p _ list _ sort, adding the pixels as new frequently-occurring pixels to the tail of the new frequently-occurring pixel list, wherein duplication checking operation is needed during adding, and the pixels are not added if the same pixels exist.
Finally, the video coding device performs SSE fine selection and then sorting on the complete new frequently-occurring pixel list. The specific process is as follows:
(1) setting a new threshold i _ errorlimit _ sqr 3 i _ errorlimit
(2) For each pixel in the current block, traversing each frequently-occurring pixel in the new frequently-occurring pixel list, calculating the difference value (SSE, Sum of Squared Error, Sum of Squared differences) between each frequently-occurring pixel and the current pixel, and selecting the frequently-occurring pixel with the minimum difference value as the best frequently-occurring pixel.
(3) All pixels within the current block are re-clustered. If the difference value of the best pixel corresponding to a certain current pixel is greater than the threshold value i _ error _ sqr, a rdcost (Rate Distortion optimization) for directly encoding the current pixel needs to be calculated, and if the rdcost is less than the difference value corresponding to the best pixel, the current pixel is an unmatched pixel, and the encoding of the current pixel is directly performed, so that the encoding bit cost is saved.
(4) If the current pixel is not an unmatched pixel, the current pixel needs to be placed in the class corresponding to the best current pixel and stored in the temporary list srb _ pred _ samples.
(5) Finally, the srb _ pred _ samples list is traversed, all pixels in each class in the list are averaged to be used as the final constant pixel value of the class, a new constant pixel list is filled from the beginning in the sequence in the srb _ pred _ samples list, and the filling process needs to be repeated.
(6) After filling the current position in the new frequent pixel list with the pixels in srb _ pred _ samples list, each pixel in the current block is traversed, and the sum of squares of the difference values of each pixel and the currently added frequent pixel is calculated.
(7) Setting m effective commonly-occurring pixels in the new commonly-occurring pixel list, calculating each difference value of the new commonly-occurring pixel and the previous m pixels in the repeatedly-used commonly-occurring pixel list for each commonly-occurring pixel in the new commonly-occurring pixel list, and sequencing the repeatedly-used commonly-occurring pixels from small to large according to the difference values.
(8) And then traversing each pixel in the current block for the maximum first 4 repeated use common pixels in the history list after the sorting is finished, solving the sum of squares of the difference values, comparing the sum of squares of the difference values with the sum of squares of the difference values in the step (6), and if the sum of squares of the difference values is smaller than the sum of squares of the difference values in the step (6), updating the repeated use common pixel with the minimum sum of squares of the difference values to the current position of the new common pixel list.
Through the steps, all the frequently-occurring pixels in the new frequently-occurring pixel list are basically determined, and the video coding device further adjusts and sorts the new frequently-occurring pixel list to ensure that the frequently-occurring pixels are reused and arranged in front of the whole list and the frequently-occurring pixels are repeatedly arranged in back of the whole list. The sequence inside all the repeatedly used and frequently-existing pixels is kept unchanged, and the sequence inside all the newly frequently-existing pixels is also kept unchanged.
Step S13: and predicting and classifying the pixels in the current block by using the new frequently-occurring pixel list, dividing all the pixels in the current block into equivalent strings, unit base vector strings and unmatched pixels, and recording the hit times of the predicted pixels or the equivalent strings of each frequently-occurring pixel in the new frequently-occurring pixel list.
In the embodiment of the present disclosure, the video encoding apparatus performs prediction classification on the pixels in the current block, that is, performs string prediction, and divides all the pixels in the current block into an equivalent string, a unit base vector string, and an unmatched pixel, and the specific process is as follows:
the video coding device firstly determines the best normal pixel corresponding to each pixel in the current block, and if the coding cost of the matched best normal pixel is greater than the cost of directly coding the original pixel value, the pixel is set as an unmatched pixel. The specific operation is as follows: for each pixel of the current block, traversing each frequently-occurring pixel in the new frequently-occurring pixel list, calculating the difference value between each frequently-occurring pixel and the current pixel, and selecting the frequently-occurring pixel with the minimum difference value as the best frequently-occurring pixel of the current pixel.
If the difference value between the best frequently-occurring pixel and the current pixel is greater than the threshold value i _ errorlimit, the rdcost for directly coding the current pixel needs to be calculated, and if the rdcost is smaller than the difference value corresponding to the best frequently-occurring pixel, it is indicated that the difference between the current pixel and all frequently-occurring pixels is larger, and the bit cost is saved when the current pixel is directly coded. The current pixel is an unmatched pixel, and the predicted value of the current pixel is the pixel itself; otherwise, the predicted value of the current pixel is the best current pixel value.
After the video coding device determines the frequently-occurring pixels of each pixel and the matching type of each pixel, traversing each pixel in the current block according to an arch scanning sequence:
and if the initial position pixel is an unmatched pixel, obtaining the length and cost of the corresponding string for the unmatched pixel string.
Otherwise, the initial position is a matched pixel, the type is set to be an equivalent string type, whether the current pixel of the next pixel is the same as the current pixel of the initial pixel or not is judged, if so, the length of the string is increased by 1, the next pixel is continuously processed, otherwise, the type judgment is finished, and the cost and the length of the string are obtained.
And further judging whether the current block is a unit base vector string ubvs, and if the processed pixel position is greater than or equal to the width of the current block and the previous string type is not the unit base vector string ubvs, entering judgment of the ubvs string.
If the current pixel at the initial position is equal to the current pixel at the above, further determining whether the current pixel at the next pixel position is the same as the current pixel at the above the above-mentioned pixels, accumulating until the current pixel at a certain position is different from the current pixel at the above the above-mentioned pixels, and counting the total cost.
After the prediction in the above manner, the video encoding apparatus calculates the average cost value of each pixel, and selects a prediction method having a smaller cost value.
The embodiment of the present disclosure further provides an updating mechanism of the current pixel list, where the updating mechanism means that after a current block is encoded in evs _ ubvs mode, a current pixel in the current pixel list corresponding to the current block needs to be updated into the historical current pixel list PrevSrb. The overall rule is: and (4) putting the current pixel in the current pixel list of the current block which is coded completely in front of the PrevSrb, moving the original current pixel in the PrevSrb backwards, and simultaneously performing a duplication checking operation.
The specific updating process can be briefly divided into the following 3 steps:
(1) its duplicate current pixel (i.e., reused current pixel) with the current list of current pixels is deleted from the PrevSrb.
(2) And sequentially inserting the current pixels in the current constant pixel list into the top of the PrevSrb according to the sequence.
(3) If the number of elements of the PrevSrb list after insertion exceeds the maximum length 28, the last exceeding part of the PrevSrb list is removed.
For example, referring to FIG. 4, index0 and index1 in Srb are reused regular pixels, which are duplicated with index0 and index3 in PrevSrb, respectively. Srb, index2 and index3 are new commonly occurring pixels.
Step S14: and arranging the frequently-occurring pixels from large to small to obtain a target frequently-occurring pixel list.
In the embodiment of the present disclosure, after completing the prediction of the current block and determining the type of the string within the block, the video encoding apparatus sorts the frequent pixels in the new frequent pixel list according to the hit number of each frequent pixel. It should be noted that the hit count of the embodiment of the present disclosure is the number of predicted pixels or equivalent strings of the current pixels in the new current pixel list. Specific ordering schemes include, but are not limited to, the following schemes, either individually or in combination:
(1) only sorting the interior of the repeatedly used common pixels, and if one pixel in evs strings needs to be predicted by one common pixel, considering that the common pixel hits 1 time, namely the hit times of the common pixel is the times of repeatedly using the common pixel prediction pixel; the video coding device sorts the reusable common pixels from large to small according to the number of times of the common pixels, and the new common pixels are arranged behind the reusable common pixels according to the original arrangement sequence, so that a final target common pixel list is formed.
(2) Only sequencing the interior of the repeatedly used normal pixels, and if a certain normal pixel is needed to predict an evs string, considering that the normal pixel hits for 1 time, namely the hit times are the times of predicting the equivalent string by repeatedly using the normal pixel; the video coding device sorts the reusable common pixels from large to small according to the number of times of the common pixels, and the new common pixels are arranged behind the reusable common pixels according to the original arrangement sequence, so that a final target common pixel list is formed.
(3) All the repeated frequently-used pixels are regarded as a whole, all the newly frequently-used pixels are regarded as another whole, and the two whole are sorted. Specifically, a weight is distributed to the number of times of hitting pixels of each repeated use common pixel, and then the weighted average number of times of hitting pixels of each repeated use common pixel is calculated; and (4) assigning a weight to the number of times of hitting the pixel of each new frequently-occurring pixel, and calculating the weighted average number of times of hitting the pixel of each new frequently-occurring pixel. Comparing the average hit times of the two integers, and arranging all the repeated use commonly-occurring pixels in front of all the new commonly-occurring pixels to form a target commonly-occurring pixel list under the condition that the weighted average of the hit times of all the repeated use commonly-occurring pixels is larger than the weighted average of the hit times of all the new commonly-occurring pixels; and in the case that the weighted average of the hit times of all the repeated use normal pixels is smaller than the weighted average of the hit times of all the new normal pixels, arranging all the new normal pixels before all the repeated use normal pixels to form a target normal pixel list.
(4) All the repeated frequently-used pixels are regarded as a whole, all the newly frequently-used pixels are regarded as another whole, and the two whole are sorted. Specifically, a weight is assigned to the number of times of hit pixel strings of each repeatedly used common pixel, and then the weighted average number of times of hit pixels of each repeatedly used common pixel is calculated; and distributing weights to the times of the hit pixel strings of each new frequently-occurring pixel, and calculating the weighted average times of the hit pixels of each new frequently-occurring pixel. Comparing the average hit times of the two integers, and arranging all the repeated use commonly-occurring pixels in front of all the new commonly-occurring pixels to form a target commonly-occurring pixel list under the condition that the weighted average of the hit times of all the repeated use commonly-occurring pixels is larger than the weighted average of the hit times of all the new commonly-occurring pixels; and in the case that the weighted average of the hit times of all the repeated use normal pixels is smaller than the weighted average of the hit times of all the new normal pixels, arranging all the new normal pixels before all the repeated use normal pixels to form a target normal pixel list.
It should be noted that the video encoding apparatus may select any one of schemes (1) to (4) to order the list of the commonly occurring pixels, or select one of schemes (1) and (2) to combine with one of schemes (3) and (4), and arrange the list of the commonly occurring pixels according to the combination scheme.
For example, the list of the current pixels includes 6 current pixels, and the current pixels are stored at positions index0 to index 5. Scheme (2) + scheme (4) is used to rank them. Let index 0-index 2 correspond to the reused common pixel values as reused0, reused1 and reused2, and the hit times of the hit pixel string are 3,7 and 2 respectively; indexes 3 to 5 correspond to new and frequently-occurring pixel values new0, new1 and new2, and the hit times of hit pixel strings are 4,4 and 6 respectively.
When the index 0-index 2 are reordered by using scheme (2), index0 is reused1, index1 is reused0, and index2 is reused 2.
And re-using the commonly existing pixel whole and re-using the newly commonly existing pixel whole by adopting the scheme (4). For three repeated use common pixels, the distribution weights are 1, 1 and 1, and then the weighted average value Wre ═ 3+7+2)/3 ═ 4; for three new commonly-occurring pixels, the assigned weights are 1, 2, and 3, and the weighted average value Wnew ═ (4+4 × 2+6 × 3)/6 ═ 5. Wnew > Wre, so that three newly-existing pixels are placed in front, and the final index 0-index 5 are { new0, new1, new2, reused1, reused0, reused2 }.
Step S15: and encoding the target equivalent string in the current block by using the target normal pixel list to obtain the code stream of the current block.
The video encoding method of the disclosed embodiment further sets the relevant syntax elements.
First a syntax element isc _ cu _ evs _ ubvs _ submode _ flag needs to be transmitted to indicate whether evs _ ubvs mode or normal SP mode is finally selected for prediction.
The transport syntax is then needed to distinguish between evs strings, unmatched pixels, or ubvs strings. Firstly transmitting a syntax element isc _ evs _ present _ flag at a coding block level to represent whether an equivalent string exists in the current block; the syntax isc _ unamatted _ pixel _ str _ present _ flag is transmitted, which indicates whether there is an unmatched pixel in the current coding unit.
At the level of each string, if evs strings are used, the index of the evs string corresponding to the current pixel in the current pixel list and the length of the string need to be transmitted, and if a new current pixel is used, the value of the new current pixel needs to be transmitted; if it is an ubvs string, then only one syntax is needed to represent that the pixel string is neither an evs string nor an unmatched pixel, and the string length of the ubvs string is transmitted; if the pixel is not matched, the pixel value of the pixel and the number information of the continuous unmatched pixels need to be transmitted.
In order for the decoding side to construct Srb the list, the encoding side needs to transmit three values: num _ of _ reused _ pv, num _ of _ new _ pv, prev _ pv _ not _ reused _ run. num _ of _ reused _ pv represents how many of the frequently existing pixel list are reused; prev _ pv _ not _ reused _ run represents that when the repeated pixel list is scanned from the beginning, every other index can encounter a repeated pixel, and the decoding end can take the repeated pixel out to be placed in the repeated pixel list; num _ of _ new _ pv then indicates how many new commonly occurring pixels are.
When encoding a string evs corresponding to index of a current pixel, a differential encoding method is adopted. That is, the index of the current evs string is not directly transmitted, but is to be subtracted from the index of the previous evs string, and the difference is transmitted. If the difference is less than 0, num _ of _ reused _ pv and the number of new current pixels already coded need to be added to ensure that a positive number is transmitted.
Further, the embodiment of the present disclosure modifies the construction of the commonly-occurring pixel list on the basis of the above syntax, and the specific modifications are as follows:
scheme A: no matter what way the list is constructed, the value of index itself is directly encoded, and there is no need to transmit the number of reuse frequent pixels and the number of new frequent pixels.
Scheme B: when only the above permutation scheme (1)/(2) is selected, the above coding technique can still be used for differential coding. If the arrangement scheme (3)/(4) is selected, a differential encoding scheme may be used, which is the same as the above-described encoding technique, except that the entire frequently occurring pixels are reused or arranged in front of the list. However, if the reusable current pixels are arranged entirely behind the list, and the difference between the current string current pixel index and the previous string current pixel index during the difference operation is smaller than 0, the difference is added to the number of all current pixels corresponding to the current block in the new current pixel list at the end of the difference operation to ensure that the difference is larger than 0, and in addition, a flag (mark number) is additionally transmitted to indicate whether the reused current pixels are placed in front of or behind the total.
Specifically, in the target frequent pixel list, in the case where all the reuse frequent pixels are arranged before all the new frequent pixels, the code transmits a flag number having a value of 1. In the target frequent pixel list, the code transmits a flag number with a value of 0 in case all new frequent pixels are arranged before all the repeated use frequent pixels.
To further increase the flexibility of encoding and improve the compression performance of the food product, the video encoding apparatus may further select the different encoding schemes according to the size of the current block. For example, assuming that the current block has a width w and a height h, the encoding is performed using scheme a or scheme B only when w × h < ═ TH1 or w × h > -TH 2.
Specifically, assuming that TH1 is 32 and TH2 is 256, the arrangement scheme (4) is adopted for the ubiquitous pixel list construction, and the length of the ubiquitous pixel list is 5. Let block selection scheme B of w h ═ 32, or w h ═ 256 be coded.
And if the other coding blocks construct the re-ordered list by adopting the scheme (4), transmitting a flag value to be 1 if the repeatedly used common pixels are still arranged in front, and transmitting a flag value to be 0 if the repeatedly used common pixels are arranged in back. When encoding the index of the current pixel, if the current pixel is repeatedly used and arranged behind the current pixel, the length of the current pixel list is required to be increased by 5 when the difference value is smaller than 0 after the difference is made, so as to ensure that the difference value is finally larger than 0. For example, the current string is predicted by using the new current pixel, index is 0, the previous adjacent string is predicted by using the repeated current pixel, index is 4, after the difference is made, 0-4 is equal to-4, and after 5 is added, the positive number is 1.
The video coding device of the embodiment of the disclosure obtains a new current pixel and a historical current pixel list of a current block; constructing a new commonly-occurring pixel list by using the new commonly-occurring pixels and at least part of commonly-occurring pixels in the historical commonly-occurring pixel list as the repeatedly-used commonly-occurring pixels; predicting and classifying pixels in the current block by using a new frequently-occurring pixel list, dividing all the pixels in the current block into equivalent strings, unit base vector strings and unmatched pixels, and recording the hit times of each frequently-occurring pixel prediction pixel or the equivalent strings in the new frequently-occurring pixel list; arranging according to the hit times of each frequently-occurring pixel from large to small to obtain a target frequently-occurring pixel list; and encoding the current block by using the target frequently-occurring pixel list to obtain the code stream of the current block. According to the method and the device, the frequently-occurring pixels with high hit times are arranged in front of the list, so that the method and the device are favorable for reducing the cost of coding bits, different coding modes can be designed according to different list construction modes, the coding modes can be switched according to the size information of the coding blocks, and the video compression performance is favorably improved.
The above embodiments are only one of the common cases of the present application and do not limit the technical scope of the present application, so that any minor modifications, equivalent changes or modifications made to the above contents according to the essence of the present application still fall within the technical scope of the present application.
Referring to fig. 5, fig. 5 is a schematic structural diagram of an embodiment of a video encoding apparatus provided in the present application. The video encoding apparatus 50 includes a pixel obtaining module 51, a list constructing module 52, a prediction classifying module 53, an arranging module 54, and an encoding module 55.
The pixel obtaining module 51 is configured to obtain a new current pixel and a history current pixel list of the current block.
A list construction module 52 for constructing a list of new current pixels using the new current pixels and the reused current pixels.
And a prediction classification module 53, configured to perform prediction classification on pixels in the current block by using the new commonly-occurring pixel list, divide all pixels in the current block into an equivalent string, a unit base vector string, and an unmatched pixel, and record the hit frequency of a prediction pixel or an equivalent string of each commonly-occurring pixel in the new commonly-occurring pixel list.
And the arranging module 54 is used for arranging the frequently-occurring pixels from large to small to obtain a target frequently-occurring pixel list.
And the encoding module 55 is configured to encode the current block by using the target frequent pixel list to obtain a code stream of the current block.
Please refer to fig. 6, which is a schematic structural diagram of a video encoding and decoding system according to an embodiment of the present application. The video codec system comprises a memory 62 and a processor 61 connected to each other.
The memory 62 is used to store program instructions implementing the video encoding method of any of the above.
The processor 61 is operative to execute program instructions stored in the memory 62.
The processor 61 may also be referred to as a Central Processing Unit (CPU). The processor 61 may be an integrated circuit chip having signal processing capabilities. The processor 61 may also be a general purpose processor, a Digital Signal Processor (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other programmable logic device, discrete gate or transistor logic, discrete hardware components. A general purpose processor may be a microprocessor or the processor may be any conventional processor or the like.
The storage 62 may be a memory bank, a TF card, etc., and may store all information in the string matching prediction apparatus, including the input raw data, the computer program, the intermediate operation results, and the final operation results. It stores and retrieves information based on the location specified by the controller. With the memory, the string matching prediction device has a memory function, and normal operation can be guaranteed. The memory of the string matching prediction device can be classified into a main memory (internal memory) and an auxiliary memory (external memory) according to the use, and also into an external memory and an internal memory. The external memory is usually a magnetic medium, an optical disk, or the like, and can store information for a long period of time. The memory refers to a storage component on the main board, which is used for storing data and programs currently being executed, but is only used for temporarily storing the programs and the data, and the data is lost when the power is turned off or the power is cut off.
In the several embodiments provided in the present application, it should be understood that the disclosed method and apparatus may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, a division of a module or a unit is merely a logical division, and an actual implementation may have another division, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
Units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the embodiment.
In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed to by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a system server, a network device, or the like) or a processor (processor) to execute all or part of the steps of the method of the embodiments of the present application.
Fig. 7 is a schematic structural diagram of a computer-readable storage medium according to the present application. The storage medium of the present application stores a program file 71 capable of implementing all the above-mentioned video encoding methods, wherein the program file 71 may be stored in the storage medium in the form of a software product, and includes several instructions to enable a computer device (which may be a personal computer, a server, or a network device, etc.) or a processor (processor) to execute all or part of the steps of the methods according to the embodiments of the present application. The aforementioned storage device includes: various media capable of storing program codes, such as a usb disk, a mobile hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, or terminal devices, such as a computer, a server, a mobile phone, and a tablet.
The above embodiments are merely examples and are not intended to limit the scope of the present disclosure, and all modifications, equivalents, and flow charts using the contents of the specification and drawings of the present disclosure or those directly or indirectly applied to other related technical fields are intended to be included in the scope of the present disclosure.
Claims (11)
1. A video encoding method, the video encoding method comprising:
acquiring a new frequently-occurring pixel and a historical frequently-occurring pixel list of a current block;
constructing a new commonly-occurring pixel list by using the new commonly-occurring pixels and at least part of commonly-occurring pixels in the historical commonly-occurring pixel list as repeatedly-used commonly-occurring pixels;
predicting and classifying the pixels in the current block by using the new frequently-occurring pixel list, dividing all the pixels in the current block into an equivalent string, a unit base vector string and an unmatched pixel, and recording the hit frequency of each frequently-occurring pixel in the new frequently-occurring pixel list for predicting each pixel in the equivalent string or the equivalent string;
arranging the frequently-occurring pixels in the new frequently-occurring pixel list from large to small according to the number of times of hitting of each frequently-occurring pixel to obtain a target frequently-occurring pixel list;
and encoding the current block by using the target frequently-occurring pixel list to obtain the code stream of the current block.
2. The video encoding method of claim 1,
the hit frequency is the frequency of predicting the pixel by repeatedly using the frequently-occurring pixel;
the step of arranging the frequently-occurring pixels in the new frequently-occurring pixel list from large to small according to the number of times of hitting of each frequently-occurring pixel to obtain a target frequently-occurring pixel list includes:
arranging the repeated use common pixels from large to small according to the number of times of hitting of each repeated use common pixel;
and arranging each new frequently-occurring pixel after the repeatedly-used frequently-occurring pixels according to the arrangement sequence of the new frequently-occurring pixel list to form the target frequently-occurring pixel list.
3. The video encoding method of claim 1,
the hit times are the times of predicting the equivalent string by repeatedly using the common pixel;
the step of arranging the frequently-occurring pixels in the new frequently-occurring pixel list from large to small according to the number of times of hitting of each frequently-occurring pixel to obtain a target frequently-occurring pixel list includes:
arranging the repeated use common pixels from large to small according to the number of times of hitting of each repeated use common pixel;
and arranging each new frequently-occurring pixel after the repeatedly-used frequently-occurring pixels according to the arrangement sequence of the new frequently-occurring pixel list to form the target frequently-occurring pixel list.
4. The video encoding method of claim 1,
the step of arranging the frequently-occurring pixels in the new frequently-occurring pixel list from large to small according to the number of times of hitting of each frequently-occurring pixel to obtain a target frequently-occurring pixel list includes:
calculating the weighted average value of the hit times of all the repeated use common pixels according to the weight of each repeated use common pixel;
calculating the weighted average value of the hit times of all the new frequently-occurring pixels according to the weight of each new frequently-occurring pixel;
the hit times are the times of predicting the pixel by the frequently-occurring pixel in the new frequently-occurring pixel list;
arranging all the repeated use current pixels before all the new current pixels to form the target current pixel list under the condition that the weighted average of the hit times of all the repeated use current pixels is larger than the weighted average of the hit times of all the new current pixels;
and in the case that the weighted average of the hit times of all the repeated use commonly-occurring pixels is smaller than the weighted average of the hit times of all the new commonly-occurring pixels, arranging all the new commonly-occurring pixels before all the repeated use commonly-occurring pixels to form the target commonly-occurring pixel list.
5. The video encoding method of claim 1,
the step of arranging the frequently-occurring pixels in the new frequently-occurring pixel list from large to small according to the number of times of hitting of each frequently-occurring pixel to obtain a target frequently-occurring pixel list includes:
calculating the weighted average value of the hit times of all the repeated use common pixels according to the weight of each repeated use common pixel;
calculating the weighted average value of the hit times of all the new frequently-occurring pixels according to the weight of each new frequently-occurring pixel;
the hit times are the times of predicting the equivalent string by the common pixels in the new common pixel list;
arranging all the repeated use current pixels before all the new current pixels to form the target current pixel list under the condition that the weighted average of the hit times of all the repeated use current pixels is larger than the weighted average of the hit times of all the new current pixels;
and in the case that the weighted average of the hit times of all the repeated use commonly-occurring pixels is smaller than the weighted average of the hit times of all the new commonly-occurring pixels, arranging all the new commonly-occurring pixels before all the repeated use commonly-occurring pixels to form the target commonly-occurring pixel list.
6. The video encoding method of claim 1,
the step of encoding a target iso-string in the current block using the target list of commonly occurring pixels
Acquiring the width and the height of the current block;
judging whether the product of the width and the height of the current block is in a preset range or not;
if so, encoding the value of the index value of the normal pixel corresponding to the target equivalent string in the target normal pixel list after differential operation; or directly coding the index value of the normal pixel corresponding to the target equivalent string in the target normal pixel list.
7. The video encoding method of claim 6,
the step of encoding the value of the index value of the normal pixel corresponding to the target isostring after the difference operation is performed on the index value in the target normal pixel list includes:
in the target constant-occurring pixel list, under the condition that all new constant-occurring pixels are arranged before all the constant-occurring pixels are repeatedly used, the index values of the constant-occurring pixels of the first equivalent string in the target constant-occurring pixel list are coded, the index values of the constant-occurring pixels of the remaining equivalent strings, the index values of the constant-occurring pixels of the equivalent strings in the scanning sequence and the number of the current blocks corresponding to all the constant-occurring pixels in the target constant-occurring pixel list are used for carrying out difference operation, and then the values after the difference operation are coded.
8. The video encoding method of claim 7,
after the step of differentially encoding the target frequent pixels in the target frequent pixel list, the video encoding method further includes:
in the target frequent pixel list, in the case that all the reused frequent pixels are arranged before all the new frequent pixels, a flag number with a value of 1 is transmitted by encoding;
in the target frequent pixel list, the encoding transmits a flag number with a value of 0 in case all new frequent pixels are arranged before all reuse frequent pixels.
9. The video coding device is characterized by comprising a pixel acquisition module, a list construction module, a prediction classification module, an arrangement module and a coding module;
the pixel obtaining module is used for obtaining a new frequently-occurring pixel and a historical frequently-occurring pixel list of the current block;
the list construction module is used for constructing a new commonly-occurring pixel list by using the new commonly-occurring pixels and at least part of commonly-occurring pixels in the historical commonly-occurring pixel list as reusable commonly-occurring pixels;
the prediction classification module is used for performing prediction classification on the pixels in the current block by using the new frequently-occurring pixel list, dividing all the pixels in the current block into an equivalent string, a unit base vector string and an unmatched pixel, and recording the hit frequency of each pixel in the equivalent string or each pixel in the equivalent string predicted by each frequently-occurring pixel in the new frequently-occurring pixel list;
the arrangement module is used for arranging the frequently-occurring pixels in the new frequently-occurring pixel list from large to small according to the number of times of hitting of each frequently-occurring pixel to obtain a target frequently-occurring pixel list;
and the encoding module is used for encoding the current block by using the target frequently-occurring pixel list to obtain a code stream of the current block.
10. A video codec system comprising a processor, a memory coupled to the processor, wherein,
the memory stores program instructions;
the processor is configured to execute the program instructions stored by the memory to implement the video encoding method of any of claims 1-8.
11. A computer-readable storage medium, characterized in that the storage medium stores program instructions which, when executed by a processor, implement the video encoding method of any one of claims 1 to 8.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011419561.7A CN112565748B (en) | 2020-12-06 | 2020-12-06 | Video coding method, device and system and computer readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202011419561.7A CN112565748B (en) | 2020-12-06 | 2020-12-06 | Video coding method, device and system and computer readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN112565748A CN112565748A (en) | 2021-03-26 |
| CN112565748B true CN112565748B (en) | 2022-08-09 |
Family
ID=75059328
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202011419561.7A Active CN112565748B (en) | 2020-12-06 | 2020-12-06 | Video coding method, device and system and computer readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN112565748B (en) |
Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2005159820A (en) * | 2003-11-27 | 2005-06-16 | Fuji Xerox Co Ltd | Encoding apparatus, encoding method and program therefor |
| WO2012033673A1 (en) * | 2010-09-09 | 2012-03-15 | Qualcomm Incorporated | Efficient coding of video parameters for weighted motion compensated prediction in video coding |
| CN104244007A (en) * | 2013-06-13 | 2014-12-24 | 上海天荷电子信息有限公司 | Image compression method and device based on arbitrary shape matching |
| WO2016052977A1 (en) * | 2014-10-01 | 2016-04-07 | 주식회사 케이티 | Method and apparatus for processing video signal |
| JP2018007278A (en) * | 2017-10-11 | 2018-01-11 | 株式会社東芝 | Decoding method and decoder |
| WO2019150435A1 (en) * | 2018-01-30 | 2019-08-08 | 富士通株式会社 | Video encoding device, video encoding method, video decoding device, video decoding method, and video encoding system |
| CN111614359A (en) * | 2020-06-02 | 2020-09-01 | 同济大学 | Data encoding method and decoding method using point prediction and common position array |
| CN111866512A (en) * | 2020-07-29 | 2020-10-30 | 腾讯科技（深圳）有限公司 | Video decoding method, video encoding method, video decoding apparatus, video encoding apparatus, and storage medium |
-
2020
- 2020-12-06 CN CN202011419561.7A patent/CN112565748B/en active Active
Patent Citations (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2005159820A (en) * | 2003-11-27 | 2005-06-16 | Fuji Xerox Co Ltd | Encoding apparatus, encoding method and program therefor |
| WO2012033673A1 (en) * | 2010-09-09 | 2012-03-15 | Qualcomm Incorporated | Efficient coding of video parameters for weighted motion compensated prediction in video coding |
| CN104244007A (en) * | 2013-06-13 | 2014-12-24 | 上海天荷电子信息有限公司 | Image compression method and device based on arbitrary shape matching |
| WO2016052977A1 (en) * | 2014-10-01 | 2016-04-07 | 주식회사 케이티 | Method and apparatus for processing video signal |
| JP2018007278A (en) * | 2017-10-11 | 2018-01-11 | 株式会社東芝 | Decoding method and decoder |
| WO2019150435A1 (en) * | 2018-01-30 | 2019-08-08 | 富士通株式会社 | Video encoding device, video encoding method, video decoding device, video decoding method, and video encoding system |
| CN111614359A (en) * | 2020-06-02 | 2020-09-01 | 同济大学 | Data encoding method and decoding method using point prediction and common position array |
| CN111866512A (en) * | 2020-07-29 | 2020-10-30 | 腾讯科技（深圳）有限公司 | Video decoding method, video encoding method, video decoding apparatus, video encoding apparatus, and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN112565748A (en) | 2021-03-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112565749B (en) | Video coding method, device and system and computer readable storage medium | |
| EP0732855B1 (en) | Moving picture variable length coding system and method | |
| US9978156B2 (en) | High-throughput image and video compression | |
| CN101019437B (en) | H.264 spatial error concealment based on the intra-prediction direction | |
| US20100232497A1 (en) | Lossless and near-lossless image compression | |
| EP3412027B1 (en) | Method and apparatus for scan order selection | |
| US7561744B2 (en) | Image encoding apparatus, image decoding apparatus, and their control method, and computer program and computer-readable storage medium | |
| CN108370443B (en) | Data compression | |
| WO2022116317A1 (en) | Intra-frame prediction methods, encoder, decoder and storage medium | |
| US20220222861A1 (en) | Method, device, and storage medium for data encoding/decoding | |
| CN112055219B (en) | String matching prediction method and device and computer readable storage medium | |
| CN112218092B (en) | Encoding method, apparatus and storage medium for string encoding technique | |
| CN105027560A (en) | Method of determining binary codewords for transform coefficients | |
| CN114040205A (en) | Method for selecting intra chroma prediction mode, image processing apparatus, and storage apparatus | |
| CN111131828A (en) | Image compression method and device | |
| CN110062227B (en) | Method, device, equipment and readable storage medium for coding and decoding intra-frame prediction mode | |
| WO2007019790A1 (en) | Method and apparatus for encoding coefficient block | |
| CN112565748B (en) | Video coding method, device and system and computer readable storage medium | |
| JP2009077176A (en) | Image coder, image decoder, and their control methods | |
| US11006133B2 (en) | Image compression technique | |
| CN116668710A (en) | Color image transmission method, system, device and storage medium | |
| CN113099269B (en) | String matching prediction method, encoding and decoding method, related equipment and device | |
| CN113365080B (en) | Encoding and decoding method, device and storage medium for string coding technology | |
| CN112565760B (en) | Encoding method, apparatus and storage medium for string encoding technique | |
| CN112995661B (en) | Image encoding method and apparatus, electronic device, and storage medium |
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 |