CN114666600B - Data encoding method and device based on irregular template, electronic equipment and medium - Google Patents

Abstract

The application discloses a data encoding method, device, electronic equipment and medium based on an irregular template. By applying the technical solution of the present application, after obtaining the region to be coded, a variety of pre-designed templates of irregular shapes can be used to perform matching of pixels inside the template and between templates for the region to be coded, thereby providing a A more compact coded data expression form can improve the problem of low quality of decoded and reconstructed images caused by coefficient loss caused by inaccurate prediction.

Description

Data encoding method, device, electronic equipment and medium based on irregular template

technical field

This application relates to data processing technology, especially a data encoding method, device, electronic equipment and medium based on an irregular template.

Background technique

With the continuous popularization of image and video applications, video light compression technology is also constantly iterating and innovating. Common video light compression standards such as DSC, VDC-M, Apple ProRes and JPEG-XS are widely used in display interface fields such as HDMI and DP, and image and video production fields.

Among them, the main purpose of general video light compression standards is to achieve 4 to 16 times data compression under the conditions of low delay, low complexity and subjective losslessness. Taking the more common DSC1 coding standard as an example, its compression process mainly includes steps such as input and output, cache fragmentation, prediction, quantization, reconstruction, entropy coding, bit rate control, and bit stream synthesis.

However, the encoding method in the related art usually has a problem of large parameter loss in the process of pixel prediction. This also leads to affecting user experience.

Contents of the invention

Embodiments of the present application provide a data encoding method, device, electronic device, and medium based on an irregular template. It is used to solve the problem that the encoding method in the related art usually has a large parameter loss during the pixel prediction process, which affects the browsing experience of the user.

Among them, according to an aspect of the embodiment of the present application, a data encoding method based on an irregular template is provided, including:

Respectively determine encoding parameters corresponding to each area to be encoded, the encoding parameters include pixel positions in the area to be encoded, at least one encoding template, and a reference pixel queue, the encoding template is a template corresponding to an irregular shape;

Based on the predetermined intra-template matching rules, inter-encoding matching rules, and reference pixel queues, each encoding template is used to perform predictive encoding on the pixels in the region to be encoded, and an encoding result corresponding to each encoding template is obtained;

Select the prediction mode with the smallest code rate and distortion cost in the encoding result as the optimal prediction mode, and use the optimal prediction mode to perform predictive encoding on each region to be encoded.

Optionally, in another embodiment based on the above method of the present application, after determining the encoding parameters corresponding to the region to be encoded, further includes:

determining the internal encoding order of each encoding template; and, determining the encoding order among the individual encoding templates;

Sequentially perform predictive coding on each region to be coded based on the coding order among the coding templates; and,

Based on the internal coding order of each coding template, sequentially perform predictive coding on each pixel in the region to be coded.

Optionally, in another embodiment based on the above-mentioned method of the present application, performing predictive coding on each pixel in the region to be coded sequentially based on the internal coding sequence of each coding template includes:

Detect whether the current coding template is the first coding template;

If so, according to the internal encoding order, predictive encoding is performed on other pixels except the first pixel in the area to be encoded, using the pixel default value as the predicted value, wherein the pixel default value is the largest pixel in the corresponding encoding template. half of the pixel value;

If not, perform predictive coding on the pixels in the region to be coded according to the internal coding sequence.

Optionally, in another embodiment based on the above-mentioned method of the present application, performing predictive coding on each pixel in the region to be coded sequentially based on the internal coding sequence of each coding template includes:

Perform predictive coding on each pixel in the region to be coded by using the reconstructed value of at least one reference pixel, where the reference pixel is a coded pixel adjacent to the current pixel to be coded

Optionally, in another embodiment based on the above-mentioned method of the present application, after obtaining the coding result corresponding to each coding template, it further includes:

After each encoding template is translated, rotated, scaled and coincident with the current encoding area, calculate the residual value between each corresponding pixel between the encoding result corresponding to the encoding template and the corresponding original area to be encoded;

According to the residual value, a target coding template whose coding result meets a preset residual condition is selected as an optimal coding template of the region to be coded.

Optionally, in another embodiment based on the above method of the present application, according to the residual value, the target coding template whose coding result reaches the preset residual condition is selected as the optimal coding template of the region to be coded ,include:

Iteratively calculate the total residual value and residual mean value between the coding result corresponding to each coding template and the corresponding original area to be coded, and perform a process for each coding template according to the relationship between the total residual value and the residual mean value. Sorting of code rate and distortion cost;

The prediction method with the smallest bit rate and distortion cost is selected as the optimal prediction method.

Among them, according to another aspect of the embodiment of the present application, a data encoding device based on an irregular template is provided, which is characterized in that it includes:

The determining module is configured to separately determine encoding parameters corresponding to each area to be encoded, the encoding parameters include pixel positions in the area to be encoded, at least one encoding template, and a reference pixel queue, the encoding templates are corresponding to different regular shaped templates;

The encoding module is configured to use each encoding template to perform predictive encoding on the pixels in the area to be encoded based on the predetermined intra-template matching rules, inter-encoding matching rules, and reference pixel queues, to obtain the pixels corresponding to each encoding template. encoding result;

The selection module is configured to select the prediction mode with the smallest code rate and distortion cost in the encoding result as the optimal prediction mode, and use the optimal prediction mode to perform predictive encoding on each region to be encoded.

According to still another aspect of the embodiments of the present application, an electronic device is provided, including:

memory for storing executable instructions; and

The display is configured to cooperate with the memory to execute the executable instructions to complete the operation of any one of the irregular template-based data encoding methods described above.

According to still another aspect of the embodiments of the present application, there is provided a computer-readable storage medium for storing computer-readable instructions, and when the instructions are executed, any one of the above-mentioned data encoding methods based on irregular templates is performed operation.

In the present application, the encoding parameters corresponding to each area to be encoded can be respectively determined, and the encoding parameters include pixel positions in the area to be encoded, at least one encoding template and a reference pixel queue, and the encoding template is a template corresponding to an irregular shape; The determined intra-template matching rules, inter-encoding matching rules, and reference pixel queues use each encoding template to perform predictive encoding on the pixels in the area to be encoded, and obtain the encoding result corresponding to each encoding template; select the code rate and distortion in the encoding result The prediction mode with the least cost is used as the optimal prediction mode, and the optimal prediction mode is used to perform predictive encoding on each region to be encoded. By applying the technical solution of the present application, after the region to be coded is obtained, a variety of pre-designed templates of irregular shapes can be used to perform matching of pixels inside the template and between templates for the region to be coded, thereby providing a A more compact coded data expression form can improve the problem of low quality of decoded and reconstructed images caused by coefficient loss caused by inaccurate prediction.

The technical solutions of the present application will be described in further detail below with reference to the drawings and embodiments.

Description of drawings

The accompanying drawings, which constitute a part of this specification, illustrate the embodiments of the application and, together with the description, serve to explain the principles of the application.

The present application can be more clearly understood from the following detailed description with reference to the accompanying drawings, in which:

Fig. 1 is a schematic diagram of a data encoding method based on an irregular template proposed by the present application;

Fig. 2 is a schematic diagram of a coding method proposed by the present application;

Figure 3-4 is a schematic diagram of a data encoding process architecture based on an irregular template proposed by the present application;

FIG. 5 is a schematic structural diagram of a data encoding electronic device based on an irregular template proposed by the present application;

FIG. 6 is a schematic structural diagram of an irregular template-based data encoding electronic device proposed in the present application.

Detailed ways

Various exemplary embodiments of the present application will now be described in detail with reference to the accompanying drawings. It should be noted that the relative arrangements of components and steps, numerical expressions and numerical values set forth in these embodiments do not limit the scope of the present application unless specifically stated otherwise.

At the same time, it should be understood that, for the convenience of description, the sizes of the various parts shown in the drawings are not drawn according to the actual proportional relationship.

The following description of at least one exemplary embodiment is merely illustrative in nature and not intended as any limitation of the application, its application or uses.

Techniques, methods and devices known to those of ordinary skill in the relevant art may not be discussed in detail, but where appropriate, such techniques, methods and devices should be considered part of the description.

It should be noted that like numerals and letters denote like items in the following figures, therefore, once an item is defined in one figure, it does not require further discussion in subsequent figures.

In addition, the technical solutions of the various embodiments of the present application can be combined with each other, but it must be based on the realization of those skilled in the art. When the combination of technical solutions is contradictory or cannot be realized, it should be considered as a combination of technical solutions. Does not exist, nor is it within the scope of protection required by this application.

It should be noted that all directional indications (such as up, down, left, right, front, back...) in the embodiments of the present application are only used to explain If the specific posture changes, the directional indication will also change accordingly.

A data encoding method based on an irregular template according to an exemplary embodiment of the present application will be described below with reference to FIGS. 1-4 . It should be noted that the following application scenarios are only shown for easy understanding of the spirit and principle of the present application, and the implementation manners of the present application are not limited in this regard. On the contrary, the embodiments of the present application can be applied to any applicable scene.

The application also proposes a data encoding method, device, electronic equipment and medium based on an irregular template.

Fig. 1 schematically shows a schematic flowchart of a data encoding method based on an irregular template according to an embodiment of the present application. As shown in Figure 1, the method applies to include:

S101. Determine encoding parameters corresponding to each area to be encoded, the encoding parameters include pixel positions in the area to be encoded, at least one encoding template, and a reference pixel queue, and the encoding template is a template corresponding to an irregular shape.

S102. Based on the predetermined intra-template matching rule, inter-encoding matching rule, and reference pixel queue, respectively use each encoding template to perform predictive encoding on the pixels in the area to be encoded, and obtain an encoding result corresponding to each encoding template.

S103. Select the prediction mode with the smallest code rate and distortion cost in the encoding result as the optimal prediction mode, and use the optimal prediction mode to perform predictive encoding on each region to be encoded.

Furthermore, with the continuous popularization of image and video applications, video light compression technology is also constantly iterating and innovating. Common video light compression standards such as DSC and other display interface fields and image and video production fields.

Among them, the main purpose of general video light compression standards is to achieve 4 to 16 times data compression under the conditions of low delay, low complexity and subjective losslessness. Taking the more common DSC ¹ coding standard as an example, its compression process mainly includes steps such as input and output, cache fragmentation, prediction, quantization, reconstruction, entropy coding, bit rate control, and bit stream synthesis.

However, the encoding method in the related art usually has a problem of large parameter loss in the process of pixel prediction. This also leads to affecting user experience.

In order to solve the above problems, the present application proposes a data encoding method based on an irregular template, which includes the following steps, wherein:

Step 1: In one way, this application can be applied to any coding framework. Wherein, the template type that can be used for prediction and coding is initialized, that is, a group of continuous pixels of indeterminate shape is set for template coding. The pixel values operated in the region to be coded are grouped and arranged according to the template shape of at least one template coding template. For the boundary pixels that cannot meet the shape of the template, the adaptation is completed by clipping the template.

It should be noted that the coding templates in this application are templates corresponding to irregular shapes, such as L-shaped templates, Z-shaped templates, stepped templates, diamond-shaped templates, and the like.

Step 2: Record all pixel positions in the current area to be encoded (generally the smallest square area composed of several encoding templates), the mutual positions between encoding templates, and the number N of pixels used for reference.

Step 3: Determine the coding sequence inside the coding template (that is, determine the internal coding sequence of each coding template, so as to perform predictive coding on each pixel in the area to be coded subsequently).

In one method, as shown in FIG. 2 , the encoding may be cyclically accessed in a zigzag form from the upper left corner to the lower right corner.

Step 4: Determine the coding sequence between the coding templates (that is, determine the coding sequence between the coding templates, so that each area to be coded can be predicted and coded sequentially). In one method, it can be from left to right, from Encode one by one from top to bottom.

Step 5: Enter the template matching mode, where the first pixel of the encoding sequence in the encoding template can be determined first. If the template is the first encoded template in the encoding order between encoding templates, then the first pixel of the current template No predictive encoding is performed. If not, the first pixel can be predictively encoded.

Step 6: According to the internal encoding sequence of the encoding template, encode subsequent pixels in sequence. In one way, during encoding, the reconstructed values of M coded pixels closest to the current pixel and N reconstructed values in the reference pixel queue can be selected for prediction, if one of the reconstructed pixels is selected as the reference pixel , then only the subscript index and prediction residual of the pixel are encoded. If no reference pixel is selected, encode the original pixel value and self-reference index value.

Step 7: Update the reconstruction value in the reference pixel queue, which can be updated according to the proximity principle or the cumulative hit rate.

Step 8: Enter the inter-template matching mode, which includes: firstly determine the coding template for matching, wherein the coding template should be able to completely cover the group of templates to be coded after undergoing certain non-zooming operations such as rotation and mirroring.

Step 9: Perform a difference operation between the pixels in each coding template and the corresponding pixels in the original region to be coded one by one, and record the residual.

Step 10: Traverse and calculate all reference template groups within the effective range, sort according to the total value and mean value of the residual, and select the optimal coding template as the target coding template.

Step 11: In one mode, for coding designs that only use the same template, it is allowed to establish a dynamically updated temporary reference template. Specifically, each pixel position in the encoding template is used to record the pixel value that is most frequently hit at this position during the current encoding process within a certain time range. In the process of traversing the template, the encoding template will also be used as a reference position to be traversed and calculated.

In the present application, the encoding parameters corresponding to each area to be encoded can be respectively determined, and the encoding parameters include pixel positions in the area to be encoded, at least one encoding template and a reference pixel queue, and the encoding template is a template corresponding to an irregular shape; The determined intra-template matching rules, inter-encoding matching rules, and reference pixel queues use each encoding template to perform predictive encoding on the pixels in the area to be encoded, and obtain the encoding result corresponding to each encoding template; select the code rate and distortion in the encoding result The prediction mode with the least cost is used as the optimal prediction mode, and the optimal prediction mode is used to perform predictive encoding on each region to be encoded. By applying the technical solution of the present application, after the region to be coded is obtained, a variety of pre-designed templates of irregular shapes can be used to perform matching of pixels inside the template and between templates for the region to be coded, thereby providing a A more compact coded data expression form can improve the problem of low quality of decoded and reconstructed images caused by coefficient loss caused by inaccurate prediction.

Optionally, in another embodiment based on the above method of the present application, after determining the encoding parameters corresponding to the region to be encoded, further includes:

determining the internal encoding order of each encoding template; and, determining the encoding order among the individual encoding templates;

Sequentially perform predictive coding on each region to be coded based on the coding order among the coding templates; and,

Based on the internal coding order of each coding template, sequentially perform predictive coding on each pixel in the region to be coded.

Optionally, in another embodiment based on the above-mentioned method of the present application, performing predictive coding on each pixel in the region to be coded sequentially based on the internal coding sequence of each coding template includes:

Detect whether the current coding template is the first coding template;

If so, according to the internal encoding order, predictive encoding is performed on other pixels except the first pixel in the area to be encoded, using the pixel default value as the predicted value, wherein the pixel default value is the largest pixel in the corresponding encoding template. half of the pixel value;

If not, perform predictive coding on the pixels in the region to be coded according to the internal coding order.

Optionally, in another embodiment based on the above-mentioned method of the present application, performing predictive coding on each pixel in the region to be coded sequentially based on the internal coding sequence of each coding template includes:

Perform predictive coding on each pixel in the region to be coded by using the reconstructed value of at least one reference pixel, where the reference pixel is a coded pixel adjacent to the current pixel to be coded

Optionally, in another embodiment based on the above-mentioned method of the present application, after obtaining the coding result corresponding to each coding template, it further includes:

After each encoding template is translated, rotated, scaled and coincident with the current encoding area, calculate the residual value between each corresponding pixel between the encoding result corresponding to the encoding template and the corresponding original area to be encoded;

According to the residual value, a target coding template whose coding result meets a preset residual condition is selected as an optimal coding template of the region to be coded.

Optionally, in another embodiment based on the above method of the present application, according to the residual value, the target coding template whose coding result reaches the preset residual condition is selected as the optimal coding template of the region to be coded ,include:

Iteratively calculate the total residual value and residual mean value between the coding result corresponding to each coding template and the corresponding original area to be coded, and perform a process for each coding template according to the relationship between the total residual value and the residual mean value. Sorting of code rate and distortion cost;

The prediction method with the smallest bit rate and distortion cost is selected as the optimal prediction method.

Furthermore, the present application proposes a template-based adaptive matching algorithm, which can perform pixel prediction between templates and inside templates by designing a variety of different template types. In lossless video coding or light compression coding, the algorithm achieves better compression performance without loss of subjective quality by means of template internal pixel matching and template overall translation matching.

In one manner, the coding template in this application may be an irregularly shaped L-shaped coding template as shown in FIG. 3 . As shown in Figure 4, it is the area to be encoded, and the dark gray area is the encoded area, and the area where abc is located, the area where 123 is located, and the area where 456 is located are three templates. Wherein, a, b, and c are coded reference historical pixels. In the area where 123 is located and the area where 456 is located, the upper number is the current pixel label, and the lower number is the pixel number for reference. Regions of different colors can be directly referenced through rotation or translation (that is, the regions of each coding template can be directly referenced to the regions of the other two coding templates).

Among them, the present application can expand the mode of image prediction in video coding to improve the coding performance. These specifically include template generation, template combination, template rotation, scaling, clipping, splicing and other methods for generating templates. In addition, the present application can also perform prediction, reference and other methods for generating reconstructed pixel values within each coding template area and between coding templates.

By applying the technical solution of the present application, after the region to be coded is obtained, a variety of pre-designed templates of irregular shapes can be used to perform matching of pixels inside the template and between templates for the region to be coded, thereby providing a A more compact coded data expression form can improve the problem of low quality of decoded and reconstructed images caused by coefficient loss caused by inaccurate prediction.

Optionally, in another implementation manner of the present application, as shown in FIG. 5 , the present application further provides a data encoding device based on an irregular template. These include:

The determination module 201 is configured to determine encoding parameters corresponding to each area to be encoded, the encoding parameters include pixel positions in the area to be encoded, at least one encoding template and a reference pixel queue, the encoding template is corresponding to Irregularly shaped templates;

The encoding module 202 is configured to use each encoding template to predictively encode the pixels in the area to be encoded based on the predetermined intra-template matching rules, inter-encoding matching rules, and reference pixel queues, to obtain the corresponding The encoding result;

The selection module 203 is configured to select the prediction mode with the smallest code rate and distortion cost in the encoding result as the optimal prediction mode, and use the optimal prediction mode to perform predictive encoding on each region to be encoded.

In the present application, the encoding parameters corresponding to each area to be encoded can be respectively determined, and the encoding parameters include pixel positions in the area to be encoded, at least one encoding template and a reference pixel queue, and the encoding template is a template corresponding to an irregular shape; The determined intra-template matching rules, inter-encoding matching rules, and reference pixel queues use each encoding template to perform predictive encoding on the pixels in the area to be encoded, and obtain the encoding result corresponding to each encoding template; select the code rate and distortion in the encoding result The prediction mode with the least cost is used as the optimal prediction mode, and the optimal prediction mode is used to perform predictive encoding on each region to be encoded. By applying the technical solution of the present application, after the region to be coded is obtained, a variety of pre-designed templates of irregular shapes can be used to perform matching of pixels inside the template and between templates for the region to be coded, thereby providing a A more compact coded data expression form can improve the problem of low quality of decoded and reconstructed images caused by coefficient loss caused by inaccurate prediction.

In another embodiment of the present application, the determination module 201 is configured to execute the steps including:

determining the internal encoding order of each encoding template; and, determining the encoding order among the individual encoding templates;

Sequentially perform predictive coding on each region to be coded based on the coding order among the coding templates; and,

Based on the internal coding order of each coding template, sequentially perform predictive coding on each pixel in the region to be coded.

In another embodiment of the present application, the determination module 201 is configured to execute the steps including:

Detect whether the current coding template is the first coding template;

If so, according to the internal encoding order, predictive encoding is performed on other pixels except the first pixel in the area to be encoded, using the pixel default value as the predicted value, wherein the pixel default value is the largest pixel in the corresponding encoding template. half of the pixel value;

If not, perform predictive coding on the pixels in the region to be coded according to the internal coding sequence.

In another embodiment of the present application, the determination module 201 is configured to execute the steps including:

Each pixel in the region to be coded is predictively coded by using the reconstructed value of at least one reference pixel, where the reference pixel is a coded pixel adjacent to the current pixel to be coded.

In another embodiment of the present application, the determination module 201 is configured to execute the steps including:

After each encoding template is translated, rotated, scaled and coincident with the current encoding area, calculate the residual value between each corresponding pixel between the encoding result corresponding to the encoding template and the corresponding original area to be encoded;

According to the residual value, a target coding template whose coding result meets a preset residual condition is selected as an optimal coding template of the region to be coded.

In another embodiment of the present application, the determination module 201 is configured to execute the steps including:

Iteratively calculate the total residual value and residual mean value between the coding result corresponding to each coding template and the corresponding original area to be coded, and perform a process for each coding template according to the relationship between the total residual value and the residual mean value. Sorting of code rate and distortion cost;

Select the prediction method with the smallest bit rate and distortion cost as the optimal prediction method

Fig. 6 is a logical structural block diagram of an electronic device according to an exemplary embodiment. For example, the electronic device 300 may be a mobile phone, a computer, a digital broadcast terminal, a messaging device, a game console, a tablet device, a medical device, a fitness device, a personal digital assistant, and the like.

In an exemplary embodiment, there is also provided a non-transitory computer-readable storage medium including instructions, such as a memory including instructions, the instructions can be executed by a processor of an electronic device to complete the above-mentioned data encoding method based on an irregular template, The method includes: respectively determining encoding parameters corresponding to each area to be encoded, the encoding parameters including pixel positions in the area to be encoded, at least one encoding template and a reference pixel queue, the encoding template is corresponding to an irregular shape a template; based on the predetermined intra-template matching rules, inter-encoding matching rules, and reference pixel queues, each encoding template is used to perform predictive encoding on the pixels in the region to be encoded, and an encoding result corresponding to each encoding template is obtained; Select the prediction mode with the smallest code rate and distortion cost in the encoding result as the optimal prediction mode, and use the optimal prediction mode to perform predictive encoding on each region to be encoded. Optionally, the above instructions may also be executed by a processor of the electronic device to complete other steps involved in the above exemplary embodiments. For example, the non-transitory computer readable storage medium may be ROM, random access memory (RAM), CD-ROM, magnetic tape, floppy disk, optical data storage device, and the like.

In an exemplary embodiment, there is also provided an application program/computer program product comprising one or more instructions executable by a processor of an electronic device to complete the above-mentioned irregular template-based data An encoding method, the method includes: respectively determining encoding parameters corresponding to each area to be encoded, the encoding parameters including pixel positions in the area to be encoded, at least one encoding template and a reference pixel queue, the encoding template is corresponding to Irregular-shaped templates; based on predetermined intra-template matching rules, inter-encoding matching rules, and reference pixel queues, each encoding template is used to perform predictive encoding on the pixels in the region to be encoded, and the pixel corresponding to each encoding template is obtained. Encoding result: selecting the prediction mode with the smallest code rate and distortion cost in the encoding result as the optimal prediction mode, and using the optimal prediction mode to perform predictive encoding on each region to be encoded. Optionally, the above instructions may also be executed by a processor of the electronic device to complete other steps involved in the above exemplary embodiments.

FIG. 6 is an example diagram of an electronic device 300 . Those skilled in the art can understand that the schematic diagram 6 is only an example of the electronic device 300, and does not constitute a limitation to the electronic device 300, and may include more or less components than those shown in the figure, or combine some components, or different components For example, the electronic device 300 may also include an input and output device, a network access device, a bus, and the like.

The so-called processor 302 may be a central processing unit (Central Processing Unit, CPU), and may also be other general-purpose processors, digital signal processors (Digital Signal Processor, DSP), application specific integrated circuits (Application Specific Integrated Circuit, ASIC), Field-Programmable Gate Array (Field-Programmable Gate Array, FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components, etc. The general-purpose processor may be a microprocessor or the processor 302 may be any conventional processor, etc. The processor 302 is the control center of the electronic device 300 and uses various interfaces and lines to connect various parts of the entire electronic device 300 .

The memory 301 can be used to store computer-readable instructions 303 , and the processor 302 implements various functions of the electronic device 300 by running or executing computer-readable instructions or modules stored in the memory 301 and calling data stored in the memory 301 . The memory 301 can mainly include a program storage area and a data storage area, wherein the program storage area can store an operating system, at least one application program required by a function (such as a sound playback function, an image playback function, etc.); Data and the like created by use of the electronic device 300 . In addition, the memory 301 may include a hard disk, a memory, a plug-in hard disk, a smart memory card (Smart Media Card, SMC), a secure digital (Secure Digital, SD) card, a flash memory card (Flash Card), at least one magnetic disk storage device, a flash memory device, read-only memory (Read-Only Memory, ROM), random access memory (Random Access Memory, RAM), or other non-volatile/volatile storage devices.

If the integrated modules of the electronic device 300 are realized in the form of software function modules and sold or used as independent products, they may be stored in a computer-readable storage medium. Based on such an understanding, the present invention realizes all or part of the processes in the methods of the above embodiments, and can also use computer-readable instructions to instruct related hardware to complete, and the computer-readable instructions can be stored in a computer-readable storage medium. When the computer-readable instructions are executed by the processor, the steps of the above-mentioned various method embodiments can be realized.

Other embodiments of the present application will be readily apparent to those skilled in the art from consideration of the specification and practice of the invention disclosed herein. This application is intended to cover any modification, use or adaptation of the application, these modifications, uses or adaptations follow the general principles of the application and include common knowledge or conventional technical means in the technical field not disclosed in the application . The specification and examples are to be considered exemplary only, with a true scope and spirit of the application indicated by the following claims.

It should be understood that the present application is not limited to the precise constructions which have been described above and shown in the accompanying drawings, and various modifications and changes may be made without departing from the scope thereof. The scope of the application is limited only by the appended claims.

Claims (6)

1. A data encoding method based on an irregular template, characterized in that, comprising: Respectively determine encoding parameters corresponding to each area to be encoded, the encoding parameters include pixel positions in the area to be encoded, at least one encoding template, and a reference pixel queue, the encoding template is a template corresponding to an irregular shape; Based on the predetermined intra-template matching rules, inter-encoding matching rules, and reference pixel queues, each encoding template is used to perform predictive encoding on the pixels in the region to be encoded, and an encoding result corresponding to each encoding template is obtained; Selecting the prediction method with the smallest code rate and distortion cost in the coding result as the optimal prediction method, and using the optimal prediction method to perform predictive coding on each region to be coded; Wherein, after said determining the encoding parameters corresponding to the area to be encoded, it also includes: determining the internal encoding order of each encoding template; and, determining the encoding order among the individual encoding templates; Sequentially perform predictive coding on each region to be coded based on the coding order among the coding templates; and, Sequentially perform predictive coding on each pixel in the region to be coded based on the internal coding sequence of each coding template; Wherein, after the encoding result corresponding to each encoding template is obtained, it also includes: After each encoding template is translated, rotated, scaled and coincident with the current encoding area, calculate the residual value between each corresponding pixel between the encoding result corresponding to the encoding template and the corresponding original area to be encoded; According to the residual value, selecting the target coding template whose coding result meets the preset residual condition as the optimal coding template of the region to be coded; Wherein, according to the residual value, selecting the target coding template whose coding result meets the preset residual condition as the optimal coding template of the region to be coded includes: Iteratively calculate the total residual value and residual mean value between the coding result corresponding to each coding template and the corresponding original area to be coded, and perform a process for each coding template according to the relationship between the total residual value and the residual mean value. Sorting of code rate and distortion cost; The prediction method with the smallest bit rate and distortion cost is selected as the optimal prediction method. 2. The method according to claim 1, characterized in that, performing predictive coding on each pixel in the region to be coded sequentially based on the internal coding order of each coding template, comprising: Detect whether the current coding template is the first coding template; If so, according to the internal encoding order, predictive encoding is performed on other pixels except the first pixel in the area to be encoded, using the pixel default value as the predicted value, wherein the pixel default value is the largest pixel in the corresponding encoding template. half of the pixel value; If not, perform predictive coding on the pixels in the region to be coded according to the internal coding sequence. 3. The method according to claim 1, wherein said performing predictive coding on each pixel in the region to be coded sequentially based on the internal coding sequence of each coding template comprises: Each pixel in the region to be coded is predictively coded by using the reconstructed value of at least one reference pixel, where the reference pixel is a coded pixel adjacent to the current pixel to be coded. 4. A data encoding device based on an irregular template, characterized in that it comprises: The determining module is configured to separately determine encoding parameters corresponding to each area to be encoded, the encoding parameters include pixel positions in the area to be encoded, at least one encoding template, and a reference pixel queue, the encoding templates are corresponding to different Regularly shaped templates; The encoding module is configured to use each encoding template to perform predictive encoding on the pixels in the area to be encoded based on the predetermined intra-template matching rules, inter-encoding matching rules, and reference pixel queues, to obtain the pixels corresponding to each encoding template. encoding result; The selection module is configured to select the prediction mode with the smallest code rate and distortion cost in the encoding result as the optimal prediction mode, and use the optimal prediction mode to perform predictive encoding on each region to be encoded; Wherein, after said determining the encoding parameters corresponding to the area to be encoded, it also includes: determining the internal encoding order of each encoding template; and, determining the encoding order among the individual encoding templates; Sequentially perform predictive coding on each region to be coded based on the coding order among the coding templates; and, Sequentially perform predictive coding on each pixel in the region to be coded based on the internal coding sequence of each coding template; Wherein, after the encoding result corresponding to each encoding template is obtained, it also includes: After each encoding template is translated, rotated, scaled and coincident with the current encoding area, calculate the residual value between each corresponding pixel between the encoding result corresponding to the encoding template and the corresponding original area to be encoded; According to the residual value, selecting the target coding template whose coding result meets the preset residual condition as the optimal coding template of the region to be coded; Wherein, according to the residual value, selecting the target coding template whose coding result meets the preset residual condition as the optimal coding template of the region to be coded includes: Iteratively calculate the total residual value and residual mean value between the coding result corresponding to each coding template and the corresponding original area to be coded, and perform a process for each coding template according to the relationship between the total residual value and the residual mean value. Sorting of code rate and distortion cost; The prediction method with the smallest bit rate and distortion cost is selected as the optimal prediction method. 5. An electronic device, characterized in that it comprises: memory for storing executable instructions; and, A processor, configured to work with the memory to execute the executable instructions so as to complete the operations of the irregular template-based data encoding method in any one of claims 1-3. 6. A computer-readable storage medium for storing computer-readable instructions, characterized in that, when the instructions are executed, any of the irregular template-based data encoding methods in claims 1-3 is executed operate.

Images