CN1358030A - Video image compressing method applying W-orthogonal transformation - Google Patents

Abstract

A compressing or decompressing method used for motion image (digital video frequency) data utilizes w-quatrature converting to process several continuous frame in image series on the time axis to eliminate the interframe information redundancy. The present invention includes the steps as follows: to divide the motion image into groups as per the step length M, to carry out W-quatrature converting to M frame image in each group to obtain the new M frame image, to carry out the target bit distribution according to the compressing ratio requirement and the different importance of M frame new image and to carry out coding for M frame new frame separately. The invented iinterframe processing method is very simple in calculation which is able to realize the real time compressing by the software or is realized by hardware for lower cost and more quick calculation.

Description

The video image compressing method of utilization W-orthogonal transform

The present invention relates to a kind of video image compression or decompressing method, or rather, relate to coding method between a kind of video (motion) picture frame, and relate to and be used for the W-orthogonal transform that interframe is gone superfluous conversion.

In digital times, no matter be that data are preserved or transfer of data, be necessary to their effective compression, especially video information is all the more so.So data compression technique is one of key technology in the IT technology always.

The research of video compression technology is used and has been surpassed 20 years.Over 20 years, the application of video compression technology is successful.In the communications field, produced H.261, H.263 waited international standard; For single-frame images, Joint Photographic Experts Group is arranged also.Moving Picture Experts Group-1 is that the universal of VCD laid a good foundation, and MPEG-2 is the compression standard of DVD, and it also is the compression standard of the HDTV in some countries and regions futures.Yet technology is constantly progressive.Just in Moving Picture Experts Group-2 foundation soon, the Image Compression based on small echo has shown great vitality.In the MPEG-4 that finalizes a text recently, produced rest image compression algorithm based on wavelet technique, it has formed serious challenge to JPEG.Among the JPEG2000 standard is being formulated.Video compression technology based on wavelet technique also is the focus of research.

The algorithm of MPEG-x (x=1 or 2) partly constitutes by two, and the one, compression algorithm in the frame, the one, interframe compression algorithm.Compression algorithm is exactly the algorithm of JPEG in the frame, and inter prediction encoding adopts a kind of estimation and backoff algorithm based on the piece coupling.Its fundamental mode is compression in the first frame, interframe compression again, time behind the promptly first space.Expense search time of movement compensating algorithm is very big, and in theory also imprecision is in recovering image, the sensation that often has dislocation, thereby be not suitable for resembling the meticulous compression of this class of tele-medicine, furthermore its compression ratio neither be very desirable, resemble a DVD film, normal optical disk needs 6 to 8.The characteristics of this algorithm are: the Code And Decode algorithm is asymmetric, and coding is complicated, and it is simple that decoding is wanted relatively.Thereby coding must be realized with ASIC.The fastest microcomputer also can't real-time coding now.

Video image per second 25 or 30 frames, thereby a lot of identical or essentially identical parts of the picture material of several frames in front and back existence, this redundancy is that everybody recognizes.Key is that the method for utilizing is different, and MPEG is according to the frame of former frame prediction back, perhaps according to the frame in the middle of former frame and the back one frame prediction.The algorithm that it seeks " identical part " is very complicated, and this is that the MPEG compressed encoding can not be realized with software, and must buy the reason of several thousand up to ten thousand yuan compressing card.

On the other hand,,, be used for monitoring, also be starved of compression or decompressing method for video image to border emergency case, hot zones as communication of army's image, video etc. in the Military Application field.It is open that but this communication code system that may be used for military field obviously is not suitable for, and helps communication security like this, even hostile force has cracked our chnnel coding, and also can't our image of decompress(ion), video.This also is an important meaning of setting up the coding scheme of my army oneself.

The objective of the invention is to for the video compression of compressing in the frame based on small echo provides a kind of interframe compression Processing Algorithm, the redundant information between some frames that the elimination moving image closes on, this algorithm is applicable to dual-use.

Technical scheme of the present invention is as follows:

The present invention's video image compression coding method may further comprise the steps:

(a) moving image is divided into groups by a fixed step size M, M is a frame number;

(b) the M two field picture in every group is carried out orthogonal transform, obtain M frame new images;

(c) according to the requirement of compression ratio and the different importance of M frame new images, carry out target bit allocation;

(d) M frame new images is encoded respectively.

In above-described the present invention's video image compression coding method, the M of described step (a) desirable 2,3,4,5,6,7,8.

In above-described the present invention's video image compression coding method, the orthogonal transform of described step (b) is (M=4): $Y_1=\frac{1}{2}(X_1+X_2+X_3+X_4)$ $Y_2=\frac{1}{5}({3X}_1+X_2-X_3-{3X}_4)$ $Y_3=\frac{1}{2}(X_1-X_2-X_3+X_4)$ $Y_4=\frac{1}{5}(X_1-{3X}_2+{3X}_3-X_4)$

X wherein ₁, X ₂, X ₃, X ₄Be four adjacent width of cloth images, resulting image Y after conversion ₁, Y ₂, Y ₃, Y ₄Be called pseudo-image sets.

In above-described the present invention's video image compression coding method, the quadrature of described step (b)

Conversion during M=5 is: $Y_1=\frac{1}{\sqrt{5}}(X_1+X_2+X_3+X_4+X_5)$ $Y_2=\frac{1}{\sqrt{10}}({2X}_1+X_2-X_4-{2X}_5)$ $Y_3=\frac{1}{\sqrt{14}}({2X}_1-X_2-{2X}_3-X_4+{2X}_5)$ $Y_4=\frac{1}{\sqrt{10}}(X_1-{2X}_2+{2X}_4-X_5)$

X wherein ₁, X ₂, X ₃, X ₄, X ₅, be four adjacent width of cloth images, the image Y that after conversion, obtains ₁, Y ₂, Y ₃, Y ₄, Y ₅Be called pseudo-image sets.

The M=4 or the M=5 that are adopted in the above-mentioned steps (b), its corresponding orthogonal transform is two kinds of embodiment of W-orthogonal transform.Because the sampling on the time shaft of image can not have delay too of a specified duration, the interframe conversion should not be adopted orthogonal wavelet transformation.A kind of possible selection is with discrete cosine transform (DCT), but its calculating has some problems.The present invention adopts the conversion (temporarily being referred to as the W-orthogonal transform, because the inventor that this class conversion is the present invention finds at first) of a kind of more effective, similar DCT, and its existing high efficient also has fast algorithm.The W matrix is the best matrix of polynomial basis lower compression property, and DCT is the best matrix of trigonometric function base lower compression property, both do not have which good which differ from one and say.When information source is more suitable when describing with multinomial, the W conversion is better; When information source is more suitable when describing with trigonometric function, DCT is just better.The W-orthogonal transform only needs addition of integer.DCT can not quicken decoding algorithm by so changing.As long as algorithm design must get well, in moving image, add such conversion after, can not increase too many time overhead, simpler than movement compensating algorithm certainly.

The W transfer pair of M=4 is answered one 4 rank orthogonal matrix: $A=\left[\begin{array}{cccc}1/2& 1/2& 1/2& 1/2\\ 3/2\sqrt{5}& 1/2\sqrt{5}& -1/2\sqrt{5}& -3/2\sqrt{5}\\ 1/2& -1/2& -1/2& 1/2\\ 1/2\sqrt{5}& -3/2\sqrt{5}& 3/2\sqrt{5}& -1/2\sqrt{5}\end{array}\right].---\left(1\right)$

Provide the definition of vanishing moment at this, definition: established n number a given ₁, a ₂.., a _nIf

, just claim a ₁, a ₂..., a _nR+1 rank vanishing moment is arranged.Vanishing moment is big, and compression effectiveness is good.

In matrix (1), first row is a DC component, and second row has 1 rank vanishing moment, and the third line has 2 rank vanishing moments, and fourth line has 3 rank vanishing moments.Its amount of calculation is less than DCT's.Quadravalence DCT matrix is: $\frac{1}{2}\left[\begin{array}{cccc}1& 1& 1& 1\\ \frac{\sqrt{2+\sqrt{2}}}{\sqrt{2}}& \frac{\sqrt{2-\sqrt{2}}}{\sqrt{2}}& -\frac{\sqrt{2-\sqrt{2}}}{\sqrt{2}}& -\frac{\sqrt{2+\sqrt{2}}}{\sqrt{2}}\\ 1& -1& -1& 1\\ \frac{\sqrt{2-\sqrt{2}}}{\sqrt{2}}& -\frac{\sqrt{2+\sqrt{2}}}{\sqrt{2}}& \frac{\sqrt{2+\sqrt{2}}}{\sqrt{2}}& -\frac{\sqrt{2-\sqrt{2}}}{\sqrt{2}}\end{array}\right],---\left(2\right)$ It can't integer, does not also have vanishing moment character.If the correlation of quadravalence matrix is not enough, can consider 5 rank matrix, i.e. M=5: $\left[\begin{array}{ccccc}\frac{1}{\sqrt{5}}& \frac{1}{\sqrt{5}}& \frac{1}{\sqrt{5}}& \frac{1}{\sqrt{5}}& \frac{1}{\sqrt{5}}\\ \frac{2}{\sqrt{10}}& \frac{1}{\sqrt{10}}& 0& -\frac{1}{\sqrt{10}}& -\frac{2}{\sqrt{10}}\\ \frac{2}{\sqrt{14}}& -\frac{1}{\sqrt{14}}& -\frac{2}{\sqrt{14}}& -\frac{1}{\sqrt{14}}& \frac{2}{\sqrt{14}}\\ \frac{1}{\sqrt{10}}& -\frac{2}{\sqrt{10}}& 0& \frac{2}{\sqrt{10}}& -\frac{1}{\sqrt{10}}\\ \frac{1}{\sqrt{70}}& -\frac{4}{\sqrt{70}}& \frac{6}{\sqrt{70}}& -\frac{4}{\sqrt{70}}& \frac{1}{\sqrt{70}}\end{array}\right],---\left(3\right)$ It has vanishing moment character equally, can the similar above-mentioned such integer of 4 rank matrixes. $Y_1=\frac{1}{\sqrt{5}}(X_1+X_2+X_3+X_4+X_5)$ $Y_2=\frac{1}{\sqrt{10}}({2X}_1+X_2-X_4-{2X}_5)$ $Y_3=\frac{1}{\sqrt{14}}({2X}_1-X_2-{2X}_3-X_4+{2X}_5)$ $Y_4=\frac{1}{\sqrt{10}}(X_1-{2X}_2+{2X}_4-X_5)$ $Y_5=\frac{1}{\sqrt{70}}(X_1-{4X}_2+{6X}_3-{4X}_4+X_5)$

This computer software and ASIC that helps algorithm realizes.

After finishing the pseudo-image transform of image sets, pseudo-image is adopted wavelet transformation respectively, they are used as rest image handle.But these several secondary figure are not of equal importance to decompressed image.First most important, and last is least important.In above-described the present invention's video image compression coding method, the method that the employing of described step (c) Bit Allocation in Discrete is looked into the experience table according to compression ratio is determined.To M=4, desirable first 50%, the second 25%, the three, the 4th width of cloth each 12.5%.

Carry out step (d) then, promptly the code check size that M frame new images basis is assigned to is carried out quantization encoding respectively.Here quantization encoding can adopt conventional zerotree image or sub-band coding, also can be with quantization coding method in another frame of applying for a patent of the inventor.

The present invention is applied to video image interframe compression or decompression processing, utilizes the W-orthogonal transform that some frames continuous in the image sequence are handled on time shaft, can eliminate the redundant information between some frames that moving image closes on.The processing computing of interframe processing method of the present invention is very simple, can realize Real Time Compression by software, even compress multi-channel video signal simultaneously on microcomputer.Certain algorithm of the present invention also can be realized with hardware, realizes that like that cost is lower, arithmetic speed is faster.

The present invention can be applied to military field, is used for the communication of army's image, video etc., to monitoring of border emergency case, hot zones etc.The present invention helps setting up the encoding video pictures system of my army oneself.

Further specify the present invention below in conjunction with accompanying drawing.

Fig. 1 is the compact model schematic diagram of the present invention to moving image;

Fig. 2 is the schematic diagram of the frame in the MPEG algorithm.

The present invention proposes the new compact model of moving image, from the start frame of moving image, is one group with the n width of cloth promptly, on time shaft image is done a W-orthogonal transform earlier, forms the new n width of cloth " image " group (being called pseudo-image sets), as shown in Figure 1.In pseudo-image sets the inside, the significance level of " image " has a natural ordering, and first is most important, and second width of cloth takes second place ..., last is worst.Just can obtain approximate a recovery of image sets by first width of cloth of pseudo-image sets, just can obtain more accurate approximate recovery of image sets by two width of cloth of pseudo-image sets, certain, just obtained the accurate recovery of original image group by all pseudo-images.

The test more complicated of moving image, index relatively is also a lot, and just method of testing is difficult to look for fully.Except compression ratio and signal to noise ratio were arranged equally, another important indicator was the sampling delay of algorithm.In the MPEG algorithm, sampling delay is actually 9 frames.In this 9 frame, in fact having only two frames is primitive frame (I frames), and the P frame is that the I frame interpolation by two ends forms, and the B frame is to be formed by I frame and P frame interpolation, as shown in Figure 2.

Because the correlation of interframe is very strong, redundancy is big, the image in the image sets of handling for a long time, compression ratio can improve naturally, but sampling delay strengthens, the buffer memory during implementation algorithm increases, and has strengthened hardware cost.

In algorithm of the present invention, during M=4, be a component group with 4 frames.Like this, algorithm does not fully excavate compression ratio, but that sampling delay has reduced is over half, and buffer memory had reduced over halfly when hardware was realized, had reduced hardware cost.Even so, picture quality of the present invention and compression ratio not only do not reduce, and two on the contrary high, promptly when compression ratio was higher than MPEG, signal to noise ratio also was higher than MPEG's far away.This section video with the inventor's collection is an example.When compression ratio was 27 times, the average peak signal to noise ratio of algorithm of the present invention was 41.40 (Y), 39.5 (UV), and MPEG's has only 31.3 (Y), 34.5 (UV).During compression algorithm to 60 of the present invention times, Y-PSNR all descends about 2dB.

It is not big like this that actual visual quality differs.This has reflected another characteristics of MPEG algorithm, and it can not do the high-fidelity compression to image.So in this type systematic of distance medical diagnosis, the MPEG algorithm is obsolete, because most of image of its inside has " artificial composition ".And the present invention proposes interframe compression Processing Algorithm and can do the high-fidelity compression to image, and practicality is arranged.

Claims (5)

1, a kind of video image compression coding method, the method comprising the steps of:

(a) moving image is divided into groups by a fixed step size M, M is a frame number;

(b) the M two field picture in every group is carried out orthogonal transform, obtain M frame new images;

(c) according to the requirement of compression ratio and the different importance of M frame new images, carry out target bit allocation;

(d) M frame new images is encoded respectively.

2, video image compression coding method according to claim 1 is characterized in that the arbitrary number among the M desirable 2,3,4,5,6,7,8 of wherein said step (a).

3, video image compression coding method according to claim 1 is characterized in that the orthogonal transform of wherein said step (b), during M=4 is: $Y_1=\frac{1}{2}(X_1+X_2+X_3+X_4)$ $Y_2=\frac{1}{5}({3X}_1+X_2-X_3-{3X}_4)$ $Y_3=\frac{1}{2}(X_1-X_2-X_3+X_4)$ $Y_4=\frac{1}{5}(X_1-{3X}_2+{3X}_3-X_4)$

X wherein ₁, X ₂, X ₃, X ₄Be four adjacent width of cloth images, the image Y that after conversion, obtains ₁, Y ₂, Y ₃, Y ₄Be called pseudo-image sets.

4, video image compression coding method according to claim 1 is characterized in that the orthogonal transform of wherein said step (b), during M=5 is: $Y_1=\frac{1}{\sqrt{5}}(X_1+X_2+X_3+X_4+X_5)$ $Y_2=\frac{1}{\sqrt{10}}({2X}_1+X_2-X_4-{2X}_5)$ $Y_3=\frac{1}{\sqrt{14}}({2X}_1-X_2-{2X}_3-X_4+{2X}_5)$ $Y_4=\frac{1}{\sqrt{10}}(X_1-{2X}_2+{2X}_4-X_5)$ $Y_5=\frac{1}{\sqrt{70}}(X_1-{4X}_2+{6X}_3-{4X}_4+X_5)$

X wherein ₁, X ₂, X ₃, X ₄, X ₅, be four adjacent width of cloth images, the image Y that after conversion, obtains ₁, Y ₂, Y ₃, Y ₄, Y ₅Be called pseudo-image sets.

5, video image compression coding method according to claim 1 is characterized in that Bit Allocation in Discrete in the described step (c) adopts the method for looking into the experience table according to compression ratio to determine.

Images