CN1201588C - Matrix type image coding method and stabe bit coding processing device using the said method - Google Patents
Matrix type image coding method and stabe bit coding processing device using the said method Download PDFInfo
- Publication number
- CN1201588C CN1201588C CN 00126195 CN00126195A CN1201588C CN 1201588 C CN1201588 C CN 1201588C CN 00126195 CN00126195 CN 00126195 CN 00126195 A CN00126195 A CN 00126195A CN 1201588 C CN1201588 C CN 1201588C
- Authority
- CN
- China
- Prior art keywords
- coding
- status bits
- bit
- array
- remarkable
- 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.)
- Expired - Fee Related
Links
Images
Landscapes
- Compression, Expansion, Code Conversion, And Decoders (AREA)
- Compression Or Coding Systems Of Tv Signals (AREA)
- Compression Of Band Width Or Redundancy In Fax (AREA)
Abstract
The present invention relates to a matrix type image coding method. In the present invention, ordering by merging and precision processing are realized, arrays are used as a basis, and a flow control mechanism is matched; thereby, image compression with the embedded characteristic in a single stage is completed, and a conspicuous mapping array determines whether nodes in a rank tree are conspicuous so that the compression performance is ensured and enhanced. When a state bit coding processing device of the method is applied, and the simple calculation logic is mainly used, a memory with only about one and a quarter image conversion coefficient space is used for the image compression with the embedded characteristic at a high speed; the design of a bit budget controller overcomes the conflict point between embedded coding and matrix type coding so as to ensure the compression performance, and the bit budget controller can be suitably realized by hardware chips with low cost or DSP chips.
Description
The present invention relates to the method for a kind of image encoding (Image Coding), and be particularly related to a kind of based on the image compression encoding method of matrix operation (matrix operation) and code processing apparatus wherein.
In recent years, flourish along with mobile phone and world-wide web, communication network by wired or wireless grade, the amount of information that transmits data to computer or mobile phone is huge day by day, except general lteral data, more comprise various voice and view data, and comprise the multimedia application of a large amount of audio visual signals, become new lover wherein gradually.Therefore, how the efficiency of transmission of multi-media signal and economic benefit are promoted to the highlyest, just become considerable problem.
As everyone knows, multi-media signal can comprise various types of signal such as image, voice and data, and is generally speaking huge with the data volume of picture signal, and voice signal takes second place.For instance, picture signal need be with the speed rates of 3 megabits of per seconds (3M bits per second is hereinafter to be referred as bps), and voice signal then gets final product with the speed rates of 64K bps.Because the data volume of kenels such as voice, vision signal is quite huge, no matter therefore when propagating or storing the data of this type, the common step that all must handle through a compression earlier with the use of saving storage space and communication frequency range, and is accelerated transmission and processing speed.
At present among various digital signal compression/decompression processes methods and standard, aspect animation application, MPEG (Motion Picture Expert Group) standard no matter be MPEG-I or MPEG-II etc., is one of standard of widespread usage in the multimedia industry.And the tableaux application facet, JPEG then commonly used is as the processing specification of compression/de-compression.No matter be the compression processing method of high compression ratios such as MPEG, JPEG, its treatment step mainly is divided into conversion (transform), quantizes (quantization), reaches coding (coding) three phases, the wherein relevant way that quantizes includes at least at the bit of particular threshold (threadshold) and gives up two kinds of method and ordering screening (sort) methods.
A kind of wavelet (wavelet) image compression algorithm of knowing is zero tree (zero-tree) data structure with wavelet conversion (wavelettransform) coefficient, cooperate bit-planes (bit plan) coding techniques, obtain to have concurrently the data flow of high compression when embedded (embedded) characteristic, this wavelet contraction image data stream that contains embedded characteristic possesses progressive transmission, accurately controls code length and advantage such as fault-tolerant, and the function of especially accurately controlling code length is used bit absolutely not merely and given up method and can reach.In various network application today, hope can immediately the demand of images information be frequent day by day between various heterogeneous network systems, network service quality (Quality of Service wherein, hereinafter to be referred as QoS) technology playing the part of critical role, and have the compression algorithm of accurate control chart only as code length and quality, can satisfy the demand of QoS regulation and control fully.Under such background, embedded wavelet image compress technique will continue to play the part of its important role in field of picture communication.
If want immediately to compress the image frame of high-res, or in the communications applications that must take into account high compression instantaneous transmission when the compressed image picture, then must dependence can carry out DSP (the Digital Signal Processing) chip of firmware program or the hardware of ultra-large type integrated circuit (VLSI) is realized.But the wavelet image compressibility of known commercialization, particularly VLSI chip all adopt traditional bit to give up method, but not use newer embedded encoded, so present business-like dsp chip or VLSI chip can't satisfy the demand of QoS regulation and control.
Observe the leading of embedded image coding theory again, to the conversion coefficient behind the wavelet translate phase (coefficients) Screening Treatment of sorting, cooperate bit bitplane coding mode performance equalization more earlier.Handle and the purpose that improves compression efficiency for reaching the acceleration ordering in cataloged procedure, a kind of wavelet image compression algorithm of knowing is to realize to be based upon the zero tree structure of fastening wavelet conversion coefficient frequency domain and time domain pass.In fact above-mentioned algorithm must be set up two tabulations (list) structure, and one is called master list, and another is called secondary tabulation.At first all wavelet conversion coefficients deposit master list in the order of stipulating in advance; In master processor program, master list will be scanned, and be under the common structure basis at encoding and decoding two ends with zero tree, and all absolute values are not less than initial threshold value T
0Coefficient, its coordinate and sign can encode (ordering handle); These coefficients can be moved to pair tabulation afterwards, and former coefficient will to be eliminated be zero, can in master processor program, not be encoded once more to guarantee it; And in the vice processing program, a time Bit data of all coefficients can be encoded and send (precision processing) in the secondary tabulation; Be 1/2nd modes with the threshold value that successively decreases at every turn then, repeat aforementioned cataloged procedure, up to using up coding budget length, or reach minimum threshold value T
MinTill.
Because need a large amount of memory spaces in the previous list operating process and spend operation time, if wish with low-cost hardware or the real above-mentioned algorithm of knowing etc. of doing of firmware mode, just become quite difficulty, its main cause is except time of embedded algorithm and complexity are big, the most important thing is that the required storage of its tabulation or tree storage area gives up method far above traditional bit, so certainly will increase the weight of chip design degree of difficulty and production cost.
Therefore, the invention provides the method for a kind of matrix form image encoding (Image Coding Embedded inMatrix Operation is hereinafter to be referred as ICEM) and use status bits (statusbit) code processing apparatus of this method, it possesses progressive transmission, accurately controls advantages such as code length, can cooperate the QoS regulation and control of network image transmission fully, more particularly the use of its memory space is little and fixing, and its coding rate is rapid, is fit to very much realize with hardware.
For reaching above-mentioned and other purpose, the invention provides a kind of method of matrix form image encoding, comprise the following steps: at first pixel (pixel) data to be done the wavelet conversion, to get a conversion coefficient array; Then remove the flip-flop (DC Gain) in the conversion coefficient array; The scan conversion coefficient arrays is significantly shone upon (Significance Map) array and a plurality of counting auxiliary array to set up one then; Next according to these counting auxiliary array, estimate the estimation bit use amount of the required consumption of coding; When this estimation bit use amount does not reach the coding police circles and is worth, just, carry out general encoding process (ICEMNormal Processing) according to remarkable map array, skip to the step of estimating above-mentioned estimation bit use amount again; And when this estimates that bit use amount is worth above the coding police circles, just, carry out last encoding process (ICEM Final Processing) according to remarkable map array.
Above-mentioned general encoding process comprises the following steps: at first in array scan round mode, and cooperates bit bitplane coding mode, the above-mentioned conversion coefficient array of continuous sweep; Judge again and work as L=L
MaxThe time, unconditional encoding state bit P, S, R; Work as L=L
Max-1The time, unconditional encoding state bit P, S, R, C; And as L＜L
Max-1And L＞1 o'clock is at being significant C
IjEncoding state bit P, S, R, C.And above-mentioned last encoding process comprises the following steps: at first in array P-SCAN mode, and cooperates bit bitplane coding mode, the above-mentioned conversion coefficient array of continuous sweep; Utilize above-mentioned remarkable map array then, encoding state bit P, S; Judge again when coding institute is actual and consume really fullsized special envoy consumption and do not reach when encoding estimated value the status bits P of the remaining conversion coefficient of encoding, S, C; Do not reach when encoding estimated value encoding state bit R yet when the actual actual bit use amount that consumes of coding institute at last.
If|C
ij|＜2T
If|C
ij|＞＝T
P＝1
IfC
ij＞0
S＝0
Else
S＝1
Else
P＝0
And the decision logic of status bits R is:
If|C
ij|＞＝2T
If|C
ij|?&?T
R＝1
Else
R＝0
And the decision logic of status bits C is:
IfMAXMAG
ij＜2T
IfMAXMAG
ij＞＝T
C＝1
Else
C＝0
Wherein:
Status bits P: the remarkable bit of elite stand
Status bits S: the sign bit of elite stand
Status bits R: the meticulous bit of elite stand
Status bits C: the remarkable bit of subtree
C
Ij: coordinate is positioned at the conversion coefficient that (i, j)) locates
MAXMAG
Ij: root node be positioned at (i, in the subtree of j) locating, absolute value the maximum
T: threshold value
L: stratum's number, L
MaxBe positioned at stratum's tree highest point, L
MinBe positioned at stratum's tree lowest part.
The foundation of above-mentioned counting auxiliary array, in array P-SCAN mode, scan above-mentioned conversion coefficient array, and utilize formula:
M[T
n]＝count?of{C
ij|T
n＜＝|C
ij|＜T
n-1}
MM[T
n]＝count?of
{MAXMAG
ij|T
n＜＝|MAXMAG
ij|＜T
n-1}
MM2[T
n]＝count?of
{MAXMAG
ij|T
n＜＝|MAXMAG
ij|＜T
n-1，L＞1}
Follow back and set up above-mentioned counting auxiliary array.And estimate the coding required consumption estimation bit use amount, be to utilize formula:
P
n＝P
n-1+MM[T
n]*4-M[T
n-1]
S
n＝M[T
n]
R
n＝R
n-1+M[T
n-1]
C
n＝C
n-1+MM2[T
n]*4-mm[T
n-1]
Wherein:
M[T
n], MM[T
n], MM2[T
n]: the counting auxiliary array
C
Ij: coordinate is positioned at (i, the conversion coefficient of j) locating
MAXMAG
Ij: root node be positioned at (i, in the subtree of j) locating, absolute value the maximum
T
n: the threshold value of n bout
L: stratum's number
P
nS
nR
nC
nRepresenting a plurality of status bits P, S, R, C respectively is T at threshold value
nThe maximum code length of Shi Suoxu.
The present invention uses the method for above-mentioned matrix form image encoding, a kind of status bits encoding process (Status Bit Coding Processing) device is proposed, it comprises: remarkable bit filter, it is with reference to remarkable map array, in array P-SCAN mode, cooperate the bit bitplane coding mode, continuous sweep conversion coefficient array, output possibility again is conversion coefficient significantly; Status bits P coding unit is coupled to remarkable bit filter, in order to above-mentioned significantly conversion coefficient is encoded to status bits P; Status bits S coding unit is coupled to remarkable bit filter, in order to above-mentioned significantly conversion coefficient is encoded to status bits S; Status bits R coding unit is coupled to remarkable bit filter, in order to above-mentioned significantly conversion coefficient is encoded to status bits R; Status bits C coding unit is coupled to remarkable bit filter, in order to above-mentioned significantly conversion coefficient is encoded to status bits C; And bit budget controller (BitBudget Controller), be coupled to status bits R coding unit and status bits C coding unit, in order to estimate the estimation bit use amount of the required consumption of coding, when these estimation bit use amount arrival coding police circles are worth, state of a control bit R coding unit and status bits C coding unit are to select to stop encoding state bit R, C.
The method of matrix form image encoding of the present invention, ordering by merging and precision are handled, and based on array, cooperate flow control mechanism, reach the innovation conception of only finishing the image compression of the embedded characteristic of tool with the single stage.Status bits code processing apparatus of the present invention, be based on simple calculation logic, for example: relatively reach logical operation, it only needs a small amount of and fixing memory, just can single stage manner, carry out the image compression of the embedded characteristic of tool at a high speed, and the design of bit budget controller has more improved compression usefulness.So be suitable for most realizing with the VLSI chip of hardware or the dsp chip of firmware.
For above-mentioned and other purposes of the present invention, feature and advantage can be become apparent, a preferred embodiment cited below particularly, and conjunction with figs. are described in detail below:
Fig. 1 illustrates a kind of cooperation bit bitplane coding mode, to realize the schematic diagram of progressive transmission;
Fig. 2 illustrates a kind of after the wavelet conversion, the schematic diagram of the three phase layer tree that conversion coefficient is formed;
Fig. 3 illustrates a kind of schematic diagram of scanning pattern of array P-SCAN mode;
Fig. 4 illustrates a kind of according to the preferred embodiment of the invention flow chart of matrix form method for encoding images;
Fig. 5 illustrates a kind of according to the preferred embodiment of the invention block schematic diagram of status bits code processing apparatus.
The simple declaration of drawing reference numeral:
The conversion of 40 row images, 42 wavelets
44 remove flip-flop 46 sets up remarkable map array
48 estimate bit use amount 50 judges last bout
The general encoding process of final encoding process 54 ICEM of 52 ICEM
60 remarkable bit filter 62 status bits P coding units
64 status bits S coding units, 66 status bits R coding units
68 status bits C coding units, 70 bit budget controllers
At present generally when making the image compression/de-compression, be can not use the data format of RGB to do compression to handle, but with YC
rC
bOr YUV is as the form of data processing.This is because human sensitivity to light and shade is higher than the susceptibility to form and aspect and colourity etc., and with YC
rC
bOr YUV has the higher data treatment effeciency and makes things convenient for image processing when doing compression and handling.The method for compressing image of the embodiment of the invention is no exception, if pixel data is not YC
rC
bOr the data format of YUV etc., the data format of RGB for example then at first can become YC by the Data Format Transform of RGB with pixel data
rC
bOr the data format of YUV etc., send into the treatment step of translate phase again, and translate phase of the present invention adopts the wavelet conversion calculus method of the multiple advantage of tool.
Fig. 1 illustrates a kind of cooperation bit bitplane coding mode, to realize the schematic diagram of progressive transmission.Please refer to Fig. 1, wherein a conversion coefficient after the wavelet conversion is represented in each line, and ranks are from top to bottom represented the conversion coefficient that successively decreases through ordering, and each array is represented a bit-planes.If the absolute value error of the coding conversion coefficient that causes is equivalent to the actual pixels error, as long as then can be according to the size of transmitting bandwidth, the conversion coefficient that will sort is sent in regular turn, then output stream just possesses Embedded characteristic, and progressive transmission, accurately controls code length and advantage such as fault-tolerant.
During actual the coding, still can be divided into two steps: at first at specific threshold value, absolute value is not less than the coefficient of threshold value, in this example, be that each bit-planes is denoted as 1 among Fig. 1, or being referred to as significantly that (significant) coordinate cooperates zero tree structure to send (ICEM method of the present invention is represented with status bits P, C) with indirect mode, sign bit is then directly sent (ICEM method of the present invention is represented with status bits S); Then the bit of the remarkable coefficient that will before transmit in present bit-planes directly sent, that is is denoted as R person among Fig. 1 (ICEM method of the present invention is represented with status bits R).Should understand relation between embedded encoded and bit-plane coding by above-mentioned explanation, present embodiment adopts the bit-plane coding mode.
Fig. 2 illustrates a kind of after the wavelet conversion, and the schematic diagram of the three rank stratum tree that conversion coefficient is formed please refer to Fig. 2.Coefficient arrays through wavelet conversion gained, except that the tool frequency domain of coefficient (frequencydomain) characteristic own, because of stratum about the same frequency band has the space proportion relation concurrently, that is to say, the coefficient node of last layer can be considered the father node of corresponding four nodes of one deck down, so this shown special time domain frequency domain relation of Fig. 2 is called the stratum tree again.The idea of this stratum tree is played the part of very important role in coding theory of the present invention, owing to can excavate out zero tree that a large amount of null value constitutes, subtree just computing and processing more basically on zero tree, not only can improve compression ratio, also unnecessary judgment processing can be avoided, speed of coding can be accelerated.
Fig. 3 illustrates a kind of schematic diagram of scanning pattern of array P-SCAN mode.The coding method of knowing is that utilization tabulation cooperation ordering is two stage of a precision alternate coded, ICEM method of the present invention is utilized the idea of above-mentioned stratum tree, in array P-SCAN mode as shown in Figure 3, collocation bit-planes mode, a stage is just finished the coding operation.
Fig. 4 illustrates a kind of according to the preferred embodiment of the invention flow chart of matrix form method for encoding images, please refer to Fig. 4.The method of matrix form image encoding of the present invention comprises the following steps:
At first step 42 is made the pixel data of row image 40 the wavelet conversion earlier, to get a conversion coefficient array.Follow execution in step 44, removing the flip-flop in the conversion coefficient array, generally is that the mode with calculating mean value removes flip-flop, because the idea that wavelet conversion frequency domain characteristic and stratum set, remove flip-flop system the upper left corner, that is be main than the elite stand node of low frequency with coefficient arrays.Execution in step 46 then, come the scan conversion coefficient arrays, to set up a remarkable map array structure and a plurality of counting auxiliary array.
Significantly map array mainly be used for auxiliary to the detecting of zero tree, the array P-SCAN mode that the method for foundation can Fig. 3, scan conversion coefficient arrays, and utilize formula:
Follow back and set up this remarkable map array;
In the formula:
C
Ij: coordinate is positioned at (i, the conversion coefficient of j) locating in the conversion coefficient array
MAXMAG
Ij: root node be positioned at (i, in the subtree of j) locating, absolute value the maximum.
The counting auxiliary array is mainly used in each and handles in the bout, estimating of the required bit length of each status bits (data bit behind the coding) coding, the foundation of above-mentioned counting auxiliary array is in array P-SCAN mode, the scan conversion coefficient arrays, and utilize formula:
M[T
n]＝count?of{C
ij|T
n＜＝|C
ij|＜T
n-1}
MM[T
n]＝count?of
{MAXMAG
ij|T
n＜＝|MAXMAG
ij|＜T
n-1}
MM2[T
n]＝count?of
{MAXMAG
ij|T
n＜＝|MAXMAG
ij|＜T
n-1，L＞1} (2)
In the formula:
M[T
n], MM[T
n], MM2[T
n]: the counting auxiliary array
C
Ij: coordinate is positioned at (i, the conversion coefficient of j) locating in the conversion coefficient array
MAXMAG
Ij: root node be positioned at (i, in the subtree of j) locating, absolute value the maximum.
T
n: the threshold value of n bout
L: stratum's number
Follow back and set up above-mentioned counting auxiliary array.All only dozens of integer storage area is just enough for the memory space of employed counting auxiliary array of this stage, can cooperate above-mentioned remarkable map array to set up operation, and the array element of being correlated with simultaneously calculates.Can directly utilize gained array result afterwards, the calculating of formula (2) of reforming when noting be used in each bout, decoding end does not need the calculating of formula (2) yet simultaneously.
Next execution in step 48, that is according to these counting auxiliary array, estimate the estimation bit use amount of the required consumption of coding.Estimate the purpose of each status bits coding Len req, be to wish when can predict the encoding process process will finish in, and in final processing bout,, distribute the transmission ratio of each status bits according to remaining coding budget.Utilize such optimization to handle, can guarantee ICEM method of the present invention, under the code length budget, can possess quite high compression ratio.And estimate the coding required consumption estimation bit use amount, utilize formula:
P
n＝P
n-1+MM[T
n]*4-M[T
n-1]
S
n＝M[T
n]
R
n＝R
n-1+M[T
n-1]
C
n＝C
n-1+MM2[T
n]*4-MM[T
n-1] (3)
Wherein:
M[T
n], MM[T
n], MM2[T
n]: the counting auxiliary array
T
n: the threshold value of n bout
P
nS
nR
nC
nRepresenting a plurality of status bits P, S, R, C respectively is T at threshold value
nThe time
Required maximum code length.
Owing to can will when be finished in by said method predictive coding process, ICEM coding operation that therefore in abstracto can be follow-up is distinguished into last encoding process 52 and general 54 two paths of encoding process.So step 50, at last bout that judges whether to coding? if not last bout, that is when this estimation bit use amount does not reach the coding police circles and is worth, just according to remarkable map array, carry out general encoding process 54, skip to the step 48 of estimating above-mentioned estimation bit use amount again; If last bout, that is when estimating that the bit use amount is worth above the coding police circles, just, carry out last encoding process 52 according to remarkable map array.Subsidiary one carry be actual design hardware the time, as long as can cooperate register to reach purpose, two flow processs can be unified each status bits control flow.
Above-mentioned general encoding process 54 comprises the following steps: again at first in array P-SCAN mode, and cooperates bit bitplane coding mode, the above-mentioned conversion coefficient array of continuous sweep; Judge again and work as L=L
MaxThe time, unconditional encoding state bit P, S, R; Work as L=L
Max-1The time, unconditional encoding state bit P, S, R, C; And as L＜L
Max-1And L＞1 o'clock is at being significant C
IjEncoding state bit P, S, R, C.And above-mentioned last encoding process 52 also comprises the following steps: at first in array P-SCAN mode, and cooperates bit bitplane coding mode, the above-mentioned conversion coefficient array of continuous sweep; Utilize the known remarkable map array of MAXMAG of current decoder end (after supposing coding, transmit and export other party to) then by decoding end decoding, encoding state bit P, S, at this moment, decoding end is not done last renewal to the MAXMAG array as yet; Judge again when coding institute is actual when consuming that fullsized special envoy consumption does not reach the coding estimated value really, encoding state bit C, therefore decoding end will upgrade the MAXMAG array synchronously this moment, and coding residue not status bits P, the S of the conversion coefficient of transmission; At last when coding institute is actual when consuming really fullsized special envoy consumption and not reaching the coding estimated value yet, encoding state bit R.
The decision logic of above-mentioned status bits P, S is:
If|C
ij|＜2T
If|C
ij|＞＝T
P＝1
IfC
ij＞0
S＝0
Else
S＝1
Else
P＝0 (4)
And the decision logic of status bits R is:
If|C
ij|＞＝2T
If|C
ij|&T
R＝1
Else
R＝0 (5)
And the decision logic of status bits C is:
IfMAXMAG
ij＜2T
IfMAXMAG
ij＞＝T
C＝1
Else
C＝0 (6)
Wherein:
Status bits P: the remarkable bit of elite stand
Status bits S: the sign bit of elite stand
Status bits R: the meticulous bit of elite stand
Status bits C: the remarkable bit of subtree
C
Ij: coordinate is positioned at (i, the conversion coefficient of j) locating
MAXMAG
Ij: root node be positioned at (i, in the subtree of j) locating, absolute value the maximum
T: threshold value
L: stratum's number, L
MaxBe positioned at stratum's tree highest point, L
MinBe positioned at stratum's tree lowest part.
Fig. 5 shows a kind of according to the preferred embodiment of the invention block schematic diagram of status bits code processing apparatus, please refer to Fig. 5.The present invention uses the method for above-mentioned matrix form image encoding, propose a kind of status bits encoding process (Status Bit Coding Processing) device, it comprises: remarkable bit filter 60, status bits P coding unit 62, status bits S coding unit 64, status bits R coding unit 66, status bits C coding unit 68 and bit budget controller (Bit BudgetController) 70.
Significantly bit filter 60 can in array P-SCAN mode as shown in Figure 3, cooperate the bit bitplane coding mode with reference to remarkable map array, continuous sweep conversion coefficient array, and it is according to designer's definition, and output may be significant conversion coefficient.Status bits P, S, R, C coding unit 62,64,66,68, all be coupled to remarkable bit filter 60, it is according to the decision logic of formula (4), formula (5) and formula (6), with above-mentioned conversion coefficient significantly, be encoded to status bits P, S, R, C.
Bit budget controller 70 is of the present invention one big characteristics, it is coupled to status bits R coding unit and status bits C coding unit, and according to formula (2) and formula (3), to estimate the estimation bit use amount of the required consumption of coding, not last bout when judging, promptly when this estimation bit use amount does not reach the coding police circles and is worth, just carry out general encoding process.Be last bout else if, promptly when estimating that the bit use amount is worth above the coding police circles, just, carry out last encoding process according to remarkable map array, that is state of a control bit R coding unit 66 and status bits C coding unit 68, to select to stop encoding state bit R, C.
The present invention only need use relatively small amount and fixing array manifold, and cooperates ordering and precision to handle the succinct array operation logic of unification, still can reach high efficiency compression usefulness.In fact, embedded encoded technology in itself with array in proper order computing conflicting of certain program arranged, the encoding process process of bout in the end particularly must be with in the bit information that plan all be sent originally, more important person preferentially sends, and so compression usefulness can be carried to the highest.For this reason the ICEM algorithm also propose a status bits length estimate with controlling mechanism be the bit budget controller, to guarantee to obtain the highest compression usefulness.
Though the present invention discloses as above with preferred embodiment; yet be not in order to limit the present invention; those skilled in the art can do various changes and variation to it without departing from the spirit and scope of the present invention, so protection scope of the present invention should be by appended claim definition.
Claims (4)
1. the method for a matrix form image encoding comprises the following steps:
Wavelet is changed a pixel data, to get a conversion coefficient array;
Remove a direct current composition of this conversion coefficient array;
Set up a remarkable map array and an a plurality of counting auxiliary array;
According to those counting auxiliary array, estimate an estimation bit use amount of the required consumption of coding;
When this estimation bit use amount does not reach coding police circles when being worth, according to this remarkable map array, carry out a general encoding process, skip to the step of estimating this estimation bit use amount again; And
When this estimation bit use amount is worth above this coding police circles,, carry out a last encoding process according to this remarkable map array.
2. the method for matrix form image encoding as claimed in claim 1, wherein estimate the coding required consumption this estimation bit use amount, be to utilize formula.
P
n＝P
n-1+MM[T
n]*4-M[T
n-1]
S
n＝M[T
n]
R
n＝R
n-1+M[T
n-1]
C
n＝C
n-1+MM2[T
n]*4-MM[T
n-1]
M[T wherein
n], MM[T
n], MM2[T
n] representative counting auxiliary array, P
n, S
n, R
n, C
nRepresenting a plurality of status bits P, S, R, C respectively is T at threshold value
nThe maximum code length of Shi Suoxu.
3. status bits code processing apparatus comprises:
One remarkable bit filter, it in an array P-SCAN mode, cooperates a bit-plane coding mode with reference to a remarkable map array, and continuous sweep one conversion coefficient array is exported significantly conversion coefficient of a possibility again;
One status bits P coding unit couples this remarkable bit filter, in order to being encoded to a status bits P by remarkable conversion coefficient;
One status bits S coding unit couples this remarkable bit filter, in order to being encoded to a status bits S by remarkable conversion coefficient;
One status bits R coding unit couples this remarkable bit filter, in order to being encoded to a status bits R by remarkable conversion coefficient;
One status bits C coding unit couples this remarkable bit filter, in order to being encoded to a status bits C by remarkable conversion coefficient; And
One bit budget controller, couple this status bits R coding unit and this status bits C coding unit, in order to estimate an estimation bit use amount of the required consumption of coding, when this estimation bit use amount arrival one coding police circles are worth, control this status bits R coding unit and this status bits C coding unit, to select to stop to encode those status bits R, C.
4. status bits code processing apparatus as claimed in claim 3, wherein this bit budget controller is estimated this estimation bit use amount of the required consumption of coding, is to utilize formula:
P
n＝P
n-1+MM[T
n]*4-M[T
n-1]
S
n＝M[T
n]
R
n＝R
n-1+M[T
n-1]
C
n＝C
n-1+MM2[T
n]*4-MM[T
n-1]
M[T wherein
n], MM[T
n], MM2[T
n] representative counting auxiliary array, P
n, S
n, R
n, C
nRepresenting a plurality of status bits P, S, R, C respectively is T at threshold value
nThe maximum code length of Shi Suoxu.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 00126195 CN1201588C (en) | 2000-08-25 | 2000-08-25 | Matrix type image coding method and stabe bit coding processing device using the said method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN 00126195 CN1201588C (en) | 2000-08-25 | 2000-08-25 | Matrix type image coding method and stabe bit coding processing device using the said method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1340969A CN1340969A (en) | 2002-03-20 |
| CN1201588C true CN1201588C (en) | 2005-05-11 |
Family
ID=4591800
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN 00126195 Expired - Fee Related CN1201588C (en) | 2000-08-25 | 2000-08-25 | Matrix type image coding method and stabe bit coding processing device using the said method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1201588C (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP4360410B2 (en) * | 2007-03-16 | 2009-11-11 | セイコーエプソン株式会社 | Image processing circuit, display device and printing device |
| US7876968B2 (en) * | 2007-10-15 | 2011-01-25 | Himax Technologies Limited | Apparatus of compressing image data and a method thereof |
-
2000
- 2000-08-25 CN CN 00126195 patent/CN1201588C/en not_active Expired - Fee Related
Also Published As
| Publication number | Publication date |
|---|---|
| CN1340969A (en) | 2002-03-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN1829326A (en) | Color space scalable video coding and decoding method and apparatus for the same | |
| CN1151685C (en) | Appts. and method for optimizing rate control in coding system | |
| CN1791219A (en) | Dual layer bus architecture for system-on-a-chip | |
| CN1627824A (en) | Bitstream-controlled post-processing filtering | |
| CN1968419A (en) | Image encoding method and apparatus and image decoding method and apparatus using characteristics of the human visual system | |
| CN1663278A (en) | Techniques for video encoding and decoding | |
| CN1642282A (en) | Video coding system | |
| CN1926875A (en) | Motion compensation method | |
| CN1825964A (en) | Method and system for processing video frequency data on chip | |
| CN1287584C (en) | Image coding device, image coding method and image processing device | |
| CN1941911A (en) | Parameterization for fading compensation | |
| CN1197251A (en) | Filling method of image signal, its coding device and decoding device | |
| CN1318950A (en) | Picture coding device and method, camera, video recorder and graphic transmission device | |
| CN1960495A (en) | Picture coding device, method, and program thereof | |
| CN101043633A (en) | Quantization matrix selecting method, apparatus of coding and coding/decoding method and system | |
| CN1245028C (en) | Non-uniform multilayer hexaploid lattice full pixel kinematic search method | |
| CN100338620C (en) | Method and apparatus for image compression | |
| CN1543221A (en) | Method and apparatus for 1/4 pixel precision interpolation | |
| CN1675933A (en) | Video encoding and decoding techniques | |
| CN1917648A (en) | Data processing device and its method and encoding apparatus | |
| CN1216495C (en) | Video image sub-picture-element interpolation method and device | |
| CN1926883A (en) | Video/image coding method and system enabling region-of-interest | |
| CN1201588C (en) | Matrix type image coding method and stabe bit coding processing device using the said method | |
| CN1859572A (en) | Encoding device and method, decoding device and method, and program | |
| CN1756361A (en) | The method and apparatus of Code And Decode in based on the frame mode of multiple scaaning |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C06 | Publication | ||
| PB01 | Publication | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| C17 | Cessation of patent right | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20050511 Termination date: 20090925 |