CN108881909A - Scanning sequency generation method and scanning sequency generating device - Google Patents
Scanning sequency generation method and scanning sequency generating device Download PDFInfo
- Publication number
- CN108881909A CN108881909A CN201710321531.4A CN201710321531A CN108881909A CN 108881909 A CN108881909 A CN 108881909A CN 201710321531 A CN201710321531 A CN 201710321531A CN 108881909 A CN108881909 A CN 108881909A
- Authority
- CN
- China
- Prior art keywords
- block
- square
- blkindex
- integral multiple
- largest
- 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
- 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/129—Scanning of coding units, e.g. zig-zag scan of transform coefficients or flexible macroblock ordering [FMO]
-
- 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
Abstract
The invention discloses a kind of scanning sequency generation method and scanning sequency generating devices.This method includes：The largest square in non-square block to be processed is determined, so that the non-square block is made of multiple largest squares, wherein the largest square is made of multiple blocks as minimal processing unit；If the coordinate of current block is (x0,y0), the index of current block is BlkIndex, and next piece of coordinate is (x1,y1), next piece of index is BlkIndex+1；Judge whether current block is the last one block in largest square；If current block is the last one block in largest square；Then next piece is first block in next largest square；If current block is not the last one block in largest square；Then according to BlkIndex, x0、y0Determine x1、y1；Wherein, the sequence that current block and next piece of index are constituted is scanning sequency generated.
Description
Technical field
This invention relates generally to technical field of video compression.It can be with low complexity specifically, the present invention relates to one kind
The method and apparatus that degree, small memory overhead generate the Z scanning sequency for image coding and decoding.
Background technique
Video compression technology achieves significant progress in recent years, and video encoding standard is weeded out the old and bring forth the new, newest at present
H.266, video encoding standard is being discussed.Although constantly being made various to improve encoding-decoding efficiency and effect
It improves, but invariably intra prediction+inter-prediction foundation structure.Wherein, basis and it is important that for as minimum
The scanning sequency of the block of processing unit, the scanning sequency constitute Z-shaped, are commonly referred to as Z scanning sequency.Z scanning sequency is after each
For standard constancy.
In newer video encoding standard, the concept of non-square block is introduced.For example, in H.266, QTBT
Non-square block is proposed in (Quadtree plus Binary Tree) block structure.Since minimal processing unit is block, such as 4*
4 block of pixels, so need non-square block being divided into many pieces, then according to Z scanning sequency to these blocks carry out coding or
Decoding.
When it is the Z scanning sequency for non-square block that the Z scanning sequency for being conventionally used to square block, which changes, Z is generated
The method of scanning sequency is usually to pass through recursive algorithm or the sequential transformations of storage matrix are realized.Recursive algorithm is sometimes uncomfortable
With, using storage matrix sequential transformations when for all types of non-square blocks matrix it is very huge, memory overhead is too
Greatly.
Therefore, the present invention is directed to propose a kind of generated with low complex degree, small memory overhead is scanned for the Z of image coding and decoding
The method and apparatus of sequence.
Summary of the invention
It has been given below about brief overview of the invention, in order to provide about the basic of certain aspects of the invention
Understand.It should be appreciated that this summary is not an exhaustive overview of the invention.It is not intended to determine pass of the invention
Key or pith, nor is it intended to limit the scope of the present invention.Its purpose only provides certain concepts in simplified form,
Taking this as a prelude to a more detailed description discussed later.
The purpose of the present invention is to propose to a kind of Z that can be generated with low complex degree, small memory overhead for image coding and decoding
The method and apparatus of scanning sequency.
To achieve the goals above, according to an aspect of the invention, there is provided a kind of scanning sequency generation method, this is swept
Retouching the method for being sequentially generated includes：Determine the largest square in non-square block to be processed so that the non-square block by
Multiple largest square compositions, wherein the largest square is made of multiple blocks as minimal processing unit；If working as
Preceding piece of coordinate is (x0,y0), the index of current block is BlkIndex, and next piece of coordinate is (x1,y1), next piece of index
For BlkIndex+1；Judge whether current block is the last one block in largest square；If current block is largest square
In the last one block；Then next piece is first block in next largest square；If current block is not largest square
In the last one block；Then：If BlkIndex is 29Integral multiple, then x1=x0-(25-1),y1=y0+4；If
BlkIndex is 28Integral multiple, then x1=x0+4,y1=y0-(24-1)*4；If BlkIndex is 27Integral multiple, then x1=
x0-(24-1)*4,y1=y0+4；If BlkIndex is 26Integral multiple, then x1=x0+4,y1=y0-(23-1)*4；If
BlkIndex is 25Integral multiple, then x1=x0-(23-1)*4,y1=y0+4；If BlkIndex is 24Integral multiple, then x1=
x0+4,y1=y0-(22-1)*4；If BlkIndex is 23Integral multiple, then x1=x0-(22-1)*5,y1=y0+4；If
BlkIndex is 22Integral multiple, then x1=x0+4,y1=y0-4；If the integral multiple that BlkIndex is 2, x1=x0-4,y1=
y0+4；Otherwise, x1=x0+4,y1=y0；Wherein, the sequence that current block and next piece of index are constituted is that scanning generated is suitable
Sequence.
According to an aspect of the invention, there is provided a kind of image encoding method, scanning sequency as described above
The scanning sequency that generation method generates carries out coded treatment to non-square block to be encoded.
According to another aspect of the invention, a kind of image encoder is provided, for executing image coding as described above
Method.
In accordance with a further aspect of the present invention, a kind of picture decoding method is provided, scanning sequency is raw as described above
At the scanning sequency that method generates, treats decoded non-square block and be decoded processing.
According to another aspect of the invention, a kind of image decoder is provided, for executing image decoding as described above
Method.
According to another aspect of the present invention, a kind of scanning sequency generating device is provided, the scanning sequency generating device
Including：Central processing unit CPU is configured as controlling：The largest square in non-square block to be processed is determined, so that institute
It states non-square block to be made of multiple largest squares, wherein the largest square is used as minimum treat list by multiple
The block composition of member；If the coordinate of current block is (x0,y0), the index of current block is BlkIndex, and next piece of coordinate is (x1,
y1), next piece of index is BlkIndex+1；Judge whether current block is the last one block in largest square；If worked as
Preceding piece is the last one block in largest square；Then next piece is first block in next largest square；If current
Block is not the last one block in largest square；Then：If BlkIndex is 29Integral multiple, then x1=x0-(25-1),y1=
y0+4；If BlkIndex is 28Integral multiple, then x1=x0+4,y1=y0-(24-1)*4；If BlkIndex is 27Integer
Times, then x1=x0-(24-1)*4,y1=y0+4；If BlkIndex is 26Integral multiple, then x1=x0+4,y1=y0-(23-1)*
4；If BlkIndex is 25Integral multiple, then x1=x0-(23-1)*4,y1=y0+4；If BlkIndex is 24Integral multiple,
Then x1=x0+4,y1=y0-(22-1)*4；If BlkIndex is 23Integral multiple, then x1=x0-(22-1)*5,y1=y0+4；Such as
Fruit BlkIndex is 22Integral multiple, then x1=x0+4,y1=y0-4；If the integral multiple that BlkIndex is 2, x1=x0-4,y1
=y0+4；Otherwise, x1=x0+4,y1=y0；Wherein, the sequence that current block and next piece of index are constituted is that scanning generated is suitable
Sequence.
In addition, according to another aspect of the present invention, additionally providing a kind of storage medium.The storage medium includes that machine can
The program code of reading, when executing said program code on information processing equipment, said program code makes at the information
Equipment is managed to execute according to the above method of the present invention.
In addition, in accordance with a further aspect of the present invention, additionally providing a kind of program product.Described program product includes that machine can
The instruction of execution, when executing described instruction on information processing equipment, described instruction executes the information processing equipment
According to the above method of the present invention.
Detailed description of the invention
Referring to reference to the accompanying drawing to the explanation of the embodiment of the present invention, the invention will be more easily understood it is above and
Other objects, features and advantages.Component in attached drawing is intended merely to show the principle of the present invention.In the accompanying drawings, identical or class
As technical characteristic or component will be indicated using same or similar appended drawing reference.In attached drawing：
Fig. 1 shows the non-square block of 32 pixel *, 8 pixel；
Fig. 2 shows the non-square blocks of 32 pixel *, 16 pixel；
Fig. 3 shows the non-square block of 8 pixel *, 32 pixel；
Fig. 4 shows the non-square block of 4 pixel *, 32 pixel；
Fig. 5 shows the topology example of encoder；
Fig. 6 shows the topology example of decoder；
Fig. 7 shows the flow chart of the scanning sequency generation method of embodiment according to the present invention；
Fig. 8 shows the structural block diagram of the scanning sequency generating device of embodiment according to the present invention；And
Fig. 9 shows the schematic frame for the computer that can be used for implementing the method and apparatus of embodiment according to the present invention
Figure.
Specific embodiment
Exemplary embodiment of the invention is described in detail hereinafter in connection with attached drawing.It rises for clarity and conciseness
See, does not describe all features of actual implementation mode in the description.It should be understood, however, that developing any this reality
Much decisions specific to embodiment must be made during embodiment, to realize the objectives of developer,
For example, meeting restrictive condition those of related to system and business, and these restrictive conditions may be with embodiment
It is different and change.In addition, it will also be appreciated that although development is likely to be extremely complex and time-consuming, to benefit
For those skilled in the art of present disclosure, this development is only routine task.
Here, and also it should be noted is that, in order to avoid having obscured the present invention because of unnecessary details, in the accompanying drawings
Illustrate only with closely related apparatus structure and/or processing step according to the solution of the present invention, and be omitted and the present invention
The little other details of relationship.In addition, it may also be noted that being described in an attached drawing of the invention or a kind of embodiment
Elements and features can be combined with elements and features shown in one or more other attached drawings or embodiment.
Firstly, introducing the concept of the Z scanning sequency of non-square block.
Fig. 1-4 shows the example of 4 kinds of non-square blocks.
Fig. 1 shows the non-square block of 32 pixel *, 8 pixel.Wherein, each square is as minimal processing unit
4*4 block of pixels (hereinafter referred to as block).Each piece is marked with serial number.For non-square block shown in FIG. 1, Z scanning sequency is sequence
The sequence that number 1-16 shows.It can be observed that the sequence of the block (similarly, the block etc. of serial number 5-8) of serial number 1-4 constitutes Z-shaped
Type.Largest square in the non-square block is the square that 4 blocks are constituted, the square constituted such as block 1-4.
Fig. 2 shows the non-square blocks of 32 pixel *, 16 pixel.Wherein, each square is as minimal processing unit
4*4 block of pixels.Each piece is marked with serial number.For non-square block shown in Fig. 2, Z scanning sequency is that serial number 1-32 shows
Sequence.It can be observed that the sequence of the block of serial number 1-4 (similarly, the block etc. of serial number 5-8) constitutes Z-shaped.It is non-at this
Largest square in square block is the square that 16 blocks are constituted, the square constituted such as block 1-16.In non-square block
Largest square (largest square of the block for example including serial number 1-16) in scanning sequency (1-4,5-8,9-12,13-
16) Z-shaped is constituted.
Fig. 3 shows the non-square block of 8 pixel *, 32 pixel.Wherein, each square is as minimal processing unit
4*4 block of pixels.Each piece is marked with serial number.For non-square block shown in Fig. 3, Z scanning sequency is that serial number 1-16 shows
Sequentially.It can be observed that the sequence of the block (similarly, the block etc. of serial number 5-8) of serial number 1-4 constitutes Z-shaped.It is non-just at this
Largest square in square block is the square that 4 blocks are constituted, the square constituted such as block 1-4.
Fig. 4 shows the non-square block of 4 pixel *, 32 pixel.Wherein, each square is as minimal processing unit
4*4 block of pixels.Each piece is marked with serial number.For non-square block shown in Fig. 4, it is suitable that Z scanning sequency is that serial number 1-8 shows
Sequence.It can be observed that the sequence of the block of serial number 1-8 constitutes Z-shaped (when being only capable of longitudinal development, it is believed that it is special Z
Font).Largest square in the non-square block is the square that 1 block is constituted, the square constituted such as block 1.
Above-mentioned Fig. 1-4 illustrates only the example of non-square block.Non-square block is without being limited thereto.The purpose of the present invention is energy
Z scanning sequency enough is generated for all non-square blocks, to be used for coding and decoding video.
Fig. 5 shows the topology example of encoder.The image being input in encoder carries out image segmentation first, by its point
It is segmented into the block as minimal processing unit, and generates Z scanning sequency.Then, according to Z scanning sequency, image is carried out in frame
Prediction and inter-prediction, wherein intra prediction can be realized using Angular filter.Then, it according to prediction result, carries out
Model selection.Finally, by the composition encoding code stream output such as pattern information, residual information.
Fig. 6 shows the topology example of decoder.The code stream for being input to decoder carries out code stream analyzing first, from code stream
Extract pattern information, residual information etc..Then, image segmentation is carried out, and generates Z scanning sequency.Then, it is mentioned according in code stream
The pattern information taken carries out model selection.Intra prediction and inter-prediction are carried out with Z scanning sequency according to the mode of selection,
In, intra prediction can be realized using Angular filter.Finally, carrying out image reconstruction according to prediction result and exporting reconstruction
Image.
The present invention is concerned with Fig. 5, the Z scanning sequency generation processing in 6, and the other parts in encoder and decoder are not
It is impacted.
The process of the scanning sequency generation method of embodiment according to the present invention is described below with reference to Fig. 7.
Fig. 7 shows the flow chart of the scanning sequency generation method of embodiment according to the present invention.As shown in fig. 7, this is swept
The method of being sequentially generated is retouched to include the following steps：Determine the largest square in non-square block to be processed so that it is described it is non-just
Square block is made of multiple largest squares, wherein the largest square is by multiple blocks as minimal processing unit
It forms (step S1)；Judge whether current block is the last one block (step S2) in largest square；And according to current block
Coordinate and the index of current block determine next piece of coordinate (step S3).
In step sl, determine the largest square in non-square block to be processed so that the non-square block by
Multiple largest square compositions, wherein the largest square is made of multiple blocks as minimal processing unit.
By taking Fig. 2 as an example, non-square block to be processed is the rectangle of 32 pixel *, 16 pixel.Maximum square is
The square that the block of serial number 1-16 is constituted, rather than the square that the block of serial number 1-4 is constituted.Largest square should meet and make
Non-square block is obtained to be made of multiple largest squares.For example, the 12* that the block of serial number 1,2,5,3,4,7,9,10,13 is constituted
The squares of 12 pixels can not make non-square block by more neither maximum square in non-square block to be processed
The square composition of a 12*12 pixel.
The specific determining method of largest square is with no restrictions.As long as can be realized the requirement of step S1.
In step s 2, judge whether current block is the last one block in largest square.
BOB(beginning of block) from the upper left corner of non-square block to be processed, each piece successively next to determine as current block
Block.Each piece of coordinate is represented by the pixel in the block upper left corner in the coordinate of X-axis (level), Y-axis (vertical).
The setting reason of step S2 be last blocks of next piece in largest square must be it is next it is maximum just
First block in rectangular, inconsistent with the coordinate determination method in step S3 for other pieces, therefore, individually processing is maximum just
The last one block in rectangular.
Since the block in largest square is scanned according to Z-shaped, so the last one block in largest square is maximum
The block in the square lower right corner, first block in largest square are the blocks in the largest square upper left corner.
The coordinate position of the block in the lower right corner of the largest square where the coordinate position and current block of current block
Relationship can carry out the judgement of step S2.
In step s3, next piece of coordinate is determined according to the index of the coordinate of current block and current block.
As described above, current block is opened from the block in (first largest square) upper left corner of non-square block to be processed
Begin, successively determines next piece according to current block.When determining next piece, next piece, as new current block, is continued to determine new
Next piece.
If current block is the last one block in largest square, next piece is first in next largest square
A block.The sequence of multiple largest squares in non-square block constitutes Z-shaped.
If current block is not the last one block in largest square, if the coordinate of current block is (x0,y0), current block
Index be BlkIndex, next piece of coordinate is (x1,y1), next piece of index is BlkIndex+1, then：
If BlkIndex is 29Integral multiple, then x1=x0-(25-1),y1=y0+4；
If BlkIndex is 28Integral multiple, then x1=x0+4,y1=y0-(24-1)*4；
If BlkIndex is 27Integral multiple, then x1=x0-(24-1)*4,y1=y0+4；
If BlkIndex is 26Integral multiple, then x1=x0+4,y1=y0-(23-1)*4；
If BlkIndex is 25Integral multiple, then x1=x0-(23-1)*4,y1=y0+4；
If BlkIndex is 24Integral multiple, then x1=x0+4,y1=y0-(22-1)*4；
If BlkIndex is 23Integral multiple, then x1=x0-(22-1)*5,y1=y0+4；
If BlkIndex is 22Integral multiple, then x1=x0+4,y1=y0-4；
If the integral multiple that BlkIndex is 2, x1=x0-4,y1=y0+4；
Otherwise, x1=x0+4,y1=y0。
In this way, the sequence (index is ascending) that obtained index is constituted is scanning sequency generated.
It is suitable that the scanning sequency generation method of embodiment according to the present invention can be quickly obtained the Z scanning met the requirements
Sequence, and memory overhead can be reduced, complexity is lower.
On scanning sequency generation method basis, the invention proposes a kind of image encoding methods, as described above
The scanning sequency that generates of method, coded treatment is carried out to non-square block to be encoded.
Wherein, the coded treatment includes intra prediction and inter-prediction.
Correspondingly, a kind of image encoder is proposed, for executing image encoding method as described above.
Similarly, a kind of picture decoding method is proposed, the scanning sequency that method generates as described above treats solution
The non-square block of code is decoded processing.
Wherein, the decoding process includes intra prediction and inter-prediction.
Correspondingly, a kind of image decoder is proposed, for executing picture decoding method as described above.
The scanning sequency generating device of embodiment according to the present invention is described next, with reference to Fig. 8.
Fig. 8 shows the structural block diagram of the scanning sequency generating device of embodiment according to the present invention.As shown in figure 8,
Scanning sequency generating device 800 according to the present invention includes：Central processing unit CPU is configured as controlling：It determines to be processed
Largest square in non-square block, so that the non-square block is made of multiple largest squares, wherein described
Largest square is made of multiple blocks as minimal processing unit；If the coordinate of current block is (x0,y0), the index of current block
For BlkIndex, next piece of coordinate is (x1,y1), next piece of index is BlkIndex+1；Judge whether current block is maximum
The last one block in square；If current block is the last one block in largest square；Then next piece is next maximum
First block in square；If current block is not the last one block in largest square；Then：If BlkIndex is 29
Integral multiple, then x1=x0-(25-1),y1=y0+4；If BlkIndex is 28Integral multiple, then x1=x0+4,y1=y0-(24-
1)*4；If BlkIndex is 27Integral multiple, then x1=x0-(24-1)*4,y1=y0+4；If BlkIndex is 26Integer
Times, then x1=x0+4,y1=y0-(23-1)*4；If BlkIndex is 25Integral multiple, then x1=x0-(23-1)*4,y1=y0+
4；If BlkIndex is 24Integral multiple, then x1=x0+4,y1=y0-(22-1)*4；If BlkIndex is 23Integral multiple,
Then x1=x0-(22-1)*5,y1=y0+4；If BlkIndex is 22Integral multiple, then x1=x0+4,y1=y0-4；If
BlkIndex is 2 integral multiple, then x1=x0-4,y1=y0+4；Otherwise, x1=x0+4,y1=y0；Wherein, current block and next piece
Index constitute sequence be scanning sequency generated.
In one embodiment, current block and next piece of size are 4*4 pixel.
In one embodiment, first block in largest square is the block in the upper left corner in largest square, maximum
The last one block in square is the block in the lower right corner in largest square.
In one embodiment, multiple pieces of scanning sequency in non-square block constitutes Z-shaped.
In addition, it is still necessary to, it is noted that each component devices, unit can be by softwares, firmware, hard in above equipment here
The mode of part or combinations thereof is configured.It configures workable specific means or mode is well known to those skilled in the art,
This is repeated no more.In the case where being realized by software or firmware, from storage medium or network to specialized hardware structure
Computer (such as general purpose computer 900 shown in Fig. 9) installation constitutes the program of the software, which is being equipped with various journeys
When sequence, it is able to carry out various functions etc..
Fig. 9 shows the schematic frame for the computer that can be used for implementing the method and apparatus of embodiment according to the present invention
Figure.
In Fig. 9, central processing unit (CPU) 901 is according to the program stored in read-only memory (ROM) 902 or from depositing
The program that storage part 908 is loaded into random access memory (RAM) 903 executes various processing.In RAM 903, also according to need
Store the data required when CPU 901 executes various processing etc..CPU 901, ROM 902 and RAM 903 are via bus
904 are connected to each other.Input/output interface 905 is also connected to bus 904.
Components described below is connected to input/output interface 905：Importation 906 (including keyboard, mouse etc.), output section
Divide 907 (including display, such as cathode-ray tube (CRT), liquid crystal display (LCD) etc. and loudspeakers etc.), storage section
908 (including hard disks etc.), communications portion 909 (including network interface card such as LAN card, modem etc.).Communications portion 909
Communication process is executed via network such as internet.As needed, driver 910 can be connected to input/output interface 905.
Detachable media 911 such as disk, CD, magneto-optic disk, semiconductor memory etc., which can according to need, is installed in driver
On 910, so that the computer program read out is mounted to as needed in storage section 908.
It is such as removable from network such as internet or storage medium in the case where series of processes above-mentioned by software realization
Unload the program that the installation of medium 911 constitutes software.
It will be understood by those of skill in the art that this storage medium be not limited to it is shown in Fig. 9 be wherein stored with program,
Separately distribute with equipment to provide a user the detachable media 911 of program.The example of detachable media 911 includes disk
(including floppy disk (registered trademark)), CD (including compact disc read-only memory (CD-ROM) and digital versatile disc (DVD)), magneto-optic disk
(including mini-disk (MD) (registered trademark)) and semiconductor memory.Alternatively, storage medium can be ROM 902, storage section
Hard disk for including in 508 etc., wherein computer program stored, and user is distributed to together with the equipment comprising them.
The present invention also proposes a kind of program product of instruction code for being stored with machine-readable.Described instruction code is by machine
When device reads and executes, method that above-mentioned embodiment according to the present invention can be performed.
Correspondingly, it is also wrapped for carrying the storage medium of the program product of the above-mentioned instruction code for being stored with machine-readable
It includes in disclosure of the invention.The storage medium includes but is not limited to floppy disk, CD, magneto-optic disk, storage card, memory stick etc.
Deng.
In the description above to the specific embodiment of the invention, for the feature a kind of embodiment description and/or shown
It can be used in one or more other embodiments in a manner of same or similar, with the feature in other embodiment
It is combined, or the feature in substitution other embodiment.
It should be emphasized that term "comprises/comprising" refers to the presence of feature, element, step or component when using herein, but simultaneously
It is not excluded for the presence or additional of one or more other features, element, step or component.
In addition, method of the invention be not limited to specifications described in time sequencing execute, can also according to it
His time sequencing, concurrently or independently execute.Therefore, the execution sequence of method described in this specification is not to this hair
Bright technical scope is construed as limiting.
Although being had been disclosed above by the description to specific embodiments of the present invention to the present invention, it answers
The understanding, above-mentioned all embodiments and example are exemplary, and not restrictive.Those skilled in the art can be in institute
Design is to various modifications of the invention, improvement or equivalent in attached spirit and scope of the claims.These modification, improve or
Person's equivalent should also be as being to be considered as included in protection scope of the present invention.
Claims (10)
1. a kind of scanning sequency generation method, including：
The largest square in non-square block to be processed is determined, so that the non-square block is by multiple described maximum square
Shape composition, wherein the largest square is made of multiple blocks as minimal processing unit；
If the coordinate of current block is (x0,y0), the index of current block is BlkIndex, and next piece of coordinate is (x1,y1), next piece
Index be BlkIndex+1；
Judge whether current block is the last one block in largest square；
If current block is the last one block in largest square；Then next piece is first in next largest square
Block；
If current block is not the last one block in largest square；Then：
If BlkIndex is 29Integral multiple, then x1=x0-(25-1),y1=y0+4；
If BlkIndex is 28Integral multiple, then x1=x0+4,y1=y0-(24-1)*4；
If BlkIndex is 27Integral multiple, then x1=x0-(24-1)*4,y1=y0+4；
If BlkIndex is 26Integral multiple, then x1=x0+4,y1=y0-(23-1)*4；
If BlkIndex is 25Integral multiple, then x1=x0-(23-1)*4,y1=y0+4；
If BlkIndex is 24Integral multiple, then x1=x0+4,y1=y0-(22-1)*4；
If BlkIndex is 23Integral multiple, then x1=x0-(22-1)*5,y1=y0+4；
If BlkIndex is 22Integral multiple, then x1=x0+4,y1=y0-4；
If the integral multiple that BlkIndex is 2, x1=x0-4,y1=y0+4；
Otherwise, x1=x0+4,y1=y0；
Wherein, the sequence that current block and next piece of index are constituted is scanning sequency generated.
2. the method for claim 1, wherein current block and next piece of size are 4*4 pixel.
3. the method for claim 1, wherein first block in largest square is the upper left corner in largest square
Block, the last one block in largest square is the block in the lower right corner in largest square.
4. the method for claim 1, wherein multiple pieces of scanning sequency in non-square block constitutes Z-shaped.
5. a kind of image encoding method, according to the scanning sequency that the method as described in one of claim 1-4 generates, to be encoded
Non-square block carry out coded treatment.
6. method as claimed in claim 5, wherein the coded treatment includes intra prediction and inter-prediction.
7. a kind of scanning sequency generating device, including：
Central processing unit CPU is configured as controlling：
The largest square in non-square block to be processed is determined, so that the non-square block is by multiple described maximum square
Shape composition, wherein the largest square is made of multiple blocks as minimal processing unit；
If the coordinate of current block is (x0,y0), the index of current block is BlkIndex, and next piece of coordinate is (x1,y1), next piece
Index be BlkIndex+1；
Judge whether current block is the last one block in largest square；
If current block is the last one block in largest square；Then next piece is first in next largest square
Block；
If current block is not the last one block in largest square；Then：
If BlkIndex is 29Integral multiple, then x1=x0-(25-1),y1=y0+4；
If BlkIndex is 28Integral multiple, then x1=x0+4,y1=y0-(24-1)*4；
If BlkIndex is 27Integral multiple, then x1=x0-(24-1)*4,y1=y0+4；
If BlkIndex is 26Integral multiple, then x1=x0+4,y1=y0-(23-1)*4；
If BlkIndex is 25Integral multiple, then x1=x0-(23-1)*4,y1=y0+4；
If BlkIndex is 24Integral multiple, then x1=x0+4,y1=y0-(22-1)*4；
If BlkIndex is 23Integral multiple, then x1=x0-(22-1)*5,y1=y0+4；
If BlkIndex is 22Integral multiple, then x1=x0+4,y1=y0-4；
If the integral multiple that BlkIndex is 2, x1=x0-4,y1=y0+4；
Otherwise, x1=x0+4,y1=y0；
Wherein, the sequence that current block and next piece of index are constituted is scanning sequency generated.
8. equipment as claimed in claim 7, wherein current block and next piece of size are 4*4 pixel.
9. equipment as claimed in claim 7, wherein first block in largest square is the upper left corner in largest square
Block, the last one block in largest square is the block in the lower right corner in largest square.
10. equipment as claimed in claim 7, wherein multiple pieces of scanning sequency in non-square block constitutes Z-shaped.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710321531.4A CN108881909A (en) | 2017-05-09 | 2017-05-09 | Scanning sequency generation method and scanning sequency generating device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710321531.4A CN108881909A (en) | 2017-05-09 | 2017-05-09 | Scanning sequency generation method and scanning sequency generating device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108881909A true CN108881909A (en) | 2018-11-23 |
Family
ID=64287492
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710321531.4A Pending CN108881909A (en) | 2017-05-09 | 2017-05-09 | Scanning sequency generation method and scanning sequency generating device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108881909A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111770338A (en) * | 2020-07-22 | 2020-10-13 | 腾讯科技（深圳）有限公司 | Method, device and equipment for determining index value of coding unit and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2012005551A2 (en) * | 2010-07-09 | 2012-01-12 | 삼성전자 주식회사 | Method and apparatus for entropy encoding/decoding a transform coefficient |
| CN104247420A (en) * | 2012-04-16 | 2014-12-24 | 高通股份有限公司 | Transform coefficient coding |
| US20150071359A1 (en) * | 2013-09-09 | 2015-03-12 | Qualcomm Incorporated | Two level last significant coefficient (lsc) position coding |
| CN104539968A (en) * | 2009-08-14 | 2015-04-22 | 三星电子株式会社 | A method and apparatus for decoding a video |
| CN104853196A (en) * | 2014-02-18 | 2015-08-19 | 华为技术有限公司 | Coding and decoding method and device |
-
2017
- 2017-05-09 CN CN201710321531.4A patent/CN108881909A/en active Pending
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104539968A (en) * | 2009-08-14 | 2015-04-22 | 三星电子株式会社 | A method and apparatus for decoding a video |
| WO2012005551A2 (en) * | 2010-07-09 | 2012-01-12 | 삼성전자 주식회사 | Method and apparatus for entropy encoding/decoding a transform coefficient |
| CN104247420A (en) * | 2012-04-16 | 2014-12-24 | 高通股份有限公司 | Transform coefficient coding |
| US20150071359A1 (en) * | 2013-09-09 | 2015-03-12 | Qualcomm Incorporated | Two level last significant coefficient (lsc) position coding |
| CN104853196A (en) * | 2014-02-18 | 2015-08-19 | 华为技术有限公司 | Coding and decoding method and device |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111770338A (en) * | 2020-07-22 | 2020-10-13 | 腾讯科技（深圳）有限公司 | Method, device and equipment for determining index value of coding unit and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Guo et al. | Image inpainting via conditional texture and structure dual generation | |
| Komodakis et al. | Image completion using efficient belief propagation via priority scheduling and dynamic pruning | |
| CN113658051B (en) | Image defogging method and system based on cyclic generation countermeasure network | |
| Barnes et al. | PatchMatch: A randomized correspondence algorithm for structural image editing | |
| JP4579987B2 (en) | Coding method of data stream representing temporally changing graphic model | |
| US8593455B2 (en) | Method and system for compressing and decoding mesh data with random accessibility in three-dimensional mesh model | |
| JP2018129036A (en) | Completion of image | |
| WO2009142333A1 (en) | Image processing method, image processing apparatus, image processing program, and memory medium | |
| CN111696029A (en) | Virtual image video generation method and device, computer equipment and storage medium | |
| Ting et al. | Image inpainting by global structure and texture propagation | |
| Cabral et al. | Structure‐Preserving Reshape for Textured Architectural Scenes | |
| CN108881909A (en) | Scanning sequency generation method and scanning sequency generating device | |
| CN114385181A (en) | Data processing method, device and equipment and computer storage medium | |
| AU2011205085B2 (en) | 2D region rendering | |
| JP2001244819A (en) | Digital signal encoding accompanied by tile division | |
| WO2020121678A1 (en) | Mini-batch learning device, operating program for mini-batch learning device, operating method for mini-batch learning device, and image processing device | |
| CN105096351B (en) | Image deblocking effect treating method and apparatus | |
| US20230186608A1 (en) | Method, device, and computer program product for video processing | |
| GB2571818A (en) | Selecting encoding options | |
| CN110766117A (en) | Two-dimensional code generation method and system | |
| CN112215754B (en) | Image amplifying method, device, electronic equipment and storage medium | |
| CN112102216B (en) | Self-adaptive weight total variation image fusion method | |
| CN104794686A (en) | Image smoothing method and image smoothing device | |
| CN110706167B (en) | Fine completion processing method and device for remote sensing image to-be-repaired area | |
| KR101975404B1 (en) | Apparatus and method for generating procedural content |
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 | ||
| WD01 | Invention patent application deemed withdrawn after publication | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20181123 |