CN108989807A - Each component uses the data compression method and device of respective corresponding data array format - Google Patents
Each component uses the data compression method and device of respective corresponding data array format Download PDFInfo
- Publication number
- CN108989807A CN108989807A CN201710410679.5A CN201710410679A CN108989807A CN 108989807 A CN108989807 A CN 108989807A CN 201710410679 A CN201710410679 A CN 201710410679A CN 108989807 A CN108989807 A CN 108989807A
- Authority
- CN
- China
- Prior art keywords
- component
- data
- coding
- string
- classified
- 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/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
- H04N19/17—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object
- H04N19/176—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding the unit being an image region, e.g. an object the region being a block, e.g. a macroblock
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/10—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding
- H04N19/169—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using adaptive coding characterised by the coding unit, i.e. the structural portion or semantic portion of the video signal being the object or the subject of the adaptive coding
- H04N19/186—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 colour or a chrominance component
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/50—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using predictive coding
Abstract
The present invention provides a kind of each components using the data compression method and device of the data arrangement format progress encoding and decoding for meeting each component self character.In this method and device, by usual 2≤L≤10 the L(of data) a component is classified as K(2≤K≤L) group, the corresponding mutually different data arrangement format of K kind is respectively adopted in K group component, and the component with group all uses same data arrangement format.In this way, making data arrangement format adaptation in the characteristic of each component, binary encoding efficiency is improved.
Description
Technical field
It is damaged the present invention relates to a kind of pair of data or the encoding and decoding system of lossless compression, especially image and view
The method and apparatus of the encoding and decoding of frequency evidence.
Background technique
As human society enters big data, cloud computing, mobile computing, cloud-mobile computing, ultra high-definition (4K) and special superelevation
The epoch of (8K) video image resolution ratio, 4G/5G communication, virtual reality, artificial intelligence clearly, to various data, including big data,
Image data, video data, the data compression for carrying out superelevation compression ratio and very high-quality become essential technology.
Data set be by data element (such as: byte, bit, pixel, pixel component, spatial sampling point, transform domain system
Number) composition set.To be arranged in certain space (one-dimensional, two-dimentional or multidimensional) shape data set (such as: a dimension
According to queue, a two-dimensional data files, a frame image, a video sequence, a transform domain, a transform block, multiple transformation
The sequence of block, a three-dimensional scenic, three-dimensional scenic persistently changed), especially two dimension or above data collection carries out data
When coding (and corresponding decoding) of compression, usually this data set is divided into several with predetermined shape and/or size
Subset, referred to as encoding block (from decoded angle i.e. decoding block, are referred to as encoding and decoding block), as unit of encoding and decoding block, with
Scheduled sequence, one piece one piece is encoded or is decoded.At any one time, the encoding block encoded is known as present encoding
Block.At any one time, the decoding block decoded is known as current decoding block.Present encoding block or current decoding block are referred to as working as
Preceding encoding and decoding block or referred to as current block.Data element (being also referred to as element sometimes) just in encoding or decoding is known as working as
Preceding encoding data elements or current decoded data element, are referred to as current data element, referred to as currentElement.Element is by N
A component (usual 1≤N≤5) composition has 1920(wide for example, element, that is, pixel arrangement of a frame image is in a rectangular shape
Degree) x 1080(height) size (resolution ratio), be made of 3 components: G(green) component, B(blue) component, R(is red) point
Amount or Y(brightness) component, U(coloration 1) component, V(coloration 2) component or Y(brightness) component, Cb(colour difference is blue) and component, Cr(color
Degree difference is red) component or Y(brightness) component, Cg(coloration is green) and component, Co(coloration orange) component or H(form and aspect) component, S(saturation degree)
Component, V(lightness) component or H(form and aspect) component, S(saturation degree) component, L(brightness) component；Or it is made of 4 components: (C, M,
Y, K) i.e. (cyan, magenta, yellow, black) or (R, G, B, A) i.e. (red, green, blue, Alpha) or (Y, U, V, A) be i.e. (bright
Degree, coloration 1, coloration 2, Alpha) or (Y, Cb, Cr, A) i.e. (brightness, colour difference indigo plant, colour difference is red, Alpha) or (Y, Cg,
Co, A) i.e. (brightness, coloration is green, coloration orange, Alpha).
For one with certain shapes (being not necessarily limited to square or rectangle, can be any reasonable other shapes)
A encoding and decoding block needs to be divided into many occasions finer primitive (basic unit), according to scheduled time sequencing,
One primitive, one primitive is encoded or is decoded.To all sample values in a primitive, same type of coding is usually implemented
Or decoding operate.At any one time, the primitive in encoding or decoding is known as current primitive.One primitive is encoded
The result is that one or more coding parameters, finally generate the compressed data code stream containing these coding parameters.One primitive is carried out
Decoding is exactly to parse the compressed data code stream to obtain one or more coding parameters, multiple from one or more of coding parameters
Original goes out the sample value of the data of reconstruct.
The example of primitive include encoding and decoding block (entire block is as a primitive), sub-block, microlith, string, byte serial, alpha(Ah
That method) string, pixel string, sample value string, index string, lines.
One distinguishing feature of many common data sets is the formula with many matchings (i.e. similar or even identical)
Sample.For example, usually there is many matched pixel patterns in image and video sequence.Therefore, in available data compress technique usually
By the way of matching (also referred to as predict or compensate), i.e., with " predicted value " (also referred to as " offset " or " referring to sample value ", such as
" reference pixel ") come match (also referred to as predict, indicate, represent, compensation, it is approximate, approach) sample value in present encoding or decoding
The mode of (referred to as " current sample ") achievees the effect that the lossless or lossy compressions of data.In many occasions, matching way
Basic operation be exactly duplication with reference to sample value of the sample value i.e. on reference position to the position of current sample.Therefore, matching way
Or prediction mode is also referred to as copy mode.In matching way, had been subjected at least partly encoding operation and at least partly solved
Reconstruct (also referred to as rebuild or restore) sample value composition reference set (also referred to as reference set space or with reference to space or with reference to slow of code operation
It deposits).The original samples and its position that reconstruct sample value and its position among reference set are concentrated with initial data are one-to-one.
When carrying out the encoding and decoding of a current block, current block is divided into several matchings and (also referred to as predicts) base by matching way
Member, a Matching unit have one or more matching (coding) parameter (also referred to as matching relationship or duplication parameter or replication relations
Or referring-to relation) indicate its feature.In match parameter a most important parameter be displacement vector (also referred to as motion vector,
Positional shift, offset, relative position, position, relative address, address, relative coordinate, coordinate, relative indexing, index etc.).Position
Move the current primitive of vector representation sample value and its with reference to the relative shift between sample value, be equivalent to data sample be arranged in it is one-dimensional
One-dimensional offset after data.Obviously, it can be exported with reference to where the reference position of sample value from displacement vector.The displacement of current primitive
Vector is known as current displacement vector.Other examples of match parameter: primitive mode, scan pattern, match-type, matching length, no
(prediction) sample value can be matched, etc..
The example of Matching unit includes encoding and decoding block, sub-block, microlith, string, pixel string, sample value string, index string, lines.
The data arrangement format of data element mainly includes following three element:
1) dimension.Including 2-dimensional arrangement and 1 dimension arrangement (also referred to as linear array).
2) shapes and sizes are divided.Subset including the data set of 2-dimensional arrangement to be divided into predetermined shape and size, antithetical phrase
Collection is ranked up, and is optionally further carried out 1 dimension to data element in each subset and is arranged.
3) scanning mode.Including with horizontally or vertically raster scanning, horizontally or vertically arch (i.e. back and forth) scanning, Z-shaped sweep
It retouches, saw-tooth sweep, Hilbert scanning, is 1 dimension data element by 2 dimension data arrangement of elements.
In available data compress technique, in the occasion of multi -components (more than one component), important institute is all using same
The data arrangement format of sample.When different components has different characteristics, same data arrangement format largely shadow
The raising of binary encoding efficiency is rung.
Summary of the invention
In order to solve the problems, such as this in data compression, is used the present invention provides a kind of each component and meet each component itself
The data arrangement format of characteristic carries out the data compression method and device of encoding and decoding.In this method and device, by the L of data
(usual 2≤L≤10) a component is classified as K(2≤K≤L) group, it is different that corresponding K kind is respectively adopted in K group component
Data arrangement format, with group component all use same data arrangement format.In this way, making data arrangement format adaptation in each
The characteristic of component improves binary encoding efficiency.
For example, be classified as component 2 groups (K=2), R, G in the compression of four components (L=4) pixel (R, G, B, A) image,
B belongs to first group, and A belongs to second group.To the first group component, the data arrangement lattice divided using 2-dimensional arrangement and 2 dimension encoding and decoding blocks
Formula arranges the second group component using 1 dimension, 1 frame component image generally one division, the data arrangement of horizontal raster scan
Format.
The most basic peculiar technical characteristic of coding method or device of the invention is in data element by more than one component group
At occasion component is divided by K(K > 1 according to the characteristic and requirement of each component itself) group, it is different using corresponding K kind
One of data arrangement format the component for belonging to one of corresponding K group of data element is encoded, generate and contain and at least two
The compressed data stream of the different corresponding data flow segment of data arrangement format of kind.Fig. 1 is coding method or device of the invention
One schematic diagram.
The most basic peculiar technical characteristic of coding/decoding method or device of the invention is parsing containing the data different from least two
The compressed data stream of the corresponding data flow segment of array format, using K(K > 1) plant one of mutually different data arrangement format logarithm
It is decoded according to the component for belonging to one of corresponding K group of element, obtains decoded multi-component data element.Fig. 2 is the present invention
Coding/decoding method or device a schematic diagram.
According to an aspect of the invention, there is provided coding method or the device of a kind of data compression, it is following to include at least completion
The step of function and operation or module:
According to usual 2≤L≤10 L() characteristic and requirement of each component itself of the data element of a component, by institute
State L component and be classified as K(2≤K≤L) group, using one of mutually different data arrangement format of corresponding K kind to data element
The component for belonging to one of corresponding K group of element is encoded, and is generated corresponding containing the data arrangement format different from least two
The compressed data stream of data flow segment.
According to another aspect of the present invention, the coding/decoding method or device of a kind of data compression are additionally provided, includes at least and completes
The step of following function and operation or module:
Parsing contains the compressed data stream of the data arrangement format corresponding data flow segment different from least two, using scheduled K
(K > 1) is planted one of mutually different data arrangement format and is decoded to the component for belonging to one of corresponding K group of data element,
Obtain decoded multi-component data element.
The present invention is suitable for carrying out data the coding and decoding of lossy compression, and present invention is equally applicable to carry out nothing to data
Damage the coding and decoding of compression.The present invention is suitable for one-dimensional data such as string data or byte string data or one-dimensional pattern or divides
The coding and decoding for tieing up figure, present invention is equally applicable to the reconciliation of the coding of two dimension or above data such as image or video data
Code.
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) three-dimensional scenic；
10) sequence of the three-dimensional scenic persistently changed；
11) scene of virtual reality；
12) sequence of the scene of the virtual reality persistently changed
13) image of pixel form；
14) the transformation numeric field data of image；
15) set of two dimension or the above byte of two dimension；
16) two dimension or the set of the above bit of two dimension；
17) set of pixel；
18) set of four component pixels (C, M, Y, K)；
19) set of four component pixels (R, G, B, A)；
20) set of four component pixels (Y, U, V, A)；
21) set of four component pixels (Y, Cb, Cr, A)；
22) set of four component pixels (Y, Cg, Co, A).
In the present invention, the syntactic element in the compressed data stream include one of following coding parameter or coding parameter component or its
Combination or its prefix, infix, suffix:
1) coding mode；
2) primitive mode；
3) scan pattern；
4) match-type；
5) string type；
6) displacement vector；
7) displacement vector type；
8) motion vector；
9) motion vector type；
10) offset；
11) offset minus constant；
12) offset type；
13) image coordinate；
14) number of pixels；
15) primitive number；
16) primitive length；
17) go here and there (including data element string, byte serial, alpha string, pixel string, sample value string, index string, unpredictable element string
Deng) number；
18) go here and there (including data element string, byte serial, alpha string, pixel string, sample value string, index string, unpredictable element string
Deng) length；
19) go here and there (including data element string, byte serial, alpha string, pixel string, sample value string, index string, unpredictable element string
Deng) length subtracts constant；
20) go here and there (including data element string, byte serial, alpha string, pixel string, sample value string, index string, unpredictable element string
Deng) length type；
21) unpredictable number of pixels；
22) unpredictable pixel string length.
It is the situation of image, the sequence of image, video etc. in data in the present invention, encoding block or decoding block are one of image
Coding region or a decoding region, comprise at least one of the following: entire image, the subgraph of image, macro block, maximum coding are single
First LCU, coding tree unit CTU, the subregion of coding unit CU, CU, predicting unit PU, converter unit TU.
In the present invention, the primitive of encoding and decoding block involved in data compression includes one or a combination set of following state: encoding and decoding block,
Sub-block, microlith, string, byte serial, alpha(Alpha) string, pixel string, sample value string, index string, lines, match block, matching
Block, matching string, matched pixel string, matching sample value string, match index string, matching item, matching lines, offset string, is sat matching microlith
Mark string, unpredictable pixel, unpredictable pixel string, coordinate or unpredictable pixel string.
Illustrate technical characteristic of the invention above by several specific specific examples.Those skilled in the art can be by this specification
Other advantages and efficacy of the present invention can be easily understood for revealed content.The present invention can also pass through in addition different specific realities
The mode of applying is embodied or practiced, and the various details in this specification can also be based on different viewpoints and application, without departing substantially from this
Various modifications or alterations are carried out under the spirit of invention.
It is more implementation details or variant of the invention below.
Implementation or variant example 1
In the coding method or device or coding/decoding method or device, the component number (L) of the data element and component
Grouping number (K) is one of following state:
The grouping number K=2 of component number L=4 and component
Or
The grouping number K=3 of component number L=4 and component
Or
The grouping number K=4 of component number L=4 and component
Or
The grouping number K=2 of component number L=3 and component
Or
The grouping number K=3 of component number L=3 and component
Or
The grouping number K=2 of component number L=5 and component
Or
The grouping number K=3 of component number L=5 and component
Or
The grouping number K=4 of component number L=5 and component
Or
The grouping number K=5 of component number L=5 and component.
Implementation or variant example 2
In the coding method or device or coding/decoding method or device, point of the component of the data element and scheduled component
Group is one of following state:
Component is R, G, B, A, i.e., there are four components altogether；R, these three components of G, B are classified as one group, and A is individually classified as another group, i.e., total
It is classified as two groups；
Or
Component is green, blue, red, Alpha, i.e., there are four components altogether；Green, blue, these three red components are classified as one
Group, Alpha are individually classified as another group, i.e., are classified as two groups altogether；
Or
Component is Y, U, V, A, i.e., there are four components altogether；Y, these three components of U, V are classified as one group, and A is individually classified as another group, i.e., total
It is classified as two groups；
Or
Component is brightness, colour difference 1, colour difference 2, Alpha, i.e., there are four components altogether；Brightness, colour difference 1, colour difference 2 this three
A component is classified as one group, and Alpha is individually classified as another group, i.e., is classified as two groups altogether；
Or
Component is brightness, coloration 1, coloration 2, Alpha, i.e., there are four components altogether；Brightness, coloration 1, coloration 2 these three components are returned
It is one group, Alpha is individually classified as another group, i.e., is classified as two groups altogether.
Implementation or variant example 3
In the coding method or device or coding/decoding method or device, there are four components for data element；Wherein three components are returned
It is one group, corresponding data arrangement format is that 2-dimensional arrangement and 2 dimension encoding and decoding blocks divide；Remaining one-component is classified as another group, phase
The data arrangement format answered is the arrangement of 1 dimension.
Implementation or variant example 4
In the coding method or device or coding/decoding method or device, data element is image (or image sequence i.e. video)
Four component pixels (R, G, B, A) or (Y, U, V, A) or (Y, Cb, Cr, A) or (Y, Cg, Co, A) or its variant, are classified as 2 for component
Group, R, G, B or Y, U, V or Y, Cb, Cr or Y, these three components of Cg, Co are classified as first group, and A is individually classified as second group.To first
Group component is arranged, 1 second group component using the data arrangement format that 2-dimensional arrangement and 2 dimension encoding and decoding blocks divide using 1 dimension
Frame A component image generally one division, the data arrangement format of horizontal raster scan.
Detailed description of the invention
Fig. 1 is a schematic diagram of coding method or device of the invention.
Fig. 2 is a schematic diagram of coding/decoding method or device of the invention.
Claims (10)
1. coding method or the device of a kind of data compression, which is characterized in that including at least the step for completing following function and operation
Rapid or module:
According to the characteristic and requirement of each component itself of the data element with L component, the L component is classified as K group, is adopted
It is carried out with the component that belongs to corresponding K group one of of one of the mutually different data arrangement format of corresponding K kind to data element
Coding generates the compressed data stream for containing the data arrangement format corresponding data flow segment different from least two.
2. the coding/decoding method or device of a kind of data compression, which is characterized in that including at least the step for completing following function and operation
Rapid or module:
Parsing contains the compressed data stream of the data arrangement format corresponding data flow segment different from least two, using scheduled K
(K > 1) is planted one of mutually different data arrangement format and is decoded to the component for belonging to one of corresponding K group of data element,
Obtain decoded multi-component data element.
3. coding method according to claim 1 or device or coding/decoding method according to claim 2 or device,
It is characterized in that data involved in the data compression include one or a combination set of data of following classes:
One-dimensional data；
2-D data；
Multidimensional data；
Figure；
Divide dimension figure；
Image；
The sequence of image；
Video；
Three-dimensional scenic；
The sequence of the three-dimensional scenic persistently changed；
The scene of virtual reality；
The sequence of the scene of the virtual reality persistently changed
The image of pixel form；
The transformation numeric field data of image；
The set of two dimension or the above byte of two dimension；
The set of two dimension or the above bit of two dimension；
The set of pixel；
The set of four component pixels (C, M, Y, K)；
The set of four component pixels (R, G, B, A)；
The set of four component pixels (Y, U, V, A)；
The set of four component pixels (Y, Cb, Cr, A)；
The set of four component pixels (Y, Cg, Co, A).
4. coding method according to claim 1 or device or coding/decoding method according to claim 2 or device,
It is characterized in that institute's syntax elements include one or a combination set of following coding parameter or coding parameter component or its prefix, in
Sew, suffix:
Coding mode；
Primitive mode；
Scan pattern；
Match-type；
String type；
Displacement vector；
Displacement vector type；
Motion vector；
Motion vector type；
Offset；
Offset minus constant；
Offset type；
Image coordinate；
Number of pixels；
Primitive number；
Primitive length；
String number；
String length；
String length subtracts constant；
String length type；
Unpredictable number of pixels；
Unpredictable pixel string length.
5. coding method according to claim 1 or device or coding/decoding method according to claim 2 or device,
It is characterized by:
Data involved in the data compression are image data or image sequence data or video data；
Encoding and decoding block involved in the data compression be image a coding region or a decoding region, including with down toward
Few one kind: entire image, the subgraph of image, macro block, maximum coding unit LCU, coding tree unit CTU, coding unit CU, CU
Subregion, predicting unit PU, converter unit TU.
6. coding method according to claim 1 or device or coding/decoding method according to claim 2 or device,
It is characterized in that the primitive of encoding and decoding block involved in data compression includes one or a combination set of following state: encoding and decoding block, son
Block, microlith, string, byte serial, alpha(Alpha) string, pixel string, sample value string, index string, lines, match block, matched sub-block,
Match microlith, matching string, matched pixel string, matching sample value string, match index string, matching item, matching lines, offset string, coordinate
String, unpredictable pixel, unpredictable pixel string, coordinate or unpredictable pixel string.
7. coding method according to claim 1 or device or coding/decoding method according to claim 2 or device,
It is characterized in that the component number (L) of the data element and the grouping number (K) of component are one of following states:
The grouping number K=2 of component number L=4 and component
Or
The grouping number K=3 of component number L=4 and component
Or
The grouping number K=4 of component number L=4 and component
Or
The grouping number K=2 of component number L=3 and component
Or
The grouping number K=3 of component number L=3 and component
Or
The grouping number K=2 of component number L=5 and component
Or
The grouping number K=3 of component number L=5 and component
Or
The grouping number K=4 of component number L=5 and component
Or
The grouping number K=5 of component number L=5 and component.
8. coding method according to claim 1 or device or coding/decoding method according to claim 2 or device,
It is characterized in that, the grouping of the component of the data element and scheduled component is one of following state:
Component is R, G, B, A, i.e., there are four components altogether；R, these three components of G, B are classified as one group, and A is individually classified as another group, i.e., total
It is classified as two groups；
Or
Component is green, blue, red, Alpha, i.e., there are four components altogether；Green, blue, these three red components are classified as one
Group, Alpha are individually classified as another group, i.e., are classified as two groups altogether；
Or
Component is Y, U, V, A, i.e., there are four components altogether；Y, these three components of U, V are classified as one group, and A is individually classified as another group, i.e., total
It is classified as two groups；
Or
Component is brightness, colour difference 1, colour difference 2, Alpha, i.e., there are four components altogether；Brightness, colour difference 1, colour difference 2 this three
A component is classified as one group, and Alpha is individually classified as another group, i.e., is classified as two groups altogether；
Or
Component is brightness, coloration 1, coloration 2, Alpha, i.e., there are four components altogether；Brightness, coloration 1, coloration 2 these three components are returned
It is one group, Alpha is individually classified as another group, i.e., is classified as two groups altogether.
9. coding method according to claim 1 or device or coding/decoding method according to claim 2 or device,
It is characterized in that there are four components for data element；Wherein three components are classified as one group, and corresponding data arrangement format is 2-dimensional arrangement
It is divided with 2 dimension encoding and decoding blocks；Remaining one-component is classified as another group, and corresponding data arrangement format is the arrangement of 1 dimension.
10. coding method according to claim 9 or device or coding/decoding method or device, it is characterised in that data element
Be image (or image sequence i.e. video) four component pixels (R, G, B, A) or (Y, U, V, A) or (Y, Cb, Cr, A) or (Y, Cg,
Co, A) or its variant, component is classified as 2 groups, R, G, B or Y, U, V or Y, Cb, Cr or Y, Cg, Co these three components are classified as first
Group, A are individually classified as second group；To the first group component, the data arrangement format divided using 2-dimensional arrangement and 2 dimension encoding and decoding blocks is right
Second group component is arranged using 1 dimension, and 1 frame A component image generally one divides, the data arrangement format of horizontal raster scan.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710410679.5A CN108989807A (en) | 2017-06-03 | 2017-06-03 | Each component uses the data compression method and device of respective corresponding data array format |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201710410679.5A CN108989807A (en) | 2017-06-03 | 2017-06-03 | Each component uses the data compression method and device of respective corresponding data array format |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN108989807A true CN108989807A (en) | 2018-12-11 |
Family
ID=64502703
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201710410679.5A Pending CN108989807A (en) | 2017-06-03 | 2017-06-03 | Each component uses the data compression method and device of respective corresponding data array format |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108989807A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110012294A (en) * | 2019-04-02 | 2019-07-12 | 上海工程技术大学 | A kind of coding method and coding/decoding method for multi -components video |
| CN110062238A (en) * | 2019-04-02 | 2019-07-26 | 上海工程技术大学 | A kind of decoding method for four component videos |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101742317A (en) * | 2009-12-31 | 2010-06-16 | 北京中科大洋科技发展股份有限公司 | Video compressing and encoding method with alpha transparent channel |
| US20100177109A1 (en) * | 2009-01-09 | 2010-07-15 | Dinsney Enterprises, Inc. | System and method for monochromatic tinting using saturation maps |
| CN106375759A (en) * | 2016-08-31 | 2017-02-01 | 深圳超多维科技有限公司 | Video image data coding method and device, and video image data decoding method and device |
-
2017
- 2017-06-03 CN CN201710410679.5A patent/CN108989807A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100177109A1 (en) * | 2009-01-09 | 2010-07-15 | Dinsney Enterprises, Inc. | System and method for monochromatic tinting using saturation maps |
| CN101742317A (en) * | 2009-12-31 | 2010-06-16 | 北京中科大洋科技发展股份有限公司 | Video compressing and encoding method with alpha transparent channel |
| CN106375759A (en) * | 2016-08-31 | 2017-02-01 | 深圳超多维科技有限公司 | Video image data coding method and device, and video image data decoding method and device |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110012294A (en) * | 2019-04-02 | 2019-07-12 | 上海工程技术大学 | A kind of coding method and coding/decoding method for multi -components video |
| CN110062238A (en) * | 2019-04-02 | 2019-07-26 | 上海工程技术大学 | A kind of decoding method for four component videos |
| CN110062238B (en) * | 2019-04-02 | 2020-09-11 | 上海工程技术大学 | Encoding and decoding method for four-component video |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107071450B (en) | Coding and decoding method and device for data compression | |
| US10341651B2 (en) | Image coding method, decoding method, coding device and decoding device | |
| CN112383780B (en) | Encoding and decoding method and device for point matching reference set and index back and forth scanning string matching | |
| CN104885463B (en) | The method of encoding/decoding image and use its equipment | |
| CN113784124B (en) | Block matching encoding and decoding method for fine division using multi-shape sub-blocks | |
| CN106254865B (en) | Image encoding and decoding method and image processing equipment | |
| CN107770540B (en) | Data compression method and device for fusing multiple primitives with different reference relations | |
| CN105100814B (en) | Image coding and decoding method and device | |
| CN108235007B (en) | Data compression method and device for each mode using different precision and same coding parameter | |
| CN106254888B (en) | Image encoding and decoding method and image processing equipment | |
| CN111614359B (en) | Data encoding method and decoding method using point prediction and frequent occurrence position array | |
| CN105847842B (en) | Image encoding method and device, and image decoding method and device | |
| CN106254878B (en) | Image encoding and decoding method and image processing equipment | |
| CN108989807A (en) | Each component uses the data compression method and device of respective corresponding data array format | |
| CN107770553B (en) | Data compression method and device adopting multiple types of matching parameters and parameter storage addresses | |
| CN105992003B (en) | Image compression method and device for numbering palette colors according to ordering or frequency | |
| CN111757117B (en) | Data encoding and decoding method for performing string prediction on component downsampled format data | |
| CN108989819A (en) | Each mode uses the data compression method and device of respectively corresponding color space | |
| CN107770527A (en) | Use neighbouring coding parameter and the data compression method and device of nearest coding parameter | |
| CN107483961A (en) | Predict and go here and there position encoded data compression method and device using arcuate scanning string | |
| CN108989810A (en) | The data compression method and device of byte stream or bit stream is respectively adopted in different components | |
| CN107770543B (en) | Data compression method and device for sequentially increasing cutoff values in multiple types of matching parameters | |
| CN107770544B (en) | Data compression method and device adopting multiple types of matching parameters and pre-parameter buffer areas | |
| CN107770542A (en) | Using the data compression method and device of coding parameter base value | |
| CN113395515B (en) | Coding and decoding method and device for point prediction of component down-sampling format data |
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: 20181211 |