# Patent

## Title
Method for performing localized multihypothesis prediction during video coding of a coding unit, and associated apparatus

## Abstract

A method for performing localized multihypothesis prediction during video coding of a coding unit includes: dividing the coding unit into a plurality of sub-coding units; and performing motion vector prediction of each of the sub-coding units. More particularly, the step of performing motion vector prediction of each of the sub-coding units further includes: obtaining a plurality of motion vectors for multihypothesis motion compensation of a specific sub-coding unit of the sub-coding units from a plurality of other sub-coding/coding units. The method further includes performing multihypothesis motion compensation on the specific sub-coding unit according to the plurality of motion vectors, and more particularly, includes utilizing a linear combination of a plurality of pixel values of the plurality of other sub-coding/coding units as a predicted pixel value of the specific sub-coding unit. An associated apparatus is also provided.

## Background
CROSS REFERENCE TO RELATED APPLICATIONS
This application claims the benefit of U.S. provisional application No. 61/323,948, which was filed on Apr. 14, 2010 and entitled “MULTIHYPOTHESIS PREDICTION IN VIDEO CODING” and is incorporated herein by reference.


BACKGROUND
The present invention relates to video processing regarding motion compensation, and more particularly, to a method for performing localized multihypothesis prediction during video coding of a coding unit, and to an associated apparatus.
Motion compensation is a technique utilized in encoding and decoding of video data for video compression and decompression. With the aid of motion compensation, a current picture can be represented in terms of some portions of one or more reference pictures, where the reference pictures may be previous in time or even from the future. Typically, when motion compensation is utilized, images can be accurately synthesized from previously transmitted/stored images, and the compression efficiency can be improved. As the coding techniques progresses, the designs regarding newer standards have been introduced. It seems unlikely that conventional motion compensation schemes can always work properly. For example, in some situations, a problem of low coding efficiency may exist. Thus, a novel method is required for enhancing the coding efficiency in video coding.
SUMMARY
It is therefore an objective of the claimed invention to provide a method for performing localized multihypothesis prediction during video coding of a coding unit, and to provide an associated apparatus, in order to solve the above-mentioned problem.
An exemplary embodiment of a method for performing localized multihypothesis prediction during video coding of a coding unit comprises: dividing the coding unit into a plurality of sub-coding units; and processing each of the sub-coding units. More particularly, the step of processing each of the sub-coding units further comprises: obtaining motion information of a first set of coded units for multihypothesis motion compensation of a specific sub-coding unit of the sub-coding units; utilizing a linear combination of a plurality of pixel values derived from the motion information of the first set of coded units as a predicted pixel value of the specific sub-coding unit; and deriving a predicted pixel value of another sub-coding unit in the coding unit by utilizing motion information of a second set of coded units, wherein the second set of coded unit comprises at least one coded unit that is not in the first set of coded units.
An exemplary embodiment of an apparatus for performing localized multihypothesis prediction during video coding of a coding unit comprises a processing circuit arranged to perform video coding on the coding unit, where the processing circuit comprises a preprocessing module and at least one coding module. The preprocessing module is arranged to divide the coding unit into a plurality of sub-coding units and to process each of the sub-coding units. More particularly, the preprocessing module obtains motion information of a first set of coded units for multihypothesis motion compensation of a specific sub-coding unit of the sub-coding units, and performs multihypothesis motion compensation on the specific sub-coding unit according to the motion information, where the preprocessing module utilizes a linear combination of a plurality of pixel values derived from the motion information of the first set of coded units as a predicted pixel value of the specific sub-coding unit. In addition, the at least one coding module is arranged to perform video coding on the coding unit based upon the multihypothesis motion compensation performed by the preprocessing module. Additionally, the preprocessing module derives a predicted pixel value of another sub-coding unit in the coding unit by utilizing motion information of a second set of coded units comprising at least one coded unit that is not in the first set of coded units.
An exemplary embodiment of a method for performing localized multihypothesis prediction during video coding of a coding unit comprises: dividing the coding unit into a plurality of sub-coding units; and processing each of the sub-coding units. More particularly, the step of processing each of the sub-coding units further comprises: obtaining motion information of a plurality of coded units for multihypothesis motion compensation of a specific sub-coding unit of the sub-coding units; utilizing a weighted summation of a plurality of pixel values derived from the motion information of the coded units as a predicted pixel value of the specific sub-coding unit; and deriving a predicted pixel value of another sub-coding unit in the coding unit by utilizing a different weighted summation of the pixel values derived from the motion information of the coded units.
These and other objectives of the present invention will no doubt become obvious to those of ordinary skill in the art after reading the following detailed description of the preferred embodiment that is illustrated in the various figures and drawings.



BRIEF DESCRIPTION OF THE DRAWINGS
FIG. 1A is a diagram of an apparatus for performing localized multihypothesis prediction during video coding of a coding unit according to a first embodiment of the present invention.
FIG. 1B illustrates the inter/intra prediction module shown in FIG. 1A according to an embodiment of the present invention.
FIG. 1C illustrates exemplary multihypothesis motion compensation operations of the multihypothesis inter prediction circuit shown in FIG. 1B according to an embodiment of the present invention.
FIG. 2 is a flowchart of a method for performing localized multihypothesis prediction during video coding of a coding unit according to an embodiment of the present invention.
FIG. 3 illustrates exemplary coded blocks involved with the method shown in FIG. 2 according to an embodiment of the present invention.
FIG. 4 illustrates some implementation details involved with the method shown in FIG. 2 according to an embodiment of the present invention.
FIGS. 5A-5D illustrate some implementation details of multihypothesis prediction that are involved with the method shown in FIG. 2 according to different embodiments of the present invention.
FIGS. 6A-6B illustrate exemplary sources for obtaining motion information that are involved with the method shown in FIG. 2 according to different embodiments of the present invention.
FIGS. 7A-7B respectively illustrate temporal and spatial motion vectors (MVs) involved with the method shown in FIG. 2 according to different embodiments of the present invention.
FIGS. 8A-8C illustrate exemplary sources for obtaining motion vectors that are involved with the method shown in FIG. 2 according to some embodiments of the present invention.
FIG. 9 illustrates some implementation details involved with the method shown in FIG. 2 according to an embodiment of the present invention.
FIG. 10 illustrates some implementation details involved with the method shown in FIG. 2 according to another embodiment of the present invention.
FIG. 11 illustrates some implementation details involved with the method shown in FIG. 2 according to an embodiment of the present invention.



DETAILED DESCRIPTION
Certain terms are used throughout the following description and claims, which refer to particular components. As one skilled in the art will appreciate, electronic equipment manufacturers may refer to a component by different names. This document does not intend to distinguish between components that differ in name but not in function. In the following description and in the claims, the terms “include” and “comprise” are used in an open-ended fashion, and thus should be interpreted to mean “include, but not limited to . . . ”. Also, the term “couple” is intended to mean either an indirect or direct electrical connection. Accordingly, if one device is coupled to another device, that connection may be through a direct electrical connection, or through an indirect electrical connection via other devices and connections.
Please refer to FIG. 1A, which illustrates a diagram of an apparatus 100 for performing localized multihypothesis prediction during video coding of a coding unit according to a first embodiment of the present invention. The apparatus 100 comprises an inter/intra prediction module 110 (labeled “Inter/Intra Prediction” in FIG. 1A), an arithmetic unit 120, a transform and quantization module 130 (labeled “Transform & Quantization” in FIG. 1A), an entropy coding circuit 140 (labeled “Entropy Coding” in FIG. 1A), an inversed transform and inversed quantization module 150 (labeled “Inversed Transform & Inversed Quantization” in FIG. 1A), a reconstruction circuit 160 (labeled “REC” in FIG. 1A), a deblocking filter 170, and a frame buffer 180. Referring to FIG. 1B, the inter/intra prediction module 110 mentioned above may comprise a multihypothesis inter prediction circuit 112 (labeled “Multihypothesis Inter Prediction” in FIG. 1B), an inter prediction circuit 114 (labeled “Inter Prediction” in FIG. 1B), an intra prediction circuit 116 (labeled “Intra Prediction” in FIG. 1B), and a switching circuit 118.
According to the embodiment shown in FIG. 1A, the apparatus 100 performs video coding on an original signal 109, and generates an output signal carrying coding results, such as the output of the entropy coding circuit 140. For example, the original signal 109 may represent input video carrying data of the coding unit, and the output of the entropy coding circuit 140 can be an output bitstream (or bit stream). In addition, the inter/intra prediction module 110 is arranged to perform inter/intra prediction, and more particularly, to perform multihypothesis inter prediction, inter prediction, and intra prediction by utilizing the multihypothesis inter prediction circuit 112, the inter prediction circuit 114, and the intra prediction circuit 116 shown in FIG. 1B, respectively.
As shown in FIG. 1A, the arithmetic unit 120 is arranged to perform an arithmetic operation such as a subtraction operation on the original signal 109 (which may represent the input video carrying data of the coding unit, for example) and the prediction signal 119 generated by the inter/intra prediction module 110. In addition, the transform and quantization module 130, the entropy coding circuit 140, the inversed transform and inversed quantization module 150, and the reconstruction circuit 160 are arranged to perform transform and quantization, entropy coding, inversed transform and inversed quantization, and reconstruction operations, respectively. As a result, the reconstruction circuit 160 generates a temporarily reconstructed signal 169 carrying reconstructed results of the reconstruction operations. Additionally, the deblocking filter 170 is arranged to perform deblocking filtering on the reconstructed signal 169, in order to generate a deblocked signal 179 carrying deblocked data for being stored into the frame buffer 180 for the inter prediction of the successive encoding pictures, and the inter/intra prediction module 110 is capable of accessing the temporarily reconstructed signal 169 and the deblocked data of the previous decoded pictures carried by a restored signal 189. This is for illustrative purposes only, and is not meant to be a limitation of the present invention. According to some variations of this embodiment, in a situation where the deblocking filter 170 and the deblocking filtering thereof can be omitted, the reconstructed results carried by the temporarily reconstructed signal 169 can be stored in the frame buffer 180, and the inter/intra prediction module 110 is capable of accessing the temporarily reconstructed signal 169 of the current encoding picture and the reconstructed results of the previous decoded pictures through the restored signal 189.
Referring to FIG. 1B, the multihypothesis inter prediction circuit 112 is arranged to perform multihypothesis inter prediction according to the original signal 109 and the reconstructed results of the previous decoded pictures through the restored signal 189 to generate a multihypothesis inter prediction output 113, the inter prediction circuit 114 is arranged to perform inter prediction according to the original signal 109 and the reconstructed results of the previous decoded pictures through the restored signal 189 to generate an inter prediction output 115, and the intra prediction circuit 116 is arranged to perform intra prediction according to the original signal 109 and the temporarily reconstructed signal 169 to generate an intra prediction output 117, where the switching circuit 118 is arranged to dynamically select one of the multihypothesis inter prediction output 113, the inter prediction output 115, and the intra prediction output 117 as the prediction signal 119 mentioned above.
In practice, at least a portion (e.g. a portion or all) of the apparatus 100 can be implemented by utilizing hardware circuits. For example, the apparatus 100 can be implemented with a processing circuit arranged to perform video coding on the coding unit, where the processing circuit may comprise a preprocessing module comprising the inter/intra prediction module 110, and may further comprise at least one coding module comprising the arithmetic unit 120, the transform and quantization module 130, the entropy coding circuit 140, the inversed transform and inversed quantization module 150, the reconstruction circuit 160, and the deblocking filter 170. More particularly, one or more components of the apparatus 100 can be implemented with digital signal processing techniques. This is for illustrative purposes only, and is not meant to be a limitation of the present invention. According to some variations of this embodiment, at least a portion of the apparatus 100 can be implemented by software and/or firmware. For example, the processing circuit can be a processor executing a plurality of program codes, where the processor executing a first portion of program codes can perform the same or similar operations of the preprocessing module mentioned above, and the processor executing a second portion of program codes can perform the same or similar operations of the coding module mentioned above.
No matter whether at least a portion (e.g. a portion or all) of the apparatus 100 is implemented by utilizing hardware circuits or by utilizing software realization, the apparatus 100 is capable of performing video coding in units of coding units. For example, the coding units can be macroblocks (MBs). In another example, the coding units can be coding units of a size between a predetermined largest coding unit (LCU) and a predetermined smallest coding unit (SCU). The picture is first divided into a plurality of LCUs and each of the LCUs is adaptively split into smaller coding units until leaf coding units are reached. According to this embodiment, the preprocessing module mentioned above is capable of dividing the aforementioned coding unit into a plurality of sub-coding units (e.g. divided by various kinds of partitions, such as square or non-square partitions) and is capable of performing prediction for each of the sub-coding units. More particularly, the preprocessing module can perform inter prediction, intra prediction, or multihypothesis motion compensation on each sub-coding unit. When multihypothesis motion compensation is selected for a specific sub-coding unit, the preprocessing module calculates a linear combination of a plurality of pixel values obtained according to a plurality of other coded units, and utilizes the calculated result as a predicted pixel value of the specific sub-coding unit. The plurality of other coded units may be coded sub-coding units, coded coding units, or a combination thereof. In addition, the aforementioned at least one coding module is arranged to perform video coding on the coding unit based upon the multihypothesis motion compensation performed by the preprocessing module.
FIG. 1C illustrates exemplary multihypothesis motion compensation operations of the inter/intra prediction module 110 shown in FIG. 1A according to an embodiment of the present invention. In this embodiment, the notations F(t0-3), F(t0-2), F(t0-1), and F(t0) are utilized for representing a portion of a plurality of subsequent frames {F(t)}, with the frame F(t0) being the current frame. The current frame F(t0) may comprise a plurality of coding units {CU(t0)}, and a coding unit CU(t0) may comprise a plurality of sub-coding units {SubCU(t0)}. The preprocessing module mentioned above respectively obtains motion information such as motion vectors {vk} from a plurality of other sub-coding/coding units, which means the preprocessing module utilizes the motion vectors of the plurality of other sub-coding/coding units as the motion vectors {vk} for multihypothesis motion compensation of the specific sub-coding unit. According to this embodiment, the preprocessing module can perform multihypothesis motion compensation on the specific sub-coding unit such as the sub-coding unit SubCU(t0) shown in FIG. 1C according to the plurality of motion vectors {vk}.
In general, the preprocessing module calculates a linear combination of a plurality of reference pixel values {Ψr} obtained by the motion information of the plurality of other sub-coding/coding units. The linear combination is a predicted pixel value Ψp of the specific sub-coding unit. For example, the motion information of the first set of coded units comprises one or a combination of motion vector(s), reference frame index(es), and prediction direction(s), and more particularly, comprises some motion vectors that are derived from a single sub-coding unit/coding unit. In another example, the motion information may be motion vector(s), reference frame index(es), prediction direction(s), or any combination of the above. Motion vectors are used as an example of the motion information in the following embodiments. Please note that the linear combination can be a weighted summation of the plurality of reference pixel values, which means the preprocessing module utilizes the weighted summation of the plurality of pixel values as the predicted pixel value of the specific sub-coding unit. For example, in a situation where the specific predicted pixel having the predicted pixel value Ψp belongs to the ith sub-coding unit (e.g. the sub-coding unit SubCU(t0) shown in FIG. 1C) and is located at the position x (e.g. a vector indicating the position, such as a two dimensional vector on the image plane of the current frame F(t0)), the predicted pixel value Ψp can be rewritten as Ψp(i, x), and the predicted pixel value Ψp(i, x) can be express as follows:

Ψp(i,x)=ΣkεK(hk(i,x)Ψr(x+vk));

where the index k may vary within the set K, with the notation hk(i, x) representing a weighted parameter associated to the index k. For example, in a situation where the number of possible values of k is greater than one, the summation of the weighted parameters {hk(i, x)} can be equal to one, for simplicity.

As shown in FIG. 1C, the motion vectors {vk} may comprise motion vectors vA and vB of sub-coding units A and B of other coding units within the current frame F(t0), and further comprise a motion vector vT of a sub-coding unit T of a coding unit CU(t0-1) within another frame such as the previous frame F(t0-1). For example, in a situation where the coding units are blocks, the coding unit CU(t0-1) can be a collocated block with respect to the coding unit CU(t0). As a result, by applying the weighted parameters {hk(i, x)} to the reference pixel values {Ψr} obtained by the motion vectors {vk}, the preprocessing module can blend/mix the partial images indicated by the motion vectors {vk} such as vA, vB, and vT in order to generate a weighted summation image, and utilize the weighted summation image as the predicted partial image of the specific sub-coding unit such as the sub-coding unit SubCU(t0) shown in FIG. 1C. Please refer to FIG. 2 for further details regarding the above-disclosed operations.
FIG. 2 is a flowchart of a method 910 for performing localized multihypothesis prediction during video coding of a coding unit according to an embodiment of the present invention. The method 910 can be applied to the apparatus 100 shown in FIG. 1A, and more particularly, to the processing circuit mentioned above. The method is described as follows.
In Step 912, the preprocessing module mentioned above divides the coding unit CU(t0) (e.g. the coding unit under consideration) into a plurality of sub-coding units such as the sub-coding units {SubCU(t0)} and performs prediction on each of the sub-coding units {SubCU(t0)}. In particular, the preprocessing module obtains motion information, such as the motion vectors {vk} disclosed above, for multihypothesis motion compensation of the specific sub-coding unit SubCU(t0) of the sub-coding units {SubCU(t0)} from the plurality of other coded units mentioned above (e.g. a plurality of other sub-coding/coding units, which may comprise: other sub-coding unit(s) of the coding unit CU(t0); sub-coding unit(s) of at least one other coding unit; and/or other coding unit(s)). According to an embodiment of the present invention, such as that shown in FIG. 3, the coding unit CU(t0) can be a block under processing (labeled “Processed block” in FIG. 3), and the specific sub-coding unit SubCU(t0) can be a sub-block SB, where the shaded portions illustrated in FIG. 3 may represent at least a portion of the coded units/coded blocks {CB}. Referring to FIG. 3, the coded blocks {CB} may comprise a left coded block CBL, an upper left coded block CBUL, an upper coded block CBU, and an upper right coded block CBUR. For example, the motion vectors {vk} may comprise motion vectors of at least a portion (e.g. a portion or all) of the coded blocks {CB}, such as one or more of the coded blocks CBL, CBUL, CBU, and CBUR.
In Step 914, the aforementioned preprocessing module performs multihypothesis motion compensation on the specific sub-coding unit SubCU(t0) according to the plurality of motion vectors {vk}. In particular, the preprocessing module utilizes a linear combination of a plurality of pixel values of the plurality of other coded units mentioned in Step 912 (e.g. the plurality of other sub-coding/coding units), such as the linear combination of the reference pixel values {Ψr} of the reference pixels within the plurality of other coded units mentioned above, as the predicted pixel value Ψp of the specific sub-coding unit. For example, each coding unit (e.g. the coding unit CU(t0)) can be a block, and more particularly, a block comprising an array of pixels, such as an extended macroblock, a macroblock, or a portion of a macroblock. Thus, a sub-coding unit can be referred to as a sub-block. According to an embodiment of the present invention, such as that shown in FIG. 3, the aforementioned preprocessing module can perform multihypothesis motion compensation on the block under processing (labeled “Processed block” in FIG. 3) according to the motion vectors {vk} disclosed above, where the preprocessing module can blend/mix the reference pixel values {Ψr} of the reference pixels within at least a portion (e.g. a portion or all) of the coded blocks {CB}, such as one or more of the coded blocks CBL, CBUL, CBU, and CBUR. In this embodiment, the coded blocks {CB} can be motion-compensated blocks.
According to this embodiment, the preprocessing module is arranged to process each of the sub-coding units mentioned in Step 912. For example, the preprocessing module obtains motion information of a first set of coded units for multihypothesis motion compensation of a first sub-coding unit of the sub-coding units mentioned in Step 912, such as the specific sub-coding unit SubCU(t0), and performs multihypothesis motion compensation on the first sub-coding unit such as the specific sub-coding unit according to the motion information. More particularly, the preprocessing module utilizes a linear combination of a plurality of pixel values derived from the motion information of the first set of coded units as a predicted pixel value of the first sub-coding unit such as the specific sub-coding unit. In addition, the aforementioned at least one coding module is arranged to perform video coding on the coding unit based upon the multihypothesis motion compensation performed by the preprocessing module. Additionally, the preprocessing module derives a predicted pixel value of another sub-coding unit in the coding unit, such as a second sub-coding unit of the sub-coding units mentioned in Step 912, by utilizing motion information of a second set of coded units, where the second sub-coding unit differs from the first sub-coding unit.
With regard to the first sub-coding unit, the first set of coded units may comprise: other sub-coding unit(s) of the coding unit CU(t0) (i.e. sub-coding unit(s) of the coding unit CU(t0) except for the first sub-coding unit); sub-coding unit(s) of at least one other coding unit (i.e. sub-coding unit(s) of at least one coding unit that differs from the coding unit CU(t0)); and/or other coding unit(s), such as one or more coding units that differ from the coding unit CU(t0). In addition, with regard to the second sub-coding unit, the second set of coded units may comprise: other sub-coding unit(s) of the coding unit CU(t0) (i.e. sub-coding unit(s) of the coding unit CU(t0) except for the second sub-coding unit); sub-coding unit(s) of at least one other coding unit (i.e. sub-coding unit(s) of at least one coding unit that differs from the coding unit CU(t0)); and/or other coding unit(s), such as one or more coding units that differ from the coding unit CU(t0). Please note that the second set of coded units comprises at least one coded unit that is not in the first set of coded units. This is for illustrative purposes only, and is not meant to be a limitation of the present invention. According to some variations of this embodiment, the second set of coded units and the first set of coded units can be the same set of coded units. However, the preprocessing module utilizes different linear combinations of the plurality of pixel values derived from the motion information of the same set of coded units as the respective predicted pixel values of the first sub-coding unit and the second sub-coding unit, respectively. For example, the preprocessing module utilizes a first linear combination corresponding to a first set of weighted parameters for the plurality of pixel values as the predicted pixel value of the first sub-coding unit, and utilizes a second linear combination corresponding to a second set of weighted parameters for the plurality of pixel values as the predicted pixel value of the second sub-coding unit. In another example, the preprocessing module utilizes a first weighted summation of the plurality of pixel values derived from the motion information of the first set of coded units as the predicted pixel value of the first sub-coding unit such as the specific sub-coding unit, and derives the predicted pixel value of the second sub-coding unit by utilizing a second weighted summation of the pixel values derived from the motion information of the same set of coded units (i.e. the first set of coded units), where the first weighted summation is different from the second weighted summation.
In some embodiments such as variations of the embodiment shown in FIG. 3, each of the other coded units mentioned in Step 912 is a coded sub-coding/coding unit. For example, in a portion of these variations, the plurality of other coded units mentioned in Step 912 comprises at least one spatially coded sub-coding/coding unit (e.g. one or more of the coded blocks {CB} in the current frame F(t0), or one or more coded sub-blocks within the block under processing or within the coded block) and/or at least one temporally coded sub-coding/coding unit (e.g. one or more coded sub-blocks/blocks in another frame that differs from the current frame F(t0)). In another example, in a portion of these variations, each of the other coded units mentioned in Step 912 is a motion-compensated sub-coding/coding unit. According to some of these variations, the motion vectors {vk} can be obtained from motion estimation.
FIG. 4 illustrates some implementation details involved with the method 910 shown in FIG. 2 according to an embodiment of the present invention. According to this embodiment, the preprocessing module can utilize a weighted summation of the plurality of pixel values mentioned in Step 914 (e.g. ΣkεK(hk(i, x) Ψr(x+vk)) in this embodiment) as the predicted pixel value Ψp of the specific sub-coding unit such as the ith sub-block bi shown in FIG. 4. For better comprehension, the coded blocks CBL, CBUL, CBU, and CBUR can be the same as those shown in FIG. 3, respectively. For example, the reference pixel values {Ψr} of the reference pixels for calculating the predicted pixel value Ψp can be obtained from one or more of the coded blocks CBL, CBUL, CBU, and CBUR, and the plurality of motion vectors {vk} may comprise one or more of the respective motion vectors vL, vUL, vU, and vUR of the coded blocks CBL, CBUL, CBU, and CBUR.
More particularly, for each sub-block such as the ith sub-block bi shown in FIG. 4, a predicted pixel value such as the predicted pixel value Ψp(i, x) can be derived from blending/mixing the reference pixel values {Ψr} of some reference pixels within the coded blocks {CB}, and can still be expressed as follows:

Ψp(i,x)=ΣkεK(hk(i,x)Ψr(x+vk));

where the index k may vary within the set K, and the notations vk and hk(i, x) can be utilized for representing the kth reference motion vector and the associated weighted parameter, respectively. For example, biεBm, and the notation Bm represents the set of sub-blocks of the block under processing (labeled “Processed block” in FIG. 4). As shown in FIG. 4, an exemplary motion vector vk of the motion vectors {vk} is illustrated within the coded block CBU, which means the motion vectors {vk} comprises the motion vector vU of the coded block CBU in this situation.

In an embodiment, such as a variation of the embodiment shown in FIG. 4, the preprocessing module can perform optimum Wiener filtering on the plurality of pixel values such as the reference pixel values {Ψr} with respect to a real pixel value ΨREAL(i, x) of the current pixel under consideration, in order to adjust respective weighted parameters {hk(i, x)} for the plurality of pixel values such as the reference pixel values {Ψr} and to generate the weighted summation (i.e. ΣkεK(hk(i, x) Ψr(x+vk)) in this variation). For example, the weighted parameters {hk(i, x)} can be obtained by utilizing an optimum Wiener filter within the preprocessing module as follows:

(h0*, . . . , hK*)=arg min|ΨREAL(i,x)−ΣkεK(hk(i,x)Ψr(x+vk))|;

which means the weighted parameters {hk(i, x)} can be obtained by searching for a set of (h0*, . . . , hK*) corresponding to a minimum value of |ΨREAL(i, x)−ΣkεK(hk(i, x)Ψr(x+vk))| during the optimum Wiener filtering performed by the preprocessing module. This is for illustrative purposes only, and is not meant to be a limitation of the present invention. According to a variation of the embodiment shown in FIG. 4, the preprocessing module can determine the respective weighted parameters {hk(i, x)} for the plurality of pixel values according to contents of at least one neighboring coding unit, such as the contents of one or more of the coded blocks CBL, CBUL, CBU, and CBUR, in order to generate the weighted summation (i.e. ΣkεK(hk(i, x) Ψr(x+vk)) in this variation). According to another variation of the embodiment shown in FIG. 4, the preprocessing module can determine the respective weighted parameters {hk(i, x)} for the plurality of pixel values according to contents of the plurality of other coded units mentioned in Step 912 (e.g. the first set of coded units), in order to generate the weighted summation (i.e. ΣkεK(hk(i, x) Ψr(x+vk)) in this variation).

In some other embodiments, such as some variations of the embodiment shown in FIG. 4, the preprocessing module can determine the respective weighted parameters {hk(i, x)} for the plurality of pixel values by offline training or by online training, in order to generate the weighted summation (i.e. ΣkεK(hk(i, x) Ψr(x+vk)) in these variations). According to another variation of the embodiment shown in FIG. 4, the preprocessing module can utilize an average of the plurality of pixel values as the predicted pixel value of the specific sub-coding unit, which means any two of the weighted parameters {hk(i, x)} are equal to each other. More particularly, in this variation, each of the weighted parameters {hk(i, x)} is equal to 1/n(K), where the n(K) represents the number of possible values of k within the set K.
FIGS. 5A-5D illustrate some implementation details of multihypothesis prediction that are involved with the method 910 shown in FIG. 2 according to different embodiments of the present invention, where the linear combination mentioned in Step 914 can be regarded as the weighted summation (i.e. ΣkεK(hk(i, x) Ψr(x+vk)) in these embodiments). For better comprehension, the coded blocks CBL, CBUL, CBU, and CBUR can be the same as those shown in FIG. 3, respectively. In addition, the ith sub-block bi is illustrated as an example of the specific sub-coding unit SubCU(t0).
Referring to FIG. 5A, the sub-coding units A, B, C, and D belong to the block under processing (labeled “Processed block” in FIG. 5A) or other coded units (such as CBUL, CBU, CBUR, CBL). More particularly, with regard to the ith sub-block bi shown in FIG. 5A, the sub-coding unit A is the left adjacent sub-coding unit, the sub-coding unit B is the upper adjacent sub-coding unit, the sub-coding unit C is the upper right adjacent sub-coding unit, and the sub-coding unit D is the upper left adjacent sub-coding unit. In this embodiment, the motion vectors {vk} can be obtained from the sub-coding units A, B, C, and/or D shown in FIG. 5A, and therefore, may include the respective motion vectors vA, vB, vc, and/or vD thereof. For example, the motion vectors {vk} may include all of the motion vectors vA, vB, vC, and vD of the sub-coding units A, B, C, and D. In another example, the motion vectors {vk} may include the motion vectors vA, vB, and vC if the sub-coding unit C for the specific sub-coding unit such as the ith sub-block bi exists. In another example, the motion vectors {vk} may include the motion vectors vA, vB, and vD if the sub-coding unit C for the specific sub-coding unit such as the ith sub-block bi does not exist.
Thus, the linear combination mentioned in Step 914 can be the above-disclosed weighted summation ΣkεK(hk(i, x)Ψr(x+vk)) with the motion vectors {vk} including the motion vectors vA, vB, vC, and/or vD. For brevity, the predicted pixel value Ψp can be expressed as follows:

Ψp=Weighted_Sum(Ψr(vA),Ψr(vB),Ψr(vC), and/or Ψr(vD));

where the notation Weighted_Sum represents the weighted summation in the above-disclosed situation.

According to a variation of the embodiment shown in FIG. 5A, the preprocessing module utilizes an average of the plurality of pixel values as the predicted pixel value of the specific sub-coding unit, which means the linear combination mentioned in Step 914 can be regarded as the average. In this situation, any two of the weighted parameters {hk(i, x)} are equal to each other. For brevity, the predicted pixel value Ψp can be expressed as follows:

Ψp=Average(Ψr(vA),Ψr(vB),Ψr(vc), and/or Ψr(vD));

where the notation Average represents the average in this situation. Similar descriptions are not repeated in detail for this variation.

Referring to FIG. 5B, the sub-coding units α1, α2, α3, α4, α5, α6, α7, and α8 belong to the left coded block CBL, the sub-coding units β1, β2, β3, β4, β5, β6, β7, and β8 belong to the upper coded block CBU, and the sub-coding units β9 and δ belong to the upper right coded block CBUR and the upper left coded block CBUL, respectively. More particularly, with regard to the ith sub-block bi shown in FIG. 5B (e.g. a sub-block within the bottom right quarter of the block under processing in this embodiment), the motion vectors {vk} can be obtained from the sub-coding units A, B, C, and/or D of this embodiment, where the sub-coding unit A can be defined as the closest sub-coding unit within the left coded block CBL, the sub-coding unit B can be defined as the closest sub-coding unit within the upper coded block CBU, the sub-coding unit C can be defined as the right adjacent sub-coding unit of the sub-coding unit B, and the sub-coding unit D can be defined as the left adjacent sub-coding unit of the sub-coding unit B. In the situation shown in FIG. 5B, the sub-coding units A, B, C, and D are the sub-coding units α5, β6, β7, and β5, respectively.
In this embodiment, the motion vectors {vk} can be obtained from the sub-coding units A, B, C, and/or D of this embodiment, and therefore, may include the respective motion vectors vA, vB, vC, and/or vD thereof. For example, the motion vectors {vk} may include all of the motion vectors vA, vB, vC, and vD of the sub-coding units A, B, C, and D. In another example, the motion vectors {vk} may include the motion vectors vA, vB, and vC if the sub-coding unit C for the specific sub-coding unit such as the ith sub-block bi exists. In another example, the motion vectors {vk} may include the motion vectors vA, vB, and vD if the sub-coding unit C for the specific sub-coding unit such as the ith sub-block bi does not exist.
Thus, the linear combination mentioned in Step 914 can be the above-disclosed weighted summation ΣkεK(hk(i, x)Ψr(x+vk)) with the motion vectors {vk} including the motion vectors vA, vB, vC, and/or vD. For brevity, the predicted pixel value Ψp can be expressed as follows:

Ψp=Weighted_Sum(Ψr(vA),Ψr(vB),Ψr(vC), and/or Ψr(vD));

where the notation Weighted_Sum represents the weighted summation in the above-disclosed situation. For example, the preprocessing module can determine the size of the specific sub-coding unit to be a transform size regarding video coding of the coding unit, and the size of the sub-coding units such as the sub-blocks shown in FIG. 5B can be the same as the transform size (e.g. 4 by 4, 8 by 8, 16 by 16, and so on).

According to a variation of the embodiment shown in FIG. 5B, the preprocessing module utilizes an average of the plurality of pixel values as the predicted pixel value of the specific sub-coding unit, which means the operation of obtaining the linear combination mentioned in Step 914 can be regarded as an average operation. In this situation, any two of the weighted parameters {hk(i, x)} are equal to each other. For brevity, the predicted pixel value Ψp can be expressed as follows:

Ψp=Average(Ψr(vA),Ψr(vB),Ψr(vC), and/or Ψr(vD));

where the notation Average represents the average in this situation. Similar descriptions are not repeated in detail for this variation.

Referring to FIG. 5C, the definitions of the sub-coding units {α1, α2, α3, α4, α5, α6, α7, α8, β1, β2, β3, β4, β5, β6, β7, β8, β9, δ} are the same as those of the embodiment shown in FIG. 5B. In addition, with regard to the ith sub-block bi shown in FIG. 5C (e.g. a sub-block within the upper right quarter of the block under processing in this embodiment), the motion vectors {vk} can be obtained from the sub-coding units A, B, C, D, E, F and/or Z of this embodiment, where the definitions of the sub-coding units A, B, C, and D are the same as those of the embodiment shown in FIG. 5B, the sub-coding unit E can be defined as the upper adjacent sub-coding unit of the sub-coding unit A, the sub-coding unit F can be defined as the bottom adjacent sub-coding unit of the sub-coding unit A, and the sub-coding unit Z can be defined as the closest sub-coding unit within the upper left coded block CBUL. In the situation shown in FIG. 5C, the sub-coding units A, B, C, D, E, F and Z are the sub-coding units α4, β6, β7, β5, α3, α5, and δ, respectively.
In this embodiment, the motion vectors {vk} can be obtained from the sub-coding units A, B, C, D, E, F and/or Z of this embodiment, and therefore, may include the respective motion vectors vA, vB, vC, vD, vE, vF, and/or vZ thereof. For example, the motion vectors {vk} may include all of the motion vectors vA, vB, vC, vD, vE, vF, and vZ of the sub-coding units A, B, C, D, E, F and Z. In another example, the motion vectors {vk} may include the motion vectors vA, vB, vC, vD, vE, and vF if the sub-coding unit E for the specific sub-coding unit such as the ith sub-block bi exists. In another example, the motion vectors {vk} may include the motion vectors vA, vB, vC, vD, vF, and vZ if the sub-coding unit E for the specific sub-coding unit such as the ith sub-block bi does not exist. In another example, the motion vectors {vk} may include the motion vectors vA, vB, vD, vF, and vZ if the sub-coding units C and E for the specific sub-coding unit such as the ith sub-block bi do not exist.
Thus, the linear combination mentioned in Step 914 can be the above-disclosed weighted summation ΣkεK(hk(i, x)Ψr(x+vk)) with the motion vectors {vk} including the motion vectors vA, vB, vC, vD, vE, vF, and/or vZ. For brevity, the predicted pixel value Ψp can be expressed as follows:

Ψp=Weighted_Sum(Ψr(vA),Ψr(vB),Ψr(vC),Ψr(vD),Ψr(vE),Ψr(vF), and/or Ψr(vZ));

where the notation Weighted_Sum represents the weighted summation in the above-disclosed situation. For example, the preprocessing module can determine the size of the specific sub-coding unit to be a transform size regarding video coding of the coding unit, and the size of the sub-coding units such as the sub-blocks shown in FIG. 5C can be the same as the transform size (e.g. 4 by 4, 8 by 8, 16 by 16, and so on).

According to a variation of the embodiment shown in FIG. 5C, the preprocessing module utilizes an average of the plurality of pixel values as the predicted pixel value of the specific sub-coding unit, which means the operation of obtaining the linear combination mentioned in Step 914 can be regarded as an average operation. In this situation, any two of the weighted parameters {hk(i, x)} are equal to each other. For brevity, the predicted pixel value Ψp can be expressed as follows:

Ψp=Average(Ψr(vA),Ψr(vB),Ψr(vC),Ψr(vD),Ψr(vE),Ψr(vF), and/or Ψr(vZ));

where the notation Average represents the average in this situation. Similar descriptions are not repeated in detail for this variation.

Referring to FIG. 5D, the definitions of the sub-coding units {α1, α2, α3, α4, α5, α6, α7, α8, β1, β2, β3, β4, β5, β6, β7, β8, β9, δ} are the same as those of the embodiment shown in FIG. 5B. In addition, with regard to the ith sub-block bi shown in FIG. 5D (e.g. a sub-block within the bottom right quarter of the block under processing in this embodiment), the motion vectors {vk} can be obtained from the sub-coding units A, B, C, and/or D of this embodiment, where the definitions of the sub-coding units A, B, C, and D are the same as those of the embodiment shown in FIG. 5B. In the situation shown in FIG. 5C, the sub-coding units A, B, C, and D are the sub-coding units α5, β6, β7, and β5, respectively.
In this embodiment, the motion vectors {vk} can be obtained from the sub-coding units A, B, C, and/or D of this embodiment, and therefore, may include the respective motion vectors vA, vB, vC, and/or vD thereof. For example, the motion vectors {vk} may include all of the motion vectors vA, vB, vC, and vD of the sub-coding units A, B, C, and D. In another example, the motion vectors {vk} may include the motion vectors vA, vB, and vC if the sub-coding unit C for the specific sub-coding unit such as the ith sub-block bi exists. In another example, the motion vectors {vk} may include the motion vectors vA, vB, and vD if the sub-coding unit C for the specific sub-coding unit such as the ith sub-block bi does not exist.
In addition, a weighted parameter hk(i, x) of this embodiment may be inversely proportional to a distance between the specific sub-coding unit and the associated one of the other coded units mentioned in Step 912. For example, the weighted parameter hk(i, x) can be rewritten as wk(i) having no dependency of the position x, and the weighted parameter wk(i) is inversely proportional to (dk(i))m (i.e. wk(i)∝1/(dk(i))m), where the notation dk(i) represents the distance between the specific sub-coding unit (e.g. the ith sub-block bi) and the associated other sub-coding/coding unit having the kth reference motion vector vk (e.g. the kth sub-coding unit within the sub-coding units A, B, C, and D), and the notation m represents a positive constant. Thus, the predicted pixel value Ψp can be expressed as follows:

Ψp(i,x)=ΣkεK(wk(i)Ψr(x+vk)); or

Ψp=ΣkεK(wkΨr(vk));

where the motion vectors {vk} may include the motion vectors vA, vB, vC, and/or vD. In the situation shown in FIG. 5D, the motion vectors {vk} includes the motion vectors vA, vB, and vC, and the notations dist_w, dist_h, and dist_h′ represent the distances dA(i), dB(i), and dC(i), respectively. As a result, the predicted pixel value Ψp can be expressed as follows:

Ψp=wAΨr(vA)+wBΨr(vB)+wCΨr(vC);

where wA∝1/(dist_w)m, wB∝1/(dist_h)m, and wC∝1/(dist_h′)m.

In some variations of the embodiments shown in 5A-5D, the preprocessing module can screen a set of motion vectors by discarding at least one extreme motion vector in motion information of multiple coded units, and more particularly, by discarding at least one extreme motion vector of the set of motion vectors, in order to select a remaining portion of the set of motion vectors as the motion information for deriving the predicted pixel value (e.g. the motion information of the first set of coded units). For example, the aforementioned at least one extreme motion vector may comprise one or more motion vectors that are much different from others of the set of motion vectors, with the lengths and/or the directions thereof being considered.
According to some variations of the embodiments shown in FIGS. 5A-5D, the preprocessing module may selectively operate in any of a plurality of modes comprising Modes 1, 2, 3, and 4, where the respective operations of Modes 1, 2, 3, and 4 can be the same as or similar to those disclosed in the embodiments shown in FIGS. 5A-5D, respectively. For example, in Mode 1, the preprocessing module can operate according to the same method of the embodiment shown in FIG. 5A, while in another mode such as any of Modes 2, 3, and 4, the preprocessing module can operate according to the same method of the associated embodiment such as the corresponding embodiment within those shown in FIGS. 5B-5D, respectively. In addition, the aforementioned Modes 1, 2, and 3 allow the apparatus 100 to process with ease in comparison of some other mode(s) and are helpful on increasing the overall processing speed of the apparatus 100, and therefore, can be referred to as simplified modes.
According to a variation of any of the embodiments shown in FIGS. 5A-5D, in Step 912, the preprocessing module can divide the coding unit into the plurality of sub-coding units based upon at least one mode of at least one neighboring coding unit, such as Modes 1, 2, 3, and/or 4 of one or more of the coded blocks CBL, CBU, CBUR, and CBUL. According to another variation of any of the embodiments shown in FIGS. 5A-5D, in Step 912, the preprocessing module can divide the coding unit into the plurality of sub-coding units based upon contents of at least one neighboring coding unit such as one or more of the coded blocks CBL, CBU, CBUR, and CBUL.
FIGS. 6A-6B illustrate exemplary sources for obtaining motion information that are involved with the method 910 shown in FIG. 2 according to different embodiments of the present invention. For better comprehension, the coded blocks CBL, CBUL, CBU, and CBUR can be the same as those shown in FIG. 3, respectively.
In this embodiment, in a situation where the size of the specific sub-coding unit SubCU(t0) is extended to the size of the coding unit CU(t0), dividing/partitioning the coding unit CU(t0) is not required in Step 912. Thus, in Step 912, the preprocessing module mentioned above can perform motion vector prediction of the coding unit CU(t0), and more particularly, obtain a plurality of motion vectors, such as the motion vectors {vk} disclosed above, for multihypothesis motion compensation of the coding unit CU(t0) from a plurality of other coded units such as at least a portion of the coded blocks {CB} (e.g. one or more of the coded blocks CBL, CBUL, CBU, and CBUR). In addition, in Step 914, the preprocessing module can perform multihypothesis motion compensation on the coding unit CU(t0) according to motion information such as the plurality of motion vectors {vk}, and more particularly, utilize a linear combination of a plurality of pixel values of the plurality of other coding units as a predicted pixel value of the coding unit, such as the predicted pixel value Ψp(x) having no need to use the index i. Similarly, the predicted pixel value Ψp(x) can be expressed as follows:

Ψp(x)=ΣkεK(hk(x)Ψr(x+vk)).

In practice, the plurality of modes may further comprise some skip modes respectively corresponding to different motion block sizes (e.g. 16 by 16, 32 by 32, etc.). According to this embodiment, the notation A can be utilized for representing a sub-coding/coding unit comprising at least a portion (e.g. a portion or all) of the coded block CBL, the notation D can be utilized for representing a sub-coding/coding unit comprising at least a portion (e.g. a portion or all) of the coded block CBUL, the notation B can be utilized for representing a sub-coding/coding unit comprising at least a portion (e.g. a portion or all) of the coded block CBu, and the notation CSIZE such as C16, C32, etc. can be utilized for representing a sub-coding/coding unit comprising at least a portion (e.g. a portion or all) of the coded block CBUR, where the suffix SIZE of the notation CSIZE represents the size of the coding unit CU(t0) such as the block under processing (labeled “Processed block” in FIGS. 6A-6B). For example, in a situation where the block under processing includes (32*32) pixels, the sub-coding/coding unit CSIZE can be the sub-coding/coding unit C32 shown in FIG. 6A. In another example, in a situation where the block under processing includes (16*16) pixels, the sub-coding/coding unit CSIZE can be the sub-coding/coding unit C16 shown in FIG. 6B. Thus, the location of the sub-coding/coding unit CSIZE is dependent on the motion block size.
According to this embodiment, the motion vectors {vk} may include all of the motion vectors vA, vB, vC, and vD of the sub-coding/coding unit units A, B, CSIZE, and D. Thus, the linear combination of this embodiment can be the weighted summation ΣkεK(hk(x)Ψr(x+vk)) with the motion vectors {vk} including the motion vectors vA, vB, vC, and vD. For brevity, the predicted pixel value Ψp can be expressed as follows:

Ψp=Weighted_Sum(Ψr(vA),Ψr(vB),Ψr(vC),Ψr(vD));

where the notation Weighted_Sum represents the weighted summation in the above-disclosed situation.

According to a variation of the embodiment shown in FIGS. 6A-6B, the preprocessing module utilizes an average of the plurality of pixel values of the plurality of other coding units as the predicted pixel value of the coding unit, which means the linear combination mentioned above can be regarded as the average. In this situation, any two of the weighted parameters {hk(x)} are equal to each other. For brevity, the predicted pixel value Ψp can be expressed as follows:

Ψp=Average(Ψr(vA),Ψr(vB),Ψr(vC),Ψr(vD));

where the notation Average represents the average in this situation. Similar descriptions are not repeated in detail for this variation.

FIGS. 7A-7B respectively illustrate temporal and spatial motion vectors (MVs) involved with the method 910 shown in FIG. 2 according to different embodiments of the present invention. For better comprehension, the coded blocks CBL, CBUL, CBU, and CBUR can be the same as those shown in FIG. 3, respectively. In addition, the ith sub-block bi is illustrated as an example of the specific sub-coding unit SubCU(t0).
In the embodiment shown in FIG. 7A, the motion vectors {vk} mentioned in Step 912 may comprise one or more temporal motion vectors {vT, k} with respect to a window enclosing the specific sub-coding unit SubCU(t0) such as the ith sub-block bi shown in FIG. 7A, where the window may have a predetermined size. In the embodiment shown in FIG. 7B, the motion vectors {vk} mentioned in Step 912 may comprise one or more spatial motion vectors {vS, k}, such as that of the coded block CBU shown in FIG. 7B. According to some variations of the embodiments shown in FIGS. 7A-7B, the motion vectors {vk} mentioned in Step 912 may comprise the temporal motion vectors {vT, k} and the spatial motion vectors {vS, k}. Similar descriptions are not repeated in detail for these embodiments/variations.
FIGS. 8A-8C illustrate exemplary sources for obtaining motion vectors that are involved with the method 910 shown in FIG. 2 according to some embodiments of the present invention. For better comprehension, the coded blocks CBL, CBUL, CBU, and CBUR can be the same as those shown in FIG. 3, respectively. In addition, the ith sub-block bi is illustrated as an example of the specific sub-coding unit SubCU(t0).
Referring to FIG. 8A, the temporal motion vectors {vT, k} disclosed above may comprise a temporal motion vector vT0 that is typically obtained from a co-located sub-coding unit of another frame, such as a co-located sub-block T with respect to the ith sub-block bi shown in FIG. 8A. Thus, the temporal motion vector vT0 can be regarded as a co-located motion vector. Referring to FIG. 8B, the spatial motion vectors {vS, k} disclosed above may comprise at least a portion (e.g. a portion or all) of the motion vectors vA, vB, vC, vD, vE, vF, and vZ of the sub-coding units A, B, C, D, E, F and Z.
Thus, the linear combination mentioned in Step 914 can be the above-disclosed weighted summation ΣkεK(hk(i, x)Ψr(x+vk)) with the motion vectors {vk} comprising both the temporal motion vector vT0 and the motion vectors vA, vB, vC, vD, vE, vF, and/or vZ. For example, in a situation where the motion vectors {vk} comprise the temporal motion vector vT0 and the motion vectors vA, vB, vC, vD, vE, vF, and vZ, the predicted pixel value Ψp can be expressed as follows:

Ψr=Weighted_Sum(Ψr(vA),Ψr(vB),Ψr(vc),Ψr(vD),Ψr(vE),Ψr(vF),Ψr(vZ),Ψr(vT0));

where the notation Weighted_Sum represents the weighted summation in the above-disclosed situation. Similar descriptions are not repeated in detail for this embodiment.

According to a variation of the embodiment shown in FIGS. 8A-8B, the preprocessing module utilizes an average of the plurality of pixel values as the predicted pixel value of the specific sub-coding unit, which means the linear combination mentioned in Step 914 can be regarded as the average. In this situation, any two of the weighted parameters {hk(i, x)} are equal to each other. For brevity, the predicted pixel value Ψp can be expressed as follows:

Ψr=Average(Ψr(vA),Ψr(vB),Ψr(vC),Ψr(vD),Ψr(vE),Ψr(vF),Ψr(vZ),Ψr(vT0));

where the notation Average represents the average in this situation. Similar descriptions are not repeated in detail for this variation.

Referring to FIG. 8C, the temporal motion vectors {vT, k} disclosed above may comprise the temporal motion vector vT0 disclosed above and some other temporal motion vectors vTUL, vTU, vTUR, vTL, vTR, vTDL, vTD, and vTDR that are obtained from nearly co-located sub-coding units of another frame, such as those adjacent to the sub-block T having the temporal motion vector vT0, i.e. the sub-blocks TUL, TU, TUR, TL, TR, TDL, TD, and TDR shown in FIG. 8C, respectively. In addition, the spatial motion vectors {vS, k} disclosed above may comprise at least a portion (e.g. a portion or all) of the motion vectors vA, vB, vC, vD, vE, vF, and vZ of the sub-coding units A, B, C, D, E, F and Z shown in FIG. 8B.
Thus, the linear combination mentioned in Step 914 can be the above-disclosed weighted summation ΣkεK(hk(i, x)Ψr(x+vk)) with the motion vectors {vk} comprising both the temporal motion vectors vT0, vTUL, vTU, vTUR, vTL, vTR, vTDL, vTD, and vTDR and the motion vectors vA, vB, vC, vD, vE, vF, and/or vZ. For example, in a situation where the motion vectors {vk} comprise the temporal motion vectors vT0, vTUL, vTU, vTUR, vTL, vTR, vTDL, vTD, and vTDR and the motion vectors vA, vB, vC, vD, vE, vF, and vZ, the predicted pixel value Ψp can be expressed as follows:

Ψp=Weighted_Sum(Ψr(vA),Ψr(vB),Ψr(vC),Ψr(vD),Ψr(vE),Ψr(vF),Ψr(vZ),Ψr(vT0),Ψr(vTUL),Ψr(vTU),Ψr(vTUR),Ψr(vTL),Ψr(vTR),Ψr(vTDL),Ψr(vTD),Ψr(vTDR));

where the notation Weighted_Sum represents the weighted summation in the above-disclosed situation. Similar descriptions are not repeated in detail for this embodiment.

According to a variation of the embodiment shown in FIG. 8C, the preprocessing module utilizes an average of the plurality of pixel values as the predicted pixel value of the specific sub-coding unit, which means the linear combination mentioned in Step 914 can be regarded as the average. In this situation, any two of the weighted parameters {hk(i, x)} are equal to each other. For brevity, the predicted pixel value Ψp can be expressed as follows:

Ψp=Average(Ψr(vA),Ψr(vB),Ψr(vC),Ψr(vD),Ψr(vE),Ψr(vF),Ψr(vz),Ψr(vT0), Ψr(vTUL),Ψr(vTU),Ψr(vTUR),Ψr(vTL),Ψr(vTR),Ψr(vTDL),Ψr(vTD),Ψr(vTDR));

where the notation Average represents the average in this situation. Similar descriptions are not repeated in detail for this variation.

According to an embodiment, such as a variation of any of the embodiments/variations disclosed above, the preprocessing module can dynamically select a set of motion vectors from a plurality of sets of motion vectors (which can be regarded as candidate motion vectors), and utilize the selected set of motion vectors as the plurality of motion vectors {vk}. More particularly, the preprocessing module dynamically selects the aforementioned set of motion vectors from the plurality of sets of motion vectors and utilizes the selected set of motion vectors as the motion information of the plurality of other coded units mentioned in Step 912 (e.g. the first set of coded units) based on an explicit flag, and utilizes the selected set of motion vectors to derive the predicted pixel value of the specific sub-coding unit. For example, the plurality of sets of motion vectors may comprise a first set of motion vectors such as the temporal motion vectors {vT, k} disclosed above, and further comprise a second set of motion vectors such as the spatial motion vectors {vS, k} disclosed above. In practice, the preprocessing module can perform multihypothesis prediction based upon a flag (e.g. the explicit flag) dynamically indicating the set being selected. Similar descriptions are not repeated in detail for this embodiment.
According to another embodiment, such as a variation of any of the embodiments/variations disclosed above, the preprocessing module can obtain at least one motion vector of the coding unit CU(t0) by performing motion estimation, for use of performing rate-distortion optimization, in order to obtain the predicted pixel value of the specific sub-coding unit. For example, in Step 912, the preprocessing module obtains at least one portion of the plurality of motion vectors {vk} for multihypothesis motion compensation of the specific sub-coding unit SubCU(t0) by performing motion estimation. In addition, in Step 914, the preprocessing module can further utilize a linear combination of a plurality of pixel values {Ψr} of sub-coding/coding units associated to the plurality of motion vectors {vk} as the predicted pixel value Ψp of the specific sub-coding unit SubCU(t0). For example, in a situation where the specific predicted pixel having the predicted pixel value Ψp is located at the position x (e.g. a vector indicating the position, such as a two dimensional vector on the image plane of the current frame F(t0)), the predicted pixel value Ψp can be rewritten as Ψp(x), and the predicted pixel value Ψp(x) can be express as follows:

Ψp(x)=ΣkεK(hk(x)Ψr(x+vk))+h0(x)Ψr(x+v0);

where the index k may vary within the set K, with the notation hk(x) representing the weighted parameter associated to the index k, and the estimated motion vector v0 is the motion vector to be estimated during motion estimation, with the notation h0(x) representing the weighted parameter associated to the suffix 0 of the estimated motion vector v0.

During the rate-distortion optimization mentioned above, the preprocessing module may calculate a distortion indicator IDIST, where the distortion indicator typically represents the difference between the original partial image of the specific sub-coding unit SubCU(t0) and the reconstructed partial image of the specific sub-coding unit SubCU(t0) after multihypothesis prediction with respect to a possible status (e.g. the length and the angle) of the estimated motion vector v0. For example, the distortion indicator IDIST and the associated motion vector difference MVD can be express as follows:

IDIST=|ΨREAL(x)−ΣkεK(hk(x)Ψr(x+vk))−h0(x)Ψr(x+v0)|; and

MVD=v0−MVP;

where the notation ΨREAL(x) represents the real pixel value of the current pixel under consideration, and the notation MVP represents the motion vector predictor. More particularly, within the above equations, the upper one for the distortion indicator IDIST can be rearranged as follows:





  
    
      
        
          I
          DIST
        
        =
        
        ⁢
        
          
          
            
              
                Ψ
                REAL
              
              ⁡
              
                (
                x
                )
              
            
            -
            
              
                Σ
                
                  k
                  ∈
                  K
                
              
              ⁡
              
                (
                
                  
                    
                      h
                      k
                    
                    ⁡
                    
                      (
                      x
                      )
                    
                  
                  ⁢
                  
                    
                      Ψ
                      r
                    
                    ⁡
                    
                      (
                      
                        x
                        +
                        
                          v
                          k
                        
                      
                      )
                    
                  
                
                )
              
            
            -
            
              
                
                  h
                  0
                
                ⁡
                
                  (
                  x
                  )
                
              
              ⁢
              
                
                  Ψ
                  r
                
                ⁡
                
                  (
                  
                    x
                    +
                    
                      v
                      0
                    
                  
                  )
                
              
            
          
          
        
      
    
  
  
    
      
        =
        
        ⁢
        
          
          
            
              (
              
                
                  
                    Ψ
                    REAL
                  
                  ⁡
                  
                    (
                    x
                    )
                  
                
                -
                
                  
                    Σ
                    
                      k
                      ∈
                      K
                    
                  
                  ⁡
                  
                    (
                    
                      
                        
                          h
                          k
                        
                        ⁡
                        
                          (
                          x
                          )
                        
                      
                      ⁢
                      
                        
                          Ψ
                          r
                        
                        ⁡
                        
                          (
                          
                            x
                            +
                            
                              v
                              k
                            
                          
                          )
                        
                      
                    
                    )
                  
                
              
              )
            
            -
            
              
                
                  h
                  0
                
                ⁡
                
                  (
                  x
                  )
                
              
              ⁢
              
                
                  Ψ
                  r
                
                ⁡
                
                  (
                  
                    x
                    +
                    
                      v
                      0
                    
                  
                  )
                
              
            
          
          
        
      
    
  
  
    
      
        =
        
        ⁢
        
          
            
              h
              0
            
            ⁡
            
              (
              x
              )
            
          
          ⁢
          
            
            
              
                (
                
                  
                    
                      Ψ
                      REAL
                    
                    ⁡
                    
                      (
                      x
                      )
                    
                  
                  -
                  
                    
                      Σ
                      
                        k
                        ∈
                        K
                      
                    
                    ⁢
                    
                      (
                      
                        
                          
                            h
                            k
                          
                          ⁡
                          
                            (
                            x
                            )
                          
                        
                        ⁢
                        
                          
                            Ψ
                            r
                          
                          ⁡
                          
                            (
                            
                              x
                              +
                              
                                v
                                k
                              
                            
                            )
                          
                        
                      
                      )
                    
                  
                
                )
              
              
                
                  
                    h
                    0
                  
                  ⁡
                  
                    (
                    x
                    )
                  
                
                -
                
                  
                    Ψ
                    r
                  
                  ⁡
                  
                    (
                    
                      x
                      +
                      
                        v
                        0
                      
                    
                    )
                  
                
              
            
            
          
        
      
    
  
  
    
      
        
          =
          
          ⁢
          
            
              
                h
                0
              
              ⁡
              
                (
                x
                )
              
            
            ⁢
            
              
              
                
                  
                    Γ
                    REAL
                  
                  ⁡
                  
                    (
                    x
                    )
                  
                
                -
                
                  
                    Ψ
                    r
                  
                  ⁡
                  
                    (
                    
                      x
                      +
                      
                        v
                        0
                      
                    
                    )
                  
                
              
              
            
          
        
        ;
      
    
  




where ΓREAL(x)=(ΨREAL(x)−ΣkεK(hk(x)Ψr(x+vk)))/h0(x). In the above equation, the term ΓREAL(x) and the term (ΨREAL(x)−ΣkεK(hk(x)Ψr(x+vk))) are independent of the estimated motion vector v0, and therefore, at least one of these terms, such as the term ΓREAL(x) and/or the term (ΨREAL(x)−ΣkεK(hk(x)Ψr(x+vk))), can be calculated in advance and temporarily stored for being accessed in order to increase the processing speed of the apparatus 100 according to this embodiment.

According to this embodiment, the preprocessing module of this embodiment can optimize the estimated motion vector v0 by finding the best status corresponding to the minimum Lagrange function of the distortion indicator IDIST and the bits used to encode the motion vector difference MVD, among other possible statuses of the estimated motion vector v0. Thus, the linear combination of this embodiment can be the weighted summation ΣkεK(hk(x)Ψr(x+vk))+h0(x)Ψr(x+v0) with the estimated motion vector v0 having been obtained, and the preprocessing module can utilize the weighted summation ΣkεK(hk(x)Ψr(x+vk))+h0(x)Ψr(x+v0) as the predicted pixel value Ψp of the specific sub-coding unit SubCU(t0). Similar descriptions are not repeated in detail for this embodiment.
FIG. 9 illustrates some implementation details involved with the method 910 shown in FIG. 2 according to an embodiment of the present invention, where the preprocessing module can perform variable partition multihypothesis prediction, and more particularly, can adaptively determine the partition of the coding unit CU(t0) in response to the partition of at least one neighboring coding unit. For better comprehension, the coded blocks CBL, CBUL, CBU, and CBUR can be the same as those shown in FIG. 3, respectively.
According to this embodiment, in Step 912, the preprocessing module can divide the coding unit CU(t0) such as the block under processing (labeled “Processed block” in FIG. 9) into the plurality of sub-coding units {SubCU(t0)} based upon the partition of at least one neighboring coding unit (e.g. one or more of the coded blocks CBL, CBUL, CBU, and CBUR). For example, the plurality of sub-coding units {SubCU(t0)} may comprise the sub-blocks b11, b12, b13, b21, b22, b23, b31, b32, b33, b41, b42, and b43, whose sizes correspond to the partition of the neighboring coded blocks such as the coded blocks CBL, and CBU, and more particularly, the associated sizes of some sub-blocks of these neighboring coded blocks. In the situation shown in FIG. 9, the sub-blocks of these neighboring coded blocks are those adjacent to the block under processing, where the sub-blocks are shaded and illustrated with different patterns, respectively. Similar descriptions are not repeated in detail for this embodiment.
FIG. 10 illustrates some implementation details involved with the method 910 shown in FIG. 2 according to another embodiment of the present invention, where the preprocessing module can adaptively determine the blending weights (e.g. the weighted parameters {hk(i, x)} disclosed above) according to the contents of at least one neighboring coding unit. For better comprehension, the coded blocks CBL, CBUL, CBU, and CBUR can be the same as those shown in FIG. 3, respectively. In addition, the sub-block SB is illustrated as an example of the specific sub-coding unit SubCU(t0).
For example, the motion vectors {vk} may comprise the motion vectors vA, vB, and vC of the sub-coding units A, B, and C, where the sub-coding unit A belongs to the left coded block CBL, and the sub-coding units B and C belong to the upper coded block CBU. During the processing of generating the weighted summation ΣkεK(hk(i, x)Ψr(x+vk)) (e.g. the weighted summation Weighted_Sum(Ψr(vA), Ψr(vB), Ψr(vC)) in the situation shown in FIG. 10), when the sub-coding units B and C are texture sub-coding units (e.g. texture sub-blocks) and the sub-coding unit A is a non-texture sub-coding unit (e.g. a non-texture sub-block), the preprocessing module can adaptively determine the weighted parameters hB(i, x) and hC(i, x) associated to the motion vectors vB and vC of the sub-coding units B and C to be greater than the weighted parameter hA(i, x) associated to the motion vector vA of the sub-coding unit A, respectively. Similar descriptions are not repeated in detail for this embodiment.
FIG. 11 illustrates some implementation details involved with the method 910 shown in FIG. 2 according to an embodiment of the present invention. According to this embodiment, the preprocessing module still divides the coding unit CU(t0) (e.g. the coding unit under consideration) into the plurality of sub-coding units such as the sub-coding units {SubCU(t0)} and performs prediction on each of the sub-coding units {SubCU(t0)} in Step 912. However, when/before obtaining the motion information such as the motion vectors {vk} disclosed above, the preprocessing module can designate a motion vector (e.g. a reference motion vector) for each sub-coding unit so it can be later referenced by other sub-coding unit(s)/coding unit(s). The rule for motion vector designation can be arbitrary as it just needs to be agreed and complied by both the encoders and decoders. Some predetermined rule for motion vector designation include motion vector predictor defined in H.264, motion vector prediction defined in H.264 but with motion vector scaling, padding from the left block, padding from the upper block, and padding from left or upper block. According to an embodiment of padding from left or upper block, the preprocessing module designates a motion vector utilizing the motion vector of a sub-coding unit of another coding unit (except for the coding unit CU(t0) under consideration), such as a coded sub-coding unit of an adjacent coding unit CUADJ(t0) that is adjacent to the coding unit CU(t0). More particularly, with regard to the specific sub-coding unit SubCU(t0), the sub-coding unit of the other coding unit (e.g. the coding unit CUADJ(t0)) is the closest sub-coding unit within the other coding unit, and the preprocessing module can utilize the motion vector of the closest sub-coding unit within the other coding unit (e.g. the coding unit CUADJ(t0)) as the motion vector designated for the specific sub-coding unit SubCU(t0). The motion vector designated to a coding unit or a sub-coding unit is mainly used as a reference motion vector for other coding units or sub-coding units, where it is not necessary to be used for motion prediction.
As shown in FIG. 11, with regard to the coding unit CU(t0) such as the block under processing (labeled “Processed block” in FIG. 11), the adjacent coding units {CUADJ(t0)} that are involved in this embodiment may comprise at least a portion of the left coded block CBL, the upper coded block CBU, the upper right coded block CBUR, and the upper left coded block CBUL, where the sub-coding units in these coded blocks CBL, CBU, CBUR, and CBUL can be regarded as sub-blocks. For better comprehension, the motion vectors y1, y2, y3, y4, y5, y6, y7, and y8 of the rightmost column of sub-coding units within the left coded block CBL are labeled on the rightmost column of sub-coding units, respectively. Similarly, the motion vectors x1, x2, x3, x4, x5, x6, x7, and x8 of the bottommost row of sub-coding units within the upper coded block CBU are labeled on the bottommost row of sub-coding units, respectively. In addition, the motion vector d of the bottom right sub-coding unit within the upper left coded block CBUL and the motion vector x9 of the bottom left sub-coding unit within the upper right coded block CBUR are labeled thereon, respectively.
According to this embodiment, the preprocessing module receives the coding unit CU(t0) comprising a plurality of sub-coding units {SubCU(t0)} and parses the data of the coding unit CU(t0), and designates a reference motion vector of the specific sub-coding unit SubCU(t0) of the sub-coding units {SubCU(t0)} according to a predetermined rule, where the reference motion vector is utilized for reference by at least one other sub-coding unit, and is not utilized for motion vector prediction of the specific sub-coding unit SubCU(t0). With reference motion vectors being utilizing for reference, the preprocessing module can operate rapidly, having no need to wait for completion of any complicated calculation regarding the real motion vector of the specific sub-coding unit SubCU(t0). In practice, the preprocessing module can designate this motion vector (i.e. the reference motion vector mentioned above) to be a motion vector of at least one portion of an adjacent coding unit. More particularly, the at least one portion of the adjacent coding unit can be a portion that is most close to the specific sub-coding unit within the neighboring coding unit.
For example, suppose that the specific sub-coding unit SubCU(t0) represents the jth sub-block of a certain row of sub-blocks in the block under processing (e.g. the processed block shown in FIG. 11), where j may vary from 1 to 8. In a first designation rule such as “vertical designation”, the preprocessing module can utilize the motion vector x, of the closest sub-coding unit within the upper coded block CBU as the reference motion vector of the specific sub-coding unit SubCU(t0).
In another example, suppose that the specific sub-coding unit SubCU(t0) represents the jth sub-block of a certain column of sub-blocks in the block under processing (e.g. the processed block shown in FIG. 11), where j may vary from 1 to 8. In a second designation rule such as “horizontal designation”, the preprocessing module utilizes the motion vector yj of the closest sub-coding unit within the left coded block CBL as the reference motion vector of the specific sub-coding unit SubCU(t0).
In another example, a third designation rule such as “hybrid designation” can be selected for determining the reference motion vector. Suppose that the specific sub-coding unit SubCU(t0) represents the jth sub-block of the fourth/eighth row of sub-blocks in the block under processing (labeled “Processed block” in FIG. 11), where j may vary from 1 to 8. Referring to FIG. 11, as illustrated with the arrow pointing to the jth sub-block of the fourth/eighth row of sub-blocks, the preprocessing module utilizes the motion vector xj of the closest sub-coding unit within the upper coded block CBU as the reference motion vector of the specific sub-coding unit SubCU(t0). In addition, suppose that the specific sub-coding unit SubCU(t0) represents the jth sub-block of the fourth/eighth column of sub-blocks in the block under processing (labeled “Processed block” in FIG. 11), where j may vary from 1 to 7 except for 4. Referring to FIG. 11, as illustrated with the arrow pointing to the jth sub-block of the fourth/eighth column of sub-blocks, the preprocessing module utilizes the motion vector yj of the closest sub-coding unit within the left coded block CBL as the reference motion vector of the specific sub-coding unit SubCU(t0). In this embodiment, the reference motion vectors of the remaining sub-coding units within the coding unit CU(t0) can be obtained by utilizing the same or similar method in any of the embodiments/variations disclosed above. Similar descriptions are not repeated in detail for this embodiment.
Please note that, in some embodiments such as some variations of the above embodiment, the preprocessing module can control the operations disclosed above by utilizing a flag, and more particularly, by explicitly sending a flag. For example, an encoder implemented according to one of these embodiments may send a flag indicating whether the designation rule to be applied is one of “vertical designation” and “horizontal designation” (and even “hybrid designation”), so by receiving a bitstream carrying the flag, an associated decoder can be notified of the designation rule to be applied.
In addition, in some embodiments, various motion vector designation methods disclosed above (e.g. “vertical designation” and “horizontal designation”, and even “hybrid designation”) can be utilized for performing local motion vector derivation. For example, in a situation where “vertical designation” is applied, the motion vectors of each row of sub-coding units are derived from the corresponding locations within the upper coded block CBU (e.g. the closest sub-coding unit within the upper coded block CBU), respectively.
It is an advantage of the present invention that the present invention methods and apparatuses can properly perform localized multihypothesis prediction, and more particularly, can properly perform multihypothesis motion compensation on the sub-coding units of the coding unit under consideration with ease. As a result of utilizing the present invention method and apparatus, both the motion vector prediction operations and the multihypothesis motion compensation operations can be performed without introducing any related art problem such as low coding efficiency.
Those skilled in the art will readily observe that numerous modifications and alterations of the device and method may be made while retaining the teachings of the invention. Accordingly, the above disclosure should be construed as limited only by the metes and bounds of the appended claims.

## Claims

1. A method for performing localized multihypothesis prediction during video coding of a coding unit, the method comprising:
dividing the coding unit into a plurality of sub-coding units; and
processing the sub-coding units, wherein the step of processing the sub-coding units further comprises:
obtaining motion information of a first set of coded units, wherein the coded unit are motion-compensated and the motion information comprises a first motion vector and a second motion vector corresponding to sub-coding units of other coding units within a current frame where the coding unit is located;
obtaining a plurality of pixel values from the motion information of the first set of coded units;
utilizing a linear combination of the plurality of pixel values as a predicted pixel value of a specific sub-coding unit of the sub-coding units; and
deriving a predicted pixel value of another sub-coding unit in the coding unit by utilizing motion information of a second set of coded units, wherein the second set of coded unit comprises at least one coded unit that is not in the first set of coded units.

2. The method of claim 1, wherein the step of utilizing the linear combination of the plurality of pixel values as the predicted pixel value of the specific sub-coding unit further comprises:
utilizing a weighted summation of the plurality of pixel values as the predicted pixel value of the specific sub-coding unit.

3. The method of claim 2, wherein the step of utilizing the linear combination of the plurality of pixel values as the predicted pixel value of the specific sub-coding unit further comprises:
performing optimum Wiener filtering on the plurality of pixel values with respect to a real pixel value of a current pixel, in order to adjust respective weighted parameters for the plurality of pixel values and to generate the weighted summation.

4. The method of claim 2, wherein the step of utilizing the linear combination of the plurality of pixel values as the predicted pixel value of the specific sub-coding unit further comprises:
determining respective weighted parameters for the plurality of pixel values according to contents of at least one neighboring coding unit, in order to generate the weighted summation.

5. The method of claim 2, wherein the step of utilizing the linear combination of the plurality of pixel value as the predicted pixel value of the specific sub-coding unit further comprises:
determining respective weighted parameters for the plurality of pixel values according to contents of the first set of coded units, in order to generate the weighted summation.

6. The method of claim 2, wherein the step of utilizing the linear combination of the plurality of pixel value as the predicted pixel value of the specific sub-coding unit further comprises:
determining respective weighted parameters for the plurality of pixel values by offline training, in order to generate the weighted summation.

7. The method of claim 2, wherein the step of utilizing the linear combination of the plurality of pixel value as the predicted pixel value of the specific sub-coding unit further comprises:
determining respective weighted parameters for the plurality of pixel values by online training, in order to generate the weighted summation.

8. The method of claim 1, wherein the motion information of the first set of coded units comprises at least one or a combination of motion vector, reference frame index, and prediction direction.

9. The method of claim 1, wherein the step of processing the sub-coding units further comprises:
screening a set of motion vectors by discarding at least one extreme motion vector, in order to select a remaining portion of the set of motion vectors as the motion information of the first set of coded units.

10. The method of claim 1, wherein the step of processing the sub-coding units further comprises:
dynamically selecting a set of motion vectors from a plurality of sets of motion vectors as the motion information of the first set of coded units, and utilizing the selected set of motion vectors to derive the predicted pixel value of the specific sub-coding unit.

11. The method of claim 10, wherein the plurality of sets of motion vectors comprises a first set of motion vectors that are temporal motion vectors, and further comprises a second set of motion vectors that are spatial motion vectors.

12. The method of claim 1, wherein the step of processing the sub-coding units further comprises:
dynamically selecting a set of motion vectors from a plurality of sets of motion vectors and utilizing the selected set of motion vectors as the motion information of the first set of coded units based on an explicit flag.

13. The method of claim 1, wherein the step of dividing the coding unit into the plurality of sub-coding units further comprises:
determining a size of the specific sub-coding unit to be a transform size regarding video coding of the coding unit.

14. The method of claim 1, wherein the step of dividing the coding unit into the plurality of sub-coding units further comprises:
dividing the coding unit into the plurality of sub-coding units based upon at least one mode of at least one neighboring coding unit.

15. The method of claim 1, wherein the step of dividing the coding unit into the plurality of sub-coding units further comprises:
dividing the coding unit into the plurality of sub-coding units based upon contents/partition of at least one neighboring coding unit.

16. The method of claim 1, wherein the coded units comprises at least one spatially coded sub-coding/coding unit and/or at least one temporally coded sub-coding/coding unit.

17. The method of claim 1, wherein the step of processing the sub-coding units further comprises:
obtaining at least one motion vector of the coding unit by performing motion estimation, for use of performing rate-distortion optimization, in order to obtain the predicted pixel value of the specific sub-coding unit.

18. The method of claim 1, wherein the step of processing the sub-coding units further comprises:
when obtaining the motion information, designating a reference motion vector for the sub-coding unit.

19. The method of claim 1, wherein the motion information of the coding unit further comprises a third motion vector corresponding to a sub-coding unit of another coding unit located within another frame that is not the current frame where the coding unit is located.

20. The method of claim 18, wherein the step of designating the reference motion vector further comprises:
designating the reference motion vector utilizing a motion vector of a sub-coding unit of another coding unit.

21. The method of claim 20, wherein the other coding unit is an adjacent coding unit that is adjacent to the coding unit.

22. The method of claim 20, further comprises:
utilizing the motion vector of a closest sub-coding unit within the other coding unit as the reference motion vector designated for the specific sub-coding unit.

23. An apparatus for performing localized multihypothesis prediction during video coding of a coding unit, the apparatus comprising:
a processing circuit arranged to perform video coding on the coding unit, wherein the processing circuit comprises:
a preprocessing module arranged to divide the coding unit into a plurality of sub-coding units and to process the sub-coding units, wherein the preprocessing module obtains motion information of a first set of coded units, wherein the coded units are motion-compensated and the motion information comprises a first motion vector and a second motion vector corresponding to sub-coding units of other coding units within a current frame where the coding unit is located, and performs multihypothesis motion compensation on a specific sub-coding unit of the sub-coding unit according to the motion information, and the preprocessing module utilizes a linear combination of a plurality of pixel values obtained from the motion information of the first set of coded units as a predicted pixel value of the specific sub-coding unit; and
at least one coding module arranged to perform video coding on the coding unit based upon the multihypothesis motion compensation performed by the preprocessing module;
wherein the preprocessing module derives a predicted pixel value of another sub-coding unit in the coding unit by utilizing motion information of a second set of coded units comprising at least one coded unit that is not in the first set of coded units, the second set of coded units are motion-compensated coding units.

24. The apparatus of claim 23, wherein the preprocessing module utilizes a weighted summation of the plurality of pixel values as the predicted pixel value of the specific sub-coding unit.

25. The apparatus of claim 24, wherein the preprocessing module performs optimum Wiener filtering on the plurality of pixel values with respect to a real pixel value of a current pixel, in order to adjust respective weighted parameters for the plurality of pixel values and to generate the weighted summation.

26. The apparatus of claim 24, wherein the preprocessing module determines respective weighted parameters for the plurality of pixel values according to contents of at least one neighboring coding unit, in order to generate the weighted summation.

27. The apparatus of claim 24, wherein the preprocessing module determines respective weighted parameters for the plurality of pixel values according to contents of the first set of coded units, in order to generate the weighted summation.

28. The apparatus of claim 24, wherein the preprocessing module determines respective weighted parameters for the plurality of pixel values by offline training, in order to generate the weighted summation.

29. The apparatus of claim 24, wherein the preprocessing module determines respective weighted parameters for the plurality of pixel values by online training, in order to generate the weighted summation.

30. The apparatus of claim 23, wherein the preprocessing module screens a set of motion vectors by discarding at least one extreme motion vector, in order to select a remaining portion of the set of motion vectors as the motion information of the first set of coded units.

31. The apparatus of claim 23, wherein the preprocessing module dynamically selects a set of motion vectors from a plurality of sets of motion vectors as the motion information of the first set of coded units, and utilizes the selected set of motion vectors to derive the predicted pixel value of the specific sub-coding unit.

32. The apparatus of claim 31, wherein the plurality of sets of motion vectors comprises a first set of motion vectors that are temporal motion vectors, and further comprises a second set of motion vectors that are spatial motion vectors.

33. The apparatus of claim 23, wherein the preprocessing module dynamically selects a set of motion vectors from a plurality of sets of motion vectors and utilizes the selected set of motion vectors as the motion information of the first set of coded units based on an explicit flag.

34. The apparatus of claim 23, wherein the preprocessing module determines a size of the specific sub-coding unit to be a transform size regarding video coding of the coding unit.

35. The apparatus of claim 23, wherein the preprocessing module divides the coding unit into the plurality of sub-coding units based upon at least one mode, content, or partition of at least one neighboring coding unit.

36. A method for performing localized multihypothesis prediction during video coding of a coding unit, the method comprising:
dividing the coding unit into a plurality of sub-coding units; and
processing the sub-coding units, wherein the step of processing the sub-coding units further comprises:
obtaining motion information of a plurality of coded units for multihypothesis motion compensation of a specific sub-coding unit of the sub-coding units, wherein the coded units are motion-compensated coding units and the motion information comprises a first motion vector and a second motion vector corresponding to sub-coding units of other coding units within a current frame where the coding unit is located;
utilizing a weighted summation of a plurality of pixel values obtained from the motion information of the coded units as a predicted pixel value of the specific sub-coding unit; and
deriving a predicted pixel value of another sub-coding unit in the coding unit by utilizing a different weighted summation of the pixel values derived from the motion information of the coded units.

37. The apparatus of claim 23, wherein the motion information of the coding unit further comprises a third motion vector corresponding to a sub-coding unit of another coding unit located within another frame that is not the current frame where the coding unit is located.

38. The method of claim 36, wherein the motion information of the coding unit further comprises a third motion vector corresponding to a sub-coding unit of another coding unit located within another frame that is not the current frame where the coding unit is located.