CN108429916A - Image encoding method and device - Google Patents
Image encoding method and device Download PDFInfo
- Publication number
- CN108429916A CN108429916A CN201810160152.6A CN201810160152A CN108429916A CN 108429916 A CN108429916 A CN 108429916A CN 201810160152 A CN201810160152 A CN 201810160152A CN 108429916 A CN108429916 A CN 108429916A
- Authority
- CN
- China
- Prior art keywords
- bit
- planes
- encoded
- stream
- module
- 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/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/184—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 bits, e.g. of the compressed video stream
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N19/00—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
- H04N19/60—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding
- H04N19/63—Methods or arrangements for coding, decoding, compressing or decompressing digital video signals using transform coding using sub-band based transform, e.g. wavelets
-
- 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
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
A kind of image encoding method of disclosure offer and device, are related to technical field of image processing, can solve to repeat compared pixels value and threshold value in image encoding process, the problem of increasing time and the operand of image coding, cause coding redundancy.Specific technical solution is：Obtain pending picture frame；Wavelet decomposition is carried out to pending picture frame and obtains original bit；The bit-planes that bit in original bit is less than or equal to predetermined bit plane are determined as the first bit-planes；The bit-planes that bit in original bit is more than to predetermined bit plane are determined as the second bit-planes；Data in first bit-planes are directly exported to bit value and obtain the first bit stream to be encoded；Data in second bit-planes are handled according to spiht algorithm to obtain the second bit stream to be encoded；First bit stream to be encoded and the second bit stream to be encoded are subjected to entropy coding.The present invention is encoded for image.
Description
Technical field
This disclosure relates to technical field of image processing more particularly to a kind of image encoding method and device.
Background technology
Image Compression is particularly important in the process in storing and transmitting for image data, and efficient compression of images can be delayed
The problems such as image storage space is limited, network bandwidth is limited is solved, wherein the multistage tree set partitioning (Set based on wavelet transformation
Partitioning in Hierarchical Tree, SPIHT) for algorithm due to its compression efficiency height, computation complexity is low, can
Realize that the characteristics such as gradual transmission are widely applied in compression of images field.But using spiht algorithm to image into
When row coding, spiht algorithm needs to repeat compared pixels value and threshold value, increases time and the operand of image coding, causes
Coding redundancy.
Invention content
A kind of image encoding method of embodiment of the present disclosure offer and device, can solve to repeat to compare in image encoding process
The problem of pixel value and threshold value increase time and the operand of image coding, cause coding redundancy.The technical solution is such as
Under：
According to the first aspect of the embodiments of the present disclosure, a kind of image encoding method is provided, this method includes：
Pending picture frame is obtained, pending picture frame includes at least one macro block；
Wavelet decomposition is carried out to each macro block in pending picture frame and obtains the wavelet coefficient of at least one small nodal point
And form original bit；
Bit in original bit is determined as the first bit less than or equal to the bit-planes of predetermined bit plane to put down
Face；The bit-planes that bit in original bit is more than to predetermined bit plane are determined as the second bit-planes；
Data in first bit-planes are directly exported to bit value and obtain the first bit stream to be encoded；
Data in second bit-planes are handled to obtain second according to multistage tree set partitioning spiht algorithm and wait compiling
Code bit stream；
First bit stream to be encoded and the second bit stream to be encoded are subjected to entropy coding.
It is more than the bit-planes of predetermined bit plane for bit, the data of high order bit position are more important, to image
Quality is affected, and is handled using spiht algorithm, ensures picture quality, and is less than or equal to default ratio for bit
The bit-planes of special plane, because being the bit of low level, data are not particularly significant, directly export bit value, are reduced
Encoder complexity, reduces the scramble time.
In one embodiment, this method further includes：
Maximal bit position is determined according to the maximum wavelet coefficient in the wavelet coefficient of at least one small nodal point；
Determine that predetermined bit plane, predetermined bit plane are less than or equal to maximal bit position according to maximal bit position.
The maximal bit position of data is different in different images frame, and predetermined bit plane is determined according to maximal bit position,
It is capable of the cataloged procedure of the various picture frames of flexible adaptation.
In one embodiment, it is determined according to the maximum wavelet coefficient in the wavelet coefficient of at least one small nodal point maximum
Bit, including：
According to formula k=floor (log2 (max | Cr,c|)) calculate maximal bit position；Wherein, Cr,cFor wavelet coefficient, k
For maximal bit position.
In one embodiment, the data in the second bit-planes are carried out according to multistage tree set partitioning spiht algorithm
Processing obtains the second bit stream to be encoded, including：
Determine the judgment threshold of each bit-planes in the second bit-planes；
The second ratio is determined according to the absolute value of each numerical value in the second bit-planes and the judgment threshold of each bit-planes
The bit to be encoded of each bit output in special plane；
The second bit stream to be encoded is formed according to the bit to be encoded of each bit output in the second bit-planes.
For the data for including in the second bit-planes, according to the exhausted of the judgment threshold of each bit-planes and each numerical value
Bit to be encoded is exported to value, the data volume of the second bit stream to be encoded is further compressed, reduces encoder complexity.
In one embodiment, the second bit stream to be encoded includes wavelet coefficient bit；Further include wavelet coefficient signs
At least one of in position, the empty mark of descendants's set, the number joint skies of Sun Jihe tetra- mark, Sun Jihe skies mark.
According to the second aspect of the embodiment of the present disclosure, a kind of picture coding device is provided, including：Acquisition module, small wavelength-division
Solve module, bit-planes sort module, the first data processing module, the second data processing module and coding module；
Acquisition module, for obtaining pending picture frame, pending picture frame includes at least one macro block；
Wavelet decomposition module is at least one small for being obtained to each macro block progress wavelet decomposition in pending picture frame
The wavelet coefficient of nodal point simultaneously forms original bit；
Bit-planes sort module, the bit for bit in original bit to be less than or equal to predetermined bit plane
Plane is determined as the first bit-planes；The bit-planes that bit in original bit is more than to predetermined bit plane are determined as the
Two bit-planes；
First data processing module obtains first for the data in the first bit-planes directly to be exported to bit value and waits for
Coded bit stream；
Second data processing module, for calculating the data in the second bit-planes according to multistage tree set partitioning SPIHT
Method is handled to obtain the second bit stream to be encoded；
Coding module, for the first bit stream to be encoded and the second bit stream to be encoded to be carried out entropy coding.
In one embodiment, picture coding device further includes：Maximal bit position module and predetermined bit planar module；
Maximal bit position module, for being determined according to the maximum wavelet coefficient in the wavelet coefficient of at least one small nodal point
Maximal bit position；
Predetermined bit planar module, for determining that predetermined bit plane, predetermined bit plane are less than according to maximal bit position
Or it is equal to maximal bit position.
In one embodiment, maximal bit position module includes computational submodule；
Computational submodule, for according to formula k=floor (log2 (max | Cr,c|)) calculate maximal bit position；Wherein,
Cr,cFor wavelet coefficient, k is maximal bit position.
In one embodiment, the second data processing module includes threshold value submodule, output sub-module and bit stream submodule
Block；
Threshold value submodule, the judgment threshold for determining each bit-planes in the second bit-planes；
Output sub-module, for the judgement according to the absolute value and each bit-planes of each numerical value in the second bit-planes
Threshold value determines the bit to be encoded of each bit output in the second bit-planes；
Bit stream submodule, for forming second according to the bit to be encoded of each bit output in the second bit-planes
Bit stream to be encoded.
In one embodiment, the second bit stream to be encoded includes wavelet coefficient bit；Further include wavelet coefficient signs
At least one of in position, the empty mark of descendants's set, the number joint skies of Sun Jihe tetra- mark, Sun Jihe skies mark.
When understanding, above general description and following detailed description be only it is exemplary and explanatory, can not
Limit the disclosure.
Description of the drawings
The drawings herein are incorporated into the specification and forms part of this specification, and shows the implementation for meeting the disclosure
Example, and together with specification for explaining the principles of this disclosure.
Fig. 1 is a kind of flow chart for image encoding method that the embodiment of the present disclosure provides；
Fig. 2 is a kind of effect diagram for three-level haar wavelet transform that the embodiment of the present disclosure provides；
Fig. 3 is a kind of bit-planes effect diagram that the embodiment of the present disclosure provides；
Fig. 4 is a kind of structure chart for picture coding device that another embodiment of the disclosure provides；
Fig. 5 is a kind of structure chart for picture coding device that the embodiment of the present disclosure provides；
Fig. 6 is a kind of structure chart for picture coding device that the embodiment of the present disclosure provides.
Specific implementation mode
Example embodiments are described in detail here, and the example is illustrated in the accompanying drawings.Following description is related to
When attached drawing, unless otherwise indicated, the same numbers in different drawings indicate the same or similar elements.Following exemplary embodiment
Described in embodiment do not represent all implementations consistent with this disclosure.On the contrary, they be only with it is such as appended
The example of the consistent device and method of some aspects be described in detail in claims, the disclosure.
The embodiment of the present disclosure provides a kind of image encoding method, as shown in Figure 1, the image encoding method includes following step
Suddenly：
101, pending picture frame is obtained.
Pending picture frame includes at least one macro block.
102, wavelet decomposition is carried out to each macro block in pending picture frame and obtains the small echo of at least one small nodal point
Coefficient simultaneously forms original bit.
It is more mature technology it should be noted that wavelet decomposition, that is, wavelet transformation, the disclosure is without limitation,
This illustrates that the process of wavelet decomposition is as follows for sentencing haar wavelet transform：
For example, by taking haar wavelet transform as an example, a macro block has A1、A2、A3、A4Four pixels, pixel value be respectively [9,
7,3,5]；First, by A1And A2Pixel value average, A3And A4Pixel value average, obtain numerical value be [8,4], meter
Calculate A1And A2Pixel value half, calculate A3And A4The half of pixel value obtain numerical value [1, -1]；Then, right
Two values in [8,4] this cell mean, are averaged the half with difference respectively, obtain numerical value [6] and [2]；Then
[6,2,1, -1] is haar wavelet transform as a result, comprising an average value [6] and three detail coefficients [2,1, -1].Together
Reason, if it is 16 pixels, then the result of haar wavelet transform is 4 average values and 12 detail coefficients, again to 4 average values
Haar wavelet transform is carried out, obtained result is the result of two level haar wavelet transform.It, can be to each in step 102
Macro block carries out N layers of wavelet decomposition, and N is the integer more than or equal to 1, and the disclosure is without limitation.
As shown in Fig. 2, Fig. 2 is the effect diagram of three-level haar wavelet transform, 64 in Fig. 2 pixel value, by one
16 average values are obtained after grade haar wavelet transform, 4 average values are obtained after two level haar wavelet transform, are breathed out by three-level
Obtain 1 average value after your wavelet transformation, between this several cell mean there are root, son, grandson relationship, wherein three-level Ha Er is small
The average value that wave conversion obtains is root node, and the average value that two level haar wavelet transform obtains is child node, level-one Haar wavelet transform
It is Sun Jiedian to convert obtained average value, as shown in Fig. 2, the position shared by a numerical value is a small nodal point, it is one small
The data stored in nodal point are wavelet coefficient.
Illustratively, wavelet coefficient can be recombinated according to preset rules.For example, can according to root node set,
Child node set, the sequence of grandson's node set are ranked up, in each set, Z-shaped (LL-LH-HL-HH) as illustrated
Sequence be ranked up, certainly, only exemplary illustration, does not represent the disclosure and is confined to this herein.
103, bit-planes that bit in original bit is less than or equal to predetermined bit plane are determined as the first ratio
Special plane；The bit-planes that bit in original bit is more than to predetermined bit plane are determined as the second bit-planes.
Herein, illustratively bit-planes are explained, as shown in figure 3, having obtained a bits of original in step 102
It flows, contains at least one pixel value in original bit, for example the value range of a pixel value is 0-255, then a picture
Plain value needs to be indicated with 8 bits, in Fig. 3, by pixel value longitudinal arrangement, 8 bits is shared per a line bit, indicate one
A pixel value, when being divided according to longitudinal row, you can be divided into 8 bit-planes according to bit.Certainly, only show herein
Example property explanation, does not represent the disclosure and is confined to this.
Predetermined bit plane can be determined according to maximal bit plane, for example, in one embodiment, this method is also wrapped
It includes：
Maximal bit position is determined according to the maximum wavelet coefficient in the wavelet coefficient of at least one small nodal point；According to maximum
Bit determines that predetermined bit plane, predetermined bit plane are less than or equal to maximal bit position.
The maximal bit position of data is different in different images frame, and predetermined bit plane is determined according to maximal bit position,
It is capable of the cataloged procedure of the various picture frames of flexible adaptation.
In one embodiment, it is determined according to the maximum wavelet coefficient in the wavelet coefficient of at least one small nodal point maximum
Bit, including：
According to formula k=floor (log2 (max | Cr,c|)) calculate maximal bit position；Wherein, Cr,cFor wavelet coefficient,
(r, c) indicates that the coordinate of small nodal point, k are maximal bit position.
104, the data in the first bit-planes are directly exported to bit value and obtains the first bit stream to be encoded.
It is less than or equal to the bit-planes of predetermined bit plane for bit, because being the bit of low level, data are simultaneously
It is not particularly significant, directly exports bit value.
105, the data in the second bit-planes are handled to obtain second according to multistage tree set partitioning spiht algorithm
Bit stream to be encoded.
In one embodiment, the second bit stream to be encoded includes wavelet coefficient bit；Further include wavelet coefficient signs
At least one of in position, the empty mark of descendants's set, the number joint skies of Sun Jihe tetra- mark, Sun Jihe skies mark.
In one embodiment, the data in the second bit-planes are carried out according to multistage tree set partitioning spiht algorithm
Processing obtains the second bit stream to be encoded, including：
Determine the judgment threshold of each bit-planes in the second bit-planes；According to each numerical value in the second bit-planes
The judgment threshold of absolute value and each bit-planes determines the bit to be encoded of each bit output in the second bit-planes；Root
The second bit stream to be encoded is formed according to the bit to be encoded of each bit output in the second bit-planes.
For the data for including in the second bit-planes, according to the exhausted of the judgment threshold of each bit-planes and each numerical value
Bit to be encoded is exported to value, the data volume of the second bit stream to be encoded is further compressed, reduces encoder complexity.
Illustratively, row take a particular example the number illustrated how using the second bit-planes of spiht algorithm pair herein
According to being handled：
First, the judgment threshold of each bit-planes is determined, if maximal bit plane is k, maximal bit plane
Judgment threshold be 2k, one bit-planes lower than maximal bit plane are k-1, judgment threshold 2k-1, and so on.
For example, maximal bit plane is 8, predetermined bit plane is 5, then the judgment threshold of bit-planes 8-5 be followed successively by 256,128,64,
32。
Then, it is compared with the absolute value of each numerical value with the judgment threshold of each bit-planes.The numerical value is original
The numerical value that the pixel value of beginning obtains after wavelet decomposition.By taking target value and i-th of bit-planes as an example, the bit-planes
Judgment threshold is T.
One, the judgment mode of root node is as follows：
1, if absolute value >=2T of target value, the bit to be encoded of output is the number of i-th of bit of target value
Value；
2, if 2T>The bit to be encoded of absolute value >=T of target value, output are " 1 " and symbol logo position, are positive number
When symbol logo position be " 1 ", when be negative symbol logo be " 0 "；
3, if the absolute value of target value<The bit to be encoded of T, output are " 0 ".
Two, the judgment mode of child node is as follows：
1, if absolute value >=2T of target value, the bit to be encoded of output is the number of i-th of bit of target value
Value, and be stored in subclass code stream 1；
2, if 2T>The bit to be encoded of absolute value >=T of target value, output are " 1 " and symbol logo position and are stored in
In subclass code stream 2, symbol logo position is " 1 ", symbol mark when being negative when the numerical value of i-th of bit of target value is positive number
It is " 0 " to know position；
3, if the absolute value of target value<The bit to be encoded of T, output are " 0 " and are stored in subclass code stream 2.
If subclass code stream 2 is all " 0 ", subclass invalidated identification is set to 1, if subclass code stream 2 is sky, son
Set invalidated identification is set to 2, if subclass code stream 2 is not all " 0 ", subclass invalidated identification is set to 0.
The judgment mode of three, Sun Jiedian are as follows：
1, if absolute value >=2T of target value, the bit to be encoded of output is the number of i-th of bit of target value
Value, and be stored in grandson's aggregate stream 1；
2, if in the numerical value of corresponding four Sun Jiedian of child node, there are at least one 2T>Grandson's nodal values it is absolute
Value >=T, then not output codons when absolute value >=2T of target value, 2T>It is exported when absolute value >=T of target value to be encoded
Bit be " 1 " and symbol logo position (if the absolute value of the numerical value of other three Sun Jiedian is both greater than 2T, output symbol mark
Know position), the absolute value of target value<The bit to be encoded exported when T is " 0 "；
If the absolute value of the numerical value of four Sun Jiedian >=2T, not output codons, otherwise common output one waits compiling
Code bit is the code word of " 0 ", and is stored in grandson's aggregate stream 2.If grandson's aggregate stream 2 is all " 0 ", then Sun Jihe invalidated identifications
It is set to 1, if grandson's aggregate stream 2 is sky, Sun Jihe invalidated identifications are set to 2, if grandson's aggregate stream 2 is not all " 0 ", grandson
Set invalidated identification is set to 0.
Finally, the second bit to be encoded is formed according to the bit to be encoded of each bit output in the second bit-planes
Stream.
(1) if subclass invalidated identification and Sun Jihe invalidated identifications are 2, the second bit stream to be encoded includes：Root
Node bit stream to be encoded+subclass code stream 1 (the important pixel refinement of subclass)+grandson's aggregate stream 1 (important pixels of Sun Jihe
Point refinement).
(2) if subclass invalidated identification and Sun Jihe invalidated identifications are not 0 and are not all 2, the second ratio to be encoded
Special stream includes：Root node bit stream to be encoded+" 0 " (descendants gathers empty)+subclass code stream 1 (the important pixel refinement of subclass)
+ grandson aggregate stream 1 (the important pixel refinements of Sun Jihe).
(3) if Sun Jihe invalidated identifications are 2, subclass invalidated identification is 0, then the second bit stream to be encoded includes：Root
Node bit stream to be encoded+" 1 " (descendants gathers non-empty)+subclass code stream 1 (the important pixel refinement of subclass)+subclass code
Stream 2 (the new valid pixel mark of subclass)+grandson's aggregate stream 1 (the important pixel refinements of Sun Jihe).
(4) if Sun Jihe invalidated identifications are 1, subclass invalidated identification is 0, then the second bit stream to be encoded includes：Root
Node bit stream to be encoded+" 1 " (descendants gathers non-empty)+subclass code stream 1 (the important pixel refinement of subclass)+subclass code
Stream 2 (the new valid pixel mark of subclass)+grandson's aggregate stream 1 (the important pixel refinements of Sun Jihe)+" 0 " (Sun Jihe is empty).
(5) other situations, Sun Jihe invalidated identifications are 0, then the second bit stream to be encoded includes：Root node bit to be encoded
Stream+" 1 " (descendants gathers non-empty)+subclass code stream 1 (the important pixel refinement of subclass)+(subclass newly has subclass code stream 2
Imitate pixel logo)+grandson's aggregate stream 1 (the important pixel refinements of Sun Jihe)+" 1 " (Sun Jihe non-emptys)+2 (grandson of grandson's aggregate stream
Gather new valid pixel mark).
106, the first bit stream to be encoded and the second bit stream to be encoded are subjected to entropy coding.
Herein, entropy coding is illustrated, does not represent the disclosure and is confined to this.To the first bit to be encoded
When stream and the second bit stream to be encoded carry out entropy coding, it includes wavelet coefficient ratio that the first bit stream to be encoded, which needs the bit encoded,
Special position and sign bit, wavelet coefficient bit is according to the importance of the previous bit-planes of subband interior coding point, the weight of surrounding pixel
The property wanted and bit are referred to, and sign bit is referred to according to subband interior coding point surrounding pixel sign bit；Second is to be encoded
It includes wavelet coefficient bit, sign bit, the empty mark of descendants's set, the number joint skies of Sun Jihe tetra- that bit stream, which needs the bit encoded,
Mark, Sun Jihe skies mark.The reference of bit and sign bit is consistent with reference when the first encoding abit stream to be encoded, descendants
The empty mark of set is reference with root node importance, and the empty mark of the number joints of Sun Jihe tetra- is with the important of the corresponding father node of subclass
Property for reference, Sun Jihe skies mark with subclass importance pixel number be reference.
The image encoding method that the embodiment of the present disclosure provides is more than bit the bit-planes of predetermined bit plane,
The data of high order bit position are more important, are affected to picture quality, handled using spiht algorithm, ensure image matter
Amount, and it is less than or equal to the bit-planes of predetermined bit plane for bit, because being the bit of low level, data are not
It is particularly significant, bit value is directly exported, encoder complexity is reduced, reduces the scramble time.
Based on the image encoding method described in the corresponding embodiments of above-mentioned Fig. 1, following is embodiment of the present disclosure,
It can be used for executing embodiments of the present disclosure.
The embodiment of the present disclosure provides a kind of picture coding device, as shown in figure 4, the picture coding device 40 includes：It obtains
Module 401, wavelet decomposition module 402, bit-planes sort module 403, the first data processing module 404, the second data processing
Module 405 and coding module 406；
Acquisition module 401, for obtaining pending picture frame, pending picture frame includes at least one macro block；
Wavelet decomposition module 402 obtains at least one for carrying out wavelet decomposition to each macro block in pending picture frame
The wavelet coefficient of a small nodal point simultaneously forms original bit；
Bit-planes sort module 403, for bit in original bit to be less than or equal to predetermined bit plane
Bit-planes are determined as the first bit-planes；The bit-planes that bit in original bit is more than to predetermined bit plane determine
For the second bit-planes；
First data processing module 404 obtains for the data in the first bit-planes directly to be exported to bit value
One bit stream to be encoded；
Second data processing module 405, for the data in the second bit-planes to be set set partitioning SPIHT according to multistage
Algorithm is handled to obtain the second bit stream to be encoded；
Coding module 406, for the first bit stream to be encoded and the second bit stream to be encoded to be carried out entropy coding.
In one embodiment, as shown in figure 5, picture coding device 40 further includes：Maximal bit position module 407 and default
Bit-planes module 408；
Maximal bit position module 407, for according to the maximum wavelet coefficient in the wavelet coefficient of at least one small nodal point
Determine maximal bit position；
Predetermined bit planar module 408, for determining that predetermined bit plane, predetermined bit plane are small according to maximal bit position
In or equal to maximal bit position.
In one embodiment, as shown in figure 5, maximal bit position module 407 includes computational submodule 4071；
Computational submodule 4071, for according to formula k=floor (log2 (max | Cr,c|)) calculate maximal bit position；
Wherein, Cr,cFor wavelet coefficient, k is maximal bit position.
In one embodiment, as shown in fig. 6, the second data processing module 405 includes threshold value submodule 4051, output
Module 4052 and bit stream submodule 4053；
Threshold value submodule 4051, the judgment threshold for determining each bit-planes in the second bit-planes；
Output sub-module 4052, for according to the absolute value of each numerical value in the second bit-planes and each bit-planes
Judgment threshold determines the bit to be encoded of each bit output in the second bit-planes；
Bit stream submodule 4053, for being formed according to the bit to be encoded of each bit output in the second bit-planes
Second bit stream to be encoded.
In one embodiment, the second bit stream to be encoded includes wavelet coefficient bit；Further include wavelet coefficient signs
At least one of in position, the empty mark of descendants's set, the number joint skies of Sun Jihe tetra- mark, Sun Jihe skies mark.
The picture coding device that the embodiment of the present disclosure provides is more than bit the bit-planes of predetermined bit plane,
The data of high order bit position are more important, are affected to picture quality, handled using spiht algorithm, ensure image matter
Amount, and it is less than or equal to the bit-planes of predetermined bit plane for bit, because being the bit of low level, data are not
It is particularly significant, bit value is directly exported, encoder complexity is reduced, reduces the scramble time.
Based on the image encoding method described in the corresponding embodiments of above-mentioned Fig. 1, the embodiment of the present disclosure also provides one kind
Computer readable storage medium, for example, non-transitorycomputer readable storage medium can be read-only memory (English：Read
Only Memory, ROM), random access memory (English：Random Access Memory, RAM), it is CD-ROM, tape, soft
Disk and optical data storage devices etc..It is stored with computer instruction on the storage medium, for executing the corresponding embodiments of above-mentioned Fig. 1
Described in image encoding method, details are not described herein again.
Those skilled in the art will readily occur to its of the disclosure after considering specification and putting into practice disclosure disclosed herein
Its embodiment.This application is intended to cover any variations, uses, or adaptations of the disclosure, these modifications, purposes or
Person's adaptive change follows the general principles of this disclosure and includes the undocumented common knowledge in the art of the disclosure
Or conventional techniques.The description and examples are only to be considered as illustrative, and the true scope and spirit of the disclosure are by following
Claim is pointed out.
It should be understood that the present disclosure is not limited to the precise structures that have been described above and shown in the drawings, and
And various modifications and changes may be made without departing from the scope thereof.The scope of the present disclosure is only limited by the accompanying claims.
Claims (10)
1. a kind of image encoding method, which is characterized in that the method includes：
Pending picture frame is obtained, the pending picture frame includes at least one macro block；
Wavelet decomposition is carried out to each macro block in the pending picture frame and obtains the wavelet coefficient of at least one small nodal point
And form original bit；
Bit in the original bit is determined as the first bit less than or equal to the bit-planes of predetermined bit plane to put down
Face；The bit-planes that bit in the original bit is more than to predetermined bit plane are determined as the second bit-planes；
Data in first bit-planes are directly exported into bit value and obtain the first bit stream to be encoded；
Data in second bit-planes are handled to obtain second according to multistage tree set partitioning spiht algorithm and wait compiling
Code bit stream；
Described first bit stream to be encoded and second bit stream to be encoded are subjected to entropy coding.
2. according to the method described in claim 1, it is characterized in that, the method further includes：
Maximal bit position is determined according to the maximum wavelet coefficient in the wavelet coefficient of at least one small nodal point；
Determine that the predetermined bit plane, the predetermined bit plane are less than or equal to the maximum according to the maximal bit position
Bit.
3. according to the method described in claim 2, it is characterized in that, according in the wavelet coefficient of at least one small nodal point
Maximum wavelet coefficient determine maximal bit position, including：
According to formula k=floor (log2 (max | Cr,c|)) calculate the maximal bit position；Wherein, Cr,cFor the wavelet systems
Number, k are the maximal bit position.
4. according to the method described in claim 1, it is characterized in that, the data in second bit-planes are set according to multistage
Set partitioning spiht algorithm is handled to obtain the second bit stream to be encoded, including：
Determine the judgment threshold of each bit-planes in second bit-planes；
Described the is determined according to each absolute value of numerical value in second bit-planes and the judgment threshold of each bit-planes
The bit to be encoded of each bit output in two bit-planes；
The described second bit stream to be encoded is formed according to the bit to be encoded of each bit output in second bit-planes.
5. according to claim 1-4 any one of them methods, which is characterized in that
Second bit stream to be encoded includes wavelet coefficient bit；Further include wavelet coefficient signs position, the empty mark of descendants's set
Know, Sun Jihe tetra- counts at least one combined in empty mark, Sun Jihe skies mark.
6. a kind of picture coding device, which is characterized in that described image code device includes：Acquisition module, wavelet decomposition module,
Bit-planes sort module, the first data processing module, the second data processing module and coding module；
The acquisition module, for obtaining pending picture frame, the pending picture frame includes at least one macro block；
The wavelet decomposition module obtains at least one for carrying out wavelet decomposition to each macro block in the pending picture frame
The wavelet coefficient of a small nodal point simultaneously forms original bit；
The bit-planes sort module, for bit in the original bit to be less than or equal to predetermined bit plane
Bit-planes are determined as the first bit-planes；Bit in the original bit is more than to the bit-planes of predetermined bit plane
It is determined as the second bit-planes；
First data processing module obtains for the data in first bit-planes directly to be exported bit value
One bit stream to be encoded；
Second data processing module, for the data in second bit-planes to be set set partitioning according to multistage
Spiht algorithm is handled to obtain the second bit stream to be encoded；
The coding module, for the described first bit stream to be encoded and second bit stream to be encoded to be carried out entropy coding.
7. device according to claim 6, which is characterized in that described image code device further includes：Maximal bit position mould
Block and predetermined bit planar module；
Maximal bit position module, for according to the maximum wavelet coefficient in the wavelet coefficient of at least one small nodal point
Determine maximal bit position；
The predetermined bit planar module, it is described default for determining the predetermined bit plane according to the maximal bit position
Bit-planes are less than or equal to the maximal bit position.
8. device according to claim 7, which is characterized in that maximal bit position module includes computational submodule；
The computational submodule, for according to formula k=floor (log2 (max | Cr,c|)) calculate the maximal bit position；
Wherein, Cr,cFor the wavelet coefficient, k is the maximal bit position.
9. device according to claim 6, which is characterized in that second data processing module include threshold value submodule,
Output sub-module and bit stream submodule；
The threshold value submodule, the judgment threshold for determining each bit-planes in second bit-planes；
The output sub-module, for according to the absolute value of each numerical value in second bit-planes and each bit-planes
Judgment threshold determines the bit to be encoded of each bit output in second bit-planes；
The bit stream submodule, for being formed according to the bit to be encoded of each bit output in second bit-planes
Second bit stream to be encoded.
10. according to claim 6-9 any one of them devices, which is characterized in that
Second bit stream to be encoded includes wavelet coefficient bit；Further include wavelet coefficient signs position, the empty mark of descendants's set
Know, Sun Jihe tetra- counts at least one combined in empty mark, Sun Jihe skies mark.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810160152.6A CN108429916B (en) | 2018-02-26 | 2018-02-26 | Image coding method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810160152.6A CN108429916B (en) | 2018-02-26 | 2018-02-26 | Image coding method and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108429916A true CN108429916A (en) | 2018-08-21 |
| CN108429916B CN108429916B (en) | 2020-07-31 |
Family
ID=63157242
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810160152.6A Active CN108429916B (en) | 2018-02-26 | 2018-02-26 | Image coding method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108429916B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110417811A (en) * | 2019-08-22 | 2019-11-05 | 上海兆芯集成电路有限公司 | The method and device of encoding abit stream compression |
| CN113542742A (en) * | 2021-07-14 | 2021-10-22 | 西安万像电子科技有限公司 | Image processing method and device |
| CN116389759A (en) * | 2022-05-27 | 2023-07-04 | 上海玄戒技术有限公司 | Image coding method, device, electronic equipment, chip and storage medium |
Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20020091294A (en) * | 2001-05-30 | 2002-12-06 | 한국과학기술원 | ROI coding method based on the SPIHT |
| CN1460969A (en) * | 2003-06-30 | 2003-12-10 | 大唐微电子技术有限公司 | Hierarchy tree set partition image coding decoding method based of digital signal processor |
| CN101980466A (en) * | 2010-11-11 | 2011-02-23 | 北京航空航天大学 | Bit stream transmission method combing SPIHT compression and unequal error protection coding |
| CN102387356A (en) * | 2010-09-06 | 2012-03-21 | 索尼公司 | Image processing apparatus and method |
| CN102637302A (en) * | 2011-10-24 | 2012-08-15 | 北京航空航天大学 | Image coding method |
| CN103108185A (en) * | 2013-01-31 | 2013-05-15 | 西安电子科技大学 | Bit plane encoding hardware structure and method according with consultative committee for space data system (CCSDS) standard |
| CN103119990A (en) * | 2010-07-26 | 2013-05-22 | 惠普发展公司，有限责任合伙企业 | Method and system for compressing bitplanes based on bit position |
| CN103327335A (en) * | 2013-06-21 | 2013-09-25 | 中国科学院空间科学与应用研究中心 | FPGA encoding method and system and control method for unmanned aerial vehicle image transmission device |
| CN103905819A (en) * | 2014-04-23 | 2014-07-02 | 西安电子科技大学 | Coding system based on set partitioning in hierarchical tree and implementation method of coding system |
| CN104134224A (en) * | 2014-07-25 | 2014-11-05 | 华南理工大学 | Shape-adaptive coding identification photo compression method |
-
2018
- 2018-02-26 CN CN201810160152.6A patent/CN108429916B/en active Active
Patent Citations (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| KR20020091294A (en) * | 2001-05-30 | 2002-12-06 | 한국과학기술원 | ROI coding method based on the SPIHT |
| CN1460969A (en) * | 2003-06-30 | 2003-12-10 | 大唐微电子技术有限公司 | Hierarchy tree set partition image coding decoding method based of digital signal processor |
| CN103119990A (en) * | 2010-07-26 | 2013-05-22 | 惠普发展公司，有限责任合伙企业 | Method and system for compressing bitplanes based on bit position |
| CN102387356A (en) * | 2010-09-06 | 2012-03-21 | 索尼公司 | Image processing apparatus and method |
| CN101980466A (en) * | 2010-11-11 | 2011-02-23 | 北京航空航天大学 | Bit stream transmission method combing SPIHT compression and unequal error protection coding |
| CN102637302A (en) * | 2011-10-24 | 2012-08-15 | 北京航空航天大学 | Image coding method |
| CN103108185A (en) * | 2013-01-31 | 2013-05-15 | 西安电子科技大学 | Bit plane encoding hardware structure and method according with consultative committee for space data system (CCSDS) standard |
| CN103327335A (en) * | 2013-06-21 | 2013-09-25 | 中国科学院空间科学与应用研究中心 | FPGA encoding method and system and control method for unmanned aerial vehicle image transmission device |
| CN103905819A (en) * | 2014-04-23 | 2014-07-02 | 西安电子科技大学 | Coding system based on set partitioning in hierarchical tree and implementation method of coding system |
| CN104134224A (en) * | 2014-07-25 | 2014-11-05 | 华南理工大学 | Shape-adaptive coding identification photo compression method |
Non-Patent Citations (1)
| Title |
|---|
| 朱国民，张明锋: ""基于 SPIHT 和分类比特编码的无损图像压缩"", 《计算机工程与应用》 * |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110417811A (en) * | 2019-08-22 | 2019-11-05 | 上海兆芯集成电路有限公司 | The method and device of encoding abit stream compression |
| CN110417811B (en) * | 2019-08-22 | 2021-08-10 | 上海兆芯集成电路有限公司 | Method and device for bit stream coding compression |
| CN113542742A (en) * | 2021-07-14 | 2021-10-22 | 西安万像电子科技有限公司 | Image processing method and device |
| CN116389759A (en) * | 2022-05-27 | 2023-07-04 | 上海玄戒技术有限公司 | Image coding method, device, electronic equipment, chip and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108429916B (en) | 2020-07-31 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP7431742B2 (en) | Method and apparatus for encoding/decoding a point cloud representing a three-dimensional object | |
| US10462476B1 (en) | Devices for compression/decompression, system, chip, and electronic device | |
| US5060285A (en) | Hierarchical variable block size address-vector quantization using inter-block correlation | |
| EP3467778A1 (en) | A method and apparatus for encoding/decoding the geometry of a point cloud representing a 3d object | |
| JP2015504545A (en) | Predictive position coding | |
| CN108429916A (en) | Image encoding method and device | |
| WO2020238439A1 (en) | Video quality-of-service enhancement method under restricted bandwidth of wireless ad hoc network | |
| JP2014532945A (en) | Predictive position decoding | |
| RU2767771C1 (en) | Method and equipment for encoding/decoding point cloud representing three-dimensional object | |
| Fang et al. | 3dac: Learning attribute compression for point clouds | |
| EP4275354A1 (en) | Apparatus and method for point cloud processing | |
| CN108810534A (en) | Method for compressing image based on direction Lifting Wavelet and improved SPIHIT under Internet of Things | |
| CN101715143B (en) | Method, device and system of self-adaptive quantization and self-adaptive inverse quantization | |
| CN103999490A (en) | Terminable spatial tree-based position coding and decoding | |
| EP3614672A1 (en) | A method and apparatus for encoding/decoding a point cloud representing a 3d object | |
| CN1122421C (en) | Improved motion vector estimation method and apparatus for use in image signal encoding system | |
| CN107018287A (en) | The method and apparatus for carrying out noise reduction to image using video epitome | |
| Kale et al. | Visually improved image compression by combining EZW encoding with texture modeling using Huffman Encoder | |
| US20240193819A1 (en) | Learning-based point cloud compression via tearing transform | |
| CN114554175B (en) | Classification rearrangement-based lossless compression method for two-dimensional point cloud distance images | |
| Ruan et al. | Point Cloud Compression with Implicit Neural Representations: A Unified Framework | |
| CN117880524A (en) | Image compression method and image decompression method with adaptive target distance | |
| Teng et al. | Light Field Compression Based on Graph Sample and Aggregaet Algorithm | |
| CN118355408A (en) | State summarization for binary voxel grid coding | |
| JP2024527513A (en) | Learning-based point cloud compression with 3D point cloud unfolding |
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 |