CN106101731A - Lossless Image Compression Algorithm method and device - Google Patents
Lossless Image Compression Algorithm method and device Download PDFInfo
- Publication number
- CN106101731A CN106101731A CN201610581684.8A CN201610581684A CN106101731A CN 106101731 A CN106101731 A CN 106101731A CN 201610581684 A CN201610581684 A CN 201610581684A CN 106101731 A CN106101731 A CN 106101731A
- Authority
- CN
- China
- Prior art keywords
- pixel
- gradient
- prediction
- template
- residual error
- 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
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/90—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using coding techniques not provided for in groups H04N19/10-H04N19/85, e.g. fractals
- H04N19/91—Entropy coding, e.g. variable length coding [VLC] or arithmetic coding
-
- 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/182—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 pixel
-
- 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/42—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals characterised by implementation details or hardware specially adapted for video compression or decompression, e.g. dedicated software implementation
-
- 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
Landscapes
- Engineering & Computer Science (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Compression Of Band Width Or Redundancy In Fax (AREA)
Abstract
The invention provides a kind of Lossless Image Compression Algorithm method and device, wherein method includes: for current pixel, selected reference pixel template, and sets multiple gradient calculation direction in reference pixel template；To each direction, calculated direction gradient；The direction that choice direction gradient is minimum, is calculated the prediction pixel of current pixel according to current pixel some pixels in the same direction in the direction；Current pixel is subtracted each other with prediction pixel and obtains pixel residual error, utilize pixel residual error to encode.By the present invention, the compression ratio of lossless compress can be improved.
Description
Technical field
The present invention relates to Image Compression field, particularly relate to a kind of Lossless Image Compression Algorithm method and device.
Background technology
In some applications, due to the needs of high-fidelity, view data can not have any loss in compression process,
So needing image is carried out lossless compress.The lossless compress of image, is that the statistical redundancy utilizing data is compressed, can be complete
Recover initial data and do not cause any distortion, but compression ratio is affected by the theoretical restriction of data statistics redundancy, Normal squeezing
Rate is 2:1 to 5:1.This kind of method is widely used in the view data of text data, routine data and particular application (such as fingerprint
Image, medical image etc.) compression.
The lossless compression algorithm of image is divided three classes: the first kind is the method for prediction-entropy code, such as JPEG-LS (Joint
Photographic Experts Group-Lossless/Near Lossless)、CALIC(Context_Based,
Adaptive, Lossless Image Compression) etc.；Equations of The Second Kind is method based on conversion, in JPEG-2000
Lossless coding pattern；3rd class is method based on dictionary, such as GIF, PNG etc..
Main method of based on prediction-entropy code is described below.
JPEG-LS uses one and is named as LOCO-I (A Low Complexity, Context-Based, Lossless
Image Compression Algorithm) algorithm perform reality picture coding, in this approach, an image
Pixel from top to bottom, encode the most pixel-by-pixel.See Fig. 1, for LOCO-I algorithm pixel prediction schematic diagram.This is pre-
Method of determining and calculating essence is that current region carries out a simple gradient calculation, then predicts that the direction parallel along border is carried out.
For the prediction of current pixel X to be encoded, it is to select different variable-length encoding patterns residual to prediction according to the gradient between A, B, C
Difference encodes.After obtaining predictive value, current pixel is subtracted each other with prediction pixel and obtains prediction residual, it was predicted that residual error sends into entropy
Encoder encodes.
A more complicated Forecasting Methodology based on image gradient, its template is used compared to JPEG-LS, CALIC
As in figure 2 it is shown, wherein X is pixel to be encoded, remaining is template.Calculate horizontal gradient and the vertical gradient of X.Calculate with LOCO-I
Method is similar to, and after obtaining predictive value, is subtracted each other with prediction pixel by current pixel and obtains prediction residual, it was predicted that residual error sends into entropy code
Device encodes.
Existing image lossless method based on prediction-entropy code, such as JPEG-LS, CALIC etc., is more due to take
Simple gradient calculation, therefore compression accuracy has to be hoisted.
Summary of the invention
In order to improve compression efficiency, the embodiment of the present invention provides a kind of Lossless Image Compression Algorithm method based on direction and dress
Put.
A kind of Lossless Image Compression Algorithm method, including:
For current pixel, selected reference pixel template, and in reference pixel template, set multiple gradient calculation direction；
To each direction, calculated direction gradient；
The direction that choice direction gradient is minimum, is calculated currently by current pixel some pixels in the same direction in the direction
The prediction pixel of pixel；
Current pixel is subtracted each other with prediction pixel and obtains pixel residual error, utilize pixel residual error to encode.
Preferably, described to each direction, calculated direction gradient, including:
To each direction, calculate in reference pixel template in each pixel and its this adjacent direction in the same direction as
Gradient quadratic sum between element, adds up each pixel in reference pixel template in the gradient quadratic sum in described direction, obtains institute
State the direction gradient in direction.
Preferably, bilinear interpolation algorithm is used to calculate described gradient quadratic sum.
Preferably, by the prediction pixel of following formula calculating current pixel:
A=c0×w0+c1×w1+…+cn×(1-w0-w1-wn-1)
Wherein, a represents current pixel, c0、c1…cnRepresent distance a on gradient minimum direction from closely to remote in the same direction as
Element, w0、w1、wn-1For constant.
Preferably, described pixel residual error is utilized to encode, including:
Pixel residual error is input to entropy coder encode, wherein, described entropy coder be based on Huffman encoding or
Arithmetic coding based on content.
A kind of Lossless Image Compression Algorithm device, including:
Direction arranges unit, for for current pixel, selectes reference pixel template, and sets in reference pixel template
Multiple gradient calculation directions；
Direction gradient computing unit, for each direction, calculated direction gradient；
Pixel prediction unit, for the direction that choice direction gradient is minimum, according to current pixel in the direction some
Pixel is calculated the prediction pixel of current pixel in the same direction；
Coding unit, obtains pixel residual error for being subtracted each other with prediction pixel by current pixel, utilizes pixel residual error to compile
Code.
Preferably, described direction gradient computing unit specifically for, to each direction, calculate in reference pixel template every
The gradient quadratic sum between pixel in the same direction in one pixel and its this adjacent direction, by each picture in reference pixel template
The element gradient quadratic sum in described direction adds up, and obtains the direction gradient in described direction.
Preferably, bilinear interpolation algorithm is used to calculate described gradient quadratic sum.
Preferably, described pixel prediction unit is by the prediction pixel of following formula calculating current pixel:
A=c0×w0+c1×w1+…+cn×(1-w0-w1-wn-1)
Wherein, a represents current pixel, c0、c1…cnRepresent distance a on gradient minimum direction from closely to remote in the same direction as
Element, w0、w1、wn-1For constant.
Preferably, described coding unit specifically for, pixel residual error is input to entropy coder and encodes, wherein, institute
Stating entropy coder is based on Huffman encoding or arithmetic coding based on content.
Visible, the present invention is by setting multiple directions in reference pixel template, and calculates all directions gradient, chooses ladder
The direction of degree minimum carries out the prediction of current pixel.Showing that owing to gradient is the least the difference of pixel residual error is the least, image change is more
Smooth, therefore can obtain pixel predictors the most accurately, and then improve the compression ratio of lossless compress.
Accompanying drawing explanation
Fig. 1 is prior art LOCO-I algorithm pixel prediction schematic diagram；
Fig. 2 is prior art CALIC algorithm pixel prediction schematic diagram；
Fig. 3 is a kind of Lossless Image Compression Algorithm method flow diagram that the embodiment of the present invention provides；
Fig. 4 is that in a kind of Lossless Image Compression Algorithm method that the embodiment of the present invention provides, all directions set schematic diagram；
Fig. 5 is certain pixel in certain direction and pixel in the same direction in a kind of Lossless Image Compression Algorithm method that the embodiment of the present invention provides
Corresponding schematic diagram；
Fig. 6 is direction, minimal gradient place schematic diagram in a kind of Lossless Image Compression Algorithm method that the embodiment of the present invention provides；
Fig. 7 is a kind of Lossless Image Compression Algorithm apparatus structure schematic diagram that the embodiment of the present invention provides.
Detailed description of the invention
Understandable for enabling the above-mentioned purpose of the present invention, feature and advantage to become apparent from, real with concrete below in conjunction with the accompanying drawings
The present invention is further detailed explanation to execute mode.
The embodiment of the present invention, based on a previously selected reference pixel template, sets multiple side in reference pixel template
To, by calculating the gradient in each direction, selecting the direction that gradient is minimum, the prediction of present encoding pixel a will by a in gradient
Some pixels in the same direction on this little direction are calculated by filtering interpolation.
With reference to Fig. 3, a kind of Lossless Image Compression Algorithm method flow diagram provided for the embodiment of the present invention, the method comprising the steps of
S301-S304.
S301: for current pixel, selected reference pixel template, and in reference pixel template, set multiple gradient calculation
Direction.
The present invention uses the framework of the prediction-entropy code the same with LOCO-I or CALIC.For an image to be encoded,
The present invention encodes each pixel from left to right, the most one by one, until finishing image scanning.
As shown in Figure 4, if a is current pixel (pixel to be encoded), first define from its adjacent encoded pixel region
One its reference pixel template, such as A, B, C ... the K of Fig. 4, but the present invention does not limit the shape of reference pixel template.So
After, the present invention defines a series of direction.As 0-135 degree is divided into 7 directions by Fig. 4 present invention.But the present invention not side of restriction
To number, definable direction number range can be from 3-70.It is appreciated that direction number is the most, calculates the most accurate, but
Needs occupy and more calculate resource, and affect calculating speed.It is therefore preferred that the direction number set is optimum at 3-35,
Most 70.
S302: to each direction, calculated direction gradient.
Concrete, to each direction, calculate in reference pixel template in each pixel and its this adjacent direction
Pixel in the same direction between gradient quadratic sum add up.It will therefore be appreciated that " direction gradient " refers to: on some direction, reference
In template pixel, the gradient quadratic sum between the pixel in the same direction on each pixel and its this adjacent direction adds up.That is, to often
One direction, calculates between the pixel in the same direction on this direction that each pixel and this pixel in reference pixel template are adjacent
Gradient quadratic sum, adds up each pixel in reference pixel template in the gradient quadratic sum of the direction, obtains the direction of the direction
Gradient.
Direction as shown in Figure 5, along direction as shown, the pixel in the same direction that E point is corresponding is c, and the pixel in the same direction that F point is corresponding is d,
Because they are seated in sub-pixel position, so they do not exist, so they being calculated with interpolation algorithm.
Such as, for c, bilinear interpolation algorithm can be used to calculate with B and D.Assume c place pixel column relative to
The side-play amount of B be x, x be one more than 0 less than 1 decimal, then use bilinear interpolation, the meter of the pixel value of simplest c
Calculate as follows:
C=B × (1-x)+D × x
Accordingly, the calculated for pixel values of d is as follows:
D=G × (1-x)+H × x
In like manner, for any one pixel N in reference pixel template, it is assumed that its pixel in the same direction is Nd, reference pixel
The collection of all pixels of template is combined into Ω, then the gradient calculation on this direction is as follows:
S303: select the direction that gradient is minimum, be calculated according to current pixel some pixels in the same direction in the direction
The prediction pixel of current pixel.
See Fig. 6, the prediction of present encoding pixel a by by a some pixels in the same direction on gradient minimum direction by inserting
Value filtering is calculated.After the present invention calculates the directive gradient of institute, select wherein minimum gradient and corresponding direction,
The prediction of a will be calculated by a fixing interpolation filter by a some pixels in the same direction on the minimum direction of gradient.
Assuming that the minimum direction of gradient is the direction such as Fig. 6, b, d and e are a in this direction three pixels in the same direction, then a's is pre-
Survey as follows:
A=b × w0+d×w1+e×(1-w0-w1)
Wherein: w0And w1Being two constants, it is obtained by training.
It is appreciated that the pixel in the same direction that distance a is the nearest, owing to weight coefficient is the biggest, the therefore constant one of its correspondence
As the biggest.If the distance of Fig. 6 and the example of above-mentioned formula, b, d, e and a is from closely to far, therefore the coefficient in formula may
Situation be w0>w1>1-w0-w1.But, the magnitude relationship of three coefficients is not absolute, distance nearest same of current pixel
Being maximum to the constant that pixel is corresponding, the constant corresponding apart from the pixel in the same direction that current pixel time is near likely becomes negative,
The constant corresponding apart from the pixel in the same direction that current pixel is farthest is the most again positive.It addition, multiple directions can have one group normal
Numerical value, as long as the number of pixels in the same direction in all directions is equal.It is above on gradient minimum direction, having 3 pixels in the same direction
As a example by illustrate.It practice, be not limiting as number of pixels in the same direction, the following is general prediction pixel formula:
A=c0×w0+c1×w1+…+cn×(1-w0-w1-wn-1)
Wherein, a represents current pixel, c0、c1…cnRepresent distance a on gradient minimum direction from closely to remote some with
To pixel, w0、w1、wn-1It is the constant obtained beforehand through training, and, w0>w1>wn-1>1-w0-w1-wn-1。
S304: current pixel is subtracted each other with prediction pixel and obtains pixel residual error, utilize pixel residual error to encode.
After prediction completes, current pixel and prediction pixel are subtracted each other and obtains pixel residual error, pixel residual error is sent into entropy and compiles
Code device encodes.Entropy coder can use Columbus the most as shown in table 1 to encode, and it belongs to the one of Huffman encoding
Kind.
Table 1
| Pixel residual error | Code word |
| 0 | 1 |
| 1 | 010 |
| -1 | 011 |
| 2 | 00100 |
| -2 | 00101 |
| 3 | 00110 |
| -3 | 00111 |
| 4 | 0001000 |
| -4 | 0001001 |
| … | … |
Except using above-mentioned Columbus's coding, it is also possible to select arithmetic coding based on content.Arithmetic based on content
Coding can select different content models with minimum direction gradient as condition, carry out the binary character that residual error is corresponding
Adaptive binary arithmetic coding.The present invention does not limit the entropy coding method of residual error.
Visible, the present invention is by setting multiple directions in reference pixel template, and calculates all directions gradient, chooses ladder
The direction of degree minimum carries out the prediction of current pixel.Showing that owing to gradient is the least the difference of pixel residual error is the least, image change is more
Smooth, therefore can obtain pixel predictors the most accurately, and then improve the compression ratio of lossless compress.
It should be noted that for embodiment of the method, in order to be briefly described, therefore it is all expressed as a series of action group
Closing, but those skilled in the art should know, the embodiment of the present invention is not limited by described sequence of movement, because depending on
According to the embodiment of the present invention, some step can use other orders or carry out simultaneously.Secondly, those skilled in the art also should
Knowing, embodiment described in this description belongs to preferred embodiment, and the involved action not necessarily present invention implements
Necessary to example.
With reference to Fig. 7, it is the structural scheme of mechanism of a kind of Lossless Image Compression Algorithm device that the embodiment of the present invention provides, this device bag
Include:
Direction arranges unit 701, for for current pixel, selectes reference pixel template, and in reference pixel template
Set multiple gradient calculation direction；
Direction gradient computing unit 702, for each direction, calculated direction gradient；
Pixel prediction unit 703, for the direction that choice direction gradient is minimum, if according to current pixel in the direction
Dry pixel in the same direction is calculated the prediction pixel of current pixel；
Coding unit 704, obtains pixel residual error for being subtracted each other with prediction pixel by current pixel, utilizes pixel residual error to carry out
Coding.
Preferably, described direction gradient computing unit 702 specifically for, to each direction, calculate reference pixel template
In gradient quadratic sum between pixel in the same direction on each pixel and its this adjacent direction, by each in reference pixel template
Individual pixel adds up in the gradient quadratic sum of the direction, obtains the direction gradient of the direction.
Preferably, use bilinear interpolation algorithm to calculate described gradient quadratic sum to add up.
Preferably, described pixel prediction unit 703 is by the prediction pixel of following formula calculating current pixel:
A=c0×w0+c1×w1+…+cn×(1-w0-w1-wn-1)
Wherein, a represents current pixel, c0、c1…cnRepresent distance a on gradient minimum direction from closely to remote in the same direction as
Element, w0、w1、wn-1For constant.
Preferably, described coding unit 704 specifically for, pixel residual error is input to entropy coder and encodes, wherein,
Described entropy coder is based on Hough coding or arithmetic coding based on content.
For device embodiment, due to itself and embodiment of the method basic simlarity, so describe is fairly simple, relevant
Part sees the part of embodiment of the method and illustrates.
Each embodiment in this specification all uses the mode gone forward one by one to describe, what each embodiment stressed is with
The difference of other embodiments, between each embodiment, identical similar part sees mutually.
Those skilled in the art are it should be appreciated that the embodiment of the embodiment of the present invention can be provided as method, device or calculate
Machine program product.Therefore, the embodiment of the present invention can use complete hardware embodiment, complete software implementation or combine software and
The form of the embodiment of hardware aspect.And, the embodiment of the present invention can use one or more wherein include computer can
With in the computer-usable storage medium (including but not limited to disk memory, CD-ROM, optical memory etc.) of program code
The form of the computer program implemented.
The embodiment of the present invention is with reference to method, terminal unit (system) and computer program according to embodiments of the present invention
The flow chart of product and/or block diagram describe.It should be understood that can be by computer program instructions flowchart and/or block diagram
In each flow process and/or the flow process in square frame and flow chart and/or block diagram and/or the combination of square frame.These can be provided
Computer program instructions sets to general purpose computer, special-purpose computer, Embedded Processor or other programmable data processing terminals
Standby processor is to produce a machine so that held by the processor of computer or other programmable data processing terminal equipment
The instruction of row produces for realizing in one flow process of flow chart or multiple flow process and/or one square frame of block diagram or multiple square frame
The device of the function specified.
These computer program instructions may be alternatively stored in and can guide computer or other programmable data processing terminal equipment
In the computer-readable memory worked in a specific way so that the instruction being stored in this computer-readable memory produces bag
Including the manufacture of command device, this command device realizes in one flow process of flow chart or multiple flow process and/or one side of block diagram
The function specified in frame or multiple square frame.
These computer program instructions also can be loaded on computer or other programmable data processing terminal equipment so that
On computer or other programmable terminal equipment, execution sequence of operations step is to produce computer implemented process, thus
The instruction performed on computer or other programmable terminal equipment provides for realizing in one flow process of flow chart or multiple flow process
And/or the step of the function specified in one square frame of block diagram or multiple square frame.
Although having been described for the preferred embodiment of the embodiment of the present invention, but those skilled in the art once knowing base
This creativeness concept, then can make other change and amendment to these embodiments.So, claims are intended to be construed to
The all changes including preferred embodiment and falling into range of embodiment of the invention and amendment.
Finally, in addition it is also necessary to explanation, in this article, the relational terms of such as first and second or the like be used merely to by
One entity or operation separate with another entity or operating space, and not necessarily require or imply these entities or operation
Between exist any this reality relation or order.And, term " includes ", " comprising " or its any other variant meaning
Containing comprising of nonexcludability, so that include that the process of a series of key element, method, article or terminal unit not only wrap
Include those key elements, but also include other key elements being not expressly set out, or also include for this process, method, article
Or the key element that terminal unit is intrinsic.In the case of there is no more restriction, by wanting that statement " including ... " limits
Element, it is not excluded that there is also other identical element in including the process of described key element, method, article or terminal unit.
Dispatching method and system to a kind of relevant database provided by the present invention, is described in detail above,
Principle and the embodiment of the present invention are set forth by specific case used herein, and the explanation of above example is simply used
In helping to understand method and the core concept thereof of the present invention；Simultaneously for one of ordinary skill in the art, according to the present invention's
Thought, the most all will change, and in sum, this specification content should not be construed as
Limitation of the present invention.
Claims (10)
1. a Lossless Image Compression Algorithm method, it is characterised in that including:
For current pixel, selected reference pixel template, and in described reference pixel template, set the side of multiple gradient calculation
To；
To each direction, calculated direction gradient；
The direction that choice direction gradient is minimum, is calculated current picture according to current pixel some pixels in the same direction in the direction
The prediction pixel of element；
Current pixel is subtracted each other with prediction pixel and obtains pixel residual error, utilize pixel residual error to encode.
2. the method for claim 1, it is characterised in that described to each direction, calculated direction gradient, including:
To each direction, calculate on this direction that each pixel and this pixel in reference pixel template are adjacent in the same direction as
Gradient quadratic sum between element, adds up each pixel in reference pixel template in the gradient quadratic sum in described direction, obtains institute
State the direction gradient in direction.
3. method as claimed in claim 2, it is characterised in that use bilinear interpolation algorithm to calculate described gradient quadratic sum.
4. the method for claim 1, it is characterised in that by the prediction pixel of following formula calculating current pixel:
A=c0×w0+c1×w1+…+cn×(1-w0-w1-wn-1)
Wherein, a represents current pixel, c0、c1…cnRepresent that distance a on gradient minimum direction is from closely to remote pixel in the same direction, w0、
w1、wn-1For constant.
5. the method for claim 1, it is characterised in that described utilize pixel residual error to encode, including:
Described pixel residual error is input to entropy coder encode, wherein, described entropy coder be based on Huffman encoding or
Arithmetic coding based on content.
6. a Lossless Image Compression Algorithm device, it is characterised in that including:
Direction arranges unit, for for current pixel, selectes reference pixel template, and sets in described reference pixel template
The direction of multiple gradient calculation；
Direction gradient computing unit, for each direction, calculated direction gradient；
Pixel prediction unit, for the direction that choice direction gradient is minimum, according to current pixel in the direction some in the same direction
Pixel is calculated the prediction pixel of current pixel；
Coding unit, obtains pixel residual error for being subtracted each other with prediction pixel by current pixel, utilizes pixel residual error to encode.
7. device as claimed in claim 6, it is characterised in that described direction gradient computing unit specifically for, to each
Direction, calculates the gradient between the pixel in the same direction on this direction that each pixel and this pixel in reference pixel template are adjacent
Quadratic sum, adds up each pixel in reference pixel template in the gradient quadratic sum in described direction, obtains the direction in described direction
Gradient.
8. device as claimed in claim 7, it is characterised in that use bilinear interpolation algorithm to calculate described gradient quadratic sum.
9. device as claimed in claim 6, it is characterised in that described pixel prediction unit calculates current picture by following formula
The prediction pixel of element:
A=c0×w0+c1×w1+…+cn×(1-w0-w1-wn-1)
Wherein, a represents current pixel, c0、c1…cnRepresent that distance a on gradient minimum direction is from closely to remote pixel in the same direction, w0、
w1、wn-1For constant.
10. device as claimed in claim 6, it is characterised in that described coding unit specifically for, by defeated for described pixel residual error
Entering and encode to entropy coder, wherein, described entropy coder is based on Huffman encoding or arithmetic coding based on content.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610581684.8A CN106101731B (en) | 2016-07-21 | 2016-07-21 | Lossless Image Compression Algorithm method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201610581684.8A CN106101731B (en) | 2016-07-21 | 2016-07-21 | Lossless Image Compression Algorithm method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106101731A true CN106101731A (en) | 2016-11-09 |
| CN106101731B CN106101731B (en) | 2019-06-21 |
Family
ID=57449968
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201610581684.8A Active CN106101731B (en) | 2016-07-21 | 2016-07-21 | Lossless Image Compression Algorithm method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106101731B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109474799A (en) * | 2018-10-26 | 2019-03-15 | 西安科锐盛创新科技有限公司 | Image storage method and its system based on video monitoring |
| CN112714318A (en) * | 2020-12-09 | 2021-04-27 | 上海顺久电子科技有限公司 | Image data compression method and compression device thereof |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101009832A (en) * | 2006-01-23 | 2007-08-01 | 三星电子株式会社 | Directional interpolation method and video encoding/decoding apparatus and method using the directional interpolation method |
| US20070237237A1 (en) * | 2006-04-07 | 2007-10-11 | Microsoft Corporation | Gradient slope detection for video compression |
| CN101529916A (en) * | 2006-10-31 | 2009-09-09 | 汤姆森许可贸易公司 | Video encoding with intra encoding selection |
| CN102186081A (en) * | 2011-05-11 | 2011-09-14 | 北京航空航天大学 | H.264 intra-frame mode selection method based on gradient vector |
| US20130121401A1 (en) * | 2011-11-16 | 2013-05-16 | Alexander Zheludkov | Video compression for high efficiency video coding |
| CN103997645A (en) * | 2014-04-29 | 2014-08-20 | 长沙理工大学 | Quick HEVC intra-frame coding unit and pattern decision method |
| CN104796701A (en) * | 2015-03-27 | 2015-07-22 | 北京君正集成电路股份有限公司 | Predication mode determination method and device based on HEVC (High Efficiency Video Coding) |
-
2016
- 2016-07-21 CN CN201610581684.8A patent/CN106101731B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101009832A (en) * | 2006-01-23 | 2007-08-01 | 三星电子株式会社 | Directional interpolation method and video encoding/decoding apparatus and method using the directional interpolation method |
| US20070237237A1 (en) * | 2006-04-07 | 2007-10-11 | Microsoft Corporation | Gradient slope detection for video compression |
| CN101529916A (en) * | 2006-10-31 | 2009-09-09 | 汤姆森许可贸易公司 | Video encoding with intra encoding selection |
| CN102186081A (en) * | 2011-05-11 | 2011-09-14 | 北京航空航天大学 | H.264 intra-frame mode selection method based on gradient vector |
| US20130121401A1 (en) * | 2011-11-16 | 2013-05-16 | Alexander Zheludkov | Video compression for high efficiency video coding |
| CN103997645A (en) * | 2014-04-29 | 2014-08-20 | 长沙理工大学 | Quick HEVC intra-frame coding unit and pattern decision method |
| CN104796701A (en) * | 2015-03-27 | 2015-07-22 | 北京君正集成电路股份有限公司 | Predication mode determination method and device based on HEVC (High Efficiency Video Coding) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109474799A (en) * | 2018-10-26 | 2019-03-15 | 西安科锐盛创新科技有限公司 | Image storage method and its system based on video monitoring |
| CN109474799B (en) * | 2018-10-26 | 2021-03-02 | 深圳市天天来玩科技有限公司 | Image storage method and system based on video monitoring |
| CN112714318A (en) * | 2020-12-09 | 2021-04-27 | 上海顺久电子科技有限公司 | Image data compression method and compression device thereof |
| CN112714318B (en) * | 2020-12-09 | 2023-11-07 | 上海顺久电子科技有限公司 | Image data compression method and compression device thereof |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106101731B (en) | 2019-06-21 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN108141594A (en) | For being encoded to image or decoded method and apparatus | |
| CN107113425A (en) | Method for video coding and equipment and video encoding/decoding method and equipment | |
| CN104661031A (en) | Method for coding and decoding video image, coding equipment and decoding equipment | |
| KR20190117708A (en) | Encoding unit depth determination method and apparatus | |
| CN104394418A (en) | Method and device for coding video data and method and device for decoding video data | |
| CN105306956B (en) | A kind of method of raising HEVC encoder discrete cosine transform processing speeds | |
| CN103119935A (en) | Image interpolation method and apparatus | |
| KR20110081200A (en) | Pixel prediction value generation procedure automatic generation method, image encoding method, image decoding method, devices using these methods, programs for these methods, and recording medium on which these programs are recorded | |
| CN110753225A (en) | Video compression method and device and terminal equipment | |
| CN107770525A (en) | A kind of method and device of Image Coding | |
| CN107211133A (en) | Method, device and the decoding device of inverse quantization conversion coefficient | |
| CN104539949A (en) | HEVC screen coding quick slicing based on edge directions | |
| CN100534188C (en) | An image compression method and device | |
| CN106101731A (en) | Lossless Image Compression Algorithm method and device | |
| CN106231322A (en) | Lossless image compression method and device | |
| CN110352599A (en) | Method for video processing and equipment | |
| CN107295338B (en) | Image compression and decompression method based on lossless joint image expert group format | |
| CN104244010A (en) | Method for improving digital signal conversion performance and digital signal conversion method and device | |
| JP5187062B2 (en) | Moving picture coding apparatus and moving picture coding method | |
| CN108520532B (en) | Method and device for identifying motion direction of object in video | |
| CN116600119B (en) | Video encoding method, video decoding method, video encoding device, video decoding device, computer equipment and storage medium | |
| CN105791863B (en) | 3D-HEVC depth map intra-frame predictive encoding method based on layer | |
| JP2018182531A (en) | Division shape determining apparatus, learning apparatus, division shape determining method, and division shape determining program | |
| KR102250088B1 (en) | Method and Apparatus for decoding video stream | |
| CN104618715A (en) | Method and device for obtaining minimal rate-distortion cost |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |