CN110352599A - Method and apparatus for video processing - Google Patents

Abstract

The embodiment of the present application provides a kind of method for video processing and equipment, can reduce the complexity of filtering.This method comprises: obtaining at least one first similar block of current block at least one pixel set, wherein the pixel set includes sparse reconstruction pixel, which includes that at least one rebuilds pixel；At least one first similar block based on this constructs structural array；The structural array is decomposed；According to the structural array of decomposition, obtains and rebuild structural array.

Description

Method and apparatus for video processing

Copyright notice

The disclosure of this patent document contains material that is subject to copyright protection. This copyright belongs to the copyright owner. The copyright owner has no objection to the reproduction by anyone of the patent document or the patent disclosure as it exists in the official records and archives of the Patent and Trademark Office.

technical field

The present application relates to the field of video processing, and more particularly, to a method and apparatus for video processing.

Background technique

In the video coding process, filtering is a critical part. It is mainly used to reduce compression artifacts produced during encoding. The loop filters of current video coding standards all use the local similarity characteristics of images to filter, which limits the performance of the filter. In order to further improve the compression performance, a loop filter based on non-local similarity (specifically, a non-local structure-based video coding filter (NLSF)) is applied to the coding framework, which utilizes The non-local self-similarity of the image, the collaborative filtering is performed on the similar structure groups obtained by the search.

When filtering with NLSF, it is necessary to search for similar blocks of the current block, and build a structure array based on the searched similar blocks to perform filtering based on the structure array. Among them, when searching for similar blocks, it is necessary to scan all the pixels in the search window point by point, which leads to high complexity and is difficult to be practical.

Therefore, how to reduce the complexity of the filtering process is an urgent problem to be solved.

SUMMARY OF THE INVENTION

The embodiments of the present application provide a method and device for video processing, which can reduce the complexity of the filtering process.

In a first aspect, a method for video processing is provided, comprising: in at least one pixel set, acquiring at least one first similar block of a current block, wherein the pixel set includes sparse reconstructed pixels, and the current block includes at least one reconstructed pixel; constructing a structure array based on the at least one first similar block; decomposing the structure array; obtaining a reconstructed structure array according to the decomposed structure array.

In a second aspect, there is provided a method for video processing, comprising: obtaining, from reconstructed pixels, at least one similar block of a current block, the current block including at least one reconstructed pixel, wherein The value of the parameter of the similarity of the similar blocks exceeds the first threshold; based on the at least one similar block, a structure array is constructed; the structure array is decomposed; and a reconstructed structure array is obtained according to the decomposed structure array.

In a third aspect, a device for video processing is provided, including: a similar block obtaining unit, configured to obtain at least one first similar block of the current block in at least one pixel set, wherein the pixel set includes sparse reconstructed pixels, the current block includes at least one reconstructed pixel; a construction unit is used to construct a structure array based on the at least one first similar block; a decomposition unit is used to decompose the structure array; array of structures, to obtain an array of reconstructed structures.

In a fourth aspect, a device for video processing is provided, comprising: a similar block obtaining unit, configured to obtain at least one similar block of the current block from the reconstructed pixels, where the current block includes at least one reconstructed pixel, wherein the The value of the parameter representing the similarity between the current block and the similar block exceeds the first threshold; the construction unit is used to construct a structure array based on the at least one similar block; the decomposition unit is used to decompose the structure array; The unit is used to obtain the reconstructed structure array based on the decomposed structure array.

In a fifth aspect, a computer system is provided, comprising: a memory for storing computer-executable instructions; a processor for accessing the memory and executing the computer-executable instructions to perform the above-mentioned first aspect or the second aspect operations in the method.

In a sixth aspect, a computer storage medium is provided, and program codes are stored in the computer storage medium, and the program codes can be used to instruct to execute the method of the first aspect or the second aspect.

In a seventh aspect, a computer program product is provided, the program product includes program code, and the program code can be used to instruct to perform the method of the first aspect or the second aspect.

Therefore, in the method for video processing in this embodiment of the present application, in at least one pixel set, at least one first similar block of the current block is acquired, wherein the pixel set includes sparse reconstructed pixels, and the current block includes at least one first similar block. Reconstructing pixels, constructing a structure array based on the at least one first similar block, decomposing the structure array, and obtaining a reconstructed structure array according to the decomposed structure array, which can reduce the filtering complexity while ensuring the minimum loss of coding performance , thereby reducing the complexity of encoding and decoding, and saving encoding and decoding time.

Description of drawings

In order to illustrate the technical solutions of the embodiments of the present application more clearly, the following briefly introduces the drawings that need to be used in the description of the embodiments or the prior art. Obviously, the drawings in the following description are only some of the drawings in the present application. In the embodiments, for those of ordinary skill in the art, other drawings can also be obtained according to these drawings without any creative effort.

FIG. 1 is a schematic diagram of an encoding system according to an embodiment of the present application.

FIG. 2 is a schematic diagram of an encoding framework according to an embodiment of the present application.

Figure 3 is a schematic diagram of the process of SVD decomposition.

Figure 4 is a schematic diagram of the process of hard thresholding.

FIG. 5 is a schematic flowchart of a method for video processing according to an embodiment of the present application.

FIG. 6 is a schematic diagram of current block selection according to an embodiment of the present application.

FIG. 7 is a schematic diagram of pixel distribution in a template according to an embodiment of the present application.

FIG. 8 is a schematic diagram of a template or pixel set according to an embodiment of the present application.

FIG. 9 is a schematic diagram of obtaining similar blocks in reconstructed pixels according to an embodiment of the present application.

FIG. 10 is a schematic diagram of obtaining similar blocks in reconstructed pixels according to an embodiment of the present application.

FIG. 11 is a schematic diagram of video processing according to an embodiment of the present application.

FIG. 12 is a schematic block diagram of an apparatus for video processing according to an embodiment of the present application.

FIG. 13 is a schematic block diagram of an apparatus for video processing according to an embodiment of the present application.

FIG. 14 is a schematic block diagram of a computer system according to an embodiment of the present application.

Detailed ways

The technical solutions in the embodiments of the present application will be described below with reference to the accompanying drawings in the embodiments of the present application. Obviously, the described embodiments are part of the embodiments of the present application, 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 efforts shall fall within the protection scope of the present application.

Unless otherwise specified, all technical and scientific terms used in the embodiments of the present application have the same meaning as commonly understood by those skilled in the technical field of the present application. The terminology used in this application is for the purpose of describing specific embodiments only and is not intended to limit the scope of the application.

FIG. 1 is an architectural diagram of applying the technical solution of the embodiment of the present application.

As shown in FIG. 1 , the system 100 may receive data 102 to be processed, process the data 102 to be processed, and generate processed data 108 . For example, system 100 may receive data to be encoded and encode the data to be encoded to generate encoded data, or system 100 may receive data to be decoded and decode the data to be decoded to generate decoded data. In some embodiments, components in system 100 may be implemented by one or more processors, which may be processors in computing devices or processors in mobile devices (eg, drones). The processor may be any type of processor, which is not limited in this embodiment of the present application. In some possible designs, the processor may include an Image Signal Processor (ISP), an encoder or decoder, and the like. One or more memories may also be included in system 100 . The memory may be used to store instructions and data, for example, computer-executable instructions for implementing the technical solutions of the embodiments of the present application, data to be processed 102 , processed data 108 , and the like. The memory may be any type of memory, which is also not limited in this embodiment of the present application.

Data to be processed 102 may include text, images, graphical objects, animation sequences, audio, video, or any other data that needs to be encoded or decoded.

Any suitable encoding or decoding technique may be used to encode or decode the data to be processed 102 . The encoding or decoding type depends on the data to be processed and the specific encoding or decoding needs.

In some embodiments, an encoder or decoder may implement one or more different codecs. Each codec may include code, instructions or computer programs that implement different encoding or decoding algorithms. An appropriate encoding or decoding may be selected based on various factors, including the type and/or source of the data 102 to be processed, the receiving entity of the data to be processed, available computing resources, network environment, business environment, rules and standards, etc. The algorithm encodes or decodes the given data 102 to be processed.

For example, an encoder or decoder may be configured to encode or decode a series of video frames. Encoding or decoding the data in each frame can take a series of steps.

FIG. 2 is a frame diagram of an encoder according to an embodiment of the present application. The following will introduce the flow of inter-frame coding and intra-frame coding respectively with reference to FIG. 2 .

As shown in Figure 2, the process of inter-frame coding can be as follows:

In 201, a current frame image is acquired. In 202, a reference frame image is acquired. In 203a, using the reference frame image, motion estimation is performed to obtain a motion vector (Motion Vector, MV) of each image block of the current frame image. In 204a, motion compensation is performed using the motion vector obtained by motion estimation to obtain an estimated value of the current image block. In 205, the estimated value of the current image block is subtracted from the current image block to obtain a residual. At 206, the residuals are transformed to obtain transform coefficients. In 207, the transform coefficients are quantized to obtain quantized coefficients. In 208, entropy encoding is performed on the quantized coefficients, and finally the bit stream obtained by entropy encoding and the encoded encoding mode information are stored or sent to the decoding end. In 209, the quantized result is dequantized. In 210, the inverse quantization result is inverse transformed. In 211, reconstructed pixels are obtained using the inverse transform results and the motion compensation results. At 212, the reconstructed pixels are filtered. In 213, the filtered reconstructed pixels are output.

As shown in Figure 2, the process of intra-frame coding can be as follows:

In 202, the current frame image is acquired. In 203b, intra prediction selection is performed on the current frame image. In 204b, the current image block in the current frame is intra-predicted. In 205, the estimated value of the current image block is subtracted from the current image block to obtain a residual. At 206, the residuals of the image blocks are transformed to obtain transform coefficients. In 207, the transform coefficients are quantized to obtain quantized coefficients. In 208, entropy encoding is performed on the quantized coefficients, and finally the bit stream obtained by entropy encoding and the encoded encoding mode information are stored or sent to the decoding end. In 209, the quantization result is inverse quantized. In 210, inverse transform is performed on the inverse quantization result, and in 211, reconstructed pixels are obtained using the inverse transform result and the intra prediction result.

Among them, the filtering process in 212 can be used to reduce the compression distortion in the encoding process.

Among them, the filtering in 212 can be implemented by a loop filter (Non-local Structure-Based Filter for Video Coding, NLSF) based on the non-local similar characteristics of the image, which mainly uses the non-local structural similarity characteristics of the image to search for Collaborative filtering is performed on groups of similar structures.

Specifically, the current reconstructed image frame or image block may be processed by block. Specifically, the image can be divided into K blocks, and these blocks are respectively used as the current block. And get M similar blocks of the current block in some reconstructed pixels of the image frame or image block. Group M similar blocks into sets. Then the set composed of these similar blocks is represented by a mathematical structure, which can be a one-dimensional, two-dimensional or three-dimensional matrix. The above process can be called Group Construction. The filtering process is the processing process of the matrix (structure array), the purpose is to filter out the distortion and noise introduced in the coding process, this process can be called the filtering based on the structure array (Group-based filtering). Among them, singular value decomposition (SVD) can be performed on the structure array, and a hard threshold operation can be performed on the singular values, and a reconstructed structure group can be obtained according to the result of the singular value decomposition, and finally a reconstructed image can be obtained. Among them, the purpose of SVD decomposition is to extract the principal components of the structure array. Simple SVD cannot play the role of filtering. The key to filtering is to remove noise. The operation of hard threshold is used in NLSF to remove noise.

The description will be made below in conjunction with FIG. 3 and FIG. 4 . Among them, Figure 3 is the process of SVD decomposition, which can be understood as the transformation of the matrix. Specifically, the two-dimensional matrix can be decomposed into the form of the product of three matrices. The middle matrix is a diagonal matrix. The elements on the diagonal are from The upper left corner to the lower right corner decreases in turn, and the smaller elements can be regarded as noise. Among them, the "smaller" evaluation standard can adopt a threshold. If the threshold is 60, then the part smaller than 60 is regarded as noise, directly set to 0. As shown in Figure 4, the three matrices can be multiplied, and the obtained matrix can be different from the original decomposed matrix. This is the result after filtering out the noise. This process can be called a hard thresholding process.

Among them, the complexity of the filtering process comes from obtaining similar blocks of the current block. For example, if NLSF adopts a full search method (also called a point-by-point scan method) to search for the most similar block of the current block in a square search window. The search process can start from the upper left corner of the search window, proceed pixel by pixel in raster scan order, and end at the lower right corner. Each small block found in the search process needs to calculate the sum of squared differences (SSD) with the current block. Finally, sort the SSDs and select the small blocks corresponding to the smallest M SSDs. Specifically, if the full search method is used to search for similar blocks, the 30 most similar blocks are searched in a 33×33 search window, and the number of candidate blocks found in the search process is 1089. The part of block matching is too redundant and may result in the number of candidate blocks being much higher than the number of similar blocks required by NLSF.

Therefore, the embodiments of the present application provide a video processing method, which can simplify the complexity of obtaining similar blocks in the filtering process, thereby improving the efficiency of video encoding and decoding.

It should be understood that the method in this embodiment of the present application may be applied to the encoding framework shown in FIG. 2 , and may also be applied to other encoding frameworks, which is not specifically limited in this embodiment of the present application.

FIG. 5 is a schematic flowchart of a method 300 for video processing according to an embodiment of the present application. The method 300 includes at least some of the following. Wherein, the method 300 may be applied to the encoding end, and may also be applied to the decoding end.

Optionally, the method 300 may be implemented by a filter, which may be part of the encoder or the decoder, or may exist independently of the encoder or the decoder. Optionally, the filter may be an NLSF filter, or other filters.

In 310, the filter obtains at least one first similar block of the current block in at least one pixel set, wherein the pixel set includes sparse reconstructed pixels, and the current block includes at least one reconstructed pixel.

Optionally, the reconstructed pixels included in the pixel set in this embodiment of the present application may be reconstructed pixels before filtering.

Optionally, the similar block (including the first similar block and the second similar block mentioned later) mentioned in the embodiment of the present application may be a block with a higher similarity to the current block, and the size of the similar block may be equal to the current block. block size. The higher the similarity to the current block, the more likely it is to be selected as a similar block.

Among them, the metric parameter used for similarity judgment (that is, the parameter used to characterize the similarity) can be: difference of hash values, sum of squared differences (SSD), sum of absolute errors (Sum of AbsoluteDifferences) , SAD), Mean Absolute Differences (MAD), Mean Square Differences (MSD), or Structural SIMilarity SSIM.

For example, assuming that the measurement parameter of similarity is SSD, the calculation method of SSD is as follows:

Among them, f(h,w) represents the pixel of the current block at coordinates (h,w), represents the pixel of the search block (also called candidate similar block) at coordinates (h, w), Indicates the number of pixels contained in the current block.

For example, if the metric parameter that characterizes the hypothesis similarity is the hash value, the similarity can be judged by the size of the hash value. The closer the hash values of two blocks are, the more similar they are. The hash value can be determined by the pixel and , horizontal, vertical gradients, etc.

It should be understood that, among the above metric parameters, some larger values indicate higher similarity, and smaller values indicate higher similarity.

For example, for SSD, the smaller the value of SSD, the higher the similarity. For the hash value, the similarity can be judged by the difference between the hash values of the two blocks. The smaller the difference between the hash values, the higher the similarity.

It should also be understood that, for the parameter used for characterizing the similarity mentioned in the embodiment of the present application to exceed the threshold (which may include the threshold value), if the value of the metric parameter is larger, the similarity is higher, and the parameter used for characterizing the similarity is higher. If the value of the parameter exceeds a certain value, it means that the value of the parameter is greater than or equal to the threshold; if the value of the metric parameter is smaller, the similarity is higher, and the value of the parameter used to characterize the similarity exceeds a certain value. threshold. As for the hash value, if the value of the parameter used to characterize the similarity exceeds a certain value, it means that the difference between the hash values of the two blocks is less than or equal to the threshold.

Optionally, in this embodiment of the present application, the value of the parameter used to characterize the similarity between the current block and a similar block of the current block exceeds a first threshold.

Optionally, the first threshold is determined based on at least one of the following parameters: the size of the current block, the bit depth of the video, the pixel sum of the current block, the horizontal gradient of the pixels of the current block, the current block The vertical gradient of the pixels.

Among them, the size of the current block directly determines the number of additions in the SSD calculation process, and the bit depth of the video represents the range of pixel values (for example, for an 8-bit video, each pixel value is a number between 0 and 255; 10 bits For video, each pixel value is a number between 0 and 1023. Obviously, different bit depths have different pixel value ranges, and the calculated SSD size ranges are also different).

Wherein, the parameter for determining the threshold may be related to the parameter used in the calculation of the metric parameter.

In one implementation, when the similarity metric is a hash value, the first threshold is determined based on at least one of the following parameters:

The pixel sum of the current block, the horizontal gradient of the pixels of the current block, and the vertical gradient of the pixels of the current block.

Specifically, the similarity can be judged by the size of the hash value. The closer the hash values of two blocks are, the more similar they are. The hash value can be represented by the pixel sum, horizontal and vertical gradients of the blocks, and so on.

In an implementation manner, when the similarity metric is SSD or SAD, the first threshold is determined based on at least one of the following parameters: the size of the current block, and the bit depth of the video.

Wherein, the first threshold may be related to the size of the current block and the bit depth of the video, and the first threshold may be calculated by the following formula 2:

ε=B _s ×(1<<(2×bitDepth))×λ Equation 2

Where bitDepth is the bit depth of the test video, generally 8 or 10. λ can be calculated according to the statistical characteristics of SSD between the current block and similar blocks, Indicates the number of pixels contained in the current block.

In an implementation manner, when the similarity metric is MAD, MSD or SSIM, the first threshold is determined based on the bit depth of the video.

Specifically, the first threshold can be obtained according to the following formula 3:

ε=(1<<(2×bitDepth))×λ Equation 3

Therefore, in this embodiment of the present application, the similarity between the selected similar block and the current block is higher than a certain threshold, so that the similarity between the selected similar block and the current block is higher, so as to avoid the possibility that the selected similar block may be different from the current block. The blocks are quite different, thereby avoiding the problem of high filtering complexity caused by these blocks being less helpful to the filtering process.

Optionally, the embodiments of the present application may be implemented by the encoding end or by the decoding end. When implemented by the encoding end, the encoding end may calculate the first threshold, and transmit the first threshold in the code stream to the decoding end. And, when implemented by the decoding end, the decoding end can obtain the first threshold value from the code stream, and no longer calculate the first threshold value.

Of course, in this embodiment of the present application, the encoding end and the decoding end may calculate the first threshold respectively, and the encoding end does not need to transmit the first threshold in the code stream.

Optionally, in this embodiment of the present application, after the entire reconstructed frame is acquired, the current block may be acquired from the reconstructed frame. Among them, see Figure 6, first look at the two boxes on the upper left, if the box on the left is the current block being processed, then the next block to be processed is the box on the right, and there can be overlaps between these two blocks. It can be next to each other, or it can be separated by a certain distance. For example, for the current block of 6x6 size, the step value between the two boxes (can be the interval between the leftmost pixels of the two boxes) can be 1, 2, 3... etc. any integer value, where the step size is 1, 2, 3, 4, 5, and there is a certain overlap between the two blocks. When the step size is 6, the two blocks are next to each other, and when it is greater than 6 , the two blocks are separated by a certain distance. The other is the interval between the upper and lower blocks. For example, in the middle two boxes as shown in Figure 6, if the upper box is the current block being processed, then the next block to be processed is the lower box. The two blocks can overlap, be next to each other, or be separated by a certain distance.

Optionally, when the entire frame of reconstructed image is obtained for filtering, the pixels in the pixel set may be pixels at any position in the reconstructed image of the current frame, or may be partial pixels in a search window, for example, may be a Part of a 32x32 pixel set where the current block can be centered in the search window.

Optionally, the reconstructed pixels used to obtain similar blocks of the current block include: reconstructed pixels of the coding unit itself to which the current block belongs, reconstructed pixels on the upper side of the coding unit, reconstructed pixels on the left side of the coding unit, and reconstructed pixels on the left side of the coding unit. The reconstructed pixels on the right side of the coding unit and the reconstructed pixels on the lower side of the coding unit.

Optionally, in this embodiment of the present application, after obtaining the reconstructed coding unit (for example, CTU), each block in the coding unit may be filtered. For example, the coding unit may A block may be a 6x6 size block, and the coding unit is generally referred to as an image block. During encoding, when the reconstructed pixels of the current coding unit are obtained, the reconstructed pixels of the coding unit on the left and the upper side have been obtained, the reconstructed pixels of the similar blocks used to obtain the current block may be the left and right pixels of the corresponding coding unit. reconstructed pixels on the side and reconstructed pixels on the top side.

Further, in an actual video coding and decoding system, the reconstructed pixels on the upper side need to be stored in units of image rows, and the reconstructed pixels on the right side are stored in units of image block heights. For example, for an image with a width of 3840 and an image block height of 128, the reconstructed pixels on the upper side are stored in units of 3840, and the reconstructed pixels on the right side are stored in units of 128. It can be seen that the storage cost of the reconstructed pixels on the upper side is generally greater than the storage cost of the reconstructed pixels on the right side. In order to reduce the storage overhead of the video codec system, the number of pixels in the vertical direction of the reconstructed pixels on the upper side (generally, it can be considered as the number of rows of reconstructed pixels on the upper side) may be less than or equal to the left side. The number of pixels in the horizontal direction of the reconstructed pixels on the side (generally, it can be considered as the number of columns of the reconstructed pixels on the left).

Of course, the reconstructed pixels used to obtain the similar blocks of the current block may also be the reconstructed pixels on the left side of the coding unit to which the current block belongs, the reconstructed pixels on the upper side and the reconstructed pixels on the right side (wherein, it is necessary to wait for the reconstructed pixels on the right side). coding units are reconstructed).

The embodiments of the present application may also have other implementation manners. For example, for a currently reconstructed coding unit, for the current block on the upper left side of the coding unit, the reconstructed pixels used to obtain similar blocks may be the left, upper and upper left of the current block. The reconstructed pixels on the side, the lower side and the right side, because the reconstructed pixels on the right side and the lower side of the current block still belong to the current coding unit. And for the current block on the lower right side of the coding unit, the reconstructed pixels used to obtain similar blocks may be the reconstructed pixels on the left side and the upper side of the current block, because the reconstructed pixels on the right side and the lower side of the current block The coding units belonging to the right side and the lower side have not been reconstructed, so they cannot be used to obtain similar blocks of the current block.

It should be understood that the fact that the pixel set in this embodiment of the present application includes sparse reconstructed pixels means that there are some pixels in the pixel set, and the interval between these pixels (for example, on the shortest linear distance between pixels) does not belong to the set of pixels.

Optionally, in this embodiment of the present application, some pixels in the pixel set may also be aggregated into blocks, and the pixel set may be aggregated into multiple separate blocks (there are no adjacent pixels between the blocks mentioned here). ), where the size of each block can be greater than or equal to the size of the current block. For example, as shown in Fig. 7 (one □ represents one pixel position), the pixel set includes five blocks, each block is larger than the current block (assuming that the size of the current block is 6×6), wherein each block in the five blocks can be Formed as one or more candidate similar blocks mentioned below.

Optionally, in this embodiment of the present application, the filter may obtain a pixel set based on a template. Specifically, a template can be preset in the filter, and some reconstructed pixels can be delineated in a search window by using the template, and these reconstructed pixels can understand the pixel set mentioned in the embodiment of the present application.

Optionally, in this embodiment of the present application, a template may also be understood as a set of pixels, and the pixels included in the template may be symmetrical with respect to the center of the template. Optionally, the pixels may be progressively sparser from the center of the template to the edges of the template.

Optionally, when the template is used to determine the pixel set for obtaining similar blocks, there may be such a result that the number of pixels in the pixel set is less than the number of pixels included in the template, this is because the template is used in a search range. When delineating some reconstructed pixels, the edges of the template may go beyond the edges of the search range.

Optionally, the template includes a plurality of candidate similar blocks for selecting the first similar block, and the size of the candidate similar blocks is equal to the size of the current block. The candidate similar block means that when the similarity with the current block exceeds a certain threshold, it can be selected as a similar block. The pixels included in the multiple candidate similar blocks may not overlap or partially overlap.

Optionally, in this embodiment of the present application, the template includes multiple groups of candidate similar blocks from the center to the edge, each group of candidate similar blocks is surrounded by a ring, the ring is symmetrical with respect to the center of the template, and the candidate similar blocks in the group are uniform. Arrange. Of course, the candidate similar blocks included in the template may also be asymmetric.

Optionally, the template includes four groups of candidate similar blocks, and the edge pixels of the four groups of candidate similar blocks far from the center of the template are separated from the center of the template by 1 pixel, 2 pixels, 4 pixels and 8 pixels.

Optionally, the four groups of candidate similar blocks respectively have 4 candidate similar blocks, 8 candidate similar blocks, 8 candidate similar blocks and 8 candidate similar blocks, wherein a group of candidate similar blocks with 4 candidate similar blocks closest to the center of this template.

Specifically, an example will be given below in conjunction with the template shown in FIG. 8 (FIG. 8 can also be considered as a set of pixels obtained based on the template). For example, as shown in Figure 8, the intersection of multiple □ in the figure can be a pixel position, and each independent number represents an independent candidate similar block. For example, if there are 8 ⑧, it means that there are 8 similar candidates There are 8 ④ blocks, which also represent 8 candidate similar blocks, 8 ② represent 8 candidate similar blocks, and 4 ① represent 4 candidate similar blocks, then the entire template includes 28 candidate similar blocks. The numbers ①②④⑧ can be a pixel position of the candidate similar block, for example, it can be the pixel position on the edge of the candidate similar block far from the center of the template, specifically the pixel position of the upper left corner, the pixel position of the lower left corner, and the pixel position of the upper right corner. position, or the pixel position of the lower right corner. Of course, the numbers in the figure represent other pixel positions of the candidate similar blocks, for example, the central pixel position and the like. Assuming that each candidate similar block is a block of size 6×6, it means that these candidate similar blocks overlap each other.

Optionally, in this embodiment of the present application, the filter may use at least two or more templates to determine the pixel set, for example, different pixel sets may be determined using different templates.

It should be understood that the template in this embodiment of the present application may also include other numbers of candidate similar block groups, and each group of candidate similar blocks may also include other numbers of candidate similar blocks.

For example, the pixels of the template can be formed into crosses, bars, polygons other than quadrilaterals, etc. Wherein, when composing other polygons other than quadrilaterals, it can be similar to FIG. 7 with one ring within one ring, for example, a larger pentagon surrounds a smaller pentagon.

It should also be understood that what was described above about the pixel features in the template is also applicable to the pixel set. For brevity, details are not repeated here.

It should be understood that the template or pixel set mentioned in the embodiments of the present application may also include sparse reconstructed pixels. According to certain rules, similar blocks are matched in the sparse reconstructed pixels, which means that there is no such thing as mentioned above. The concept of candidate similar blocks.

Optionally, in this embodiment of the present application, the filter may determine the first pixel set based on the positions of the reconstructed pixels included in the current block; and obtain the first similar block from the first pixel set.

The pixels in the first pixel set may be sparse reconstructed pixels, and the pixels in the first pixel set may be symmetrical with respect to the reconstructed pixels included in the current block. For example, as shown in Figure 7, The pixel position may be a pixel position of the current block, for example, may be the pixel position of the upper left corner of the current block, the pixel position of the center, or the pixel position of the lower right corner, or the like.

Optionally, the first similar block may be acquired from the first pixel set in a search manner from close to the current block to far from the current block.

Specifically, in the pixel set shown in FIG. 8, the similarity matching can be performed on the candidate similar blocks ① first, then the similarity matching is performed on the candidate similar blocks ②, and the similarity matching is performed on the candidate similar blocks ④. Match, and finally perform similarity matching on candidate similar blocks ⑧.

This is because in the process of selecting similar blocks from the candidate similar blocks, it is necessary to sort the candidate similar blocks according to the similarity to obtain a certain number of blocks with the highest similarity as similar blocks. The higher the similarity between the block and the current block may be, the more likely it is to be selected as a similar block. In this search method, when selecting similar blocks, the number of candidate similar blocks that need to be adjusted is less, which can reduce the number of similar blocks. Filtering complexity.

Optionally, in this embodiment of the present application, the number of the first similar blocks obtained from the first pixel set may not exceed a certain value, for example, a second threshold.

In an implementation manner, the similarity between all search blocks (also referred to as candidate similar blocks) in the first pixel set and the current block can be obtained, and they are arranged in descending order of similarity, and the number of selections is The first similarity block for the second threshold.

In another implementation manner, when the number of desired blocks searched in the first pixel set reaches a second threshold, the desired block is used as the first similar block, and stops at the first pixel The search for the first similar block is performed in the set, wherein the value of the parameter used to characterize the similarity between the current block and the desired block exceeds a first threshold.

In another implementation manner, in all pixels of the first pixel set, when the number of searched desired blocks is greater than a second threshold, the searched desired blocks are sorted from high to low in the manner of similarity from high to low. Among the blocks, a number of the first similar blocks equal to the second threshold is determined, wherein the value of the parameter characterizing the similarity of the current block to the desired block exceeds the first threshold.

Optionally, in this embodiment of the present application, the second pixel set may be determined according to the positions of the reconstructed pixels included in the first similar block obtained previously; and the first similar block is obtained again from the second pixel set.

The pixels in the second pixel set may be sparse reconstructed pixels, and the pixels in the second pixel set may be symmetrical with respect to the reconstructed pixels included in the previously determined first similar block.

Wherein, the previously determined first similar block may be a similar block searched from the first pixel set (the pixel set determined based on the position of the current block), or may be based on another second pixel set (based on the previous and previous pixel set) Similar blocks obtained by searching in the pixel set determined by the position of the first similar block).

That is to say, in the embodiment of the present application, after a pixel set is obtained based on the position of the current block, a similar block is searched in the pixel set, and then the pixel set is determined again based on the pixel position of the searched similar block. Similar blocks are searched in the pixel set determined again, and then the search based on the similar blocks in the pixel set can be stopped, or the pixel set can be determined based on the re-searched similar blocks, and so on. The process may be referred to as an N-order search process based on the pixel set mentioned in the embodiments of the present application, where N may be an integer greater than or equal to 1, and the size of N may be determined according to actual conditions.

A detailed description will be given below with reference to FIG. 9 . As shown in Figure 9, based on the current block In the determined pixel set, two candidate similar blocks ⑧ (the circle in the figure is a gray background and the word is a white number 8) are determined as similar blocks, and pixel sets are respectively determined around the two candidate similar blocks ⑧ (by The circle in the figure is a gray background, and the words are represented by black numbers), and then, similar blocks are respectively determined in the two pixel sets, that is, the circle in the figure is a black background, and the words are represented by white numbers. Similarity block, ie, 5 similar blocks. Thus, in addition to the two similar blocks obtained before, a total of 7 similar blocks are shown in FIG. 9 .

Optionally, in this embodiment of the present application, for blocks in the second pixel set that have been previously matched for similarity, the matching operation for similar blocks is no longer performed, thereby reducing the complexity of filtering.

Alternatively, in this embodiment of the present application, the second pixel set does not include blocks that have undergone similar block matching operations, that is, when the template is used to determine the second pixel set, some blocks have already undergone similar block matching operations. match, the candidate similar block is no longer included in the second pixel set.

For example, as shown in Fig. 9, the candidate similar blocks determined based on the block ⑧, which is determined to be a similar block in the lower right corner, only includes 17 candidate similar blocks instead of 28 candidate similar blocks, because there are some candidate similar blocks that have already been processed. Similar block matching.

However, it should be understood that the embodiments of the present application are not limited thereto.

For example, for blocks in the second pixel set that have been previously determined to be similar blocks, no matching operation for similar blocks is performed. That is to say, even if similarity matching has been performed before, since it is not determined to be a similar block, it can still be matched again. For example, it may be because the threshold used to judge whether it is a similar block in different order search processes may be different.

Similarly, blocks that have already been determined to be similar blocks are not included in the second pixel set, that is, when the template is used to determine the second pixel set, some blocks have been determined to be similar blocks, then the candidate similar blocks is no longer included in the second set of pixels.

Optionally, in this embodiment of the present application, the number of similar blocks obtained from a second pixel set may not exceed a certain value, for example, a third threshold. Among them, a third set of pixels can be understood as the pixels surrounded by a primary template around a first similar block.

In an implementation manner, the similarity between all search blocks in the second pixel set and the current block can be obtained, and they are arranged in descending order of similarity, and the first similar blocks whose number is a third threshold are selected.

In another implementation manner, when the number of desired blocks searched in the second pixel set reaches a third threshold, the desired block is determined as the first similar block, and stops at the second The first similar block is searched in the pixel set, wherein the value of the parameter used to characterize the similarity between the current block and the desired block exceeds a first threshold.

In another implementation manner, in all the pixels of the second pixel set, when the number of the searched expected blocks is greater than a third threshold, the searched expected blocks are sorted from high to low in the manner of similarity from high to low. Among the blocks, a number of the first similar blocks equal to the third threshold is determined, wherein the value of the parameter characterizing the similarity between the current block and the desired block exceeds the first threshold.

However, it should be understood that the embodiments of the present application are not limited to the above implementation manners, wherein the similar blocks searched in multiple pixel sets may not exceed the third threshold. For example, the multiple pixel sets can be understood as multiple pixel sets corresponding to multiple similar blocks obtained in the first-order search process in the above N-order search process.

Optionally, in this embodiment of the present application, templates corresponding to the first pixel set and the second pixel set may be the same. Alternatively, templates corresponding to the first pixel set and the second pixel set may be different.

Optionally, templates sampled in different order search processes may be different, and of course they may be the same.

The solution for determining the first similar block by using a sparse set of pixels has been introduced above. In this embodiment of the present application, after the first similar block is obtained, the pixel window may be determined respectively based on the position of the first similar block; Within the pixel window, the second similar block is acquired.

Wherein, within the pixel window, the second similar block may be determined in a point-by-point scanning manner.

For example, as shown in Figure 10, a pixel window is respectively delineated around the two similar blocks ⑧ (the circle in the figure is gray, and the word is white), wherein the pixel window can be relative to the determined pixel window. The similar blocks are symmetrical or not aligned. Wherein, the pixel window may be square or other shapes.

The point-by-point scanning mentioned in the embodiments of the present application may be implemented in a sliding window manner, and the sliding window sliding step size may be 1, wherein the size of the sliding window may be equal to the size of the current block.

Optionally, in this embodiment of the present application, the number of similar blocks acquired from one pixel window may not exceed a certain value, for example, a fourth threshold. Wherein, a pixel window can be understood as a pixel window nesting a first similar block.

In an implementation manner, the similarity between all search blocks in the pixel window and the current block can be obtained, and they are arranged in descending order of similarity, and the second similar blocks whose number is the fourth threshold are selected.

In another implementation manner, when the number of desired blocks searched in the pixel window reaches a fourth threshold, the searched desired block is determined as the second similar block, and stops at the pixel The search for the second similar block is performed in the window, wherein the value of the parameter characterizing the similarity between the current block and the desired block exceeds a first threshold.

In another implementation manner, in all pixels in the pixel window, when the number of searched desired blocks is greater than a fourth threshold, determine from the desired blocks in a manner of increasing similarity from high to low the second similar blocks in number equal to the fourth threshold, wherein the value of the parameter characterizing the similarity of the current block to the desired block exceeds the first threshold.

However, it should be understood that the embodiments of the present application are not limited to the above implementation manners, wherein the similar blocks searched in multiple pixel windows may not exceed the fourth threshold. For example, the multiple pixel windows may be understood as pixel windows corresponding to all the above first similar blocks.

Optionally, in the implementation of the present application, it has been described above that thresholds may exist in each search stage, but the embodiments of the present application are not limited to this.

For example, there is no threshold for limiting the number of searched similar blocks in each search stage, and this embodiment of the present application may set a threshold for limiting the total number of all similar blocks.

Optionally, when the number of searched desired blocks reaches a certain value, the desired block is used as the similar block, and the search of the similar block is stopped, wherein the value used to characterize the relationship between the current block and the desired block is The value of the parameter of similarity of blocks exceeds the first threshold.

Optionally, in all reconstructed pixels used for similar block search, when the number of searched desired blocks is greater than a certain value, according to the manner of similarity from high to low, from the desired blocks, it is determined that the number is equal to the value. The similar block of , wherein the value of the parameter characterizing the similarity between the current block and the desired block exceeds a first threshold.

Of course, a threshold for limiting the number of similar blocks obtained in each stage may be set, and a threshold for limiting the total number of all similar blocks may also be set at the same time.

Optionally, when the embodiment of the present application is implemented by the encoder, the encoder may determine each of the foregoing thresholds for limiting the number of similar blocks, encode the one or more thresholds, and transmit them to the decoder. And, when implemented by the decoding end, the decoding end can obtain the one or more thresholds from the code stream.

Of course, in this embodiment of the present application, the encoding end and the decoding end may separately determine the above thresholds for limiting the number of similar blocks, and the encoding end does not need to transmit these thresholds in the code stream.

At 320, the filter constructs an array of structures based on the at least one first similarity block.

Optionally, in the implementation of the present application, if the above-mentioned second similar block is determined, a structure array may be constructed based on the first similar block and the second similar block.

Optionally, the constructed array of structures may be a one-dimensional, two-dimensional or three-dimensional matrix.

At 330, the filter decomposes the array of structures.

Among them, singular value decomposition (SVD) can be performed on the structure array, and a hard threshold operation can be performed on the singular values, and a reconstructed structure group can be obtained according to the result of the singular value decomposition, and finally a reconstructed image can be obtained. Among them, the purpose of SVD decomposition is to extract the principal components of the structure array. Simple SVD cannot play the role of filtering. The key to filtering is to remove noise. The operation of hard threshold is used in NLSF to remove noise.

At 340, the filter obtains a reconstructed structure array from the decomposed structure array.

Optionally, in this embodiment of the present application, in addition to the SVD filtering method, discrete cosine transform (Discrete Cosine Transform, DCT) transform, Hadamard transform, KLT (Karhunen-Loève Transform), signal dependent transform (Signal) can also be used. Dependent Transform, SDT), wavelet transform and other filtering methods.

Optionally, the filtering manner in this embodiment of the present application may be used in combination with other filtering manners. Specifically, the filtering in other manners may be performed after the filtering in the embodiments of the present application, or the filtering manners according to the embodiments of the present application may be performed after the filtering in the other manners.

Other filtering techniques may include bilateral filtering, deblocking filtering, adaptive sample compensation filtering, and adaptive loop filtering. in,

Bilateral filtering is that the current pixel is calculated by the weighted average of its own and four adjacent pixel values to achieve edge-preserving denoising. Deblocking filtering is used for the boundary of prediction unit and transform unit, and the low-pass filter obtained by training is used to non-linearly weight the boundary pixels, thereby reducing the blocking effect. The adaptive sample compensation filter makes the reconstructed image closer to the original image by classifying the pixels in the image block, and then adding the same compensation value to each type of pixels, thereby suppressing the ringing effect. Adaptive loop filtering is a Wiener filter that is mainly used to minimize the mean squared error between the original image and the reconstructed image.

Table 1 below shows a comparison diagram of the number of points to be searched in the prior art and the present application (the number of search points is equivalent to the number of similarity matching operations, and one search point is equivalent to one similarity matching). Wherein, when the search window for searching similar blocks set for the current block is 33×33, in the prior art, when searching for similar blocks, on average, each current block needs to search for 1072 points. Using the search template shown in Figure 8 in this application, in the first search, a maximum of 28 points need to be searched. After several iterations, the five sequences of MarketPlace, BQTTerrace, BasketballDrive, RitualDance, and Cactus need to search an average of 291 points. Points, the present invention saves 72.9% of search points. Among them, the five sequences MarketPlace, BQTTerrace, BasketballDrive, RitualDance, and Cactus can reduce the number of search points by 74.6%, 70.3%, 71.5%, 75.2%, and 72.9%, respectively.

Table 1

Therefore, in the method for video processing in this embodiment of the present application, at least one first similar block of the current block is acquired in at least one pixel set, where the pixel set includes sparse reconstructed pixels, so that similarity can be reduced in the filtering process The complexity of block acquisition can reduce the filtering complexity while ensuring the minimum loss of encoding performance, thereby reducing the complexity of encoding and decoding, and saving encoding and decoding time. FIG. 11 is a schematic flowchart of a method 400 for video processing according to an embodiment of the present application. As shown in FIG. 11 , the method 400 includes at least some of the following contents. Wherein, the method 400 can be applied to the encoding end, and can also be applied to the decoding end.

In 410, the filter obtains, from the reconstructed pixels, at least one similar block of the current block, the current block includes at least one reconstructed pixel, wherein the value of the parameter used to characterize the similarity between the current block and the similar block exceeds the first threshold.

Wherein, the reconstructed pixel may be a pixel in a search window, and a similar block of the current block may be obtained from the search window by means of point-by-point scanning.

At 420, the filter constructs an array of structures based on the at least one first similarity block.

At 430, the filter decomposes the array of structures.

At 440, the filter obtains a reconstructed structure array from the decomposed structure array.

Optionally, the number of similar blocks is less than or equal to the second threshold.

Optionally, when the number of searched desired blocks reaches the second threshold, the desired block is used as the similar block, and the search of the similar block is stopped, wherein the value used to characterize the current block and The value of the parameter of the similarity of the desired block exceeds a first threshold.

Optionally, in all pixels of the reconstructed pixels, when the number of desired blocks searched for is greater than the second threshold, in the manner of similarity from high to low, from the desired blocks, determine that the number is equal to the number of desired blocks. and the similarity block of the second threshold, wherein the value of the parameter used to characterize the similarity between the current block and the desired block exceeds the first threshold.

Optionally, the first threshold is determined based on at least one of the following parameters: the size of the current block, the bit depth of the video, the pixel sum of the current block, the horizontal gradient of the pixels of the current block, the current block The vertical gradient of the pixels.

Optionally, when the metric of the similarity is the difference between the hash values, the first threshold is determined based on at least one of the following parameters: the sum of the pixels of the current block, the level of the pixels of the current block Gradient, the vertical gradient of the pixels of this current block.

Optionally, when the similarity metric is SSD or SAD, the first threshold is determined based on at least one of the following parameters: the size of the current block, and the bit depth of the video.

Optionally, when the similarity metric is MAD, MSD or SSIM, the first threshold is determined based on the bit depth of the video.

Optionally, the metric used to obtain the similarity judgment for the similar block is: difference of hash values, SSD, SAD, MAD, MSD or SSIM.

Optionally, the method is implemented by an encoder; the method further includes: the encoder determines the first threshold, and encodes the first threshold.

Optionally, the method is implemented by a decoding end; the method further includes: acquiring, by the decoding end, the first threshold in the code stream.

It should be understood that the implementation of each operation in the method 400 may refer to the description of the method 300, which is not repeated here for brevity.

FIG. 12 is a schematic block diagram of an apparatus 500 for video processing according to an embodiment of the present application. As shown in Figure 12, the device 500 includes:

A similar block obtaining unit 510, configured to obtain at least one first similar block of the current block in at least one pixel set, wherein the pixel set includes sparse reconstructed pixels, and the current block includes at least one reconstructed pixel;

a construction unit 520 for constructing a structure array based on the at least one first similar block;

a decomposition unit 530, for decomposing the structure array;

The reconstruction unit 540 is configured to obtain a reconstructed structure array according to the decomposed structure array.

Optionally, in this embodiment of the present application, the at least one pixel set includes a first pixel set;

The similar block obtaining unit 510 is specifically used for:

determining the first set of pixels based on the positions of the reconstructed pixels included in the current block;

From the first set of pixels, the first similar block is obtained.

Optionally, in this embodiment of the present application, the similar block obtaining unit 510 is specifically configured to:

The first similar block is acquired from the first pixel set in a search manner from close to the current block to far from the current block.

Optionally, in this embodiment of the present application, the similar block obtaining unit 510 is specifically configured to:

When the number of desired blocks searched in the first pixel set reaches a second threshold, the desired block is regarded as the first similar block, and the search for the first similar block in the first pixel set is stopped, wherein , the value of the parameter used to characterize the similarity between the current block and the desired block exceeds the first threshold.

Optionally, in this embodiment of the present application, the similar block obtaining unit 510 is specifically configured to:

In all pixels of the first pixel set, when the number of the searched desired blocks is greater than the second threshold, according to the manner of similarity from high to low, from the searched desired blocks, it is determined that the number is equal to the second threshold The first similar block of , wherein the value of the parameter used to characterize the similarity between the current block and the desired block exceeds a first threshold.

Optionally, in this embodiment of the present application, the at least one pixel set includes a second pixel set;

The similar block obtaining unit 510 is specifically used for:

Determine the second pixel set according to the positions of the reconstructed pixels included in the previously obtained first similar block;

From the second set of pixels, the first similar block is obtained again.

Optionally, in this embodiment of the present application, the similar block obtaining unit 510 is specifically configured to:

Based on the search manner from being close to the first similar block obtained last time to being far away from the first similar block obtained last time, the first similar block is obtained again from the second set of pixels.

Optionally, in this embodiment of the present application, the similar block obtaining unit 510 is specifically configured to:

When the number of desired blocks searched in the second pixel set reaches a third threshold, determining the desired block as the first similar block, and stopping searching for the first similar block in the second pixel set, Wherein, the value of the parameter used to characterize the similarity between the current block and the desired block exceeds the first threshold.

Optionally, in this embodiment of the present application, the similar block obtaining unit 510 is specifically configured to:

In all pixels of the second pixel set, when the number of the searched desired blocks is greater than the third threshold, according to the manner of similarity from high to low, from the searched desired blocks, it is determined that the number is equal to the third threshold The first similar block of , wherein the value of the parameter used to characterize the similarity between the current block and the desired block exceeds a first threshold.

Optionally, in this embodiment of the present application, the similar block obtaining unit 510 is specifically configured to: in the second pixel set, blocks that have been subjected to a similar block matching operation before, do not perform a similar block matching operation; or,

The second pixel set does not include blocks for which similar block matching operations have been performed.

Optionally, in this embodiment of the present application, the similar block obtaining unit 510 is further configured to:

Based on the template, the set of pixels is determined.

Optionally, in this embodiment of the present application, the reconstructed pixels in the template are aggregated into a plurality of scattered image blocks, and the size of each image block is greater than or equal to the size of the current block.

Optionally, in this embodiment of the present application, the template includes a plurality of candidate similar blocks for selecting the first similar block, and the size of the candidate similar blocks is equal to the size of the current block.

Optionally, in this embodiment of the present application, the template includes multiple groups of candidate similar blocks from the center to the edge, and each group of candidate similar blocks is surrounded by a ring, and the ring is symmetrical with respect to the center of the template, and the candidate similar blocks in the group are Evenly spaced.

Optionally, in this embodiment of the present application, the template includes four groups of candidate similar blocks, and the edge pixels of the four groups of candidate similar blocks far from the center of the template are separated by 1 pixel and 2 pixels from the center of the template. pixels, 4 pixels and 8 pixels.

Optionally, in this embodiment of the present application, the four groups of candidate similar blocks respectively have 4 candidate similar blocks, 8 candidate similar blocks, 8 candidate similar blocks, and 8 candidate similar blocks, among which there are 4 candidate similar blocks. A set of candidate similar blocks for a block is closest to the center of this template.

Optionally, in this embodiment of the present application, in the at least one pixel set, different pixel sets are determined based on different templates.

Optionally, in this embodiment of the present application, the similar block obtaining unit 510 is further configured to:

Based on the position of each of the first similar blocks, pixel windows are respectively determined;

In the pixel window, obtain the second similar block;

The construction unit 520 is specifically used for:

The structure array is constructed based on the first similarity block and the second similarity block.

Optionally, in this embodiment of the present application, the similar block obtaining unit 510 is specifically configured to:

The second similar block is determined in a point-by-point scanning manner.

Optionally, in this embodiment of the present application, the similar block obtaining unit 510 is specifically configured to: a block in the pixel window that has undergone a similar block matching operation, and no longer perform a similar block matching operation; or,

The search window does not include blocks that have already undergone similar block matching operations.

Optionally, in this embodiment of the present application, the similar block obtaining unit 510 is specifically configured to:

When the number of desired blocks searched in the pixel window reaches the fourth threshold, the desired block searched for is determined as the second similar block, and the search for the second similar block in the pixel window is stopped, wherein , the value of the parameter used to characterize the similarity between the current block and the desired block exceeds the first threshold.

Optionally, in this embodiment of the present application, the similar block obtaining unit 510 is specifically configured to:

In all the pixels in the pixel window, when the number of the searched desired blocks is greater than the fourth threshold, determine the number of the second blocks equal to the fourth threshold from the desired blocks in the manner of similarity from high to low. Similar blocks, wherein the value of the parameter characterizing the similarity between the current block and the desired block exceeds a first threshold.

Optionally, in this embodiment of the present application, the value of the parameter used to characterize the similarity between the current block and a similar block of the current block exceeds the first threshold.

Optionally, in this embodiment of the present application, the first threshold is determined based on at least one of the following parameters:

The size of the current block, the bit depth of the video, the pixel sum of the current block, the horizontal gradient of the pixels of the current block, and the vertical gradient of the pixels of the current block.

Optionally, in this embodiment of the present application, when the parameter characterizing the similarity is the difference between the hash values,

The first threshold is determined based on at least one of the following parameters:

The pixel sum of the current block, the horizontal gradient of the pixels of the current block, and the vertical gradient of the pixels of the current block.

Optionally, in this embodiment of the present application, when the parameter characterizing the similarity is the sum of squared errors SSD or the sum of absolute errors SAD,

The first threshold is determined based on at least one of the following parameters: the size of the current block, and the bit depth of the video.

Optionally, in this embodiment of the present application, when the parameter characterizing the similarity is the mean absolute difference MAD, the mean squared error MSD or the structural similarity index SSIM,

The first threshold is determined based on the bit depth of the video.

Optionally, in this embodiment of the present application, the device is implemented by an encoding terminal; the device 500 further includes:

an encoding unit, configured to determine the first threshold and encode the first threshold.

Optionally, in this embodiment of the present application, the device is implemented by a decoding end; the device 500 further includes:

an obtaining unit, configured to obtain the first threshold in the code stream.

Optionally, in this embodiment of the present application, the parameter representing the similarity is: difference of hash values, SSD, SAD, MAD, MSD, or SSIM.

Optionally, in this embodiment of the present application, the reconstructed pixels used to obtain the similar block include:

The reconstructed pixel on the upper side of the coding unit to which the current block belongs, the reconstructed pixel on the left side of the coding unit, and the reconstructed pixel of the coding unit; or,

The reconstructed pixel on the upper side of the coding unit, the reconstructed pixel on the left side of the coding unit, the reconstructed pixel on the right side of the coding unit, the reconstructed pixel on the lower side of the coding unit, and the reconstructed pixel of the coding unit; or,

reconstructed pixels for this coding unit.

Optionally, in this embodiment of the present application, the number of pixels in the vertical direction of the reconstructed pixels on the upper side of the coding unit is less than or equal to the number of pixels in the horizontal direction of the reconstructed pixels on the left side of the coding unit.

Optionally, the device 500 can implement the operation of the filter in the foregoing method 300, which is not repeated here for brevity.

FIG. 13 is a schematic block diagram of an apparatus 600 for video processing according to an embodiment of the present application. As shown in Figure 13, the device 600 includes:

Similar block obtaining unit 610, configured to obtain at least one similar block of the current block from the reconstructed pixels, where the current block includes at least one reconstructed pixel, wherein the value of the parameter used to characterize the similarity between the current block and the similar block exceeds the first threshold;

a construction unit 620 for constructing a structure array based on the at least one similar block;

a decomposition unit 630, for decomposing the structure array;

The reconstruction unit 640 is configured to obtain a reconstructed structure array according to the decomposed structure array.

Optionally, in this embodiment of the present application, the number of the similar blocks is less than or equal to the second threshold.

Optionally, in this embodiment of the present application, the similar block obtaining unit 610 is further configured to:

When the number of searched desired blocks reaches the second threshold, the desired block is regarded as the similar block, and the search of the similar block is stopped, wherein the parameter used to characterize the similarity between the current block and the desired block is The value exceeds the first threshold.

Optionally, in this embodiment of the present application, the similar block obtaining unit 610 is further configured to:

In all the pixels of the reconstructed pixel, when the number of the searched expected blocks is greater than the second threshold, the similar blocks whose number is equal to the second threshold are determined from the expected blocks according to the similarity degree from high to low , wherein the value of the parameter used to characterize the similarity between the current block and the desired block exceeds the first threshold.

Optionally, in this embodiment of the present application, the first threshold is determined based on at least one of the following parameters:

The size of the current block, the bit depth of the video, the pixel sum of the current block, the horizontal gradient of the pixels of the current block, and the vertical gradient of the pixels of the current block.

Optionally, in this embodiment of the present application, when the parameter characterizing the similarity is the difference between the hash values,

The first threshold is determined based on at least one of the following parameters:

The pixel sum of the current block, the horizontal gradient of the pixels of the current block, and the vertical gradient of the pixels of the current block.

Optionally, in this embodiment of the present application, when the parameter characterizing the similarity is the sum of squared errors SSD or the sum of absolute errors SAD,

The first threshold is determined based on at least one of the following parameters: the size of the current block, and the bit depth of the video.

Optionally, in this embodiment of the present application, when the parameter characterizing the similarity is the mean absolute difference MAD, the mean squared error MSD or the structural similarity index SSIM,

The first threshold is determined based on the bit depth of the video.

Optionally, in this embodiment of the present application, the parameter representing the similarity is: difference of hash values, SSD, SAD, MAD, MSD, or SSIM.

Optionally, in this embodiment of the present application, the device 600 is implemented by an encoding end; the device 600 further includes:

an encoding unit, configured to determine the first threshold and encode the first threshold.

Optionally, in this embodiment of the present application, the device 600 is implemented by a decoding end; the device 600 further includes:

an obtaining unit, configured to obtain the first threshold in the code stream.

Optionally, the device 600 can implement the operation of the filter in the foregoing method 400, which is not repeated here for brevity.

It should be understood that the device for video processing in the above embodiments of the present application may be a chip, which may be specifically implemented by a circuit, but the specific implementation form is not limited in the embodiments of the present application.

The embodiments of the present application further provide an encoder, which is used to implement the functions of the encoding end in the embodiments of the present application, and may include the modules used for the encoding end in the video processing device according to the embodiments of the present application.

The embodiments of the present application further provide a decoder, which is used to implement the functions of the decoding end in the embodiments of the present application, and may include the modules used for the decoding end in the video processing device according to the embodiments of the present application.

An embodiment of the present application further provides a codec, where the codec includes the device for video processing according to the above embodiment of the present application.

FIG. 14 shows a schematic block diagram of a computer system 700 according to an embodiment of the present application.

As shown in FIG. 14 , the computer system 700 may include a processor 710 and a memory 720 .

It should be understood that the computer system 700 may also include components generally included in other computer systems, such as input and output devices, communication interfaces, etc., which are not limited in this embodiment of the present application.

Memory 720 is used to store computer-executable instructions.

The memory 720 may be various types of memory, for example, may include a high-speed random access memory (Random Access Memory, RAM), and may also include a non-volatile memory (non-volatile memory), such as at least one disk memory, the embodiment of the present application This is not limited.

The processor 710 is configured to access the memory 720 and execute the computer-executable instructions, so as to perform the operations in the above-mentioned methods for video processing in the embodiments of the present application.

The processor 710 may include a microprocessor, a field-programmable gate array (Field-Programmable GateArray, FPGA), a central processing unit (Central Processing unit, CPU), a graphics processing unit (Graphics Processing Unit, GPU), etc. This is not limited.

The apparatus for video processing and the computer system of the embodiments of the present application may correspond to the execution body of the method for video processing of the embodiments of the present application, and the above-mentioned and other modules in the apparatus and computer system for video processing The operations and/or functions are respectively in order to implement the corresponding processes of the foregoing methods, and are not repeated here for the sake of brevity.

An embodiment of the present application further provides an electronic device, and the electronic device may include the video processing device or the computer system according to the various embodiments of the present application.

The embodiment of the present application further provides a computer storage medium, where a program code is stored in the computer storage medium, and the program code can be used to instruct to execute the method for loop filtering in the above embodiment of the present application.

It should be understood that, in this embodiment of the present application, the term "and/or" is only an association relationship for describing associated objects, indicating that there may be three kinds of relationships. For example, A and/or B can mean that A exists alone, A and B exist at the same time, and B exists alone. In addition, the character "/" in this document generally indicates that the related objects are an "or" relationship.

Those of ordinary skill in the art can realize that the units and algorithm steps of each example described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, computer software, or a combination of the two, in order to clearly illustrate the differences between hardware and software Interchangeability, the above description has generally described the components and steps of each example in terms of function. Whether these functions are performed in hardware or software depends on the specific application and design constraints of the technical solution. Skilled artisans may implement the described functionality using different methods for each particular application, but such implementations should not be considered beyond the scope of this application.

Those skilled in the art can clearly understand that, for the convenience and brevity of description, the specific working process of the system, device and unit described above may refer to the corresponding process in the foregoing method embodiments, which will not be repeated here.

In the several embodiments provided in this application, it should be understood that the disclosed system, apparatus and method may be implemented in other manners. For example, the apparatus embodiments described above are only illustrative. For example, the division of the 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 Can be integrated into another system, or some features can be ignored, or not implemented. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be indirect coupling or communication connection through some interfaces, devices or units, and may also be electrical, mechanical or other forms of connection.

The units described as separate components may or may not be physically separated, and components displayed 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 solutions of the embodiments of the present application.

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 in the form of a software functional unit and sold or used as an independent product, may be stored in a computer-readable storage medium. Based on this understanding, the technical solutions of the present application are essentially or part of contributions to the prior art, or all or part of the technical solutions can be embodied in the form of software products, and the computer software products are stored in a storage medium , including several 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 described in the various embodiments of the present application. The aforementioned storage medium includes: U disk, removable hard disk, Read-Only Memory (ROM, Read-Only Memory), Random Access Memory (RAM, Random Access Memory), magnetic disk or optical disk and other media that can store program codes.

The above are only specific embodiments of the present application, but the protection scope of the present application is not limited thereto. Any person skilled in the art can easily think of various equivalents within the technical scope disclosed in the present application. Modifications or substitutions shall be covered by the protection scope of this application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims (86)

1. a method for video processing, is characterized in that, comprises: obtaining at least one first similar block of the current block in at least one pixel set, wherein the pixel set includes sparse reconstructed pixels, and the current block includes at least one reconstructed pixel; constructing an array of structures based on the at least one first similar block; decompose the array of structures; Obtain the reconstructed structure array according to the decomposed structure array. 2. The method of claim 1, wherein the at least one set of pixels comprises a first set of pixels; The obtaining the at least one first similar block in the at least one pixel set includes: determining the first set of pixels based on the positions of the reconstructed pixels included in the current block; From the first set of pixels, the first similar block is obtained. 3. The method according to claim 2, wherein obtaining the first similar block from the first pixel set comprises: The first similar block is acquired from the first pixel set in a search manner from close to the current block to far from the current block. 4. The method according to claim 2 or 3, wherein obtaining the first similar block from the first pixel set comprises: When the number of desired blocks searched in the first pixel set reaches a second threshold, the desired block is used as the first similar block, and the first similarity is stopped in the first pixel set A search of blocks, wherein the value of the parameter characterizing the similarity of the current block to the desired block exceeds a first threshold. 5. The method according to claim 2 or 3, wherein obtaining the first similar block from the first pixel set comprises: In all the pixels of the first pixel set, when the number of the searched desired blocks is greater than the second threshold, according to the manner of similarity from high to low, from the searched desired blocks, it is determined that the number is equal to the The first similar block of a second threshold, wherein the value of the parameter characterizing the similarity between the current block and the desired block exceeds the first threshold. 6. The method of any one of claims 2 to 5, wherein the at least one set of pixels comprises a second set of pixels; In the at least one pixel set, obtaining the first similar block includes: Determine the second pixel set according to the positions of the reconstructed pixels included in the previously obtained first similar block; From the second set of pixels, the first similar block is obtained again. 7. The method according to claim 6, wherein obtaining the first similar block from the second pixel set again comprises: Based on the search method from being close to the first similar block obtained last time to being far away from the first similar block obtained last time, obtain the first similar block from the second set of pixels again . 8. The method according to claim 6 or 7, wherein obtaining the first similar block from the second pixel set again comprises: When the number of desired blocks searched in the second pixel set reaches a third threshold, determine the desired block as the first similar block, and stop performing the first similar block in the second pixel set A search of similar blocks, wherein the value of the parameter characterizing the similarity of the current block to the desired block exceeds a first threshold. 9. The method according to claim 6 or 7, wherein obtaining the first similar block from the second pixel set again comprises: In all the pixels of the second pixel set, when the number of searched desired blocks is greater than the third threshold, according to the manner of similarity from high to low, from the searched desired blocks, it is determined that the number is equal to the The first similarity block of a third threshold, wherein the value of the parameter characterizing the similarity between the current block and the desired block exceeds the first threshold. 10. The method according to any one of claims 6 to 9, wherein Obtaining the first similar block from the second set of pixels again includes: in the second set of pixels, the blocks in the second set of pixels that have been subjected to a similar block matching operation before, do not perform a similar block matching operation; or, The second pixel set does not include blocks that have undergone similar block matching operations. 11. The method according to any one of claims 1 to 10, wherein the method further comprises: Based on the template, the set of pixels is determined. 12 . The method according to claim 11 , wherein the reconstructed pixels in the template are aggregated into a plurality of scattered image blocks, and the size of each image block is greater than or equal to the size of the current block. 13 . 13. The method according to claim 11 or 12, wherein the template comprises a plurality of candidate similar blocks for selecting the first similar block, and the size of the candidate similar blocks is equal to the size of the current block size. 14. The method according to claim 13, wherein the template comprises multiple groups of candidate similar blocks from the center to the edge, and each group of candidate similar blocks forms a ring, and the ring is symmetrical with respect to the center of the template , the candidate similar blocks in the group are evenly arranged. 15 . The method according to claim 14 , wherein the template comprises four groups of candidate similar blocks, and the edge pixels of the four groups of candidate similar blocks far from the center of the template are relative to the center of the template. 16 . , separated by 1 pixel, 2 pixels, 4 pixels and 8 pixels, respectively. 16. The method according to claim 14 or 15, wherein the four groups of candidate similar blocks respectively have 4 candidate similar blocks, 8 candidate similar blocks, 8 candidate similar blocks and 8 candidate similar blocks, Among them, a group of candidate similar blocks with 4 candidate similar blocks is closest to the center of the template. 17. The method according to any one of claims 11 to 16, wherein in the at least one pixel set, different pixel sets are determined based on different templates. 18. The method according to any one of claims 2 to 17, wherein the method further comprises: based on the position of each of the first similar blocks, respectively determining a pixel window; obtaining the second similar block within the pixel window; The constructing a structure array based on the at least one first similar block includes: The structure array is constructed based on the first similarity block and the second similarity block. 19. The method according to claim 18, wherein, within the pixel window, determining a second similar block, comprising: The second similar block is determined in a point-by-point scanning manner. 20. The method according to claim 18 or 19, wherein, within the pixel window, acquiring the second similar block comprises: For blocks in the pixel window that have been subjected to a similar block matching operation, the similar block matching operation is no longer performed; or, The search window does not include blocks that have undergone similar block matching operations. 21. The method according to any one of claims 18 to 20, wherein the acquiring the second similar block within the pixel window comprises: When the number of desired blocks searched in the pixel window reaches a fourth threshold, the desired block searched for is determined as the second similar block, and the second similarity is stopped in the pixel window A search of blocks, wherein the value of the parameter characterizing the similarity of the current block to the desired block exceeds a first threshold. 22. The method according to any one of claims 18 to 20, wherein the acquiring the second similar block within the pixel window comprises: In all pixels in the pixel window, when the number of searched desired blocks is greater than the fourth threshold, according to the manner of similarity from high to low, from the desired blocks, determine the number of blocks equal to the fourth threshold The second similar block, wherein the value of the parameter representing the similarity between the current block and the desired block exceeds a first threshold. 23. The method according to any one of claims 1 to 22, wherein the value of the parameter used to characterize the similarity between the current block and similar blocks of the current block exceeds a first threshold. 24. The method of claim 23, wherein the first threshold is determined based on at least one of the following parameters: The size of the current block, the bit depth of the video, the pixel sum of the current block, the horizontal gradient of the pixels of the current block, the vertical gradient of the pixels of the current block. 25. The method according to claim 24, wherein, when the parameter characterizing the similarity is the difference of the hash values, The first threshold is determined based on at least one of the following parameters: The sum of the pixels of the current block, the horizontal gradient of the pixels of the current block, and the vertical gradient of the pixels of the current block. 26. The method according to claim 24, characterized in that, when the parameter characterizing the similarity is the sum of squared errors (SSD) or the sum of absolute errors (SAD), The first threshold is determined based on at least one of the following parameters: the size of the current block, and the bit depth of the video. 27. The method according to claim 24, wherein, when the parameter characterizing the similarity is mean absolute difference MAD, mean squared error MSD or structural similarity index SSIM, The first threshold is determined based on the bit depth of the video. 28. The method according to any one of claims 23 to 27, wherein the method is implemented by an encoding end; the method further comprises: The encoding end determines the first threshold, and encodes the first threshold. 29. The method according to any one of claims 23 to 28, wherein the method is implemented by a decoding end; the method further comprises: The decoding end obtains the first threshold in the code stream. 30. The method according to any one of claims 1 to 29, wherein the parameter representing the similarity is: difference of hash values, SSD, SAD, MAD, MSD or SSIM. 31. The method of claim 30, wherein obtaining reconstructed pixels of the similar block comprises: The reconstructed pixels on the upper side of the coding unit to which the current block belongs, the reconstructed pixels on the left side of the coding unit, and the reconstructed pixels of the coding unit; or, Reconstructed pixels on the upper side of the coding unit, reconstructed pixels on the left side of the coding unit, reconstructed pixels on the right side of the coding unit, reconstructed pixels on the lower side of the coding unit, and reconstruction of the coding unit pixels; or, reconstructed pixels of the coding unit. 32. The method according to claim 31, wherein the number of pixels in the vertical direction of the reconstructed pixels on the upper side of the coding unit is less than or equal to the number of pixels in the horizontal direction of the reconstructed pixels on the left side of the coding unit. number of pixels. 33. A method for video processing, comprising: From the reconstructed pixels, obtain at least one similar block of the current block, the current block includes at least one reconstructed pixel, wherein the value of the parameter used to characterize the similarity between the current block and the similar block exceeds a first threshold; constructing an array of structures based on the at least one similar block; decompose the array of structures; Obtain the reconstructed structure array according to the decomposed structure array. 34. The method of claim 33, wherein the number of similar blocks is less than or equal to a second threshold. 35. The method according to claim 34, wherein obtaining at least one similar block of the current block from the reconstructed pixels comprises: When the number of searched desired blocks reaches the second threshold, the desired block is regarded as the similar block, and the search of the similar block is stopped, wherein the desired block is used to characterize the current block and the desired block The value of the similarity parameter exceeds the first threshold. 36. The method according to claim 34, wherein the obtaining at least one similar block of the current block from the reconstructed pixels comprises: In all the pixels of the reconstructed pixels, when the number of the desired blocks searched is greater than the second threshold, according to the manner of similarity from high to low, from the desired blocks, it is determined that the number is equal to the second threshold The similar block of , wherein the value of the parameter characterizing the similarity between the current block and the desired block exceeds a first threshold. 37. The method of any one of claims 33 to 36, wherein the first threshold is determined based on at least one of the following parameters: The size of the current block, the bit depth of the video, the pixel sum of the current block, the horizontal gradient of the pixels of the current block, the vertical gradient of the pixels of the current block. 38. The method according to claim 37, wherein, when the parameter characterizing the similarity is the difference of hash values, The first threshold is determined based on at least one of the following parameters: The sum of the pixels of the current block, the horizontal gradient of the pixels of the current block, and the vertical gradient of the pixels of the current block. 39. The method according to claim 37, wherein, when the parameter characterizing the similarity is the sum of squared errors (SSD) or the sum of absolute errors (SAD), The first threshold is determined based on at least one of the following parameters: the size of the current block, and the bit depth of the video. 40. The method according to claim 37, wherein, when the parameter characterizing the similarity is the mean absolute difference MAD, the mean squared error MSD or the structural similarity index SSIM, The first threshold is determined based on the bit depth of the video. 41. The method according to any one of claims 33 to 40, wherein the parameter representing the similarity is: difference of hash values, SSD, SAD, MAD, MSD or SSIM. 42. The method according to any one of claims 33 to 41, wherein the method is implemented by an encoding end; the method further comprises: The encoding end determines the first threshold, and encodes the first threshold. 43. The method according to any one of claims 33 to 41, wherein the method is implemented by a decoding end; the method further comprises: The decoding end obtains the first threshold in the code stream. 44. A device for video processing, comprising: a similar block obtaining unit, configured to obtain at least one first similar block of the current block in at least one pixel set, wherein the pixel set includes sparse reconstructed pixels, and the current block includes at least one reconstructed pixel; a construction unit for constructing a structure array based on the at least one first similar block; a decomposition unit for decomposing the structure array; The reconstruction unit is used to obtain the reconstructed structure array according to the decomposed structure array. 45. The apparatus of claim 44, wherein the at least one set of pixels comprises a first set of pixels; The similar block obtaining unit is specifically used for: determining the first set of pixels based on the positions of the reconstructed pixels included in the current block; From the first set of pixels, the first similar block is obtained. 46. The device according to claim 45, wherein the similar block obtaining unit is specifically configured to: The first similar block is acquired from the first pixel set in a search manner from close to the current block to far from the current block. 47. The device according to claim 45 or 46, wherein the similar block obtaining unit is specifically configured to: When the number of desired blocks searched in the first pixel set reaches a second threshold, the desired block is used as the first similar block, and the first similarity is stopped in the first pixel set A search of blocks, wherein the value of the parameter characterizing the similarity of the current block to the desired block exceeds a first threshold. 48. The device according to claim 45 or 46, wherein the similar block obtaining unit is specifically configured to: In all the pixels of the first pixel set, when the number of the searched desired blocks is greater than the second threshold, according to the manner of similarity from high to low, from the searched desired blocks, it is determined that the number is equal to the The first similar block of a second threshold, wherein the value of the parameter characterizing the similarity between the current block and the desired block exceeds the first threshold. 49. The apparatus of any one of claims 45 to 48, wherein the at least one set of pixels comprises a second set of pixels; The similar block obtaining unit is specifically used for: Determine the second pixel set according to the positions of the reconstructed pixels included in the previously obtained first similar block; From the second set of pixels, the first similar block is obtained again. 50. The device according to claim 49, wherein the similar block obtaining unit is specifically configured to: Based on the search method from being close to the first similar block obtained last time to being far away from the first similar block obtained last time, obtain the first similar block from the second set of pixels again . 51. The device according to claim 49 or 50, wherein the similar block obtaining unit is specifically configured to: When the number of desired blocks searched in the second pixel set reaches a third threshold, determine the desired block as the first similar block, and stop performing the first similar block in the second pixel set A search of similar blocks, wherein the value of the parameter characterizing the similarity of the current block to the desired block exceeds a first threshold. 52. The device according to claim 49 or 50, wherein the similar block obtaining unit is specifically configured to: In all the pixels of the second pixel set, when the number of searched desired blocks is greater than the third threshold, according to the manner of similarity from high to low, from the searched desired blocks, it is determined that the number is equal to the The first similarity block of a third threshold, wherein the value of the parameter characterizing the similarity between the current block and the desired block exceeds the first threshold. 53. The apparatus of any one of claims 49 to 52, wherein The similar block obtaining unit is specifically configured to: in the second pixel set, blocks that have been subjected to a similar block matching operation before, do not perform a similar block matching operation; or, The second pixel set does not include blocks that have undergone similar block matching operations. 54. The device according to any one of claims 44 to 53, wherein the similar block obtaining unit is further configured to: Based on the template, the set of pixels is determined. 55. The device according to claim 54, wherein the reconstructed pixels in the template are aggregated into a plurality of scattered image blocks, and the size of each image block is greater than or equal to the size of the current block. 56. The apparatus according to claim 54 or 55, wherein the template comprises a plurality of candidate similar blocks for selecting the first similar block, the size of the candidate similar blocks being equal to the size of the current block size. 57. The device according to claim 56, wherein the template comprises multiple groups of candidate similar blocks from the center to the edge, and each group of candidate similar blocks forms a ring, and the ring is symmetrical with respect to the center of the template , the candidate similar blocks in the group are evenly arranged. 58. The apparatus of claim 57, wherein the template comprises four groups of candidate similar blocks, and the edge pixels of the four groups of candidate similar blocks far from the center of the template are relative to the center of the template , separated by 1 pixel, 2 pixels, 4 pixels and 8 pixels, respectively. 59. The device according to claim 57 or 58, wherein the four groups of candidate similar blocks respectively have 4 candidate similar blocks, 8 candidate similar blocks, 8 candidate similar blocks and 8 candidate similar blocks, Among them, a group of candidate similar blocks with 4 candidate similar blocks is closest to the center of the template. 60. The device according to any one of claims 54 to 59, wherein in the at least one pixel set, different pixel sets are determined based on different templates. 61. The device according to any one of claims 45 to 60, wherein the similar block obtaining unit is further configured to: based on the position of each of the first similar blocks, respectively determining a pixel window; obtaining the second similar block within the pixel window; The building unit is specifically used for: The structure array is constructed based on the first similarity block and the second similarity block. 62. The device according to claim 61, wherein the similar block obtaining unit is specifically configured to: The second similar block is determined in a point-by-point scanning manner. 63. The device according to claim 61 or 62, wherein the similar block obtaining unit is specifically configured to: a block in the pixel window that has undergone a similar block matching operation, and no longer perform a similar block matching operation ;or, The search window does not include blocks that have undergone similar block matching operations. 64. The device according to any one of claims 61 to 63, wherein the similar block obtaining unit is specifically configured to: When the number of desired blocks searched in the pixel window reaches a fourth threshold, the desired block searched for is determined as the second similar block, and the second similarity is stopped in the pixel window A search of blocks, wherein the value of the parameter characterizing the similarity of the current block to the desired block exceeds a first threshold. 65. The device according to any one of claims 61 to 63, wherein the similar block obtaining unit is specifically configured to: In all pixels in the pixel window, when the number of searched desired blocks is greater than the fourth threshold, according to the manner of similarity from high to low, from the desired blocks, determine the number of blocks equal to the fourth threshold The second similar block, wherein the value of the parameter representing the similarity between the current block and the desired block exceeds a first threshold. 66. The apparatus according to any one of claims 44 to 65, wherein the value of the parameter used to characterize the similarity of the current block to similar blocks of the current block exceeds a first threshold. 67. The device of claim 66, wherein the first threshold is determined based on at least one of the following parameters: The size of the current block, the bit depth of the video, the pixel sum of the current block, the horizontal gradient of the pixels of the current block, the vertical gradient of the pixels of the current block. 68. The device according to claim 67, wherein when the parameter characterizing the similarity is a difference of hash values, The first threshold is determined based on at least one of the following parameters: The sum of the pixels of the current block, the horizontal gradient of the pixels of the current block, and the vertical gradient of the pixels of the current block. 69. The apparatus according to claim 67, wherein, when the parameter characterizing the similarity is the sum of squared errors (SSD) or the sum of absolute errors (SAD), The first threshold is determined based on at least one of the following parameters: the size of the current block, and the bit depth of the video. 70. The device according to claim 67, wherein, when the parameter characterizing the similarity is the mean absolute difference MAD, the mean squared error MSD or the structural similarity index SSIM, The first threshold is determined based on the bit depth of the video. 71. The device according to any one of claims 66 to 70, wherein the device is implemented by an encoding terminal; the device further comprises: an encoding unit that determines the first threshold and encodes the first threshold. 72. The device according to any one of claims 66 to 71, wherein the device is implemented by a decoding end; the device further comprises: an obtaining unit, configured to obtain the first threshold in the code stream. 73. The device according to any one of claims 44 to 72, wherein the parameter representing the similarity is: difference of hash values, SSD, SAD, MAD, MSD or SSIM. 74. The apparatus according to any one of claims 44 to 73, wherein the reconstructed pixels for obtaining the similar blocks comprise: The reconstructed pixels on the upper side of the coding unit to which the current block belongs, the reconstructed pixels on the left side of the coding unit, and the reconstructed pixels of the coding unit; or, Reconstructed pixels on the upper side of the coding unit, reconstructed pixels on the left side of the coding unit, reconstructed pixels on the right side of the coding unit, reconstructed pixels on the lower side of the coding unit, and reconstruction of the coding unit pixels; or, reconstructed pixels of the coding unit. 75. The device according to claim 74, wherein the number of pixels in the vertical direction of the reconstructed pixels on the upper side of the coding unit is less than or equal to the number of pixels in the horizontal direction of the reconstructed pixels on the left side of the coding unit. number of pixels. 76. A device for video processing, comprising: A similar block obtaining unit, configured to obtain at least one similar block of the current block from the reconstructed pixels, where the current block includes at least one reconstructed pixel, wherein a parameter used to characterize the similarity between the current block and the similar block The value of exceeds the first threshold; a building unit for building a structure array based on the at least one similar block; a decomposition unit for decomposing the structure array; The reconstruction unit is used to obtain the reconstructed structure array according to the decomposed structure array. 77. The apparatus of claim 76, wherein the number of similar blocks is less than or equal to a second threshold. 78. The device according to claim 77, wherein the similar block obtaining unit is further configured to: When the number of searched desired blocks reaches the second threshold, the desired block is regarded as the similar block, and the search of the similar block is stopped, wherein the desired block is used to characterize the current block and the desired block The value of the similarity parameter exceeds the first threshold. 79. The device according to claim 77, wherein the similar block obtaining unit is further configured to: In all the pixels of the reconstructed pixels, when the number of the desired blocks searched is greater than the second threshold, according to the manner of similarity from high to low, from the desired blocks, it is determined that the number is equal to the second threshold The similar block of , wherein the value of the parameter characterizing the similarity between the current block and the desired block exceeds a first threshold. 80. The device of any one of claims 76 to 79, wherein the first threshold is determined based on at least one of the following parameters: The size of the current block, the bit depth of the video, the pixel sum of the current block, the horizontal gradient of the pixels of the current block, the vertical gradient of the pixels of the current block. 81. The device according to claim 80, wherein when the parameter characterizing the similarity is a difference of hash values, The first threshold is determined based on at least one of the following parameters: The sum of the pixels of the current block, the horizontal gradient of the pixels of the current block, and the vertical gradient of the pixels of the current block. 82. The apparatus according to claim 80, wherein, when the parameter characterizing the similarity is the sum of squared errors (SSD) or the sum of absolute errors (SAD), The first threshold is determined based on at least one of the following parameters: the size of the current block, and the bit depth of the video. 83. The device according to claim 80, wherein, when the parameter characterizing the similarity is mean absolute difference MAD, mean squared error MSD or structural similarity index SSIM, The first threshold is determined based on the bit depth of the video. 84. The device according to any one of claims 76 to 83, wherein the parameter representing the similarity is: difference of hash values, SSD, SAD, MAD, MSD or SSIM. 85. The device according to any one of claims 76 to 84, wherein the device is implemented by an encoding terminal; the device further comprises: A sending unit, configured to determine the first threshold and encode the first threshold. 86. The device according to any one of claims 76 to 84, wherein the device is implemented by a decoding end; the device further comprises: A receiving unit, configured to acquire the first threshold in the code stream.