CN107396112A - A kind of coding method and device, computer installation, readable storage medium storing program for executing - Google Patents
A kind of coding method and device, computer installation, readable storage medium storing program for executing Download PDFInfo
- Publication number
- CN107396112A CN107396112A CN201710648582.8A CN201710648582A CN107396112A CN 107396112 A CN107396112 A CN 107396112A CN 201710648582 A CN201710648582 A CN 201710648582A CN 107396112 A CN107396112 A CN 107396112A
- Authority
- CN
- China
- Prior art keywords
- picture block
- block
- picture
- history
- pixel
- 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.)
- Granted
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
- 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/172—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 picture, frame or field
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/102—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or selection affected or controlled by the adaptive coding
- H04N19/103—Selection of coding mode or of prediction mode
- H04N19/105—Selection of the reference unit for prediction within a chosen coding or prediction mode, e.g. adaptive choice of position and number of pixels used for prediction
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/134—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the element, parameter or criterion affecting or controlling the adaptive coding
- H04N19/146—Data rate or code amount at the encoder output
-
- 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/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
-
- 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)
Abstract
The embodiment of the invention discloses a kind of coding method and device, computer installation, readable storage medium storing program for executing, for improving the compression ratio of encoding video content.Present invention method includes：Current frame image is divided into the first picture block of multiple formed objects and non-overlapping copies；Determine that with the pixel matching degree highest second picture block of the first picture block be prediction block in history picture block, history picture block is to be divided to obtain according to the size of the first picture block by history two field picture；The first picture block is encoded according to prediction block.
Description
Technical field
The present invention relates to Internet technical field, more particularly to a kind of coding method and device, computer installation, readable deposit
Storage media.
Background technology
With cloud computing and the rise of virtualization desktop, screen content coding just receives significant attention.It is how efficiently right
Screen content is encoded to obtain high compression ratio and good image quality is technology that each virtualization manufacturer focuses on.
Existing screen content coding mainly has the method based on caching and based on Video coding.Wherein, based on caching
Method can only search the history picture matched completely, can not be found if picture has and a little changed, it is difficult to ensure compression ratio.Base
The correlation of interframe is then taken full advantage of to improve compression ratio in the method for Video coding, but reference frame number is limited, contained
Bulk redundancy, and coding time is almost linearly increasing with reference frame number, and this causes inter prediction to be difficult to grow
The search of history, screen content is compressed not abundant enough.
The content of the invention
The embodiments of the invention provide a kind of coding method and device, computer installation, readable storage medium storing program for executing, for improving
The compression ratio of encoding video content.
In view of this, first aspect present invention provides a kind of coding method, it may include：
Current frame image is divided into the first picture block of multiple formed objects and non-overlapping copies；
Determine that with the pixel matching degree highest second picture block of the first picture block be prediction block, is gone through in history picture block
History picture block is to be divided to obtain according to the size of the first picture block by history two field picture；
The first picture block is encoded according to prediction block.
Further, determination and the pixel matching degree highest second picture block of the first picture block are in history picture block
Prediction block includes：
Utilize the first cryptographic Hash for perceiving hash algorithm and determining the first picture block；
Second picture block corresponding with first Hash values match degree the second cryptographic Hash of highest is determined in history cryptographic Hash
For prediction block, history cryptographic Hash is history picture block to be calculated using perceiving hash algorithm.
Further, corresponding with first Hash values match degree the second cryptographic Hash of highest the is determined in history picture block
Two picture blocks include for prediction block：
Method is searched using arest neighbors to determine in history cryptographic Hash and first Hash values match degree the second cryptographic Hash of highest
Corresponding second picture block is prediction block.
Further, determination and the pixel matching degree highest second picture block of the first picture block are in history picture block
Prediction block includes：
Determine the pixel matching degree of history picture block and the first picture block；
Pixel matching degree is ranked up according to principle from high to low, and determines that sequence is most forward in history picture block
Pixel matching degree corresponding to multiple Target Photo blocks be second picture block；
It is determined that the encoding amount encoded according to second picture block to the first picture block；
Determine that the minimum picture block of encoding amount is prediction block in second picture block.
Further, when multiple Target Photo blocks belong to different history two field pictures, it is determined that according to second picture block to
The encoding amount that one picture block is encoded includes：
Determine the distance of the history two field picture and current frame image belonging to second picture block；
Determine that the minimum picture block of encoding amount includes for prediction block in second picture block：
It is prediction block that picture block corresponding to closest history two field picture is determined in second picture block.
Further, when multiple Target Photo blocks belong to same history two field picture, it is determined that according to second picture block to
The encoding amount that one picture block is encoded includes：
Determine first pixel-shift amount of the second picture block relative to the first picture block；
The difference of the first pixel-shift amount and the second pixel-shift amount is determined, the second pixel-shift amount is the first picture block
A upper coded picture block relative to the prediction block of coded picture block pixel-shift amount；
Determine that the minimum picture block of encoding amount includes for prediction block in second picture block：
Determine that picture block corresponding to the first minimum pixel-shift amount of difference is prediction block in second picture block.
Further, using perceiving after hash algorithm determines the first cryptographic Hash of the first picture block, method also includes：
Store the first picture block and the first cryptographic Hash.
Second aspect of the present invention provides a kind of code device, it may include：
Division unit, for current frame image to be divided into the first picture block of multiple formed objects and non-overlapping copies；
First determining unit, for determining the pixel matching degree highest second with the first picture block in history picture block
Picture block is prediction block, and second picture block is to be divided to obtain according to the size of the first picture block by history two field picture；
Coding unit, for being encoded according to prediction block to the first picture block.
Further, the first determining unit, it is specifically used for：
Utilize the first cryptographic Hash for perceiving hash algorithm and determining the first picture block；
Second picture block corresponding with first Hash values match degree the second cryptographic Hash of highest is determined in history cryptographic Hash
For prediction block, history cryptographic Hash is history picture block to be calculated using perceiving hash algorithm.
Further, the first determining unit, it is specifically used for：
Method is searched using arest neighbors to determine in history cryptographic Hash and first Hash values match degree the second cryptographic Hash of highest
Corresponding second picture block is prediction block.
Further, the first determining unit, it is specifically used for：
Determine the pixel matching degree of history picture block and the first picture block；
Pixel matching degree is ranked up according to principle from high to low, and determines that sequence is most forward in history picture block
Pixel matching degree corresponding to multiple Target Photo blocks be second picture block；
It is determined that the encoding amount encoded according to second picture block to the first picture block；
Determine that the minimum picture block of encoding amount is prediction block in second picture block.
Further, when multiple Target Photo blocks belong to different history two field pictures, the first determining unit, it is specifically used for：
Determine the distance of the history two field picture and current frame image belonging to second picture block；
It is prediction block that picture block corresponding to closest history two field picture is determined in second picture block.
Further, when multiple Target Photo blocks belong to same history two field picture, the first determining unit, it is specifically used for：
Determine first pixel-shift amount of the second picture block relative to the first picture block；
The difference of the first pixel-shift amount and the second pixel-shift amount is determined, the second pixel-shift amount is the first picture block
A upper coded picture block relative to the prediction block of coded picture block pixel-shift amount；
Determine that picture block corresponding to the first minimum pixel-shift amount of difference is prediction block in second picture block.
Further, device also includes：
Memory cell, for storing the first picture block and the first cryptographic Hash.
Third aspect present invention provides a kind of computer installation, and computer installation includes processor, and processor is used to perform
During the computer program stored in memory, following steps are realized：
Current frame image is divided into the first picture block of multiple formed objects and non-overlapping copies；
Determine that with the pixel matching degree highest second picture block of the first picture block be prediction block, is gone through in history picture block
History picture block is to be divided to obtain according to the size of the first picture block by history two field picture；
The first picture block is encoded according to prediction block.
Fourth aspect present invention provides a kind of computer-readable recording medium, is stored thereon with computer program, computer
When program is executed by processor, processor, for performing following steps：
Current frame image is divided into the first picture block of multiple formed objects and non-overlapping copies；
Determine that with the pixel matching degree highest second picture block of the first picture block be prediction block, is gone through in history picture block
History picture block is to be divided to obtain according to the size of the first picture block by history two field picture；
The first picture block is encoded according to prediction block.
As can be seen from the above technical solutions, the embodiment of the present invention has advantages below：
The invention provides a kind of coding method, in this method, current frame image can be divided into multiple formed objects and
First picture block of non-overlapping copies, history two field picture can be divided according to the size of the first picture block, and the first picture block can
To carry out pixel matching in the history picture block that is divided in history two field picture, to be searched and the first picture block in history picture block
Pixel matching degree highest second picture block, and the first picture block can be compiled using second picture block as prediction block
Code.For compared with the prior art, the first picture block of the invention need not be sought in the history picture block that history two field picture divides
The picture block matched completely is found as prediction block, it is possible thereby to ensure compression ratio, secondly, it is pre- to do interframe using pixel matching
Survey, substituted for traditional motion estimation process, be advantageous to store relatively large number of history two field picture, to improve the standard of inter prediction
True rate.
Brief description of the drawings
Fig. 1 is coding method one embodiment schematic diagram in the embodiment of the present invention；
Fig. 2 is the division schematic diagram of current frame image in the embodiment of the present invention；
Fig. 3 is the division schematic diagram of history two field picture in the embodiment of the present invention；
Fig. 4 is another embodiment schematic diagram of coding method in the embodiment of the present invention；
Fig. 5 is another embodiment schematic diagram of coding method in the embodiment of the present invention；
Fig. 6 is code device one embodiment schematic diagram in the embodiment of the present invention；
Fig. 7 is another embodiment schematic diagram of code device in the embodiment of the present invention.
Embodiment
The embodiments of the invention provide a kind of coding method and device, computer installation, readable storage medium storing program for executing, for improving
The compression ratio of encoding video content.
In order that those skilled in the art more fully understand the present invention program, below to the technology in the embodiment of the present invention
Scheme is clearly and completely described, it is clear that and described embodiment is only the embodiment of a present invention part, rather than
Whole embodiments.Based on the embodiment in the present invention, those of ordinary skill in the art are not making creative work premise
Lower obtained every other embodiment, should all belong to the scope of protection of the invention.
Term " first ", " second ", " the 3rd " in description and claims of this specification and above-mentioned accompanying drawing, "
The (if present)s such as four " are for distinguishing similar object, without for describing specific order or precedence.It should manage
The data that solution so uses can exchange in the appropriate case, so that the embodiments described herein can be with except illustrating herein
Or the order beyond the content of description is implemented.In addition, term " comprising " and " having " and their any deformation, it is intended that
Cover it is non-exclusive include, be not necessarily limited to clearly for example, containing the process of series of steps or unit, method, product or equipment
Those steps or unit listed to Chu, but may include not list clearly or for these processes, method, product or
The intrinsic other steps of equipment or unit.
For ease of understanding, the idiographic flow in the embodiment of the present invention is described below, referring to Fig. 1, the present invention is real
Applying coding method one embodiment in example includes：
The 101st, current frame image is divided into the first picture block of multiple formed objects and non-overlapping copies；
In the present embodiment, screen content refers to the image/video generated by electronic equipment, such as caricature, 3D game, capture
Computer screen or video etc. for thering is word to cover, the screen content is clean, muting.Service end is in by screen
Appearance is sent to before client, and screen content can be encoded, to reduce the flow needed for screen content transmission.In screen
Appearance includes multiple image, when screen content is encoded to compress, can carry out phase to each two field picture of screen content
The coding answered.Thus, service end, can be by current frame image after the current frame image for the screen content for needing to compress is got
It is divided into the first picture block of multiple formed objects and non-overlapping copies.
For example, such as Fig. 2, the Pixel Dimensions of current frame image are 4 × 4, can be by current frame image according to presetted pixel chi
Little progress row divides, such as by current frame image be divided into 2 × 2 sizes 4 Pixel Dimensions are identical and the first picture of non-overlapping copies
Block, example, for mark corresponding to each picture block positioned at the center of picture block, mark is respectively 1,2,3,4.Need to illustrate
, the size of the first picture block in the present embodiment can also be other Pixel Dimensions, and the present embodiment is by way of example only.
102nd, determine that with the pixel matching degree highest second picture block of the first picture block be prediction in history picture block
Block；
, can after current frame image to be divided into the first picture block of multiple formed objects and non-overlapping copies in the present embodiment
To determine the pixel matching degree highest second picture block with the first picture block as prediction block in history picture block.Wherein, go through
History picture block is to be divided to obtain according to the size of the first picture block by history two field picture.
Specifically, service end can store the history two field picture of predetermined number, such as 16 frames, with can be from multiframe historical frames figure
Search and the pixel matching degree highest second picture block of the first picture block as in, and can be by history two field picture according to the first figure
The size of tile is divided, following manner, is illustrated by taking a history two field picture as an example：
1st, as illustrated in fig. 2, it is assumed that the Pixel Dimensions of history two field picture are 4 × 4, then according to the size of the first picture block
(i.e. Pixel Dimensions), history two field picture can also be divided into 2 × 2 sizes 4 Pixel Dimensions are identical and the figure of non-overlapping copies
Tile；
2nd, the Pixel Dimensions for assuming history two field picture are 4 × 4, then according to size (the i.e. pixel chi of the first picture block
It is very little), history two field picture can be divided into multiple Pixel Dimensions are identical and partly overlapping picture block, then as shown in figure 3, false
If pixel-shift amount between neighbor map tile is 1, it is identical and partly overlap that history two field picture can be divided into 9 sizes
Picture block, i.e., according to from left to right, order from top to bottom, 9 picture blocks formed with the size of Pixel Dimensions 2 × 2, show
Example property, for mark corresponding to each picture block positioned at the center of picture block, mark is respectively 1,2,3,4,5,6,7,8,9.
In actual applications, in order to storing the information of more history two field picture to improve the accurate of inter prediction
Degree, obtains the second picture block that the first picture block most matches, it is preferred that the second way that can be as specified above is to history
Two field picture is divided, to enable the first picture block to be carried out from the history picture block more divided by history two field picture
Pixel matching, so as to find all picture blocks similar to the first picture block, to reach a kind of effect for damaging caching.
After history two field picture divide accordingly, history picture block that can be by the first picture block be divided by history two field picture
Pixel matching is carried out, and is determined in the history picture block divided by history two field picture with the pixel matching degree of the first picture block most
High second picture block.It follows that as long as this method carries out the highest of pixel from the picture block divided by history two field picture
Matching, without matching completely, there is some change to be used as prediction between second picture block and the first picture block
Block, then each first picture block that current frame image divides to obtain can be compressed under same compression algorithm, and
Be not such as prior art, in the case where there is the first picture block not matched completely with history picture block, this do not match completely
One picture block may be current so as to advantageously ensure that using other different from the compression algorithm of the first picture block matched completely
The compression ratio of two field picture.
103rd, the first picture block is encoded according to prediction block.
In the present embodiment, the pixel matching degree highest second picture block with the first picture block is determined in history picture block
After prediction block, the first picture block can be encoded according to prediction block.
, can be with specifically, after determining prediction block of the second picture block as the first picture block in history picture block
First picture block is carried out to such as traditional block codimg logic, block codimg logic can include calculating the first picture block and prediction block
Between residual error, to residual error carry out transform and quantization and entropy code etc..
For example, the pixel of the pixel value of each pixel of the first picture block and each pixel of prediction block can be calculated
The difference of value, with generate with residual signal residual fast, and can by residual block transform and quantization into coefficient of frequency, wherein, become
The method of changing can use the technology for the vision signal for being used to the vision signal of spatial domain being converted into frequency domain, such as Hadamard
(Hadamard) conversion or the integer transform based on discrete cosine transform, and quantization method can use such as dead band uniform
Threshold value quantizing or the various quantification techniques for quantifying weighting matrix.Then can be according to entropy coding to the residual of sampling frequency coefficient
Block is stayed to be encoded.
It is understood that the coding techniques in the present embodiment can also include except the entropy coding of described above
Other coding techniques, are not limited specifically herein.
It should be noted that in the present embodiment the coding method of the first picture block except the content of above-mentioned simple declaration,
In practical application, other methods can also be used, specifically may be referred to existing various coding methods, here is omitted,
Do not limit.
Further,, can be by the coding result of the first picture block after being encoded to the first picture block in the present embodiment
It is packaged into code stream and is sent to client, after causing client to receive the code stream, the code stream of same current frame image can be entered
Row processing, and then complete current frame image can be exported.
In the present embodiment, current frame image is divided into first the first picture of picture block of multiple formed objects and non-overlapping copies
Block can carry out pixel matching with the history picture block divided by history two field picture, to be searched and the first figure in history picture block
The second picture block of pixel matching degree highest one of tile, and the first picture block can be entered using second picture block as prediction block
Row coding.For compared with the prior art, the first picture block of the invention need not be in the history picture block of history two field picture division
In search out the picture block matched completely as prediction block, it is possible thereby to ensure compression ratio, secondly, interframe is done using pixel matching
Prediction, substituted for traditional motion estimation process, is advantageous to store relatively large number of history two field picture, to improve inter prediction
Accuracy rate.
It is understood that in the present embodiment, in the history picture being divided into by the first picture block and by history two field picture
When block carries out pixel matching, it can use and perceive hash algorithm, it is specifically described below：
Referring to Fig. 4, another embodiment of coding method includes in the embodiment of the present invention：
The 401st, current frame image is divided into the first picture block of multiple formed objects and non-overlapping copies；
Step 401 in the present embodiment is identical with the step 101 in embodiment illustrated in fig. 1, and here is omitted.
402nd, the first cryptographic Hash for perceiving hash algorithm and determining the first picture block is utilized；
, can after current frame image to be divided into the first picture block of multiple formed objects and non-overlapping copies in the present embodiment
To utilize the first cryptographic Hash for perceiving hash algorithm and determining the first picture block.
Specifically, similitude between picture can be weighed by perceiving hash algorithm, cryptographic Hash is closer, and corresponding picture is also
It is more similar.Therefore, it can utilize and perceive the first cryptographic Hash that hash algorithm determines the first picture block, with complete using the first cryptographic Hash
The lookup of the prediction block of paired first picture block.For example, the Pixel Dimensions of current frame image are 4 × 4, current frame image is divided
4 Pixel Dimensions into 2 × 2 sizes are identical and the first picture block of non-overlapping copies after, can utilize and perceive hash algorithm to every
One the first picture block is calculated, to obtain the first cryptographic Hash of each the first picture block.
Wherein, average Hash, the pHash based on dct transform, difference Hash can be included but is not limited to by perceiving hash algorithm
dHash。
403rd, the second figure corresponding with first Hash values match degree the second cryptographic Hash of highest is determined in history cryptographic Hash
Tile is prediction block；
In the present embodiment, using after the first cryptographic Hash for perceiving hash algorithm and determining the first picture block, it can be breathed out in history
Determine that second picture block corresponding with first Hash values match degree the second cryptographic Hash of highest is prediction block in uncommon value.Wherein, go through
History cryptographic Hash is history picture block to be calculated using perceiving hash algorithm.
Specifically, continue to use the content that step 102 in embodiment illustrated in fig. 1 illustrates, by history two field picture according to the first figure
After the size of tile is divided, each picture block in the history picture block be divided into by history two field picture can profit
Calculated with perception hash algorithm, obtain multiple corresponding history cryptographic Hash, and can be by the first Hash of the first picture block
Value is matched with this multiple corresponding history cryptographic Hash, and mode is as follows：
1st, assume that history two field picture is one, the history two field picture is divided into 9 history picture blocks, then can obtain 9
Individual corresponding history cryptographic Hash, then can be matched 9 history cryptographic Hash of the first cryptographic Hash and this one by one, and determine wherein
The minimum history cryptographic Hash of one and the first cryptographic Hash difference is the second cryptographic Hash, and can determine corresponding to the second cryptographic Hash the
Two picture blocks are the prediction block of the first picture block；
2nd, arest neighbors can be utilized to search method to determine in history cryptographic Hash and the first Hash values match degree highest second
Second picture block corresponding to cryptographic Hash is prediction block.Such as, history two field picture is divided into 9 history picture blocks, and obtains 9 accordingly
History cryptographic Hash after, can by this 9 history cryptographic Hash according to order from low to high be arranged as A1, A2, A3, A4,
A5, A6, A7, A8, A9, compared with then the first cryptographic Hash of the first picture block can be entered with the median in history cryptographic Hash,
I.e. compared with A5, because cryptographic Hash is closer, corresponding picture is also more similar, then if the first cryptographic Hash is more than A5,
Then illustrate that the difference between A4, A3, A2, A1 and the first cryptographic Hash can be increasing, it is possible thereby to exclude the first cryptographic Hash and A1,
A2, A3, A4 comparison, and compare the difference between the first cryptographic Hash and A5, A6, A7, A8, A9 successively again, if the first cryptographic Hash
It is minimum with A8 difference, then it is prediction block that can determine second picture block corresponding to A8.It should be noted that the present embodiment
In, it is determined that the first cryptographic Hash can reuse arest neighbors and search method progress more than after A5 between A5, A6, A7, A8, A9
The lookup of second picture block, is not limited specifically herein.In addition, arest neighbors searches method except by the way of described above,
In practical application, other manner can also be used, prior art is specifically referred to, does not also limit herein.
In actual applications, in order to improve the determination efficiency of second picture block, it is preferred that by the first of the first picture block
, can be bright using above having a talk about when cryptographic Hash cryptographic Hash corresponding with the history picture block divided by history two field picture is matched
The second way.
It is understood that service end is when storing history two field picture, the history picture block pair of history two field picture division
The cryptographic Hash answered can also be stored, with when the first cryptographic Hash of the first picture block is matched, it is not necessary to again to going through
Cryptographic Hash corresponding to the history picture block of history two field picture division is calculated, to improve matching efficiency.
404th, the first picture block is encoded according to prediction block；
Step 404 in the present embodiment is identical with the step 103 in embodiment illustrated in fig. 1, and here is omitted.
405th, the first picture block and the first cryptographic Hash are stored.
In the present embodiment, after being encoded according to prediction block to the first picture block, the first picture block and can be stored
One cryptographic Hash.
Specifically, service end can be provided with Hash table, the Hash table can record the corresponding history of corresponding history two field picture
The corresponding cryptographic Hash of picture block, by the Hash table, it can therefrom obtain a certain history picture block of a certain history two field picture
Corresponding cryptographic Hash.In order that the corresponding picture block for obtaining next two field picture of current frame image can be from the more of current frame image division
The lookup of block is predicted in individual first picture block, the first cryptographic Hash of the first picture block and the first picture block can be stored,
I.e. current frame image will be stored as history two field picture.
In actual applications, the Hash table can only record the corresponding history picture block of the history two field picture of predetermined number
Cryptographic Hash, such as 16 frames, then can be updated accordingly to Hash table using the principle of first in first out, such as current frame image
After first cryptographic Hash of the first picture block is stored, can by before the of current frame image the history two field picture of 16 frames it is corresponding
History picture block and corresponding cryptographic Hash are deleted, while the degree of accuracy of inter prediction is improved, can improve prediction
The determination efficiency of block.
It should be noted that if the corresponding history figure of the history two field picture of predetermined number can be not only recorded in Hash table
The cryptographic Hash of tile, then the step 405 in the present embodiment can also be performed before step 404, can also be with step 404 simultaneously
Perform, as long as being performed after using the first cryptographic Hash for perceiving hash algorithm and determining the first picture block, do not do herein specifically
Limit.
It is understood that the first picture block is being subjected to pixel with the history picture block being divided into by history two field picture
Timing, it is understood that there may be the multiple Target Photo blocks identical and forward with the first picture block pixel matching degree, then can be from multiple
Determine that a second picture block is prediction block in Target Photo block, it is specifically described below：
Referring to Fig. 5, another embodiment of coding method includes in the embodiment of the present invention：
The 501st, current frame image is divided into the first picture block of multiple formed objects and non-overlapping copies；
Step 401 in the present embodiment is identical with the step 101 in embodiment illustrated in fig. 1, and here is omitted.
502nd, the pixel matching degree of history picture block and the first picture block is determined；
, can after current frame image to be divided into the first picture block of multiple formed objects and non-overlapping copies in the present embodiment
To determine history picture block and the fast pixel matching degree of the first picture.Wherein, history picture block is according to the by history two field picture
The size of one picture block is divided to obtain.
Specifically, history two field picture is divided according to the size of the first picture block, after obtaining multiple history picture blocks,
The pixel matching degree of each history picture block and the first picture block can be determined, partial content is referred to implement shown in Fig. 1
The content that step 102 in example illustrates, can also be with reference in the step 402 in embodiment illustrated in fig. 4 to step 403 explanation
Hold, such as using the pixel matching degree for perceiving hash algorithm and determining history picture block and the first picture block, here is omitted.
503rd, pixel matching degree is ranked up according to principle from high to low, and sequence is determined most in history picture block
Multiple Target Photo blocks corresponding to forward pixel matching degree are second picture block；
, can be by pixel matching degree after the pixel matching degree for determining history picture block and the first picture block in the present embodiment
It is ranked up according to principle from high to low, and it is more corresponding to the most forward pixel matching degree of determination sequence in history picture block
Individual Target Photo block is second picture block.
Wherein, in order to reduce unnecessary detection to improve the determination efficiency of prediction block, it is preferred that the plurality of Target Photo
The pixel matching degree of block can be locked in a tie for first.For example, it is assumed that determine history picture block and the first picture using hash algorithm is perceived
The pixel matching degree of block, continue to use the content that the step 403 in embodiment illustrated in fig. 4 illustrates, it is assumed that history two field picture is divided into 9
Picture block, and after obtaining 9 corresponding history cryptographic Hash A1, A2, A3, A4, A5, A6, A7, A8, A9, can be by this 9 history
Cryptographic Hash compared with the first cryptographic Hash of the first picture block, if wherein the difference of A4, A5, A6 and the first cryptographic Hash it is minimum and
It is identical, then the pixel matching degree of picture block and the first picture block is most forward corresponding to can determining A4, A5, A6 respectively, A4,
A5, A6 respectively corresponding to picture block be 3 Target Photo blocks, this 3 target image blocks are second picture block.Need to illustrate
, in actual applications, other methods can also be used to determine the pixel matching degree of history picture block and the first picture block, and
Second picture block can be determined from history picture block, the present embodiment is only to perceive the determination that hash algorithm carries out pixel matching degree
Exemplified by illustrate.
504th, the encoding amount encoded according to second picture block to the first picture block is determined；
In the present embodiment, after determining second picture block, it may be determined that the first picture block is compiled according to second picture block
The encoding amount of code.
Specifically, second picture block includes multiple Target Photo blocks, first can calculate respectively according to each Target Photo
The encoding amount that block is encoded to the first picture block.In actual applications, gone through because multiple Target Photo blocks may belong to difference
History two field picture belongs to same history two field picture, then based on both of these case, determines that the mode of corresponding encoded amount is as follows：
1st, multiple Target Photo blocks belong to different history two field pictures.When multiple Target Photo blocks belong to different history two field pictures
When, it may be determined that the distance of history two field picture and current frame image belonging to multiple Target Photo blocks, continue to use above-mentioned steps 503 and say
Bright example, if picture block corresponding to A4, A5, A6 is second picture block, picture corresponding to A4, A5, A6 can be determined respectively
The distance of history two field picture and current frame image belonging to block, distance is bigger, then means the phase using corresponding history two field picture
The encoding amount for answering picture block to be encoded is bigger；
2nd, when multiple Target Photo blocks belong to same history two field picture.When multiple Target Photo blocks belong to same historical frames figure
During picture, it may be determined that multiple Target Photo blocks relative to the first picture block the first pixel-shift amount, i.e., in current frame image
Behind the position for determining the first picture block, the first picture block can be mapped to multiple Target Photo blocks in the position of current frame image
In affiliated history two field picture, first pixel-shift of multiple Target Photo blocks relative to the first picture block may thereby determine that
Amount.It is then possible to determine the difference of the first pixel-shift amount and the second pixel-shift amount, wherein, the second pixel-shift amount is the
A upper coded picture block for one picture block relative to the prediction block of coded picture block pixel-shift amount, in practical application
In, can be according to such as from left to right when being encoded to current frame image, the order under upper is successively to the first picture block
Encoded, and the coding of each picture block depends on corresponding prediction block, is encoded to the first current picture block
When, it may be determined that a upper coded picture block for the first picture block can reflect the position in the position of corresponding two field picture
It is incident upon in the affiliated history two field picture of prediction block of a upper coded picture block for the first picture block, so that it is determined that the first picture block
A upper coded picture block and its prediction block between the second pixel-shift amount.Determine the first pixel-shift amount and the second picture
After plain offset, the first pixel-shift amount and the second pixel-shift amount can be contrasted, difference is bigger, then means to utilize
The encoding amount that the corresponding picture block of corresponding history two field picture is encoded to the first picture block is bigger.Wherein, pixel-shift amount refers to
Be corresponding picture block horizontal, vertical both direction pixel-shift.
It is understood that in the present embodiment, the second pixel-shift amount can be precalculated and stored, and not limited herein
It is fixed.
It should be noted that the volume encoded according to multiple second picture blocks to the first picture block is determined in the present embodiment
The mode of code amount, in actual applications, can also be from other manner, as long as can be according to encoding amount except the content of described above
The prediction block of the first picture block is determined, is not limited herein specifically.
505th, determine that the minimum picture block of encoding amount is prediction block in second picture block；
In the present embodiment, it is determined that after the encoding amount encoded to the first picture block according to second picture block, can be
Determine that the minimum picture block of encoding amount is prediction block in two picture blocks.
Specifically, because small encoding amount is advantageous to be encoded, then it is determined that after multiple corresponding encoding amounts, can incite somebody to action
Multiple encoding amounts are contrasted, and obtain one of encoding amount minimum, and be used as prediction using a picture block corresponding to the encoding amount
Block.Illustrate to delimit the organizational structure really the mode of code amount based on above-mentioned steps 504, determines that the mode of prediction block is as follows：
1st, can be in multiple mesh after the distance for determining the history two field picture and current frame image belonging to multiple Target Photo blocks
Mark on a map tile, i.e., it is prediction block that picture block corresponding to closest history two field picture is determined in second picture block.Such as, step is continued to use
The content of rapid 503 explanation, if picture block corresponding to A4, A5, A6 is second picture block, wherein, history two field picture is corresponding to A4
2 two field pictures before the of current frame image, history two field picture corresponding to A5 are 1 two field picture before the of current frame image, corresponding to A4
History two field picture is 3 two field pictures before the of current frame image, then can determine historical frames image distance present frame corresponding to A5
Image it is closest, then can be using picture block corresponding to A5 as prediction block；
2nd, after determining multiple first pixel-shift amounts and the second pixel-shift amount, each first pixel can be determined respectively
Difference between offset and the second pixel-shift amount, and can be in multiple Target Photo blocks, i.e., it is poor to be determined in second picture block
Picture block corresponding to different the first minimum pixel-shift amount is prediction block.Such as, the content that step 503 illustrates is continued to use, if A4, A5,
Three Target Photo blocks corresponding to A6 are second picture block, the first picture that three Target Photo blocks as corresponding to A4, A5, A6 determine
Plain offset is B1, B2, B3, and the difference between the second pixel-shift amount determined by B1, B2, B3 is C1, C2, C3, and is pressed
According to difference size from high to low be ordered as C2, C3, C1, then can determine that picture block corresponding to C1 is prediction block, i.e. A4 is corresponding
Target Photo block be prediction block.
506th, the first picture block is encoded according to prediction block.
Step 506 in the present embodiment is identical with the step 103 in embodiment illustrated in fig. 1, and here is omitted.
It is understood that in the present embodiment when it is determined that multiple Target Photo blocks are as second picture block, if utilizing
Hash algorithm is perceived, then can determine the first cryptographic Hash of the first picture block, then be referred to step in embodiment illustrated in fig. 4
The content of 405 explanations, is stored to the first picture block and the first cryptographic Hash, and specific here is omitted.
The coding method in the embodiment of the present invention is described above, the coding in the embodiment of the present invention filled below
Put and be described, referring to Fig. 6, code device one embodiment includes in the embodiment of the present invention：
Division unit 601, for current frame image to be divided into the first picture block of multiple formed objects and non-overlapping copies；
First determining unit 602, for determining the pixel matching degree highest with the first picture block in history picture block
Second picture block is prediction block, and history picture block is to be divided to obtain according to the size of the first picture block by history two field picture；
Coding unit 603, for being encoded according to prediction block to the first picture block.
Referring to Fig. 7, another embodiment of code device includes in the embodiment of the present invention：
Unit 701 in the present embodiment is identical with the unit 601 in embodiment illustrated in fig. 6, real shown in unit 702 and Fig. 6
The unit 602 applied in example is identical, and unit 703 is identical with the unit 603 in embodiment illustrated in fig. 6, and here is omitted.
Memory cell 704, for storing the first picture block and the first cryptographic Hash.
Optionally, in some embodiments of the invention, the first determining unit 702, can further be specifically used for：
Utilize the first cryptographic Hash for perceiving hash algorithm and determining the first picture block；
Second picture block corresponding with first Hash values match degree the second cryptographic Hash of highest is determined in history cryptographic Hash
For prediction block, history cryptographic Hash is history picture block to be calculated using perceiving hash algorithm.
Optionally, in some embodiments of the invention, the first determining unit 702, can further be specifically used for：
Method is searched using arest neighbors to determine in history cryptographic Hash and first Hash values match degree the second cryptographic Hash of highest
Corresponding second picture block is prediction block.
Optionally, in some embodiments of the invention, the first determining unit 702, can further be specifically used for：
Determine the pixel matching degree of history picture block and the first picture block；
Pixel matching degree is ranked up according to principle from high to low, and determines that sequence is most forward in history picture block
Pixel matching degree corresponding to multiple Target Photo blocks be second picture block；
It is determined that the encoding amount encoded according to second picture block to the first picture block；
Determine that the minimum picture block of encoding amount is prediction block in second picture block.
Optionally, in some embodiments of the invention, when multiple Target Photo blocks belong to different history two field pictures, the
One determining unit 702, can further be specifically used for：
Determine the distance of the history two field picture and current frame image belonging to second picture block；
It is prediction block that picture block corresponding to closest history two field picture is determined in second picture block.
Optionally, in some embodiments of the invention, when multiple Target Photo blocks belong to same history two field picture, the
One determining unit 702, can further be specifically used for：
Determine first pixel-shift amount of the second picture block relative to the first picture block；
The difference of the first pixel-shift amount and the second pixel-shift amount is determined, the second pixel-shift amount is the first picture block
A upper coded picture block relative to the prediction block of coded picture block pixel-shift amount；
Determine that picture block corresponding to the first minimum pixel-shift amount of difference is prediction block in second picture block.
The code device in the embodiment of the present invention is described the angle of slave module functional entity above, below from
Computer installation in the embodiment of the present invention is described the angle of hardware handles：
Computer device one embodiment of the embodiment of the present invention includes：
Processor and memory；
Memory is used to store computer program, can when processor is used to perform the computer program stored in memory
To realize following steps：
Current frame image is divided into the first picture block of multiple formed objects and non-overlapping copies；
Determine that with the pixel matching degree highest second picture block of the first picture block be prediction block, is gone through in history picture block
History picture block is to be divided to obtain according to the size of the first picture block by history two field picture；
The first picture block is encoded according to prediction block.
In some embodiments of the invention, processor, can be also used for realizing following steps：
Utilize the first cryptographic Hash for perceiving hash algorithm and determining the first picture block；
Second picture block corresponding with first Hash values match degree the second cryptographic Hash of highest is determined in history cryptographic Hash
For prediction block, history cryptographic Hash is history picture block to be calculated using perceiving hash algorithm.
In some embodiments of the invention, processor, can be also used for realizing following steps：
Method is searched using arest neighbors to determine in history cryptographic Hash and first Hash values match degree the second cryptographic Hash of highest
Corresponding second picture block is prediction block.
In some embodiments of the invention, processor, can be also used for realizing following steps：
Determine the pixel matching degree of history picture block and the first picture block；
Pixel matching degree is ranked up according to principle from high to low, and determines that sequence is most forward in history picture block
Pixel matching degree corresponding to multiple Target Photo blocks be second picture block；
It is determined that the encoding amount encoded according to second picture block to the first picture block；
Determine that the minimum picture block of encoding amount is prediction block in second picture block.
In some embodiments of the invention, when multiple Target Photo blocks belong to different history two field pictures, processor, also
It can be used for realizing following steps：
Determine the distance of the history two field picture and current frame image belonging to second picture block；
It is prediction block that picture block corresponding to closest history two field picture is determined in second picture block.
In some embodiments of the invention, when multiple Target Photo blocks belong to same history two field picture, processor, also
It can be used for realizing following steps：
Determine first pixel-shift amount of the second picture block relative to the first picture block；
The difference of the first pixel-shift amount and the second pixel-shift amount is determined, the second pixel-shift amount is the first picture block
A upper coded picture block relative to the prediction block of coded picture block pixel-shift amount；
Determine that picture block corresponding to the first minimum pixel-shift amount of difference is prediction block in second picture block.
In some embodiments of the invention, processor, can be also used for realizing following steps：
Store the first picture block and the first cryptographic Hash.
It is understood that also may be used described in computing device in the computer installation of described above during computer program
To realize the function of each unit in above-mentioned corresponding each device embodiment, here is omitted.Exemplary, the computer journey
Sequence can be divided into one or more module/units, and one or more of module/units are stored in the memory
In, and by the computing device, to complete the present invention.One or more of module/units can be can complete it is specific
The series of computation machine programmed instruction section of function, the instruction segment are used to describe the computer program in the code device
Implementation procedure.For example, the computer program can be divided into each unit in above-mentioned code device, each unit can be realized
Such as the concrete function described in above-mentioned corresponding encoded device.
The computer installation can be that the calculating such as desktop PC, notebook, palm PC and cloud server are set
It is standby.The computer installation may include but be not limited only to processor, memory.It will be understood by those skilled in the art that processor,
Memory is only the example of computer installation, does not form the restriction to computer installation, can be included more or less
Part, some parts or different parts are either combined, such as the computer installation can also be set including input and output
Standby, network access equipment, bus etc..
The processor can be CPU (Central Processing Unit, CPU), can also be it
His general processor, digital signal processor (Digital Signal Processor, DSP), application specific integrated circuit
(Application Specific Integrated Circuit, ASIC), ready-made programmable gate array (Field-
Programmable Gate Array, FPGA) either other PLDs, discrete gate or transistor logic,
Discrete hardware components etc..General processor can be microprocessor or the processor can also be any conventional processor
Deng the processor is the control centre of the computer installation, utilizes various interfaces and the whole computer installation of connection
Various pieces.
The memory can be used for storing the computer program and/or module, and the processor is by running or performing
The computer program and/or module being stored in the memory, and the data being stored in memory are called, described in realization
The various functions of computer installation.The memory can mainly include storing program area and storage data field, wherein, storage program
Area can storage program area, application program needed at least one function etc.；Storage data field can store the use according to terminal
Data created etc..In addition, memory can include high-speed random access memory, non-volatile memories can also be included
Device, such as hard disk, internal memory, plug-in type hard disk, intelligent memory card (Smart Media Card, SMC), secure digital (Secure
Digital, SD) card, flash card (Flash Card), at least one disk memory, flush memory device or other volatibility are consolidated
State memory device.
Present invention also offers a kind of computer-readable recording medium, calculating is stored with the computer-readable recording medium
Machine program, when computer program is executed by processor, processor, it can be used for performing following steps：
Current frame image is divided into the first picture block of multiple formed objects and non-overlapping copies；
Determine that with the pixel matching degree highest second picture block of the first picture block be prediction block, is gone through in history picture block
History picture block is to be divided to obtain according to the size of the first picture block by history two field picture；
The first picture block is encoded according to prediction block.
In some embodiments of the invention, the computer program of computer-readable recording medium storage is executed by processor
When, processor, it can be specifically used for performing following steps：
Utilize the first cryptographic Hash for perceiving hash algorithm and determining the first picture block；
Second picture block corresponding with first Hash values match degree the second cryptographic Hash of highest is determined in history cryptographic Hash
For prediction block, history cryptographic Hash is history picture block to be calculated using perceiving hash algorithm.
In some embodiments of the invention, the computer program of computer-readable recording medium storage is executed by processor
When, processor, it can be specifically used for performing following steps：
Method is searched using arest neighbors to determine in history cryptographic Hash and first Hash values match degree the second cryptographic Hash of highest
Corresponding second picture block is prediction block.
In some embodiments of the invention, the computer program of computer-readable recording medium storage is executed by processor
When, processor, it can be specifically used for performing following steps：
Determine the pixel matching degree of history picture block and the first picture block；
Pixel matching degree is ranked up according to principle from high to low, and determines that sequence is most forward in history picture block
Pixel matching degree corresponding to multiple Target Photo blocks be second picture block；
It is determined that the encoding amount encoded according to second picture block to the first picture block；
Determine that the minimum picture block of encoding amount is prediction block in second picture block.
In some embodiments of the invention, when multiple Target Photo blocks belong to different history two field pictures, computer can
When the computer program of reading storage medium storage is executed by processor, processor, it can be specifically used for performing following steps：
Determine the distance of the history two field picture and current frame image belonging to second picture block；
It is prediction block that picture block corresponding to closest history two field picture is determined in second picture block.
In some embodiments of the invention, when multiple Target Photo blocks belong to same history two field picture, computer can
When the computer program of reading storage medium storage is executed by processor, processor, it can be specifically used for performing following steps：
Determine first pixel-shift amount of the second picture block relative to the first picture block；
The difference of the first pixel-shift amount and the second pixel-shift amount is determined, the second pixel-shift amount is the first picture block
A upper coded picture block relative to the prediction block of coded picture block pixel-shift amount；
Determine that picture block corresponding to the first minimum pixel-shift amount of difference is prediction block in second picture block.
In some embodiments of the invention, the computer program of computer-readable recording medium storage is executed by processor
When, processor, it can be specifically used for performing following steps：
Store the first picture block and the first cryptographic Hash.
If it is understood that the integrated unit is realized in the form of SFU software functional unit and is used as independent production
Product are sold or in use, can be stored in a corresponding computer read/write memory medium.Based on such understanding, this hair
The bright all or part of flow realized in above-mentioned corresponding embodiment method, correlation can also be instructed by computer program
Hardware is completed, and described computer program can be stored in a computer-readable recording medium, the computer program is being located
Manage device perform when, can be achieved above-mentioned each embodiment of the method the step of.Wherein, the computer program includes computer program generation
Code, the computer program code can be source code form, object identification code form, executable file or some intermediate forms
Deng.The computer-readable medium can include：Any entity or device, the record of the computer program code can be carried
Medium, USB flash disk, mobile hard disk, magnetic disc, CD, computer storage, read-only storage (ROM, Read-Only Memory), with
Machine access memory (RAM, Random Access Memory), electric carrier signal, telecommunication signal and software distribution medium etc..
It should be noted that the content that the computer-readable medium includes can be according to legislation in jurisdiction and patent practice
It is required that carry out appropriate increase and decrease, such as in some jurisdictions, do not wrapped according to legislation and patent practice, computer-readable medium
Include electric carrier signal and telecommunication signal.
It is apparent to those skilled in the art that for convenience and simplicity of description, the system of foregoing description,
The specific work process of device and unit, the corresponding process in preceding method embodiment is may be referred to, will not be repeated here.
In several embodiments provided herein, it should be understood that disclosed system, apparatus and method can be with
Realize by another way.For example, device embodiment described above is only schematical, for example, the unit
Division, only a kind of division of logic function, can there is other dividing mode, such as multiple units or component when actually realizing
Another system can be combined or be desirably integrated into, or some features can be ignored, or do not perform.It is another, it is shown or
The mutual coupling discussed or direct-coupling or communication connection can be the indirect couplings by some interfaces, device or unit
Close or communicate to connect, can be electrical, mechanical or other forms.
The unit illustrated as separating component can be or may not be physically separate, show as unit
The part shown can be or may not be physical location, you can with positioned at a place, or can also be distributed to multiple
On NE.Some or all of unit therein can be selected to realize the mesh of this embodiment scheme according to the actual needs
's.
In addition, each functional unit in each embodiment of the present invention can be integrated in a processing unit, can also
That unit is individually physically present, can also two or more units it is integrated in a unit.
Described above, the above embodiments are merely illustrative of the technical solutions of the present invention, rather than its limitations；Although with reference to before
Embodiment is stated the present invention is described in detail, it will be understood by those within the art that：It still can be to preceding
State the technical scheme described in each embodiment to modify, or equivalent substitution is carried out to which part technical characteristic；And these
Modification is replaced, and the essence of appropriate technical solution is departed from the spirit and scope of various embodiments of the present invention technical scheme.
Claims (16)
- A kind of 1. coding method, it is characterised in that including：Current frame image is divided into the first picture block of multiple formed objects and non-overlapping copies；Determine that with the pixel matching degree highest second picture block of first picture block be prediction block in history picture block, institute History picture block is stated to be divided to obtain history two field picture according to the size of first picture block；First picture block is encoded according to the prediction block.
- 2. according to the method for claim 1, it is characterised in that described to be determined and first picture in history picture block The pixel matching degree highest second picture block of block includes for prediction block：Utilize the first cryptographic Hash for perceiving hash algorithm and determining first picture block；Second picture block corresponding with the second cryptographic Hash of the first Hash values match degree highest is determined in history cryptographic Hash For prediction block, the history cryptographic Hash is that the history picture block is calculated using the perception hash algorithm.
- 3. according to the method for claim 2, it is characterised in that described to be determined and first Hash in history cryptographic Hash Second picture block corresponding to value matching degree the second cryptographic Hash of highest includes for prediction block：Method is searched using arest neighbors to determine in history cryptographic Hash and the second cryptographic Hash of the first Hash values match degree highest Corresponding second picture block is prediction block.
- 4. according to the method in any one of claims 1 to 3, it is characterised in that it is described in history picture block determine with The pixel matching degree highest second picture block of first picture block includes for prediction block：Determine the pixel matching degree of history picture block and first picture block；The pixel matching degree is ranked up according to principle from high to low, and sequence is determined most in the history picture block Multiple Target Photo blocks corresponding to forward pixel matching degree are second picture block；It is determined that the encoding amount encoded according to the second picture block to first picture block；Determine that the minimum picture block of the encoding amount is prediction block in the second picture block.
- 5. according to the method for claim 4, it is characterised in that when multiple Target Photo blocks belong to different historical frames figures During picture, the encoding amount for determining to encode first picture block according to the second picture block includes：Determine the distance of the history two field picture and the current frame image belonging to the second picture block；The picture block for determining that the encoding amount is minimum in the second picture block includes for prediction block：It is prediction block that picture block corresponding to the closest history two field picture is determined in the second picture block.
- 6. according to the method for claim 4, it is characterised in that when multiple Target Photo blocks belong to same historical frames figure During picture, the encoding amount for determining to encode first picture block according to the second picture block includes：Determine first pixel-shift amount of the second picture block relative to first picture block；The difference of the first pixel-shift amount and the second pixel-shift amount is determined, the second pixel-shift amount is described first A upper coded picture block for picture block relative to the prediction block of the coded picture block pixel-shift amount；The picture block for determining that the encoding amount is minimum in the second picture block includes for prediction block：Determine that picture block corresponding to the first minimum pixel-shift amount of the difference is prediction block in the second picture block.
- 7. according to the method in claim 2 or 3, it is characterised in that determine described the using perceiving hash algorithm described After first cryptographic Hash of one picture block, methods described also includes：Store first picture block and first cryptographic Hash.
- A kind of 8. code device, it is characterised in that including：Division unit, for current frame image to be divided into the first picture block of multiple formed objects and non-overlapping copies；First determining unit, for determining the pixel matching degree highest second with first picture block in history picture block Picture block is prediction block, and the history picture block is according to the size of first picture block divide by history two field picture Arrive；Coding unit, for being encoded according to the prediction block to first picture block.
- 9. device according to claim 8, it is characterised in that first determining unit, be specifically used for：Utilize the first cryptographic Hash for perceiving hash algorithm and determining first picture block；Second picture block corresponding with the second cryptographic Hash of the first Hash values match degree highest is determined in history cryptographic Hash For prediction block, the history cryptographic Hash is that the history picture block is calculated using the perception hash algorithm.
- 10. device according to claim 9, it is characterised in that first determining unit, be specifically used for：Method is searched using arest neighbors to determine in history cryptographic Hash and the second cryptographic Hash of the first Hash values match degree highest Corresponding second picture block is prediction block.
- 11. the device according to any one of claim 8 to 10, it is characterised in that first determining unit is specific to use In：Determine the pixel matching degree of history picture block and first picture block；The pixel matching degree is ranked up according to principle from high to low, and sequence is determined most in the history picture block Multiple Target Photo blocks corresponding to forward pixel matching degree are second picture block；It is determined that the encoding amount encoded according to the second picture block to first picture block；Determine that the minimum picture block of the encoding amount is prediction block in the second picture block.
- 12. device according to claim 11, it is characterised in that when multiple Target Photo blocks belong to different historical frames During image, first determining unit, it is specifically used for：Determine the distance of the history two field picture and the current frame image belonging to the second picture block；It is prediction block that picture block corresponding to the closest history two field picture is determined in the second picture block.
- 13. device according to claim 11, it is characterised in that when multiple Target Photo blocks belong to same historical frames During image, first determining unit, it is specifically used for：Determine first pixel-shift amount of the second picture block relative to first picture block；The difference of the first pixel-shift amount and the second pixel-shift amount is determined, the second pixel-shift amount is described first A upper coded picture block for picture block relative to the prediction block of the coded picture block pixel-shift amount；Determine that picture block corresponding to the first minimum pixel-shift amount of the difference is prediction block in the second picture block.
- 14. the device according to claim 9 or 10, it is characterised in that described device also includes：Memory cell, for storing first picture block and first cryptographic Hash.
- A kind of 15. computer installation, it is characterised in that：The computer installation includes processor, and the processor is used to perform Realized during the computer program stored in memory as described in any one in claim 1 to 7 the step of coding method.
- 16. a kind of computer-readable recording medium, is stored thereon with computer program, it is characterised in that：The computer program Realized when being executed by processor as described in any one in claim 1 to 7 the step of coding method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710648582.8A CN107396112B (en) | 2017-08-01 | 2017-08-01 | Encoding method and device, computer device and readable storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710648582.8A CN107396112B (en) | 2017-08-01 | 2017-08-01 | Encoding method and device, computer device and readable storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN107396112A true CN107396112A (en) | 2017-11-24 |
| CN107396112B CN107396112B (en) | 2021-03-09 |
Family
ID=60344196
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710648582.8A Active CN107396112B (en) | 2017-08-01 | 2017-08-01 | Encoding method and device, computer device and readable storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN107396112B (en) |
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108259914A (en) * | 2018-03-20 | 2018-07-06 | 西安电子科技大学 | Cloud method for encoding images based on object library |
| CN109361927A (en) * | 2018-09-29 | 2019-02-19 | 西安万像电子科技有限公司 | Image processing method and device |
| CN109408681A (en) * | 2018-10-11 | 2019-03-01 | 广东工业大学 | A kind of character string matching method, device, equipment and readable storage medium storing program for executing |
| CN110177278A (en) * | 2019-05-24 | 2019-08-27 | 北京迈格威科技有限公司 | A kind of inter-frame prediction method, method for video coding and device |
| CN110545428A (en) * | 2018-05-28 | 2019-12-06 | 深信服科技股份有限公司 | motion estimation method and device, server and computer readable storage medium |
| CN112614187A (en) * | 2020-12-31 | 2021-04-06 | 深圳市优必选科技股份有限公司 | Loop detection method, device, terminal equipment and readable storage medium |
| CN113242409A (en) * | 2021-04-26 | 2021-08-10 | 深圳市安星数字系统有限公司 | Night vision early warning method and device based on unmanned aerial vehicle, unmanned aerial vehicle and storage medium |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101720039A (en) * | 2009-09-08 | 2010-06-02 | 广东工业大学 | Diamond search-based multi-resolution quick motion estimation method |
| CN103108188A (en) * | 2013-03-01 | 2013-05-15 | 武汉大学 | Video steganalysis method based on partial cost non-optimal statistics |
| CN105393537A (en) * | 2014-03-04 | 2016-03-09 | 微软技术许可有限责任公司 | Hash table construction and availability checking for hash-based block matching |
| CN105681808A (en) * | 2016-03-16 | 2016-06-15 | 同济大学 | Rapid decision-making method for SCC interframe coding unit mode |
| CN106375771A (en) * | 2016-08-31 | 2017-02-01 | 苏睿 | Image characteristic matching method and device |
| US20170094280A1 (en) * | 2015-09-28 | 2017-03-30 | Renesas Electronics Corporation | Semiconductor device |
| US9665646B1 (en) * | 2011-04-13 | 2017-05-30 | Flash Networks, Ltd | Method and system for providing bit rate adaptaion to video files having metadata |
-
2017
- 2017-08-01 CN CN201710648582.8A patent/CN107396112B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101720039A (en) * | 2009-09-08 | 2010-06-02 | 广东工业大学 | Diamond search-based multi-resolution quick motion estimation method |
| US9665646B1 (en) * | 2011-04-13 | 2017-05-30 | Flash Networks, Ltd | Method and system for providing bit rate adaptaion to video files having metadata |
| CN103108188A (en) * | 2013-03-01 | 2013-05-15 | 武汉大学 | Video steganalysis method based on partial cost non-optimal statistics |
| CN105393537A (en) * | 2014-03-04 | 2016-03-09 | 微软技术许可有限责任公司 | Hash table construction and availability checking for hash-based block matching |
| US20170094280A1 (en) * | 2015-09-28 | 2017-03-30 | Renesas Electronics Corporation | Semiconductor device |
| CN105681808A (en) * | 2016-03-16 | 2016-06-15 | 同济大学 | Rapid decision-making method for SCC interframe coding unit mode |
| CN106375771A (en) * | 2016-08-31 | 2017-02-01 | 苏睿 | Image characteristic matching method and device |
Cited By (13)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN108259914A (en) * | 2018-03-20 | 2018-07-06 | 西安电子科技大学 | Cloud method for encoding images based on object library |
| CN108259914B (en) * | 2018-03-20 | 2019-10-11 | 西安电子科技大学 | Cloud image encoding method based on object library |
| CN110545428A (en) * | 2018-05-28 | 2019-12-06 | 深信服科技股份有限公司 | motion estimation method and device, server and computer readable storage medium |
| CN110545428B (en) * | 2018-05-28 | 2024-02-23 | 深信服科技股份有限公司 | Motion estimation method and device, server and computer readable storage medium |
| CN109361927A (en) * | 2018-09-29 | 2019-02-19 | 西安万像电子科技有限公司 | Image processing method and device |
| CN109408681B (en) * | 2018-10-11 | 2021-11-26 | 广东工业大学 | Character string matching method, device and equipment and readable storage medium |
| CN109408681A (en) * | 2018-10-11 | 2019-03-01 | 广东工业大学 | A kind of character string matching method, device, equipment and readable storage medium storing program for executing |
| CN110177278A (en) * | 2019-05-24 | 2019-08-27 | 北京迈格威科技有限公司 | A kind of inter-frame prediction method, method for video coding and device |
| CN110177278B (en) * | 2019-05-24 | 2021-04-06 | 北京迈格威科技有限公司 | Inter-frame prediction method, video coding method and device |
| CN112614187A (en) * | 2020-12-31 | 2021-04-06 | 深圳市优必选科技股份有限公司 | Loop detection method, device, terminal equipment and readable storage medium |
| CN112614187B (en) * | 2020-12-31 | 2024-03-26 | 深圳市优必选科技股份有限公司 | Loop detection method, loop detection device, terminal equipment and readable storage medium |
| CN113242409A (en) * | 2021-04-26 | 2021-08-10 | 深圳市安星数字系统有限公司 | Night vision early warning method and device based on unmanned aerial vehicle, unmanned aerial vehicle and storage medium |
| CN113242409B (en) * | 2021-04-26 | 2023-09-12 | 国网安徽省电力有限公司天长市供电公司 | Night vision early warning method and device based on unmanned aerial vehicle, unmanned aerial vehicle and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN107396112B (en) | 2021-03-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107396112A (en) | A kind of coding method and device, computer installation, readable storage medium storing program for executing | |
| EP3772853B1 (en) | Method and device for point cloud coding | |
| CN103918255A (en) | Method and device for encoding a depth map of multi viewpoint video data, and method and device for decoding the encoded depth map | |
| EP3849188A1 (en) | Point cloud coding method and encoder | |
| KR20230087474A (en) | Joint termination of bidirectional data blocks for parallel coding | |
| US12088841B2 (en) | Prediction for light-field coding and decoding | |
| US20210304444A1 (en) | Point Cloud Encoding Method and Encoder | |
| US20210233280A1 (en) | Encoding device control method and device, and storage medium | |
| CN113436057A (en) | Data processing method and binocular stereo matching method | |
| CN109493304A (en) | A kind of image processing method and device | |
| CN114157868B (en) | Video frame coding mode screening method and device and electronic equipment | |
| WO2020107319A1 (en) | Image processing method and device, and video processor | |
| CN103327340B (en) | A kind of integer searches method and device | |
| US12015777B2 (en) | Signaling profile level exemptions for immersive video | |
| CN115080531A (en) | Distributed storage based image processing method, system, device and medium | |
| CN110545428A (en) | motion estimation method and device, server and computer readable storage medium | |
| WO2023023914A1 (en) | Intra-frame prediction method and apparatus, encoding method and apparatus, decoding method and apparatus, and encoder, decoder, device and medium | |
| CN114630114A (en) | Intra-frame prediction method and device for video coding, storage medium and electronic equipment | |
| Yun et al. | Design of reconfigurable array processor for multimedia application | |
| CN112565753A (en) | Method and apparatus for determining motion vector difference, storage medium, and electronic apparatus | |
| CN103997635A (en) | Synthesis viewpoint distortion prediction method and coding method of free viewpoint video | |
| CN117176979B (en) | Method, device, equipment and storage medium for extracting content frames of multi-source heterogeneous video | |
| EP3759915A1 (en) | Apparatus and method for coding an image | |
| CN117177004B (en) | Content frame extraction method, device, equipment and storage medium | |
| WO2020057338A1 (en) | Point cloud coding method and encoder |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |