CN114666593A - Method, Apparatus, Device and Medium for Determining Starting Point Based on Encoded Cache Information - Google Patents

Abstract

The invention discloses a method, a device, equipment and a medium for determining a starting point based on coding cache information, which are used for acquiring first coding cache information of a source coding unit of a current coding unit, acquiring second coding cache information of an adjacent coding unit of the current coding unit, and generating a temporary block vector list according to the first coding cache information and/or the second coding cache information, wherein the first coding cache information comprises a plurality of first block vectors searched by the source coding unit in a coding process and the second coding cache information comprises a second block vector corresponding to a first reference block with the minimum rate distortion cost of the adjacent coding unit, so that when the searching starting point of the current coding unit is determined according to the temporary block vector list, more references can be provided, and a better searching starting point can be determined to improve the coding effect, the invention can be widely applied to the technical field of coding.

Description

Method, Apparatus, Device and Medium for Determining Starting Point Based on Coded Cache Information

technical field

The present invention relates to the field of coding, in particular to a method, apparatus, device and medium for determining a starting point based on coding buffer information.

Background technique

Each frame of image in the video is divided into small blocks, which are encoded separately. These small blocks are also called coding units (CU, coding units) or coding blocks (CB, coding blocks). The coding unit is trying to When encoding in the inter prediction mode or the intra block copy mode (Intra Block Copy, IBC mode), the motion search method is used to search for the reference block most similar to the current coding unit in space. If the current coding unit (CU, coding unit) ) There is a coding unit coded using the intra-block copy mode in the adjacent coded area, then it will use the position of the reference block of the adjacent coding unit as the search starting point, and then start the block matching search to finally determine the optimal Therefore, it can be seen that during motion search, the selection of the search starting point will have a certain impact on the coding performance of the encoder, which will affect the coding effect.

SUMMARY OF THE INVENTION

In view of this, in order to solve the above-mentioned technical problems, the purpose of the present invention is to provide a method, apparatus, device and medium for determining the starting point based on the encoding buffer information, which improves the encoding effect.

The technical solution adopted in the embodiment of the present invention is:

The starting point determination method based on the encoded buffer information, including:

Obtain the first encoding buffer information of the source encoding unit of the current encoding unit; the encoding order of the source encoding unit is earlier than the current encoding unit, and the first encoding buffer information includes the source encoding unit searched in the encoding process Several first block vectors of ;

Acquiring second encoding buffer information of adjacent encoding units of the current encoding unit; the second encoding buffer information includes a second block vector corresponding to the first reference block with the smallest rate-distortion cost of the adjacent encoding unit;

generating a temporary block vector list according to the first encoding buffer information and/or the second encoding buffer information;

A search start point of the current coding unit is determined according to the temporary block vector list.

Further, the obtaining the first encoding buffer information of the source encoding unit of the current encoding unit includes:

When the source coding unit is a parent coding unit, obtain a first buffer block vector list of the parent coding unit; the first buffer block vector list includes several first sub-block vectors;

or,

When the source coding unit is an adjacent layer coding unit, the position information and size information of the adjacent layer coding unit are obtained, and the second cache block vector list is searched according to the position information and the size information; The second cache block vector list includes several second sub-block vectors;

The first block vector includes the first sub-block vector and the second sub-block vector, the adjacent layer coding unit and the current coding unit are obtained by dividing the parent coding unit, the phase The adjacent layer coding unit is obtained by dividing the current coding unit or the current coding unit is obtained by dividing the adjacent layer coding unit.

Further, the searching for the second cache block vector list according to the position information and the size information includes:

Calculate the first hash key value according to the location information and the size information and obtain a hash table; the hash table includes several historical hash key values and the history corresponding to each historical hash key value A cache block vector list, the historical hash key value is calculated according to the position information and size information of different adjacent layer coding units, and the historical cache block vector list includes different adjacent layer coding units searched in the encoding process The history block vector of;

The historical cache block vector list corresponding to the historical hash key value equal to the first hash key value is used as the second cache block vector list.

Further, the method also includes:

According to the search starting point, a second reference block is searched to obtain a number of first candidate block vectors corresponding to the second reference blocks;

Complete encoding according to the first candidate block vector with the smallest rate-distortion cost and the current coding unit, acquire new position information and new size information of the current coding unit, and calculate according to the new position information and new size information For the second hash key, the second hash key and all the first candidate block vectors are stored in the hash table.

Further, the method also includes:

According to the search starting point, a third reference block is searched to obtain a number of second candidate block vectors corresponding to the third reference blocks;

The encoding is completed according to the second candidate block vector with the smallest rate-distortion cost and the current coding unit, and all the second candidate block vectors are stored.

Further, generating a temporary block vector list according to the first encoding buffer information and/or the second encoding buffer information includes:

determining the optimal coding mode of the adjacent coding unit;

When the optimal encoding mode is the intra-block copy mode, a temporary block vector list is generated according to the first encoding buffer information and the second encoding buffer information, otherwise a temporary block vector list is generated according to the first encoding buffer information .

Further, the determining the search starting point of the current coding unit according to the temporary block vector list includes:

When the temporary block vector list includes the first block vector and the second block vector, the rate-distortion costs corresponding to all the first block vectors and the second block vector are calculated, and the first block vector corresponding to the smallest rate-distortion cost is calculated. A block vector or a second block vector is used as a target block vector, and the search start point of the current coding unit is determined according to the target block vector;

Or, when the temporary block vector list includes the first block vector, calculate the rate-distortion costs corresponding to all the first block vectors, and use the first block vector corresponding to the smallest rate-distortion cost as the target block vector, according to the target block vector. The block vector determines the search start point of the current coding unit.

An embodiment of the present invention also provides a device for determining a starting point based on encoded buffer information, including:

a first obtaining module, configured to obtain first encoding buffer information of the source encoding unit of the current encoding unit; the encoding order of the source encoding unit is earlier than the current encoding unit, and the first encoding buffer information includes the source encoding Several first block vectors searched by the unit in the encoding process;

a second obtaining module, configured to obtain second coding buffer information of adjacent coding units of the current coding unit; the second coding buffer information includes a first reference block with the smallest rate-distortion cost of the adjacent coding unit the corresponding second block vector;

a generating module, configured to generate a temporary block vector list according to the first encoding buffer information and/or the second encoding buffer information;

A determining module, configured to determine a search start point of the current coding unit according to the temporary block vector list.

An embodiment of the present invention further provides an electronic device, the electronic device includes a processor and a memory, and the memory stores at least one instruction, at least a piece of program, a code set or an instruction set, the at least one instruction, the at least one A program, the code set or the instruction set is loaded and executed by the processor to implement the method.

An embodiment of the present invention further provides a computer-readable storage medium, where at least one instruction, at least one piece of program, code set or instruction set is stored in the storage medium, the at least one instruction, the at least one piece of program, the code A set or set of instructions is loaded and executed by a processor to implement the method.

The beneficial effects of the present invention are: by acquiring the first encoding buffer information of the source encoding unit of the current encoding unit, and acquiring the second encoding buffer information of the adjacent encoding units of the current encoding unit, according to the first encoding buffer information and /or the second encoding buffer information generates a temporary block vector list, and the first encoding buffer information includes several first block vectors searched by the source encoding unit in the encoding process, and the second encoding buffer information includes and The second block vector corresponding to the first reference block with the smallest rate-distortion cost of the adjacent coding unit, so when determining the search start point of the current coding unit according to the temporary block vector list, more references can be provided , which helps to determine a better search starting point to improve the coding effect.

Description of drawings

1 is a schematic flowchart of the steps of a method for determining a starting point based on encoded buffer information according to the present invention;

2 is a schematic diagram of a current coding unit and a source coding unit according to a specific embodiment of the present invention;

FIG. 3 is a schematic diagram of a hash table according to a specific embodiment of the present invention.

Detailed ways

In order to make those skilled in the art better understand the solutions of the present application, the technical solutions in the embodiments of the present application will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present application. Obviously, the described embodiments are only The embodiments are part of the present application, but not all of the embodiments. Based on the embodiments in the present application, all other embodiments obtained by those of ordinary skill in the art without creative work shall fall within the scope of protection of the present application.

The terms "first", "second", "third" and "fourth" in the description and claims of the present application and the drawings are used to distinguish different objects, rather than to describe a specific order . Furthermore, the terms "comprising" and "having" and any variations thereof are intended to cover non-exclusive inclusion. For example, a process, method, system, product or device comprising a series of steps or units is not limited to the listed steps or units, but optionally also includes unlisted steps or units, or optionally also includes For other steps or units inherent to these processes, methods, products or devices.

Reference herein to an "embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment can be included in at least one embodiment of the present application. The appearances of the phrase in various places in the specification are not necessarily all referring to the same embodiment, nor a separate or alternative embodiment that is mutually exclusive of other embodiments. It is explicitly and implicitly understood by those skilled in the art that the embodiments described herein may be combined with other embodiments.

As shown in FIG. 1 , an embodiment of the present invention provides a method for determining a starting point based on encoding buffer information, including steps S100-S400:

S100. Acquire first encoding buffer information of the source encoding unit of the current encoding unit.

In this embodiment of the present invention, the coding order of the source coding unit is earlier than the current coding unit; optionally, the source coding unit may be a parent coding unit or an adjacent layer coding unit, and the parent coding unit or the adjacent layer coding unit adopts the The coding modes are all intra-block copy modes; in some embodiments, the source coding unit may also be the parent coding unit of the parent coding unit. It should be noted that the adjacent layer coding unit and the current coding unit are obtained by dividing the parent coding unit, the adjacent layer coding unit is obtained by dividing the current coding unit, or the current coding unit is obtained by dividing the adjacent layer coding unit. For example, as shown in FIG. 2 , the coding unit A with the largest size is divided into four coding units A by a division method (including but not limited to binary tree, ternary tree and quad tree, etc., and FIG. 2 uses quad tree as an example) Coding unit B, the coding unit B is divided into four coding units C, and the coding unit C is further divided into four coding units D (not shown), then it is assumed that the current coding unit is the coding unit C, and the coding unit A is The parent coding units of coding units B, C, and D and the coding order of the parent coding units are earlier than coding units B, C, and D. In the actual coding process, according to the recursive division of the encoder and its traversal order, there may be coding units B, C, and D. The coding order of D is earlier than that of coding unit C, so coding units B and D may both be adjacent layer coding units. It can be understood that when coding unit B is the current coding unit, C and D may be adjacent layer coding units.

In this embodiment of the present invention, the first encoding buffer information includes several first block vectors (first BV (block vector)) searched by the source encoding unit in the encoding process, that is, when the source encoding unit performs a spatial search in the encoding process The block vector corresponding to the searched spatial block (reference block) is saved when the source coding unit performs spatial search for use in subsequent coding, which is more conducive to providing a reference for subsequent spatial searching to determine a better one. search starting point.

Optionally, step S100 is skipped when there is no parent coding unit.

Optionally, step S100 may include step S110 or S120:

S110. When the source coding unit is the parent coding unit, obtain a first cache block vector list of the parent coding unit.

Optionally, when the source coding unit is a parent coding unit, the block vector corresponding to the spatial block (reference block) obtained when the source coding unit performs a spatial search is stored in the first cache block vector list, and the first The block vector stored in the cached block vector list is denoted as the first sub-block vector.

S120. When the source coding unit is an adjacent layer coding unit, obtain the position information and size information of the adjacent layer coding unit, and search the second cache block vector list according to the position information and the size information.

In this embodiment of the present invention, the second cache block vector list includes several second sub-block vectors. Optionally, searching the second cache block vector list according to the position information and size information in step S120 includes steps S1201-S1202:

S1201. Calculate and obtain a first hash key value according to the location information and size information, and obtain a hash table.

In this embodiment of the present invention, the position information may be composed of abscissa x and ordinate y, and the size information may be composed of length w and height h, and the first hash key may be calculated according to the position information and size information of the adjacent layer coding units value(x,y,w,h). Optionally, the calculation method of the first hash key value includes but is not limited to md5 and CRC.

It should be noted that the hash table includes several historical hash key values and a list of historical cache block vectors corresponding to each historical hash key value. The historical hash key value is based on the location information and size of different adjacent layer coding units. According to the information calculation, the list of historical cache block vectors includes the historical block vectors searched by different adjacent layer coding units in the coding process. Since there may be multiple different adjacent layer coding units whose coding order is earlier than that of the current coding unit, and different adjacent layer coding units each have a corresponding historical cache block vector list, the coding process of adjacent layer coding units is performed during the coding process of adjacent layer coding units. Several block vectors corresponding to several spatial blocks (reference blocks) searched during spatial search are recorded as historical block vectors and form a list of historical cache block vectors. The determined hash key value is recorded as the historical hash key value and corresponds to a historical cache block vector list, as shown in Figure 3, (x _n , y _n , w _n , h _n ) is the historical hash key value, n represents Sequence number, (x _n , y _n , _wn , h _n ) has a corresponding number of BVs (ie, history block vectors). Optionally, duplicate historical block vectors are removed and only one remains when the hash table is generated.

For example, assuming that the key value corresponding to the current coding unit is (x, y, w, h), there may be different historical hash key values of the coding unit of adjacent layers according to the division method, such as: 1) When w = h, there may be:

(x,y,2w,2h),(x-w,y,2w,2h),(x,y-h,2w,2h),(x-w,y-h,2w,2h),(x,y,2w,h), (x-w,y,2w,h),(x,y,w,2h),(x,y-h,w,2h),(x,y,4w,h),(x-w,y,2w,h), (x-3w,y,4w,h),(x,y,w,4h),(x,y-h,w,2h),(x,y-3h,w,4h)

2) When w≠h, there may be:

(x,y,2w,h),(x-w,y,2w,h),(x,y,w,2h),(x,y-h,w,2h),(x,y,4w,h), (x-,y,2w,h),(x-3w,y,4w,h),(x,y,w,4h),(x,y-h,w,2h),(x,y-3h, w,4h).

S1202. Use the historical cache block vector list corresponding to the historical hash key value equal to the first hash key value as the second cache block vector list.

Optionally, the historical cache block vector list corresponding to the historical hash key value equal to the first hash key value is used as the second cache block vector list, and the historical block vector in the historical cache block vector list is the first cache block vector list. Two sub-block vectors, that is, the first block vector may include the first sub-block vector and the second sub-block vector.

S200. Acquire second coding buffer information of adjacent coding units of the current coding unit.

Optionally, the second encoding buffer information includes a second block vector corresponding to the first reference block with the smallest rate-distortion cost of adjacent coding units. For example, the coding sequence of adjacent coding units is the previous sequence of the current coding unit, and the spatial block (referred to as the first reference block) searched during the spatial search in the coding process of adjacent coding units, each first reference The block has a corresponding second block vector, and at this time, the second block vector corresponding to the first reference block with the smallest rate-distortion cost is used as the second encoding buffer information.

S300. Generate a temporary block vector list according to the first encoding buffer information and/or the second encoding buffer information.

It should be noted that the execution order of steps S100, S200 and S300 is arbitrary, and a temporary block vector list may be generated first, and then the first encoding buffer information and/or the second encoding buffer information may be added, or the first encoding buffer information may be obtained. One of the first encoding buffer information and the second encoding buffer information is stored in the temporary block vector list, and then the other one of the first encoding buffer information and the second encoding buffer information is added to the temporary block vector list.

It should be noted that when the temporary block vector list is empty, the zero block vector is directly used as the search starting point.

Optionally, step S300 includes S310-S320:

S310. Determine the optimal coding mode of adjacent coding units.

S320. When the optimal encoding mode is the intra-block copy mode, generate a temporary block vector list according to the first encoding buffer information and the second encoding buffer information, otherwise, generate a temporary block vector list according to the first encoding buffer information.

In this embodiment of the present invention, when the optimal encoding mode is the intra-block copy mode, a temporary block vector list is generated according to the first encoding buffer information and the second encoding buffer information, and when the optimal encoding mode is the intra-block copy mode, it is ignored at this time Alternatively, the second encoding buffer information is not acquired, and the temporary block vector list is directly generated according to the first encoding buffer information.

S400. Determine the search start point of the current coding unit according to the temporary block vector list.

Optionally, step S400 includes step S410 or S420:

S410. When the temporary block vector list includes the first block vector and the second block vector, calculate the rate-distortion cost corresponding to all the first block vectors and the second block vector, and assign the first block vector or the second block vector corresponding to the smallest rate-distortion cost The block vector is used as the target block vector, and the search start point of the current coding unit is determined according to the target block vector.

S420. When the temporary block vector list includes the first block vector, calculate the rate-distortion costs corresponding to all the first block vectors, use the first block vector corresponding to the smallest rate-distortion cost as the target block vector, and determine the current coding unit according to the target block vector search starting point.

In this embodiment of the present invention, when the temporary block vector list includes the first block vector and the second block vector, the rate-distortion costs corresponding to all the first block vectors and the second block vector are calculated, for example, the smallest rate-distortion cost corresponds to one of them The first block vector is determined as the target block vector, and if the minimum rate-distortion cost corresponds to the second block vector, the second block vector is determined as the target block vector. When there is only the first block vector in the temporary block vector list, the first block vector corresponding to the smallest rate-distortion cost is determined as the target block vector.

Optionally, the method for determining the starting point based on the encoded buffer information according to the embodiment of the present invention further includes step S500 or S600:

S500. Search the second reference block according to the search starting point, and obtain first candidate block vectors corresponding to several second reference blocks; complete the encoding according to the first candidate block vector with the smallest rate-distortion cost and the current coding unit, and obtain the current coding unit The new position information and the new size information are calculated, and the second hash key value is calculated according to the new position information and the new size information, and the second hash key value and all the first candidate block vectors are stored in the hash table.

Optionally, use the search starting point to perform a spatial search of the second reference block, obtain several second reference blocks and the first candidate block vector corresponding to the second reference block, and use the first candidate block vector with the smallest rate-distortion cost as the most The best candidate block vector is combined with the current coding unit to complete the encoding. Among them, the new position information and new size information of the current coding unit are also obtained, and the second hash key value is calculated according to the new position information and the new size information, and the second hash key value and all the first candidate block vectors are calculated. Save to hash table. It should be noted that, as shown in Figure 3, assuming that the second hash key value is also (x, y, w, h), the second hash key value (x, y, w, h) is used as the new key value And join the hash table together with the first candidate block vector. When the new current coding unit is determined, the new key value is also equivalent to the historical hash key value, and the first candidate block vector is equivalent to the historical block vector, forming a historical cache. List of block vectors.

S600, carry out the search of the third reference block according to the search starting point, and obtain the second candidate block vector corresponding to several third reference blocks;

The encoding is completed according to the second candidate block vector with the smallest rate-distortion cost and the current coding unit, and all the second candidate block vectors are stored.

Optionally, use the search starting point to search for the third reference block, obtain several third reference blocks and second candidate block vectors corresponding to the third reference blocks, and use the second candidate block vector with the smallest rate-distortion cost as the best. The candidate block vector is combined with the current coding unit to complete encoding, and all second candidate block vectors are stored.

Optionally, after step S500 or S600, the method for determining a starting point based on encoding buffer information in this embodiment of the present invention includes step S700:

Determine the new current coding unit and perform coding attempts in other prediction modes (such as intra-frame coding, inter-frame coding, etc.). If the intra-frame block copy mode is the optimal coding mode, the new current coding unit is divided. According to the division The subsequent new current coding unit is taken as the current coding unit in step S100, and the process returns to step S100.

An embodiment of the present invention also provides a device for determining a starting point based on encoded buffer information, including:

The first acquisition module is used to acquire the first encoding buffer information of the source encoding unit of the current encoding unit; the encoding order of the source encoding unit is earlier than the current encoding unit, and the first encoding buffer information includes the source encoding unit searched in the encoding process. several first block vectors;

The second obtaining module is configured to obtain second coding buffer information of adjacent coding units of the current coding unit; the second coding buffer information includes a second block vector corresponding to the first reference block with the smallest rate-distortion cost of the adjacent coding unit ;

a generating module, configured to generate a temporary block vector list according to the first encoding buffer information and/or the second encoding buffer information;

The determining module is configured to determine the search start point of the current coding unit according to the temporary block vector list.

The contents in the above method embodiments are all applicable to the present device embodiments, the specific functions implemented by the present device embodiments are the same as the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above method embodiments.

An embodiment of the present invention further provides an electronic device, the electronic device includes a processor and a memory, and the memory stores at least one instruction, at least one program, code set or instruction set, at least one instruction, at least one program, code set or instruction set The set is loaded and executed by the processor to implement the method for determining the starting point based on the encoded buffer information of the foregoing embodiments. The electronic device in the embodiment of the present invention includes, but is not limited to, any intelligent terminal such as a mobile phone, a tablet computer, and a computer.

The contents in the above method embodiments are all applicable to the present device embodiments, the specific functions implemented by the present device embodiments are the same as the above method embodiments, and the beneficial effects achieved are also the same as those achieved by the above method embodiments.

Embodiments of the present invention further provide a computer-readable storage medium, where at least one instruction, at least one piece of program, code set or instruction set is stored in the storage medium, and at least one instruction, at least one piece of program, code set or instruction set is loaded by a processor And execute the method for determining the starting point based on the encoded buffer information in the foregoing embodiment.

Embodiments of the present invention further provide a computer program product or computer program, where the computer program product or computer program includes computer instructions, and the computer instructions are stored in a computer-readable storage medium. The processor of the computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that the computer device executes the method for determining the starting point based on the encoded cache information of the foregoing embodiments.

The terms "first", "second", "third", "fourth", etc. (if any) in the description of the present application and the above-mentioned drawings are used to distinguish similar objects and are not necessarily used to describe a specific order or sequence. It is to be understood that data so used may be interchanged under appropriate circumstances so that the embodiments of the application described herein can be practiced in sequences other than those illustrated or described herein. Furthermore, the terms "comprising" and "having" and any variations thereof, are intended to cover non-exclusive inclusion, for example, a process, method, system, product or device comprising a series of steps or units is not necessarily limited to those expressly listed Rather, those steps or units may include other steps or units not expressly listed or inherent to these processes, methods, products or devices.

It should be understood that, in this application, "at least one (item)" refers to one or more, and "a plurality" refers to two or more. "And/or" is used to describe the relationship between related objects, indicating that there can be three kinds of relationships, for example, "A and/or B" can mean: only A, only B, and both A and B exist , where A and B can be singular or plural. The character "/" generally indicates that the related objects are an "or" relationship. "At least one item(s) below" or similar expressions thereof refer to any combination of these items, including any combination of single item(s) or plural items(s). For example, at least one (a) of a, b or c, can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c" ", where a, b, c can be single or multiple.

In the several embodiments provided in this application, it should be understood that the disclosed apparatus and method may be implemented in other manners. For example, the apparatus embodiments described above are only illustrative. For example, the division of units is only a logical function division. In actual implementation, there may be other division methods, for example, multiple units or components may be combined or integrated. to another system, or some features can be ignored, or not implemented. On the other hand, the shown or discussed mutual coupling or direct coupling or communication connection may be through some interfaces, indirect coupling or communication connection of devices or units, and may be in electrical, mechanical or other forms. Units described as separate components may or may not be physically separated, and components shown as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution in this embodiment. In addition, each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically alone, or two or more units may be integrated into one unit. The above-mentioned integrated units may be implemented in the form of hardware, or may be implemented in the form of software functional units.

The integrated unit, if implemented as a software functional unit and sold or used as a stand-alone product, may be stored in a computer-readable storage medium. Based on this understanding, the technical solutions of the present application can be embodied in the form of software products in essence, or the parts that contribute to the prior art, or all or part of the technical solutions, and the computer software products are stored in a storage medium , including multiple instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods in the various embodiments of the present application. The aforementioned storage medium includes: U disk, mobile hard disk, Read-Only Memory (ROM for short), Random Access Memory (RAM for short), magnetic disk or CD, etc. that can store programs medium.

Above, the above embodiments are only used to illustrate the technical solutions of the present application, but not to limit them; although the present application has been described in detail with reference to the above-mentioned embodiments, those of ordinary skill in the art should understand that: it can still be used for the above-mentioned implementations The technical solutions described in the examples are modified, or some technical features thereof are equivalently replaced; and these modifications or replacements do not make the essence of the corresponding technical solutions deviate from the spirit and scope of the technical solutions in the embodiments of the present application.

Claims (10)

1. The method for determining the starting point based on the coding cache information is characterized by comprising the following steps:

acquiring first coding cache information of a source coding unit of a current coding unit; the encoding sequence of the source encoding unit is earlier than that of the current encoding unit, and the first encoding cache information comprises a plurality of first block vectors searched by the source encoding unit in the encoding process;

acquiring second coding cache information of an adjacent coding unit of the current coding unit; the second coding buffer information comprises a second block vector corresponding to a first reference block with the minimum rate distortion cost of the adjacent coding unit;

generating a temporary block vector list according to the first coding cache information and/or the second coding cache information;

and determining a search starting point of the current coding unit according to the temporary block vector list.

2. The starting point method based on the encoded cache information of claim 1, wherein: the acquiring first encoding cache information of a source encoding unit of a current encoding unit includes:

when the source coding unit is a parent coding unit, acquiring a first cache block vector list of the parent coding unit; the first cache block vector list comprises a plurality of first sub-block vectors;

or,

when the source coding unit is a coding unit of an adjacent layer, acquiring position information and size information of the coding unit of the adjacent layer, and searching a second cache block vector list according to the position information and the size information; the second cache block vector list comprises a plurality of second sub-block vectors;

the first block vector comprises the first sub-block vector and the second sub-block vector, the adjacent layer coding units and the current coding unit are obtained by dividing the parent coding unit, and the adjacent layer coding units are obtained by dividing the current coding unit or the current coding unit is obtained by dividing the adjacent layer coding unit.

3. The starting point method based on the encoded cache information of claim 2, wherein: the searching for the second cache block vector list according to the position information and the size information includes:

calculating to obtain a first hash key value according to the position information and the size information and acquiring a hash table; the hash table comprises a plurality of historical hash key values and a historical cache block vector list corresponding to each historical hash key value, the historical hash key values are obtained by calculation according to position information and size information of different adjacent layer coding units, and the historical cache block vector list comprises historical block vectors searched by different adjacent layer coding units in the coding process;

and taking a historical cache block vector list corresponding to the historical hash key value equal to the first hash key value as a second cache block vector list.

4. The starting point method based on the encoded cache information of claim 3, wherein: the method further comprises the following steps:

searching a second reference block according to the search starting point to obtain a plurality of first candidate block vectors corresponding to the second reference block;

and completing coding according to the first candidate block vector with the minimum rate-distortion cost and the current coding unit, acquiring new position information and new size information of the current coding unit, calculating a second hash key value according to the new position information and the new size information, and storing the second hash key value and all the first candidate block vectors into the hash table.

5. The starting point method based on the encoded cache information of claim 1, wherein: the method further comprises the following steps:

searching a third reference block according to the search starting point to obtain a plurality of second candidate block vectors corresponding to the third reference block;

and finishing coding according to the second candidate block vector with the minimum rate-distortion cost and the current coding unit, and storing all the second candidate block vectors.

6. The starting point method based on the encoded cache information of claim 1, wherein: generating a temporary block vector list according to the first encoding cache information and/or the second encoding cache information, including:

determining an optimal coding mode of the neighboring coding unit;

and when the optimal coding mode is an intra-frame block copy mode, generating a temporary block vector list according to the first coding cache information and the second coding cache information, otherwise, generating a temporary block vector list according to the first coding cache information.

7. The starting point method based on the encoded cache information according to any one of claims 1-6, wherein: the determining a search starting point of the current coding unit according to the temporary block vector list includes:

when the temporary block vector list comprises a first block vector and a second block vector, calculating rate distortion costs corresponding to all the first block vectors and the second block vectors, taking the first block vector or the second block vector corresponding to the minimum rate distortion cost as a target block vector, and determining a search starting point of the current coding unit according to the target block vector;

or, when the temporary block vector list includes first block vectors, rate distortion costs corresponding to all the first block vectors are calculated, the first block vector corresponding to the smallest rate distortion cost is used as a target block vector, and a search starting point of the current coding unit is determined according to the target block vector.

8. An apparatus for determining a starting point based on encoded buffer information, comprising:

the first obtaining module is used for obtaining first coding cache information of a source coding unit of a current coding unit; the encoding sequence of the source encoding unit is earlier than that of the current encoding unit, and the first encoding cache information comprises a plurality of first block vectors searched by the source encoding unit in the encoding process;

the second obtaining module is used for obtaining second coding cache information of an adjacent coding unit of the current coding unit; the second coding buffer information comprises a second block vector corresponding to a first reference block with the minimum rate distortion cost of the adjacent coding unit;

a generating module, configured to generate a temporary block vector list according to the first encoding cache information and/or the second encoding cache information;

a determining module, configured to determine a search starting point of the current coding unit according to the temporary block vector list.

9. An electronic device comprising a processor and a memory, the memory having stored therein at least one instruction, at least one program, a set of codes, or a set of instructions, the at least one instruction, the at least one program, the set of codes, or the set of instructions being loaded and executed by the processor to implement the method according to any one of claims 1-7.

10. A computer readable storage medium having stored therein at least one instruction, at least one program, a set of codes, or a set of instructions, which is loaded and executed by a processor to implement the method according to any one of claims 1 to 7.

Images