CN102970534A - Image cutting system and method - Google Patents
Image cutting system and method Download PDFInfo
- Publication number
- CN102970534A CN102970534A CN2012104537524A CN201210453752A CN102970534A CN 102970534 A CN102970534 A CN 102970534A CN 2012104537524 A CN2012104537524 A CN 2012104537524A CN 201210453752 A CN201210453752 A CN 201210453752A CN 102970534 A CN102970534 A CN 102970534A
- Authority
- CN
- China
- Prior art keywords
- block
- current
- cutting
- image
- lcu
- 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
Images
Abstract
Provided is an image cutting system and method. The system is used for obtaining a largest coding unit (LCU) in an image, wherein the LCU comprises a plurality of coding unit (CU) blocks; calculating pixel variances of current CU blocks; judging whether the current CU blocks need to be cut continuously according to the pixel variances in the current CU blocks; and cutting the current CU blocks into four secondary CU blocks same in size if the current CU blocks need to be cut continuously, and stopping cutting the current CU blocks if the current CU blocks do not need to be cut continuously. By means of the image cutting system and method, calculating amount can be reduced, and LCU cutting is accelerated.
Description
Technical field
The present invention relates to a kind of image compression system and method, relate in particular to image diced system and method in a kind of image compression.
Background technology
In April, 2010, Joint Collaborative Team on Video Coding(JCT-VC) takes up in compress technique efficient video coding (the HighEfficiency Video Coding of research a new generation, namely H.265/HEVC), its objective is and become follow-on compression standard.Compared to present compress technique H.264, its target is for reducing by 50% bit rate (Bit rate), and its image quality of while and computation complexity have also promoted 3 times.General research direction is at present: promote compression efficiency, improve coding correctness and error recovery capabilities, reduction computing time and computation complexity.
In the coding flow process, image or picture can be cut into maximum coding unit (the Largest Coding Unit of a plurality of fixed sizes, LCU), then can cut into the framework recurrence of four minutes trees the coding unit (Coding Units, CU) of different sizes in each LCU to carry out pixel prediction.Also can judge cutting mode best in this LCU in the process of recurrence cutting, the optimum Cutting mode after recurrence finishes in this LCU will be determined.In this recursive procedure, owing to tested the CU of each different size with the cutting mode of definite the best, the operation time that it is spent and computational complexity thereof are quite high and to be improved.
Summary of the invention
In view of above content, be necessary to provide a kind of image diced system, it can utilize brightness and color information in the image to prejudge the interior cutting mode of LCU, to reach the purpose that reduces amount of calculation and accelerate the LCU cutting.
In view of above content, be necessary to provide a kind of image cutting method, it can utilize brightness and color information in the image to prejudge the interior cutting mode of LCU, to reach the purpose that reduces amount of calculation and accelerate the LCU cutting.
A kind of image diced system is applied to electronic installation, and this system comprises: computing module, and for a maximum coding unit LCU who obtains an image, this LCU comprises a plurality of coding unit CU blocks; Described computing module is also for the pixel variance that calculates current C U block; Judge module is used for judging according to the pixel variance of current C U block whether needs continue cutting to current C U block; Cutting module need to continue cutting if be used for current C U block, then current C U block is cut into four onesize inferior CU blocks, if current C U block does not need to continue cutting, then ends cutting current C U block.
A kind of image cutting method is applied to electronic installation, and the method comprises: calculation procedure one, obtain a maximum coding unit LCU in the image, and this LCU comprises a plurality of coding unit CU blocks; Calculation procedure two, the pixel variance of calculating current C U block; Determining step judges according to the pixel variance of current C U block whether needs continue cutting to current C U block; Cutting step if current C U block need to continue cutting, then cuts into current C U block four onesize inferior CU blocks, if current C U block does not need to continue cutting, then ends cutting current C U block.
Compared to prior art, described image diced system and method, it can utilize brightness and color information in the image to prejudge the interior cutting mode of LCU, reduces amount of calculation and accelerates the LCU cutting.
Description of drawings
Fig. 1 is the running environment schematic diagram of image diced system of the present invention.
Fig. 2 is the functional block diagram of image diced system.
Fig. 3 A and Fig. 3 B are the flow charts of the first embodiment of image cutting method of the present invention.
Fig. 4 is the schematic diagram of zigzag processing sequence.
Fig. 5 is the schematic diagram that the 2N * 2N among Fig. 4 is fused into 4N * 4N block.
Fig. 6 is the schematic diagram that the 4N * 4N among Fig. 5 is fused into 8N * 8N block.
Fig. 7 is the flow chart of the second embodiment of image cutting method of the present invention.
Fig. 8 is the schematic diagram that current C U block is carried out the image cutting.
The main element symbol description
| |
2 |
| Display device | 20 |
| Input equipment | 22 |
| Memory | 23 |
| The image diced system | 24 |
| Processor | 25 |
| The first cutting module | 240 |
| Computing module | 241 |
| Judge module | 242 |
| Fusion Module | 243 |
| The second cutting module | 244 |
| Prediction module | 245 |
Embodiment
As shown in Figure 1, be the running environment schematic diagram of image diced system of the present invention.This image diced system 24 runs in the electronic installation 2.This electronic installation 2 also comprises display device 20, input equipment 22, memory 23 and the processor 25 that links to each other by data/address bus.Described electronic installation 2 can be computer, mobile phone, PDA(Personal Digital Assistant, personal digital assistant) etc.
Described memory 23 is for data such as the program code of storing described image diced system 24 and images.Described display device 20 is used for showing the data such as described image, the LCDs that this display device 20 can be computer, the touch-screen of mobile phone etc.Described input equipment 22 is used for the various data that the input user arranges, for example, and keyboard, mouse etc.
Described image diced system 24 is used for utilizing the brightness of image and the cutting mode that the color information is prejudged each block in the LCU, when the color information consistency of the pixel in judging certain block is higher, stops to continue this block of cutting, and detailed process is following to be described.
In the present embodiment, described image diced system 24 can be divided into one or more modules, described one or more module is stored in the described memory 23 and is configured to and carried out by one or more processors (present embodiment is a processor 25), to finish the present invention.For example, consult shown in Figure 2ly, described image diced system 24 is divided into the first cutting module 240, computing module 241, judge module 242, Fusion Module 243, the second cutting module 244 and prediction module 245.The alleged module of the present invention is to finish the program segment of a specific function, is more suitable in describing the implementation of software in electronic installation 2 than program.The concrete function of each module is described below with reference to Fig. 3 A and Fig. 3 B.
Shown in Fig. 3 A and Fig. 3 B, it is the flow chart of the first embodiment of image cutting method of the present invention.
Step S10, the first cutting module 240 obtain an image from memory 23 or other electronic equipment, a maximum coding unit in this image (Largest Coding Unit, LCU) is cut into a plurality of 2N * 2N block.Being appreciated that the LCU that comprises a plurality of fixed sizes in the image, is 64 * 64 such as size, and present embodiment describes so that a LCU is cut into example.In the present embodiment, N=8.For example, consult shown in Figure 4ly, this LCU is cut into the block of 16 16 * 16 sizes.
Step S11, computing module 241 calculate the variance of population number (Populationvariance is hereinafter referred to as " pixel variance ") of pixel average and the pixel of each 2N * 2N block according to zigzag order (consulting shown in Figure 4).In the present embodiment, described pixel average for the brightness of each pixel (be the GTG value, mean value Luma).The colored information (Chroma) that in other embodiments, also can add pixel is come calculating pixel mean value.
Wherein, the pixel variance of each 2N * 2N block is defined as square totalling of difference of the pixel average of the GTG value of each pixel in this block and this block, divided by the total number of the pixel in this block.To calculate the GTG value as example, suppose N=8, then computing module 241 is processed each 16 * 16 block, calculate the grey scale average value of its interior 256 pixels, as the pixel average of this block, and just can calculate the pixel variance of this block after the pixel average of complete 16 * 16 blocks of every calculating.
Step S12, judge module 242 obtains a current 2N * 2N block (such as the block 1 among Fig. 4) successively according to the zigzag order, the pixel variance of judging current 2N * 2N block whether less than default threshold values (for example: 400), to determine the cutting mode of current 2N * 2N block.Described cutting mode comprises the cutting that continues cutting current 2N * 2N block and end current 2N * 2N block.
If the pixel variance of current 2N * 2N block is more than or equal to default threshold values, the consistency that namely represents pixel gray level value in current 2N * 2N block is lower, judges that then current 2N * 2N block need to continue cutting, execution in step S13.
If the pixel variance of current 2N * 2N block is less than default threshold values, the consistency that namely represents pixel gray level value in current 2N * 2N block is higher, judge that then current 2N * 2N block does not need to continue cutting, execution in step S14 continues to judge whether this LCU needs to carry out upwards mixing operation.In the present embodiment, described mixing operation comprises the fusion first time (corresponding step S14-S18) of 2N * 2N block, and the fusion second time of 4N * 4N block (corresponding step S19-S23).
Step S13, judge module 242 determines that current 2N * 2N block need to continue to be cut into the N of four formed objects * N block.Then, execution in step S14 continues to judge whether this LCU needs to carry out mixing operation.
Step S14, Fusion Module 243 judge whether current 2N * 2N block belongs to the last block of current 4N * 4N block.For example, consult shown in Figure 4ly, suppose that current 2N * 2N block is block 1, then current 4N * 4N block comprises: block 1, block 2, block 5, block 6.
If current 2N * 2N block does not belong to the last block of current 4N * 4N block, execution in step S15 then, Fusion Module 243 is chosen next 2N * 2N block as new current 2N * 2N block according to the zigzag order from this LCU, then, flow process is returned step S12.
If current 2N * 2N block belongs to the last block of current 4N * 4N block, execution in step S16 then, Fusion Module 243 continues to judge whether contain N * N block in current 4N * 4N block, judges that namely that whether a 2N * 2N block is arranged in current 4N * 4N block is divided.If current 4N * 4N block includes N * N block, then representing has a 2N * 2N block divided in current 4N * 4N block, and flow performing step S19 continues to judge and merges the second time whether this LCU needs to carry out 4N * 4N block.
If do not contain N * N block in current 4N * 4N block, then represent in current 4N * 4N block 2N * the 2N block does not have divided, execution in step S17, Fusion Module 243 judges whether the pixel average of 4 interior 2N of current 4N * 4N block * 2N block is close, for example, pixel average differs in 20.
If the deviation of the pixel average of per two 2N in current 4N * 4N block * 2N block is all less than preset value (such as 20), the pixel average of then judging 4 interior 2N of current 4N * 4N block * 2N block is close, execution in step S18, Fusion Module 243 is carried out the fusion first time of 2N * 2N block, is about to 4 interior 2N of current 4N * 4N block * 2N block and is fused into a block.For example, the block (consulting shown in Figure 5) of a 4N * 4N size will will be formed after block shown in Figure 41, block 2, block 5 and block 6 fusions.Then, flow performing step S19.
If the deviation of the pixel average of certain two 2N * 2N block of existence is more than or equal to this preset value in current 4N * 4N block, the pixel average of then judging 4 interior 2N of current 4N * 4N block * 2N block is not close, execution in step S19, Fusion Module 243 judge whether current 2N * 2N block belongs to the last block of current 8N * 8N block (i.e. this LCU).For example, consult shown in Figure 4ly, the last block of current 8N * 8N block is block 16, i.e. the last block of this LCU.
If current 2N * 2N block does not belong to the last block of current 8N * 8N block, execution in step S20 then, Fusion Module 243 is according to the zigzag order, from this LCU, choose first 2N in next 4N * 4N block * 2N block as new current 2N * 2N block, then, flow process is returned step S 12.For example, consult shown in Figure 4ly, next 4N * 4N block comprises block 3, block 4, block 7, block 8, and new current 2N * 2N block is block 3.
If current 2N * 2N block belongs to the last block of current 8N * 8N block, execution in step S21 then, Fusion Module 243 continues to judge the block (comprising N * N block or 2N * 2N block) that whether contains in current 8N * 8N block below 4N * 4N, judges namely whether 2N among this LCU * 2N block all is fused into 4N * 4N block.If current 8N * 8N block includes the following block of 4N * 4N, then represent 2N among this LCU * 2N block and all be not fused into 4N * 4N block, Fusion Module 243 is judged and is merged flow performing step S24 the second time that need not to carry out 4N * 4N block.
If do not contain the following block of 4N * 4N in current 8N * 8N block, then represent 2N among this LCU * 2N block and all be fused into 4N * 4N block, execution in step S22, Fusion Module 243 judges whether the pixel average of 4 interior 4N of current 8N * 8N block * 4N block is close, for example, pixel average differs in 20.
Step S23, if the deviation of the pixel average of per two 4N in current 8N * 8N block * 4N block is all less than preset value (such as 20), the pixel average of then judging 4 interior 4N of current 8N * 8N block * 4N block is close, Fusion Module 243 is carried out the fusion second time of 4N * 4N block, 4 4N in current 8N * 8N block * 4N block is fused into a block, judges that namely this LCU does not need to do cutting again.Then, flow performing step S24.For example, the block of a 8N * 8N size will will be formed after 4 4N shown in Figure 6 * 4N block fusion.
If the deviation of the pixel average of certain two 4N * 4N block of existence is more than or equal to this preset value in current 8N * 8N block, the pixel average of then judging 4 interior 4N of current 8N * 8N block * 4N block is not close, Fusion Module 243 is judged the fusion second time that need not to carry out 4N * 4N block, flow performing step S24.
Step S24, the second cutting module 244 cuts LCU according to predetermined cutting mode among the above-mentioned steps S13, has saved the flow process of four minutes tree recursive methods cutting.Then, 245 couples of these LCU of prediction module carry out pixel prediction, for example, the N after cutting apart * N block are carried out pixel prediction.Wherein, described pixel prediction comprises that infra-frame prediction (IntraPrediction) and frame predict (Inter Prediction) outward.
In the present embodiment, 245 need of prediction module carry out pixel prediction for each block after cutting, but not do four minutes tree recurrence the block of various different sizes is predicted, set recursive operation and the amount of calculation of pixel prediction and the time of expending thereof in four minutes so can save.In addition, because the present invention has the block of carrying out mixing operation simultaneously when carrying out the block cutting, for the lower image of complexity, because the color information between block is comparatively approaching, thus easily be fused into larger block, thus number of times and the time of prediction reduced.
In above-mentioned the first embodiment, cutting operation and mixing operation carry out simultaneously, in a second embodiment, also can only carry out cutting operation (consulting shown in Figure 7).
As shown in Figure 7, be the flow chart of the second embodiment of image cutting method of the present invention.
Step S30, computing module 241 obtain an image from memory 23 or other electronic equipment, and obtain the maximum coding unit (Largest Coding Unit, LCU) in this image.Being appreciated that the LCU that comprises a plurality of fixed sizes in the image, is 64 * 64 such as size, and present embodiment describes so that a LCU is cut into example.When this image was encoded, each LCU cut into coding unit (Coding Units, the CU) block of different sizes with the framework recurrence of four minutes trees.
Be appreciated that size is different at the CU block of different levels recurrence generation and the CU block ratio on upper strata.For example, consult shown in Figure 8ly, this LCU is cut into four CU blocks during recurrence for the first time, and wherein, first CU block is continued to cut into again four less inferior CU blocks.
Step S31, computing module 241 calculates the pixel variance of current C U block.
Step S32, judge module 242 judges that according to the pixel variance of current C U block the whether needs of current C U block continue cutting.Wherein, for the first time during cutting operation, current C U block is whole LCU.
Particularly, (for example: 400), then judge module 242 judges that current C U block need to continue cutting (consulting the CU block " b " among Fig. 8), execution in step S33 if the pixel variance of current C U block is more than or equal to default threshold values.If the pixel variance of current C U block is less than default threshold values, then judge module 242 judges that current C U block does not need to continue down cutting, namely ends the cutting (consulting the CU block " h " among Fig. 8) of current C U block, execution in step S35.
Step S33, the second cutting module 244 cuts into four onesize inferior CU blocks with current C U block.Consult shown in Figure 8ly, when cutting for the first time, current C U block is cut into four the inferior CU block " b ", " g ", " h ", " i " that wait size.
Step S34, the second cutting module 244 choose the upper left degree CU block of current C U block as new current C U block, and then, flow process is returned step S31.Consult shown in Figure 8, after current C U block is cut into four inferior CU blocks " b " that wait size, " g ", " g ", " i ", the second cutting module 244 is chosen time CU block " c " as new current C U block, continue down cutting, wherein, inferior CU block " b " continues to cut into four inferior CU block " c ", " d ", " e ", " f " that wait size.
Step S35, the second cutting module 244 is ended the cutting of current C U block, and 245 couples of current C U of prediction module block carries out pixel prediction.Wherein, described pixel prediction comprises that infra-frame prediction (Intra Prediction) and frame predict (Inter Prediction) outward.In the present embodiment, only carry out infra-frame prediction.
Step S36, the second cutting module 244 judge whether the CU block among this LCU is all predicted complete.If the CU block among this LCU all prediction is complete, then flow process finishes.If the CU block that also has among this LCU is predicted, then continue execution in step S37.
Step S37, the second cutting module 244 is chosen next CU block as new current C U block according to the zigzag order from this LCU.For example, consult shown in Figure 8ly, according to the zigzag order, if current C U block " e " prediction is complete, then choose the CU block " f " identical with current C U block " e " size as new current C U block.If current C U block " f " prediction is complete, then choose CU block " g " with the sizes such as last layer (being block " b ") of current C U block " f " as new current C U block.
In a second embodiment, adopt the mode of the cutting while judging to carry out, be 241 pixel variances that calculate current C U block of each computing module, judge module 242 is determined the cutting mode (continue cutting or end cutting) of this current CU block according to result of calculation.Then, the cutting mode that the second cutting module 244 is determined according to judge module 242 determines it is to continue cutting current C U block, still ends the cutting of current C U block.
In other embodiments, computing module 241 also can calculate first the pixel variance of each CU block of this LCU, and judge module 242 pre-determines the cutting mode of each CU block in this LCU according to result of calculation.Then, the second cutting module 244 is according to the cutting mode of predetermined each CU block, and the CU block that needs are cut cuts, and the flow process of concrete cutting process and the second embodiment is basic identical, does not repeat them here.
In the present embodiment, described mixing operation comprises that merge with the first time of 2N * 2N block and merge with the second time of 4N * 4N block.In the 3rd embodiment, also can only carry out for the first time and merge, merge if only carry out for the first time, then when step S16 judged result be "Yes" or after step S17 judged result is "No" or execution in step S18, continue to judge whether current 2N * 2N block belongs to the last block of this LCU.
If current 2N * 2N block belongs to the last block of this LCU, then execution in step S24.If current 2N * 2N block does not belong to the last block of this LCU, then Fusion Module 243 is chosen next 2N * 2N block as new current 2N * 2N block according to the zigzag order from this LCU, and then, flow process is returned step S 12.
It should be noted that at last, above embodiment is only unrestricted in order to technical scheme of the present invention to be described, although with reference to preferred embodiment the present invention is had been described in detail, those of ordinary skill in the art is to be understood that, can make amendment or be equal to replacement technical scheme of the present invention, and not break away from the spirit and scope of technical solution of the present invention.
Claims (12)
1. an image diced system is applied to electronic installation, it is characterized in that, this system comprises:
Computing module, for a maximum coding unit LCU who obtains an image, this LCU comprises a plurality of coding unit CU blocks;
Described computing module is also for the pixel variance that calculates current C U block;
Judge module is used for judging according to the pixel variance of current C U block whether needs continue cutting to current C U block; And
Cutting module need to continue cutting if be used for current C U block, then current C U block is cut into four onesize inferior CU blocks, if current C U block does not need to continue cutting, then ends cutting current C U block.
2. image diced system as claimed in claim 1, it is characterized in that, the pixel variance of described current C U block is square totalling of GTG value with the difference of the pixel average of this current CU block of each pixel in this current CU block, divided by the total number of pixel in this current CU block.
3. image diced system as claimed in claim 1 is characterized in that, described judge module judges whether current C U block needs to continue cutting and comprise:
If the pixel variance of current C U block, judges then that current C U block need to continue cutting more than or equal to default threshold values;
If less than default threshold values, then judging, the pixel variance of current C U block ends cutting current C U block.
4. image diced system as claimed in claim 1 is characterized in that, described cutting module also is used for:
After current C U block being cut into four onesize inferior CU blocks, choose the upper left degree CU block of current C U block as new current C U block.
5. image diced system as claimed in claim 1 is characterized in that, this system also comprises:
Prediction module is used for after ending cutting current C U block current C U block being carried out pixel prediction.
6. image diced system as claimed in claim 5 is characterized in that, described cutting module also is used for:
After judging termination cutting current C U block, continue to judge whether the CU block among this LCU is all predicted complete;
If also have the CU block to predict among this LCU, then from this LCU, choose next CU block as new current C U block according to the zigzag order.
7. an image cutting method is applied to electronic installation, it is characterized in that the method comprises:
Calculation procedure one is obtained a maximum coding unit LCU in the image, and this LCU comprises a plurality of coding unit CU blocks;
Calculation procedure two, the pixel variance of calculating current C U block;
Determining step judges according to the pixel variance of current C U block whether needs continue cutting to current C U block; And
Cutting step if current C U block need to continue cutting, then cuts into current C U block four onesize inferior CU blocks, if current C U block does not need to continue cutting, then ends cutting current C U block.
8. image cutting method as claimed in claim 7, it is characterized in that, the pixel variance of described current C U block is square totalling of GTG value with the difference of the pixel average of this current CU block of each pixel in this current CU block, divided by the total number of pixel in this current CU block.
9. image cutting method as claimed in claim 7 is characterized in that, described determining step comprises:
If the pixel variance of current C U block, judges then that current C U block need to continue cutting more than or equal to default threshold values;
If less than default threshold values, then judging, the pixel variance of current C U block ends cutting current C U block.
10. image cutting method as claimed in claim 7 is characterized in that the method also comprises:
After current C U block being cut into four onesize inferior CU blocks, choose the upper left degree CU block of current C U block as new current C U block.
11. image cutting method as claimed in claim 7 is characterized in that the method also comprises:
Prediction steps after ending cutting current C U block, is carried out pixel prediction to current C U block.
12. image cutting method as claimed in claim 11 is characterized in that the method also comprises:
After judging termination cutting current C U block, continue to judge whether the CU block among this LCU is all predicted complete;
If also have the CU block to predict among this LCU, then from this LCU, choose next CU block as new current C U block according to the zigzag order.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012104537524A CN102970534A (en) | 2012-11-13 | 2012-11-13 | Image cutting system and method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2012104537524A CN102970534A (en) | 2012-11-13 | 2012-11-13 | Image cutting system and method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102970534A true CN102970534A (en) | 2013-03-13 |
Family
ID=47800378
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2012104537524A Pending CN102970534A (en) | 2012-11-13 | 2012-11-13 | Image cutting system and method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102970534A (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112218098A (en) * | 2020-09-23 | 2021-01-12 | 欧菲微电子技术有限公司 | Data compression method and device, electronic equipment and storage medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1901679A (en) * | 2005-07-21 | 2007-01-24 | 海信集团有限公司 | Method for information selecting and dividing based on micro block inner edge |
| US20080101707A1 (en) * | 2006-10-30 | 2008-05-01 | Debargha Mukherjee | Method for decomposing a video sequence frame |
| CN101827268A (en) * | 2010-04-30 | 2010-09-08 | 北京航空航天大学 | Object-based fractal video compression and decompression method |
| CN102761742A (en) * | 2012-07-03 | 2012-10-31 | 华为技术有限公司 | Transform block division method and transform block division parameter coding/decoding method |
-
2012
- 2012-11-13 CN CN2012104537524A patent/CN102970534A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1901679A (en) * | 2005-07-21 | 2007-01-24 | 海信集团有限公司 | Method for information selecting and dividing based on micro block inner edge |
| US20080101707A1 (en) * | 2006-10-30 | 2008-05-01 | Debargha Mukherjee | Method for decomposing a video sequence frame |
| CN101827268A (en) * | 2010-04-30 | 2010-09-08 | 北京航空航天大学 | Object-based fractal video compression and decompression method |
| CN102761742A (en) * | 2012-07-03 | 2012-10-31 | 华为技术有限公司 | Transform block division method and transform block division parameter coding/decoding method |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112218098A (en) * | 2020-09-23 | 2021-01-12 | 欧菲微电子技术有限公司 | Data compression method and device, electronic equipment and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| KR20060092813A (en) | Selecting encoding types and predictive modes for encoding video data | |
| CN109587491B (en) | Intra-frame prediction method, device and storage medium | |
| US20170353720A1 (en) | Prediction mode selection method, apparatus and device | |
| CN103618911A (en) | Video streaming providing method and device based on video attribute information | |
| CN105898296A (en) | Video coding frame selection method and device | |
| JP2014099851A (en) | Image division system and image division method | |
| JP2014099852A (en) | Image division system and image division method | |
| CN102970534A (en) | Image cutting system and method | |
| CN102970535A (en) | Image cutting system and method | |
| CN113691811B (en) | Coding block dividing method, device, system and storage medium | |
| EP4250743A1 (en) | Method and device for determining sample adaptive offset mode of coding tree block | |
| CN109640087A (en) | A kind of intra prediction mode decision method, device and equipment | |
| EP2890124A1 (en) | Coding method and device applied to hevc-based 3dvc | |
| JP2014099848A (en) | Image division system and image division method | |
| CN115209147A (en) | Camera video transmission bandwidth optimization method, device, equipment and storage medium | |
| CN111918061B (en) | Coding block dividing method and device, storage medium and electronic equipment | |
| JP3432039B2 (en) | Image encoding method and apparatus | |
| CN102970532A (en) | Image cutting system and method | |
| CN109587502B (en) | Method, device, equipment and computer readable storage medium for intra-frame compression | |
| CN102970489A (en) | Image fusion system and method | |
| CN115190295B (en) | Video frame processing method, device, equipment and storage medium | |
| CN102970533A (en) | Image cutting system and method | |
| JP2014099850A (en) | Image division system and image division method | |
| CN115665424A (en) | Image processing method, apparatus, device, storage medium, and program product | |
| CN105812823A (en) | HEVC intra-frame prediction reference pixel replacement method and device thereof |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C02 | Deemed withdrawal of patent application after publication (patent law 2001) | ||
| WD01 | Invention patent application deemed withdrawn after publication |
Application publication date: 20130313 |