CN110290382A - A kind of residual error data coding and decoding methods - Google Patents
A kind of residual error data coding and decoding methods Download PDFInfo
- Publication number
- CN110290382A CN110290382A CN201910389705.XA CN201910389705A CN110290382A CN 110290382 A CN110290382 A CN 110290382A CN 201910389705 A CN201910389705 A CN 201910389705A CN 110290382 A CN110290382 A CN 110290382A
- Authority
- CN
- China
- Prior art keywords
- residual
- prediction
- scheme
- data
- sets
- 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
- 238000000034 method Methods 0.000 title claims abstract description 24
- 238000011017 operating method Methods 0.000 claims abstract description 4
- 238000013139 quantization Methods 0.000 description 31
- 230000009466 transformation Effects 0.000 description 24
- 238000007906 compression Methods 0.000 description 15
- 230000006835 compression Effects 0.000 description 15
- 238000013144 data compression Methods 0.000 description 5
- 108091026890 Coding region Proteins 0.000 description 1
- 241001269238 Data Species 0.000 description 1
- 230000003044 adaptive effect Effects 0.000 description 1
- 238000013473 artificial intelligence Methods 0.000 description 1
- 230000003190 augmentative effect Effects 0.000 description 1
- 235000013399 edible fruits Nutrition 0.000 description 1
- 238000005070 sampling Methods 0.000 description 1
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/103—Selection of coding mode or of prediction mode
-
- 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/177—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being a group of pictures [GOP]
-
- 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/188—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being a video data packet, e.g. a network abstraction layer [NAL] unit
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
- H04N19/61—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding in combination with predictive coding
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
- Compression, Expansion, Code Conversion, And Decoders (AREA)
Abstract
The invention discloses a kind of residual error data coding and decoding methods, its key points of the technical solution are that: a kind of residual error data coding method, including following operating procedure: step 1: selected scheme, default more set residual prediction schemes, analyze the characteristic of residual error data, one of scheduled more set residual prediction schemes are selected, residual error include at least including calculating residual prediction value and predicts i.e. residual prediction again；Step 2: compressed data code stream is written into coding result, including at least in compressed data code stream indicates that the selected scheme is part or all of information required for which sets of plan.The present invention effectively weakens existing correlation between each sample of the data after prediction when prediction residual data are encoded or decoded.
Description
Technical field
The present invention relates to data encoding and decoding field more particularly to a kind of residual error data coding and decoding methods.
Background technique
As human society enters artificial intelligence, big data, virtual reality, augmented reality, mixed reality, cloud computing, shifting
It is the epoch that dynamic calculating, cloud-mobile computing, ultra high-definition (4K) and special ultra high-definition (8K) video image resolution ratio, 4G/5G are communicated, right
Various data carry out superelevation compression ratio and pole including big data, image data, the data of video data and various neomorphs
The data compression of high quality becomes essential technology.
Data set be by data element (such as: byte, bit, pixel, pixel component, spatial sampling point, transform domain system
Number) composition set.
When (referred to as encoding and decoding) are encoded or decoded to data set, usually data element is sorted according to pre-defined rule
It provides tandem, carries out encoding and decoding according to tandem.
To be arranged in certain space (one-dimensional, two-dimentional or multidimensional) shape data set (such as: an one-dimensional data queue,
One two-dimensional data files, a frame image, a video sequence, a transform domain, a transform block, multiple transform blocks, one
The sequence of three-dimensional scenic, three-dimensional scenic persistently changed), especially two dimension or above data the collection volume that carries out data compression
When code (and corresponding decoding), also this data set is divided into sometimes several with predetermined shape and/or size (i.e. element
Number) subset, referred to as whole compression unit, as unit of whole compression unit, in a predefined order, seamless contracting is single one by one
Encoding or decoding is carried out firstly.At any one time, the whole compression unit just in encoding or decoding is known as current seamless contracting
Unit.Data element (being also referred to as element sometimes) just in encoding or decoding is known as current encoded data element or works as
Preceding decoded data element is referred to as current data element, referred to as currentElement.Element is by N number of component (usual 1≤N≤5) group
At, therefore data set and whole compression unit are also all made of N number of component.
It is divided into the situation of whole compression unit in data set, a kind of pre-defined rule of sequence is to arrange first whole compression unit
Sequence, then sort to the element in each whole compression unit.
Coding in data compression is usually made of a part or entirety of at least following phases:
1) it predicts, mainly includes neighboring prediction, string prediction, block prediction etc., generate predicted value and prediction residual, it is referred to as residual
Difference；Prediction also referred to as matches, in particular, string prediction is also referred to as String matching, block prediction is also referred to as Block- matching；
2) it converts, mainly prediction residual is converted, generate transformation coefficient, abbreviation coefficient；When transformation is identical change
It changes when not converting actually, coefficient is essentially equal with residual error；
3) quantify, mainly coefficient is quantified, generate quantization residual error；When quantization is that identical quantization is not done actually
When quantization, quantization residual error is equal to coefficient；When transformation is identical transformation, quantization residual error is the knot quantified to prediction residual
Fruit；When quantization be it is identical quantization and convert be identical transformation when, quantization residual error be equal to coefficient be also equal to residual error；
4) entropy coding generates compression number mainly including carrying out the entropy coding including including at least binaryzation to quantization residual error
According to code stream.
Decoding in data compression is usually made of a part or entirety of at least following phases:
1) entropy decoding, mainly carries out parsing to compressed data code stream and including at least the entropy decoding including anti-binaryzation,
Generate quantization residual error；
2) inverse quantization mainly carries out inverse quantization to quantization residual error, generates reconstruction coefficients；When quantization is that identical quantization is i.e. real
Do not done on border when quantifying, inverse quantization is also that identical inverse quantization does not do inverse quantization actually, thus reconstruction coefficients be equal to quantify it is residual
Difference；
3) inverse transformation mainly carries out inverse transformation to reconstruction coefficients, generates reconstructed residual；When transformation is that identical transformation is i.e. real
When not converting on border, inverse transformation is also that identical transformation does not do inverse transformation actually, so that reconstructed residual is complete with reconstruction coefficients
It is complete equal；When quantization be it is identical quantization and convert be identical transformation when, inverse quantization is also identical inverse quantization and inverse transformation
It is identical inverse transformation, so that reconstructed residual, which is equal to reconstruction coefficients, is also equal to quantization residual error；
4) predictive compensation, mainly includes neighboring prediction compensation, string predictive compensation, block predictive compensation etc., generate predicted value and
It reconstructs data and also referred to as rebuilds data or restored data.
It encodes the prediction residual in each stage, transformation coefficient, quantization residual sum and decodes quantization residual error in each stage, reconstruct
Coefficient, reconstructed residual are referred to as residual error or all for residual error data.Generally determine that residual error is prediction residual actually by context
Or transformation coefficient still quantifies residual error or reconstruction coefficients or reconstructed residual.If not can determine that from context, residual error is just
Refer to prediction residual and/or transformation coefficient and/or quantization residual error and/or reconstruction coefficients and/or reconstructed residual.
List in input data involved in encoding and decoding each stage, initial data, residual error data and various intermediate data
Number is stated to be data sample abbreviation sample or sample value.
In the prior art, it is considered that there is no great correlation between each sample of the data after predicting, it is therefore, right
Data after prediction are not required to be predicted again.
But in fact, some data in some cases, are still deposited between each sample of the data after predicting
In stronger correlation.The prior art has ignored this correlation, affects code efficiency.
Therefore, we are it is necessary to design a kind of new technical solution, to overcome drawbacks described above.
Summary of the invention
The object of the present invention is to provide a kind of residual error data coding and decoding methods, encode to prediction residual data
Or when decoding, effectively weaken existing correlation between each sample of the data after prediction, improves coding or decoded
Efficiency.
Above-mentioned technical purpose of the invention is that used following technical scheme is realized: a kind of residual error data coding method,
It is characterized in that, including following operating procedure:
Step 1: selected scheme presets more set residual prediction schemes, analyzes the characteristic of residual error data, selects scheduled more sets
One of residual prediction scheme include at least including calculating residual prediction value and predicts i.e. residual prediction again to residual error；
Step 2: compressed data code stream is written into coding result, including at least in compressed data code stream indicates the selected side
Case is part or all of information required for which sets of plan.
The further setting of the present invention are as follows: default more set residual prediction schemes include following two sets of plan:
First sets of plan: predicted value is zero scheme for not doing residual prediction actually；
Second sets of plan: predicted value, which is not zero, actually really does the scheme of residual prediction.
The further setting of the present invention are as follows: the scheme of the residual prediction is to calculate from one or several adjacent residual samples
Obtain the predicted value of current residue sample.
The further setting of the present invention are as follows: a kind of coding/decoding method of residual error data includes the following steps:
Step 1: selected scheme presets more set residual prediction schemes, parses compressed data code stream, obtain using scheduled more
Any sets of plan in residual prediction scheme is covered, is predicted residual error the information of i.e. residual prediction again；
Step 2: residual error being carried out using the selected scheme to include at least the residual prediction including calculating residual prediction value
Compensation.
The further setting of the present invention are as follows: default more set residual prediction schemes include following two sets of plan:
First sets of plan: predicted value is zero scheme for not doing residual prediction actually；
Second sets of plan: predicted value, which is not zero, actually really does the scheme of residual prediction.
The further setting of the present invention are as follows: the scheme of the residual prediction is to calculate from one or several adjacent residual samples
Obtain the predicted value of current residue sample.
In conclusion the invention has the following advantages:
The number after prediction can effectively be weakened when prediction residual data are encoded or decoded by the above method
According to each sample between existing correlation, improve coding or decoded efficiency.
Specific embodiment
In order to be easy to understand the technical means, the creative features, the aims and the efficiencies achieved by the present invention, tie below
Specific embodiment is closed, the present invention is further explained.
The present invention be suitable for data carry out lossy compression coding and decoding, present invention is equally applicable to data into
The coding and decoding of row lossless compression.The present invention is suitable for one-dimensional data such as string data or byte string data or one-dimensional pattern
Or the coding and decoding of point dimension figure, present invention is equally applicable to two dimension or the codings of above data such as image or video data
And decoding.
In the present invention, data involved in data compression include one or a combination set of data of following classes
1) one-dimensional data；
2) 2-D data；
3) multidimensional data；
4) figure；
5) divide dimension figure；
6) image；
7) sequence of image；
8) video；
9) audio；
10) file；
11) byte；
12) bit；
13) pixel；
14) three-dimensional scenic；
15) sequence of the three-dimensional scenic persistently changed；
16) scene of virtual reality；
17) sequence of the scene of the virtual reality persistently changed
18) image of pixel form；
19) the transformation numeric field data of image；
20) set of two dimension or the above byte of two dimension；
21) two dimension or the set of the above bit of two dimension；
22) set of pixel；
23) set of single component pixels；
24) set of three-component pixel (R, G, B, A)；
25) set of three-component pixel (Y, U, V)；
26) set of three-component pixel (Y, Cb, Cr)；
27) set of three-component pixel (Y, Cg, Co)；
28) set of four component pixels (C, M, Y, K)；
29) set of four component pixels (R, G, B, A)；
30) set of four component pixels (Y, U, V, A)；
31) set of four component pixels (Y, Cb, Cr, A)；
32) set of four component pixels (Y, Cg, Co, A).
The situation of image, the sequence of image, video etc. in initial data in the present invention, whole compression unit be image or
One coding region of sequence or a decoding region, including following scenario described: sequence, the sequence of image, image, image son
Image, band slice, tile tile, macro block, maximum coding unit LCU, coding tree unit CTU, coding unit CU, CU son
Region, sub- coding unit SubCU, prediction block, the subregion of predicting unit PU, PU, sub- predicting unit SubPU, transform block, transformation
The subregion of unit TU, TU, sub- converter unit SubTU.
Embodiment 1: residual error data coding method, including following operating procedure:
Step 1: selected scheme presets more set residual prediction schemes, analyzes the characteristic of residual error data, selects scheduled more sets
One of residual prediction scheme include at least including calculating residual prediction value and predicts i.e. residual prediction again to residual error；
Step 2: compressed data code stream is written into coding result, including at least in compressed data code stream indicates the selected side
Case is part or all of information required for which sets of plan.
Wherein preset more set residual prediction schemes include following two sets of plan:
First sets of plan: predicted value is zero scheme for not doing residual prediction actually；
Second sets of plan: predicted value, which is not zero, actually really does the scheme of residual prediction.
The scheme of residual prediction is that the predicted value for obtaining current residue sample is calculated from one or several adjacent residual samples.
When transformation is identical transformation and quantization is identical quantization, the selected scheme is second sets of plan；Otherwise, the choosing
Determining scheme is first sets of plan.
Embodiment 2: the coding/decoding method of residual error data includes the following steps:
Step 1: selected scheme presets more set residual prediction schemes, parses compressed data code stream, obtain using scheduled more
Any sets of plan in residual prediction scheme is covered, is predicted residual error the information of i.e. residual prediction again；
Step 2: residual error being carried out using the selected scheme to include at least the residual prediction including calculating residual prediction value
Compensation.
Wherein preset more set residual prediction schemes include following two sets of plan:
First sets of plan: predicted value is zero scheme for not doing residual prediction actually；
Second sets of plan: predicted value, which is not zero, actually really does the scheme of residual prediction.
The scheme of residual prediction is that the predicted value for obtaining current residue sample is calculated from one or several adjacent residual samples.
When transformation is identical transformation and quantization is identical quantization, the selected scheme is second sets of plan；Otherwise, the choosing
Determining scheme is first sets of plan.
Application examples 1: in residual error data coding method or decoding residual data method, data set is the sequence of image or image
Column or video, wherein that is, from left, adjacent residual sample calculating is obtained when the second sets of plan is horizontally adjacent sample predictions scheme
Obtain the predicted value of current residual sample.
When the second sets of plan is vertically adjacent to sample predictions scheme, i.e., from top, adjacent residual sample calculating is obtained currently
The predicted value of residual sample.
When the second sets of plan is following adaptive horizontally or vertically adjacent sample prediction scheme, if upper left side sample value
Be less than or equal to the absolute value of the difference of upper left side sample value and left sample value with the absolute value of the difference of top sample value, then it is adjacent from left
Residual sample calculates the predicted value for obtaining current residue sample；Otherwise, from top, adjacent residual sample calculating obtains current residue
The predicted value of sample.
Application examples 2: in residual error data coding method or decoding residual data method, it is single that data set is divided into seamless contracting
Member, each whole compression unit has respective selected scheme, i.e., as unit of whole compression unit, uses scheduled more set residual prediction sides
One of case, referred to as selected scheme carry out all residual error datas in a whole compression unit to include at least calculating residual prediction
Residual prediction compensation in the residual prediction or coding/decoding method or device in coding method or device including value.
The basic principles, main features and advantages of the present invention have been shown and described above.The technology of the industry
Personnel are it should be appreciated that the present invention is not limited to the above embodiments, and the above embodiments and description only describe this
The principle of invention, various changes and improvements may be made to the invention without departing from the spirit and scope of the present invention, these changes
Change and improvement all fall within the protetion scope of the claimed invention.The claimed scope of the invention by appended claims and its
Equivalent defines.
Claims (6)
1. a kind of residual error data coding method, which is characterized in that including following operating procedure:
Step 1: selected scheme, default more set residual prediction schemes analyze the characteristic of residual error data, select scheduled more set residual errors
One of prediction scheme include at least including calculating residual prediction value and predicts i.e. residual prediction again to residual error；
Step 2: compressed data code stream is written into coding result, including at least in compressed data code stream indicates that the selected scheme is
Part or all of information required for any sets of plan.
2. a kind of residual error data coding method according to claim 1, which is characterized in that default more set residual predictions
Scheme includes following two sets of plan:
First sets of plan: predicted value is zero scheme for not doing residual prediction actually；
Second sets of plan: predicted value, which is not zero, actually really does the scheme of residual prediction.
3. a kind of residual error data coding method according to claim 2, which is characterized in that the scheme of the residual prediction is
The predicted value for obtaining current residue sample is calculated from one or several adjacent residual samples.
4. a kind of coding/decoding method of residual error data, which comprises the steps of:
Step 1: selected scheme is preset and covers residual prediction schemes more, parses compressed data code stream, obtains residual using scheduled mostly set
Which sets of plan in poor prediction scheme, is predicted again residual error the information of i.e. residual prediction；
Step 2: being compensated using the residual prediction that the selected scheme include at least including calculating residual prediction value to residual error.
5. a kind of decoding residual data method according to claim 4, which is characterized in that default more set residual predictions
Scheme includes following two sets of plan:
First sets of plan: predicted value is zero scheme for not doing residual prediction actually；
Second sets of plan: predicted value, which is not zero, actually really does the scheme of residual prediction.
6. a kind of residual error data coding method according to claim 5, which is characterized in that the scheme of the residual prediction is
The predicted value for obtaining current residue sample is calculated from one or several adjacent residual samples.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910389705.XA CN110290382A (en) | 2019-05-10 | 2019-05-10 | A kind of residual error data coding and decoding methods |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910389705.XA CN110290382A (en) | 2019-05-10 | 2019-05-10 | A kind of residual error data coding and decoding methods |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110290382A true CN110290382A (en) | 2019-09-27 |
Family
ID=68002247
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910389705.XA Pending CN110290382A (en) | 2019-05-10 | 2019-05-10 | A kind of residual error data coding and decoding methods |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110290382A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111641827A (en) * | 2019-03-02 | 2020-09-08 | 上海天荷电子信息有限公司 | Data compression method and device for prediction residual entropy coding by switching multiple schemes |
| WO2021120067A1 (en) * | 2019-12-18 | 2021-06-24 | 深圳市大疆创新科技有限公司 | Data encoding method, data decoding method, data processing method, encoder, decoder, system, movable platform, and computer-readable medium |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2006112642A1 (en) * | 2005-04-19 | 2006-10-26 | Samsung Electronics Co., Ltd. | Method and apparatus for adaptively selecting context model for entropy coding |
| CN1917647A (en) * | 2005-04-19 | 2007-02-21 | 三星电子株式会社 | Method and apparatus for adaptively selecting context model for entropy coding |
| CN101094405A (en) * | 2006-06-22 | 2007-12-26 | 三星电子株式会社 | Flag encoding method, flag decoding method, and apparatus thereof |
| CN101356817A (en) * | 2006-01-12 | 2009-01-28 | 三星电子株式会社 | Method of encoding flag, method of decoding flag, and apparatus thereof |
-
2019
- 2019-05-10 CN CN201910389705.XA patent/CN110290382A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2006112642A1 (en) * | 2005-04-19 | 2006-10-26 | Samsung Electronics Co., Ltd. | Method and apparatus for adaptively selecting context model for entropy coding |
| CN1917647A (en) * | 2005-04-19 | 2007-02-21 | 三星电子株式会社 | Method and apparatus for adaptively selecting context model for entropy coding |
| CN101356817A (en) * | 2006-01-12 | 2009-01-28 | 三星电子株式会社 | Method of encoding flag, method of decoding flag, and apparatus thereof |
| CN101094405A (en) * | 2006-06-22 | 2007-12-26 | 三星电子株式会社 | Flag encoding method, flag decoding method, and apparatus thereof |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111641827A (en) * | 2019-03-02 | 2020-09-08 | 上海天荷电子信息有限公司 | Data compression method and device for prediction residual entropy coding by switching multiple schemes |
| WO2021120067A1 (en) * | 2019-12-18 | 2021-06-24 | 深圳市大疆创新科技有限公司 | Data encoding method, data decoding method, data processing method, encoder, decoder, system, movable platform, and computer-readable medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9787996B2 (en) | Encoding/decoding method and apparatus using a tree structure | |
| CN103220528B (en) | Method and apparatus by using large-scale converter unit coding and decoding image | |
| CN104735452B (en) | By the method and apparatus using big converter unit image to be encoded and decodes | |
| CN102281448B (en) | Image encoder and image decoder, image encoding method and image decoding method | |
| CN104041035B (en) | Lossless coding and coherent signal method for expressing for composite video | |
| CN105357540A (en) | Method and apparatus for decoding video | |
| CN105103453A (en) | Data encoding and decoding | |
| CN105430407A (en) | Fast inter-frame mode decision methods applied to transcoding from H.264 to HEVC | |
| CN102939753A (en) | Method and apparatus for encoding video by compensating for pixel value according to pixel groups, and method and apparatus for decoding video by the same | |
| CN102388610A (en) | Video encoding method and apparatus using low-complexity frequency transformation, and video decoding method and apparatus | |
| CN102804778A (en) | Method and apparatus for encoding and decoding video by using pattern information in hierarchical data unit | |
| CN105284114A (en) | Method and apparatus for processing video signal | |
| CN101828405A (en) | Image coding device, image decoding device, image coding method, and image decoding method | |
| CN108028945A (en) | The apparatus and method of conversion are performed by using singleton coefficient update | |
| CN105122801A (en) | Video signal processing method and apparatus | |
| CN110290382A (en) | A kind of residual error data coding and decoding methods | |
| CN105556850B (en) | Encoder, decoder and its operation method | |
| CN105794208A (en) | Method for encoding and decoding images, device for encoding and decoding images and corresponding computer programs | |
| CN107852493A (en) | Picture decoding method and device for the method for encoding images and device of sample value compensation and for sample value compensation | |
| CN111385555A (en) | Data compression method and device for inter-component prediction of original and/or residual data | |
| CN103314584A (en) | Method of coding a sequence of images and corresponding reconstruction method | |
| CN112601086B (en) | String length parameter hybrid coding and decoding method and device | |
| CN107770542A (en) | Using the data compression method and device of coding parameter base value | |
| CN110312136A (en) | A kind of coding and decoding methods of pair of multi-component data | |
| KR20130070618A (en) | Coding method and apparatus by using tree structure |
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 | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20190927 |
|
| RJ01 | Rejection of invention patent application after publication |