CN102024265A - Embedded zerotree wavelet coding method and device - Google Patents
Embedded zerotree wavelet coding method and device Download PDFInfo
- Publication number
- CN102024265A CN102024265A CN2009101738479A CN200910173847A CN102024265A CN 102024265 A CN102024265 A CN 102024265A CN 2009101738479 A CN2009101738479 A CN 2009101738479A CN 200910173847 A CN200910173847 A CN 200910173847A CN 102024265 A CN102024265 A CN 102024265A
- Authority
- CN
- China
- Prior art keywords
- wavelet
- wavelet coefficient
- coefficient
- plane
- zero
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Images
Abstract
The invention discloses embedded zerotree wavelet coding method and device. The embedded zerotree wavelet coding method comprises the following steps of: decomposing an input image into a plurality of wavelet decomposed subbands; adding all wavelet coefficients of the plurality of wavelet decomposed subbands to a primary wavelet coefficient table, and setting a secondary wavelet coefficient table to be empty; coding all the wavelet coefficients of the plurality of wavelet decomposed subbands bit plane by bit plane in two stages of a primary control procedure and a secondary control procedure according to a sequence from a highest bit plane to a lowest bit plane, wherein processing all the wavelet coefficients of the plurality of wavelet decomposed subbands one by one in the bit plane n; in the stage of the primary control procedure, judging whether the absolute value of one wavelet coefficient of the primary wavelet coefficient table is larger than or equal to 2n or not, and if so, generating a POS or NEG sign according to a sign bit of the wavelet coefficient; adding the wavelet coefficient to the secondary wavelet coefficient table; and setting the wavelet coefficient as zero in the primary wavelet coefficient table.
Description
Technical field
The present invention relates to image code domain, relate more specifically to a kind of embedded zero-tree wavelet coding method and device.
Background technology
The picture coding algorithm be a kind of be the cost data volume that reduces digital picture further image is handled, stored and the technology of transmission etc. with acceptable distortion.Because wavelet transformation all has good local characteristics in time domain and frequency domain, so highly successful in recent years based on the picture coding algorithm of this conversion.As milestone based on the image coding technique of wavelet transformation, optimum target and visual coding performance when embedded wavelet coding algorithm (EZW) has been realized design.
The similarity of position between energy packing characteristic by utilizing wavelet transformation and wavelet sub-band coefficient, EZW has obtained extraordinary objective and subjective coding efficiency.Because the EZW algorithm adopts the mode of bit-plane by bit-plane coding, thus the master control journey of each bit plane just exist one to before the disposal route problem of significant coefficient (preceding big coefficient) of bit plane.Original EZW algorithm has all adopted the mode of skipping processing to these coefficients, if promptly in a single day coefficient becomes importantly at a certain bit plane, then just this coefficient is done in the master control journey of bit plane afterwards and is skipped processing, no longer coding.This method can cause more zero little tree to produce, and reduces code efficiency, and the hardware that is not suitable for bottom-up scanning sequency is simultaneously realized.For example, if 4 child nodes of big coefficient all are zerotree roots before certain, so because this preceding big coefficient is skipped processing, so just need represent these four zero trees with 4 zerotree root symbols.
Summary of the invention
One or more problems in view of the above the invention provides a kind of embedded zero-tree wavelet coding method and device of novelty.
Embedded zero-tree wavelet coding method according to the embodiment of the invention comprises: input picture is decomposed into a plurality of wavelet decomposition subbands; All wavelet coefficients in described a plurality of wavelet decomposition subbands are added in the main wavelet coefficient table, and assist the wavelet coefficient table and be set to sky; And divide master control journey and auxilliary control journey two stages, all wavelet coefficients described a plurality of wavelet decomposition subbands encoded according to the ground of the order bit-plane by bit-plane from the most significant digit plane to the lowest order plane, one by one all wavelet coefficients in described a plurality of wavelet decomposition subbands are handled in the Plane n wherein on the throne, n is not less than zero integer.In the master control journey stage, whether the absolute value of judging a wavelet coefficient in the main wavelet coefficient table is more than or equal to 2
nIf, then the sign bit according to a described wavelet coefficient generates " positive significant coefficient " or " coefficient is wanted in heavy burden " symbol, a described wavelet coefficient is added in the auxilliary wavelet coefficient table, and a described wavelet coefficient is set to zero in main wavelet coefficient table, otherwise, be marked as at a described wavelet coefficient under the situation of zero tree node, a described wavelet coefficient is not handled, be not marked as at a described wavelet coefficient under the situation of zero tree node, judge that whether absolute value with respect to the wavelet coefficient that is associated with a described wavelet coefficient in the wavelet decomposition subband of the more high frequency of the wavelet decomposition subband at a described wavelet coefficient place is all less than 2
n, if then the wavelet coefficient that is associated with a described wavelet coefficient in the wavelet decomposition subband of described more high frequency is labeled as zero tree node, and generates " zerotree root " symbol, otherwise generate " forlorn " symbol.In the auxilliary control journey stage, generate the refinement position in the described wavelet coefficient Plane n on the throne-1.
Embedded zero-tree wavelet code device according to the embodiment of the invention comprises: the wavelet decomposition unit is configured to input picture is decomposed into a plurality of wavelet decomposition subbands; The table initialization unit is configured to all wavelet coefficients in described a plurality of wavelet decomposition subbands are added in the main wavelet coefficient table, and assists the wavelet coefficient table and be set to sky; And coding performance element, be configured to branch master control journey and auxilliary control journey two stages, all wavelet coefficients described a plurality of wavelet decomposition subbands encoded according to the ground of the order bit-plane by bit-plane from the most significant digit plane to the lowest order plane, one by one all wavelet coefficients in described a plurality of wavelet decomposition subbands are handled in the Plane n wherein on the throne, n is not less than zero integer.Particularly, in the master control journey stage, whether the absolute value of judging a wavelet coefficient in the main wavelet coefficient table is more than or equal to 2
nIf, then the sign bit according to a described wavelet coefficient generates " positive significant coefficient " or " coefficient is wanted in heavy burden " symbol, a described wavelet coefficient is added in the auxilliary wavelet coefficient table, and a described wavelet coefficient is set to zero in main wavelet coefficient table, otherwise, be marked as at a described wavelet coefficient under the situation of zero tree node, a described wavelet coefficient is not handled, be not marked as at a described wavelet coefficient under the situation of zero tree node, judge that whether absolute value with respect to the wavelet coefficient that is associated with a described wavelet coefficient in the wavelet decomposition subband of the more high frequency of the wavelet decomposition subband at a described wavelet coefficient place is all less than 2
n, if then the wavelet coefficient that is associated with a described wavelet coefficient in the wavelet decomposition subband of described more high frequency is labeled as zero tree node, and generates " zerotree root " symbol, otherwise generate " forlorn " symbol.In the auxilliary control journey stage, generate the refinement position in the described wavelet coefficient Plane n on the throne-1.
By the above as can be seen, by in the processing procedure of master control journey stage on the present bit Plane n with absolute value less than 2
nAnd the absolute value of the wavelet coefficient that it is associated is also all less than 2
nWavelet coefficient be encoded to the zerotree root symbol, can simplify the complicacy of coding and improve code efficiency.In addition, by in the processing procedure on bit plane subsequently with the absolute value on the present bit Plane n more than or equal to 2
nWavelet coefficient be used as 0 wavelet coefficient and encode, can further simplify coding complicacy, improve code efficiency.
Description of drawings
From below in conjunction with the present invention may be better understood the description of accompanying drawing to the specific embodiment of the present invention, wherein:
Fig. 1 shows the block diagram according to the embedded zero-tree wavelet code device of the embodiment of the invention;
Fig. 2 shows the process flow diagram according to the embedded zero-tree wavelet coding method of the embodiment of the invention;
Fig. 3 shows the synoptic diagram that input picture is exemplarily carried out 10 wavelet decomposition subbands that 3 grades of wavelet decomposition draw;
Fig. 4 shows the synoptic diagram for the scanning sequency of 10 wavelet decomposition subbands shown in Fig. 3;
Fig. 5 shows the synoptic diagram for the scanning sequency of the wavelet coefficient in each the wavelet decomposition subband shown in Fig. 3;
Fig. 6 shows the synoptic diagram of the bit plane of each integer in the exemplary wavelet coefficient set;
Fig. 7 shows the process flow diagram that is used for all wavelet coefficients are carried out encoding process according to the embodiment of the invention;
Fig. 8 shows the process flow diagram that is used on a bit plane all wavelet coefficients being carried out the processing of master control journey according to the embodiment of the invention; And
Fig. 9 shows the process flow diagram that is used on a bit plane all wavelet coefficients being assisted the processing of control journey according to the embodiment of the invention.
Embodiment
To describe the feature and the exemplary embodiment of various aspects of the present invention below in detail.Many details have been contained in following description, so that complete understanding of the present invention is provided.But, it will be apparent to one skilled in the art that the present invention can implement under the situation of some details in not needing these details.Description to embodiment only is in order to provide the clearer understanding to the present invention by example of the present invention is shown below.Any concrete configuration and the algorithm that are proposed below the present invention never is limited to, but any modification, replacement and the improvement that have covered coherent element, parts and algorithm under the premise of without departing from the spirit of the present invention.
Fig. 1 shows the block diagram according to the embedded zero-tree wavelet code device of the embodiment of the invention.As shown in Figure 1, this embedded zero-tree wavelet code device comprises wavelet decomposition unit 102, table initialization unit 104 and coding performance element 106.Wavelet decomposition unit 102 is decomposed into a plurality of wavelet decomposition subbands with input picture.Table initialization unit 104 is added all wavelet coefficients in described a plurality of wavelet decomposition subbands in the main wavelet coefficient table to, and assists the wavelet coefficient table and be set to sky.106 fens master control journeys of coding performance element and auxilliary control journey two stages, all wavelet coefficients described a plurality of wavelet decomposition subbands are encoded according to the ground of the order bit-plane by bit-plane from the most significant digit plane to the lowest order plane.Wherein, the wavelet decomposition unit further is undertaken all wavelet coefficients in described a plurality of wavelet decomposition subbands interrelated by for example level Four tree construction.
Fig. 2 shows the process flow diagram according to the embedded zero-tree wavelet coding method of the embodiment of the invention.As shown in Figure 2, this embedded zero-tree wavelet coding method comprises: S202 is decomposed into a plurality of wavelet decomposition subbands with input picture; S204 adds all wavelet coefficients in described a plurality of wavelet decomposition subbands in the main wavelet coefficient table to, and assists the wavelet coefficient table and be set to sky; And S206, divide master control journey and auxilliary control journey two stages, all wavelet coefficients described a plurality of wavelet decomposition subbands encoded according to the ground of the order bit-plane by bit-plane from the most significant digit plane to the lowest order plane.Wherein, step S204 for example can be finished by wavelet decomposition unit 102, and step S204 for example can be finished by table initialization unit 104, and step S206 for example can be finished by coding performance element 106.
Describe in detail according to the embedded zero-tree wavelet coding method of the embodiment of the invention and the concrete processing procedure of device below in conjunction with Fig. 3 to Fig. 9.
Fig. 3 shows the synoptic diagram that input picture is exemplarily carried out 10 wavelet decomposition subbands that 3 grades of wavelet decomposition draw.As shown in Figure 3, decomposition levels N=3 decomposites the individual wavelet decomposition subband of 3N+1 (that is, 10) altogether from input picture.In Fig. 3, the LL3 piece is the wavelet decomposition subband of low-limit frequency, HL3 and HH3 piece are second low-frequency wavelet decomposition subbands, and HL2, LH2 and HH2 piece are the 3rd low-frequency wavelet decomposition subbands, and HL1, LH1 and HH1 piece are the wavelet decomposition subbands of highest frequency.In addition, also show level Four tree construction between the wavelet coefficient in each wavelet decomposition subband among Fig. 3.As can be seen from Figure 3, for each wavelet coefficient in the LL3 subband, there are three coefficients that have incidence relation with it (the subsystem number or the offspring's coefficient that are called the wavelet coefficient among the LL3 here) that lay respectively in HL3, LH3 and the HH3 subband; For in these three sub-coefficients each, all there are four coefficients (the subsystem number or the offspring's coefficient that are called the wavelet coefficient among HL2, LH2 and the HH2 here) that have incidence relation with it that lay respectively in HL2, LH2 and the HH2 subband.Here, the wavelet coefficient that the wavelet coefficient with among the LL3 in HL3～1, LH3～1 and HH3～1 subband can be associated is referred to as offspring's coefficient of the wavelet coefficient among this LL3.Can limit set membership (that is, incidence relation) continuously by the wavelet decomposition subband from the wavelet decomposition subband of low-limit frequency to highest frequency, and the wavelet coefficient in the wavelet decomposition subband of highest frequency is without any the subsystem number.
Suppose that Ω is the set of all wavelet coefficients in all wavelet decomposition subbands, then can determine the most significant digit plane of these wavelet coefficients by following equation:
Wherein, c
I, jBe to be in position (i, the wavelet coefficient among Ω j).In addition, lowest order Plane n
Min=0.For the present bit Plane n, if | c
I, j| 〉=2
n, wavelet coefficient c then
I, jWith respect to the present bit Plane n is important, otherwise is unessential.
In the EZW algorithm, in the master control journey on present bit plane, if current wavelet coefficient is inessential and its all offspring's coefficients are also all inessential with respect to the present bit plane with respect to the present bit plane, then current wavelet coefficient is called zerotree root, its offspring's coefficient that is arranged in highest frequency wavelet decomposition subband in addition is called zero tree node, and its offspring's coefficient that is arranged in the wavelet decomposition subband of highest frequency is called leaf node.In addition, will be root with current wavelet coefficient, being node with its offspring's coefficient, tree is called zero tree.In the leading zero tree, except zerotree root, every other node all is zero tree node.When current wavelet coefficient is encoded, can produce coded identification " zerotree root ".In the level Four tree construction,, comprise that then all subsystem numbers of the subsystem number of its subsystem number all are called as offspring's coefficient of this wavelet coefficient if wavelet coefficient is not a leaf node.
In table initialization unit 104, main wavelet coefficient table and auxilliary wavelet coefficient table are carried out initialization (that is execution in step S204).Particularly, main wavelet coefficient table is initialized as all wavelet coefficients comprising from the wavelet decomposition subband of low-limit frequency to the wavelet decomposition subband of highest frequency.To assist the wavelet coefficient table and be initialized as sky (that is, not having any wavelet coefficient at first in the auxilliary wavelet coefficient table).
For initialization master wavelet coefficient table, can for example wavelet coefficient be added in the main wavelet coefficient table one by one in a certain order.
Fig. 4 shows the synoptic diagram for the scanning sequency of 10 wavelet decomposition subbands shown in Fig. 3.As shown in Figure 4, at first the wavelet coefficient in the LL3 subband is added in the main wavelet coefficient table, according to the order of HL3 → LH3 → HH3 the wavelet coefficient in HL3, LH3 and the HH3 subband is added in the main wavelet coefficient table then.Then, according to the order of HL2 → LH2 → HH2, successively the wavelet coefficient in HL2, LH2 and the HH2 subband is added in the main wavelet coefficient table.For the wavelet decomposition subband of highest frequency, at first the wavelet coefficient with the HL1 subband adds in the main wavelet coefficient table, then with the wavelet coefficient of LH1 subband, the wavelet coefficient with the HH1 subband adds in the main wavelet coefficient table at last.That is to say, according to from left to right, from top to bottom order, by the wavelet coefficient in each wavelet decomposition subband being added in the main wavelet coefficient table subband ground.
Fig. 5 shows the synoptic diagram for the scanning sequency of the wavelet coefficient in each the wavelet decomposition subband shown in Fig. 3.As shown in Figure 5, for each wavelet decomposition subband, the wavelet coefficient of this subband is added into main wavelet coefficient table line by line.After all wavelet coefficients in all wavelet decomposition subbands all were added in the main wavelet coefficient table, the initialization of main wavelet coefficient table finished.
In coding performance element 106, divide master control journey and auxilliary control journey two stages, all wavelet coefficients a plurality of wavelet decomposition subbands encoded according to the ground of the order bit-plane by bit-plane from the most significant digit plane to the lowest order plane.Wherein, before the coding that carries out a bit plane, at first judged whether to reach target bit rate R or do not finished the coding on lowest order plane,, otherwise carried out the coding of this bit plane if then encoding process finishes.For each bit plane, at first in the master control journey stage, scan main wavelet coefficient table and export four kinds of coded identifications: coefficient (NEG) and isolated zero (IZ) are wanted in zerotree root (ZTR), positive significant coefficient (POS), heavy burden; Then in the auxilliary control journey stage, the refinement bit of each wavelet coefficient in auxilliary wavelet coefficient table of scanning and the auxilliary wavelet coefficient table of output (that is, each wavelet coefficient in the next bit plane 0/1).
Fig. 6 shows the synoptic diagram of the bit plane of each integer in the exemplary wavelet coefficient set.As shown in Figure 6, for integer set 88 ,-126,76,25,112 ,-36,2 ,-4}, most significant digit Plane n
Max=6, the lowest order Plane n
Min=0.
Fig. 7 shows the process flow diagram that is used for all wavelet coefficients are carried out encoding process according to the embodiment of the invention.As shown in Figure 7, after the beginning encoding process, at first calculate the most significant digit Plane n for all wavelet coefficients
Max(S702); The circulation of the step by step S704～S712 then is according to finishing encoding process to all wavelet coefficients from the most significant digit plane to the order on lowest order plane.Wherein, at step S704, carry out the processing in master control journey stage on the Plane n on the throne; After the finishing dealing with of master control journey stage,, judge whether to have reached targeted bit rates R at step S706; If then finish encoding process, otherwise, carry out the processing in auxilliary control journey stage on the Plane n on the throne at step S708; After the finishing dealing with of auxilliary control journey stage, judge whether to reach targeted bit rates R at step S710; If then finish encoding process, otherwise, judge whether to arrive the lowest order plane at step S712; If then finish encoding process, otherwise carry out the encoding process on the bit plane n-1.
Fig. 8 shows the process flow diagram that is used on a bit plane all wavelet coefficients being carried out the processing of master control journey according to the embodiment of the invention.As can be seen from Figure 8, in the master control journey stage, successively each wavelet coefficient in the main wavelet coefficient table is handled.For current coefficient c
I, jIf it is important for n, then generate symbol POS (2 bits, 10) or NEG (2 bits, 11), with current coefficient c according to its sign bit
I, jAdd in the auxilliary wavelet coefficient table, and in main wavelet coefficient table with current coefficient c
I, jBe set to zero.If current coefficient c
I, jInessential for n, if then it has been marked as zero tree node, then skip this coefficient, do not generate symbol (because it can be predicted from its older generation's coefficient).If current coefficient c
I, jInessential and be not denoted as zero tree node, then need its all offspring's coefficients are detected.If these offspring's coefficients all are unessential for n, then all these offspring's coefficients are labeled as zero tree node, and generate symbols Z TR (2 bits, 01), otherwise generate symbol IZ (2 bits, 00).To current coefficient c
I, jAfter handling, detect and whether satisfy targeted bit rates R.If then encoding process finishes, otherwise proceeds to next wavelet coefficient (if current coefficient is not last wavelet coefficient in the main wavelet coefficient table), and continues above-mentioned processing.After in the present bit plane, all wavelet coefficients in the main wavelet coefficient table all being handled, remove the mark of all zero tree nodes, and proceed processing for the auxilliary control journey stage on present bit plane.
Fig. 9 shows the process flow diagram that is used on a bit plane all wavelet coefficients being assisted the processing of control journey according to the embodiment of the invention.As can be seen from Figure 9, in the auxilliary control journey stage, each wavelet coefficient in the auxilliary wavelet coefficient table is handled.For current coefficient c
I, j, generate its refinement position (1 bit, 0 or 1), promptly generate in its Plane n on the throne-1 | c
I, j| bit.Because for the lowest order Plane n
Min=0, there is not any refinement position in the next bit plane, so for the lowest order plane, the auxilliary control journey stage is not carried out any processing.Note, after having generated each refinement position, detect whether reach target bit rate R,, otherwise continue the next wavelet coefficient in the auxilliary wavelet coefficient table (if existence) is handled if then encoding process finishes in the auxilliary control journey stage.If all wavelet coefficients in the auxilliary wavelet coefficient table are all by refinement, then encoding process proceeds to next bit plane (n=n-1) and continues above two cataloged procedures.
In sum, at least be the different of master control journey according to different between the method and apparatus of the embodiment of the invention and the existing zero-tree wavelet coding method, promptly handle difference aspect the significant wavelet coefficients in the high bit plane: in the present bit plane how, the EZW algorithm need judge that whether current coefficient is the significant coefficient from the high bit plane, if then skip over this coefficient; And according to method that the embodiment of the invention proposed not needs judge, and just it is encoded as zero coefficient.In addition, by significant coefficient being encoded to zero, simplified the codec complexity that causes owing to above reason.Owing to utilize a symbol to come unessential wavelet coefficient is encoded, so the code efficiency that is proposed under the situation than low bit rate is higher.
Below the present invention has been described with reference to specific embodiments of the invention, but those skilled in the art all understand, can carry out various modifications, combination and change to these specific embodiments, and can not break away from the spirit and scope of the present invention that limit by claims or its equivalent.
Can come execution in step with hardware or software as required.Notice that without departing from the scope of the invention, the process flow diagram that can provide adds step, therefrom removes step or revise wherein step in this instructions.In general, process flow diagram just is used to refer to a kind of possible sequence of the basic operation that is used to realize function.
Embodiments of the invention can utilize programming universal digital computer, utilize special IC, programmable logic device (PLD), field programmable gate array, light, chemistry, biological, system quantum or nanometer engineering, assembly and mechanism to realize.In general, function of the present invention can be realized by any means known in the art.Can use distributed or networked system, assembly and circuit.The communication of data or to transmit can be wired, wireless or by any other means.
Also will recognize, according to the needs of application-specific, one or more can perhaps even in some cases being removed or being deactivated in the key element shown in the accompanying drawing by more separating or more integrated mode realizes.Program or code that realization can be stored in the machine readable media are carried out above-mentioned any method to allow computing machine, also within the spirit and scope of the present invention.
In addition, it only is exemplary that any signal arrows in the accompanying drawing should be considered to, rather than restrictive, unless concrete indication is arranged in addition.Separate or the ability of combination when not knowing when term is also contemplated as to make, the combination of assembly or step also will be considered to put down in writing.
Claims (14)
1. embedded zero-tree wavelet coding method comprises:
Input picture is decomposed into a plurality of wavelet decomposition subbands;
All wavelet coefficients in described a plurality of wavelet decomposition subbands are added in the main wavelet coefficient table, and will assist the wavelet coefficient table and be initialized as sky; And
Divide master control journey and auxilliary control journey two stages, all wavelet coefficients described a plurality of wavelet decomposition subbands encoded according to the ground of the order bit-plane by bit-plane from the most significant digit plane to the lowest order plane, one by one all wavelet coefficients in described a plurality of wavelet decomposition subbands are handled in the Plane n wherein on the throne, n is not less than zero integer:
In the described master control journey stage, whether the absolute value of judging a wavelet coefficient in the described main wavelet coefficient table is more than or equal to 2
n, if,
Then the sign bit according to a described wavelet coefficient generates " positive significant coefficient " or " coefficient is wanted in heavy burden " symbol, a described wavelet coefficient is added in the described auxilliary wavelet coefficient table, and a described wavelet coefficient is set to zero in described main wavelet coefficient table
Otherwise, be marked as at a described wavelet coefficient under the situation of zero tree node, a described wavelet coefficient is not handled, be not marked as at a described wavelet coefficient under the situation of zero tree node, judge that whether absolute value with respect to the wavelet coefficient that is associated with a described wavelet coefficient in the wavelet decomposition subband of the more high frequency of the wavelet decomposition subband at a described wavelet coefficient place is all less than 2
n, if, then the wavelet coefficient that is associated with a described wavelet coefficient in the wavelet decomposition subband of described more high frequency is labeled as zero tree node, and generates " zerotree root " symbol, otherwise generate " forlorn " symbol,
In the described auxilliary control journey stage, generate the refinement position in the described wavelet coefficient Plane n on the throne-1.
2. embedded zero-tree wavelet coding method according to claim 1 is characterized in that, all wavelet coefficients in described a plurality of wavelet decomposition subbands are to be mutually related according to the level Four tree construction.
3. embedded zero-tree wavelet coding method according to claim 1 is characterized in that, according to from left to right, from top to bottom order adds the wavelet coefficient in described a plurality of wavelet decomposition subbands in the described main wavelet coefficient table to by subband ground.
4. embedded zero-tree wavelet coding method according to claim 3 is characterized in that, according to from left to right, from top to bottom order adds the wavelet coefficient in each described wavelet decomposition subband in the described main wavelet coefficient table to by wavelet coefficient ground.
5. embedded zero-tree wavelet coding method according to claim 1 is characterized in that,
After the encoding process that finishes a bit plane or after the processing of the master control journey on finishing a bit plane, judge whether to have reached targeted bit rates, if then finish coding, otherwise carry out the encoding process of next bit plane or the auxilliary control journey of carrying out on the described bit plane is handled; And
After the encoding process that finishes the lowest order plane, finish coding.
6. embedded zero-tree wavelet coding method according to claim 1 is characterized in that, after finishing an encoding process on the bit plane, removes the zero tree node mark of the wavelet coefficient that is marked as described zero tree node on a described bit plane.
7. embedded zero-tree wavelet coding method according to claim 1 is characterized in that, is identified for the most significant digit plane that all wavelet coefficients in described a plurality of wavelet decomposition subbands are encoded according to following equation:
Wherein, n
MaxExpression most significant digit plane, c
I, jExpression is in position (i, the wavelet coefficient of j) locating, and the lowest order plane that is used for all wavelet coefficients of described a plurality of wavelet decomposition subbands are encoded is bit plane n of described input picture
Min=0.
8. embedded zero-tree wavelet code device comprises:
The wavelet decomposition unit is configured to input picture is decomposed into a plurality of wavelet decomposition subbands;
The table initialization unit is configured to all wavelet coefficients in described a plurality of wavelet decomposition subbands are added in the main wavelet coefficient table, and will assists the wavelet coefficient table and be initialized as sky; And
The coding performance element, be configured to branch master control journey and auxilliary control journey two stages, all wavelet coefficients described a plurality of wavelet decomposition subbands encoded according to the ground of the order bit-plane by bit-plane from the most significant digit plane to the lowest order plane, one by one all wavelet coefficients in described a plurality of wavelet decomposition subbands are handled in the Plane n wherein on the throne, n is not less than zero integer:
In the described master control journey stage, whether the absolute value of judging a wavelet coefficient in the described main wavelet coefficient table is more than or equal to 2
n, if,
Then the sign bit according to a described wavelet coefficient generates " positive significant coefficient " or " coefficient is wanted in heavy burden " symbol, a described wavelet coefficient is added in the described auxilliary wavelet coefficient table, and a described wavelet coefficient is set to zero in described main wavelet coefficient table
Otherwise, be marked as at a described wavelet coefficient under the situation of zero tree node, a described wavelet coefficient is not handled, be not marked as at a described wavelet coefficient under the situation of zero tree node, judge that whether absolute value with respect to the wavelet coefficient that is associated with a described wavelet coefficient in the wavelet decomposition subband of the more high frequency of the wavelet decomposition subband at a described wavelet coefficient place is all less than 2
n, if, then the wavelet coefficient that is associated with a described wavelet coefficient in the wavelet decomposition subband of described more high frequency is labeled as described zero tree node, and generates " zerotree root " symbol, otherwise generate " forlorn " symbol,
In the described auxilliary control journey stage, generate the refinement position in the described wavelet coefficient Plane n on the throne-1.
9. embedded zero-tree wavelet code device according to claim 8 is characterized in that, described wavelet decomposition unit also carries out interrelated according to the level Four tree construction to all wavelet coefficients in described a plurality of wavelet decomposition subbands.
10. embedded zero-tree wavelet code device according to claim 8, it is characterized in that, described table initialization unit according to from left to right, from top to bottom order adds the wavelet coefficient in described a plurality of wavelet decomposition subbands in the described main wavelet coefficient table to by subband ground.
11. embedded zero-tree wavelet code device according to claim 10, it is characterized in that, described table initialization unit according to from left to right, from top to bottom order adds the wavelet coefficient in each described wavelet decomposition subband in the described main wavelet coefficient table to by wavelet coefficient ground.
12. embedded zero-tree wavelet code device according to claim 8 is characterized in that, described embedded zero-tree wavelet code device
After the encoding process that finishes a bit plane or after the processing of the master control journey on finishing a bit plane, judge whether to have reached targeted bit rates, if then finish coding, otherwise the auxilliary control journey of carrying out the encoding process of next bit plane or carrying out on the described bit plane is handled
After the encoding process that finishes the lowest order plane, finish coding.
13. embedded zero-tree wavelet code device according to claim 8, it is characterized in that, described embedded zero-tree wavelet code device is removed the zero tree node mark of the wavelet coefficient that is marked as described zero tree node on a described bit plane after finishing an encoding process on the bit plane.
14. embedded zero-tree wavelet code device according to claim 8 is characterized in that, described coding performance element is identified for most significant digit plane that all wavelet coefficients in described a plurality of wavelet decomposition subbands are encoded according to following equation:
Wherein, n
MaxExpression most significant digit plane, c
I, jExpression is in position (i, the wavelet coefficient of j) locating, and the lowest order plane that is used for all wavelet coefficients of described a plurality of wavelet decomposition subbands are encoded is bit plane n of described input picture
Min=0.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009101738479A CN102024265A (en) | 2009-09-14 | 2009-09-14 | Embedded zerotree wavelet coding method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2009101738479A CN102024265A (en) | 2009-09-14 | 2009-09-14 | Embedded zerotree wavelet coding method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN102024265A true CN102024265A (en) | 2011-04-20 |
Family
ID=43865527
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2009101738479A Pending CN102024265A (en) | 2009-09-14 | 2009-09-14 | Embedded zerotree wavelet coding method and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN102024265A (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103209323A (en) * | 2012-12-26 | 2013-07-17 | 辽宁师范大学 | Image compression method based on vectors among k<th>-order zero trees |
| CN104469389A (en) * | 2014-12-09 | 2015-03-25 | 上海交通大学 | Low bit rate video encoding method and system based on conversion downsampling |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6269192B1 (en) * | 1997-07-11 | 2001-07-31 | Sarnoff Corporation | Apparatus and method for multiscale zerotree entropy encoding |
| US6466698B1 (en) * | 1999-03-25 | 2002-10-15 | The United States Of America As Represented By The Secretary Of The Navy | Efficient embedded image and video compression system using lifted wavelets |
| CN1642278A (en) * | 2004-01-06 | 2005-07-20 | 北京大学 | Embedded type zero-type encoding method and circuit structure thereof |
-
2009
- 2009-09-14 CN CN2009101738479A patent/CN102024265A/en active Pending
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6269192B1 (en) * | 1997-07-11 | 2001-07-31 | Sarnoff Corporation | Apparatus and method for multiscale zerotree entropy encoding |
| US6466698B1 (en) * | 1999-03-25 | 2002-10-15 | The United States Of America As Represented By The Secretary Of The Navy | Efficient embedded image and video compression system using lifted wavelets |
| CN1642278A (en) * | 2004-01-06 | 2005-07-20 | 北京大学 | Embedded type zero-type encoding method and circuit structure thereof |
Non-Patent Citations (2)
| Title |
|---|
| 杨永明等: "一个基于小波包分解的率失真最优化块分割图像编码算法", 《中国科学E辑：信息科学》 * |
| 郭田德等: "改进的静态图像零树编码算法", 《计算机学报》 * |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103209323A (en) * | 2012-12-26 | 2013-07-17 | 辽宁师范大学 | Image compression method based on vectors among k<th>-order zero trees |
| CN104469389A (en) * | 2014-12-09 | 2015-03-25 | 上海交通大学 | Low bit rate video encoding method and system based on conversion downsampling |
| CN104469389B (en) * | 2014-12-09 | 2017-05-24 | 上海交通大学 | Low bit rate video encoding method and system based on conversion downsampling |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US5412741A (en) | Apparatus and method for compressing information | |
| US7609904B2 (en) | Transform coding system and method | |
| Horodecki et al. | Classical capacity of a noiseless quantum channel assisted by noisy entanglement | |
| TWI338460B (en) | Method and apparatus for entropy coding and decoding | |
| Cheng et al. | Dynamical electroweak breaking and latticized extra dimensions | |
| CN101984666A (en) | Image lossless compression and decompression method based on lifting wavelet transform | |
| CN101681356B (en) | Method and apparatus for selectively reducing noise in a digital signal | |
| US9819946B2 (en) | Method and apparatus for coding of spatial data | |
| CN105844331B (en) | The training method of nerve network system and the nerve network system | |
| CN1291314A (en) | Method and apparatus for compressing and decompressing image | |
| JP2004032760A (en) | Device and method for encoding zero tree formed by wavelet base coding technique | |
| CN102024265A (en) | Embedded zerotree wavelet coding method and device | |
| CN103582880B (en) | Compression match enumeration | |
| CN102819834A (en) | Image processing device and method | |
| Rajpoot et al. | A novel image coding algorithm using ant colony system vector quantization | |
| KR100540275B1 (en) | Apparatus and method for multiscale zerotree entropy encoding | |
| CN1842820A (en) | Method for spatial up-scaling of video frames | |
| CN108513130B (en) | A kind of realization system and method for Tag-Tree coding | |
| CN102724508A (en) | Distinguishability self-adapting node tree encoding method of JPEG (joint photographic experts group) 2000 | |
| CN101094402A (en) | Method for encoding image based on neural network and SVM | |
| CN1642278A (en) | Embedded type zero-type encoding method and circuit structure thereof | |
| Zhu et al. | Embedded Image Compression Using Differential Coding and Optimization Method | |
| JP2003289441A (en) | Bit plane encoder | |
| Genitha et al. | A technique for multi-spectral satellite image compression using EZW algorithm | |
| Hsin et al. | A Hybrid SPIHT-EBC Image Coder. |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| AD01 | Patent right deemed abandoned |
Effective date of abandoning: 20110420 |
|
| C20 | Patent right or utility model deemed to be abandoned or is abandoned |