BANDWIDTH SCALING OF A COMPRESSED VIDEO STREAM

Abstract: A method and apparatus for bandwidth scaling of a compressed video stream are disclosed. An original previously compressed video stream image having a first level of compression including a first level of quantization is decompressed, and a set of original motion vectors for each P source picture and for each B source picture is recovered and saved. The decompressed video stream image is re-compressed re-using the most relevant saved original motion vectors in order to create a re-compressed video stream image having a second level of compression including a second level of quantization. The most relevant motion vectors point out to the camera movement and to the moving objects within the original reference frame.

Description: Description BANDWIDTH SCALING OF A COMPRESSED VIDEO STREAM FIELD OF THE INVENTION The present invention relates to multimedia signal processing, or more specifically, to bandwidth scaling of a compressed video stream. BACKGROUND ART Converting a previously compressed video bit stream to a lower bit rate through transcoding provides dynamic adjustments of the bitrate of the coded video bit stream to meet various channels solutions. The principal goal of any transcoding system is to achieve a higher level of compression than the one that the original coding system has, while consuming less processing power. The more compression means better motion estimation and more quantization. But, more quantization means less quality of the video stream, therefore the only option left seems to improve the motion estimation. However, the better motion estimation the more processing power is needed. Thus, it seems almost impossible to achieve both goals simultaneously. If one carefully analyzes the situation, one would recognize that the motion estimation is performed before DCT and quantization are done, so in the case when input and output pictures have the same spatial resolution, the original motion vectors would remain optimal if they were optimal in the first place. The problem is to make sure that all of them are 100% optimal. Usually they are not. In the prior art, one way to deal with this problem is to improve original vectors by classification and refinement. This is the technique used to classify original motion vectors according to some criteria and to make a decision which of them are good enough to be re- used subject to small refinement, and which of motion vectors are to be replaced completely. If this is the case, as discussed in the paper "Motion Vector Refinement for High-Performance Transcoding" by J. Young, Ming-Ting Sun, and Chia-Wen Lin in the IEEE Transaction on Mul timedia, Vol. 1, No. 1, March 1999, on page 30, the processing power is saved because it is used only for processing of a small subset of all motion vectors. In this paper, the optimality of an original motion vector is evaluated by performing the refinement scheme. In the refinement scheme, the optimal motion vector is obtained by refining the incoming motion vector within a small range of incoming motion vectores and by calculating how much gain it achieves in terms of MAD - mean average difference. However, this is a highly subjective step because such gain depends on amount of motion in the video source, and no specific value can be used as a natural threshold. What is needed is to perform the classification job by comparing different motion vectors between themselves. Indeed, if this is the case, if one has a set of neighboring vectors pointed to the same direction, this suggests that those motion vectors do correlate to the physical moving object that had been found by the origi- nal encoder. Therefore, these vectors can be considered optimal with a higher degree of probability than otherwise. SUMMARY OF THE INVENTION To address the shortcomings of the available art, the present invention discloses a new optimization scheme that allows to use the most relevant recovered from the original video stream original motion vectors in order to obtain in real time the optimized and most rele- vant motion vectors for the reconstructed video stream. One aspect of the present invention is directed to a method of bandwidth scaling of a compressed video stream. In one embodiment, the method comprises the main steps (A) and (B) . At step (A) , an original previously compressed video stream image having a first level of compression including a first level of quantization is decompressed. The original video stream comprises a set of original motion pictures, wherein each original video stream image comprises a set of original macro blocks further comprising a set of I source pictures, a set of P source pic- tures, and a set of B source pictures. The decompressed video stream image comprises a set of decompressed motion pictures, wherein each decompressed video stream image includes a set of decompressed macro further comprising a set of I decompressed pictures, a set of P decompressed pictures, and a set of B decompressed pictures. More specifically, the step (A) further includes the following substeps. At the first substep (Al) , a set of original motion vectors for each P source picture and each B source picture is recovered and saved. At substep (A2 ) , reconstructed original video stream is recovered. The reconstructed original video stream differs from the original video stream by an amount of information lost during an original compression process of the original video stream. The reconstructed original video stream comprising a set of reconstructed original macro blocks further comprises a set of I reconstructed source (RS) pictures, a set of P reconstructed source (RS) pictures, and a set of B reconstructed source (RS) pictures . At step (B) , the decompressed video stream image is re-compressed to create a re-compressed video stream image having a second level of compression including a second level of quantization. The re-compressed video stream image comprises a set of re-compressed mo- tion pictures. The re-compressed video stream image comprises a set of re-compressed macro blocks further comprising a set of I destination pictures, a set of P destination pictures, and a set of B destination pictures. In the preferred embodiment, the second level of compression is higher than the first level of compression, and the second level of quantization is stronger than the first level of quantization. The step (B) further comprises the following substeps . At the first substep (Bl) , the set of recovered and saved original motion vectors is processed for each P source picture and each B source picture in order to create a set of usable source motion vectors for each P destination picture and each B destination picture. At substep (B2), an interframe redundancy is removed from each P reconstructed source (RS) picture and from each B reconstructed source (RS) picture by using the set of usable source motion vectors. In each I (RS) picture the values of a set of pixels is independently provided. In each P (RS) picture, only the incremental changes in each pixel value from a preceding I (RS) picture or a preceding P (RS) picture are coded. In each B (RS) picture, a set of pixel values are coded with re- spect to both an earlier I (RS) /or P(RS) picture, and a later I (RS) /or P(RS) picture. Next, at substep (B3), the intraframe redundancy is removed by performing a 2-dimensional discrete cosine transform (DCT) on a plurality of 8x8 values a- trices to map the spatial luminance or chrominance values into the frequency domain. At the next substep (B4) , a quantization process having the second level of quantization of each DCT coefficients is performed by weighting each element of each 8x8 matrix in accordance with its chrominance or luminance type and its frequency. At substep (B5) , a run length coding for each weighted element of each 8x8 matrix is performed . The run length coding is a lossless process wherein each 8x8 matrix is represented as as an ordered list of a "DC" value, and alternating pairs of a non-zero "AC" value and a length of zero elements following the non-zero "AC" value . Finally, at substep (B6) , an entropy encoding scheme for each (RS) video stream is performed in order to further compress the representations of each DC block coefficient and each AC value-run length pairs using variable length codes. Thus, each original de-compressed video stream is re-compressed by using the set of reusable source motion vectors . In the preferred embodiment of the present invention, the set of Nl motion vectors that substan- tially points out to a camera movement within at least one P/B source picture is determined by global frame processing of the set of all saved original motion vectors for each P source picture and each B source picture. In one embodiment of the global frame process- ing, in the set Nl of motion vectors, for each pair comprising a first motion vector from the set of Nl motion vectors, and a second motion vector from the set of Nl motion vectors, a distance between the first motion vector and the second motion vector is checked whether it is less than a first predetermined value. In an alternative embodiment, in the subset Nl of motion vectors, a distance between each motion vector and the median value (or, in another embodiment, an average value) of a motion vector from the set N of motion vectors is checked whether it is less than the first predetermined value. N is an integer greater or equal to the first predetermined number : N ≥Nl≥N tΛϊreώolΛ 1 ; Nl is an integer; ^ threshold 1 i s an integer. In one embodiment, the camera movement is detected if the number Nl of motion vectors is greater than N/2. In one embodiment, the set of Nl motion vectors that substantially points out to a camera movement within at least one P/B source picture is further optimized by performing a narrow search in a narrow search area adja- cent to the reference area in the reference picture. In one embodiment, the maximum size of the narrow search area is determined by the size of 5x5 macro block area centered around the original motion vector. In an alter- native embodiment, the maximum size of the narrow search area is determined by the size of 7x7 macro block area centered around the original motion vector. In one embodiment, the set of remaining (N-Nl) motion vectors is also optimized by performing a full search in a search area adjacent to the reference area in the reference picture in order to find an optimum motion vector that points out to an optimum matching macro block in the reference picture for each macro block in the P/B source picture. The size of the full search area depends on the amount of available processing power. In the preferred embodiment of the present invention, the set of N2 motion vectors that substantially points out to at least one moving object within at least one P/B source picture is also determined. It is done by local frame processing of the set N of all saved original motion vectors for each P source picture and each B source picture. In one embodiment of the local frame process- ing, in the subset N2 motion vectors, for a pair comprising a first motion vector from the subset of N2 motion vectors, and a second motion vector from the subset of N2 motion vectors, a distance between the first motion vector and the second motion vector is checked whether it is less than a second predetermined value. N2 is an integer greater or equal to the second predetermined number N thresho i d 2 : N2 > N threshold 2 ; N threshold 2 is an integer. If this is the case, the pair of motion vectors belongs to the subset of all N moving _ object of motion vectors. By repeating this process, subset of all N moving _ object of motion vectors that substantially points out to substantially all moving objects within at least one P/B source picture is recovered. N moving _ object is an integer less or equal to N. BRIEF DESCRIPTION OF THE DRAWINGS The aforementioned advantages of the present invention as well as additional advantages thereof will be more clearly understood hereinafter as a result of a detailed description of a preferred embodiment of the invention when taken in conjunction with the following drawings . FIG. 1 depicts a bandwidth sealer of a compressed video stream that constitutes the subject matter of the present invention. FIG. 2 illustrates a typical group of pictures in the display order. FIG. 3 shows the group of pictures of FIG. 2 in the coding order . FIG. 4 depicts the MPEG macro block. FIG. 5 illustrates a slice structure in an MPEG picture . FIG. 6 shows as example of motion compensation prediction and reconstruction. FIG. 7 depicts the zigzag scanning order of DCT coefficients . FIG. 8 illustrates the decoder of FIG. 1 being implemented using as an application specific integrated circuit (ASIC) including a reconstruction module, a decoder controller, and a VLC decoder. FIG. 9 illustrates the reconstruction module of FIG. 8 in more details. FIG. 10 depicts the encoder of FIG. 1 being implemented as an application specific integrated circuit (ASIC) including the reconstruction module of FIG. 9, an encoder controller, and a VLC encoder. FIG. 11 shows the processor of FIG. 1 being implemented as an application specific integrated circuit (ASIC) . FIG. 12 depicts a full search process using a search window that allows to find the best match between a motion vector and a corresponding block. FIG. 13A illustrates a narrow search process with the maximum size of the narrow search area determined by the size of 5x5 macro block area centered around the original motion vector. FIG. 13B shows a narrow search process with the maximum size of the narrow search area determined by the size of 7x7 macro block area centered around the original motion vector. FIG. 14 illustrates how the bandwidth sealer of FIG. 1 changes quantization levels for I, P, and B pictures . FIG. 15 depicts a flowchart of the method of bandwidth scaling of a compressed video stream of the present invention. FIG. 16 is a flowchart that illustrates in further details the step of re-compressing the decompressed video stream image. FIG. 17 depicts a flowchart that shows in more details the step of further processing the set of saved original motion vectors for each P source picture and each B source picture. FIG. 18 illustrates the flow chart of the Narrow Search that is performed to optimize the set of re- covered original motion vectors. FIG. 19 is a flow chart of the step of global processing of original saved motion vectors shown in further details. FIG. 20 illustrates a flowchart of the full search performed to optimize the set of recovered motion vectors. FIG. 21 illustrates the flowchart of the proprietary algorithm for the local frame processing of the received set N2 of motion vectors, whereas each motion vector from this set substantially points out to at least one moving object. FIG. 22 is a flow chart of the method of the present invention for re-compressing the de-compressed original video stream, wherein the differences between the quantization level for each pair comprising a I source picture and a corresponding I destination picture; and for each pair comprising a P source picture and a corresponding P destination picture is reduced as com- pared with the difference between the second and first quantization levels. BEST MODE FOR CARRYING OUT THE INVENTION Reference will now be made in detail to the preferred embodiments of the invention, examples of which are illustrated in the accompanying drawings. While the invention will be described in conjunction with the preferred embodiments, it will be understood that they are not intended to limit the invention to these embodiments. On the contrary, the invention is intended to cover alternatives, modifications and equivalents that may be included within the spirit and scope of the invention as defined by the appended claims. Furthermore, in the fol- lowing detailed description of the present invention, numerous specific details are set forth in order to provide a thorough understanding of the present invention. However, it will be obvious to one of ordinary skill in the art that the present invention may be practiced with- out these specific details. In other instances, well known methods, procedures, components, and circuits have not been described in detail as not to unnecessarily obscure aspects of the present invention. FIG. 1 depicts a bandwidth sealer 10 of an originally compressed video stream 12 that constitutes the subject matter of the present invention. In the preferred embodiment, the bandwidth sealer 10 further comprises a decoder 18 and an encoder 20. The decoder 18 is configured to decompress an original previously com- pressed video stream image 12 having a first level of compression including a first level of quantization. In one embodiment, the original video stream image 12 (a source image) has been previously compressed using one of the Motion Picture Experts Group (MPEG) standards, including MPEG -1 or MPEG-2 ( for higher bit rate applications) ; MPEG-4 (for very low bit rate applications) ; H.261 (developed for more aggressive applications operating at pxβ4 kbits/s for p =1 , . . . , 30); or H.263 (developed for video coding for low bitrate communications) . The following discussion can be found in "MPEG video compression standard" by Joan L. Mitchell, William B. Pennebaker, Chad. E. Fogg, and Didier J. LeGall, published by Kluwer Academic Publishers Group in 1996. The material found in "MPEG video compression standard" and deemed to be helpful in explanation of the present invention is incorporated herein by reference. The outermost layer of an MPEG video bitstream is the video sequence layer that is self-contained and independent from other video (and audio) bitstreams. FIG. 2 depicts a typical group of pictures in display order. Each video sequence 50 is divided into one or more groups of pictures, and each group of pictures is composed of one or more pictures of three different types, I-(intra- coded pictures) 52, P- (predictive -coded pictures) 56, and B- (bidirectionally predictive -coded pictures) 54. I-pictures are coded independently, entirely without reference to other pictures. P- and B-pictures are compressed by coding the difference between the picture and reference I-or P-pictures thus using similarities from one picture to the next . A single P-picture may obtain predictions from temporally preceding I- or P-pictures in the sequence, or different regions of a single P-picture may use different predictions from preceding pictures or use no predictions. A single B-picture may obtain predictions from the nearest preceding and /or upcoming I-or P- pictures in the sequence, or different regions of a sin- gle B-picture may use different predictions from preceding pictures, upcoming pictures, both, or neither. The region of the P- or B- picture that does not use predictions is coded by intra techniques only. In a closed group of pictures P- and B-pictures are predicted only from other pictures in the same group, whereas in an open group of pictures, P- and B-picture are predicted from pictures in the same open group, or from the pictures outside the open group of pictures. LO CO t to μ 1 μ 1 LΠ o LΠ o cπ o LΠ tr tr Φ 3 Pi 3 3 TJ T 0 Si rt Ml SD rt Ω Ω Ω SD TJ 3 K Φ O μ- 3 P. SD rt O rt tn J SD < δ μ- O O Hi Hi tr μ- ø if Hi if SD Φ O Hi Hi ø μ- 0 tr 0 Φ rt tn rt rt Φ 0 rt Hi Hi Φ φ Φ H tn P. φ Φ £ 0 Φ ø tr Mi tr Φ SD Ω ø s; rt TJ Si tn Si ro ro H > Hi Ω ii μ- T μ- μ- Pi Ω SD Hi Φ w Φ SD P. if iQ Φ Ω SD Hi Φ μ- < Φ 0 1 0 μ- Φ μ- φ Pi rt P. Φ Pi tn μ- < 0 μ- o μ- 1 iQ rt α μ- tr Ω Φ TJ F • 0 0 ø SD ø ø Ω Pi ø H $ Φ Hi μ- P. 0 Ω i tr Hi ø < ø if Ω ro 0 rt tn φ TJ Ω rt ø φ SD Ω SD ii Mi rr rt *<! μ- ii Hi φ φ Φ ι-3 3 3 μ- SD μ- Ω Φ < Ω μ- ϋ rt 0 to 0 0 Φ 3 SD tf μ- rt Φ Pi Mi SD Hi SD < Mi 0 Ω 0 3 Φ O ø Φ tr Ω Pi tn Ω 0 P. SD O rt Hi rt 0 Φ Ω o ø Φ 0 SD Pi rt 3 φ Ω 3 iQ Φ Φ 0 φ 3 rt ft φ TJ rt ø tr SD rt SD tr tr Hi Hi Hi 0 Mi H Hi Ω 0 TJ ø rt TJ $ tn Hi μ- μ- μ- rt Hi H φ rt if rt *< ro ^ Φ 0 CD β Φ *< Ω <! ii Φ rt O Φ 0 if 0 S φ rt 0 0 Φ o SD μ- Ml Φ ro Φ o α H ii Hi P i if tr 0 Φ φ ø tn Hi ø rt Φ 0 μ- P. rt rt 0 ø Hi Ω Hi tn Ό - P. tn Si Hi Ω SD φ Hi SD ro Φ Si μ- Hi Ω tn tn tn if ø rt rt * Φ 3 Φ Φ rt Ω £ 0 ro ι-3 rt ^ μ- rt μ- iQ SD rt Φ SD SD SD Φ TJ tr Mi Φ P. SD φ μ- tn o * H3 Φ tr Ω μ- μ- Ω SD ϋ Ω tn t Ω O rt ii SD rt Hi rt ø o ø 0 tn ø tn tn Hi Φ • < SD TJ rt o ø Ω <! Ω μ- Ω SD Ω ^ ii Φ μ- Φ 0 μ- if rt rt ii rt P. rt μ- tr rt Hi Φ 0 μ- H fi rr o Φ SD ro Ω j 0 SD tn tn 3 o Pi O TJ Φ • tr 5 1 O μ- ø W μ- Φ Φ ø rt Ω SD Hi φ Φ 0 ø o 0 Hi TJ φ ø tn ø μ- μ- φ ø SD 3 ( Q ø Hi ø μ- rt Ω ro Hi Hi ^ rr 3 if O Si SD TJ ø * Ω Ω Hi j tn SD o rr 3 SD O tiμ- μ- N ø rt Mi Hi tr tn TJ SD rt rr Hi rr O O TJ r Φ 0 * Ω £ tr o rr rr g ro O cn Hi SD Hi μ- SD ϋ μ- m Φ Hi m if μ- Φ >-3 ^ Hi ii ø Ω Φ 3 tr tn Φ 0 μ- if 0 Si tr rt Φ ø rt SD Ω μ- SD ro TJ μ- SD Ω ,- ^ if 0 ii Φ ii 0 0 0 0 Φ rt 3 Si μ- iQ H- 3 μ- 3 Ω Hi tn tn Φ ( Q μ- 0 Φ Φ Pi Φ 0 ro rt TJ S P. rt ø SD $ SD 0 Φ o μ- o Φ φ TJ 0 ro tn ro Hi t ra Hi Hi tn μ- tn cn ø μ- Hi if Φ « 3 tn μ- μ- rr Ω ø to rr 0 ø P. μ- < Ω Hi μ- 3 O TJ Ω • rt o 0 ro μ- Ω 0 0 rt ø μ- o if Ω rt Φ Φ SD O ro Φ tn ii o TJ o H O rr Hi o ø Pi Ω O Mi <-3 rt 3 * φ O Hi μ- SD Φ o tn P. ø ϋ μ- T Φ ø Φ rt 0 μ- Hd ø Pi μ- tr P. tr μ- 0 Pi 0 ii tn tr fi SD 3 SD < SD H μ- Hi i 0 H Ω φ Ω Ω Φ 3 Φ 0 rt ii ro ii TJ Φ μ- μ- μ- 0 H 1 ro rt μ- •> 0 0 μ- 0 Ω ti ¬ ii 0 rt SD Hi 0 0 μ- Φ tr μ- H SD φ Hi Ω 0 0 IQ 0 tn • μ- • rog tn 0 Hi ø ro 3 μ- Hi rt 3 o tn ø SD SD ro SD iQ rt o P. rt *i SD SD ø 0 S iQ SD Pi tn TJ 0 Φ SD μ- 0 < ø TJ rt TJ . 0 Hi Hi Φ μ- Ω φ Hi < SD 0 en * Φ ø SD to 0 rt φ φ Ω rt μ- o μ- tn SD μ- TJ Ω ϋ < μ- μ- φ Hi <! Si TJ O ø 0 H- Ω Ω Ω O tr O 3 Ω Φ rt Hi rt Φ O tn SD Ml ro rt TJ Ω Pi Φ tn μ- ø tn 0 T 0 rt 0 rt P. Φ ø ro s; rt tr ii M 1 ø 3 rt 0 Hi tn ø * μ- rt Hi Hi if Ω H SD SD Mi SD 0 0 0 3 μ- ii φ μ- rt Φ SD 3 Pi TJ >• rt φ Φ X O rt Φ 0 rt Pi rt ø Hi Mi H T rt ø tn μ- Mi O if 3 φ SD SD Hi φ Hi O μ- Ω $ ø μ- ϋ rt rt tn φ 0 iQ φ tn 0 ø Φ α ro . — . ø φ Mi tQ M tn to Ω O tn ϋ Hi o if rt Φ 0 I- 1 Ω Ω rt rt 0 ro ■ g φ rt — • SD 0 Φ 0 0 tn φ 0 0 * Ω μ- tn rt P. ■ 9 ø Si Hi ϋ H3 Ω SD Φ Hi tn ø 0 O SD SD M 1 tn SD 0 Mi Φ rr ø SD ø' μ- Φ o rt φ Hi μ- o Ω μ- ii 0 rt tn μ- M T 3 ii O rr Φ Mi rr o Ω o Hi Pi i * μ- Ml • tn Hi ø φ P. SD Hi tn o Hi tn φ rt 3 ii rt μ- Mi Ω o O 3 Hi o μ- φ ø ii ø 0 ø Φ S Φ Mi if SD tn if 0 SD φ Φ μ- Hi Φ φ ø ϋ H fi rt 0 SD rt H rt rt tr Pi Ω X ø fi rt φ Φ Ω Φ 0 Hi H 3 Hi SD Hi tn iQ rt Φ ϋ 3 Ω tr M 1 if tr SD rt SD tn rt μ- if ii Hi P. Φ ro TJ Ml Φ Φ SD Ω SD rr Φ Φ Φ Ω if μ- Φ tr Ω φ φ tr 0 Φ Φ SD ø SD Hi 0 tn 0 ø SD 0 rt μ- TJ o O TJ P. Φ rt 0 μ- tn 0 >-3 Ω O ii SD μ- Ω o Ω ii Ω if <! Φ Φ 3 tn 3 Hi ø μ- Pi Ω rt tr Ω Ω ø' tr Φ tr <! rf 3 Φ rt o Hi O ro μ- ø H SD SD SD μ- • φ Hi O φ Φ w Hi O Φ φ w Φ φ Ω φ μ- Pi o φ Pi rt Ω Ω 3 Hi N 0 SD ø Ω rt 0 μ- P. μ- rt Si 0 Si -> tn I μ- ^ μ- TJ * o 0 ii Φ P. 0 D Hi 3 0 TJ Hi Ω tr Φ TJ 0 rr rt 0 SD μ- Hi ø tn SD ø 0 P. ii 0 0 ι-3 o Φ rt P. μ- Φ μ- H ii ( Q O Φ <J rt H iQ Φ iQ rt iQ μ- rt ro Hi H rr if o φ Ω SD tn ø 0 Hi Φ ii 0 SD rt Φ •< ø tr Hi 0 O SD Φ 0 Pi 1 3 iQ μ- 1 Hi 0 -—« SD rt O fi rt SD Hi σ μ- 1 Ml tn *< I- 1 μ- H rr rt I O The quantized DCT coefficients are coded losslessly, such that the decoder can reconstruct precisely the same values. For MPEG, an approximately optimal coding technique based on Huffman coding was used to generate the tables of variable length codes needed for this task. Variable length codes are needed to achieve good coding efficiency, as very short codes should be used for the highly probable events. The coefficients are arranged according to 1-D sequence known as the zigzag scanning order as depicted in FIG. 7. The zigzag scan approximately orders the coefficients in ascending spatial frequency. Since visually-weighted quantization strongly de-emphasizes higher spatial frequencies, only a few lower-frequency coefficients are nonzero in a typical transformation. The more zero coefficients, the better the compression. The DCT is used to code both non-intra and intra picture information, but properties are quite different in the two coding environments. Different quantization tables are used for non-intra compression, and the rounding is done differently. The MPEG is a highly asymmetric system. Indeed, the decoder follows the directions encoded in the bitstream, and is a relatively simple. An encoder, on the other hand, is much more complex than the decoder and should have more intelligence. For instance, the encoder should identify areas in motion, determine optimal motion vectors, control bitrate, control data buffering to prevent the underflow or overflow from happening, determine when to change quantization, and to vary all these parameters dynamically so as to maximize quality for a given bit rate. Referring still to FIG.l, the present invention is focused on bandwidth scaling of an originally com- pressed video stream by decompressing, recovering, processing and reusing the most relevant motion vectors, and further recompressing the reconstructed video stream. LO LO t to μ* LΠ o LΠ o LΠ o LΠ SD TJ Mi Ω φ CD Si TJ P. 01 tn Ω o o SD J TJ TJ < P. μ- ii P. SD 01 μ- SD SD J TJ Ω 0 μ- ø O SD ii Φ SD o ro rt rt O Hi Hi ii ii Hi μ- ø ø Φ Φ 0 φ ø ø Hi O P. Ω Hi 3 to Ω μ- Ω H 01 o ϋ Hi 0 μ- μ- 01 Φ φ CD P. Hi SD Ω Ω P. rt Ω P. 01 μ- SD rr rt TJ 3 if ø O φ φ o ø ø 01 iQ | Q φ 01 01 01 φ μ- 0 O Φ 01 μ- T SD ø tr ii iQ P. fi Ω Ω rt μ- μ- rr 01 tn 01 O ø ø Pi Mi O 0 SD rt φ ø Hi H ro μ- Hi »ϋ Φ J ro ti ¬ ti ¬ H ø ø Φ Φ φ iQ < tn Φ O Hi P. tn φ μ- tn Φ Hi tn Φ SD ii Hi Ω ii ro ro ø SD SD O Pi Si P. tn μ- rt ii M φ 01 O Pi tn ro tn μ- Ω tn 0 o 0 P. Pi Ω Hi rt SD Pi Hi O tn φ Hi SD CD rt Ω ø 0 o P. H iQ M μ 1 ti ¬ 3 < Hi ø Φ ø SD φ Hi rt SD 01 o iQ <! ø CO H TJ CO tn 01 ro 3 < ω TJ SD μ- Φ o Ω SD μ- SD H tn tr o SD 3 φ ii tn SD 0 H o o P. SD μ- μ- Ω Pi SD 0 ti ¬ tn Ω | Q H O Φ o SD H Hi TJ SD Hi Ω SD TJ 3 rt o 0 ø ø Ω P. fi Ω ϋ Φ 3 ϋ tn ro O tr μ- tr 0 Hi 01 rt < 0 tn ii μ- Φ < φ Φ Hi ii ii 01 Hi Φ φ rt o O μ- rt Pi ø O Φ 01 rjd Φ μ- tn ø μ- ϋ H 0 Ω Ω 0 O o Ω ø . — . | Q Hi μ- rjd SD o rt b 0 O φ O rr tn Φ Q TJ ø Hi ω j 0 Φ φ ø O ii tr 01 ø μ- Φ < ø Ω if Hi Ml rt 0 Hi H- rt μ- ( Q o *< H H Φ ii tr tn 3 Φ H rt O ø SD μ- Ω 01 ; Φ tn Ω rr CD φ 0 ø SD Ω Hi 0 Ω . — . -— ^ Ω μ 1 rt TJ 01 o Hi rt SD 3 p. O 3 O φ O if O Ω Mi iQ o rt SD 3 CD SD • Φ iϋ iϋ ro o ii Hi -- Ω φ μ> CD 0 0 O to J 0 Hi φ Hi CD 0 Hi ii ø tn Pi s O O Ω Φ Φ π SD 03 > o i ii rt to ϋ Hi μ- 9 0 H SD Φ Hi tn Φ CD r • — - — . — . W SD 01 SD 01 3 tr Ω to Φ Ω μ- Φ Ω TJ | Q o O tr tn ii Ω Φ CD rt Ω P. 0 iϋ 01 3 01 o o 01 01 Φ O Ω Hi CD μ- μ- ii H O rt Hi tn Φ 0 rt tr 0 μ- i J TJ O Φ tn Hi μ- g 3 tr rt 0 O φ Ω ø μ- μ- Si Hi Φ ro Ω ø SD φ rt S tn μ- μ- μ- -" Mi to P. CD 0 3 p J • ii SD TJ 0 Hi J rr SD | Q IQ μ- ø Ω rt O tn 0 0 μ- μ- 3 Ω Ω 0 en rt Hi SD • — ' Hi Φ μ- < Mi Hi μ- ø H μ- μ- rr 3 Ω o ø i Hi Hi ø rt μ- ro rt rt TJ H rt IQ • Φ SD SD tr Ω Φ μ- Φ Ω ii ø ø φ rt ø 0 tn Hi O iQ if ø ø ø μ- rt Ω TJ O if φ 01 0 Hi rt 3 rt Ω | Q P. rr Φ 3 SD SD ø Φ tn ø Hi 0 μ TJ rt Hi Hi Ω if O μ- Hi Φ 01 O ø rt ø 0 tn SD rt fi rt Hi Ω o Hi μ j rt SD M» Φ Φ rt Φ Ω ii to Ω ii O Hi φ H ø ti ¬ Hi μ- o tr ro O 01 01 ø ϋ TJ rr g μ- SD t Hi Ω Hi rθ en o O 3 en ?T φ H Φ H Φ Hi < 3 tn ø Ω ro iQ Φ 01 3 Hi • ^ Hi Hi ø Ω Hi ø o • 01 Si 01 SD O μ- o rt O Ω ii rr fi φ H- μ- TJ ro ro Ω μ- Hi Pi 0 Ω φ 0 rt to o . P. rt if ø rt ro Φ SD 0 ø tn ro ø rr SD 01 O tn Φ ro 3 O TJ ø tr ι - H Mi rt Pi tn tr Φ μ- φ Hi Φ Ω Si 0 Ω SD iQ ti ¬ Ω ti- 0 3 Φ tn Ω TJ 3 tn Hi rt SD 0 O O μ- Φ o 0 Ω Si o Hi if ro μ- ro Φ Si TJ 01 • o ϋ TJ TJ O rt Ω Hi 3 rt o 0 O Φ ø O μ- Hi TJ Hi p. SD ii 3 μ- Hi Φ Ω O O O Hi φ Ω tn Hi tn tn ii ( Q tjd 3 0 tn μ- J SD μ- SD >-3 TJ 01 μ- Ω CD Hi Pi 0 0 Φ CD ø O Ϊ rr TJ μ- ,— , o rt μ- μ- o 0 Ω 0 ii tn tn if ii μ- 01 μ- 03 μ- Hi Φ SD Ω rt Hi tn ii μ- iQ n ø Hi iQ ø tn rt Ω o SD tn Φ 01 CD μ- 01 Φ ro ø Φ Hi 01 μ- Mi μ- Ω O - Φ Ω μ- co ii ø μ- SD o μ- rt Hi μ- 01 Φ rt 0 Φ tn iQ 01 μ- ø Mi | Q Φ if < Hd Ml SD rr ø Ω Ω ø μ j ø o μ- H ø Φ rt ( Q rt Hi tn Ω 0 Hi φ ø H φ rt ø 3 ø SD ro ti ¬ SD Hi ø 0 rt iQ 0 O φ ro SD SD SD Hi O Hi ii tr Hd Hi tr 01 Hi ii μ* J ro H <S Ω ø tr rt O Mi SD O Ω p. Hi tn Φ O Φ o rt μ- φ μ- . — . Si μ- φ <! tn μ- ϋ SD Ml Hi O 01 tn rt 3 i Si tn SD 0 if iϋ 3 01 < Ω 3 Pi CD 01 CD μ- Hd 01 0 TJ Φ Φ rt rt ^ tr SD Ml μ- O 0 P. ii Φ SD • μ- rr CO tn SD Φ TJ Ω 01 iQ ø rjd Φ Hi 01 μ- φ rt Hi rt 3 0 ϋ φ Ω Hi iQ P. ø -— - 0 Ω 0 μ- rt ,—. TJ μ- Φ < Hi rt ro rt Ω μ- 0 O CD H Ω Φ Φ Φ Hi ø Ω 0 > Hi iQ ø Φ ϋ φ Ω Hi rt O O rt 0 O 3 ø Ω rt O Ω 01 O Φ TJ ii O tn rt ii 0 ø Φ ø Φ Ω O o ø ø Hi Hi tr Hi ø iQ rt Φ O P. TJ o μ> tn μ- Ω rt ø tn •— ' iQ CD Hi rt Ω O Hi ø Ω Hi Φ μ- rr Φ ^ CD μ- 3 t s; tn Ω φ tr ii ii Hi Si SD μ- O 0 01 rt CD H Si iQ if ø TJ tn ii Ω TJ SD rt rt H 1 Φ CD Hi Hi SD O ø 1 H rt Φ 01 φ . μ- o φ Φ rt μ- SD rt ii Ω 01 Hi ø . — . 0 SD 0 φ 3 01 0 1 ii Pi Si Ω φ ø 01 ii r Ω < 1 ø μ- O Φ Hi W Ω 3 ii Ω 0 TJ Hi ø • ro O Ω SD rt o SD ro rt φ CO Hi 01 3 ro SD ro CO w SD o Hi ø Φ Ω SD Ω 3 o ii ti ¬ 0 Φ μ- 1 ' — ' X 3 tn tn 0 < rt rr ii rt 1 ti ¬ 0 O 1 1 3 μ- ro Hi SD 01 ø I P. 1 if 1 if ro Si 3 1 ( Q ro ^ IQ μ 1 Φ Φ fi i 1 SD to In another embodiment of the present invention, the decoder 18 of FIG. 1 is implemented using an application specific integrated circuit (ASIC) 120 as depicted in FIG. 8. The reconstruction module 130 is the central block of the decoder, as well as an encoder (see discussion below) . The motion displacement and DCT data are decoded in the VLC decoder 124. FIG. 9 illustrates the reconstruction module 130 that is used by both encoders and decoders in more details. The reconstruction module 130 includes a dequantizer unit 148, a DC Pred. unit 146 configured to reconstruct the DC coefficient in intra- coded macro blocks, and an IDCT unit 144 for calculating the inverse DCT. The prediction signal 143 is calculated from the data in the picture store & prediction calcula- tion unit 142 including the forward motion vectors 141 and backward motion vectors 143. The prediction signal 145 is also compensated for forward and backward motion displacements. The IDCT output signal 145 is combined with the prediction signal 143 to form the reconstruction signal 147 (or the reconstructed signal 26 of FIG. 1) . Thus the decoder 18 of FIG. 1 implemented as the decoder 120 of FIG. 8, generates the reconstructed original video signal 26 and also recovers and stores the original motion vectors. Referring still to FIG. 1, the encoder block 20 utilizes the reconstructed original signal 26 and the set of recovered and stored original motion vectors to generate the re-compressed video stream 16 having a second level of compression including a second level of quantization. In the preferred embodiment, the second level of compression is higher than the first level of compression, and the second level of quantization is stronger than the first level of quantization. The re-compressed video stream image 16 comprises a set of re-compressed motion pictures comprising a set of re-compressed macro blocks. The set of re-compressed macro blocks further comprises a set of I destination pictures, a set of P destination pictures, and a set of B destination pictures . In one embodiment of the present invention, the encoder 20 of FIG. 1 is implemented using a general pur- pose computer loaded with a specifically designed software program. By executing the steps of this program, the decoder 20 performs the following functions: (Bl) processing the set of recovered and saved original motion vectors for each P source picture and each B source picture in order to create a set of usable source motion vectors for each P destination picture and each B destination picture; (B2) removing an interframe redundancy from each P (RS) picture and from each B (RS) picture by using the set of usable source motion vectors, wherein the values of a set of pixels in each I (RS) picture is independently provided, and wherein in each P (RS) picture, only the incremental changes in each pixel value from a preceding I (RS) picture or a preceding P (RS) picture are coded, and wherein in each B (RS) picture, a set of pixel values are coded with respect to both an earlier I (RS)/or P(RS) picture, and a later I (RS) /or P(RS) picture; (B3) removing intraframe redundancy by performing a 2-dimensional discrete cosine transform (DCT) on a plurality of 8x8 values matrices to map the spatial luminance or chrominance values into the frequency domain; (B4) performing a quantization process having the second level of quantization of each DCT coefficients by weighting each element of each 8x8 matrix in accordance with its chrominance or luminance type and its frequency; (B5) performing a run length coding for each weighted element of each 8x8 matrix without information loss as an ordered list of a "DC" value, and alternating pairs of a non-zero "AC" value and a length of zero elements following the non-zero "AC" value; wherein each element of one matrix is presented as if the matrix is read in a zigzag manner; and LO LO to to μ 1 μ 1 Lπ o o o Lπ φ TJ tn TJ tr φ tr rt TJ φ H TJ rt ø Hi tr Φ rt φ o Hi rt μ 1 μ- rr rt <! 03 ■ g φ ■ 8 TJ α φ 0 O ø Hi SD 0 μ- if 01 ii ø 0 SD Hi O tr CO ø μ- tr SD Φ io φ SD ii Φ SD Ω Hi O Ω O rr Hi CD Ω X CD μ- 0 0 Ω Hi Ω Si i CD O Φ H i 0 CO 3 0 Hi rt ι-3 Ml Ω 0 — - if CD Ω tr φ CD ø 3 Ω O Φ tr CD μ- μ- ^ 0 0 rt — - CD rt o Ω μ- — O I Si ^ - Φ SD tr iQ X i . Hi φ 03 ø ø H Φ φ SD 0 μ- Hi SD Hi ro O SD P. TJ Ω tn ro Φ d SD ro Ω Ω Ω 01 ø 1 rr <! , — . rt 1S1 3 o 3 LO ii Hi ø SD μ- μ- tr o rr SD LO Hi rt Ω rt TJ Ω Hi μ- μ- ω SD Si 0 μ- to ø X μ- Ω if Ω O Si O tr 0 0 Φ O 0 O P. en 0 rt SD 0 H ø t Hd Φ 01 iQ ro H ø CD if to CD 0 Si P. μ Ω P. 0 0 ro — Hi μ- 3 ø SD ( Q Ω o ,-— . SD Φ H Ω o 01 Ω i Hi CD CD o μ- φ 03 O 0 SD 3 O H d Hi rt Hd -—- Φ t tn Hd O H rt Hi tn tn • Mi Hi H H J Φ ø ■ g μ- μ- TJ SD 0 Hi 0 CO < iύ SD t CD 0 Ml 0 μ- ro tn Hi μ- 0 φ O tn Φ SD SD ø ø Hi 0 — μ- O SD CO Ω rt . — . Ml 0 ø SD O CD rt rt H Ω μ 1 0 Mi rt Hi Ω o 0 SD ø to μ- ii O φ Ml iϋ — if o d μ- ϋ O SD ti ¬ ø Ω tr if 0 CO SD IQ Mi tr Hi rt ø H 1 | Q rr 0 TJ Hi CO ø Ml O CO | Q rt 0 rt ro Hi O ro ro μ- 0 rt Φ ro 0 μ- SD Ω SD i ø - Φ μ- TJ -— ro TJ H Hi — - ø if Φ μ- Ω < rt ø o 0 tr SD SD M CO φ IS! 0 Φ μ- Hi CD Ω H μ- μ- rt ii Φ o SD ro CD TJ Hi tr tiMl rt Ω 3 3 x SD SD Si μ- 3 φ ii Φ rt X J Mi Ω .. — tr ø J Φ Hi Φ ø Hi Hi O μ- ro if TJ tr μ- CO Ω rt O rt φ Si H 0 ,—» φ μ- Hi rt !=d ro tn μ- Si H 01 J CD o 03 IQ ^ Φ SD μ- μ- SD ø tr ii ^ ø μ- tr Hi iύ Ω 0 ø Co SD Ω μ- tr TJ φ μ- i Ω H H ϋ μ- Ό ø iQ 3 o tn rt ø O Φ CO rt 3 Hi — Pi tr rt rr ø o μ- rt Ω Φ o ro SD Ω Hi Ω SD α ø Ω o μ- O Ω i • <! ø CD ro ø O Ω Pi Ω rt SD 01 ^ 3 tiφ 01 O SD rt Ω ■ B if Mi O μ- \ SD Hi SD ^ TJ Ω CD Hi μ- rt O ø 0 01 μ- 1 ro tr ii ø ii ^3 TJ SD ii ø Hi 0 3 O Φ μ- o Φ Hi 0 3 ø Hi Hi i o ø o P. μ 1 * 0 Si μ- Hi 0 O CO SD Φ Si φ Hi ø TJ o Ω i tn Φ Pi φ ϋ CD Hi iQ p. o 01 o ro CD X Ω o rt 3 x 3 CD ø φ SD ii 0 rt ro O SD 3 Φ ø CD 0 03 μ- Ω μ- Si μ- Ω H 0 O Ω μ- μ- CO O 01 rr _J 01 Hi Φ ø Hi ø 0 O 01 rt 01 SD SD tr tr 3 μ- 01 μ- ø I rt μ- Φ Φ N ø i < . — . Φ Ω *< Hi Hi ϋ < SD SD 0 <! D Hi 3 iQ rt ii ø Hi 01 SD SD <! μ- Φ rt O π SD φ Φ μ* Ω Φ rt O 0 tr i φ o o Ω μ- ro Ω O O Hi tn rt ø SD 0 Hi ø 1 if Hi CO ϋ Ω P i rr CO CD Hi tr ϋ Si Ω Ω rt ø μ- 3 0 < O TJ SD μ- Ω M Ω μ- CD — ' φ o μ- if SD • ii SD Φ φ φ I I •* μ- J ft SD Φ Mi *< Ω Ω tr 0 φ 0 ii ø rt Si ø CD ii 3 o 0 rt ro SD o tn rt Hi Hi 0 Ω μ- SD 0 φ Φ rt μ- tr TJ Ω φ IQ Φ O 3 μ- tr SD tn Ω ϋ to • rt Φ o μ- Hi Hi Φ 0 φ < < tn rt ii ø ro H- 0 i μ- >-3 rt μ- ø Φ Ω O tr μ- CO tr , — . 3 Hi SD μ- rt 0 Hi ø μ- tr SD Φ SD rt Ω P. H ø H- tr μ- φ ø tiif ø | Q > ro > φ tr Ω tr Ω Si rt ø H 3 Hi Hi TJ rt φ Ω 0 ro o SD tiro TJ Hi Hj μ- Ω rt CO ø ( μ- ro O SD tn iQ 0 0 SD Ω Hi SD ii rr ø Pi -— .. ii Pi ø Ω ro Hi Hi ω Ω ø O ro H rt if φ ro ii Si 0 Ω Φ O SD Hi CD ii H V ro Φ < if Hi Hi Φ Φ 03 SD 0 Hi ø Ω Φ ro ø μ- Ω tr rt IV 01 Hi 01 3 ii 01 Φ 3 0 CO 3 TJ SD <! Ml Hi 01 Pi O Hi μ- Ω Pi H rt Ω tr ø Φ μ- μ- φ SD ro μ- ro Φ CD ω Hi SD Φ ro 3 0 μ- ii o TJ Φ O iQ Φ LO μ- Ω ø 3 ø rt Φ ø ø 0 Ω SD — . 3 ø 01 o Hi 3 | Q 03 Pi μ» 0 ϋ 0 SD 3 $ if*. ø φ φ Hi φ rt SD ø" SD TJ rt Pi CD rt . 3 Φ rt rt rt Ω o ø rt Φ en 01 Φ IQ ø tn μ- Φ 01 rt tn φ 0 Ω μ- SD Φ 01 o iti φ μ- μ- Φ rt ii ii o μ- 01 rt Si Hi Ω rt μ- ro Ω 0 rt 9 1 Hi μ- P. ii if Ω ø H CO Hi μ- ø O μ- φ ø Φ tr ro tr if ( Q Ω 0 rt Hi ø φ ø φ rt rr O 01 — Hi Φ 0 SD ø J O Si rt SD iQ rjd ø CD 01 Φ tr 0 0 rt 0 SD 0 Or < SD 01 0 Ω H Hi φ P. < rt μ- J ø tr 00 01 tiΩ SD 01 3 μ- rt ø Hi tr 0 P. ø CD TJ Hi tr •<! 01 T ϋ 0 Φ μ- <! Ω rt ro SD o Ω Φ rt μ- P. μ- Φ 3 01 SD 0 0 h- 1 φ -*—-. Φ SD SD SD μ- ø 0 SD Ω ø 0 φ rt < O ^ — , P. ø nSi if rt 03 ø IQ SD Mi 0 P. rt !=d ø J <! Ω ø Pi rt ø Ω 0 CD ro o ro ts φ if Hi iQ 0 Ml TJ O Ω SD μ- tirt to O iQ Hi tn CD rt P. SD μ- rt Hi Ω TJ ø Hi TJ SD < tn > ro o Ω Φ Hi Hi Hi 0 O ro Hi ro 0 CD Si ø SD 0 O TJ O φ rt H Ω μ- TJ φ . Ω Hi tr Φ < Φ φ r 3 Ω ø ii rt 01 < rt Hi 0 Ω ø μ- ii O O o ^ Ω TJ ø Hi Hi SD Φ Si 1 tr tr - O TJ SD μ- μ- Φ Ω •< Ω tn μ- Hi Ω Pi H tiH rt ro φ o Ω H Φ •< H μ- μ- Pi O ø 1 ø tn Φ ro Ω ro μ- μ- TJ SD 3 tr rt Ω ø Φ Hi tr rt Hi 03 Hi P. Ω 0 ii Ω μ- O rt if 1 P. if O 03 r I Hi 0 CD ro Hi ø ro t 1 nance or luminance type and its frequency. Quantization process is also used to control and to change the bitrate of the re-computed video stream 16. Please, see discussion below. In the preferred embodiment, the encoder 20 also includes a run length coding block 36 configured to represent without information loss each weighted element of each 8x8 matrix as an ordered list of a "DC" value, alternating pairs of a non-zero "AC" value, and a length of zero elements following the non-zero "AC" value. Each element of one matrix is presented as if the matrix is read in a zigzag manner. In this embodiment, the encoder 20 also includes an entropy encoding block 38 configured to perform an entropy encoding scheme for each (RS) video stream in order to further compress the representations of each DC block coefficient and each AC value-run length pairs using variable length codes . The resulting re- compressed video stream 16 is re-compressed using the set of reusable source motion vectors that is a subset of the set of original motion vectors recovered and saved in the block 22. See discussion below. In one embodiment, the above mentioned blocks (28-38) of the encoder 20 of FIG. 1 can be realized by designing an ASIC having the MPEG encoder structure 160, as shown in FIG. 10. More specifically, MPEG encoder 160 includes the reconstruction block 130 (shown in more detail in FIG. 9) that is used to reconstruct the pictures needed for prediction. MPEG encoder 160 also includes a controller 162, a forward DCT 166, a quantizer unit 168, a VLC encoder 164, and a motion estimator 170. The controller 162 provides synchronization and control functions. The quantized forward DCT is computed in the FDCT 166 and Q 168 modules. The forward and backward motion estimation is carried out in the motion estimator block 170. The coding of the motion vectors and DCT data is performed in the VLC encoder 164. As was explained above, motion compensation is a standard part of MPEG protocol, whereas motion estimation is not. Motion compensation refers to the use of motion displacements in the coding and decoding of the sequence. Motion estimation refers to the determination of the motion displacements . In the encoder the difference between source picture and prediction is coded. In the decoder the difference between source picture and prediction is decoded and added to the prediction to get the decoded output. Both encoder and decoder use the same motion displacements in determining where to obtain the prediction. However, the encoder estimates the displacements before encoding them in the bitstream, whereas the decoder just decodes the encoded in the bitstream dis- placements. Motion estimation techniques primarily includes block matching techniques where a single motion vector is applied to a block of pels. When determining the optimal motion displacement of the prediction, a full search over every possible motion displacement, or motion vectors produces the best possible value, if the computational resources are available. The search algorithms are also very important . The present invention discloses the proprietary algorithms for performing the full search and the narrow search of the most relevant motion vectors. They include the motion vectors that substantially point out to the camera movements and to the moving objects (see full discussion below) . This allows one to significantly opti- mize the performance of the bandwidth sealer 14 of FIG. 1 of the present invention using the same amount of processing power as the prior art bandwidth sealer. In one embodiment of the present invention, the processor 28 ( of FIG. 1) is implemented using a general purpose computer loaded with a specifically designed software program. By executing the steps of this program the processor 28 performs the following functions: (Bl, 1) analyzing the set of N saved original motion vectors for one P source picture, or for one B source picture; N being an integer; (Bl, 2) if in a set of Nl of motion vectors, for each pair comprising a first motion vector from the set of Nl motion vectors, and a second motion vector from the set of Nl motion vectors, a distance between the first motion vector and the second motion vector is less than a first predetermined value, keeping the set of Nl motion vectors for further global frame processing; and disregarding a set of remaining (N-Nl) motion vectors; wherein the set of Nl motion vectors substantially points out to a camera movement within at least one P/B source picture; Nl being an integer greater or equal to the first prede- termined number t - hre ^^ 1 : N >N1> N tbreshol ^ ' ; Nl being an integer; N^^^^^ being an integer; (Bl, 3) if in a subset of N2 motion vectors, wherein the subset of N2 motion vectors corresponds to a group of adjacent macro blocks comprising a set of N2 macro blocks, for each pair comprising a first motion vector from the subset of N2 motion vectors, and a second motion vector from the subset of N2 motion vectors, a distance between the first motion vector and the second motion vector is less than a second predetermined value, keeping the set of N2 motion vectors for further local frame processing; and disregarding a set of remaining (N-N2) motion vectors; wherein the set of N2 motion vectors substantially points out to at least one moving object within at least one P/B source picture; N2 being an inte- ger greater or equal to the second predetermined number N threshold 2 = N2 > N threshold 2 ; N threshold 2 being an integer; and (Bl, 4) repeating the step (Bl, 3) to recover in the set of N motion vectors a subset of N moving _ object of motion vectors that substantially points out to substantially all moving objects within at least one P/B source picture; N moving _ object is an integer less or equal to N. LO LO t to H- 1 H LΠ O LΠ o LΠ o cπ rt < <! SD rt μ 1 μ» 3 3 < Hi rt Ml TJ to a μ- μ- SD rt 0 SD rt TJ 3 rt Q CD tr Φ ro rt if 00 CO o 0 Ω 00 Φ μ- O 0 μ- to ø ø TJ tr tr ø tr Hi Φ 0 H rt φ Ω Ω SD CO to < rr S CO Ω | Q Hi Ω O Ω TJ ro (_I. fi ro O 0 O SD rt rt rt φ μ- § rt ø IQ rt rt Hi M Hd H- 1 CD TJ rt Hi tr Hi H O o Φ rt Hi 3 O <^ Hi O ii tr ø Ml μ- ø H μ- J Ω rt ii . Φ SD •<; ι-3 ii Hi SD tn tr ø φ ø -— 0 Hi Φ 0 Φ ii O | Q P. Ω Ω Hi rt o o μ- 1 μ> ι-3 tn tn 03 ø SD ii ø Hi 01 Si tr ϋ CD ϋ μ- φ . SD 0 01 Ω ro ø tn rt tr r rt rt < tr <τ • SD • ø tn rt Ω • Hi SD rr O tn Hi CD tr μ- 01 0° Φ if rt μ- CD SD μ 1 μ- Φ Φ μ SD 0 CD h SD 00 SD tn O rt μ- Φ 3 Ω o Φ O " ø a SD SD o m 1 Hi SD ϋ CO 01 ø SD tn ii H μ- rt Ω ii H Ω H Ω 0 • ø tn H ø Ml rt rr 3 Ω K • — - φ 03 Φ 0 0 rt O I 0 Si 0 μ- tr 3 0 0 01 ii tr tr Φ tr ro .. Pi Φ rt ø μ- tr Hi μ- μ- TJ ø 01 O SD H tn Hi φ SD 03 ro CD H H hd μ- tn ø O μ- tn ø 0 tn Hi P. rt hd rt 0 0 TJ SD 3 CD TJ SD φ 0 φ \ SD Φ Ω 0 ø CO Ω 0 Hi 0 Φ if SD μ- SD φ to 0 rt CD SD 0 3 ii H μ- 0 Ω rd Si H Φ rt en Φ Φ Ω tn Φ ø tn O rt Ω CO o tr Hi ti ¬ δ O IQ ø ti ¬ 0 SD tr 0 iQ φ O ø • t μ- rt φ TJ Ω er rt Ω O rt ro tn • rt P Φ rt SD Ω Pi Φ SD tn SD TJ μ- ø N μ- Hi -— ^ tr Hi tr CD μ- ro Hi rt if Si O O φ 9 rt 0 φ Hi tn ii ø Hi < Φ 01 μ- 0 ro 3 0 ii O 01 μ- tr φ ø TJ 03 Q' ø 03 § ■ Pi Ω Φ ti ¬ Ω Φ Hi Ω Hi Hi 0 Ω SD ø 01 rt Φ Hi Hi 0 01 O Φ 01 Hi 0 SD μ- 1 Ml ro CD Ω Φ rt CD H tr μ- tj' Hi ii Ω μ- Φ rt Pi SD ø μ- rt Si SD O Φ IQ rt » 3 μ- H Φ μ- 03 IQ SD < ø 3 03 o 0 Φ ø -> tr μ- tn tr IQ if μ- 03 tr Hi CD TJ O 00 tx ø H s 0 01 0 ø CD ( Q ti ¬ 3 rr Φ Φ 3 rr tn ø Φ 3 tn φ SD Hi M μ- Hi ^ O ti ¬ Ω tr ø μ- Hi Pi Ω o ro μ TJ 01 Ω φ rr Hi Φ Φ rt CD . Ω tn P. ro o 0 μ- rt 0 Hi j o rt μ- rt Hrl ø O SD CD Ω ø rt i rt Ω μ- iQ P. < IQ rt O rt -S if Ω O μ- rr ø 0 Si SD rt O d ø tn O 3 H μ 1 μ- Φ t * rt Hi μ- rr ^ — ^ μ- ro rt ø rt Hi Φ rt 3 - O Hi Hi CD Hi SD 0 φ SD ~~— 3 Ω 0 § tr tn tr rjd ø ø rr tr tn μ- rt φ Hi SD H CD < Hi ø ti ¬ φ rt rt ro μ- CD iQ 03 ϋ Φ rt rt d SD O h rt S2J 3 tr - Φ μ- rr ro μ- ø O μ- 0 Hi N - ro Φ rt tr N H SD tr Hi μ 1 φ O Si iQ - ϋ 03 rt Hi Hi 01 CD CD J Ω rt . 0 01 <"3 Φ ϋd μ- Φ Φ P. SD ø 01 μ- ti ¬ H 1 Si Hi to Hi Φ tr Pi s 3 3 rd μ- 0 SD Hi rr Ω μ- o N rt ro SD CD — μ- a SD rr ii Ω tn φ o Ω SD o Hi 3 Pi 0 Φ if μ- Ml Hi ro tr TJ ti ¬ μ- 01 rt j Φ o J ø < μ- rt O φ P. Si Φ ii J Φ Si ro ro ø Φ Si Φ o if Ω O 03 O 0 O rt φ o ø μ- Ω ø Ω μ> rt -— . Si 0 μ- Hi Hi Φ SD Hi tr tr Hi μ- μ- 3 tr μ- O Φ rt Hi tn rt TJ ø ffi tr SD μ- TJ ω o rt 01 μ- 3 0 SD Ω ø Hi φ SD ø ø 03 ~ O rr O Hi μ- 3 Φ ti ¬ ø Hi rt Hi Ω SD 0 03 Φ 3 r-> H Φ rt ø H ( Q 01 ii O O rt ro ro φ - O Pi μ- H 1 Hi Φ ii μ 1 P. 01 rt < O rt Hi SD Ω ø TJ P. 0 01 CD ,- . ø 0 μ- rt SD 4d TJ rr ^ φ Hi tr Φ Φ 0 Φ .. — . ti ¬ ϋ H φ LO rt Hi < tn μ- IQ 3 j ϋ μ- o if S Hi 3 Ω Φ SD P. SD 01 > ro Φ rt Pi 0 — tr φ ro 3 μ- O 3 o Φ SD Ω ø Φ 0 SD 1 rt μ» Ω 01 CO Si tn O CD rt ro rt ø 03 TJ ø Hi o rt 03 3 rt rt rt 3 3 O 00 TJ tr tr o H Φ Hi i 0 rt H SD < μ- rt φ ø tn μ- φ μ 1 Hi to Hi ■ <! N ϋ Ω 0 0 rt μ- μ- Ω μ- rt Φ H 3 ro 0 Hi rt Φ 0 s — ' tn 0 rjd Φ • — ' 01 rt if rt 0 cn 81 Hi O if 3 3 0 Hd Φ O rt 0 Ω Ω rt μ- CD O < Ω 3 CD ø φ Φ 3 ro Hd Hi * Hi 3 SD O Φ 03 tr rt co SD ø μ- φ Φ Ω ø o 3 ø <! ■-a O SD o < o O ø ø 01 O Φ tr H 01 iQ ø 3 ii 0 o ϋ O Hi TJ ti ¬ rt o rt φ Ml Ω Hi Φ Ω rt Si Mi 01 0 Φ Ω < O (ϋ rt tn SD < O ii ro μ- rt Ω •— - φ Ω Ω φ μ- μ- O ii tr 01 SD φ <! Ω μ- CD CD Hi O ϋ O μ- rt 01 SD S rt 01 O Ω IQ Hi „ Ω 03 to tr 0 ø μ- O O tn 3 Hi TJ 0 0 μ- 0 tr tn 3 h 1 O 01 ø 0 0 Φ 0 φ 00 o rt ø < ø O ft Hi SD 0 rt Hi μ> O Φ Hi 0 0 Hi t Ω rt g! μ- ( Q CD rt < SD tr μ- 01 if 01 o ii Hi 01 Hi 1 Φ 00 O Hi Hi tr Φ 0 ro 1 μ- Ω SD Si O ø O ro 1 ϋ ø I Hi M Whether for each pair comprising a first motion vector from the set of Nl motion vectors and a second motion vector from the set of Nl motion vectors, a distance between the first motion vector and the second motion vector is less than a first predetermined value ^ t reshold 1 ' Nl i s an integer greater or equal to the first predetermined number ^ thxβώol. a : N > Nl > N threshold 1 ; N^^^ 1 is an integer. Referring still to FIG. 11, in the preferred embodiment of the present invention, the Global Frame Processor 182 further includes: a Global Narrow Search (GNS) block 190 configured to optimize the set of Nl motion vectors stored in the CMMV block 186 that substantially points out to the camera movement within at least one P/B source picture by performing a narrow search in a narrow search area adjacent to the reference area in the reference picture. In the preferred embodiment of the present invention, the Global Narrow Search includes the follow- ing steps: (A) identifying a set of macro blocks corresponding to the set of Nl motion vectors in the P/B source picture; (B) identifying a reference area in a reference picture corresponding to one macro block in the P/B source picture; (C) identifying the maximum size of the narrow search area . In one embodiment, as shown in FIG.13A, the maximum size of the narrow search area 232 is determined by the size of 5x5 macro block area centered around the original motion vector 234. In an alternative embodiment, as depicted ion FIG. 13B, the maximum size of the narrow search area 242 is determined by the size of 7x7 macro block area centered around the original motion vector 244. In the preferred embodiment of the present invention, the Global Frame Processor 182 further includes: a Global Full Search (GFS) block 192 configured to optimize the set of remaining (N-Nl) motion vectors by performing a full search in a search area adjacent to the reference area in the reference picture in order to find an optimum motion vector that points out to an optimum matching macro block in the reference picture for each macro block in the P/B source picture. FIG. 12 depicts a full search process using a search window 220 that allows to find the best match between a motion vector 218 and a corresponding block 216. The size of the full search area depends on the amount of available processing power. Referring still to FIG. 11, in the preferred embodiment of the present invention, the Processor 28 further includes a Local Frame Processor 180 configured to locally process a set of N2 motion vectors corresponding to a group of adjacent macro blocks comprising a set of N2 macro blocks. The Local Frame Processor 180 fur- ther includes a Second Threshold Test (STT) block 194 that is used to select the set of N2 motion vectors that substantially points out to at least one moving object within at least one P/B source picture. The STT block 194 includes the following test condition: Whether for each pair comprising a first motion vector from the set of N2 motion vectors and a second motion vector from the set of N2 motion vectors, a distance between the first motion vector and the second motion vector is less than a second predetermined value; N2 is an integer greater or equal to the second predetermined number N threshold 2 : N2 > N threshold 2 ; N threshold 2 is an integer. The Local Frame Processor 180 further includes the Moving Objects Motion Vectors (MOMV) block 200 that stores the set of N2 motion vectors including a set of substantially all N moving _ ob;ject; motion vectors, whereas the set of N moving _ object of motion vectors includes each motion vector that substantially points out to at least one oving object within at least one P/B source picture. N mov i n g_o b je ct i s an integer less or equal to N. In the preferred embodiment of the present invention, the Local Frame Processor 180 further includes a Local Narrow Search (LNS) block 198 configured to optimize stored in block MOMV 200 set of N moving _ object of motion vectors that substantially points out to substantially all moving objects within at least one P/B source picture by performing a narrow search in a narrow search area adjacent to the reference area in the reference picture. In the preferred embodiment of the present invention, Local Narrow Search (LNS) includes the following steps: (A) identifying a set of macro blocks corresponding to the set of N moving _ ob:ject motion vectors in the P/B source picture; (B) identifying for each original macro block in the P/B source picture a reference area in a reference picture that corresponding to the macro block; (C) identifying the maximum size of the narrow search area. In one embodiment, as shown in FIG.13A, the maximum size of the narrow search area 232 is determined by the size of 5x5 macro block area centered around the original motion vector 234. In an alternative embodiment, as depicted ion FIG. 13B, the maximum size of the narrow search area 242 is determined by the size of 7x7 macro block area centered around the original motion vector 244. In an alternative embodiment, the Local Frame Processor 180 further includes a Local Full Search (LFS) block 196 configured to optimize stored in block MOMV 200 set of N moving _ object of motion vectors that substantially points out to substantially all moving objects within at least one P/B source picture by performing a full search (as shown in FIG. 12) in a search area adjacent to the reference area in the reference picture. The size of the full search area depends on the amount of available processing power. In the preferred embodiment of the present invention, Local Full Search (LFS) includes the following steps : (A) identifying a set of macro blocks corresponding to the set of N moving _ object motion vectors in the P/B source picture; (B) identifying a reference area in the reference picture that corresponds to each macro block in the P/B source picture. In the preferred embodiment of the present invention, the Local Frame Processor 180 (of FIG. 11) includes a programmable chip including the following algorithm: (A) starting with an arbitrary motion vector belonging to the set of N of motion vectors; wherein the arbitrary motion vector corresponds to at least one macro block α; (B) comparing the K motion vector with a motion vector 2 belonging to a set of 8 neighboring motion vectors; wherein each neighboring motion vector 1 corre- sponds to at least one macro block β adjacent to the macro block α; (C) if a distance between the arbitrary motion vector K and at least one neighboring motion vector 2 is less than the second predetermined value, marking each motion vector 2 as a motion vector 1 belonging to a set ^moving object ' (D) replacing the arbitrary motion vector with one motion vector 1 belonging to the set N moving object ; (E) repeating the steps (B-D) until the set N moving obect stops growing. As depicted in FIG. 14, in one embodiment of the present invention, the bandwidth sealer 254 further includes a subprocessor 253 configured to reduce the differences of the quantization level for each pair of P source picture 268, 294 /corresponding P destination picture 312, 260 at a first predetermined amount. In one embodiment of the present invention, this is done by using the Q-block 168 of the encoder 160 (that is a part of the bandwidth sealer 254 of FIG. 14) as shown in FIG. 10. In one embodiment, the quantizer Q-block 168 comprises a maximum-a posteriori (MAP) quantizer for transcoding (not shown) that specifies the reduced quantization level for each pair of P source picture/corresponding P destination picture. In one embodiment of the present invention, as shown in FIG. 14, the bandwidth sealer 254 further includes a subprocessor 255 configured to reduce the differences of the quantization level for each pair of I source picture 258/ corresponding I destination picture 296 at a second predetermined amount. In one embodiment of the present invention, the quantizer Q-block 168 of the encoder 160 does this job. In one embodiment, the quantizer Q-block 168 comprises a MAP quantizer for transcoding (not shown) that sets the reduced quantization level for each pair of I source picture / corresponding I destination picture. To preserve the second compression level, in one embodiment of the present invention, as shown in FIG. 14, the bandwidth sealer 254 further includes a subprocessor 257 configured to increase the quantization level for each destination B picture 304, 306, 320, and 322 at a third predetermined amount to compensate for the reduction in the quantization level for each pair of I source picture/ corresponding I destination picture, and for each pair of P source picture/corresponding P picture. In one embodiment of the present invention, the quantizer Q-block 168 of the encoder 160 further comprises a MAP quantizer for transcoding (not shown) that sets the increased quantization level for each destina- LO LO t to I- 1 μ 1 LΠ O LΠ O LΠ o LΠ d 03 TJ O Ω TJ P. r <J 03 CD rt TJ TJ μ» rt TJ 03 μ 1 Hi rt μ- TJ Hi Si TJ rt TJ hd Ω β rt H Φ μ- ii O 0 Hi μ- O CD ro H O SD SD LO tr SD rt it O ø ■ g rt CD Φ Hi if μ- ■ § O 0 μ- Ω <T Ω μ- 3 Hi Φ Hi Hi Ω SD tr Hi ii > Φ Hi Hi ^^ Hi H SD 0 P i 03 μ- φ Ω SD 03 ii SD O rt IQ TJ μ- 03 CD • rt Hi O Hi rt rt (^ Φ ø Φ 0 ii ø rt 03 rt ø O Hi 0 0 O ø μ- ii | Q 03 Ω o Ω Si μ- rjd J ϋ Ω SD rt 03 r O SD Ω μ- μ- Hi 0 rt ø Φ rt μ 1 Mi M ø μ- μ- CD tiHi tr μ- ø O O "-— ' Hi ti0 tr μ- Hi CD ø ø μ- ii μ- Hi 03 μ- rd CD • SD tn ø P. ro 3 fi Hi Hi Φ ro P. ro Ω N μ- 03 SD IQ Hi CD tsi Ω TJ N 03 μ- SD P. μ- . — . CD SD 03 μ- Si O SD 03 rt rt tn SD φ O SD TJ ø μ> < 03 SD ø SD rt rr Hi Φ rr rt o 3 rt O •< rt μ- rt rr SD rt 0 rr μ- j 03 to 3 IQ μ- rr 03 rt tr tr O ø if < tr ii TJ μ- 0 tr O tr ø μ- TJ Pi μ- Ω tr 0 LΠ SD <! Pi 0 ! TJ ^ 3 Φ φ ø rt μ- ro μ- H ii o ϋ o ro ø ro TJ Si o Ml μ- μ- O rt Φ 0 CO Ω SD μ- ro p ro 03 o 0 SD Pi IQ Ml φ ø Ω Hi ii ø tr Ω ø ø ø H - Hi ϋ o (1- O ii tr μ- Hi 3 Ω ϋ μ- CD rt μ- 03 Φ TJ TJ hd CD rt φ rt IQ Hi Pi Ω O 03 φ if rt Hi o Hi Φ O SD 0 J o SD ø rt 03 3 H μ- P. if μ ø Φ Φ ro SD φ o tn φ if 0 g! <1 3 rt <! ii Hi SD if φ ro J 0 0 Ω 03 Φ ro φ Hi ii H CD Ω tr rt rt ro M 0 rt tn μ- φ tr Φ Φ 03 IQ μ 1 ro Pi < μ- rt TJ rt 0 rt < CD Φ <! rt O J 03 tn M 3 ti 3 tr ø ø H φ ø fi rt CD ro Ω μ- SD ø 0 Φ Ω φ Si *^ P. CD O 3 μ- CD o O rt CD CD ro μ- ro μ- IQ SD rt Φ Hi rt fi SD h- 1 rt O Q Hi ii o " ø Ω φ J Ω rt Ω Mi Hi SD rr SD P. ø ( i rt O μ- tiro μ- rt ø ø SD CD Ω 3 Hi Ω O 03 Ω Hi rt π Φ 3 if 03 ro SD 0 3 Hi O ro SD tr Ω Hi Mi Hi rt ro μ- ii Hi rt ii rt Hi O φ 0 0 01 0 SD 0 TJ rt Hd tr tr 0 μ- ø ii 3 μ- o Mi rt 0 Φ < μ- ø ro o μ- Hi μ- O 3 03 Hi Ml ϋ 3 P. ro O H μ- 1 l_l. < | Q •> 3 rt 3 ro tr Hi 03 Φ 0 tr TJ Φ tn ii O ro ø Hi TJ tn Φ H+i μ- SD Ω Ω 01 φ φ φ μ- μ- t ii J ϋ φ Ω ø *< μ- Pi TJ 0 tn SD Φ φ 03 hd 0 IQ Ω 03 o rr Hi Ω 3 ø SD ø LΠ SD ii φ SD Ω (ϊ Ω 0 Φ J rt φ ø P. Hi μ- o Hi μ- Φ 3 f-r φ SD φ en tiCD 0 03 O O o rt rr SD ø SD O O μ- SD 03 to 03 rt ø 3 03 O ø ø o ø H 0 P. ro 03 Ω φ TJ 3 Hi Hi if ø 3 Pi Ω Hi ø O Ω SD <! en O tr SD J tr tr Hi P. to o rt 3 rt SD — . 03 ro Ω μ TJ tn CD H o μ- tr P. ø tr tiμ- *=. ø φ μ j ϋ o SD ø μ- O 3 Hi Ω o CD o ø Hi CD Φ 0 ø ft μ- ro P. *. Hi ii μ- g ø rt SD IQ o rt 3 o Hi Hi Ml Mi Si tr 0 Hi φ o Hi 03 ø iQ TJ tr ø TJ TJ Φ Ω 3 03 0 ϋ tr SD tr ø μ- o rt O μ- 0 CD Si SD 03 Hi Hi CD SD rt SD ro iQ μ- SD Mi O to Φ Ω SD φ ro 3 Hi O rt μ- 3 rt h Hi <! rt I- 1 03 μ- O Ω 0 ^. H μ- Ω μ- 0 en o Ω w μ- μ- 0 o Ω < ø μ- 0 Φ H μ- s; β μ- Φ IQ ii O P. ii Si hd rt Hi Hi tn en TJ M Hi ø P. TJ ii ø o φ O ø 03 Hi Ω rt P. ro 0 rr Si μ- 03 0 SD P. μ- 0 rt μ- J O SD rt Hi ro 0 3 Ω <! ø Φ μ- • tr ro ro SD ø Si rt 0 CD Ω Hi TJ Hi o fl- Hi Ω Hi hd tr ro Si TJ rt φ < SD SD ro 0 ø 0 SD SD Ω if i 03 o Mi μ- ro Mi tr φ t rt μ- tr 03 H tn 01 0 o Ω <! Φ Hi ^ μ» rt o rt SD TJ CD rt 3 ro Ω Φ SD o ø tn φ Ω 03 CD ø rt rt ii rr φ Ω Ω ii*. Hi 03 rt μ- Hi 0 Hi Hi μ- TJ Hi rt H 3 to ii Φ o rt Ω 0 μ- tr μ- • O Ω rt tr μ- - — - ro rt tr N (T *< 03 CD Ω 0 ø Hi ro ø SD Hi «• Φ 01 Ω SD rt rt ro 0 H rt O ø 1 ii ro SD Si if CD Pi O Hi SD μ- ø Hi 0 03 φ μ- 01 Pf O H SD ( Q H 01 O Hi *— μ- Ω Φ rr φ Φ 0 Si ro Hi rt 03 Ω Φ P. 0 Pi 3 to SD tn Hi LΠ μ- μ- tr 0 0 — H SD o 03 O SD 0 μ- tn 03 tiii Φ μ- μ- ro . 0 ø SD o t . • ø 0 ii TJ tn . — . 03 ø M 3 ϋ O rt Hi Φ tr ro ro SD O ø tn Hi Hi Ω iQ o en 01 O IQ < CD μ- 0 SD - rt Φ tr TJ μ- ø μ- μ- Si ^ Hi tn Ω ø iQ O Ω rt Φ - CO φ Hi CD iQ s; 0 μ- if 03 μ- ii t iQ 0 ii 3 TJ tr 0 Hi CD μ- rr j μ- f-3 O ø 3 μ- φ m SD SD tr ro iQ φ cπ μ- H SD 01 Hi ii μ- 0 TJ rr Mi O Ω SD if iQ if Mi rt 0 ø H SD 0 rt 0 rr tn to ø ro rt rr 0 φ ø ø TJ μ- if ro TJ ø O tn to O φ μ- ro μ- rt SD - μ- 1 TJ Si ^ & tn SD μ- ii 1 CD Pi SD Ω Φ rt SD μ- 3 so Hi ø SD o μ- rt φ μ- 0 o SD φ ^ — . H CD 0 0 fi μ- μ- rt tr Ω Ω μ- J 03 il^ 03 SD ø O SD φ ii μ- tn p. tn Si o μ> ø SD 03 ø ii ø H ro tr rt ø ii tr ^ μ) φ Ω ø 3 ii Hi 01 μ- μ- Mi tr • μ- SD IQ ii ø μ- 0 rt O μ- 0 Ml 0 0 ø 0 3 Ω Hi μ- TJ TJ ø 3 Ω CD tn TJ Hi rt 03 g SD tn 3 3 03 < rt 0 SD Hi ø O CD O CD hd rt μ- iQ 0 Hd O o SD ro if φ 0 O O O 1 CD μ- 1 rt 3 O rt h ø 3 Ω H ii Ω 0 0 3 tr ø μ- ^ Φ tn fi ø Hi rt Ω 0 - μ- φ rr H rt 1 o Ω SD 1 Hi SD ø 1 ^ Hi Hi μ- Hi μ- 1 ø <! P. Ω ø tiSD rt Ω SD ø SD Ω O Φ 03 O ro Φ O φ ø Hi 1 Hi set of decompressed motion pictures comprising a set of decompressed macro blocks. The set of decompressed macro blocks further comprises a set of I decompressed pictures, a set of P decompressed pictures, and a set of B decompressed pictures (not shown) . In one embodiment, the method of the bandwidth scaling of the present invention is illustrated by flowchart 340 of FIG. 15 comprising the following main steps: step 342 of decompressing an original previously compressed video stream image having a first level of compression including a first level of quantization, and step 344 of re-compressing the decompressed video stream image to create a re-compressed video stream image having a second level of compression including a second level of quantization. In the preferred embodiment of the present invention, the second level of compression is higher than the first level of compression, and the second level of quantization is stronger than the first level of quantization. The re-compressed video stream image com- prises a set of re-compressed motion pictures comprising a set of re-compressed macro blocks. The set of re-compressed macro blocks further comprises a set of I destination pictures 296, a set of P destination pictures 312, 260, and a set of B destination pictures 304, 306, 320, 322, as shown in FIG. 14. In one embodiment of the present invention, as shown in FIG. 15, the step 342 of decompressing the original compressed video stream further comprises the following steps: step 346 of recovering and saving a set of original motion vectors for each P source picture and each B source picture; and step 348 of recovering a reconstructed original video stream. The reconstructed original video stream comprises a set of reconstructed original macro blocks further comprising a set of I re- constructed source (RS) pictures, a set of P reconstructed source (RS) pictures, and a set of B reconstructed source (RS) pictures. Each recovered original motion vector substantially points out to at least one macro block in the original video stream. However, the reconstructed original video stream differs from the original video stream by an amount of information lost during an original compression process of the original video stream. Therefore, the recovered motion vectors from the original video stream should be optimized to substantially point out to the marco blocks in the reconstructed original video stream. In one embodiment of the present invention, as depicted in FIG. 16, the step 344 (of FIG. 15) of re- compressing the decompressed video stream image to create the re-compressed video stream image further com- prises the following steps. Step 364 is the step of processing the set of recovered and saved original motion vectors for each P source picture and each B source picture in order to create a set of usable source motion vectors for each P destination picture and each B desti- nation picture. This step is crucial because some of the recovered motion vectors should be re-used in the present invention in order to save the processing power. At the next step 366 an interframe redundancy from each P (RS) picture and from each B (RS) picture is removed by using the set of usable source motion vectors, and at the step 368 the intraframe redundancy is removed by performing a 2-dimensional discrete cosine transform (DCT) on a plurality of 8x8 values matrices to map the spatial luminance or chrominance values into the frequency domain. At step 370 a quantization process having the second level of quantization of each DCT coefficients is performed by weighting each element of each 8x8 matrix in accordance with its chrominance or luminance type and its frequency. At step 372 a run length coding is performed for each weighted element of each 8x8 matrix without information loss as an ordered list of a "DC" value, and alternating pairs of a non-zero "AC" value and a length of zero elements following the non-zero "AC" value. Each element of this matrix is presented as if the matrix is read in a zigzag manner. Finally, at step 374, an entropy encoding scheme for each (RS) video stream is performed in order to further com- press the representations of each DC block coefficient and each AC value-run length pairs using variable length codes. Thus, each original de-compressed video stream is re-compressed by using the set of reusable source motion vectors . In one embodiment of the present invention, FIG. 17 illustrates the step 364 (of FIG. 16) of processing the set of saved original motion vectors for each P source picture and each B source picture in more details. At first (step 384) , the set of N saved original motion vectors is analyzed for one P source picture, or for one B source picture. If in a set of N of motion vectors, for each pair comprising a first motion vector from the subset of Nl motion vectors, and a second motion vector from the subset of Nl motion vectors, a distance between the first motion vector and the second motion vector is less than a first predetermined value, that is, the Test con- • dition I (386) is satisfied, then the flow chart follows the logical arrow (400) . If this is the case, the next step is the step 388: the subset of Nl motion vectors is kept for further global frame processing; and the set of remaining (N-Nl) motion vectors is disregarded. The set of Nl motion vectors is used for further processing because each vector from this set substantially points out to a camera movement within at least one P/B source pic- ture. Herein, Nl is an integer greater or equal to the first predetermined number ; Nl is an integer; N th -.^^ 1 is an integer. If, on the other hand, in a subset of N2 motion vectors, wherein the subset of N2 motion vectors corre- sponds to a group of adjacent macro blocks comprising a set of N2 macro blocks, for each pair comprising a first motion vector from the subset of N2 motion vectors, and a second motion vector from the subset of N2 motion vec- tors, a distance between the first motion vector and the second motion vector is less than a second predetermined value, that is, the Test condition II (390) is satisfied, then the flow chart follows the logical arrow (404) . If this is the case, the next step 392 is the step of keeping the set of N2 motion vectors for further local frame processing, whereas the set of remaining (N-N2) motion vectors is disregarded. The set of N2 motion vectors is kept for further processing because each vector in this set substantially points out to at least one moving object within at least one P/B source picture. Herein, N2 is an integer greater or equal to the second predetermined number N threshold 2 : N2> N threΞhold 2 ; N threshold 2 is an integer. The step 392 is preferably repeated to recover all N moving _ object of motion vectors that substantially points out to substantially all moving objects within at least one P/B source picture. Herein, N moving _ object is an integer less or equal to N. In one embodiment, the step 388 (of FIG. 17) further includes the step of setting the distance between the first motion vector and the second motion vector to be less than 2 pixels by each coordinate. In another embodiment, the step 388 (of FIG. 17) further includes the step of setting the distance between the first motion vector and the second motion vector to be less than 10% of the first motion vector value by each coordinate. Yet, in one more embodiment, the step 388 (of FIG. 17) further includes the step of setting the distance between the first motion vector and the second motion vector to be less than 10% of the second motion vector value by each coordinate. In one embodiment of the present invention, the step 388 of FIG. 17 further includes the step of performing a narrow search to optimize the set of Nl motion vectors substantially pointing out to the camera movement within at least one P/B source picture. In one embodiment, the narrow search (as shown in FIG. 18) further includes the following steps. After the set of macro blocks corresponding to the set of Nl motion vectors in the P/B source picture is identified (step 424) , for each macro block in the picture, one original motion vector from the set of Nl motion vectors is used ( step 426) to identify a reference area in a reference picture corresponding to that macro block. At the next step (428), a narrow search is performed in a narrow search area adjacent to the reference area in the reference picture in order to find an optimum motion vector that points out to an optimum matching macro block in the reference picture. Steps 426-428 are preferably repeated for each macro block in the P/B source picture. In one embodiment, the maximum size of the narrow search area is determined by the size of 5x5 macro block area centered around the original motion vector. In another embodiment, the maximum size of the narrow search area is determined by the size of 7x7 macro block area centered around the original motion vector. In one embodiment of the present invention, as shown in FIG. 19, the step 388 (of FIG. 17) of global processing further comprises the following steps. After a first set of Nl motion vectors is selected from the set of all saved motion vectors N (step 464) , in one embodiment, an average value of a motion vector from the set N of motion vectors is calculated (step 466) . In this embodiment, if in the subset Nl of motion vectors, a distance between each motion vector and the average calculated value is less than the first predetermined value, that is the Test condition III is satisfied (468) , the flow chart follows the logical arrow 478. If this is the case, the set of Nl motion vectors is kept for further global frame processing (step 470) because each vector in the set of Nl motion vectors substantially points out to the camera movement within at least one P/B source picture. The steps 466 and 470 are preferably repeated and, in one embodiment, the camera movement is detected if the number Nl of motion vectors is greater than N/2. In an alternative embodiment of the present invention, as shown in FIG. 19, the step 388 (of FIG. 17) of global processing further comprises the following steps. After a first set of Nl motion vectors is selected from the set of all saved motion vectors N (step 464) , a median value of a motion vector from the set N of motion vectors is calculated (step 466) . In this embodiment, if in the subset Nl of motion vectors, a distance between each motion vector and the median value is less than the first predetermined value, that is the Test condition IV is satisfied (472), the flow chart follows the logical arrow 482. If this is the case, the set of Nl motion vectors is kept for further global frame processing (step 474) because each vector in the set of Nl motion vectors substantially points out to the camera movement within at least one P/B source picture. The steps 470 and 474 are preferably repeated, so that, in one embodiment, the camera movement is detected if the number Nl of motion vectors is greater than N/2. In one embodiment, as shown in FIG. 20, the global processing further includes the full search to optimize the set of remaining (N-Nl) motion vectors. In one embodiment, the full search further including the following steps . After the set of macro blocks corre- sponding to the set of (N-Nl) motion vectors in the P/B source picture is identified (step 502) , for each macro block in the picture, one motion vector from the set of (N-Nl) motion vectors is used (step 504) to identify a reference area in a reference picture that corresponding to the macro block. After that, the full search is performed ( step 506) in a search area adjacent to the reference area in the reference picture to find an optimum motion vector that points out to an optimum matching macro block in the reference picture. Steps 504-506 are preferably repeated for each macro block in the P/B source picture. The size of the full search area depends on the amount of available processing power. In one embodiment of the present invention, the narrow search process, as described above, is performed to optimize the set of N moving _ ob;ject of motion vectors that substantially points out to substantially all moving objects within at least one P/B source picture. In another embodiment of the present invention, the full search, as described above, is performed to optimize the set of N moving _ object of motion vectors that substantially points out to substantially all moving objects within at least one P/B source picture. In one embodiment of the present invention, the local frame processing of the received set N2 of motion vectors that substantially point out to at least one moving objects further includes the following proprietary algorithm, as depicted in FIG. 21. Step 524: (A) starting with an arbitrary motion vector belonging to the set of N of motion vectors; wherein the arbitrary motion vector N corresponds to at least one macro block α; Step 526: (B) comparing the N motion vector with a motion vector 2 belonging to a set of 8 neighboring motion vectors; wherein each neighboring motion vector 2 corresponds to at least one macro block β adjacent to the macro block α; Step 528: (C) if a distance between the arbitrary motion vector N and at least one neighboring motion vector 2 is less than the second predetermined value, marking each motion vector 2 as a motion vector f be- longing to a set N moving object ; Step 530: (D) replacing the arbitrary motion vector K with one motion vector 1 belonging to the set N moving object ' and Step 532 : (E) preferably repeating the steps (526- 530 ) until the set N moving object stops growing . One more aspect of the present invention, as depicted in FIG. 22, is directed to the method of re- compressing the de-compressed original video stream, wherein the differences of the quantization level for each pair comprising a I source picture and a corresponding I destination picture; and for each pair comprising a P source picture and a corresponding P destination picture is reduced as compared with the difference between the second and first quantization levels Δ in order to reduce the propagation of errors caused by reusing a plurality of motion vectors originally used for a plurality of source pictures compressed at the first quantization level for a plurality of destination pictures compressed at the second quantization level. More specifically, FIG. 22 is a flowchart 540 having the following steps. Step 544 is the step of reducing the differences of the quantization level for each pair of a P source picture / corresponding P destination picture at a first predetermined amount, whereas step 546 is the step of reducing the differences of the quantization level for each pair of an I source picture/corresponding I destination picture at a second predetermined amount. Finally, step 548 is the step of increasing the quantization level for each destination B picture at a third predetermined amount to compensate for the reduction in the quantization level for each pair of an I source picture / corresponding I destination picture, and for each pair of an P source picture/corresponding P picture in order to preserve the second compression level. The second compression levels should be preserved if the user would like to have the re-compressed video stream to be delivered to his terminal within a reasonable time frame in real time. The foregoing description of specific embodiments of the present invention have been presented for purposes of illustration and description. They are not intended to be exhaustive or to limit the invention to the precise forms disclosed, and obviously many modifications and variations are possible in light of the above teaching. The embodiments were chosen and described in order to best explain the principles of the invention and its practical application, to thereby enable others skilled in the art to best utilize the invention and various embodiments with various modifications as are suited to the particular use contemplated. It is intended that the scope of the invention be defined by the claims appended hereto and their equivalents.

Claims: Clai s 1. A method of bandwidth scaling of a compressed video stream comprising the steps of: (A) decompressing an original previously compressed video stream image having a first level of compression including a first level of quantization, said original video stream comprising a set of original motion pictures; said original video stream image comprising a set of original macro blocks; said set of original macro blocks further comprising a set of I source pictures, a set of P source pictures, and a set of B source pictures; said decompressed video stream image comprising a set of decompressed motion pictures; said decompressed video stream image comprising a set of decompressed macro blocks; said set of decompressed macro blocks further comprising a set of I decompressed pictures, a set of P decompressed pictures, and a set of B decompressed pictures; said step (A) further comprising the steps of: (Al) recovering and saving a set of original motion vectors for each said P source picture and each said B source picture; wherein each said original motion vector substantially points out to at least one macro block in said original video stream; and (A2) recovering a reconstructed original video stream; wherein said reconstructed original video stream differs from said original video stream by an amount of information lost during an original compression process of said original video stream; said reconstructed original video stream comprising a set of reconstructed original macro blocks; said set of reconstructed original macro blocks further comprising a set of I reconstructed source (RS) pictures, a set of P reconstructed source (RS) pictures, and a set of B reconstructed source (RS) pictures ; and (B) re-compressing said decompressed video stream image to create a re-compressed video stream image having a second level of compression including a second level of quantization, wherein said second level of compression is higher than said first level of compression, and wherein said second level of quantization is stronger than said first level of quantization, said re-compressed video stream image comprising a set of re-compressed motion pictures; said re-compressed video stream image comprising a set of re-compressed macro blocks; said set of re-compressed macro blocks further comprising a set of I destination pictures, a set of P destination pictures, and a set of B destination pictures; said step (B) further comprising the steps of: (Bl) processing said set of recovered and saved original motion vectors for each said P source picture and each said B source picture in order to create a set of usable source motion vectors for each said P destination picture and each said B destination picture; (B2) removing an interframe redundancy from each said P (RS) picture and from each said B (RS) picture by using said set of usable source motion vectors, wherein the values of a set of pixels in each said I (RS) picture is independently provided, and wherein in each said P (RS) picture, only the incremental changes in each said pixel value from a preceding I (RS) picture or a preceding P (RS) picture are coded, and wherein in each said B (RS) picture, a set of pixel values are coded with respect to both an earlier I (RS)/or P(RS) picture, and a later I (RS) /or P(RS) picture; (B3) removing intraframe redundancy by performing a 2 -dimensional discrete cosine transform (DCT) on a plurality of 8x8 values matrices to map the spatial luminance or chrominance values into the frequency domain; (B4) performing a quantization process having said second level of quantization of each said DCT coefficients by weighting each element of each said 8x8 matrix in accordance with its chrominance or luminance type and its frequency; (B5) performing a run length coding for each said weighted element of each said 8x8 matrix without information loss as an ordered list of a "DC" value, and alternating pairs of a non-zero "AC" value and a length of zero elements following said non-zero "AC" value; wherein each said element of one said matrix is presented as if said matrix is read in a zigzag manner; and (B6) performing an entropy encoding scheme for each said (RS) video stream in order to further compress the representations of each said DC block coefficient and each said AC value-run length pairs using variable length codes ; wherein each said original de-compressed video stream is re-compressed by using said set of reusable source motion vectors. 2. The method of claim 1, wherein said step (Bl) of processing said set of saved original motion vectors for each said P source picture and each said B source picture further includes the steps of: (Bl, 1) analyzing said set of N saved original motion vectors for one said P source picture, or for one said B source picture; N being an integer; (Bl, 2) if in a set of Nl of motion vectors, for each pair comprising a first motion vector from said set of Nl motion vectors, and a second motion vector from said set of Nl motion vectors, a distance between said first motion vector and said second motion vector is less than a first predetermined value, keeping said set of Nl motion vectors for further global frame processing; and disregarding a set of remaining (N-Nl) motion vectors; wherein said set of Nl motion vectors substantially points out to a camera movement within at least one said P/B source picture; Nl being an integer greater or equal to said first predetermined number threshold 1 : N > Nl > being an integer; (Bl, 3) if in a subset of N2 motion vectors, wherein said subset of N2 motion vectors corresponds to a group of adjacent macro blocks comprising a set of N2 macro blocks, for each pair comprising a first motion vector from said subset of N2 motion vectors, and a second motion vector from said subset of N2 motion vectors, a distance between said first motion vector and said second motion vector is less than a second predetermined value, keeping said set of N2 motion vectors for further local frame processing; and disregarding a set of remaining (N- N2) motion vectors; wherein said set of N2 motion vectors substantially points out to at least one moving object within at least one said P/B source picture; N2 being an integer greater or equal to said second predetermined number N threshold 2 : N2 > N threshold 2 ; N threshold 2 being an integer ; and (Bl, 4) repeating said step (Bl, 3) to recover in said set of N motion vectors a subset of N moving _ object of motion vectors that substantially points out to substantially all moving objects within at least one said P/B source picture; N moving _ object is an integer less or equal to N. 3. The method of claim 2, wherein said step of (Bl, 2) further includes the step of: setting said distance between said first motion vector and said second motion vector to be less than 2 pixels by each coordinate. 4. The method of claim 2, wherein said step of (Bl, 2) further includes the step of: setting said distance between said first motion vector and said second motion vector to be less than 10% of said first motion vector value by each coordinate. 5. The method of claim 2, wherein said step of (Bl, 2) further includes the step of: setting said distance between said first motion vector and said second motion vector to be less than 10% of said second motion vector value by each coordinate. 6. The method of claim 2, wherein said step (Bl, 2) further includes the step of performing a narrow search to optimize said set of Nl motion vectors substantially pointing out to said camera movement within at least one said P/B source picture further including the steps of: (A) identifying a set of macro blocks corresponding to said set of Nl motion vectors in said P/B source picture; (B) for one said macro block in said picture, using one said original motion vector from said set of Nl motion vectors to identify a reference area in a reference picture that corresponding to said macro block; (C) performing a narrow search in a narrow search area adjacent to said reference area in said reference picture to find an optimum motion vector that points out to an optimum matching macro block in said reference picture; wherein the maximum size of said narrow search area is determined by the size of 5x5 macro block area centered around said original motion vector; and (D) repeating said steps (B-C) for each said macro block in said P/B source picture. 7. The method of claim 2, wherein said step (Bl, 2) further includes the step of performing a narrow search to optimize said set of Nl motion vectors substantially pointing out to said camera movement within at least one said P/B source picture further including the steps of: (A) identifying a set of macro blocks corresponding to said set of Nl motion vectors in said P/B source picture; (B) for one said macro block in said picture, using one said original motion vector from said set of Nl motion vectors to identify a reference area in a reference picture that corresponding to said macro block; (C) performing a narrow search in a narrow search area adjacent to said reference area in said reference picture to find an optimum motion vector that points out to an optimum matching macro block in said reference picture; wherein the maximum size of said narrow search area is determined by the size of 7x7 macro block area centered around said original motion vector; and (D) repeating said steps (B-C) for each said macro block in said P/B source picture. 8. The method of claim 2, wherein said step (Bl, 2) further comprises the steps of: calculating a median value of a motion vector from said set N of motion vectors; if in said subset Nl of motion vectors, a distance between each said motion vector and said median value is less than said first predetermined value, keeping said set of Nl motion vectors for further global frame processing; and disregarding a set of remaining (N-Nl) motion vectors; wherein said set of Nl motion vectors substantially points out to said camera movement within at least one said P/B source picture; N being an integer greater or equal to said first predetermined numberN^ sh ^ 1 : N >N1> N^ s ^ 1 ; Nl being an integer,- N thresho ia 1 being an integer. 9. The method of claim 2, wherein said step (Bl, 2) further comprises the steps of: calculating an average value of a motion vector from said set N of motion vectors; if in said subset Nl of motion vectors, a distance between each said motion vector and said average value is less than said first predetermined value, keeping said set of Nl motion vectors for further global frame processing; and disregarding a set of remaining (N-Nl) motion vectors; wherein said set of Nl motion vectors substantially points out to said camera movement within at least one said P/B source picture; Nl being an integer greater or equal to said first predetermined number Na resho i d 1 : N >N1> TSu netbo ia 1 Nl being an integer; ^^^^ 1 being an integer. 10. The method of claim 2, wherein said step (Bl, 2) further comprises the steps of: (A) selecting a first set of Nl of motion vectors from said set N of motion vectors; (B) calculating an average value of a motion vector from said first subset Nl of motion vectors; (C) if in said first subset Nl of motion vectors, a distance between each said motion vector and said average value is less than said first predetermined value, keeping said first set of Nl motion vectors for further global frame processing; and disregarding said set of remaining (N-Nl) motion vectors; wherein said first set of Nl motion vectors substantially points out to said camera movement within at least one said P/B source picture; Nl being an integer greater or equal to said first predetermined number N tbxβώoXΛ 1 : N ≥N1> N^^^ 1 ; Nl being an integer; ^^^ 1 being an integer; and (D) if in said first subset Nl of motion vectors, a distance between each said motion vector and said median value is greater than said first predetermined value, selecting a second subset Nl of motion vectors from said set N of motion vectors and repeating said steps (B-D) . 11. The method of claim 7, wherein said step of keeping said set of Nl motion vectors for further global frame processing; and disregarding said set of remaining (N-Nl] motion vectors further comprises the step of: detecting said camera movement if said number Nl of motion vectors is greater than N/2. 12. The method of claim 2, wherein said step (Bl, 2) further includes the step of performing a full search to optimize said set of remaining (N-Nl) motion vectors further including the steps of: (A) identifying a set of macro blocks corresponding to said set of (N-Nl) motion vectors in said P/B source picture; (B) for one said macro block in said picture, using one said motion vector from said set of (N-Nl) motion vectors to identify a reference area in a reference picture that corresponding to said macro block; (C) performing a full search in a search area adjacent to said reference area in said reference picture to find an optimum motion vector that points out to an optimum matching macro block in said reference picture; and (D) repeating said steps (B-C) for each said macro block in said P/B source picture. 13. The method of claim 12, wherein said step (C) of performing said full search further includes the steps of: setting a size of said full search area, wherein said size of said full search area depends on the amount of available processing power. 14. The method of claim 2, wherein said step (Bl, 3) further includes the step of performing a narrow search to optimize said set of N moving _ ob;jeot of motion vectors that substantially points out to substantially all moving objects within at least one said P/B source picture further including the steps of: (A) identifying a set of macro blocks corresponding to said set of N moving _ object motion vectors in said P/B source picture; (B) for one said original macro block in said picture, using one said original motion vector from said set of N moving _ object motion vectors to identify a reference area in a reference picture that corresponding to said macro block; (C) performing a narrow search in a narrow search area adjacent to said reference area in said reference picture to find an optimum motion vector that points out to an optimum matching macro block in said reference picture; wherein the maximum size of said narrow search area is determined by the size of 5x5 macro block area centered around said original motion vector; and (D) repeating said steps (B-C) for each said macro block in said P/B source picture. 15. The method of claim 2, wherein said step (Bl, 3) further includes the step of performing a narrow search to optimize said set of N moving _ object of motion vectors that substantially points out to substantially all moving objects within at least one said P/B source picture further including the steps of: (A) identifying a set of macro blocks corresponding to said set of N moving _ object motion vectors in said P/B source picture; (B) for one said original macro block in said picture, using one said original motion vector from said set of N moving _ object motion vectors to identify a reference area in a reference picture that corresponding to said macro block; (C) performing a narrow search in a narrow search area adjacent to said reference area in said reference picture to find an optimum motion vector that points out to an optimum matching macro block in said reference picture; wherein the maximum size of said narrow search area is determined by the size of 7x7 macro block area centered around said original motion vector; and (D) repeating said steps (B-C) for each said macro block in said P/B source picture. 16. The method of claim 2, wherein said step (Bl, 3) further includes the step of performing a full search to optimize said set of N moviilg _ ob:;ect of motion vectors that substantially points out to substantially all moving objects within at least one said P/B source picture further comprising the steps of: (A) identifying a set of macro blocks corresponding to said set of N moving _ object motion vectors in said picture; (B) for one said macro block in said picture, using one said motion vector from said set of N moving _ object motion vectors to identify a reference area in a reference picture that corresponding to said macro block; (C) performing a full search in a search area adjacent to said reference area in said reference picture to find an optimum motion vector that points out to an optimum matching macro block in said reference picture; and (D) repeating said steps (B-C) for each said macro block in said P/B source picture. 17. The method of claim 12, wherein said step (C) of performing said full search further includes the steps of: setting a size of said full search area, wherein said size of said full search area depends on the amount of available processing power. 18. The method of claim 2, wherein said step (Bl, 3) further includes the step of: setting said number N2 to be greater or equal to two . 19. The method of claim 2, wherein said step (Bl, 3) further includes the steps of: (A) starting with an arbitrary motion vector N belonging to said set of N of motion vectors; wherein said arbitrary motion vector corresponds to at least one macro block ; (B) comparing said motion vector with a motion vector 2 belonging to a set of 8 neighboring motion vectors; wherein each said neighboring motion vector 2 corresponds to at least one macro block β adjacent to said macro block α; (C) if a distance between said arbitrary motion vector and at least one said neighboring motion vector 2 is less than said second predetermined value, marking each said motion vector 2 as a motion vector 1 belonging to a set N moving object ; (D) replacing said arbitrary motion vector with one said motion vector 1 belonging to said set N moving ob;ject ; and (E) repeating said steps (B-D) until said set N moving object stops growing . 20. The method of claim 1, wherein said step (B4) of processing said set of saved original motion vectors for each said P source picture and each said B source picture further includes the steps of: reducing the differences of the quantization level for each pair of a P source picture /corresponding P destination picture at a first predetermined amount; reducing the differences of the quantization level for each pair of an I source picture/corresponding I destination picture at a second predetermined amount; and increasing the quantization level for each destination B picture at a third predetermined amount to compensate for the reduction in the quantization level for each pair of an I source picture/ corresponding I destination picture, and for each pair of an P source picture/corresponding P picture in order to preserve said second compression level; wherein said reduction of the differences of the quantization level for each pair comprising a I source picture and a corresponding I destination picture by said first predetermined amount; and for each pair comprising a P source picture and a corresponding P destination picture by said second predetermined amount reduces the propagation of errors caused by re-using a plurality of motion vectors originally used for a plurality of source pictures compressed at said first quantization level for a plurality of destination pictures compressed at said second quantization level. 21. An apparatus for bandwidth scaling of a compressed video stream comprising: (A) a means for decoding an original previously compressed video stream image having a first level of compression including a first level of quantization, said original video stream comprising a set of original motion pictures; said original video stream image comprising a set of original macro blocks; said set of original macro . ^ 4-1 ^ φ 90 ø 01 4π CH 0 ... 03 4 tn TJ 1 φ o 03 S-l Φ Φ 0 J -H Φ O ^ rl 0 m 4 Φ o X Φ S-l 03 0 3 0 0 -l J 03 0 4-> φ rl 0 .. Φ rl 4-> T φ υ si 0 φ -H o tn ^H Φ 4-> Φ TJ Φ tn 03 0 0 . * . Φ o 4-1 4-1 0 T υ 4H o t 3 ΪH O 03 -H o A 4J 0 4-> 3 4-> -H O <-\ S-l υ -H 3 Φ 4-1 Φ O 0 -rl > 4-1 Φ TJ -H ø υ o 0 O > Φ Λ -H TJ > 0 03 O tn • ^ 4-3 P. ft υ n tn Φ 03 -H TJ 4-> φ 0 TJ 0 TJ 4-1 TJ 0 0 03 -rl tn a 0 φ 4H 0 03 4J H υ a -H φ r- 0 -H 3 O 0 T 0 r-l o 3 Φ Φ U -H φ tn φ 3 4H td 03 0 0 4-> 4J 4- ) 4- ) 0 > 0 03 . — . Φ 4-1 Φ -H rl 03 0- P. υ 0 ω φ & -H φ tn 0 03 tn o 0 tn φ υ X CO -. tn 03 tn > 4H rH 0 -H tn Ό ω ^ 3 > o o 0 0 -H 0 i-l S-l 0 υ tn 03 03 0 Φ 0 4H Φ 3 4-1 0 ø 03 φ Φ Λ tn & O rd in Λ o 0 S-l oi -H 0 4J 3 O -— - Φ φ O -rl rH 0 > 0 O Φ 0 -H rl 03 u φ 3 o 03 0 o tn φ 0 4- ) -H 0 tn H s-i ^ Φ T rH Φ φ -H i V υi rl & 03 O 0 0 0 4-1 Ό Φ tn ø -H H Λ φ 0 & TJ 0 T Φ rH rH ft 0 & 3 Φ rH ø υ -i Ό 03 φ 0 -H 0 0 T tn O 0 υ 4-1 3 -H r-l 0 > φ 4-1 -H 0 ffl 3 o A 4- ) Φ φ 0 -H > 0 -H φ 0 o S-i O 0 > O 0 Φ > 4-> 03 0 03 O 0 o & υ TJ rø 0 C 0 O <ϋ o T 4-3 in T -H 0 -H 03 o 0 υ r-H φ 03 0 -r| tn 4H o φ 3 O -H 4-1 -rl a H Φ -H 03 O -H tn O 0 ft Φ φ T -H Φ rH 0 -H in o Ό 0 ft m 01 TJ φ 0 DO S-l 0 0 > -H 0 tn T Φ ϋl 4 -H Φ 4-1 H φ υ υ , & 0 0 -rl rl 1 0 0 03 r-i TJ S-l 3 ,— 0 03 0 03 T 4H T O 3 4-1 tn TJ Φ 0 4H 4H -H 0 φ i-l -H -H -H >H 0 J CO 4-1 TJ 03 O J in 0 -rl 3 0 4H φ to -H TJ 3 TJ 0 03 si !-i tn s^ -H 3 0 0 0 rH φ -H. Φ -rl -rl -H O T > o O 03 3 (TJ Φ tn φ 0 -H φ 0 o O 03 0 T 0 4J -H 0 03 0 4H O -rl T -H 03 4H T 03 4-> 0 > ,0 -rl ^-1 > 03 S-l -H. -rl φ 0 o a 03 & 03 03 Φ 0 TJ Φ φ 1 4- ) trj O Φ tn φ -H O o • ^ 4-> o o 4-1 4J 4-1 tn 4-> -H 0 φ 3 Φ TJ 03 03 φ tn tn en Φ 3 tn φ 03 TJ υ 0 φ 0 o 0 0 O -H υ tn . — . O 0 -H 03 tn 0 ω Ό ø • ^ - tn o Φ φ 0 Ό φ ■ 03 3 M 0 -H J-> O tn υ & -H 0 T 0 03 φ 3 1 0 φ 01 Φ φ & 0 V 0 4- ) -H φ !-ι 03 O l 03 0 Pi 0 1 3 Φ 03 -rl 0 Φ rl -H t ø φ 03 3 φ 4-1 03 0 Φ o 03 4-> O 0 o - — -H. Φ o rl 0 rø rl ft 4-> ft 0 TJ TJ o o ,Q tn φ 4-1 4-1 Φ T 03 o 03 T S-l υ φ 0 03 4-> & 3 3 tn ~ tn ø 0 3 o 0 O 4-f - o £} 4-1 0 U Φ 0 TJ o Φ O i 0 3 o 0 0 tn 4-> 0 Φ 0 in 4H a tn 0 4-1 -H -H. O 4-1 o φ φ T o o 0 4-1 Si 0 0 υ φ -H φ o O σi υ TJ O tn -H T υ υ 4-1 S-l φ S-l 0 0 4-1 -rl Φ o 1 l to H φ -H 0 φ 4H 03 φ 03 ... 4-1 Ά 0 Φ υ 4-1 0 φ φ ~. φ σi 1 φ 4-1 -H ø Ό P( -H TJ H tn 0 o υ o : 0 3 3 O !-l ø H υ o 4-1 rH 0 SH rl 0 φ l 03 rl 4-> -H 03 Φ 03 0 4-> 4-1 u 0 0 0 0 4-1 S-l ø tn S-l 0 Φ 0 φ φ o in 9< o > 0 -H m 4H 0 Φ o 0 O 0 φ Φ Φ 4-1 O 03 4-1 4-1 ^ 0 Φ > -r) ,0 ,0 SH 4H O 6 -H 0 rl 0 0 ø 0 3 φ 0 Φ r-l 3 S-i i^ 0 -H 0 0 03 0 4 T 4-1 Φ 4 bi 4-1 T 0 Φ 0 Pi Ό -H & 4-> Φ > 03 > Λ 4-> 4-1 0 03 O 0 03 φ o H 0 -H 03 -H T o φ 4-> 3 4-> 4 o 3 0 0 03 03 O 03 υ 4-1 o 4-1 0 4-1 03 N si 0 -P -rl Φ tn O o φ Φ -H 0 m 0 0 3 Φ Φ Φ o Φ O o 0 0 T -rl 0 03 03 φ > rl tn 3 o tn 03 a TJ o 0 ^ — , O O 0 S-l 03 φ 03 o ø 0 4-1 0 4-1 03 0 ■ rl 03 φ φ -H i-l -H TJ -H O TJ CM Φ Φ a φ S-l Φ O 0 - TJ ,0 0 TJ φ TJ rd TJ 0 5 4-1 -H 4-> 0 0 6 TJ T 0 3 TJ 0 0 S-i 4 3 Φ O 0 -. 0 0 0 Φ 4-> 0 & φ i -H φ tn 0 0 O 3 ø -H -H 0 O -H 4-1 03 tn φ 0 0 o 0 03 rl ω 3. ω td 0 tn 01 3 03 3 > > 0 tn 0 0) CH 0 0 0 tn & 0 o -H -H tn 03 ø o tn 3 tn 0 03 • -. Φ 1 03 0 0 o 3 -r| -rl 4-3 4-1 0 Φ 4H ft υ Φ -H -rl Φ 03 i-l ,0 i-l 0 r-l i-l A i-l -H 4 -H 4-1 o TJ -. -H 0 4-1 11} m 0 0 - l SH Φ - ^ tn Φ 0 υ 0 o 0 0 <G • ^ 03 Φ 03 o φ ø m O tn tn N N 03 tn m T ft 3 tn -H & & 0 0 0 0 0 £ 0 3 -H tn -H S-l rd • — 3 tn Φ φ -H -H -H f 3 00 X o 3 td ! H 3 0 -H Φ -rl 4-> -H -H, 0 -H 0 S-l 4-3 0 0 rH rl 4-1 4 SH o υ TJ 0 φ υ JO -H o ft o 4 tn Ol 03 σi tn Φ tn φ a T o a Φ m Φ -H Φ & & 0 0 & o H 0 3 υ O -rl TJ -H 0 -H -H -H 3 -H 3 03 S-l > > 3 3 0 0 3 1 rH Φ 0 φ 4-1 r- 0 φ -H 0 Φ ^ S-l 4-1 SH 4-1 o 0 0 4-1 4-1 0 Φ 0 o o φ o Λ tn tn TJ 03 Λ υ TJ Pi o 0 O rH o o 03 O 03 υ 03 υ 0 o 03 rø r-\ o o 5^ & o in O IT) o LT) o o H CN! ro blocks further comprising a set of I destination pictures, a set of P destination pictures, and a set of B destination pictures; said means for encoding further comprising: (Bl) a means for processing said set of recovered and saved original motion vectors for each said P source picture and each said B source picture in order to create a set of usable source motion vectors for each said P destination picture and each said B destination picture; (B2) a means for removing an interframe redundancy from each said P (RS) picture and from each said B (RS) picture by using said set of usable source motion vectors, wherein the values of a set of pixels in each said I (RS) picture is independently provided, and wherein in each said P (RS) picture, only the incremental changes in each said pixel value from a preceding I (RS) picture or a preceding P (RS) picture are coded, and wherein in each said B (RS) picture, a set of pixel values are coded with respect to both an earlier I (RS)/or P(RS) picture, and a later I (RS) /or P(RS) picture; (B3) a means for removing intraframe redundancy by performing a 2-dimensional discrete cosine transform (DCT) on a plurality of 8x8 values matrices to map the spatial luminance or chrominance values into the frequency domain; (B4) a means for performing a quantization process having said second level of quantization of each said DCT coefficients by weighting each element of each said 8x8 matrix in accordance with its chrominance or luminance type and its frequency; (B5) a means for performing a run length coding for each said weighted element of each said 8x8 matrix without information loss as an ordered list of a "DC" value, and alternating pairs of a non-zero "AC" value and a length of zero elements following said non-zero "AC" value; wherein each said element of one said matrix is presented as if said matrix is read in a zigzag manner; and (B6) a means for performing an entropy encoding scheme for each said (RS) video stream in order to further compress the representations of each said DC block coefficient and each said AC value-run length pairs using variable length codes; wherein each said original de-compressed video stream is re-compressed by using said set of reusable source motion vectors. 22. The apparatus of claim 21, wherein said means for processing said set of saved original motion vectors for each said P source picture and for each said B source picture further includes : (Bl, 1) a means for analyzing said set of N saved original motion vectors for one said P source picture, or for one said B source picture; N being an integer; (Bl, 2) a means for global frame processing a set of Nl motion vectors and a means for disregarding a set of remaining (N-Nl) motion vectors; said means for global frame processing further comprising: a means for checking whether for each pair comprising a first motion vector from said set of Nl motion vectors and a second motion vector from said set of Nl motion vectors, a distance between said first motion vector and said second motion vector is less than a first predetermined value; wherein said set of Nl motion vectors substantially points out to a camera movement within at least one said P/B source picture; Nl being an integer greater or equal to said first predetermined number N,^^ 1 : N ≥ Nl > N threshold 1 ; Nl being an integer; ^ e ^-^ 1 being an integer; and (Bl, 3) a means for local frame processing a set of N2 motion vectors and a means for disregarding a set of remaining (N-N2) motion vectors; said set of N2 motion vectors corresponding to a group of adjacent macro blocks comprising a set of N2 macro blocks; said means for local frame processing further comprising: a means for checking whether for each pair comprising a first motion vector from said set of N2 motion vectors and a second motion vector from said set of N2 motion vectors, a distance between said first motion vector and said second motion vector is less than a second predetermined value; wherein said set of N2 motion vectors substantially points out to at least one moving object within at least one said P/B source picture; N2 being an integer greater or equal to said second predetermined number N threshold 2 : N2 > N threshold 2 ; N threshold 2 being an integer; and means for checking whether a set of N2 motion vectors includes a set of substantially all N moving _ object motion vectors; wherein in said set of N moving _ object of motion vectors each said motion vector substantially points out to at least one moving object within at least one said P/B source picture; wherein N moving _ ob;ject is an integer less or equal to N. 23. The apparatus of claim 22, wherein said means for global frame processing said set of Nl motion vectors further includes : a means for performing a narrow search to optimize said set of Nl motion vectors; wherein said set of Nl motion vectors substantially points out to said camera movement within at least one said P/B source picture; and a means for performing a full search to optimize said set of remaining (N-Nl) motion vectors. 24. The apparatus of claim 23, wherein said means for performing said narrow search to optimize said set of Nl motion vectors further includes: (A) a means for identifying a set of macro blocks corresponding to said set of Nl motion vectors in said P/B source picture; (B) a means for identifying a reference area in a reference picture corresponding to one said macro block in said P/B source picture; and (C) a means for identifying the maximum size of said narrow search area. 25. The apparatus of claim 22, wherein said means for local frame processing said set of N2 motion vectors further includes : a means for performing a narrow search to optimize said set of N moving _ ob;ject of motion vectors that substantially points out to substantially all moving objects within at least one said P/B source picture. 26. The apparatus of claim 25, wherein said means for performing said narrow search to optimize said set of N mθv i ng _ obect motion vectors further includes: (A) a means for identifying a set of macro blocks corresponding to said set of N moving _ object motion vectors in said P/B source picture; (B) a means for identifying for each said original macro block in said P/B source picture a reference area in a reference picture that corresponding to said macro block; and (C) a means for identifying the maximum size of said narrow search area . 27. The apparatus of claim 22, wherein said means for local frame processing said set of N2 motion vectors further includes : a means for performing a full search to optimize said set of N moving _ object of motion vectors that substantially points out to substantially all moving objects within at least one said P/B source picture further comprising: a means for identifying a set of macro blocks corresponding to said set of N moving _ object motion vectors in said P/B source picture; and a means for identifying a reference area in said reference picture that corresponds to each said macro block in said P/B source picture. 28. The apparatus of claim 22, wherein said means for local frame processing said set of N2 motion vectors further includes a programmable chip including the following algorithm: (A) starting with an arbitrary motion vector belonging to said set of N of motion vectors; wherein said arbitrary motion vector K corresponds to at least one macro block a; (B) comparing said K motion vector with a motion vector 2 belonging to a set of 8 neighboring motion vectors; wherein each said neighboring motion vector 2 corresponds to at least one macro block β adjacent to said macro block a; (C) if a distance between said arbitrary motion vector N and at least one said neighboring motion vector 2 is less than said second predetermined value, marking each said motion vector 2 as a motion vector 1 belonging to a set N moving object ; (D) replacing said arbitrary motion vector N with one said motion vector 1 belonging to said set N moving object ; and (E) repeating said steps (B-D) until said set ^^ g . obec stops growing. 29. The apparatus of claim 21, wherein means for processing said set of recovered and saved original motion vectors for each said P source picture and each said B source picture further includes: a means for reducing the differences of the quantization level for each pair of P source picture /corresponding P destination picture at a first predetermined amount; a means for reducing the differences of the quantization level for each pair of I source picture/corresponding I destination picture at a second predetermined amount; and a means for increasing the quantization level for each destination B picture at a third predetermined amount to compensate for the reduction in the quantization level for each pair of I source picture/ corresponding I destination picture, and for each pair of P source picture/corresponding P picture in order to preserve said second compression level; wherein said reduction of the differences of the quantization level for each pair comprising said I source picture and said corresponding I destination picture by said first predetermined amount; and for each pair comprising said P source picture and said corresponding P destination picture by said second predetermined amount reduces the propagation of errors caused by re-using a plurality of motion vectors originally used for a plurality of source pictures compressed at said first quantization level for a plurality of destination pictures compressed at said second quantization level. 30. A remote host server useful in association with a client computer, said remote host server having a processor and memory, said client computer having a processor and memory, said client computer being coupled to said remote host server via a wireless communication network, said remote server comprising: (A) a decoder configured to decompress an original previously compressed video stream image having a first level of compression including a first level of quantization, said original video stream comprising a set of original motion pictures; said original video stream image comprising a set of original macro blocks; said set of original macro blocks further comprising a set of I source pictures, a set of P source pictures, and a set of B source pictures; said decompressed video stream image comprising a set of decompressed motion pictures; said decompressed video stream image comprising a set of decompressed macro blocks; said set of decompressed macro blocks further comprising a set of I decompressed pictures, a set of P decompressed pictures, and a set of B decompressed pictures; said decoder further comprising: (Al) a means for recovering and saving a set of original motion vectors for each said P source picture and each said B source picture; wherein each said original motion vector substantially points out to at least one macro block in said original video stream; and (A2) a means for recovering a reconstructed original video stream; wherein said reconstructed original video stream differs from said original video stream by an amount of information lost during an original compression process of said original video stream; said reconstructed original video stream comprising a set of reconstructed original macro blocks; said set of reconstructed original macro blocks further comprising a set of I reconstructed source (RS) pictures, a set of P reconstructed source (RS) pictures, and a set of B reconstructed source (RS) pictures; and (B) a re-compressor configured to re-compress said decompressed video stream image to create a re-compressed video stream image having a second level of compression including a second level of quantization, wherein said second level of compression is higher than said first level of compression, and wherein said second level of quantization is stronger than said first level of quantization, said re-compressed video stream image comprising a set of re-compressed motion pictures; said re-compressed video stream image comprising a set of re- compressed macro blocks; said set of re-compressed macro blocks further comprising a set of I destination pictures, a set of P destination pictures, and a set of B destination pictures; said re-compressor further comprising: (Bl) a processor configured to process said set of recovered and saved original motion vectors for each said P source picture and each said B source picture in order to create a set of usable source motion vectors for each said P destination picture and each said B destination picture; (B2) a means for removing an interframe redundancy from each said P (RS) picture and from each said B (RS) picture by using said set of usable source motion vectors, wherein the values of a set of pixels in each said I (RS) picture is independently provided, and wherein in each said P (RS) picture, only the incremental changes in each said pixel value from a preceding I (RS) picture or a preceding P (RS) picture are coded, and wherein in each said B (RS) picture, a set of pixel values are coded with respect to both an earlier I (RS)/or P(RS) picture, and a later I (RS) /or P(RS) picture; (B3) a means for removing intraframe redundancy by performing a 2-dimensional discrete cosine transform (DCT) on a plurality of 8x8 values matrices to map the spatial luminance or chrominance values into the frequency domain; (B4) a means for performing a quantization process having said second level of quantization of each said DCT coefficients by weighting each element of each said 8x8 matrix in accordance with its chrominance or luminance type and its frequency; (B5) a means for performing a run length coding for each said weighted element of each said 8x8 matrix without information loss as an ordered list of a "DC" value, and alternating pairs of a non-zero "AC" value and a length of zero elements following said non-zero "AC" value; wherein each said element of one said matrix is presented as if said matrix is read in a zigzag manner; and (B6) a means for performing an entropy encoding scheme for each said (RS) video stream in order to further compress the representations of each said DC block coefficient and each said AC value-run length pairs using variable length codes; wherein each said original de-compressed video stream is re-compressed by using said set of reusable source motion vectors . 31. A client computer useful in association with a remote host server, said client computer being coupled to said remote host server via a wireless communication network, said client computer having a processor, a memory, and a multimedia display; said client computer comprising: a transmitter configured to send request for a multimedia content to said host server from said client computer using said wireless communication network; and 4-1 0 0 1 90 0 rl 4-1 TJ 0 O 0 03 4H ft 0 O 3 φ bi o φ 03 Φ Φ O 4H O Φ 0 4H O -H 0 4-1 4-1 0 03 0 rH bi o -. 0 4H O r-i ,0 -H Tj Φ O J 0 rH -rl -. 0 A 03 0 0 0 0 03 0 4-1 Φ O 0 O 4-1 O -H l ^H -rl o 0 > T X ft φ -rl 0 -H 3 Φ 4-1 Φ T Φ 03 0 0 O rl > 4-1 4-> Tj 0 φ rl 3 TJ in 03 -rl 03 rl U 03 -H 0 S\ 4-1 ft -rl φ 3 O tn 0 ω J 0 si ^-i o o -rl ft £5 o td ft 03 n -H rH 0 -H > 4-1 Φ Tj Φ n 0 rH 0 H 3 -H o 3 Φ -H SH td 4-1 a rd u SH 03 φ 4-> -rl T rH 3 rd o O -rt 0 -H U 0 0 4-1 03 o SH rl 0 & 0 υ T 23 03 03 rl 0 0 0 φ 3 α. 4 03 4-1 -H φ o φ tn υ ft O O 3 -rl -H Φ bi Φ 3 4H 0 03 O 0 0 φ -rl T 0 H 0 > 0 0 0 φ 3 -H 0 σi ft o 0 0} Φ Φ -H 0 bi -H 0 0 ϋ rH rl -H 03 1 0 j 4-1 o -H H -H 03 TJ 03 ^ rl ,0 4H φ i O -H > 0 3 0 -rH 0 φ bi 0 0 H 0 -H O rl ø 03 Φ φ X 03 a 4-1 O in -H 0 0 4H 03 0 o 0 03 0 3 φ O φ o -rl 03 V Φ 3 ø iH 4J o rH T 0 Φ -H -H rH o 0 4H 03 n u tn SH ft 03 O rl o bi 4-1 4-1 O 03 0 1 -H Φ tn 4-1 φ 4-1 O O 0 rH 0 4H SH ft 3 φ rH 0 υ 0 Φ U 0 0 A 0 > g 0 03 A 0 0 0 -rl -. 0 3 0 ø m 3 0 SH A 4-1 φ -rl 03 -rl TJ Φ φ -H 03 rl 0 o O -H 4-1 > rH 0 0 -rl O O υ ft V T 03 ft ■ rH 4-1 bi 3 φ ϋ 3 si -H Φ Φ 0 -H 4-1 03 4H o φ 3 0 -H -H 0 0 0 -H 0 Φ 03 0 φ 0 3 TJ SH > -rl tn 3 Φ o TJ O SH a m SH φ 03 4-> 0 rl Φ > 03 -H T > 0 0 Φ ft Φ 4-1 -H 0 03 H φ u ft tn υ 0 •-. SH O rl -rl 4-1 03 TJ -H rl -H SH rH 0 SH φ 4-1 bi T Φ 0 4H 3 0 ,0 3 4-1 4-1 φ 03 Φ φ 0 φ g TJ ø rH N o rl T 4-1 Φ 0 -H TJ 3 TJ 0 O -H 0 υ 0 0 03 T 03 ϋ O rH 3 tn 03 o Φ tn 0 4-> -rl 4-1 -rl O 03 3 0 Φ > o 0 4-1 φ 0 φ φ si φ O 3 -rl 0 03 4 4H 03 0 -H 03 4H T 03 4-1 0 03 φ o 4-> O 1 rl rl φ ^ 4J 4H .. -H rl 0 0 03 4-1 0 O φ 03 Φ 01 4-1 4-1 o υ Φ en ■ tn in 03 03 φ 0 4H tn -rl 0 o Φ 3 03 Φ 03 Φ ft 0 0 tn φ 0 TJ LO O ■ 0 φ O 03 tn O 0 -H 4-J 0 4-1 φ • -. 03 J 0 • ^ 4-1 03 in si T -H O rl SH -H 1 4-3 0 > si Φ 0 υ rl o 1 Φ Tj tn 0 φ 03 Φ Φ a 0 4-> 0 J Φ O 4-1 > 03 T 0 r- SH 03 o 0 03 -rl X 0 0 Φ 03 SH 3 0 -rl rl 03 Φ 0 03 TJ -rl 4J φ Tj φ 0 03 ft 4H > V 4-> SH ft 0 TJ 0 0 φ 4-1 TJ 0 rH Φ 3 0 03 w -H rl 4-1 0 Φ 0 bi 0 0 0 bi -. 03 0 0 3 υ 0 4H bi 03 ,0 0 -rl bi O 0 rl o 03 0 -H 03 0 4-> 0 0 rH rH 0 03 4 0 φ 0 0 -rl > 0 o 0 0 !H φ 4-) 03 -H 03 -rl rH bi 0 A -H Φ o υ tn υ Tj . — . -H si O -rl φ -H bi 4H tn H 02 φ 4-1 tn > φ 0 0 03 iH φ -H 0 φ -. 5 SH o •~ ft rH SH SH bi -rl 0 A o «. 0 rH o Φ 0 0 > -H -H 0 -H 0 TJ ft -H H 03 Φ 0 φ 0 Φ -rl 4H Φ -rl 0 A 1 A ø Λ -H si φ 01 tn S-l 4-1 -H 03 Φ > φ SH 1 0 > TJ SH 0 3 03 T SH 0 0 rl 4-1 03 rH -H -H V ft O > 0 -H 4H 4H in a o ø rH -rl o -H O o -H 0 0 o -rl T 4-1 03 Φ rl 0 3 -rl o O O 0 V 4-1 •-A n υ 0 o 4-1 φ 3 > 0 03 Φ Φ tn 4-1 ft o 3 O ft TJ -H ft 4-1 4-1 Φ o O 0 -H Φ 01 Tj 1 H ,0 Φ φ 0 4-1 rl 0 03 3 u Φ 4J 3 4J 4-1 υ 03 rl 4H -H -H SH -H rl rA 0 1 4-1 3 rJ in -H 0 & 3 ΪH o TJ rH Φ 03 0 O Φ Φ -H ft 4-1 O 0 0 Φ 0 rH -H φ 1 υ 3 -H -H o -H 0 SH U 03 3 O 03 03 a TJ 03 0 .-— -H 03 > φ a φ TJ 4-1 SH Φ Φ o 4H 0 0 Φ rl Φ -rl H rl Φ 0 TJ T CM Φ -H rl 03 4-1 0 0 Φ TJ X υ 3 3 03 -H A 0 SH TJ Φ TJ 0 TJ 0 Φ -rl 0 6 o o 4-1 -H 0 iH 3 0 0 & 4-1 o φ Φ 0 0 0 bi 4-3 O ft φ bi -H φ 03 4-> SH 03 0 rd — φ o ϋ 0 & 0 3 ø o J Φ Φ -rl rl 03 3 03 0 0 tn 03 ø A 03 ,0 Φ -H 3 -H rl 0 ft 0 rl tn SH • ^ SH 0 0 03 3 03 0 03 • -. Φ O 0 & 4H SH o 4-1 O o 3 φ 4-> — , 4-> 0 4-> 03 0 4H ft o Φ -H -H Φ 03 > 03 tn 0 4-1 Φ X υ 0 03 O rH 5 tn -H 03 Φ Φ SH 03 Φ -H 03 0 0 4-1 rl -H 03 4-1 o A in TJ rl 4H tn 4H J ft 3 03 -rl ft rl 0 m in 3 iH f 00 Φ ø 0 u φ 0 0 Φ 0 0 O 0 0 X O 3 0 X rl 3 0 O O X 0 φ 4-1 ft 0 o φ T T Φ H Φ 4-1 υ TJ 0 φ υ & o 4-> -H T 4-1 V Φ 44 ^H 0 3 4-> • 03 0 -H -H 0 SH T T o 4J 0 4-1 -H O SH 0 3 0 o 4-1 -H υ O SH 4H o o 0 Φ CM 03 rl rH 0 φ Φ -H 0 -H -rl Φ rH Φ 0 Φ 4-1 r o φ -H O 0 φ rH 4-1 -H o U o ø m 0 a υ 03 rl 03 > -H > ft 03 A 03 03 TJ 03 A u T ft 3 03 > A 03 T O tn O LT) o m o LT) rH r-l CM CM ro r rH bi 4H 03 4H J H 90 0 TJ 0 O -H 0 4-1 O ^ Φ • -. 0 ,--. TJ 0 Φ -— , 3 -rl -rl T Φ 01 > 4 Φ 4-1 O o Φ -H 4-1 CO 0 > H 0 Φ -H 03 4-> φ 0 Φ Φ SH A 0 J tf 4-1 bi o φ Pi Φ 0 Φ O 0 O 0 Φ rl 03 iH 03 ø 3 υ Φ TJ o ϋ -H ø υ • — ' SH A > -H φ 03 Φ O TJ 03 0 0 4-1 o 0 3 0 0 SH rl 4-1 Φ 03 A TJ -H -H 4-1 Tj 4-1 0 in Φ T φ H 0 H rl o 4-1 0 φ 03 φ rH 03 0 -rl 4-1 0 0 υ , 0 O -rl 4H ,—. 0 Φ H Tj 4 03 H o o tn Φ 0 > O 03 -rl PQ 0 -H Φ ft CO 0 0 td υ tn .. X U Φ 03 0 03 SH O 0 T T A 3 i ft ft 4-1 Pi 0 -H 0 0 TJ -rl iH α. 4-1 0 Φ 0 ø Φ 3 0 ft 0 4-1 Tj Φ • ^ 0 J 0 ft 0 O • — -H -. -rl -H φ ft Φ ϋ 0 4J υ T 0 TJ -H O 3 0 φ T i 03 -H 0 ft Φ Φ Φ 0 0 4-1 03 Tj T J -H 0 O φ φ 03 -H υ 0 S-l 03 φ 0 X 03 O Φ rl U rl T -rH 0 PQ O rH φ φ Φ o 4H rA SH Φ 0 SH 4-1 > 3 Φ u ^ Φ 03 03 3 U -H -rl 4-1 Φ SH υ -H 4-> TJ 3 φ J A O o O iH 4-1 SH O J 0 tn 0 tn Φ 03 -rl O SH 4-1 02 > 0 0 0 TJ X -H 4-1 Φ 0 03 4J H 0 φ TJ φ 4H 0 0 iH Φ r-\ ft 0 O O 0 03 0 0 -H φ -rl > rl φ 4-1 Φ 0 4H 03 SH 4-1 Φ rl 0 O -H O ft iH 3 A 3 0 TJ O 03 4-1 • H TJ 0 υ ft o ft in φ O 0 0 4H 4-) o 03 4-) 03 iH 3 & 0 O -rl -rl Φ A 4-1 φ 03 rl iH rH 0 03 0 O O O 03 0 tn 03 tn H 03 4J 0 3 Φ O o 4-1 0 iH ft iH o 03 0 4H ft 0 0 0 Φ 4-1 u 0 SH φ 0 Φ Φ 03 o O rl 03 03 Φ 0 Φ A 0 O O ω 0 rl Φ φ 4J O 4 o -H > SH 1 υ 4-1 υ iH φ 4H TJ TJ φ TJ Φ υ 03 3 SH , 03 rl Φ υ 03 ft φ TJ Φ ft 03 φ 1 tn 0 φ TJ O -rl in S 0 4-1 rH . O 0 -. 4-> J 03 Φ 0 3 T ø rH 3 -H SH Φ 3 ,0 03 0 o iH PQ 0 φ Φ Φ 4-1 Φ rl 4-> Φ o -H 0 4H 0 0 -rl H o in o 4-1 ft Φ 4-1 03 o in r- 03 0 SH 4H CJ SH A 0 0 0 o υ > υ TJ o 0 Tj φ TJ rl rl Φ 0 4H J 4H 3 A φ ø -H ø tn tn ft φ Φ 0 0 O -H 4H TJ Φ ø 4H 0 .. 03 A -rl -H in o 0 0 Tj 4-1 φ ft 4-1 0 1 0 4-1 bi S-l TJ T -H O 4H -rl 0 O -H 03 4H O 4-1 4H o 03 0 Φ iH 03 0 o 0 O 4-1 o • ^ -H Φ 0 4H Φ O 0 4-1 03 > 03 υ O TJ 0 φ iH 03 4-1 4H 0 4H φ -rl i-l ,—, • H vo 3 03 03 -H O PQ TJ 03 0 Φ 0 4-1 Φ 03 4-1 -rl -rl φ iH o 0 O ft ft 0 CO ft 4-1 1 0 -H 01 -rl 03 O 03 r-i N -. φ TJ iH X Φ ft 03 0 0 4-> A -H T 4H φ > s υ Φ Tj -H 4-1 4H 0 Φ -rl Φ -H 0 03 φ ft υ 03 ft tn H 4-1 υ υ 0 O 03 TJ ,—. ,—, φ SH 9> -rl φ o 03 rl 03 T > 4-1 o 03 3 O 0 Φ O υ Φ 0 0 0 Φ 0 CO rH CO ft 4-1 3 0 8< 03 ft 03 -H Φ 0 -rl 0 03 0 rH 0 0 4-> bi 4H -H > φ 0 4-1 0 -H Pi φ- ft 5 03 to 0 03 3 4-1 3 Φ 0 H 0 4 Φ V A -H 03 0 ft Φ Φ H •— X φ υ o 0 Φ bi 0 SH 03 0 0 bi iH 1 -. 4-> -rl 03 0 TJ bi H 03 0 to -H bi SH 0 • ~ o 03 0 o ft 4-1 O 1 N 0 ft φ 0 03 0 Φ 03 SH φ o 0 0 0 > -H ft ft 0 PQ Φ 3 03 ^ -H 1 3 0 03 -H -H 3 rl rl Φ 0 A 03 O u -rl 0 -H 4-1 TJ -H A TJ 0 X SH 03 0 03 φ O -H iH 4H 4-1 03 o O -rl 4-1 Φ 4-1 iH 4-1 > o -H Φ TJ T TJ 4-> -H Φ u φ Φ 03 u Φ -rl O 0 -H o 4H 0 0 4-1 O υ 0 O φ O -H 0 A Φ -rl -rl φ -rH -H > in O A ΪH Tj Φ rl 4H 0 in 1 o 3 4-1 03 bi O φ o 3 in 3 ft 03 4-1 iH 0 0 o 0 4-1 rH 4-1 0 0 iH 0 4H φ rH ft φ φ 0 iH > 03 ø φ 0 tn 03 φ 03 rH 03 A rl 4 0 ft O , T Φ & 3 4-> -rl -H ft Φ 4-1 H ,—, bi 0 4-1 in TJ 0 0 υ 3 φ Es -H > O Φ φ ft 03 0 PQ o O CO 0 - l o A A ft A Φ 0 o o 4H -H -. o 4-1 rH 0 φ 4H o J 03 03 PQ -H ^ — , O in -H . — . tf -H φ -rl υ υ V TJ -H φ rl ft 03 o 0 Φ ^ 03 rH O -rl 03 0 rl rH -rl TJ 0 ft CM 02 SH ft 0 0 0 0 O tn J 03 Φ 1 φ > 0 φ 0 0 φ 0 4H ft PQ 4-1 -rl o PQ 0 Φ Φ Φ φ O -H 0 X . — . iH Φ SH Φ o 0 rH bi 03 rl -H O 3 O 0 03 0 ft A ,—, SH H > 3 υ CO 0 rl υ rH -H 0 0 Φ tn Φ O o Pi 4 •- 4-1 5 ft 4-1 O 3 03 o O 0 0 o 0 A O > 3 0 3 0 4-1 o φ -H T A ϋ • H -H -H iH rH rH rH - — υ tn TJ ---. 0 TJ 0 4-1 O Φ -H 03 -H o 0 Φ rH ,0 rH 4-> -rl ^ — " 0 TJ 0 0 Λ -ri Φ ø pq 4-1 0 q Φ rH Φ 03 υ -H 03 in 0 υ A 0 0 Φ 03 0 03 Φ 0 -H 0 0 φ ft in ø — o -rH SH 03 3 -H 1 4-1 Φ 0 0 0 0 03 rl H -rl Φ SH •rl 03 90 0 -H -rl 0 ø Φ o 4-1 Φ 4-1 0 0 iH φ 03 0 A -H Φ 03 -H 0 O φ tn ø φ Φ 03 tn tn rl .— 4-1 bi Φ 0 A TJ 03 φ 4-1 ft in Φ 4-1 tn ø 4-1 A 4-1 4-1 TJ iH 0 4J SH 0 o -H -H υ 0 O o 0 03 0 bi -H iH in 3 TJ TJ rl •rl J 03 V υ υ -H φ 0 u Φ rH 4H iH SH 0 O PCj -rl 3 -H 0 -H 4-> -H 0 4H 0 0 in 0 4H Φ 0 -H Φ 0 A A -H A 0 o O 0 0 3 03 — ft -H 0 & A 03 4H 02 ft o O H 0 4H O 0 O TJ Φ ft > tn V ft & > O (RS)/or P(RS) picture, and a later I (RS) /or P(RS) picture; (B3) removing intraframe redundancy by performing a 2-dimensional discrete cosine transform (DCT) on a plurality of 8x8 values matrices to map the spatial luminance or chrominance values into the frequency domain; (B4) performing a quantization process having said second level of quantization of each said DCT coefficients by weighting each element of each said 8x8 matrix in accordance with its chrominance or luminance type and its frequency; (B5) performing a run length coding for each said weighted element of each said 8x8 matrix without information loss as an ordered list of a "DC" value, and alternating pairs of a non-zero "AC" value and a length of zero elements following said non-zero "AC" value; wherein each said element of one said matrix is presented as if said matrix is read in a zigzag manner; and (B6) performing an entropy encoding scheme for each said (RS) video stream in order to further compress the representations of each said DC block coefficient and each said AC value-run length pairs using variable length codes ; wherein each said original de-compressed video stream is re-compressed by using said set of reusable source motion vectors . 33. A computer-readable storage medium useful in association with a client computer, said client computer having a processor, a memory, and a multimedia display; said client computer being coupled to a host server via a wireless communication network, said computer-readable storage medium including computer-readable code instructions configured to cause said client computer to execute the steps of: sending a request for a multimedia content to said host server from said client computer using said wireless communication network; and receiving said multimedia content in real time from said host server on said client computer multimedia display using said wireless communication network.

Inventors: ARYE RAM, ARYE, RAM
Applicants: BAMBOO MEDIACASTING INC, BAMBOO MEDIACASTING, INC.
Application year: 2001
Main classification: H04L
IPC codes: H04N7