CN110352599A - Method for video processing and equipment - Google Patents
Method for video processing and equipment Download PDFInfo
- Publication number
- CN110352599A CN110352599A CN201880012506.0A CN201880012506A CN110352599A CN 110352599 A CN110352599 A CN 110352599A CN 201880012506 A CN201880012506 A CN 201880012506A CN 110352599 A CN110352599 A CN 110352599A
- Authority
- CN
- China
- Prior art keywords
- block
- pixel
- similar
- threshold
- similar block
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
- H04N19/117—Filters, e.g. for pre-processing or post-processing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
- H04N19/124—Quantisation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
- H04N19/157—Assigned coding mode, i.e. the coding mode being predefined or preselected to be further used for selection of another element or parameter
- H04N19/159—Prediction type, e.g. intra-frame, inter-frame or bidirectional frame prediction
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
- H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
- H04N19/176—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a block, e.g. a macroblock
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
- H04N19/182—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being a pixel
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/44—Decoders specially adapted therefor, e.g. video decoders which are asymmetric with respect to the encoder
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
- H04N19/503—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving temporal prediction
- H04N19/51—Motion estimation or motion compensation
- H04N19/513—Processing of motion vectors
- H04N19/517—Processing of motion vectors by encoding
- H04N19/52—Processing of motion vectors by encoding by predictive encoding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
- H04N19/593—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding involving spatial prediction techniques
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
- H04N19/61—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding in combination with predictive coding
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
- H04N19/91—Entropy coding, e.g. variable length coding [VLC] or arithmetic coding
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
- Image Analysis (AREA)
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
Copyright notice
This patent document disclosure includes material protected by copyright.The copyright is all for copyright holder.Copyright
Owner does not oppose the patent document in the presence of anyone replicates the proce's-verbal of Patent&Trademark Office and archives or should
Patent discloses.
Technical field
This application involves field of video processing, and more particularly, to a kind of method for video processing and equipment.
Background technique
In video coding process, filtering is key component.It is mainly used for reducing the compression mistake generated in cataloged procedure
Very.The loop filter of current video coding standards is filtered using image local similar characteristic, this filtering mode
Limit the performance of filter.In order to further enhance compression performance, the loop filter based on non local similitude (specifically may be used
Think the Video coding filter (Non-local Structure-based Filter, NLSF) based on non local structure) quilt
It is applied in coding framework, it utilizes the non local self-similarity of image, and the similar structure group obtained to search carries out collaboration filter
Wave.
When being filtered using NLSF, need to carry out current block the search of similar block, and similar based on what is searched
Block constructs structural array, to execute the filtering based on structural array.Wherein, it when searching for similar block, needs in search window
All pixels carry out point by point scanning, cause complexity excessively high, it is difficult to practical.
Therefore, how to reduce the complexity of filtering is a urgent problem to be solved.
Summary of the invention
The embodiment of the present application provides a kind of method for video processing and equipment, can reduce the complexity of filtering
Degree.
In a first aspect, providing a kind of method for video processing, comprising: at least one pixel set, obtain
At least one first similar block of current block, wherein the pixel set includes sparse reconstruction pixel, which includes at least
One reconstruction 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 rebuilds structural array.
Second aspect provides a kind of method for video processing, comprising: from rebuilding in pixel, obtains current block
At least one similar block, the current block include that at least one rebuilds pixel, wherein for characterizing the current block and the similar block
The value of the parameter of similarity exceeds first threshold;Based at least one similar block, structural array is constructed;To the structural array into
Row decomposes;According to the structural array of decomposition, obtains and rebuild structural array.
The third aspect provides a kind of equipment for video processing, comprising: similar block acquiring unit, at least
In one pixel set, at least one first similar block of current block is obtained, wherein the pixel set includes sparse reconstruction picture
Element, the current block include that at least one rebuilds pixel;Construction unit, for being based at least one first similar block, building knot
Structure array;Decomposition unit, for being decomposed to the structural array;Reconstruction unit is obtained for the structural array according to decomposition
Rebuild structural array.
Fourth aspect provides a kind of equipment for video processing, comprising: similar block acquiring unit is used for from reconstruction
In pixel, at least one similar block of current block is obtained, which includes that at least one rebuilds pixel, wherein for characterizing
The value of the parameter of the similarity of the current block and the similar block exceeds first threshold;Construction unit is used for based on this at least one
Similar block constructs structural array;Decomposition unit, for being decomposed to the structural array;Reconstruction unit, for according to decomposition
Structural array obtains and rebuilds structural array.
5th aspect, provides a kind of computer system, comprising: memory, for storing computer executable instructions;Place
Device is managed, for accessing the memory, and executes the computer executable instructions, to carry out above-mentioned first aspect or second aspect
Operation in method.
6th aspect, provides a kind of computer storage medium, is stored with program code in the computer storage medium, should
Program code can serve to indicate that the method for executing above-mentioned first aspect or second aspect.
7th aspect, provides a kind of computer program product, which includes program code, which can
To be used to indicate the method for executing above-mentioned first aspect or second aspect.
Therefore, the method for video processing in the embodiment of the present application obtains current at least one pixel set
At least one first similar block of block, wherein the pixel set includes sparse reconstruction pixel, which includes at least one
Pixel is rebuild, at least one first similar block is based on, structural array is constructed, which is decomposed, according to decomposition
Structural array, obtain rebuild structural array, can in the case where guaranteeing the smallest loss of coding performance, reduce filtering complexity
Degree to reduce the complexity of encoding and decoding, and saves the time of encoding and decoding.
Detailed description of the invention
Technical solution in ord to more clearly illustrate embodiments of the present application, below will be in embodiment or description of the prior art
Required attached drawing is briefly described, it should be apparent that, the accompanying drawings in the following description is only some realities of the application
Example is applied, it for those of ordinary skill in the art, without creative efforts, can also be according to these attached drawings
Obtain other attached drawings.
Fig. 1 is the schematic figure according to the coded system of the embodiment of the present application.
Fig. 2 is the schematic diagram according to the coding framework of the embodiment of the present application.
Fig. 3 is the schematic figure for the process that SVD is decomposed.
Fig. 4 is the schematic figure of the process of hard -threshold.
Fig. 5 is the schematic flow chart according to the method for video processing of the embodiment of the present application.
Fig. 6 is the schematic figure chosen according to the current block of the embodiment of the present application.
Fig. 7 is the schematic figure according to the pixel distribution in the template in the embodiment of the present application.
Fig. 8 is the schematic diagram of the template or pixel set according to the embodiment of the present application.
Fig. 9 is the schematic figure that similar block is obtained in rebuilding pixel according to the embodiment of the present application.
Figure 10 is the schematic figure that similar block is obtained in rebuilding pixel according to the embodiment of the present application.
Figure 11 is the schematic figure handled according to the video of the embodiment of the present application.
Figure 12 is the schematic block diagram according to the equipment for video processing of the embodiment of the present application.
Figure 13 is the schematic block diagram according to the equipment for video processing of the embodiment of the present application.
Figure 14 is the schematic block diagram according to the computer system of the embodiment of the present application.
Specific embodiment
Below in conjunction with the attached drawing in the embodiment of the present application, technical solutions in the embodiments of the present application is described, and is shown
So, described embodiment is some embodiments of the present application, instead of all the embodiments.Based on the implementation in the application
Example, every other embodiment obtained by those of ordinary skill in the art without making creative efforts belong to
The range of the application protection.
Unless otherwise indicated, the technical field of all technical and scientific terms and the application used in the embodiment of the present application
The normally understood meaning of technical staff it is identical.Term used in this application is intended merely to the mesh of description specific embodiment
, it is not intended that limitation scope of the present application.
Fig. 1 is the architecture diagram using the technical solution of the embodiment of the present application.
As shown in Figure 1, system 100 can receive pending data 102, pending data 102 is handled, at generation
Data 108 after reason.For example, system 100 can receive data to be encoded, after being encoded data to be encoded to generate coding
Data treat decoding data alternatively, system 100 can receive data to be decoded and be decoded to generate decoded data.
In some embodiments, the component in system 100 can be realized that the processor can be calculating and set by one or more processors
Processor in standby, the processor being also possible in mobile device (such as unmanned plane).The processor can be any kind
Processor, the embodiment of the present application do not limit this.In some possible designs, which may include at picture signal
Reason device (Image Signal Processor, ISP), coding or decoder etc..It can also include one or more in system 100
Memory.The memory can be used for store instruction and data, for example, realizing that the computer of the technical solution of the embodiment of the present application can
It executes instruction, pending data 102, treated data 108 etc..The memory can be the memory of any kind, this Shen
Please embodiment to this also without limitation.
Pending data 102 may include text, image, Drawing Object, animation sequence, audio, video or any need
It encodes or other decoded data.
Any suitable coding or decoding technique may be used to encode or decode pending data 102.Coding or decoding
Type is dependent on pending data and specific coding or decoding requirements.
In some embodiments, one or more different codecs may be implemented in coding or decoder.Every kind of volume solution
Code device may include the code for realizing different coding or decoding algorithm, instruction or computer program.Based on various factors, including to
The type of processing data 102 and/or source, the receiving entity of pending data data, available computing resource, network environment,
Business environment, Codes and Standards etc. can choose a kind of suitable coding or decoding algorithm coding or given to be processed of decoding
Data 102.
For example, coding or decoder can be configured as coding or a series of video frames of decoding.Encode or decode each frame
In data can use series of steps.
Fig. 2 is the frame diagram according to a kind of encoder of the embodiment of the present application.Introduce interframe volume respectively below with reference to Fig. 2
The process of code and intraframe coding.
As shown in Fig. 2, the process of interframe encode can be as follows:
In 201, current frame image is obtained.In 202, reference frame image is obtained.In 203a, reference frame figure is utilized
Picture carries out estimation, to obtain the motion vector (Motion Vector, MV) of each image block of current frame image.?
In 204a, the motion vector obtained using estimation carries out motion compensation, to obtain the estimated value of current image block.205
In, the estimated value of current image block is subtracted each other with current image block, obtains residual error.In 206, residual error is converted, with
To transformation coefficient.In 207, transformation coefficient is quantified quantified after coefficient.In 208, by the coefficient after quantization into
Row entropy coding, finally the coding mode information by bit stream that entropy coding obtains and after being encoded is stored or is sent to solution
Code end.In 209, inverse quantization is carried out to the result of quantization.In 210, inverse transformation is carried out to inverse quantization result.In 211, benefit
With inverse transformation result and motion compensated result, obtain rebuilding pixel.In 212, it is filtered to pixel is rebuild.In 213,
Export filtered reconstruction pixel.
As shown in Fig. 2, the process of intraframe coding can be as follows:
In 202, current frame image is obtained.In 203b, intra prediction selection is carried out to current frame image.In 204b
In, the current image block in present frame carries out intra prediction.In 205, by the estimated value and current image block of current image block
Subtract each other, obtains residual error.In 206, the residual error of image block is converted, to obtain transformation coefficient.In 207, transformation coefficient
It is quantified quantified after coefficient.In 208, the coefficient after quantization is subjected to entropy coding, finally obtains entropy coding
Bit stream and the coding mode letter after being encoded are stored or are sent to decoding end.In 209, quantized result is carried out anti-
Quantization.In 210, inverse transformation is carried out to inverse quantization result and, using inverse transformation result and intra-prediction result, is obtained in 211
To reconstruction pixel.
Wherein, the filtering in 212 can be used for reducing the compression artefacts in cataloged procedure.
Wherein, the filtering in 212 can be by the loop filter (Non-local based on the non local similar characteristic of image
Structure-Based Filter for Video Coding, NLSF) Lai Shixian, which mainly utilizes the non-office of image
Portion's structure similar characteristic, the similar structure group obtained to search carry out collaboration filtering.
Specifically, current reconstruction image frame or image block can be handled by block.K can specifically be divided the image into
Block, using these blocks as current block.And M phase of current block is obtained in some reconstruction pixels of picture frame or image block
Like block.By M similar block composition set.Then the collection that these similar blocks form is shared into mathematic(al) structure to indicate, can be one
Dimension, two dimension or three-dimensional matrice, above procedure can be called the building (Group Construction) of structural array.Filtering
Process is exactly the treatment process to matrix (structural array), it is therefore an objective to filter out the distortion introduced in cataloged procedure and noise, this mistake
Journey is properly termed as the filtering (Group-based filtering) based on structural array.Wherein it is possible to be carried out to the structural array
Singular value decomposition (Singular Value Decomposition, SVD), and hard -threshold operation is carried out to singular value, according to surprise
The result that different value is decomposed, which obtains, rebuilds structure group, finally obtains reconstruction image.Wherein, the purpose that SVD is decomposed is by structural array
Principal component is extracted, simple SVD can not play the role of filtering, and the key of filtering is to remove noise, removes and make an uproar in NLSF
The local operation using hard -threshold of sound.
It is described below with reference to Fig. 3 and Fig. 4.Wherein, Fig. 3 is the process that SVD is decomposed, this can be understood as matrix
Two-dimensional matrix, can be specifically decomposed into the form of three matrix products, intermediate matrix is a diagonal matrix, right by transformation
Element on linea angulata is sequentially reduced from the upper left corner to the lower right corner, lesser element can be considered noise, wherein " smaller "
Evaluation criterion can use a threshold value, if threshold value is 60, that one part less than 60 is considered noise, be directly disposed as 0.
As shown in figure 4, can be again by three matrix multiples, obtained matrix and the original matrix decomposed can not be identical, this is just
It is after filtering out noise as a result, the process can be known as to the process of hard -threshold.
Wherein, the complexity of filtering is from the similar block for obtaining current block.For example, if NLSF uses full search
Mode (mode for being referred to as point by point scanning) at most like piece of square aearch window search current block.Search process
It can carry out according to raster scan order, be terminated to the lower right corner pixel-by-pixel since the search window upper left corner.It is searched in search process
To each fritter require and current block calculate error sum of squares (Sum of Squared Differences, SSD).Most
SSD is sorted afterwards, chooses the corresponding fritter of the smallest M SSD.Specifically, if carried out using the mode of full search similar
Block search, searches for 30 most like piece in the search window of 33x33, and the number of the candidate blocks searched out in search process is
1089.The part of Block- matching excessively redundancy, and the number that may cause candidate blocks is significantly larger than the similar block number of NLSF needs
Mesh.
Therefore, the embodiment of the present application provides a kind of method of video processing, can simplify similar block in filtering and obtains
The complexity taken, so as to improve the efficiency of coding and decoding video.
It should be understood that the method for the embodiment of the present application can be applied to coding framework shown in Fig. 2, it is readily applicable to other
Coding framework, the embodiment of the present application is not especially limited this.
Fig. 5 is the schematic flow chart according to the method for video processing 300 of the embodiment of the present application.This method 300
Including at least partly content in the following contents.Wherein, this method 300 can also can be applied to solve by being applied to coding side
Code end.
Optionally, this method 300 can be realized by filter, which can be one of encoder or decoder
Point, can also exist independently of encoder or decoder.Optionally, which can be NLSF filter or other filters
Wave device.
In 310, filter obtains at least one first similar block of current block at least one pixel set,
In, which includes sparse reconstruction pixel, which includes that at least one rebuilds pixel.
Optionally, the reconstruction pixel that the pixel set in the embodiment of the present application includes can be the reconstruction picture before filtering
Element.
Optionally, the similar block mentioned in the embodiment of the present application (including the first similar block and is subsequently noted second similar
Block) can be with higher piece of current block similarity, the size of the similar block can be equal to the size of current block.With current block
A possibility that similarity is higher, then is selected as similar block is bigger.
Wherein, the measurement parameter (namely parameter for characterizing similarity) for similarity judgement can be with are as follows: cryptographic Hash
Difference, error sum of squares (Sum of Squared Differences, SSD), absolute error and (Sum of Absolute
Differences, SAD), mean absolute difference (Mean Absolute Differences, MAD), mean error quadratic sum
(Mean Square Differences, MSD) or structural similarity index (Structural SIMilarity SSIM).
For example, it is assumed that the measurement parameter of similarity is SSD, the calculation of SSD is as shown in following formula 1:
Wherein, f (h, w) indicate current block coordinate (h, w) pixel,Indicate that search block (is referred to as waiting
Select similar block) in the pixel of coordinate (h, w),Indicate the number of pixels that current block includes.
For example, characterization assume similarity measurement parameter be cryptographic Hash, then can by the size of Hash (hash) value come
Judge similarity, the hash value of two blocks is more similar closer to representing, and hash value can be by the pixel of block and horizontal, vertical
Gradient etc. indicates.
It should be understood that some values are bigger in the above measurement parameter, then show that similarity is higher, and some values are smaller, then show
Similarity is higher.
For example, the value of SSD is smaller for SSD, then show that similarity is higher.And for cryptographic Hash, similarity
It can be judged by the difference of the cryptographic Hash of two blocks, the difference of cryptographic Hash is smaller, then shows that similarity is higher.
It should also be understood that being more than that threshold value (may include for the parameter for characterizing similarity that the embodiment of the present application is mentioned
Threshold value this number) for, if the bigger similarity of value of measurement parameter is higher, the value of the parameter for characterizing similarity is more than certain
The value that value represents the parameter is greater than or equal to the threshold value;If the smaller similarity of value for measuring parameter is higher, for characterizing phase
Value like the parameter of degree is more than that certain value represents the value of the parameter less than or equal to the threshold value.And for cryptographic Hash, it uses
It is less than or equal to the threshold value in the difference that the value of the parameter of characterization similarity is more than the cryptographic Hash that certain value represents two blocks.
Optionally, in the embodiment of the present application, similar to the similar block of the current block for characterizing the current block
The value of the parameter of degree exceeds first threshold.
Optionally, which determined based at least one of following parameter: the size of the current block, video
Bit-depth, the pixel of the current block and, the horizontal gradient of the pixel of the current block, the vertical ladder of the pixel of the current block
Degree.
Wherein, the size of current block directly determines the number summed it up in SSD calculating process, what the bit-depth of video represented
It is that (for example the video of 8bit, each pixel value are the numbers between 0~255 for the value range of pixel value;10bit video, each picture
Plain value is the number between 0~1023, it is clear that different bit-depths, pixel value range is different, the size model for the SSD being calculated
It encloses also just different).
Wherein it is determined that the parameter of threshold value can be and measure used relating to parameters when Parameters Calculation.
In one implementation, when the measurement parameter of the similarity is cryptographic Hash, which is based on following
What at least one of parameter determined:
The pixel of the current block and, the horizontal gradient of the pixel of the current block, the vertical gradient of the pixel of the current block.
Specifically, similarity can be judged by the size of Hash (hash) value, the hash value of two blocks is closer to generation
Table is more similar, and hash value can be indicated by the pixel of block and horizontal, vertical gradient etc..
In one implementation, when the measurement parameter of the similarity is SSD or SAD, which is based on following
What at least one of parameter determined: the size of the current block, the bit-depth of video.
Wherein, first threshold can be related with the bit-depth of the size of current block and video, can pass through following public affairs
Formula 2 calculates first threshold:
ε=Bs× (1 < < (2 × bitDepth)) × λ formula 2
Wherein bitDepth is the bit-depth of test video, usually 8 or 10.λ can be according to current block and similar block
Between the statistical property of SSD be calculated,Indicate the number of pixels that current block includes.
In one implementation, when the measurement parameter of the similarity is MAD, MSD or SSIM, which is to be based on
What the bit-depth of video determined.
Specifically, first threshold, which can be, obtains according to following equation 3:
ε=(1 < < (2 × bitDepth)) × λ formula 3
Therefore, in the embodiment of the present application, the similar block of selection and the similarity height before current block are to beyond certain threshold
Value can make selection similar block and current block similarity it is higher, so as to avoid the similar block chosen may with it is current
Block difference is larger, thus the higher problem of filtering complexity caused by avoiding these blocks from helping less filtering.
Optionally, the embodiment of the present application can be realized by coding side, can also be realized by decoding end, be realized by coding side
When, coding side can calculate first threshold, and first threshold is passed to decoding end in code stream.And by decoding end reality
Now, decoding end can obtain first threshold from code stream, no longer carry out the calculating of first threshold.
Certainly, in the embodiment of the present application, coding side and decoding end can calculate separately first threshold, then coding side is not necessarily to
The first threshold is transmitted in code stream.
Optionally, the embodiment of the present application can obtain current block from the reconstructed frame after getting entire reconstructed frame.
Wherein, see Fig. 6, look first at two frames of upper left side, if the frame in left side is the current block handled, it is next will
The block of processing is exactly the frame on right side, can have overlapping between the two blocks, can be located next to, can also every a certain distance, than
Such as the current block of 6x6 size, the step value (interval that can be the pixel of the leftmost side of two frames) between two frames can
Any integer value to be 1,2,3 ... etc. just has certain overlapping between two blocks when wherein step value is 1,2,3,4,5, walks
Two blocks are located next to when long value is 6, and when being greater than 6, two blocks are every a certain distance.Another is exactly the interval of upper and lower two blocks
Problem, for example, two frames of centre as shown in FIG. 6, next to be if the frame of upside is the current block handled
It is exactly the frame of downside by the block of processing, there can be overlapping between the two blocks, can be located next to, it can also be every a certain distance.
Optionally, when getting whole frame reconstruction image and being filtered, the pixel in pixel set can be present frame
The pixel of any position in reconstruction image, the partial pixel being also possible in a search window, for example, it may be one
Partial pixel in 32x32 pixel set, wherein current block can be located at the center in the search window.
Optionally, the reconstruction pixel of the similar block for obtaining the current block includes: coding unit belonging to the current block
Reconstruction pixel itself, the reconstruction pixel of the upside of coding unit, the reconstruction pixel in the left side of coding unit, coding unit the right side
The reconstruction pixel of the downside of the reconstruction pixel and coding unit of side.
Optionally, in the embodiment of the present application, can also get rebuild after coding unit (for example, CTU) after,
Each piece in the coding unit is filtered, for example, the coding unit can be 6x6 with the block of 128x128, current block
The block of size, the coding unit are commonly referred to as image block.Due to coding when, in the weight for getting current coded unit
When building pixel, the reconstruction pixel of the coding unit of left side and upside has been obtained, then for obtaining the reconstruction of the similar block of current block
Pixel can be the reconstruction pixel in the left side of affiliated coding unit and the reconstruction pixel of upside.
Further, in actual video coding and decoding system, the reconstruction pixel of the upside is needed with image behavior
Unit is stored, and the reconstruction pixel on the right side is stored as unit of image block height.Such as it is for a width
3840, the image that image block height is 128, described in the reconstruction pixel of upside stored as unit of 3840, it is described
The reconstruction pixel on right side is stored as unit of 128.It can be seen that the storage overhead of the reconstruction pixel of the upside is typically larger than
The storage overhead of the reconstruction pixel on the right side.In order to reduce the storage overhead of video coding and decoding system, the weight of the upside
The number of pixels (usually may be considered the line number of the reconstruction pixel of the upside) for building the vertical direction of pixel can be lacked
(it usually may be considered the weight in the left side in or equal to the number of pixels of horizontal direction of reconstruction pixel in the left side
Build the columns of pixel).
Certainly, the reconstruction pixel of the similar block for obtaining current block may be coding unit belonging to the current block
Left side reconstruction pixel, the reconstruction pixel on the reconstruction pixel of upside and right side (wherein, needs to wait the coding unit quilt on right side
It rebuilds).
The embodiment of the present application can also have other implementations, for example, for the coding unit currently rebuild, it is right
Current block in the upper left side of the coding unit, the reconstruction pixel for obtaining similar block can be the left side of current block, upside,
The reconstruction pixel of downside and right side, this is because the reconstruction pixel of the right side of the current block and downside still falls within present encoding list
Member.And the current block of the lower right side for the coding unit, the reconstruction pixel for obtaining similar block can be a left side for current block
The reconstruction pixel of side and upside, this is because the reconstruction pixel of the right side of the current block and downside belongs to the coding of right side and downside
Unit, and the coding unit of right side and downside is not rebuild also, so cannot be used for obtaining the similar block of current block.
It should be understood that the pixel set of the embodiment of the present application includes sparse reconstruction pixel means that: deposited in the pixel set
Interval (for example, shortest straight line distance on) between pixel is not belonging to the collection between such some pixels, these pixels
The pixel of conjunction.
Optionally, in the embodiment of the present application, the partial pixel in pixel set can also be assembled blocking, and pixel set can
Be gathered into separation multiple pieces (referring herein to block and block between there is no adjacent pixel), wherein each piece of size
The size of current block can be greater than or equal to.For example, as shown in Figure 7 (represents a location of pixels), in pixel set
Including five blocks, each piece is greater than current block (assuming that current block size is 6x6), wherein in five blocks each piece can be with shape
As the one or more candidate similar block being mentioned below.
Optionally, in the embodiment of the present application, filter can be based on template, obtain pixel set.Specifically, Ke Yi
Template is preset in filter, draws a circle to approve some reconstruction pixels in a search window using the template, these rebuild pixels can be with
Understand the pixel set that the embodiment of the present application is mentioned.
Optionally, in the embodiment of the present application, template is also possible to be interpreted as a kind of pixel set, the picture which includes
Element can be symmetrical relative to template center.Optionally, from the center of the template to the edge of the template, pixel be can be more
Come more sparse.
Optionally, when determining the pixel set for obtaining similar block with template, may exist it is such a as a result,
That is: the pixel quantity in pixel set is less than the pixel quantity that template includes, this is because with template in a search range
When drawing a circle to approve some reconstruction pixels, the edge of template may exceed the edge of search range.
Optionally, which includes multiple candidate similar blocks for selecting first similar block, candidate's similar block
Size is equal to the size of the current block.Wherein, candidate similar block mean with the similarity height of current block to be more than certain threshold
When value, similar block can be selected as.Wherein, the pixel that multiple candidate similar blocks include can not be overlapped or partly overlap.
Optionally, in the embodiment of the present application, which includes multiple groups candidate's similar block from center to edge, every group of time
Similar block is selected to surround annular, the circular phase to the central symmetry of the template, uniformly arrange by the candidate similar block in group.Certainly, should
The candidate similar block that template includes is also possible to asymmetric.
Optionally, which includes four groups of candidate's similar blocks, the center far from the template of four groups of candidate's similar blocks
Edge pixel is respectively separated 1 pixel, 2 pixels, 4 pixels and 8 pixels relative to the center of the template.
Optionally, which is respectively provided with 4 candidate similar blocks, 8 candidate similar blocks, 8 candidate phases
Like block and 8 candidate similar blocks, wherein center of the one group of candidate's similar block with 4 candidate similar blocks apart from the template is most
Closely.
Specifically, below with reference to template shown in Fig. 8 (Fig. 8 is it is also assumed that be the pixel set obtained based on template)
It is illustrated.For example, as shown in figure 8, the crosspoint of multiple can be a location of pixels, each independent number in figure
Word represents an independent candidate similar block, for example, 8. there are 8, then representing has 8 candidate similar blocks, 4. there are 8,
Also representing has 8 candidate similar blocks, 2. 8 represent and have 8 candidate similar blocks, and 1. 4 represent and have 4 candidate similar blocks, then whole
A template includes 28 candidate similar blocks.1. 2. 4. 8. number can be a location of pixels of candidate similar block respectively, for example,
It can be location of pixels on the edge at the center of the separate template of candidate similar block, specifically can be the location of pixels in the upper left corner,
The location of pixels in the lower left corner, the location of pixels in the upper right corner or the location of pixels in the lower right corner.Certainly, the number representative in figure can also
To be other location of pixels of candidate similar block, for example, it may be center pixel position etc..Assuming that each candidate's similar block is big
The block of small 6x6 then means that these candidate similar blocks are overlapped.
Optionally, in the embodiment of the present application, filter can carry out pixel set using at least two template
Determination, for example, different pixel sets can be determined using different templates.
It should be understood that the template of the embodiment of the present application also may include the candidate similar block group and every group of time of other quantity
Select similar block also and may include the candidate similar block of other quantity.
For example, the pixel of template can organize across, bar shaped, other polygons in addition to quadrangle etc..Wherein, exist
When forming other polygons in addition to quadrangle, Fig. 7 can be similar to and connected with one another closely, for example, biggish pentagon
Cover lesser pentagon.
It should also be understood that the pixel characteristic described above about in template is equally applicable to pixel set.For sake of simplicity,
This is repeated no more.
It should be understood that template or pixel set that the embodiment of the present application is mentioned are also possible to include sparse reconstruction pixel, press
According to certain rule, the matching of similar block is carried out in the sparse reconstruction pixel, is implied the absence of at this time mentioned above
The concept of candidate similar block.
Optionally, in the embodiment of the present application, filter can be based on the position for the reconstruction pixel that the current block includes, really
Fixed first pixel set;From first pixel set, first similar block is obtained.
Wherein, the pixel in first pixel set can be sparse reconstruction pixel, the picture in first pixel set
Element can be symmetrical relative to the reconstruction pixel that the current block includes.For example, as shown in fig. 7,Place location of pixels, which can be, works as
Preceding piece of a location of pixels, for example, it may be the location of pixels in the upper left corner of current block or the location of pixels at center or bottom right
The location of pixels etc. at angle.
It is alternatively possible to according to the way of search from close to the current block to far from the current block, from first set of pixels
In conjunction, first similar block is obtained.
Specifically, in pixel set as shown in Figure 8, the matching of similarity first can be 1. carried out to candidate similar block,
Then the matching of similarity is 2. carried out to candidate similar block again, then 4. carries out the matching of similarity to candidate similar block, it is finally right
8. candidate similar block carries out the matching of similarity.
This is because in candidate similar block choose similar block during, need according to similarity to candidate similar block into
Row sequence, to obtain highest a certain number of pieces of similarity as similar block, in the position closer to current block, candidate is similar
A possibility that similarity of block and current block may be higher, is selected as similar block is bigger, under this kind of way of search, is selecting
When taking similar block, need to adjust the negligible amounts of the candidate similar block of position, so as to reduce the complexity of filtering.
Optionally, in the embodiment of the present application, the quantity of the first similar block obtained from the first pixel set can not
More than certain numerical value, for example, second threshold.
In one implementation, available search block all into the first pixel set (is referred to as candidate phase
Like block) with the similarity of current block, arrange in the way of from high to low by similarity, choose the first phase that quantity is second threshold
Like block.
In another implementation, the quantity of the expectation block searched in first pixel set reaches the second threshold
When value, using the expectation block as first similar block, and stops in first pixel set and carry out first phase
Like the search of block, wherein the value for characterizing the parameter of the similarity of the current block and the expectation block exceeds first threshold.
In another implementation, in all pixels of first pixel set, the number of the expectation block searched
Amount be greater than second threshold when, by similarity from high to low in the way of, from the expectation block searched, quantification is equal to
First similar block of the second threshold, wherein for characterizing the ginseng of the similarity of the current block and the expectation block
The value of amount exceeds first threshold.
Optionally, in the embodiment of the present application, the reconstruction pixel that can include according to previous the first obtained similar block
Position determines the second pixel set;From second pixel set, first similar block is obtained again.
Wherein, the pixel in second pixel set can be sparse reconstruction pixel, the picture in second pixel set
The reconstruction pixel that element can include relative to predetermined first similar block is symmetrical.
Wherein, which can be (is determined from the first pixel set based on the position of current block
Pixel set) in the obtained similar block of search, be also possible to based on another second pixel set (based on the first previous phase
The pixel set determined like the position of block) in the obtained similar block of search.
That is, in the embodiment of the present application, after the position based on current block obtains a pixel set, at this
Similar block is searched in pixel set, then the location of pixels again based on the similar block searched, pixel set is determined again, again
Similar block is searched in the pixel set of secondary determination, then can stop the search of the similar block based on pixel set, or can also
To determine pixel set based on the similar block searched again for, and so on.Wherein it is possible to which the process is known as to be based on this Shen
Please the N rank search process of pixel set mentioned of embodiment, N can be more than or equal to 1 integer for value, and the size of N can root
Depending on actual conditions.
It is described in detail below with reference to Fig. 9.As shown in figure 9, being based on current blockIn determining pixel set, two
8. (being grey bottom in figure centre circle, word is 8 number of white) a candidate's similar block is confirmed as similar block, in this two candidate phases
Like block 8. around respectively determine pixel set (by being grey bottom in figure centre circle, word is the number of black to indicate), then, this two
Similar block is determined in a pixel set respectively, that is, be black matrix, the similar block that word is the number of white to indicate in figure centre circle, that is,
5 similar blocks.Two similar blocks obtained plus before as a result, show 7 similar blocks altogether in Fig. 9.
Optionally, in the embodiment of the present application, in second pixel set before similarity mode has been carried out
Block no longer carries out the matching operation of similar block, it is possible thereby to save the complexity of filtering.
Alternatively, not including that similar Block- matching behaviour has been carried out in second pixel set in the embodiment of the present application
The block of work, that is to say, that when determining the second pixel set with template, certain pieces have been carried out similarity mode, then the time
Similar block is selected to be no longer included in the second pixel set.
For example, as shown in figure 9, only including based on 8. candidate similar block that the block that the lower right corner is confirmed as similar block determines
17 candidate similar blocks, rather than 28 candidate similar blocks, because there are some candidate similar blocks, and similar block has been carried out
Match.
It should be understood that the embodiment of the present application is not limited to this.
For example, having been identified as the block of similar block before in second pixel set, of similar block is no longer carried out
With operation.That is, even if similarity mode has been carried out before, but due to being not determined as similar block, still
It can be matched again, for example, it may be due in not same order search process, it can for judging whether it is the threshold value of similar block
To be different.
It similarly, does not include the block for having been identified as similar block in second pixel set, that is to say, that with mould
When plate determines the second pixel set, certain pieces have had been identified as similar block, then candidate's similar block is no longer included in
In two pixel sets.
Optionally, in the embodiment of the present application, the quantity of the similar block obtained from second pixel set can not
More than certain numerical value, for example, third threshold value.Wherein, a third pixel set can be understood as the first similar block week
Enclose the pixel entangled with a template.
In one implementation, the similarity of available all into the second pixel set search block and current block,
It arranges in the way of from high to low by similarity, chooses the first similar block that quantity is third threshold value.
In another implementation, the quantity of the expectation block searched in second pixel set reaches third threshold
When value, the expectation block is determined as first similar block, and stop in second pixel set and carry out described first
The search of similar block, wherein the value for characterizing the parameter of the similarity of the current block and the expectation block exceeds the first threshold
Value.
In another implementation, in all pixels of second pixel set, the number of the expectation block searched
Amount be greater than third threshold value when, by similarity from high to low in the way of, from the expectation block searched, quantification is equal to
First similar block of the third threshold value, wherein for characterizing the ginseng of the similarity of the current block and the expectation block
The value of amount exceeds first threshold.
Implementation it should be understood that the embodiment of the present application, and more than being limited to, wherein can be in multiple pixel sets
The similar block of search is no more than third threshold value.For example, multiple pixel set can be understood as more than N rank search process in
Wherein line search process obtains the corresponding multiple pixel sets of multiple similar blocks.
Optionally, in the embodiment of the present application, the first pixel set and the corresponding template of the second pixel set can be identical.
Alternatively, the first pixel set and the corresponding template of the second pixel set can not be identical.
It optionally, can not be identical for the template sampled in not same order search process, naturally it is also possible to identical.
The scheme that the first similar block is determined using sparse pixel set is had been introduced above, in the embodiment of the present application
In, after getting the first similar block, it is also based on the position of first similar block, determines pixel window respectively;At this
In pixel window, second similar block is obtained.
Wherein, in the pixel window, second similar block can be determined in the way of point by point scanning.
For example, as shown in Figure 10, it is 8. (being grey bottom in figure centre circle, word is the 8 of white) all in two similar blocks searched
Enclose one pixel window of delimitation respectively, wherein the pixel window can be symmetrical relative to fixed similar block, can not also be right
Battle array.Wherein, which can be rectangular, be also possible to other shapes of.
Wherein, the embodiment of the present application is mentioned point by point scanning can be to be realized in a manner of sliding window, the step of sliding window sliding
Length can be 1, wherein the size of sliding window can be equal to the size of current block.
Optionally, in the embodiment of the present application, can not surpass in the quantity of the similar block obtained from a pixel window
Certain numerical value is crossed, for example, the 4th threshold value.Wherein, a pixel window can be understood as entangling the pixel of first similar block
Window.
In one implementation, the similarity of available all into pixel window search block and current block, according to
The mode of similarity from high to low is arranged, and the second similar block that quantity is the 4th threshold value is chosen.
In another implementation, the quantity of the expectation block searched in the pixel window reaches the 4th threshold value
When, the expectation block searched is determined as second similar block, and stop in the pixel window and carry out described
The search of two similar blocks, wherein the value for characterizing the parameter of the similarity of the current block and the expectation block exceeds first
Threshold value.
In another implementation, in all pixels in the pixel window, the quantity of the expectation block searched
When greater than four threshold values, by similarity from high to low in the way of, from the expectation block, quantification be equal to the 4th threshold
Second similar block of value, wherein the value for characterizing the current block and the parameter of the similarity of the expectation block exceeds
First threshold.
It should be understood that the embodiment of the present application and the implementation more than being limited to, wherein can be and searched in multiple pixel windows
The similar block of rope is no more than the 4th threshold value.For example, multiple pixel window can be understood as above all the first similar blocks pair
The pixel window answered.
Optionally, in the application implementation, each search phase is explained above there may be threshold value, but the application
Embodiment is not limited to this.
For example, the threshold value of the quantity of the similar block arrived for limit search is not present in each search phase, the application is implemented
The threshold value of the quantity for limiting total all similar blocks can be set in example.
Optionally, when the quantity of the expectation block searched reaches certain numerical value, using the expectation block as described similar
Block, and stop the search of the similar block, wherein for characterizing the current block and the parameter of the similarity of the expectation block
Value exceeds first threshold.
Optionally, it is rebuild in pixel for the whole of similar block search, the quantity of the expectation block searched is greater than certain
When numerical value, by similarity from high to low in the way of, from the expectation block, quantification be equal to the numerical value it is described similar
Block, wherein the value for characterizing the parameter of the similarity of the current block and the expectation block exceeds first threshold.
Certainly, the threshold value for limiting the quantity that each stage obtains similar block both can be set, one can also be arranged simultaneously
For limiting the threshold value of the quantity of total all similar blocks.
Optionally, when the embodiment of the present application is realized by coding side, coding side can determine above-mentioned each for limiting phase
It is encoded like the threshold value of number of blocks, and by the one or more threshold value, and passes to decoding end.And by decoding end reality
Now, decoding end can obtain the one or more threshold value from code stream.
Certainly, in the embodiment of the present application, coding side and decoding end can determine above-mentioned each similar for limiting respectively
The threshold value of number of blocks, then coding side in code stream without transmitting these threshold values.
In 320, filter is based at least one first similar block, constructs structural array.
Optionally, in the application implementation, if it is determined that above-mentioned second similar block can then be based on first similar block
With the second similar block, structural array is constructed.
Optionally, the structural array of building can be one-dimensional, two-dimentional or three-dimensional matrice.
In 330, filter decomposes the structural array.
Wherein it is possible to the structural array carry out singular value decomposition (Singular Value Decomposition,
SVD hard -threshold operation), and to singular value is carried out, is obtained according to the result of singular value decomposition and rebuilds structure group, finally obtains and rebuilds
Image.Wherein, the purpose that SVD is decomposed is that structural array is extracted to principal component, and simple SVD can not play the role of filtering,
The key of filtering is removal noise, and the place of noise is removed in NLSF using the operation of hard -threshold.
In 340, filter obtains according to the structural array of decomposition and rebuilds structural array.
Optionally, in the embodiment of the present application, in addition to the filtering mode using SVD, discrete cosine transform can also be utilized
(Discrete Cosine Transform, DCT) transformation, Hadamard transform, KLT (Karhunen-Loeve Transform),
Rely on signal conversion (Signal Dependent Transform, SDT), wavelet transformation etc. filtering mode.
Optionally, the filtering mode of the embodiment of the present application can be used in combination with other filtering modes.It specifically, can be with
The filtering that other modes are executed after the filtering of the embodiment of the present application, alternatively, executing basis after the filtering of other modes
The filtering mode of the embodiment of the present application.
Other filtering techniques may include bilateral filtering, deblocking filtering, adaptive sample value compensation filter and adaptive ring
Road filtering.Wherein,
Bilateral filtering is that current pixel is calculated by own and the weighted average of adjacent four pixel values, realizes and protects side
Denoising.Deblocking filtering is used for the boundary of predicting unit and converter unit, carries out boundary picture using the low-pass filter that training obtains
The nonlinear weight of element, to reduce blocking artifact.Adaptive sample value compensation filter by classifying to pixel in image block, into
And be every class pixel and make reconstructed image closer to original image plus the mode of identical offset, to play suppressed ringing effect
The effect answered.Adaptive loop filter is a kind of Wiener filter, is mainly used for minimizing between original image and reconstructed image
Mean square error.
(search point is equivalent to similarity to the points that the needs that following table 1 shows the prior art and the application are searched for
With number of operations, a Searching point is equal to a similarity mode) according to figure.Wherein, it is used to search what is be arranged for current block
In the case that the search window of rope similar block is 33x33, the prior art average each current block when carrying out similar block search is needed
Search for 1072 points.It at most needs to search for when searching for first time using the search pattern as shown in Figure 8 in the application
28 points, several times after iteration, MarketPlace, BQTTerrace, BasketballDrive, RitualDance, Cactus five
A sequence nucleotide sequence averagely needs to search for 291 points, and the invention enables search points to save 72.9%.Wherein, five sequences
MarketPlace, BQTTerrace, BasketballDrive, RitualDance, Cactus can reduce 74.6% respectively,
70.3%, 71.5%, 75.2%, 72.9% search point.
Table 1
Therefore, the method for video processing in the embodiment of the present application obtains current at least one pixel set
At least one first similar block of block, which includes sparse reconstruction pixel, so as to reduce during the filtration process
The complexity that similar block obtains can reduce filtering complexity, to drop in the case where guaranteeing the smallest loss of coding performance
The complexity of low encoding and decoding, and save the time of encoding and decoding.Figure 11 is handling for video according to the embodiment of the present application
The schematic flow chart of method 400.As shown in figure 11, this method 400 includes at least partly content in the following contents.Wherein,
This method 400 can also can be applied to decoding end by being applied to coding side.
In 410, filter obtains at least one similar block of current block from rebuilding in pixel, which includes extremely
A few reconstruction pixel, wherein the value for characterizing the parameter of the similarity of the current block and the similar block exceeds first
Threshold value.
Wherein, which can be the pixel in search window, can use the mode of point by point scanning, from the search
In window, the similar block of current block is obtained.
In 420, filter is based at least one first similar block, constructs structural array.
In 430, filter decomposes the structural array.
In 440, filter obtains according to the structural array of decomposition and rebuilds structural array.
Optionally, the quantity of the similar block is less than or equal to second threshold.
Optionally, when the quantity of the expectation block searched reaches the second threshold, using the expectation block as described in
Similar block, and stop the search of the similar block, wherein for characterizing the ginseng of the similarity of the current block and the expectation block
The value of amount exceeds first threshold.
Optionally, in all pixels for rebuilding pixel, the quantity of the expectation block searched is greater than second threshold
When value, by similarity from high to low in the way of, from the expectation block, quantification be equal to the second threshold the phase
Like block, wherein the value for characterizing the parameter of the similarity of the current block and the expectation block exceeds first threshold.
Optionally, which determined based at least one of following parameter: the size of the current block, video
Bit-depth, the pixel of the current block and, the horizontal gradient of the pixel of the current block, the vertical ladder of the pixel of the current block
Degree.
Optionally, when the measurement parameter of the similarity is the difference of cryptographic Hash, which is based on following parameter
At least one of determine: the pixel of the current block and, the horizontal gradient of the pixel of the current block, the pixel of the current block
Vertical gradient.
Optionally, when the measurement parameter of the similarity is SSD or SAD, the first threshold be based in following parameter extremely
A kind of few determination: the size of the current block, the bit-depth of video.
Optionally, when the measurement parameter of the similarity is MAD, MSD or SSIM, which is the bit based on video
What depth determined.
Optionally, for obtaining the measurement parameter of the similarity judgement of similar block progress are as follows: the difference of cryptographic Hash, SSD,
SAD, MAD, MSD or SSIM.
Optionally, this method is realized by coding side;This method further include: the coding side determines the first threshold, with
And the first threshold is encoded.
Optionally, this method is realized by decoding end;This method further include: the decoding end obtains described first in code stream
Threshold value.
It should be understood that the realization of each operation in this method 400 is referred to the description of method 300, for sake of simplicity, herein
It repeats no more.
Figure 12 is the schematic block diagram according to the equipment 500 for video processing of the embodiment of the present application.As shown in figure 12,
The equipment 500 includes:
Similar block acquiring unit 510, for obtaining at least one first phase of current block at least one pixel set
Like block, wherein the pixel set includes sparse reconstruction pixel, which includes that at least one rebuilds pixel;
Construction unit 520 constructs structural array for being based at least one first similar block;
Decomposition unit 530, for being decomposed to the structural array;
Reconstruction unit 540 obtains for the structural array according to decomposition and rebuilds structural array.
Optionally, in the embodiment of the present application, which includes the first pixel set;
The similar block acquiring unit 510 is specifically used for:
Position based on the reconstruction pixel that the current block includes, determines first pixel set;
From first pixel set, first similar block is obtained.
Optionally, in the embodiment of the present application, which is specifically used for:
According to the way of search from close to the current block to far from the current block, from first pixel set, obtaining should
First similar block.
Optionally, in the embodiment of the present application, which is specifically used for:
When the quantity of the expectation block searched in first pixel set reaches second threshold, using the expectation block as this
First similar block, and stop at the search that first similar block is carried out in first pixel set, wherein it is current for characterizing this
The value of the parameter of the similarity of block and the expectation block exceeds first threshold.
Optionally, in the embodiment of the present application, which is specifically used for:
In all pixels of first pixel set, when the quantity of the expectation block searched is greater than second threshold, according to
The mode of similarity from high to low, from the expectation block searched, quantification be equal to the second threshold this is first similar
Block, wherein the value for characterizing the parameter of the similarity of the current block and the expectation block exceeds first threshold.
Optionally, in the embodiment of the present application, which includes the second pixel set;
The similar block acquiring unit 510 is specifically used for:
According to the position for the reconstruction pixel that previous the first obtained similar block includes, the second pixel set is determined;
From second pixel set, first similar block is obtained again.
Optionally, in the embodiment of the present application, which is specifically used for:
Based on from close to previous first similar block of this obtained to searching far from previous first similar block of this obtained
Rope mode obtains first similar block from second pixel set again.
Optionally, in the embodiment of the present application, which is specifically used for:
When the quantity of the expectation block searched in second pixel set reaches third threshold value, which is determined as
First similar block, and stop at the search that first similar block is carried out in second pixel set, wherein deserve for characterizing
The value of preceding piece and the parameter of the similarity of the expectation block exceeds first threshold.
Optionally, in the embodiment of the present application, which is specifically used for:
In all pixels of second pixel set, when the quantity of the expectation block searched is greater than third threshold value, according to
The mode of similarity from high to low, from the expectation block searched, quantification be equal to the third threshold value this is first similar
Block, wherein the value for characterizing the parameter of the similarity of the current block and the expectation block exceeds first threshold.
Optionally, in the embodiment of the present application, which is specifically used for: in second pixel set
The block of similar block matching operation has been carried out before, no longer carries out the matching operation of similar block;Alternatively,
It does not include the block that similar block matching operation has been carried out in second pixel set.
Optionally, in the embodiment of the present application, which is further used for:
Based on template, the pixel set is determined.
Optionally, in the embodiment of the present application, the reconstruction pixel in the template is collected as the image block of multiple dispersions, each
The size of image block is greater than or equal to the size of the current block.
Optionally, in the embodiment of the present application, which includes for selecting multiple candidates of first similar block similar
Block, the size of candidate's similar block are equal to the size of the current block.
Optionally, in the embodiment of the present application, which includes multiple groups candidate's similar block from center to edge, every group of time
Similar block block is selected to surround annular, the circular phase to the central symmetry of the template, uniformly arrange by the candidate similar block in group.
Optionally, in the embodiment of the present application, the template include four groups of candidate's similar blocks, four groups of candidate's similar blocks it is remote
The edge pixel at the center from the template is respectively separated 1 pixel relative to the center of the template, 2 pixels, 4 pixels and
8 pixels.
Optionally, in the embodiment of the present application, which is respectively provided with 4 candidate similar blocks, 8 candidates
Similar block, 8 candidate similar blocks and 8 candidate similar blocks, wherein one group of candidate's similar block with 4 candidate similar blocks away from
It is nearest from the center of the template.
Optionally, in the embodiment of the present application, at least one pixel set, different pixel sets is based on difference
Template determine.
Optionally, in the embodiment of the present application, which is further used for:
Based on the position of each first similar block, pixel window is determined respectively;
In the pixel window, second similar block is obtained;
The construction unit 520 is specifically used for:
Based on first similar block and second similar block, the structural array is constructed.
Optionally, in the embodiment of the present application, which is specifically used for:
In the way of point by point scanning, second similar block is determined.
Optionally, in the embodiment of the present application, which is specifically used for: in the pixel window into
It has gone the block of similar block matching operation, has no longer carried out the matching operation of similar block;Alternatively,
It does not include the block that similar block matching operation has been carried out in the search window.
Optionally, in the embodiment of the present application, which is specifically used for:
It is when the quantity of the expectation block searched in the pixel window reaches four threshold values, the expectation block searched is true
It is set to second similar block, and stops at the search for carrying out second similar block in the pixel window, wherein deserves for characterizing
The value of preceding piece and the parameter of the similarity of the expectation block exceeds first threshold.
Optionally, in the embodiment of the present application, which is specifically used for:
In all pixels in the pixel window, when the quantity of the expectation block searched is greater than four threshold values, according to phase
Like the mode of degree from high to low, from the expectation block, quantification is equal to second similar block of the 4th threshold value, wherein uses
Exceed first threshold in the value of the parameter for the similarity for characterizing the current block and the expectation block.
Optionally, in the embodiment of the present application, for characterizing the current block and the similarity of the similar block of the current block
The value of parameter exceeds first threshold.
Optionally, in the embodiment of the present application, which determined based at least one of following parameter:
The size of the current block, the bit-depth of video, the pixel of the current block and the horizontal ladder of the pixel of the current block
Degree, the vertical gradient of the pixel of the current block.
Optionally, in the embodiment of the present application, when characterizing the parameter of the similarity is the difference of cryptographic Hash,
The first threshold is determined based at least one of following parameter:
The pixel of the current block and, the horizontal gradient of the pixel of the current block, the vertical gradient of the pixel of the current block.
It optionally, in the embodiment of the present application, is error sum of squares SSD or absolute error characterizing the parameter of the similarity
When with SAD,
The first threshold is determined based at least one of following parameter: the size of the current block, the bit of video
Depth.
It optionally, in the embodiment of the present application, is mean absolute difference MAD, mean error characterizing the parameter of the similarity
When quadratic sum MSD or structural similarity index S SIM,
The first threshold is the bit-depth determination based on video.
Optionally, in the embodiment of the present application, which is realized by coding side;The equipment 500 further include:
Coding unit is encoded for determining the first threshold, and by the first threshold.
Optionally, in the embodiment of the present application, which is realized by decoding end;The equipment 500 further include:
Acquiring unit, for obtaining the first threshold in code stream.
Optionally, in the embodiment of the present application, characterize the parameter of similarity are as follows: the difference of cryptographic Hash, SSD, SAD, MAD,
MSD or SSIM.
Optionally, in the embodiment of the present application, the reconstruction pixel for obtaining the similar block includes:
The reconstruction pixel of the upside of coding unit belonging to the current block, the reconstruction pixel in the left side of the coding unit and should
The reconstruction pixel of coding unit;Or,
The reconstruction pixel of the upside of the coding unit, the reconstruction pixel in the left side of the coding unit, the coding unit the right side
Reconstruction pixel, the reconstruction pixel of the reconstruction pixel of the downside of the coding unit and the coding unit of side;Or,
The reconstruction pixel of the coding unit.
Optionally, in the embodiment of the present application, the pixel of the vertical direction of the reconstruction pixel of the upside of the coding unit
Number of pixels of the number less equal than the horizontal direction of the reconstruction pixel in the left side of the coding unit.
Optionally, which may be implemented the operation of the filter in the above method 300, for sake of simplicity, herein no longer
It repeats.
Figure 13 is the schematic block diagram according to the equipment 600 for video processing of the embodiment of the present application.As shown in figure 13,
The equipment 600 includes:
Similar block acquiring unit 610, for obtaining at least one similar block of current block from rebuilding in pixel, this is current
Block includes that at least one rebuilds pixel, wherein the value for characterizing the current block and the parameter of the similarity of the similar block exceeds
First threshold;
Construction unit 620 constructs structural array for being based at least one similar block;
Decomposition unit 630, for being decomposed to the structural array;
Reconstruction unit 640 obtains for the structural array according to decomposition and rebuilds structural array.
Optionally, in the embodiment of the present application, the quantity of the similar block is less than or equal to second threshold.
Optionally, in the embodiment of the present application, which is further used for:
When the quantity of the expectation block searched reaches the second threshold, using the expectation block as the similar block, and stop
The search of the similar block, wherein the value for characterizing the parameter of the similarity of the current block and the expectation block exceeds first threshold.
Optionally, in the embodiment of the present application, which is further used for:
In all pixels of the reconstruction pixel, when the quantity of the expectation block searched is greater than the second threshold, according to phase
Like the mode of degree from high to low, from the expectation block, quantification is equal to the similar block of the second threshold, wherein is used for table
The value of the parameter of the current block and the similarity of the expectation block is levied beyond first threshold.
Optionally, in the embodiment of the present application, which determined based at least one of following parameter:
The size of the current block, the bit-depth of video, the pixel of the current block and the horizontal ladder of the pixel of the current block
Degree, the vertical gradient of the pixel of the current block.
Optionally, in the embodiment of the present application, when characterizing the parameter of the similarity is the difference of cryptographic Hash,
The first threshold is determined based at least one of following parameter:
The pixel of the current block and, the horizontal gradient of the pixel of the current block, the vertical gradient of the pixel of the current block.
It optionally, in the embodiment of the present application, is error sum of squares SSD or absolute error characterizing the parameter of the similarity
When with SAD,
The first threshold is determined based at least one of following parameter: the size of the current block, the bit of video
Depth.
It optionally, in the embodiment of the present application, is mean absolute difference MAD, mean error characterizing the parameter of the similarity
When quadratic sum MSD or structural similarity index S SIM,
The first threshold is the bit-depth determination based on video.
Optionally, in the embodiment of the present application, characterize the parameter of similarity are as follows: the difference of cryptographic Hash, SSD, SAD, MAD,
MSD or SSIM.
Optionally, in the embodiment of the present application, which is realized by coding side;The equipment 600 further include:
Coding unit is encoded for determining the first threshold, and by the first threshold.
Optionally, in the embodiment of the present application, which is realized by decoding end;The equipment 600 further include:
Acquiring unit, for obtaining the first threshold in code stream.
Optionally, which may be implemented the operation of the filter in the above method 400, for sake of simplicity, herein no longer
It repeats.
It should be understood that the equipment for video processing of above-mentioned the embodiment of the present application can be chip, it specifically can be by electricity
Road realize, but the embodiment of the present application to concrete implementation form without limitation.
The embodiment of the present application also provides a kind of encoders, and the encoder is for realizing coding side in the embodiment of the present application
Function may include the module that coding side is used in the equipment for video processing of above-mentioned the embodiment of the present application.
The embodiment of the present application also provides a kind of decoders, and the decoder is for realizing decoding end in the embodiment of the present application
Function may include the module that decoding end is used in the equipment for video processing of above-mentioned the embodiment of the present application.
The embodiment of the present application also provides a kind of codec, which includes being used for for above-mentioned the embodiment of the present application
The equipment of video processing.
Figure 14 shows the schematic block diagram of the computer system 700 of the embodiment of the present application.
As shown in figure 14, which may include processor 710 and memory 720.
It should be understood that the computer system 700 can also include component usually included in other computer systems, example
Such as, input-output equipment, communication interface etc., the embodiment of the present application does not limit this.
Memory 720 is for storing computer executable instructions.
Memory 720 can be various memories, such as may include high-speed random access memory (Random
Access Memory, RAM), can also include non-labile memory (non-volatile memory), for example, at least one
A magnetic disk storage, the embodiment of the present application do not limit this.
Processor 710 executes the computer executable instructions for accessing the memory 720, to carry out this above-mentioned Shen
It please operation in the method for video processing of embodiment.
Processor 710 may include microprocessor, field programmable gate array (Field-Programmable Gate
Array, FPGA), central processing unit (Central Processing unit, CPU), graphics processor (Graphics
Processing Unit, GPU) etc., the embodiment of the present application does not limit this.
The use that can correspond to the embodiment of the present application for the equipment and computer system of video processing of the embodiment of the present application
In the executing subject of the method for video processing, and for the modules in the equipment and computer system of video processing
It states with other operation and/or functions respectively in order to realize the corresponding process of aforementioned each method, for sake of simplicity, no longer going to live in the household of one's in-laws on getting married herein
It states.
The embodiment of the present application also provides a kind of electronic equipment, which may include the various implementations of above-mentioned the application
The equipment or computer system for video processing of example.
The embodiment of the present application also provides a kind of computer storage medium, program generation is stored in the computer storage medium
Code, the program code can serve to indicate that the method for executing the loop filtering of above-mentioned the embodiment of the present application.
It should be understood that in the embodiment of the present application, term "and/or" is only a kind of incidence relation for describing affiliated partner,
Indicate may exist three kinds of relationships.For example, A and/or B, can indicate: individualism A exists simultaneously A and B, individualism B this
Three kinds of situations.In addition, character "/" herein, typicallys represent the relationship that forward-backward correlation object is a kind of "or".
Those of ordinary skill in the art may be aware that list described in conjunction with the examples disclosed in the embodiments of the present disclosure
Member and algorithm steps, can be realized with electronic hardware, computer software, or a combination of the two, in order to clearly demonstrate hardware
With the interchangeability of software, each exemplary composition and step are generally described according to function in the above description.This
A little functions are implemented in hardware or software actually, the specific application and design constraint depending on technical solution.Specially
Industry technical staff can use different methods to achieve the described function each specific application, but this realization is not
It is considered as beyond scope of the present application.
It is apparent to those skilled in the art that for convenience of description and succinctly, foregoing description is
The specific work process of system, device and unit, can refer to corresponding processes in the foregoing method embodiment, details are not described herein.
In several embodiments provided herein, it should be understood that disclosed systems, devices and methods, it can be with
It realizes by another way.For example, the apparatus embodiments described above are merely exemplary, for example, the unit
It divides, only a kind of logical function partition, there may be another division manner in actual implementation, such as multiple units or components
It can be combined or can be integrated into another system, or some features can be ignored or not executed.In addition, shown or beg for
Opinion mutual coupling, direct-coupling or communication connection can be through some interfaces, the INDIRECT COUPLING of device or unit
Or communication connection, it is also possible to electricity, mechanical or other form connections.
The unit as illustrated by the separation member may or may not be physically separated, aobvious as unit
The component shown may or may not be physical unit, it can and it is in one place, or may be distributed over multiple
In network unit.Some or all of unit therein can be selected to realize the embodiment of the present application scheme according to the actual needs
Purpose.
It, can also be in addition, each functional unit in each embodiment of the application can integrate in one processing unit
It is that each unit physically exists alone, is also possible to two or more units and is integrated in one unit.It is above-mentioned integrated
Unit both can take the form of hardware realization, can also realize in the form of software functional units.
If the integrated unit is realized in the form of SFU software functional unit and sells or use as independent product
When, it can store in a computer readable storage medium.Based on this understanding, the technical solution of the application is substantially
The all or part of the part that contributes to existing technology or the technical solution can be in the form of software products in other words
It embodies, which is stored in a storage medium, including some instructions are used so that a computer
Equipment (can be personal computer, server or the network equipment etc.) executes the complete of each embodiment the method for the application
Portion or part steps.And storage medium above-mentioned includes: USB flash disk, mobile hard disk, read-only memory (ROM, Read-Only
Memory), random access memory (RAM, Random Access Memory), magnetic or disk etc. are various can store journey
The medium of sequence code.
The above, the only specific embodiment of the application, but the protection scope of the application is not limited thereto, it is any
Those familiar with the art within the technical scope of the present application, can readily occur in various equivalent modifications or replace
It changes, these modifications or substitutions should all cover within the scope of protection of this application.Therefore, the protection scope of the application should be with right
It is required that protection scope subject to.
Claims (86)
1. a kind of method for video processing characterized by comprising
In at least one pixel set, at least one first similar block of current block is obtained, wherein the pixel set includes
Sparse reconstruction pixel, the current block include that at least one rebuilds pixel;
Based at least one described first similar block, structural array is constructed;
The structural array is decomposed;
According to the structural array of decomposition, obtains and rebuild structural array.
2. the method according to claim 1, wherein at least one described pixel set includes the first set of pixels
It closes;
It is described at least one pixel set, obtain at least one described first similar block, comprising:
Position based on the reconstruction pixel that the current block includes, determines first pixel set;
From first pixel set, first similar block is obtained.
3. according to the method described in claim 2, it is characterized in that, obtaining first phase from first pixel set
Like block, comprising:
According to the way of search from close to the current block to far from the current block, from first pixel set, obtain
First similar block.
4. according to the method in claim 2 or 3, which is characterized in that from first pixel set, obtain described first
Similar block, comprising:
When the quantity of the expectation block searched in first pixel set reaches second threshold, using the expectation block as institute
The first similar block is stated, and stops at the search for carrying out first similar block in first pixel set, wherein for characterizing
The value of the parameter of the similarity of the current block and the expectation block exceeds first threshold.
5. according to the method in claim 2 or 3, which is characterized in that from first pixel set, obtain described first
Similar block, comprising:
In all pixels of first pixel set, when the quantity of the expectation block searched is greater than second threshold, according to phase
Like the mode of degree from high to low, from the expectation block searched, quantification is equal to described the first of the second threshold
Similar block, wherein the value for characterizing the parameter of the similarity of the current block and the expectation block exceeds first threshold.
6. the method according to any one of claim 2 to 5, which is characterized in that at least one described pixel set includes
Second pixel set;
It is described at least one pixel set, obtain the first similar block, comprising:
According to the position for the reconstruction pixel that previous the first obtained similar block includes, the second pixel set is determined;
From second pixel set, first similar block is obtained again.
7. according to the method described in claim 6, it is characterized in that, obtaining described again from second pixel set
One similar block, comprising:
Based on from close to previous obtained first similar block to separate previous obtained first similar block
Way of search obtain first similar block again from second pixel set.
8. method according to claim 6 or 7, which is characterized in that from second pixel set, again described in acquisition
First similar block, comprising:
When the quantity of the expectation block searched in second pixel set reaches third threshold value, the expectation block is determined as
First similar block, and stop at the search that first similar block is carried out in second pixel set, wherein it is used for table
The value of the parameter of the similarity of the current block and the expectation block is levied beyond first threshold.
9. method according to claim 6 or 7, which is characterized in that from second pixel set, again described in acquisition
First similar block, comprising:
In all pixels of second pixel set, when the quantity of the expectation block searched is greater than third threshold value, according to phase
Like the mode of degree from high to low, from the expectation block searched, quantification is equal to described the first of the third threshold value
Similar block, wherein the value for characterizing the parameter of the similarity of the current block and the expectation block exceeds first threshold.
10. method according to any one of claims 6 to 9, which is characterized in that
From second pixel set, first similar block is obtained again, comprising: before in second pixel set
The block of similar block matching operation has been carried out, the matching operation of similar block is no longer carried out;Alternatively,
It does not include the block that similar block matching operation has been carried out in second pixel set.
11. method according to any one of claim 1 to 10, which is characterized in that the method also includes:
Based on template, the pixel set is determined.
12. according to the method for claim 11, which is characterized in that the reconstruction pixel in the template is collected as multiple dispersions
Image block, the size of each image block is greater than or equal to the size of the current block.
13. method according to claim 11 or 12, which is characterized in that the template includes for selecting first phase
Like multiple candidate similar blocks of block, the size of candidate's similar block is equal to the size of the current block.
14. according to the method for claim 13, which is characterized in that the template includes that the multiple groups from center to edge are candidate
Similar block, every group of candidate's similar block block surround annular, and for the circular phase to the central symmetry of the template, the candidate in group is similar
Block is uniformly arranged.
15. according to the method for claim 14, which is characterized in that the template include four groups of candidate's similar blocks, described four
The edge pixel at the center far from the template of the candidate similar block of group is respectively separated 1 picture relative to the center of the template
Element, 2 pixels, 4 pixels and 8 pixels.
16. method according to claim 14 or 15, which is characterized in that four groups of candidate's similar blocks are respectively provided with 4
Candidate similar block, 8 candidate similar blocks, 8 candidate similar blocks and 8 candidate similar blocks, wherein there are 4 candidate similar blocks
Center of one group of candidate's similar block apart from the template it is nearest.
17. method described in any one of 1 to 16 according to claim 1, which is characterized in that at least one described pixel set
In, different pixel sets is determined based on different templates.
18. the method according to any one of claim 2 to 17, which is characterized in that the method also includes:
Based on the position of each first similar block, pixel window is determined respectively;
In the pixel window, second similar block is obtained;
Described at least one first similar block based on described in, constructs structural array, comprising:
Based on first similar block and second similar block, the structural array is constructed.
19. according to the method for claim 18, which is characterized in that in the pixel window, determine the second similar block, wrap
It includes:
In the way of point by point scanning, second similar block is determined.
20. method described in 8 or 19 according to claim 1, which is characterized in that in the pixel window, obtain described second
Similar block, comprising:
The block of similar block matching operation is had been carried out in the pixel window, no longer carries out the matching operation of similar block;Alternatively,
It does not include the block that similar block matching operation has been carried out in described search window.
21. method described in any one of 8 to 20 according to claim 1, which is characterized in that it is described in the pixel window,
Obtain second similar block, comprising:
It is when the quantity of the expectation block searched in the pixel window reaches four threshold values, the expectation block searched is true
It is set to second similar block, and stops at the search for carrying out second similar block in the pixel window, wherein is used for table
The value of the parameter of the similarity of the current block and the expectation block is levied beyond first threshold.
22. method described in any one of 8 to 20 according to claim 1, which is characterized in that it is described in the pixel window,
Obtain second similar block, comprising:
In all pixels in the pixel window, when the quantity of the expectation block searched is greater than four threshold values, according to similar
The mode of degree from high to low, from the expectation block, quantification is equal to second similar block of the 4th threshold value,
In, the value of the parameter of the similarity for characterizing the current block and the expectation block is beyond first threshold.
23. according to claim 1 to method described in any one of 22, which is characterized in that for characterizing the current block and institute
The value of the parameter of the similarity of the similar block of current block is stated beyond first threshold.
24. according to the method for claim 23, which is characterized in that the first threshold be based in following parameter at least
A kind of determination:
The size of the current block, the bit-depth of video, the pixel of the current block and the level of the pixel of the current block
Gradient, the vertical gradient of the pixel of the current block.
25. according to the method for claim 24, which is characterized in that be the difference of cryptographic Hash in the parameter for characterizing the similarity
When value,
The first threshold is determined based at least one of following parameter:
The pixel of the current block and, the horizontal gradient of the pixel of the current block, the vertical gradient of the pixel of the current block.
26. according to the method for claim 24, which is characterized in that characterizing the parameter of the similarity be error sum of squares
SSD or absolute error and when SAD,
The first threshold is determined based at least one of following parameter: the size of the current block, the bit of video
Depth.
27. according to the method for claim 24, which is characterized in that characterizing the parameter of the similarity be mean absolute difference
MAD, mean error quadratic sum MSD or when structural similarity index S SIM,
The first threshold is the bit-depth determination based on video.
28. the method according to any one of claim 23 to 27, which is characterized in that the method is realized by coding side;
The method also includes:
The coding side determines the first threshold, and the first threshold is encoded.
29. the method according to any one of claim 23 to 28, which is characterized in that the method is realized by decoding end;
The method also includes:
The decoding end obtains the first threshold in code stream.
30. according to claim 1 to method described in any one of 29, which is characterized in that characterize the parameter of similarity are as follows: Hash
The difference of value, SSD, SAD, MAD, MSD or SSIM.
31. according to the method for claim 30, which is characterized in that the reconstruction pixel for obtaining the similar block includes:
Reconstruction pixel, the reconstruction pixel in the left side of the coding unit and the institute of the upside of coding unit belonging to the current block
State the reconstruction pixel of coding unit;Or,
The reconstruction pixel of the upside of the coding unit, the reconstruction pixel in the left side of the coding unit, the coding unit
Reconstruction pixel, the reconstruction pixel of the reconstruction pixel of the downside of the coding unit and the coding unit on right side;Or,
The reconstruction pixel of the coding unit.
32. according to the method for claim 31, which is characterized in that the reconstruction pixel of the upside of the coding unit it is vertical
Number of pixels of the number of pixels in direction less equal than the horizontal direction of the reconstruction pixel in the left side of the coding unit.
33. a kind of method for video processing characterized by comprising
From rebuilding in pixel, at least one similar block of current block is obtained, the current block includes that at least one rebuilds pixel,
In, the value of the parameter of the similarity for characterizing the current block and the similar block is beyond first threshold;
Based at least one described similar block, structural array is constructed;
The structural array is decomposed;
According to the structural array of decomposition, obtains and rebuild structural array.
34. according to the method for claim 33, which is characterized in that the quantity of the similar block is less than or equal to the second threshold
Value.
35. according to the method for claim 34, which is characterized in that it is described from rebuilding in pixel, obtain current block at least
One similar block, comprising:
When the quantity of the expectation block searched reaches the second threshold, using the expectation block as the similar block, and stop
The only search of the similar block, wherein the value for characterizing the current block and the parameter of the similarity of the expectation block exceeds
First threshold.
36. according to the method for claim 34, which is characterized in that it is described from rebuilding in pixel, obtain current block at least
One similar block, comprising:
In all pixels for rebuilding pixel, when the quantity of the expectation block searched is greater than the second threshold, according to phase
Like the mode of degree from high to low, from the expectation block, quantification is equal to the similar block of the second threshold, wherein
Value for characterizing the parameter of the similarity of the current block and the expectation block exceeds first threshold.
37. the method according to any one of claim 33 to 36, which is characterized in that the first threshold is based on following
What at least one of parameter determined:
The size of the current block, the bit-depth of video, the pixel of the current block and the level of the pixel of the current block
Gradient, the vertical gradient of the pixel of the current block.
38. according to the method for claim 37, which is characterized in that be the difference of cryptographic Hash in the parameter for characterizing the similarity
When value,
The first threshold is determined based at least one of following parameter:
The pixel of the current block and, the horizontal gradient of the pixel of the current block, the vertical gradient of the pixel of the current block.
39. according to the method for claim 37, which is characterized in that characterizing the parameter of the similarity be error sum of squares
SSD or absolute error and when SAD,
The first threshold is determined based at least one of following parameter: the size of the current block, the bit of video
Depth.
40. according to the method for claim 37, which is characterized in that characterizing the parameter of the similarity be mean absolute difference
MAD, mean error quadratic sum MSD or when structural similarity index S SIM,
The first threshold is the bit-depth determination based on video.
41. the method according to any one of claim 33 to 40, which is characterized in that characterize the parameter of similarity are as follows: breathe out
The difference of uncommon value, SSD, SAD, MAD, MSD or SSIM.
42. the method according to any one of claim 33 to 41, which is characterized in that the method is realized by coding side;
The method also includes:
The coding side determines the first threshold, and the first threshold is encoded.
43. the method according to any one of claim 33 to 41, which is characterized in that the method is realized by decoding end;
The method also includes:
The decoding end obtains the first threshold in code stream.
44. a kind of equipment for video processing characterized by comprising
Similar block acquiring unit, for obtaining at least one first similar block of current block at least one pixel set,
In, the pixel set includes sparse reconstruction pixel, and the current block includes that at least one rebuilds pixel;
Construction unit, for constructing structural array based at least one described first similar block;
Decomposition unit, for being decomposed to the structural array;
Reconstruction unit obtains for the structural array according to decomposition and rebuilds structural array.
45. equipment according to claim 44, which is characterized in that at least one described pixel set includes the first set of pixels
It closes;
The similar block acquiring unit is specifically used for:
Position based on the reconstruction pixel that the current block includes, determines first pixel set;
From first pixel set, first similar block is obtained.
46. equipment according to claim 45, which is characterized in that the similar block acquiring unit is specifically used for:
According to the way of search from close to the current block to far from the current block, from first pixel set, obtain
First similar block.
47. the equipment according to claim 45 or 46, which is characterized in that the similar block acquiring unit is specifically used for:
When the quantity of the expectation block searched in first pixel set reaches second threshold, using the expectation block as institute
The first similar block is stated, and stops at the search for carrying out first similar block in first pixel set, wherein for characterizing
The value of the parameter of the similarity of the current block and the expectation block exceeds first threshold.
48. the equipment according to claim 45 or 46, which is characterized in that the similar block acquiring unit is specifically used for:
In all pixels of first pixel set, when the quantity of the expectation block searched is greater than second threshold, according to phase
Like the mode of degree from high to low, from the expectation block searched, quantification is equal to described the first of the second threshold
Similar block, wherein the value for characterizing the parameter of the similarity of the current block and the expectation block exceeds first threshold.
49. the equipment according to any one of claim 45 to 48, which is characterized in that at least one described pixel set packet
Include the second pixel set;
The similar block acquiring unit is specifically used for:
According to the position for the reconstruction pixel that previous the first obtained similar block includes, the second pixel set is determined;
From second pixel set, first similar block is obtained again.
50. equipment according to claim 49, which is characterized in that the similar block acquiring unit is specifically used for:
Based on from close to previous obtained first similar block to separate previous obtained first similar block
Way of search obtain first similar block again from second pixel set.
51. the equipment according to claim 49 or 50, which is characterized in that the similar block acquiring unit is specifically used for:
When the quantity of the expectation block searched in second pixel set reaches third threshold value, the expectation block is determined as
First similar block, and stop at the search that first similar block is carried out in second pixel set, wherein it is used for table
The value of the parameter of the similarity of the current block and the expectation block is levied beyond first threshold.
52. the equipment according to claim 49 or 50, which is characterized in that the similar block acquiring unit is specifically used for:
In all pixels of second pixel set, when the quantity of the expectation block searched is greater than third threshold value, according to phase
Like the mode of degree from high to low, from the expectation block searched, quantification is equal to described the first of the third threshold value
Similar block, wherein the value for characterizing the parameter of the similarity of the current block and the expectation block exceeds first threshold.
53. the equipment according to any one of claim 49 to 52, which is characterized in that
The similar block acquiring unit is specifically used for: similar block matching operation having been carried out before in second pixel set
Block, no longer carry out similar block matching operation;Alternatively,
It does not include the block that similar block matching operation has been carried out in second pixel set.
54. the equipment according to any one of claim 44 to 53, which is characterized in that the similar block acquiring unit is into one
Step is used for:
Based on template, the pixel set is determined.
55. equipment according to claim 54, which is characterized in that the reconstruction pixel in the template is collected as multiple dispersions
Image block, the size of each image block is greater than or equal to the size of the current block.
56. the equipment according to claim 54 or 55, which is characterized in that the template includes for selecting first phase
Like multiple candidate similar blocks of block, the size of candidate's similar block is equal to the size of the current block.
57. equipment according to claim 56, which is characterized in that the template includes that the multiple groups from center to edge are candidate
Similar block, every group of candidate's similar block block surround annular, and for the circular phase to the central symmetry of the template, the candidate in group is similar
Block is uniformly arranged.
58. equipment according to claim 57, which is characterized in that the template include four groups of candidate's similar blocks, described four
The edge pixel at the center far from the template of the candidate similar block of group is respectively separated 1 picture relative to the center of the template
Element, 2 pixels, 4 pixels and 8 pixels.
59. the equipment according to claim 57 or 58, which is characterized in that four groups of candidate's similar blocks are respectively provided with 4
Candidate similar block, 8 candidate similar blocks, 8 candidate similar blocks and 8 candidate similar blocks, wherein there are 4 candidate similar blocks
Center of one group of candidate's similar block apart from the template it is nearest.
60. the equipment according to any one of claim 54 to 59, which is characterized in that at least one described pixel set
In, different pixel sets is determined based on different templates.
61. the equipment according to any one of claim 45 to 60, which is characterized in that the similar block acquiring unit is into one
Step is used for:
Based on the position of each first similar block, pixel window is determined respectively;
In the pixel window, second similar block is obtained;
The construction unit is specifically used for:
Based on first similar block and second similar block, the structural array is constructed.
62. equipment according to claim 61, which is characterized in that the similar block acquiring unit is specifically used for:
In the way of point by point scanning, second similar block is determined.
63. the equipment according to claim 61 or 62, which is characterized in that the similar block acquiring unit is specifically used for: institute
The block for having been carried out similar block matching operation in pixel window is stated, the matching operation of similar block is no longer carried out;Alternatively,
It does not include the block that similar block matching operation has been carried out in described search window.
64. the equipment according to any one of claim 61 to 63, which is characterized in that the similar block acquiring unit is specific
For:
It is when the quantity of the expectation block searched in the pixel window reaches four threshold values, the expectation block searched is true
It is set to second similar block, and stops at the search for carrying out second similar block in the pixel window, wherein is used for table
The value of the parameter of the similarity of the current block and the expectation block is levied beyond first threshold.
65. the equipment according to any one of claim 61 to 63, which is characterized in that the similar block acquiring unit is specific
For:
In all pixels in the pixel window, when the quantity of the expectation block searched is greater than four threshold values, according to similar
The mode of degree from high to low, from the expectation block, quantification is equal to second similar block of the 4th threshold value,
In, the value of the parameter of the similarity for characterizing the current block and the expectation block is beyond first threshold.
66. the equipment according to any one of claim 44 to 65, which is characterized in that for characterizing the current block and institute
The value of the parameter of the similarity of the similar block of current block is stated beyond first threshold.
67. equipment according to claim 66, which is characterized in that the first threshold be based in following parameter at least
A kind of determination:
The size of the current block, the bit-depth of video, the pixel of the current block and the level of the pixel of the current block
Gradient, the vertical gradient of the pixel of the current block.
68. equipment according to claim 67, which is characterized in that be the difference of cryptographic Hash in the parameter for characterizing the similarity
When value,
The first threshold is determined based at least one of following parameter:
The pixel of the current block and, the horizontal gradient of the pixel of the current block, the vertical gradient of the pixel of the current block.
69. equipment according to claim 67, which is characterized in that characterizing the parameter of the similarity be error sum of squares
SSD or absolute error and when SAD,
The first threshold is determined based at least one of following parameter: the size of the current block, the bit of video
Depth.
70. equipment according to claim 67, which is characterized in that characterizing the parameter of the similarity be mean absolute difference
MAD, mean error quadratic sum MSD or when structural similarity index S SIM,
The first threshold is the bit-depth determination based on video.
71. the equipment according to any one of claim 66 to 70, which is characterized in that the equipment is realized by coding side;
The equipment further include:
Coding unit determines the first threshold, and the first threshold is encoded.
72. the equipment according to any one of claim 66 to 71, which is characterized in that the equipment is realized by decoding end;
The equipment further include:
Acquiring unit, for obtaining the first threshold in code stream.
73. the equipment according to any one of claim 44 to 72, which is characterized in that characterize the parameter of similarity are as follows: breathe out
The difference of uncommon value, SSD, SAD, MAD, MSD or SSIM.
74. the equipment according to any one of claim 44 to 73, which is characterized in that for obtaining the weight of the similar block
Building pixel includes:
Reconstruction pixel, the reconstruction pixel in the left side of the coding unit and the institute of the upside of coding unit belonging to the current block
State the reconstruction pixel of coding unit;Or,
The reconstruction pixel of the upside of the coding unit, the reconstruction pixel in the left side of the coding unit, the coding unit
Reconstruction pixel, the reconstruction pixel of the reconstruction pixel of the downside of the coding unit and the coding unit on right side;Or,
The reconstruction pixel of the coding unit.
75. equipment according to claim 74, which is characterized in that the reconstruction pixel of the upside of the coding unit it is vertical
Number of pixels of the number of pixels in direction less equal than the horizontal direction of the reconstruction pixel in the left side of the coding unit.
76. a kind of equipment for video processing characterized by comprising
Similar block acquiring unit, for obtaining at least one similar block of current block, the current block includes from rebuilding in pixel
At least one rebuilds pixel, wherein for characterize the similarity of the current block and the similar block parameter value beyond the
One threshold value;
Construction unit, for constructing structural array based at least one described similar block;
Decomposition unit, for being decomposed to the structural array;
Reconstruction unit obtains for the structural array according to decomposition and rebuilds structural array.
77. the equipment according to claim 76, which is characterized in that the quantity of the similar block is less than or equal to the second threshold
Value.
78. the equipment according to claim 77, which is characterized in that the similar block acquiring unit is further used for:
When the quantity of the expectation block searched reaches the second threshold, using the expectation block as the similar block, and stop
The only search of the similar block, wherein the value for characterizing the current block and the parameter of the similarity of the expectation block exceeds
First threshold.
79. the equipment according to claim 77, which is characterized in that the similar block acquiring unit is further used for:
In all pixels for rebuilding pixel, when the quantity of the expectation block searched is greater than the second threshold, according to phase
Like the mode of degree from high to low, from the expectation block, quantification is equal to the similar block of the second threshold, wherein
Value for characterizing the parameter of the similarity of the current block and the expectation block exceeds first threshold.
80. the equipment according to any one of claim 76 to 79, which is characterized in that the first threshold is based on following
What at least one of parameter determined:
The size of the current block, the bit-depth of video, the pixel of the current block and the level of the pixel of the current block
Gradient, the vertical gradient of the pixel of the current block.
81. the equipment according to claim 80, which is characterized in that be the difference of cryptographic Hash in the parameter for characterizing the similarity
When value,
The first threshold is determined based at least one of following parameter:
The pixel of the current block and, the horizontal gradient of the pixel of the current block, the vertical gradient of the pixel of the current block.
82. the equipment according to claim 80, which is characterized in that characterizing the parameter of the similarity be error sum of squares
SSD or absolute error and when SAD,
The first threshold is determined based at least one of following parameter: the size of the current block, the bit of video
Depth.
83. the equipment according to claim 80, which is characterized in that characterizing the parameter of the similarity be mean absolute difference
MAD, mean error quadratic sum MSD or when structural similarity index S SIM,
The first threshold is the bit-depth determination based on video.
84. the equipment according to any one of claim 76 to 83, which is characterized in that characterize the parameter of similarity are as follows: breathe out
The difference of uncommon value, SSD, SAD, MAD, MSD or SSIM.
85. the equipment according to any one of claim 76 to 84, which is characterized in that the equipment is realized by coding side;
The equipment further include:
Transmission unit is encoded for determining the first threshold, and by the first threshold.
86. the equipment according to any one of claim 76 to 84, which is characterized in that the equipment is realized by decoding end;
The equipment further include:
Receiving unit, for obtaining the first threshold in code stream.
Applications Claiming Priority (1)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
PCT/CN2018/081653 WO2019191891A1 (en) | 2018-04-02 | 2018-04-02 | Method and device for video processing |
Publications (1)
Publication Number | Publication Date |
---|---|
CN110352599A true CN110352599A (en) | 2019-10-18 |
Family
ID=68099773
Family Applications (2)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201880012506.0A Pending CN110352599A (en) | 2018-04-02 | 2018-04-02 | Method for video processing and equipment |
CN201880012519.8A Expired - Fee Related CN110383837B (en) | 2018-04-02 | 2018-06-01 | Method and apparatus for video processing |
Family Applications After (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
CN201880012519.8A Expired - Fee Related CN110383837B (en) | 2018-04-02 | 2018-06-01 | Method and apparatus for video processing |
Country Status (2)
Country | Link |
---|---|
CN (2) | CN110352599A (en) |
WO (2) | WO2019191891A1 (en) |
Families Citing this family (4)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN111914890B (en) * | 2020-06-23 | 2024-05-14 | 北京迈格威科技有限公司 | Image block matching method between images, image registration method and product |
CN112804528B (en) * | 2021-02-05 | 2022-10-28 | 北京字节跳动网络技术有限公司 | Screen content processing method, device and equipment |
CN113382246B (en) * | 2021-04-20 | 2024-03-01 | 浙江大华技术股份有限公司 | Encoding method, encoding device, electronic device and computer readable storage medium |
CN118175311A (en) * | 2022-12-09 | 2024-06-11 | 腾讯科技(深圳)有限公司 | Video data processing method, device, storage medium and equipment |
Citations (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20060002613A1 (en) * | 2004-06-30 | 2006-01-05 | Comet Video Technology | Method of data compression including compression of video data |
US20090067502A1 (en) * | 2005-04-15 | 2009-03-12 | Byeong Moon Jeon | Method for Scalably Encoding and Decoding Video Signal |
CN101833667A (en) * | 2010-04-21 | 2010-09-15 | 中国科学院半导体研究所 | Pattern recognition classification method expressed based on grouping sparsity |
CN101895297A (en) * | 2010-07-30 | 2010-11-24 | 哈尔滨工业大学 | Compressed sensing-oriented block-sparse signal reconfiguring method |
CN102164282A (en) * | 2011-04-29 | 2011-08-24 | 中南民族大学 | Coefficient-random-permutation-based compressive sensing method and system for image coding |
US20130051468A1 (en) * | 2010-03-12 | 2013-02-28 | Tsinghua University | Method and device for video predictive encoding |
CN105096351A (en) * | 2014-05-19 | 2015-11-25 | 北京大学 | Method and device for processing image de-blocking effect |
CN105513026A (en) * | 2015-12-17 | 2016-04-20 | 浙江大学 | Compressed sensing reconstruction method based on image nonlocal similarity |
CN105763881A (en) * | 2016-02-23 | 2016-07-13 | 北京大学 | Video coding image filtering method based on image nonlocal structural similarity characteristic |
CN105791877A (en) * | 2016-03-15 | 2016-07-20 | 北京大学 | Adaptive loop filter method in video coding and decoding |
CN106327422A (en) * | 2015-07-01 | 2017-01-11 | 北京大学 | Image stylized reconstruction method and device |
US20170202532A1 (en) * | 2014-07-30 | 2017-07-20 | Hitachi, Ltd. | Data processing method, data processing device, and x-ray ct apparatus |
CN107292852A (en) * | 2017-07-19 | 2017-10-24 | 南京邮电大学 | A kind of Image denoising algorithm theoretical based on low-rank |
Family Cites Families (3)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
CN103020918B (en) * | 2013-01-09 | 2015-05-20 | 西安电子科技大学 | Shape-adaptive neighborhood mean value based non-local mean value denoising method |
CN103473740B (en) * | 2013-08-31 | 2016-05-25 | 西安电子科技大学 | Based on the non local denoising method of rarefaction representation and low-rank double constraints |
US9576346B2 (en) * | 2015-03-24 | 2017-02-21 | Intel Corporation | Non-local means image denoising with an adaptive directional spatial filter |
-
2018
- 2018-04-02 WO PCT/CN2018/081653 patent/WO2019191891A1/en active Application Filing
- 2018-04-02 CN CN201880012506.0A patent/CN110352599A/en active Pending
- 2018-06-01 CN CN201880012519.8A patent/CN110383837B/en not_active Expired - Fee Related
- 2018-06-01 WO PCT/CN2018/089669 patent/WO2019192071A1/en active Application Filing
Patent Citations (13)
Publication number | Priority date | Publication date | Assignee | Title |
---|---|---|---|---|
US20060002613A1 (en) * | 2004-06-30 | 2006-01-05 | Comet Video Technology | Method of data compression including compression of video data |
US20090067502A1 (en) * | 2005-04-15 | 2009-03-12 | Byeong Moon Jeon | Method for Scalably Encoding and Decoding Video Signal |
US20130051468A1 (en) * | 2010-03-12 | 2013-02-28 | Tsinghua University | Method and device for video predictive encoding |
CN101833667A (en) * | 2010-04-21 | 2010-09-15 | 中国科学院半导体研究所 | Pattern recognition classification method expressed based on grouping sparsity |
CN101895297A (en) * | 2010-07-30 | 2010-11-24 | 哈尔滨工业大学 | Compressed sensing-oriented block-sparse signal reconfiguring method |
CN102164282A (en) * | 2011-04-29 | 2011-08-24 | 中南民族大学 | Coefficient-random-permutation-based compressive sensing method and system for image coding |
CN105096351A (en) * | 2014-05-19 | 2015-11-25 | 北京大学 | Method and device for processing image de-blocking effect |
US20170202532A1 (en) * | 2014-07-30 | 2017-07-20 | Hitachi, Ltd. | Data processing method, data processing device, and x-ray ct apparatus |
CN106327422A (en) * | 2015-07-01 | 2017-01-11 | 北京大学 | Image stylized reconstruction method and device |
CN105513026A (en) * | 2015-12-17 | 2016-04-20 | 浙江大学 | Compressed sensing reconstruction method based on image nonlocal similarity |
CN105763881A (en) * | 2016-02-23 | 2016-07-13 | 北京大学 | Video coding image filtering method based on image nonlocal structural similarity characteristic |
CN105791877A (en) * | 2016-03-15 | 2016-07-20 | 北京大学 | Adaptive loop filter method in video coding and decoding |
CN107292852A (en) * | 2017-07-19 | 2017-10-24 | 南京邮电大学 | A kind of Image denoising algorithm theoretical based on low-rank |
Non-Patent Citations (4)
Title |
---|
XIANGUO ZHANG,ET AL.: "Optimizing the Hierarchical Prediction and Coding in HEVC for Surveillance and Conference Videos With Background Modeling", 《 IEEE TRANSACTIONS ON IMAGE PROCESSING ( VOLUME: 23, ISSUE: 10, OCT. 2014)》 * |
XINFENG ZHANG,ET AL.: "High-Efficiency Image Coding via Near-Optimal Filtering", 《 IEEE SIGNAL PROCESSING LETTERS ( VOLUME: 24, ISSUE: 9, SEPT. 2017)》 * |
XINFENG ZHANG,ET AL.: "Low-Rank-Based Nonlocal Adaptive Loop Filter for High-Efficiency Video Compression", 《 IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY ( VOLUME: 27, ISSUE: 10, OCT. 2017)》 * |
马思伟.: "AVS视频编码标准技术回顾及最新进展", 《计算机研究与发展》 * |
Also Published As
Publication number | Publication date |
---|---|
WO2019191891A1 (en) | 2019-10-10 |
CN110383837B (en) | 2021-10-22 |
WO2019192071A1 (en) | 2019-10-10 |
CN110383837A (en) | 2019-10-25 |
Similar Documents
Publication | Publication Date | Title |
---|---|---|
CN103797800B (en) | It derives reference model value and coding and decoding represents the information of prediction mode | |
US10003792B2 (en) | Video encoder for images | |
CN104704827B (en) | Content-adaptive transform decoding for next-generation video | |
CN105430400B (en) | Moving image decoding apparatus and dynamic image decoding method | |
JP6659586B2 (en) | Image encoding / decoding method and apparatus | |
CN104967850B (en) | The method and apparatus that image is coded and decoded by using big converter unit | |
CN108605143A (en) | The method and apparatus of non local adaptive in-loop filter in Video coding | |
CN104255033B (en) | Reduced look-up-table for LM mode computations | |
CN110352599A (en) | Method for video processing and equipment | |
CN107925763A (en) | The transcoding, coding transform method and apparatus of the selection of block level transforming and implicit signaling in Multi-level segmentation | |
CN104704826B (en) | Two steps quantify and coding method and device | |
CN103081467A (en) | Filter description signaling for multi-filter adaptive filtering | |
CN107113438A (en) | Intra-frame encoding mode | |
CN108028945A (en) | The apparatus and method of conversion are performed by using singleton coefficient update | |
CN110073663A (en) | Use the transformation coefficient code of rank figure | |
KR20220045045A (en) | Matrix Weighted Intra Prediction of Video Signals | |
CN110383695B (en) | Method and apparatus for encoding and decoding digital image or video stream | |
CN109891886A (en) | The method for video coding and device divided using any type of piece | |
CN107005691A (en) | The method and apparatus for bringing and being encoded/decoded to vision signal using becoming derived from artwork plate | |
CN109845256A (en) | Video encoding method/device, image decoding method/device and the recording medium for preserving bit stream | |
CN107667532A (en) | Conversion for non-baseband signal code selects | |
CN105794208B (en) | Coding and decoding image method, coding and decoding vision facilities and corresponding computer readable medium | |
CN107113426A (en) | The method and apparatus that the conversion based on figure is performed using broad sense graphic parameter | |
CN104937940A (en) | Preserving rounding errors in video coding | |
CN109996083A (en) | Intra-frame prediction method and device |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
PB01 | Publication | ||
PB01 | Publication | ||
SE01 | Entry into force of request for substantive examination | ||
SE01 | Entry into force of request for substantive examination | ||
AD01 | Patent right deemed abandoned |
Effective date of abandoning: 20230228 |
|
AD01 | Patent right deemed abandoned |