CN108282662A - A kind of optimization method and device of continuous tone Static Picture Compression - Google Patents
A kind of optimization method and device of continuous tone Static Picture Compression Download PDFInfo
- Publication number
- CN108282662A CN108282662A CN201810107628.XA CN201810107628A CN108282662A CN 108282662 A CN108282662 A CN 108282662A CN 201810107628 A CN201810107628 A CN 201810107628A CN 108282662 A CN108282662 A CN 108282662A
- Authority
- CN
- China
- Prior art keywords
- temp
- difference
- continuous tone
- static picture
- picture compression
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
- 230000006835 compression Effects 0.000 title claims abstract description 31
- 238000007906 compression Methods 0.000 title claims abstract description 31
- 238000000034 method Methods 0.000 title claims abstract description 30
- 238000005457 optimization Methods 0.000 title claims abstract description 29
- 230000003068 static effect Effects 0.000 title claims abstract description 24
- 229910002056 binary alloy Inorganic materials 0.000 claims abstract description 25
- 238000013139 quantization Methods 0.000 claims description 7
- 238000004590 computer program Methods 0.000 claims description 6
- 238000009825 accumulation Methods 0.000 claims description 5
- 238000006073 displacement reaction Methods 0.000 claims 1
- 238000004422 calculation algorithm Methods 0.000 description 6
- XLYOFNOQVPJJNP-UHFFFAOYSA-N water Substances O XLYOFNOQVPJJNP-UHFFFAOYSA-N 0.000 description 3
- 238000004364 calculation method Methods 0.000 description 2
- 238000007796 conventional method Methods 0.000 description 2
- 238000012937 correction Methods 0.000 description 2
- 235000013399 edible fruits Nutrition 0.000 description 2
- 230000006870 function Effects 0.000 description 2
- 238000007792 addition Methods 0.000 description 1
- 230000005540 biological transmission Effects 0.000 description 1
- 238000000205 computational method Methods 0.000 description 1
- 230000001186 cumulative effect Effects 0.000 description 1
- 238000012217 deletion Methods 0.000 description 1
- 230000037430 deletion Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 239000003814 drug Substances 0.000 description 1
- 230000000694 effects Effects 0.000 description 1
- 238000003384 imaging method Methods 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 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/70—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by syntax aspects related to video coding, e.g. related to compression standards
-
- 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/124—Quantisation
-
- 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/13—Adaptive entropy coding, e.g. adaptive variable length coding [AVLC] or context adaptive binary arithmetic coding [CABAC]
-
- 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/85—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using pre-processing or post-processing specially adapted for video compression
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
- Compression Of Band Width Or Redundancy In Fax (AREA)
Abstract
The present invention relates to a kind of optimization method and devices of continuous tone Static Picture Compression, when positive integer parameter m meets 2 p exponent condition in golomb codings, by the number for calculating N [Q], A [Q] binary system leading zero, subtract each other to obtain difference k_temp, passes through calculating (N [Q]<<k_temp)<A [Q], it is Golomb encoding variables to take the difference or the difference to subtract 1 according to comparison result.The present invention eliminates feedback control loop present in calculating in the calculating of k values, and the k values and traditional arithmetic result calculated is completely the same, and effectively raises the assembly line calculated performance of k values calculating.
Description
Technical field
The present invention relates to a kind of optimization method, device and computer memory devices, quiet more particularly, to a kind of continuous tone
The optimization method and device of state compression of images.
Background technology
JPEG-LS is a kind of lossless/close lossless compression standard for continuous tone still image, ISO-14495-1/
ITU-T.87.Its core algorithm is LOCO-I (Low Complexity Lossless Compression for
Images).LOCO-I algorithms, which can be obtained, similar with current many compression algorithms based on arithmetic coding even preferably presses
Contracting efficiency, while lower complexity can be kept again, it is widely used in digital camera, network transmission, wireless telecommunications and medicine
The fields such as imaging.
JPEG-LS encodes block diagram as shown in Figure 1, including context modeling, predicts, normal mode coding, brigade commander's pattern
Several steps such as coding.
After context is determined, in the normal mode it is necessary to carrying out the calculating of predicted value, deviation, and prediction misses
The correction of difference.Under this operating mode, the final step of coded treatment is that the prediction error to correction encodes.For this purpose, compiling
Code device has used one to encode derived scheme by golomb.This means that for each context only there are two statistical parameter,
The attenuation rate of distribution and the parameter of deviation are respectively represented, is estimated.All possible prediction error value is before encoding
It is mapped as non-negative value.
It is as the coding means to the symbol sebolic addressing comprising non-negative brigade commander when golomb codings are introduced into earliest.For
One Integer n more than or equal to 0 is encoded into two parts by one positive integer parameter m, m rank golomb code word：One n/m's
The unit 1 of integer part (i.e. quotient) indicates and the binary representation of a n mod m (i.e. remainder).Golomb code words for
The nonnegative integer of geometry distribution is best.For each distribution under this form, there are a parameter value m, it makes
To all code words that can be uniquely decoded as nonnegative integer, coding obtains most short possible mean code length.
A kind of special situation of golomb code words is, when m is 2 p power, may result in very simple coding/
Decoding process：The code word of n is a number, and the higher bit position for the n that it is indicated by unit 1 is followed by the k low bit position composition of n.
What is used in JPEG-LS is exactly this special situation, and is marked with function G (k).K represents this golomb variable, and
M is equal to 2 p powers.
Lower in normal mode encodes prediction error.It needs to use variables A [0 ... 364] and N [0 ... 364] thus
To calculate Golomb encoding variables k.The calculating and context-sensitive of variable k, the following code segment of calculating process indicate.It
Afterwards, variable Errval is mapped to a nonnegative integer MErrval, and is encoded with coding function LG (k, LIMIT).
For (k=0；(N[Q]<<k)<A[Q]；k++)；
Wherein, A [Q] is that the prediction of storage accumulation misses absolute value of the difference variable, and N [Q] is for storing each context
The variable of frequency, A [Q], N [Q] are non-negative 32 integer variables of no symbol, and Q is quantization index variable, k Golomb
Encoding variable.This flow chart as shown in Figure 2 calculated
In the algorithm of calculating k, N [Q] is calculated<<K is gradually compared with A [Q] by cumulative k values, finally acquires k
Value.Since the N [Q], the value of A [Q] that substitute into calculating every time are different, the number of cycle is also different.For image each pixel and
Speech, it is uncertain to calculate the clock number consumed needed for k values.And it can be seen that the computational methods from flow chart and there is feedback
Loop, in this way, cannot achieve the flowing water line computation of k values.
Invention content
The present invention is directed to the k values that golomb-rice is encoded in lossless/close Lossless Image Compression coding in JPEG-LS standards
Calculating has carried out assembly line optimization, in the calculating of k values, eliminates feedback control loop present in calculating, the k values and tradition calculated
Arithmetic result it is completely the same, and effectively raise k values calculating assembly line calculated performance.
The above-mentioned technical problem of the present invention is mainly to be addressed by following technical proposals：
A kind of optimization method of continuous tone Static Picture Compression, which is characterized in that when positive integer is joined in golomb codings
When number m meets 2 p exponent condition, after N [Q] is moved to left k_temp times compared with A [Q], which is taken according to comparison result or is somebody's turn to do
It is Golomb encoding variables that difference, which subtracts 1, wherein p is positive integer, and k_temp is the difference of N [Q] and A [Q], and A [Q] is that storage is tired
Long-pending prediction misses absolute value of the difference variable, and N [Q] is the variable of the frequency for storing each context, and A [Q], N [Q] are equal
For non-negative 32 integer variables of no symbol, Q is quantization index variable.
In a kind of optimization method of above-mentioned continuous tone Static Picture Compression, by N [Q] binary system leading zero number and A
[Q] binary system leading zero number does difference, and difference is denoted as k_temp, then N [Q] is moved to left k_temp times, the result after moving to left and A
[Q] is compared.
In a kind of optimization method of above-mentioned continuous tone Static Picture Compression, definition difference is k_temp, by the left sides N [Q]
It moves k_temp times, result and A [Q] after moving to left are compared, that is, judge N [Q]<<k_temp)<A [Q], is selected according to comparison result
Select execution：
If N [Q]<<k_temp)<It is k_temp -1 that A [Q], which sets up then Golomb encoding variables,
If N [Q]<<k_temp)<It is k_temp that A [Q], which sets up invalid then Golomb encoding variables,.
In a kind of optimization method of above-mentioned continuous tone Static Picture Compression, the calculating of N [Q] binary system leading zero number
Process is to instruct CLZ (Count Leading Zeros) to obtain by zero count.
In a kind of optimization method of above-mentioned continuous tone Static Picture Compression, the calculating of A [Q] binary system leading zero number
Process is to instruct CLZ (Count Leading Zeros) to obtain by zero count.
A kind of optimization device of continuous tone Static Picture Compression, which is characterized in that the device is in golomb codings
Positive integer parameter m meets 2 p exponent condition, including：
Shift module：For N [Q] to be moved to left k_temp times, wherein k_temp is positive integer, and k_temp is N [Q] and A
The difference of [Q]；
Results contrast module：N [Q] is moved to left k_temp times, the result and A [Q] after moving to left are compared, and are tied according to comparing
It is Golomb encoding variables that fruit, which takes the difference or the difference to subtract 1,；
Wherein, [Q] is that the prediction of storage accumulation misses absolute value of the difference variable, and N [Q] is the hair for storing each context
The variable of raw number, A [Q], N [Q] are non-negative 32 integer variables of no symbol, and Q is quantization index variable.
In a kind of optimization device of above-mentioned continuous tone Static Picture Compression, shift module includes：
Leading zero number acquiring unit：For obtaining N [Q] binary system leading zero number and the leading zero of A [Q] binary system
Number；
Number difference comparsion unit：For N [Q] binary system leading zero number and A [Q] binary system leading zero number to be made the difference
Value, and it is k_temp to define difference；
Shift unit：N [Q] is moved to left k_temp times.
In a kind of optimization device of above-mentioned continuous tone Static Picture Compression, results contrast module includes：
Number difference comparsion unit：Result and A [Q] after N [Q] is moved to left k_temp times are compared, that is, judge N [Q]<
<k_temp)<A [Q] selects to execute according to comparison result：
If N [Q]<<k_temp)<It is k_temp -1 that A [Q], which sets up then Golomb encoding variables,
If N [Q]<<k_temp)<It is k_temp that A [Q], which sets up invalid then Golomb encoding variables,.
In a kind of optimization device of above-mentioned continuous tone Static Picture Compression, leading zero number acquiring unit calculates N [Q]
Binary system leading zero number is to instruct CLZ (Count Leading Zeros) to obtain by zero count；Leading zero number obtains single
It is to instruct CLZ (Count Leading Zeros) to obtain by zero count that member, which calculates A [Q] binary system leading zero number,.
A kind of optimization device of continuous tone Static Picture Compression, which is characterized in that including memory, processor and deposit
Store up the computer program that can be run in the memory and on the processor, which is characterized in that the processor is configured as holding
It is realized when the row computer program as described in any one of claim 1 to 5 the step of optimization method.
Therefore, the invention has the advantages that：1, the method that the method optimized introduces flowing water line computation k values, eliminates
Feedback control loop in conventional method calculating.2, the result for the k values and conventional method that the method optimized is calculated is completely the same, and has
The assembly line calculated performance for improving the calculating of k values of effect.
Description of the drawings
Attached drawing 1 is JPEG-LS coding flow charts.
Attached drawing 2 is traditional JPEGLS lossless compression algorithms k value calculation flow charts.
Attached drawing 3 is JPEGLS lossless compression algorithms k value calculation flow charts in the present invention.
Specific implementation mode
Below with reference to the embodiments and with reference to the accompanying drawing the technical solutions of the present invention will be further described.
Embodiment：
One, the formula that the present invention is calculated according to k values, the method for introducing flowing water line computation k values eliminate original method calculating
In feedback control loop so that each k values, which calculate, consumes fixed clock number, to reach pipelining.
When positive integer parameter m meets 2 p exponent condition in golomb codings, can by calculating N [Q], A [Q] two into
The number of leading zero processed subtracts each other to obtain difference k_temp, then N [Q] is moved to left k_temp times, and the result and A [Q] after moving to left carry out
Compare, passes through calculating (N [Q]<<k_temp)<A [Q] takes the difference or the difference to subtract 1 and is encoded for Golomb according to comparison result
Variable, wherein A [Q] is that the prediction of storage accumulation misses absolute value of the difference variable, and N [Q] is the generation for storing each context
The variable of number, n are positive integer, and A [Q], N [Q] are non-negative 32 integer variables of no symbol, and Q is quantization index variable, and k is
Golomb encoding variables.
The flow chart that improved k values calculate is illustrated in fig. 3 shown below：
1) N [Q], A [Q] binary system leading zero number are calculated, the number of binary system leading zero can instruct CLZ by zero count
(Count Leading Zeros) is obtained；
2) N [Q] leading zero number subtracts A [Q] leading zero number, obtains k_temp；
3) decimal system shift left operation is carried out to N [Q], N [Q] is moved to left k_temp times, that is, calculate N [Q]<<k_temp.
4) judge (N [Q]<<k_temp)<Whether A [Q] is true；
If 5) N [Q]<<k_temp)<It is k_temp -1 that A [Q], which sets up then Golomb encoding variables, if N [Q]<<k_temp)<
It is k_temp that A [Q], which sets up invalid then Golomb encoding variables,.
Assuming that calculate a non-negative integer variable clock number be t0, then by this method calculate k values needed for when
Clock number is t0+1, is fixed value, and such k values calculating can fully achieve calculating pipelining.
Two, the present invention also provides a kind of optimization device of continuous tone Static Picture Compression, which compiles for golomb
Positive integer parameter m meets 2 p exponent condition in code, including：
Shift module：For N [Q] to be moved to left k_temp times, wherein k_temp is positive integer, and k_temp is N [Q] and A
The difference of [Q], shift module include：
Leading zero number acquiring unit：For obtaining N [Q] binary system leading zero number and the leading zero of A [Q] binary system
Number；
Number difference comparsion unit：For N [Q] binary system leading zero number and A [Q] binary system leading zero number to be made the difference
Value, and it is k_temp to define difference；
Shift unit：N [Q] is moved to left k_temp times.
Results contrast module：N [Q] is moved to left k_temp times, the result and A [Q] after moving to left are compared, and are tied according to comparing
It is Golomb encoding variables that fruit, which takes the difference or the difference to subtract 1,；
Wherein, [Q] is that the prediction of storage accumulation misses absolute value of the difference variable, and N [Q] is the hair for storing each context
The variable of raw number, A [Q], N [Q] are non-negative 32 integer variables of no symbol, and Q is quantization index variable.
Results contrast module includes：
Number difference comparsion unit：Result and A [Q] after N [Q] is moved to left k_temp times are compared, that is, judge N [Q]<
<k_temp)<A [Q] selects to execute according to comparison result：
If N [Q]<<k_temp)<It is k_temp -1 that A [Q], which sets up then Golomb encoding variables,
If N [Q]<<k_temp)<It is k_temp that A [Q], which sets up invalid then Golomb encoding variables,.
Three, the present invention also provides a kind of computer memory device, which is stored with computer program, the computer program
It is able to carry out all steps of the first entry deletion.
Specific embodiment described herein is only an example for the spirit of the invention.Technology belonging to the present invention is led
The technical staff in domain can make various modifications or additions to the described embodiments or replace by a similar method
In generation, however, it does not deviate from the spirit of the invention or beyond the scope of the appended claims.
Claims (10)
1. a kind of optimization method of continuous tone Static Picture Compression, which is characterized in that as positive integer parameter m in golomb codings
When meeting 2 p exponent condition, after N [Q] is moved to left k_temp times compared with A [Q], the difference or the difference are taken according to comparison result
It is Golomb encoding variables that value, which subtracts 1, wherein n is positive integer, and k_temp is the difference of N [Q] and A [Q], and A [Q] is that storage is accumulated
Prediction miss absolute value of the difference variable, N [Q] is the variable of frequency for storing each context, and A [Q], N [Q] are
Without non-negative 32 integer variables of symbol, Q is quantization index variable.
2. a kind of optimization method of continuous tone Static Picture Compression according to claim 1, which is characterized in that by N [Q]
Binary system leading zero number does difference with A [Q] binary system leading zero number, and difference is denoted as k_temp, then N [Q] is moved to left k_
Temp times, result and A [Q] after moving to left are compared.
3. a kind of optimization method of continuous tone Static Picture Compression according to claim 1, which is characterized in that it is poor to define
Value is k_temp, N [Q] is moved to left k_temp times, the result and A [Q] after moving to left are compared, that is, judge N [Q]<<k_temp)<
A [Q] selects to execute according to comparison result：
If N [Q]<<k_temp)<It is k_temp -1 that A [Q], which sets up then Golomb encoding variables,
If N [Q]<<k_temp)<It is k_temp that A [Q], which sets up invalid then Golomb encoding variables,.
4. a kind of optimization method of continuous tone Static Picture Compression according to claim 1, which is characterized in that N [Q] two
The calculating process of system leading zero number is to instruct CLZ (Count Leading Zeros) to obtain by zero count.
5. a kind of optimization method of continuous tone Static Picture Compression according to claim 1, which is characterized in that A [Q] two
The calculating process of system leading zero number is to instruct CLZ (Count Leading Zeros) to obtain by zero count.
6. a kind of optimization device of continuous tone Static Picture Compression, which is characterized in that the device is directed in golomb codings just
Numeric parameter m meets 2 p exponent condition, including：
Shift module：For N [Q] to be moved to left k_temp times, wherein k_temp is positive integer, and k_temp is N's [Q] and A [Q]
Difference；
Results contrast module：N [Q] is moved to left k_temp times, the result and A [Q] after moving to left are compared, and are taken according to comparison result
It is Golomb encoding variables that the difference or the difference, which subtract 1,；
Wherein, [Q] is that the prediction of storage accumulation misses absolute value of the difference variable, and N [Q] is for storing the generation of each context time
Several variables, A [Q], N [Q] are non-negative 32 integer variables of no symbol, and Q is quantization index variable.
7. a kind of optimization device of continuous tone Static Picture Compression according to claim 6, which is characterized in that displacement mould
Block includes：
Leading zero number acquiring unit：For obtaining N [Q] binary system leading zero number and A [Q] binary system leading zero number；
Number difference comparsion unit：For N [Q] binary system leading zero number and A [Q] binary system leading zero number to be done difference,
And it is k_temp to define difference；
Shift unit：N [Q] is moved to left k_temp times.
8. a kind of optimization device of continuous tone Static Picture Compression according to claim 6, which is characterized in that result ratio
Include compared with module：
Number difference comparsion unit：Result and A [Q] after N [Q] is moved to left k_temp times are compared, that is, judge N [Q]<<k_
temp)<A [Q] selects to execute according to comparison result：
If N [Q]<<k_temp)<It is k_temp -1 that A [Q], which sets up then Golomb encoding variables,
If N [Q]<<k_temp)<It is k_temp that A [Q], which sets up invalid then Golomb encoding variables,.
9. a kind of optimization device of continuous tone Static Picture Compression according to claim 6, which is characterized in that leading zero
It is to instruct CLZ (Count Leading Zeros) by zero count that number acquiring unit, which calculates N [Q] binary system leading zero number,
It obtains；It is to instruct CLZ (Count by zero count that leading zero number acquiring unit, which calculates A [Q] binary system leading zero number,
Leading Zeros) it obtains.
10. a kind of optimization device of continuous tone Static Picture Compression, which is characterized in that including memory, processor and deposit
Store up the computer program that can be run in the memory and on the processor, which is characterized in that the processor is configured as holding
It is realized when the row computer program as described in any one of claim 1 to 5 the step of optimization method.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810107628.XA CN108282662B (en) | 2018-02-02 | 2018-02-02 | Optimization method and device for continuous tone static image compression |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810107628.XA CN108282662B (en) | 2018-02-02 | 2018-02-02 | Optimization method and device for continuous tone static image compression |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108282662A true CN108282662A (en) | 2018-07-13 |
| CN108282662B CN108282662B (en) | 2021-02-02 |
Family
ID=62807590
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810107628.XA Active CN108282662B (en) | 2018-02-02 | 2018-02-02 | Optimization method and device for continuous tone static image compression |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108282662B (en) |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2024216514A1 (en) * | 2023-04-18 | 2024-10-24 | 华为技术有限公司 | Data compression method, data decompression method, and related apparatus |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6987468B1 (en) * | 2004-10-29 | 2006-01-17 | Microsoft Corporation | Lossless adaptive encoding and decoding of integer data |
| US20060273937A1 (en) * | 2005-06-01 | 2006-12-07 | Takashi Ishikawa | Data encoding apparatus, data encoding method, and recording medium recorded with program |
| US20070217703A1 (en) * | 2006-03-17 | 2007-09-20 | Canon Kabushiki Kaisha | Image encoding apparatus, image decoding apparatus and control method therefor |
| JP2008042529A (en) * | 2006-08-07 | 2008-02-21 | Fuji Xerox Co Ltd | Code amount evaluating device, image forming apparatus, and program |
| CN101534373A (en) * | 2009-04-24 | 2009-09-16 | 北京空间机电研究所 | Hardware Implementation Method of Near Lossless Compression of Remote Sensing Image Based on Improved JPEG-LS Algorithm |
| CN101771874A (en) * | 2009-12-31 | 2010-07-07 | 华中科技大学 | Satellite image compression method and device for realizing satellite image compression |
| CN105828070A (en) * | 2016-03-23 | 2016-08-03 | 华中科技大学 | Anti-error code propagation JPEG-LS image lossless/near-lossless compression algorithm hardware realization method |
-
2018
- 2018-02-02 CN CN201810107628.XA patent/CN108282662B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6987468B1 (en) * | 2004-10-29 | 2006-01-17 | Microsoft Corporation | Lossless adaptive encoding and decoding of integer data |
| US20060273937A1 (en) * | 2005-06-01 | 2006-12-07 | Takashi Ishikawa | Data encoding apparatus, data encoding method, and recording medium recorded with program |
| US20070217703A1 (en) * | 2006-03-17 | 2007-09-20 | Canon Kabushiki Kaisha | Image encoding apparatus, image decoding apparatus and control method therefor |
| JP2008042529A (en) * | 2006-08-07 | 2008-02-21 | Fuji Xerox Co Ltd | Code amount evaluating device, image forming apparatus, and program |
| CN101534373A (en) * | 2009-04-24 | 2009-09-16 | 北京空间机电研究所 | Hardware Implementation Method of Near Lossless Compression of Remote Sensing Image Based on Improved JPEG-LS Algorithm |
| CN101771874A (en) * | 2009-12-31 | 2010-07-07 | 华中科技大学 | Satellite image compression method and device for realizing satellite image compression |
| CN105828070A (en) * | 2016-03-23 | 2016-08-03 | 华中科技大学 | Anti-error code propagation JPEG-LS image lossless/near-lossless compression algorithm hardware realization method |
Cited By (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2024216514A1 (en) * | 2023-04-18 | 2024-10-24 | 华为技术有限公司 | Data compression method, data decompression method, and related apparatus |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108282662B (en) | 2021-02-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US20200177919A1 (en) | Method for Producing Video Coding and Programme-Product | |
| US6677869B2 (en) | Arithmetic coding apparatus and image processing apparatus | |
| US6654419B1 (en) | Block-based, adaptive, lossless video coder | |
| KR100845090B1 (en) | Image encoding apparatus, image decoding apparatus and control method therefor | |
| US6549676B1 (en) | Encoding device | |
| JP5736032B2 (en) | Adaptive binarization for arithmetic coding | |
| JP5545783B2 (en) | Method for decoding a stream of encoded data representing an image sequence and method for encoding an image sequence | |
| BR112015032982B1 (en) | DATA DECODING AND ENCRYPTING METHODS, NON-TRANSITORY MACHINE READABLE STORAGE MEDIA, AND DATA DECODING AND ENCRYPTING, AND VIDEO DATA CAPTURING, TRANSMISSION, DISPLAY AND/OR STORAGE APPARATUS | |
| CN109788285A (en) | A context model selection method and device for quantization coefficient end flag bit | |
| CN107743239A (en) | Method and device for encoding and decoding video data | |
| KR20220007853A (en) | Method and apparatus for compressing parameters of a neural network | |
| KR20040104611A (en) | Method and arrangement for arithmetically encoding and decoding binary states, corresponding computer program, and corresponding computer-readable storage medium | |
| JP2005223533A (en) | Arithmetic decoding apparatus and arithmetic decoding program | |
| CN110291793A (en) | Method and device for range derivation in context-adaptive binary arithmetic codec | |
| JP6727011B2 (en) | Image coding apparatus and control method thereof | |
| CN108282662A (en) | A kind of optimization method and device of continuous tone Static Picture Compression | |
| CN106537914B (en) | The method and apparatus of arithmetic compiling is executed by the carry operations of limitation | |
| CN119052478A (en) | Image coding method, image reconstruction method and device | |
| CN110191341A (en) | A method for encoding and decoding depth data | |
| CN1723623B (en) | Method for processing digital data values | |
| JP4631879B2 (en) | Encoding processing device | |
| JPH0937262A (en) | Image processing unit and method | |
| WO2019191886A1 (en) | Probability update method and apparatus for context | |
| Jiang | A novel parallel design of a codec for black and white image compression | |
| JP4936574B2 (en) | Encoding apparatus and control method thereof |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |