CN101039420B - Streaming format-based image transmission method, prediction algorithm and display method - Google Patents

Abstract

The present invention discloses an image transmission method based on flow format comprising: a serving terminal transmitting the appointed area image information to a display terminal by way of flow format; the display terminal performing decoding based on the received appointed area image information, and displaying the appointed area image information by way of flow format. In the embodiments disclosed in present, image is displayed on the basis of a certain line or a certain block without the need of transmitting the whole image; one band or one block is used as a minimum unit for individually decoding, the presciently decoding is realized on the basis of relativity between two adjacent bands or blocks, the prescient mode information is transmitted to the display terminal, and the display terminal then decodes the coded information based on the prescient mode information.

Description

A kind of appointed area image transmission and display packing based on stream format

Technical field

The present invention relates to the video transmission technologies field, relate in particular to a kind of appointed area image transmission and display packing based on stream format.

Background technology

In the prior art, the transmission means of multimedia messagess such as audio/video mainly comprises download and transmits two kinds as a stream.Downloading mode adopts data all to transmit usually, data are all preserved, data all show, yet, the audio/video file is generally all bigger, and the memory capacity that needs is also bigger, simultaneously because the restriction of the network bandwidth, adopt downloading mode usually will spend several minutes even a few hours, so the delay of this processing method is very big.When adopting the stream transmission mode, time-base medias such as sound, image or animation are transmitted to subscriber computer in real time by audio/video server, the user needn't wait until that whole download of whole file finishes, only will begin partial content deposits internal memory in, and only need can watch through the startup time-delay of several seconds or ten several seconds, data flow transmits at any time and plays at any time, and some delays are just arranged when beginning, when basic at that time medium are play on client computer, the remainder of file will continue to download in server on the backstage.Therefore, stream transmission not only make start the time-delay tenfold, hundred times of ground shorten, and do not need too big buffer memory capacity, have avoided the user must wait for that whole file all downloads the shortcoming that just can watch from the Internet.

Wherein, stream transmission mainly refers to the technology general name by network transfer medium (as video, audio frequency).Its specific meanings is for to be sent to personal computer by the internet with movie and video programs.Realize that stream transmission has two kinds of methods: real-time streaming transmission (Realtime streaming) and progressive streaming transmission (progressivestreaming).In general, be broadcasting in real time as video, or use the stream transmission media server, or use real-time protocol (RTP), be the real-time streaming transmission as RTSP (RealTimeStreamingProtocol, real-time streaming protocol).As using HTTP (Hypertext Transfer Protocol, HTML (Hypertext Markup Language)) server, file promptly sends by sequential flow.Adopt the sort of transmission method to rely on client's demand, certainly, stream-oriented file downloads to hard disk before also being supported in broadcast fully.

The progressive streaming transmission is a progressive download, the user can watch line medium again in file in download, at given time, the user can only watch downloaded that part of, and can not jump to the front part of also not downloading, the progressive streaming transmission does not resemble the real-time streaming transmission and adjusts according to the speed that the user connects during the transmission.Because the http server of standard can send the file of this form, does not also need other particular protocol, often be known as the HTTP stream transmission.The progressive streaming transfer ratio is fit to high-quality short-movie section, as head, run-out and advertisement, because the part that this document is watched before broadcast is harmless the download, this method guarantees the final mass that film is play, to issuing the short-movie section by modulator-demodulator, the progressive streaming transmission seems very practical, and the progressive streaming transmission allows to use the data rate higher than modulator-demodulator to create video segment.In addition, the progressive streaming file is to be placed on standard HTTP or FTP (File Transfer Protocol, the file transfer protocol (FTP)) server, is easy to management, and is irrelevant with fire compartment wall basically.But the progressive streaming transmission is not suitable for long segment and the video of random access requirement is arranged, as: lecture, speech and demonstration etc., the user is before watching, must experience postpone, especially true to slower connection, therefore, Live Audio is not supported in the progressive streaming transmission, in fact strict, progressive streaming transmission function is a kind of program request technology.

In real time stream is different with the HTTP stream transmission, needs special-purpose streaming media server and host-host protocol, and the real-time streaming transmission is transmission in real time always, is particularly suitable for live event, also supports random access, but user's F.F. or retreat to watch the content of front or back.

Real-time streaming transmission must be joined and be connected a bandwidth, this means that picture quality is relatively poor when connecting with modem speed, and, owing to the information of losing of makeing mistakes is left in the basket, network congestion or when going wrong, video quality is very poor.Guarantee video quality as desire, the progressive streaming transmission is perhaps better.The real-time streaming transmission needs particular server, as QuickTime Streaming Server, RealServer and WindowsMedia Server.These servers allow medium are sent and carry out more multi-level control, thereby system's setting, management are more complicated than standard http server.The real-time streaming transmission also needs the ad hoc network agreement, as: MMS (Microsoft Media Server, Microsoft Media Server).These agreements go wrong when fire compartment wall is arranged sometimes, cause the user can not see the real time content in some places.Above transmission control protocol, as RTP (Real-timeTransportProtocol, RTP)/UDP (User DatagramProtocol, User Datagram Protoco (UDP)) and MMS/HTTP/TCP (Transmission Control Protocol, transmission control protocol) etc.What the real-time streaming transmission was paid close attention to is stream-oriented file itself, and transport layer is accomplished transparent support.

Existing image transmission technology is promptly downloaded and the display image technology by network, all downloads basically, all shows or begins little by little to show from the head end of image.The shortcoming of this technology is to treat information all in the image is all parallel, again because the restriction of the coding of conventional images, can not accomplish that the emphasis to information extracts, the emphasis transmission, and a certain zone that just can not be from image is controlled certainly begins demonstration.In the existing in addition image coding technique, do not use prediction algorithm, when transmission, can not well save bandwidth, and H.264 existing intraframe prediction algorithm is decoded as a reference with the data on the left side above must knowing, algorithm in the frame H.264, also can only be by scanning sequency, from left to right, decode from top to bottom and show entire image.

Stream transmission of the prior art, no matter be the progressive streaming transmission, or the real-time streaming transmission, usually adopt and divide the frame video transmission, separately decoding, whole frame show, infra-frame prediction (above need knowing and left side coded data as prediction reference), inter prediction (motion compensation).Can't realize video data is preserved (or distributed and saved) together, disperse transmission, disperse to show, in the scope littler, carry out video Data Transmission flexibly than frame.

Existing huge graphics system, as, GIS or urban area map etc. often all are to adopt existing image encoding mode, as forms such as JPEG, GIF, because data volume is very big, Network Transmission becomes an one application bottleneck.For another example, existing e-book system, the transmission aspect also is a huge bottleneck.Especially for the huge image that does not have frame structure, how to encode, how to transmit, how to decode all is a problem that waits to solve.

Summary of the invention

The problem that the embodiment of the invention will solve provides a kind of appointed area image transmission and display packing based on stream format, can't realize view data is preserved (or distributed and saved) together to solve in the prior art, disperses transmission, the defective that the appointed area shows.

To achieve these goals, embodiments of the invention provide a kind of appointed area image transfer method based on stream format, may further comprise the steps:

Service end is encoded to the image information of appointed area in the image by stream format, and is sent to display end;

Described display end is decoded according to the image information of the appointed area that receives, and plays the image information that shows described appointed area based on stream format.

Described service end is sent to the image information of appointed area by stream format and also comprises before the display end: described service end is obtained needs the appointed area of transmitting in the image, described appointed area is meant that this zone is made of one or more bands or macro block at inner concrete certain position range of entire image.Described band or macro block are the base unit of composing images, also are the minimum decodable code units of display.

When coding, need earlier image transitions to be become dot pattern, by Forecasting Methodology in the image macro block or band are encoded then, described prediction algorithm is when predicting pixel, and any one carries out prediction in the image among both to use band drift angle pixel weighted sum not to be with the weighting of drift angle pixel.

Adopt the P2P agreement to cooperate the transmission of macro block or band.

Real-time coding in the needs Network Transmission; Or storage and then in transmission over networks after the coding earlier; Wherein, adopt file classification file layout after the coding earlier.

Before coding, need be with the picture raw information of lattice structure storage, as YUV (luminance signal: Y; Two color difference signals: U component, V component) pattern is exactly a typical dot pattern, i.e. two chromatic values of the corresponding brightness value of every some pixel, and same RGB (RGB) pattern also is a dot pattern.And then obtain residual error by prediction algorithm of the present invention, utilize methods such as existing DCT (DiscreteCosine Transform, discrete cosine transform) conversion, quantification, entropy coding to handle again.

In decoding, at first pass through steps such as anti-entropy coding, inverse quantization, IDCT (inverse discrete cosine transformation) conversion, decode image information according to selected prediction algorithm then.

In coding time, judge that the sort of predictive mode preferably adopts the method for SAD (absolute difference and) or variance usually.

It is a kind of based on Forecasting Methodology in the image of stream format that the present invention also provides, and may further comprise the steps:

Obtain the adjacent pixel values of macro block or band periphery;

Any one carries out prediction in the image among both to use band drift angle pixel weighted sum not to be with the weighting of drift angle pixel;

Wherein, pixel weighting formula is:

Wherein, X pixel and Y _iRelevant, M _iRepresent coefficient correlation, coefficient correlation is expressed as: M=p * q; Wherein p is a distance coefficient, and promptly an energy channel the inside, the predicted position of coefficient correlation point distance accounts for the ratio of whole passage length; Q is a proportionality coefficient, and promptly this energy channel the inside cuts apart the ratio value that accounts for whole predict pixel.

The prediction of described band comprises under the situation on known one side or known two symmetrical limits, and make progress model prediction, diagonal model of horizontal pattern prediction, the downward model prediction of level, the level of band predicted; Described macroblock prediction comprises under the situation on known one side, known two symmetrical limits, known three limits and known four limits, to horizontal pattern prediction, the downward model prediction of level, the level of macro block make progress model prediction, vertical mode prediction, vertical left model prediction, vertical-right model prediction, diagonal model prediction.

Adopt the arithmetical operation of the coefficient replacement of simplification by the complexity of prediction algorithm generation.

The present invention also provides a kind of appointed area method for displaying image based on stream format, uses macro block or band as the base unit that image shows, is specially to use macro block or band to show the image information of appointed area.Show in the image information of appointed area, described appointed area is meant at inner concrete certain position range of entire image, this zone is made of one or more bands or macro block, and can control the display speed and the display position of band or macro block with the program that sets in advance; Described control display speed shows as by the mode of fast forwarding and fast rewinding and watches picture material for band pattern.

Compared with prior art, the embodiment of the invention has the following advantages:

In the embodiment of the invention, do not need to transmit whole image, also be regardless of frame structure, band or macro block are the base unit of composing images, also are the least unit of decoding and displaying simultaneously; Image prediction algorithm according to the present invention is then realized predictive coding, image transmission algorithm of the present invention then is to communicating predicted pattern of display end and residual error code, display end is decoded to coded message according to described predictive mode and residual error code, obtains the image information of appointed area.Among the present invention, Forecasting Methodology and image transmission algorithm can be selected to use according to concrete needs in the image.

In anti-error code method H.264, the FMO characteristic is arranged, the macroblock map that allows independent and dispersion encapsulates with Slice Group in Slice then.The purpose of this method mainly is for anti-error code needs, is used in the video transmission the inside.Forecasting Methodology is supported in the frame and inter prediction, and wherein infra-frame prediction is different fully with this patent, and angle is also different.Though proposed to disperse the notion of transmission, can not well transmit targetedly assigned address, more impossible the appointed area is shown targetedly, belong to diverse technology category.

The present invention has also stipulated the unit-band of a kind of novel measurable coding and demonstration, this unit of display and H.264 in Slice be not a notion fully, but at showing and the needs of coding design.Rather than be purpose with transmission and anti-error code, so implementation method is also different fully.

The present invention also specialized designs be used to support the Forecasting Methodology of streamed image transmission, this Forecasting Methodology had not only guaranteed the characteristic that can in time decode but also the efficient that improves transmission.In decoding, also provide algorithm can realize control to broadcasting speed and position.

Description of drawings

Fig. 1 is a kind of image transfer method flow chart based on Streaming Media of the present invention;

Fig. 2 is that macro block of the present invention constitutes schematic diagram;

Fig. 3 is the schematic diagram that macro block of the present invention constitutes band;

Fig. 4 is that longitudinal band of the present invention is formed whole frame schematic diagram;

Fig. 5 is the I band schematic diagram in the longitudinal band of the present invention;

Fig. 6 is that the horizontal band of the present invention is formed whole frame schematic diagram;

Fig. 7 is the I band in the horizontal band of the present invention;

Fig. 8 is the server side code method of streamed image of the present invention;

Fig. 9 is a streamed image using method of the present invention;

Figure 10 is the present invention's one decoded instance schematic diagram;

Figure 11 is a macro block classification schematic diagram of the present invention;

Figure 12 a is an average mode prediction schematic diagram of the present invention;

Figure 12 b is a horizontal pattern prediction schematic diagram of the present invention;

Figure 12 c is the downward model prediction schematic diagram of level of the present invention;

Figure 12 d is diagonal 1 a model prediction schematic diagram of the present invention;

Figure 12 e is a vertical-right model prediction schematic diagram of the present invention;

Figure 12 f is a vertical left model prediction schematic diagram of the present invention;

Figure 12 g is diagonal 2 model prediction schematic diagrames of the present invention;

Figure 12 h is the level of the present invention model prediction schematic diagram that makes progress;

Figure 12 i is that the present invention is a dct transform predictive mode schematic diagram;

Figure 12 j is a B piece schematic diagram of the present invention;

Figure 13 a is known three Forecasting Methodology of the present invention;

Figure 13 b is known four Forecasting Methodology of the present invention;

Figure 14 a is the known four limit horizontal pattern prediction schematic diagrames of the present invention;

Figure 14 b is the known four limit diagonal of the present invention 1 model prediction schematic diagrames;

The downward model prediction schematic diagram of the known four limit levels of Figure 14 c the present invention;

The known four limit vertical-right model prediction schematic diagrames of Figure 14 d the present invention;

The known four limit vertical mode prediction schematic diagrames of Figure 14 e the present invention;

The known four limit diagonal of Figure 14 f the present invention 2 model prediction schematic diagrames;

The known four limit levels of Figure 14 g the present invention model prediction schematic diagram that makes progress;

The known four limit vertical left model prediction schematic diagrames of Figure 14 h the present invention;

Figure 15 a is the known three limit horizontal pattern prediction schematic diagrames of the present invention;

Figure 15 b is the known three limit diagonal of the present invention 1 model prediction schematic diagrames;

The downward model prediction schematic diagram of the known three limit levels of Figure 15 c the present invention;

The known three limit vertical-right model prediction schematic diagrames of Figure 15 d the present invention;

The known three limit vertical mode prediction schematic diagrames of Figure 15 e the present invention;

The known three limit diagonal of Figure 15 f the present invention 2 model prediction schematic diagrames;

The known three limit levels of Figure 15 g the present invention model prediction schematic diagram that makes progress;

The known three limit vertical left model prediction schematic diagrames of Figure 15 h the present invention;

Figure 16 a is the known one side of the present invention horizontal pattern prediction schematic diagram;

Figure 16 b is the known one side of the present invention diagonal 1 model prediction schematic diagram;

Figure 16 c is the downward model prediction schematic diagram of the known one side of the present invention level;

Figure 16 d is the known one side of the present invention vertical-right model prediction schematic diagram;

Figure 16 e is the known one side of the present invention vertical mode prediction schematic diagram;

Figure 16 f is the known one side of the present invention diagonal 2 model prediction schematic diagrames;

Figure 16 g is the known one side of the present invention level model prediction schematic diagram that makes progress;

Figure 16 h is the known one side of the present invention vertical left model prediction schematic diagram;

Figure 17 is that the present invention determines total formula coefficient schematic diagram;

Figure 18 a is the known both sides of a present invention band horizontal pattern prediction schematic diagram;

Figure 18 b is the known both sides of the present invention band level model prediction schematic diagram that makes progress;

Figure 19 is the diagonal 1 model prediction schematic diagram of the present invention's 8 * 8 band drift angle information;

Figure 20 a and Figure 20 b are that the present invention increases edge macroblock prediction schematic diagram;

Figure 21 is that the order that the present invention decodes is 1,2,3,4,5,6,7 schematic diagrames;

Figure 22 is Figure 21 realization flow figure of the present invention;

Figure 23 is that the order that the present invention decodes is toward edge diffusion schematic diagram with the center;

Figure 24 is Figure 23 realization flow figure of the present invention;

Figure 25 to Figure 27 is the circular broadcast algorithm schematic diagram of the present invention;

Figure 28 is that the present invention disperses the schematic diagram storing and disperse to transmit;

Figure 29 is that the present invention is that example realizes the band sequence chart to display speed with the I band;

Figure 30 is that the present invention is that example realizes the control schematic diagram to display speed with the macro block;

Figure 31 is the system construction drawing of service end of the present invention and display end;

Figure 32 is the present invention changes or determine display position with the mode of agreement a message process and the message process that changes display speed;

Figure 33 is a kind of image real-time Transmission of the present invention schematic diagram;

Figure 34 is that the present invention is an example secondary index file classification storage schematic diagram in the macroblock coding mode;

Figure 35 is that the present invention is three grades of index file classification storages of example schematic diagram with the band.

Embodiment

In the embodiment of the invention, a kind of image transfer method based on Streaming Media as shown in Figure 1, specifically may further comprise the steps:

S101, service end before coding or when coding need be becoming YUV pattern or other dot pattern to image transitions earlier, obtain then and need the appointed area of transmitting in the image, described appointed area comprises band or macro block, before the image information transmission, it is the pattern of elementary cell that image setting is become with band or macro block, rather than encodes as base unit with whole frame or entire image, do not need from left to right permanent order from top to bottom yet.Wherein, the base unit macro block of composing images or the base unit piece that is used for conversion comprise 1 * 1,1 * 2,2 * 1,2 * 2,4 * 2,2 * 4,4 * 4,4 * 8,8 * 4,8 * 8,8 * 16,16 * 8,16 * 16 etc. as shown in Figure 2; Dct transform adopts 2 * 2,4 * 4,8 * 8,16 * 16 usually.

Macro block can be made of a plurality of pixels, band can be made of a plurality of macro blocks, band also can directly also can be used as the prediction unit of minimum as the decoding and displaying unit of minimum, band can be divided into two kinds of vertical and horizontal, band has identical structure usually, and is normally constant such as the pixels across that constitutes band and vertical number of pixels; If band is made of macro block, the macroblock number that then constitutes band also is constant, as shown in Figure 3; The schematic diagram of longitudinal band composition entire image as shown in Figure 4; 1 band in the longitudinal band and B band schematic diagram are as shown in Figure 5, wherein 1 band is represented the band of decoding and displaying separately, in coding, do not need to ask the process of residual error with prediction algorithm and with band on every side yet, and the B band is a kind of band that can not independent decoding and displaying, its needs on the basis that I band around decoded can decoding and displaying, and the B band also needs predictive coding in coding; Laterally the schematic diagram of band composition entire image as shown in Figure 6; Laterally 1 band in the band and B band schematic diagram are as shown in Figure 7, laterally band and longitudinal band have only the difference on the direction, the mode of encoding and decoding and transmission course all are similar, just in prediction, longitudinal band crossed that to make lateral prediction just passable, also adopt horizontal mode to decode decoding the time certainly.If band is to be made of macro block in the coding, promptly the base unit of prediction algorithm is macro block rather than band, and this is that 1 band also must be able to independently be decoded.Because band inside also needs dct transform in coding, and dct transform is preferably square matrix, so band must be able to be divided into a plurality of square set.When coding, can distinguish I band or B band by specific position.

S102 carries out predictive coding according to Forecasting Methodology in the image to appointed area or entire image, and coded message is carried out predictive coding, conversion, quantification, entropy coding, sends to display end then.Realize the predictive coding between band or macro block, the server side code mode has two kinds, a kind of is the precoding mode, promptly before transmission, just coding work is all finished, Unified coding normally, Unified coding is normally undertaken by certain orientation one definite sequence, as from left to right, from top to bottom etc., this time, often each band or macro block all had unique sequence number and its correspondence, perhaps can find band or the macro block that needs, in the actual storage process, often adopt the method for classification storage, can be easy to retrieval and location like this by a certain algorithmic formula; Another kind of mode is the real-time coding mode, promptly just encodes when needs transmit, and transmits while encode.When for example adopting the real-time coding mode, be example with the macro block, selected a kind of broadcast algorithm is in layer compiled then outward.For the piece that adopts the prediction mode coding, need communicating predicted pattern and residual error code, and then conversion, quantification, entropy coding.

Aspect Network Transmission: can realize the fast forwarding and fast rewinding function by the I band, specifically with reference to the explanation of back about rate control module and position control module.Band or macro block can also come transfer files in the mode of P2P (point-to-point), reach the purpose of the efficient use of network.And existing image is owing to want whole demonstration, so the performance that P2P uses is not high, but because the present invention is based on stream mode, so when using P2P, the image information distributed store on some service ends, is controlled the images content by the P2P backstage, can show while transmitting like this, so just can obtain image information fast, and can not influence service quality because of the disposal ability of certain station server.

S103, display end obtains or the prediction algorithm of making an appointment is decoded and obtained original image according to the image information of the appointed area that receives and from service end, and plays the image information that shows described appointed area based on stream format.Display end carries out anti-entropy coding, inverse quantization, inverse transformation, and according to predictive mode and residual error code the coded message that receives is decoded, and obtains band or macro block, thereby obtains the part of piece image.In conjunction with above-mentioned principle, a kind of coding method of streamed image comprises as shown in Figure 8: image transitions is a yuv format; Read by band; Judge whether band for I, if, then carry out prediction in the band, if not, then carry out the prediction of bar interband; Carry out conversion, quantification, entropy coding.The streamed image using method comprises as shown in Figure 9: obtain image information in service end; It is stored as the stream format image; Carry out flow transmission; Read into the stream format image at display end.

A concrete decoded instance as shown in figure 10, A, B and D piece are that 1 type macro block (is encoded to it, 1 type macro block can independently be decoded not to be needed with reference to out of Memory), be concerned about that as the user zone is begun to spread towards periphery by the a-quadrant, the pattern of diffusion is example with the square pattern.

The prerequisite that can decode satisfies in following two conditions at least: or be 1 type macro block; Up and down or about two macro blocks decoded adjacent three decoded or adjacent four decode;

Wherein, the order of decoding can be permanent order, for example: the A position is set is (0,0), first on the right (0,1), one (0 of the left side,-1), one of the top (1,0), following one (1,0), with such coordinate method mark, each piece all can corresponding one group of integer, odd even characteristic according to this group integer can be divided into even piece, parity block, the strange piece of idol and four kinds of structures of Chi Chi piece, the even piece of idol at elder generation decoding center is separated the even piece of lower floor again, separates parity block again, separate the strange piece of idol again, separate the Chi Chi piece again.

Decoding order also can be the method for distance center distance: A, BBBB, CCCC, DDDD, FFFF, EEEEEEEE; Promptly transmit a hithermost decodable block earlier, whether piece can decode around judging four then, (by the nearest principle in center, that is to say, whether four pieces nearest from A piece center can decode, judge from A piece center time four near pieces then, then by that analogy) arrived the B piece like this, discovery can direct decoding, and then also do not decode from the judgement of A BOB(beginning of block), can judgement and the nearest not decoding block in A piece center decode, and discovery C piece can be decoded, and then decodes it.In like manner go down to find that F can not decode, E can not, decoding D, and then begin to judge from the A distance condition, if find and can decode, then decoding, if cannot, F decoding then, last E decoding.

The decoding order can also for: press the order of inner lane to the outer ring: A (inner lane), DBDBDBDB (outer ring); Scan inner lane CCCC, EEEEEEEE (outer ring) again; Scan inner lane FFFF again.

For can be from piece image any old place cut the data that receive image section or, the display unit that can finish decoding separately must be set in image inside until the whole data that receive image.Be to finish in video stream media by the method that the I frame is set, be the user can be in video display process incoming video stream at random, go out a complete two field picture as long as obtain a complete I frame with regard to decodable code, restore the image of P frame and B frame then by the inverse process of the predictive coding between the frame, simultaneously can utilize the introducing of I frame and realize the function of fast forwarding and fast rewinding.The present invention has used the thought that the I frame is set in video, the position that allows the user can locate a care receives the content of this part view data, and does not need to wait after the image end of transmission display image again.This coding and data transmission method can be used for electronic chart, GIS-Geographic Information System (GIS), huge image transmission and military image data transmission etc.

In Figure 11, A is a part of data in the image to I, and definition A, C, G, I are 1 type macro block, and inapplicable predictive mode for the elementary cell that can independently decode of transmission, uses modes such as dct transform, quantification, entropy coding to finish digital coding.Decoding the time is adopted the method for anti-entropy coding, inverse quantization, IDCT to decode and is got final product.B, D, F, H are 2 type macro blocks, 2 type macro blocks according to about or up and down 1 type macro block predict, use DCT, quantification, entropy coding then, finish coding; During decoding, by anti-entropy coding, inverse quantization, IDCT, the decoding of use prediction algorithm for inversion, about having only usually or go up next side and be the 1 type macro block of decoding.E is 3 type macro blocks, and when 1,2 type macro blocks are decoded, then 3 type macro block ambient data have all been finished decoding, can adopt this time the algorithm for inversion of prediction to decode.In coding, can distinguish three kinds of different macro blocks of 1,2,3 types with different positions.

The formula that obtains 3 type macro block E by 1 type macro block among Figure 11 is:

$\left.\begin{array}{c}\left.\begin{array}{c}A\\ C\end{array}\right\}\⇒B\\ \left.\begin{array}{c}A\\ G\end{array}\right\}\⇒D\\ \left.\begin{array}{c}G\\ I\end{array}\right\}\⇒H\\ \left.\begin{array}{c}I\\ C\end{array}\right\}\⇒F\end{array}\right\}\⇒E$

Can before DCT, also can after DCT, that is to say to do between macro block by the DC/AC coefficient and predict during coding; Quantizing process might not be necessary just in order to optimize the performance of coding.

Image generally all is the mode of storing earlier, after both entire image all having been stored, encodes again.But the mode that then needs real-time coding for the video of simple scanning, both file classification storages, in the macroblock coding mode is example, as shown in figure 34, be a two-stage index, the A point is an one-level storage index, the scope of one 4 * 4 piece below the A correspondence, Cun Chu method can finally find the zone of being concerned about most by the segmentation of one-level one-level like this.If click the corresponding macro block of A, can be deep into the next stage index, see meticulousr part.Just two-stage storage above according to actual needs, can divide multistage method storage.

As shown in figure 35, be the ribbon structure of a kind of three grades of index in the classification storage, four bands of one deck when searching a certain particular location, can be located fast according to index under every last layer band correspondence.

Prediction algorithm adopts the fundamental mode of weight estimation, predicts according to the correlation between the pixel, as: X pixel and Y _iRelevant, use M _iRepresent coefficient correlation, following formula then arranged: $X=\underset{i=1}{\overset{n}{\mathrm{\Σ}}}{M}_i{Y}_i.$ In predicted macroblock, represent a pixel with a square area usually in a certain pixel, the so-called relevant pixel of close predicted macro block that is meant in the adjacent macroblocks that the parallel lines that prolong prediction direction in this square area can pass.Comprise the band drift angle in these pixels and be not with two kinds of situations of drift angle.

When a certain position pixel is predicted, at first this pixel is cut apart.The method of cutting apart is by the line segment that adjacent fast related pixel position utilizes and prediction direction parallels the pixel of needs prediction to be divided into some, shown in Figure 13 a.Always have one or two related pixel point can control of certain predict pixel and cut apart, and the parallelogram zone that described one or two related pixel is surrounded becomes energy channel.

Obtaining pixel weighting formula is: $X=\underset{i=1}{\overset{n}{\mathrm{\Σ}}}{M}_i{Y}_i;$ Wherein, X pixel and Y _iRelevant, M _iRepresent coefficient correlation, a day coefficient clothing is shown mutually: M=p * q; Wherein p is a distance coefficient, and promptly an energy channel the inside, the predicted position of coefficient correlation point distance accounts for the ratio of whole passage length; Q is a proportionality coefficient, and promptly this energy channel the inside cuts apart the ratio value that accounts for whole predict pixel.

When calculating q, two kinds of thinkings are arranged, a kind of is that a pixel energy is evenly distributed in the blockage of pixel representative, the q value is not 1; Another kind is that this is that the q value is generally 1 with the concentration of energy of the pixel center position at the blockage of pixel representative, but when cut-off rule passes central point, all by 1/2 calculating.

When calculating P, in the present invention, all the limit from the blockage of adjacent block related pixel point representative begins calculating, and promptly the both sides of energy passage are the most close both sides of the blockage of representative related pixel point.Certainly calculate the P value as the both sides of energy channel with the center of the blockage of neighbor pixel representative.

Wherein p is a distance coefficient, and promptly an energy channel the inside, the predicted position of coefficient correlation point distance accounts for the ratio of whole passage length.If energy channel has only one side pixel as can be known, then defining the p value is 1.

Q is a proportionality coefficient, promptly this energy channel the inside cut apart the ratio value that accounts for whole predict pixel, calculate for convenience, have 1/4,1/2,3/4,1/8,3/8,5/8,7/8 etc. usually.

For convenience of calculation usually the index of the denominator furnishing 2 of coefficient correlation, as 2,4,8,16,32 etc., when Computer Processing, can use shifting function to finish calculating easily like this.And in Practical Calculation, calculate in order further to simplify, often according to above result of calculation, stipulate that artificially some coefficient correlations make calculating easier, but the foundation of considering remains top result calculated, and get some approximate results and simplified, approximate method is mathematical method commonly used, as round, round up etc.When artificially stipulating some parameters, often consider with related pixel apart from distance, sometimes related pixel is not incorporated into the computing formula the inside in energy channel the inside yet, calculate the predicted value of the pixel of certain energy channel the inside.

Prediction algorithm such as Figure 12 a to 12i, the situation when having two symmetrical macro blocks to decode in the adjacent macroblocks is established A, C decodes, needs prediction B, wherein, the B piece is B[1] to B[16], shown in Figure 12 j.In calculating the B piece, during the predicted value of the pixel of each point, adopt the method for weighting,, obtain by related pixel weighting to the adjacent block that can have influence on this pixel value in the B piece promptly according to the direction of prediction.

Figure 12 a is the average mode prediction, and predictor formula is:

$B\left[1\right]=B\left[2\right]=B\left[3\right]=B\left[4\right]=B\left[5\right]=B\left[6\right]=B\left[7\right]=B\left[8\right]=B\left[9\right]=\frac{a+b+c+d+e+f+g+\mathrm{<figure-callout\; id="8"\; label="h"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">h</figure-callout>}}{8};$

$B\left[10\right]=B\left[11\right]=B\left[12\right]=B\left[13\right]=B\left[14\right]=B\left[15\right]=B\left[16\right]=\frac{a+b+c+d+e+f+g+\mathrm{<figure-callout\; id="8"\; label="h"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">h</figure-callout>}}{8};$ Perhaps

$B\left[1\right]=B\left[2\right]=B\left[3\right]=B\left[4\right]=\frac{a<figure-callout\; id="2"\; label="+\; e"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000112.png"\; state="\{\{state\}\}">+</figure-callout>e}{2};B\left[5\right]=B\left[6\right]=B\left[7\right]=B\left[8\right]=\frac{b+\mathrm{<figure-callout\; id="2"\; label="f"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000112.png"\; state="\{\{state\}\}">f</figure-callout>}}{2};$

$B\left[9\right]=B\left[10\right]=B\left[11\right]=B\left[12\right]=\frac{c+\mathrm{<figure-callout\; id="2"\; label="g"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000112.png"\; state="\{\{state\}\}">g</figure-callout>}}{2};B\left[13\right]=B\left[14\right]=B\left[15\right]=B\left[16\right]=\frac{d+\mathrm{<figure-callout\; id="2"\; label="h"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000112.png"\; state="\{\{state\}\}">h</figure-callout>}}{2};$

Figure 12 b is horizontal pattern prediction, influences B[1], B[2], B[3], B[4] neighbor pixel of pixel value is respectively a pixel in the A piece and the e pixel in the C piece.Therefore B[1], B[2], B[3], B[4] only relevant with 2 pixels of a, e, formula is:

$B\left[1\right]=a+\frac{(e-a)}{8}=\frac{7a<figure-callout\; id="8"\; label="+\; e"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">+</figure-callout>e}{8};$ $B\left[2\right]=a+\frac{3(e-a)}{8}=\frac{5a+3\mathrm{<figure-callout\; id="8"\; label="e"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">e</figure-callout>}}{8};$

$B\left[3\right]=a+\frac{5(e-a)}{8}=\frac{3a+5\mathrm{<figure-callout\; id="8"\; label="e"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">e</figure-callout>}}{8};$ $B\left[4\right]=a+\frac{7(e-a)}{8}=\frac{a+7\mathrm{<figure-callout\; id="8"\; label="e"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">e</figure-callout>}}{8};$

$B\left[5\right]=\frac{7b+\mathrm{<figure-callout\; id="8"\; label="f"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">f</figure-callout>}}{8};$ $B\left[6\right]=\frac{5b+3\mathrm{<figure-callout\; id="8"\; label="f"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">f</figure-callout>}}{8};$ $B\left[7\right]=\frac{3b+5\mathrm{<figure-callout\; id="8"\; label="f"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">f</figure-callout>}}{8};$ $B\left[8\right]=\frac{b+7\mathrm{<figure-callout\; id="8"\; label="f"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">f</figure-callout>}}{8};$

$B\left[9\right]=\frac{7c+\mathrm{<figure-callout\; id="8"\; label="g"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">g</figure-callout>}}{8};$ $B\left[10\right]=\frac{5c+3\mathrm{<figure-callout\; id="8"\; label="g"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">g</figure-callout>}}{8};$ $B\left[11\right]=\frac{3c+5\mathrm{<figure-callout\; id="8"\; label="g"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">g</figure-callout>}}{8};$ $B\left[12\right]=\frac{c+7\mathrm{<figure-callout\; id="8"\; label="g"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">g</figure-callout>}}{8};$

$B\left[13\right]=\frac{7d+\mathrm{<figure-callout\; id="8"\; label="h"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">h</figure-callout>}}{8};$ $B\left[14\right]=\frac{5d+3\mathrm{<figure-callout\; id="8"\; label="h"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">h</figure-callout>}}{8};$ $b\left[15\right]=\frac{3d+5\mathrm{<figure-callout\; id="8"\; label="h"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">h</figure-callout>}}{8};$ $B\left[16\right]=\frac{d+7\mathrm{<figure-callout\; id="8"\; label="h"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">h</figure-callout>}}{8};$

Figure 12 c is the downward model prediction of level, and predictor formula is:

$B\left[1\right]=\frac{2a+g+\mathrm{<figure-callout\; id="4"\; label="f"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000113.png"\; state="\{\{state\}\}">f</figure-callout>}}{4};$ $B\left[7\right]=\frac{a+2g+\mathrm{<figure-callout\; id="4"\; label="f"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000113.png"\; state="\{\{state\}\}">f</figure-callout>}}{4};$ $B\left[5\right]=\frac{3b+2a+g+2\mathrm{<figure-callout\; id="8"\; label="h"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">h</figure-callout>}}{8};$ $B\left[11\right]=\frac{2b+a+2g+3\mathrm{<figure-callout\; id="8"\; label="h"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">h</figure-callout>}}{8};$

$B\left[19\right]=B\left[15\right]=\frac{2c+b+\mathrm{<figure-callout\; id="4"\; label="h"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000113.png"\; state="\{\{state\}\}">h</figure-callout>}}{4};$ $B\left[2\right]=B\left[8\right]=\frac{a+2f+\mathrm{<figure-callout\; id="4"\; label="g"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000113.png"\; state="\{\{state\}\}">g</figure-callout>}}{4};$ $B\left[6\right]=\frac{3a+2b+2g+\mathrm{<figure-callout\; id="8"\; label="h"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">h</figure-callout>}}{8};$

$B\left[12\right]=\frac{2a+b+3g+2\mathrm{<figure-callout\; id="8"\; label="h"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">h</figure-callout>}}{8};$ $B\left[10\right]=B\left[16\right]=\frac{2b+c+\mathrm{<figure-callout\; id="4"\; label="h"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000113.png"\; state="\{\{state\}\}">h</figure-callout>}}{4};$ $B\left[3\right]=\frac{3f+\mathrm{<figure-callout\; id="4"\; label="e"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000113.png"\; state="\{\{state\}\}">e</figure-callout>}}{4};$ $B\left[4\right]=\frac{f+3\mathrm{<figure-callout\; id="4"\; label="e"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000113.png"\; state="\{\{state\}\}">e</figure-callout>}}{4};$

$B\left[13\right]=\frac{c+3\mathrm{<figure-callout\; id="4"\; label="d"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000113.png"\; state="\{\{state\}\}">d</figure-callout>}}{4};$ $B\left[14\right]=\frac{3c+\mathrm{<figure-callout\; id="4"\; label="d"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000113.png"\; state="\{\{state\}\}">d</figure-callout>}}{4};$

Figure 12 d is diagonal 1 model prediction, and predictor formula is:

$B\left[1\right]=\frac{7a+\mathrm{<figure-callout\; id="8"\; label="h"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">h</figure-callout>}}{8};$ $B\left[6\right]=\frac{5a+3\mathrm{<figure-callout\; id="8"\; label="h"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">h</figure-callout>}}{8};$ $B\left[11\right]=\frac{3a+5\mathrm{<figure-callout\; id="8"\; label="h"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">h</figure-callout>}}{8};$ $B\left[16\right]=\frac{a+7\mathrm{<figure-callout\; id="8"\; label="h"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">h</figure-callout>}}{8};$ $B\left[5\right]=B\left[10\right]=B\left[15\right]=\frac{a+\mathrm{<figure-callout\; id="2"\; label="b"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000112.png"\; state="\{\{state\}\}">b</figure-callout>}}{2};$

$B\left[2\right]=B\left[7\right]=B\left[12\right]=\frac{g+\mathrm{<figure-callout\; id="2"\; label="h"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000112.png"\; state="\{\{state\}\}">h</figure-callout>}}{2};$ $B\left[3\right]=B\left[8\right]=\frac{f+\mathrm{<figure-callout\; id="2"\; label="g"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000112.png"\; state="\{\{state\}\}">g</figure-callout>}}{2};$ $B\left[9\right]=B\left[14\right]=\frac{b+\mathrm{<figure-callout\; id="2"\; label="c"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000112.png"\; state="\{\{state\}\}">c</figure-callout>}}{2};$ $B\left[13\right]=\frac{c+\mathrm{<figure-callout\; id="2"\; label="d"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000112.png"\; state="\{\{state\}\}">d</figure-callout>}}{2};$

$B\left[4\right]=\frac{e+\mathrm{<figure-callout\; id="2"\; label="f"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000112.png"\; state="\{\{state\}\}">f</figure-callout>}}{2};$

Figure 12 e is the vertical-right model prediction, and predictor formula is:

B[1]＝B[10]＝α； $B\left[2\right]=B\left[6\right]=B\left[11\right]=B\left[15\right]=\frac{a+\mathrm{<figure-callout\; id="2"\; label="h"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000112.png"\; state="\{\{state\}\}">h</figure-callout>}}{2};$ $B\left[3\right]=B\left[12\right]=\frac{3h+\mathrm{<figure-callout\; id="4"\; label="g"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000113.png"\; state="\{\{state\}\}">g</figure-callout>}}{4};$

$B\left[4\right]=\frac{2f+e+\mathrm{<figure-callout\; id="4"\; label="g"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000113.png"\; state="\{\{state\}\}">g</figure-callout>}}{4};$ $B\left[5\right]=B\left[14\right]=\frac{3a+\mathrm{<figure-callout\; id="4"\; label="b"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000113.png"\; state="\{\{state\}\}">b</figure-callout>}}{4};$ B[7]＝B[16]＝h； $B\left[8\right]=\frac{2g+f+\mathrm{<figure-callout\; id="4"\; label="h"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000113.png"\; state="\{\{state\}\}">h</figure-callout>}}{4};$

$B\left[9\right]=\frac{a+2b+\mathrm{<figure-callout\; id="4"\; label="c"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000113.png"\; state="\{\{state\}\}">c</figure-callout>}}{4};$ $B\left[13\right]=\frac{b+2c+\mathrm{<figure-callout\; id="4"\; label="d"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000113.png"\; state="\{\{state\}\}">d</figure-callout>}}{4};$

Figure 12 f is the vertical left model prediction, and predictor formula is:

B[4]＝B[11]＝e； $B\left[3\right]=B\left[7\right]=B\left[10\right]=B\left[14\right]=\frac{e+\mathrm{<figure-callout\; id="2"\; label="d"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000112.png"\; state="\{\{state\}\}">d</figure-callout>}}{2};$ $B\left[2\right]=B\left[9\right]=\frac{3d+\mathrm{<figure-callout\; id="4"\; label="c"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000113.png"\; state="\{\{state\}\}">c</figure-callout>}}{4};$ $B\left[1\right]=\frac{2b+a+\mathrm{<figure-callout\; id="4"\; label="c"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000113.png"\; state="\{\{state\}\}">c</figure-callout>}}{4};$

$B\left[8\right]=B\left[15\right]=\frac{3e+\mathrm{<figure-callout\; id="4"\; label="f"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000113.png"\; state="\{\{state\}\}">f</figure-callout>}}{4};$ B[6]＝B[13]＝d； $B\left[5\right]=\frac{2c+b+\mathrm{<figure-callout\; id="4"\; label="d"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000113.png"\; state="\{\{state\}\}">d</figure-callout>}}{4};$ $B\left[12\right]=\frac{e+2f+\mathrm{<figure-callout\; id="4"\; label="g"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000113.png"\; state="\{\{state\}\}">g</figure-callout>}}{4};$

$B\left[16\right]=\frac{f+2g+\mathrm{<figure-callout\; id="4"\; label="h"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000113.png"\; state="\{\{state\}\}">h</figure-callout>}}{4};$

Figure 12 g is diagonal 2 model predictions, and predictor formula is:

$B\left[4\right]=\frac{7e+\mathrm{<figure-callout\; id="8"\; label="d"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">d</figure-callout>}}{8};$ $B\left[7\right]=\frac{5e+3\mathrm{<figure-callout\; id="8"\; label="d"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">d</figure-callout>}}{8};$ $B\left[10\right]=\frac{3e+5\mathrm{<figure-callout\; id="8"\; label="d"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">d</figure-callout>}}{8};$ $B\left[13\right]=\frac{e+7\mathrm{<figure-callout\; id="8"\; label="d"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">d</figure-callout>}}{8};$ $B\left[8\right]=B\left[11\right]=B\left[14\right]=\frac{e+\mathrm{<figure-callout\; id="2"\; label="f"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000112.png"\; state="\{\{state\}\}">f</figure-callout>}}{2};$

$B\left[3\right]=B\left[6\right]=B\left[9\right]=\frac{c+\mathrm{<figure-callout\; id="2"\; label="d"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000112.png"\; state="\{\{state\}\}">d</figure-callout>}}{2};$ $B\left[2\right]=B\left[5\right]=\frac{b+\mathrm{<figure-callout\; id="2"\; label="c"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000112.png"\; state="\{\{state\}\}">c</figure-callout>}}{2};$ $B\left[12\right]=B\left[15\right]=\frac{f+\mathrm{<figure-callout\; id="2"\; label="g"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000112.png"\; state="\{\{state\}\}">g</figure-callout>}}{2};$ $B\left[16\right]=\frac{g+\mathrm{<figure-callout\; id="2"\; label="h"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000112.png"\; state="\{\{state\}\}">h</figure-callout>}}{2};$

$B\left[1\right]=\frac{a+\mathrm{<figure-callout\; id="2"\; label="b"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000112.png"\; state="\{\{state\}\}">b</figure-callout>}}{2};$

Figure 12 h is the level model prediction that makes progress, and predictor formula is:

$B\left[14\right]=\frac{2e+c+\mathrm{<figure-callout\; id="4"\; label="b"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000113.png"\; state="\{\{state\}\}">b</figure-callout>}}{4};$ $B\left[6\right]=\frac{e+2c+\mathrm{<figure-callout\; id="4"\; label="b"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000113.png"\; state="\{\{state\}\}">b</figure-callout>}}{4};$ $B\left[1\right]=\frac{3f+2e+c+2\mathrm{<figure-callout\; id="8"\; label="d"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">d</figure-callout>}}{8};$ $B\left[10\right]=\frac{2f+e+2c+3\mathrm{<figure-callout\; id="8"\; label="d"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">d</figure-callout>}}{8};$

$B\left[12\right]=B\left[14\right]=\frac{2g+f+\mathrm{<figure-callout\; id="4"\; label="d"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000113.png"\; state="\{\{state\}\}">d</figure-callout>}}{4};$ $B\left[3\right]=B\left[5\right]=\frac{e+2b+\mathrm{<figure-callout\; id="4"\; label="c"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000113.png"\; state="\{\{state\}\}">c</figure-callout>}}{4};$ $B\left[7\right]=\frac{3e+2f+2c+\mathrm{<figure-callout\; id="8"\; label="d"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">d</figure-callout>}}{8};$

$B\left[19\right]=\frac{2e+f+3c+2\mathrm{<figure-callout\; id="8"\; label="d"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">d</figure-callout>}}{8};$ $B\left[11\right]=B\left[13\right]=\frac{2f+g+\mathrm{<figure-callout\; id="4"\; label="d"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000113.png"\; state="\{\{state\}\}">d</figure-callout>}}{4};$ $B\left[2\right]=\frac{3b+a}{4};$ $B\left[1\right]=\frac{b+3a}{4};$

$B\left[16\right]=\frac{g+3\mathrm{<figure-callout\; id="4"\; label="h"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000113.png"\; state="\{\{state\}\}">h</figure-callout>}}{4};$ $B\left[15\right]=\frac{3g+\mathrm{<figure-callout\; id="4"\; label="h"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000113.png"\; state="\{\{state\}\}">h</figure-callout>}}{4};$

Figure 12 i is the dct transform predictive mode, uses DCT to change earlier, and then prediction, i.e. prediction is carried out in the DCT territory.In when prediction, current block is made dct transform, and then and on every side the piece of dct transform pursue the pixel comparison, find out the piece of similarity degree maximum.Make residual error then, again the DCT coding.Judge whether to adopt the method for SAD (absolute difference and) or variance for the most similar piece.

For the situation as Figure 12, there is the similar method of the same employing of three known block promptly current the needs around the prediction piece, shown in Figure 13 a; Also have current need around the prediction piece four known, then adopt same similarly method, shown in Figure 13 b.

Shown in Figure 13 a, because the related pixel point of three limit adjacent blocks is known, than manying one side in both sides, but be not that each pixel all needs above-mentioned three side informations in the prediction piece, in 13a,, have only a just to can use the related pixel dot information of adjacent B piece to f second latter two pixel of row to e four pixels of first row and b with the downward predictive mode of level, the prediction of other pixel is the same with known the 3rd limit condition of unknown of symmetrical two adjacent blocks, is not repeated here.With the example that is predicted as of X pixel among the 13a, prolong the parallel lines of the downward prediction direction of level by the X piece and can pass a, i, j, f, five related pixel points of g.A is 7/8 to the distance coefficient of X, and a is 1/4 to the proportionality coefficient of X; I is 6/7 to the distance coefficient of X, and i is 1/2 to the proportionality coefficient of X; J is 4/5 to the distance coefficient of X, and j is 1/4 to the proportionality coefficient of X; F has been divided into two parts, the first half and j correspondence, and the latter half and i correspondence, the first half is 1/5 to the distance coefficient of X, is 1/4 to the proportionality coefficient of X, the latter half is 1/7 to the distance coefficient of X, is 1/2 to the proportionality coefficient of X; G is 1/8 to the distance coefficient of X, is 1/4 to the proportionality coefficient of X.

Obtain the predictor formula of X piece:

$X=\frac{7}{8}\&times;\frac{1}{4}a+\frac{6}{7}\&times;\frac{1}{2}i+\frac{4}{5}\&times;\frac{1}{4}j+\frac{1}{5}\&times;\frac{1}{4}f+\frac{1}{7}\&times;\frac{1}{2}f+\frac{1}{8}\&times;\frac{1}{4}g$

Is the same to adjacent four Forecasting Methodology with three, just can use the information of more heterogeneous pass pixel for the prediction of some pieces.

When employing was predicted by four adjacent known macro blocks, horizontal pattern predicted that shown in Figure 14 a, predictor formula is identical with known both sides situation; Diagonal 1 model prediction is shown in Figure 14 b, and predictor formula is; The downward model prediction of level is shown in Figure 14 c; The vertical-right model prediction is shown in Figure 14 d; The vertical mode prediction is shown in Figure 14 e; Diagonal 2 model predictions are shown in Figure 14 f; Level makes progress model prediction shown in Figure 14 g; The vertical left model prediction is shown in Figure 14 h.

When predicting by adjacent three known macro blocks, horizontal pattern is predicted shown in Figure 15 a; Diagonal 1 model prediction is shown in Figure 15 b; The downward model prediction of level is shown in Figure 15 c; The vertical-right model prediction is shown in Figure 15 d; The vertical mode prediction is shown in Figure 15 e; Diagonal 2 model predictions are shown in Figure 15 f; Level makes progress model prediction shown in Figure 15 g; The vertical left model prediction is shown in Figure 15 h.

When predicting by adjacent one known macro block, horizontal pattern is predicted shown in Figure 16 a; Diagonal 1 model prediction is shown in Figure 16 b; The downward model prediction of level is shown in Figure 16 c; The vertical-right model prediction is shown in Figure 16 d; The vertical mode prediction is shown in Figure 16 e; Diagonal 2 model predictions are shown in Figure 16 f; Level makes progress model prediction shown in Figure 16 g; The vertical left model prediction is shown in Figure 16 h.

Introduce below in conjunction with Figure 17 explanation and how to determine how each pixel just determines coefficient to the current influence that needs predict pixel point in the known adjacent block in formula.If prediction X piece, the prediction mode of employing is that level is downward, and then the related pixel point with X pixel place piece adjacent block mainly contains, A, B, C, D four pixels; The method of judging is, prolongs the parallel lines that prediction direction is made at X pixel edge, and just the point of the adjacent block of process is the related pixel point.Obviously,, will not pass through the X pixel if an ab straight line parallel with prediction direction up moves again, same, again toward moving down, will not pass through the X pixel to the gh straight line parallel with prediction direction.So just can determine that the ag scope is relevant range on one side, bh is the relevant range of another side.

Draw in the neighbor pixel that ag just in time drops on A and two adjacent blocks of B, bh just in time drops in the relevant neighbor pixel of two adjacent blocks of C and D, therefore draw under the downward pattern of level and the related pixel point of the adjacent block of X spot correlation has A, B, C, D four pixels.The X pixel is passed through in the zone that ab and ef constituted, and has accounted for the area of X pixel 3/4ths; Be that influence will account for 3/4ths of influence to X for A pixel and C pixel; The X pixel is passed through in the zone that ef and gh constituted, and has accounted for the area of X pixel 1/4th; Be that influence will account for 1/4th of influence to X for B pixel and D pixel.Consider the mid point distance of A and X piece: m again from the space; C and X piece mid point distance: n, that is: m: n=3: 5, influence accounts for 5/8ths on the A distance, and influence accounts for 3/8ths on the C distance, and influence just in time is inversely proportional to, and in like manner B and D also meet top ratio.

Therefore: $X=\frac{3}{4}A\&times;\frac{5}{8}+\frac{1}{4}B\&times;\frac{5}{8}+\frac{3}{4}C\&times;\frac{3}{8}+\frac{1}{4}D\&times;\frac{3}{8}=\frac{15A+5B+9C+3\mathrm{<figure-callout\; id="32"\; label="D"\; filenames="S07186668220070404E000113.png,S07186668220070404E000122.png"\; state="\{\{state\}\}">D</figure-callout>}}{32}$

In the application of reality, can adopt fairly simple computing formula to come the shortcut calculation complexity usually.

When prediction, can use the drift angle pixel, as shown in figure 19, A, a, J, j are exactly the drift angle pixel, the pixel of four drift angle correspondences of promptly square row, diagonal 1 pattern of 8 * 8 band drift angle information need be carried out some processing in computing formula; Predicted module can be block structures such as 2 * 2,4 * 4,8 * 8,16 * 16, also can be band, shown in Figure 18 a or 18b, or other shapes.

In prediction, with zone, the edge of piece, promptly a pixel is regarded as a little square as concentration of energy, in prediction the zone of the foursquare limit adjacent as concentration of energy with the estimation range.Coming zone of ignorance is carried out forecast method with existing Forecasting Methodology then, is aforementioned Forecasting Methodology, and formula is exactly that total formula that provides previously, and this method does not need the drift angle pixel.Mention Forecasting Methodology below and be not concentration of energy to and the adjacent edge of estimation range, but be placed on the central point of existing pixel, promptly concentration of energy to central point, as shown in figure 23, go to predict the method for zone of ignorance then.This method needs the drift angle pixel, as shown in figure 19.Detailed algorithm reasoning is seen shown in Figure 24, is that example is carried out 4 * 4 prediction with diagonal 1 pattern, and the central area is for needing the piece of prediction.Connect a pixel center point by prediction direction with parallel lines, and then divide these energy areas equally, form as a, b among Figure 26 a, Figure 26 b, Figure 26 c, c, d, e, f, g, h, i homenergic passage with parallel lines.The energy changing of same energy channel the inside is linear.Under diagonal model, be easy to calculate, if energy channel only uses an end known, other end the unknown supposes that then this section energy channel self-energy is constant, so just can predict the related pixel point in the prediction module in the energy channel.If the energy channel two ends are known, promptly the both sides pixel value is known, then adopts linear method to calculate to need in the medium range forecast module value of the position of the pixel correspondence of predicting to get final product.As in the e passage, if two ends pixel value known (the line segment two-end-point is known) then needs to ask all the other four some e on this line segment ₁, e ₂, e ₃, e ₄Value.

$e_1=m+\frac{(n-m)}{5};$ ${\mathrm{<figure-callout\; id="2"\; label="e"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000112.png"\; state="\{\{state\}\}">e</figure-callout>}}_2=m+\frac{2(n-m)}{5};$ ${\mathrm{<figure-callout\; id="3"\; label="e"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000112.png"\; state="\{\{state\}\}">e</figure-callout>}}_3=m+\frac{3(n-m)}{5};$ ${\mathrm{<figure-callout\; id="4"\; label="e"\; filenames="S07186668220070404E0000510.png,S07186668220070404E000113.png"\; state="\{\{state\}\}">e</figure-callout>}}_4=m+\frac{4(n-m)}{5};$

Shown in Figure 20 a and Figure 20 b, on the basis of 1,2,3 type macro blocks, increase a kind of edge macro block, promptly arrived the boundary member of whole image, represent with B that in Figure 20 can adopt the Forecasting Methodology of Figure 15 or Figure 16 to come boundary macroblocks is carried out predictive coding this time.In Figure 20, when selecting with the central area to be center when beginning to show, the order of demonstration by the center toward around diffusion, such method, the zone that the easiest user of finding is concerned about.

As Figure 21, the order of decoding is 1,2,3,4,5,6,7....Certainly according to different algorithms different order is arranged, this decoding order and front are different, but basic law is the same, pass 1 type macro block earlier, known region A is regarded as in 1 type macro block zone, pass 1 type macro block of known region A (around the 1 type macro block) again, all 2, the 3 type macro blocks that can decode of decoding again, and then the zone of being decoded regarded as known region A, and then pass 1 type macro block around the known region, and then decodable 2, the 3 type macro blocks of decoding; Reciprocal with this, as shown in figure 22.

As shown in figure 23, have multiplely toward the method for edge diffusion with the center, Figure 21 has showed a kind of common, square expansion algorithm, arthmetic statement: pass 1 type macro block, regard little square area as; Each limit step-length adds one, if do not search the piece that can transmit decoding; Each limit step-length adds one again; If have then decode; Then the square area of having decoded that obtains as basic square; Repeat top step again, each limit step-length adds one, as shown in figure 24.

As Figure 25-shown in Figure 27, be the situation of concentration of energy to the square center of pixel representative.When dividing energy channel, the energy point of adjacent pixels representative is coupled together with straight line, get the straight line that the mid point that connects two adjacent pixel energy point line segments makes to be parallel to prediction direction, so just can mark off different energy channels.When prediction, if the pixel of a current prediction is when some energy channels the inside, then by calculating the current pixel value of predicting as Figure 26 formula.If a pixel is simultaneously two energy channel the insides, when the straight line that energy channel is cut apart at the square center of the pixel promptly predicted representative passes, then two different predicted values are obtained current predicted value by weighting, obtain as addition after respectively getting 1/2nd.If when adopting concentration of energy to any this computational methods, proportionality coefficient q value is 1 in the pixel weighting formula.

Storage of the present invention and transmission can be two processes of independently finishing, moonscape image data for example, earlier unified numbering behind its piecemeal,, and suppose that overall data is to be kept in 8 * 8 the zone if press the serial number (by row numbering from left to right) of Figure 22.Being very easy to find storage is by a kind of order, from left to right or from right to left, from top to bottom or from top to bottom, or the order of some distinctive mathematics arrangements, this is different fully with the order of extracting data, when extracting data, the algorithm that may begin in sequence from a certain position of centre or set extracts.

In the image storage may be the former data that adopt the nonanticipating coding, also can be the data when adopting predictive coding.The purpose that it should be noted that predictive coding mainly is in order to save the problem of bandwidth the transmission over networks time.So, can in the needs Network Transmission, encode again, certainly storage and then in transmission over networks after the coding earlier.

When the needs transmission is the view data at center with zone (28), if transmission time the words of predictive coding, but the regulation center is 1 type macro block encodes, if predictive coding well afterwards in transmission then looks for decentre 28 1 nearest type macro blocks to transmit; Still be diffused as example explanation with square, at first, look for 1 type macro block around 28, need transmission 10,12,14,26,30,42,44,46 these 1 type macro blocks earlier; What need then to do is, the sequence number of these corresponding pieces above how calculating, formula is as follows: establish entire image be stored in m * n (m for the row, n is row) the macro block in zone in, and X is 28, and for the center also is 1 type macro block, Y is for needing 1 type macro blocks of transmission again, the house largest block is MAX, and smallest blocks is numbered 1:

Y ₁＝X-2n-2；Y ₂＝X-2n；Y ₃＝X-2n+2；Y ₄＝X-2；Y ₅＝X+2；Y ₆＝X+2n-2；Y ₇＝X+2n；Y ₈＝X+2n+2；

At last, when continuing again, Y1 is replaced existing X to Y8 get final product toward diffusion on every side, as, with Y ₁For example is down calculated again: Z ₁=Y ₁-2n-2; Z ₂=Y ₁-2n; Z ₃=Y ₁-2n+2; Z ₄=Y ₁-2; Z ₅=Y ₁+ 2; Z ₆=Y ₁+ 2n-2; Z ₇=Y ₁+ 2n; Z ₈=Y ₁+ 2n+2.

So just can calculate down the 1 type macro block that one deck need transmit.By the method for such recurrence, just can enlarge constantly no compartment of terrain, the zone that needs show.

Calculated in the calculating, and just extracted and to have extracted again, if find, if find also casting out greater than piece value piece MAX less than 1 just cast out.Fairly simple for strip-type, though also be global storage, transmission I band when extracting, and then transmission B band is all right, because between the I band be at interval fix or I band position can calculate, all are easy to calculate its position, also convenient the extraction and transmission.

Be mainly used in the transmission of huge image,, can provide some real-time business on the network, as ecommerce etc. owing to use the streaming structure.Only need the place of unidirectional increase data for some, such as scanning system, purpose monitoring system etc., with the scanning system is example: because the image of having taken does not need to revise, and need store or coding transmission a part of data that enter camera lens, if such situation in fact also only need be encoded to the data division that enters camera lens.Do like this and can also be convenient to real-time transmission at the saving coding resource.

As shown in figure 28, in storage, both can storage and uniform also can be dispersed in a plurality of local storages in a place, image information is disperseed to store source 1 in the n of source, when X end is initiated request to the specify image zone, the source that can homology 1 comprises appointed area information in the n of source is to the response of X end, and to X end transmission appointed area image information.Can adopt P2P as the underlying protocol of disperseing transmission.

It is a kind of based on display packing in the image of stream format that the present invention also provides, wherein bring realization as shown in figure 29 to the band sequence of display speed with the I bar, when display end when the images serve end initiate to show request, can comprise display speed information, comprise 5 I bands as the content that sends in each chronomere, like this, after service end receives this message, will adjust the transmission speed of self, the speed that the demand of display end is pressed in assurance sends.Reach this purpose, also must be earlier with the I band or have even or heterogeneous being distributed in this image of band of display speed information, and corresponding sequence numbering is arranged.

When needs were done redirect in image, promptly when some setting bands position was jumped in current demonstration band position, only need know needed the band of redirect sequence numbering to get final product.As shown in figure 29, need jump to the n position, then send the positional information of jump information and redirect, then just can see the image information of n position at once to service end.If the speed of the image information that display end receives is faster than the speed of display image, then the image information that receives can be stored in display end, showing according to display speed.

As shown in figure 30, for the demonstration of macro block, equally also can use the method control speed of displaying of similar band and the position of demonstration.Among Figure 30, macro block has shown the pattern of " E ", can generate the pattern of required demonstration with the scheme of setting the band display position.The broadcast algorithm of the macro block of saying previously also is a kind of special algorithm of display position, is an example of position display control.In Figure 30, in the position control module of display end, send positional information: [1,2], [1,3], [1,4], [1,5], [2,2], [3,2], [3,3], [3,4], [4,2], [5,2], [5,3], [5,4], [5,5] to service end.Display end just can demonstrate " E " pattern of designing in advance.

As shown in figure 31, the system construction drawing of service end and display end comprises service end and display end.Wherein, service end comprises service control module, coding module, message module, memory module and mixed-media network modules mixed-media, further comprises speed control submodule and Position Control submodule in the message module; Wherein, service control module is used for according to user's request the service end control operation of being correlated with; Coding module is used for the needs information transmitted is encoded; Speed control submodule in the message module is used for control chart is used for control chart picture reality as transmitting speed, Position Control submodule position; Memory module is used to store relevant information, and mixed-media network modules mixed-media is used for communicating by letter with display end.Display end comprises display module, decoder module, message module, memory module and mixed-media network modules mixed-media, further comprises speed control submodule and Position Control submodule in the message module; Speed control submodule in the message module is used for control chart and is used for the position that the control chart picture shows as speed of displaying, Position Control submodule; Memory module is used to store the relevant information of display image; Decoder module is used for butt joint collection of letters breath and decodes; Display module is used for display image.

Shown in figure 32, show the message process and the message process that changes display speed that changes or determine display position with the mode of agreement.Specifically comprise: display end is by sending the positional information of display image to service end; Service end is accepted OK to the display end feedback; Service end needs the position of transmitting in display end send to be determined image, and transmits; Display end sends speed of displaying information to service end; Service end is accepted OK to the display end feedback; Service end sends to display end and changes existing transmission speed information, and sends.The most important message of only having drawn among this figure.As Figure 32, when using TCP can well control by message as the underlying protocol of network, but it is different when being to use UDP with TCP, it is a kind of transmission mode as possible, speed that may occur showing and the unmatched situation of the speed of transmission, such as, the speed that shows is too fast, therefore under the situation that non real-time requires, can consider to arrive a metadata cache part that is transferred to display end local earlier, directly take out data during demonstration and get final product, with the influence that reduces to bring to display end owing to the network performance instability from this locality.Or the method that directly adopts transmission to separate with control, i.e. UDP key-course TCP is used in transmission, adopts different port transmission respectively.Utilizing prior protocols family is exactly the RTP/RTCP agreement.

As shown in figure 33, in the real-time Transmission process, be transmitted as example with band, service end is utilized image imaging equipment, and as scanner, scanning needs information transmitted.Because the photoelectric device length of scanning is fixed, scanning width constantly increases in time, and institute's image information that obtains is also many more.In this case, can select for use the mode of band to encode and predict that the length of band is the length of scan light electric device, be a edge lengths in the drawings, width changes in time, and the width that scans with unit interval interscan instrument is the width of band, is the b edge lengths in the way.When the some positions of scanner scanning, can encode to the zone at this place, position like this, be present encoding band representative position among the figure.Then the present encoding band being real-time transmitted to display end shows.If the present encoding band is carried out predictive coding, wait until that then next encoding strip thereof ten-four encodes to the present encoding band later on again.During decoding, have only the I type band can direct decoding, other band must be decoded according to the I type of front and back band band or that decoded.So just can finish the real-time Transmission of band coding and demonstration in real time.At display end, in order to watch the up-to-date image information that transmits, normally image is done scroll process, in 33 figure, image is constantly rolled toward the left side, and the speed of rolling is consistent with transmitting speed, and can the on the left side edge of an end of image disappears, the speed that disappears also is consistent with transmitting speed, can guarantee that like this picture size that we watch can not change.

For balance code efficient, decode time and real-time this tripartite key factor, the position of the suitable I type that is provided with in band band are just very crucial, adopt uniform deployment mode usually, as an I type band is set every a band, or each two band is provided with an I type band etc.

The described technology of the embodiment of the invention can use hardware, software or combination to carry out.If carry out with software, then this technology can directly refer to comprise the computer-readable medium of program code, and this program code is carried out in the equipment that video sequence is encoded, and carries out the one or more residual coding technology among this embodiment.Under this kind situation, computer-readable medium can comprise RAM (random asccess memory), SDRAM (synchronous DRAM), ROM (read-only memory), NVRAM (non-volatile RAM), EEPROM (electricallyerasable ROM (EEROM)), FLASH (flash memory) etc.

Program coding can be stored in the memory with the form of computer-readable instruction.In this case, one or more processors can be carried out the instruction that is stored in the memory, thereby carry out one or more residual coding technology.In some cases, processor can use DSP (Digital Signal Processing) equipment to carry out, and DSP uses various hardware elements to come speech coding to handle; In other cases, encoding device can be used as one or more microprocessors, and integrated or discrete logic circuitry of other equivalence of one or more or a plurality of ASIC (application-specific integrated circuit (ASIC)), FPGA (field programmable gate array) or some or combination hardware-software are carried out.

More than disclosed only be several specific embodiment of the present invention, still, the present invention is not limited thereto, any those skilled in the art can think variation all should fall into protection scope of the present invention.

Claims (4)

1. appointed area image transfer method based on stream format is characterized in that may further comprise the steps:

Service end is encoded to the image information of appointed area in the image by stream format, and is sent to display end;

Described display end is decoded according to the image information of the appointed area that receives, and plays the image information that shows the appointed area based on stream format;

During described coding, earlier image transitions is become dot pattern, by Forecasting Methodology in the image macro block or band are encoded then;

During described decoding, decode image information according to Forecasting Methodology in the selected image;

Forecasting Methodology in the described image may further comprise the steps:

Obtain the adjacent pixel values of macro block or band periphery;

Any one carries out prediction in the image among both to use band drift angle pixel weighted sum not to be with the weighting of drift angle pixel;

Wherein, pixel weighting formula is:

$X=\underset{i=1}{\overset{n}{\mathrm{\&Sigma;}}}{M}_i{Y}_i$

Wherein, X pixel and Y _iRelevant, M _iRepresent coefficient correlation,

Coefficient correlation is expressed as:

M＝p×q

Wherein p is a distance coefficient, and promptly an energy channel the inside, the predicted position of coefficient correlation point distance accounts for the ratio of whole passage length;

Q is a proportionality coefficient, and promptly this energy channel the inside cuts apart the ratio value that accounts for whole predict pixel;

Forecasting Methodology is predicted band under the situation that comprises known one side or known two symmetrical limits in the described image, and make progress model prediction, diagonal model of horizontal pattern prediction, the downward model prediction of level, the level of band predicted;

Forecasting Methodology is predicted under the situation that comprises known one side, known two symmetrical limits, known three limits and known four limits in the described image to macro block, to horizontal pattern prediction, the downward model prediction of level, the level of macro block make progress model prediction, vertical mode prediction, vertical left model prediction, vertical-right model prediction, diagonal model prediction.

2. according to claim 1 based on the appointed area image transfer method of stream format, it is characterized in that: described service end is encoded the image information of appointed area, be sent to by stream format and also comprises before the display end: described service end is obtained needs the appointed area of transmitting in the image, described appointed area is meant at inner concrete certain position range of entire image, this zone is made of one or more bands or macro block, described band or macro block are the base unit of composing images, also are the minimum decodable code units of display.

As described in the claim 2 based on the appointed area image transfer method of stream format, it is characterized in that adopting point-to-point P2P agreement to cooperate the transmission of macro block or band.

4. according to claim 1 based on the appointed area image transfer method of stream format, it is characterized in that: real-time coding in the needs Network Transmission; Or storage and then in transmission over networks after the coding earlier; Wherein, adopt file classification file layout after the coding earlier.

Images