Source: https://patents.google.com/patent/US9609342B2/en
Timestamp: 2019-12-15 13:56:23
Document Index: 605596805

Matched Legal Cases: ['Application No. 13166503', 'Application No. 201180010082', 'Application No. 201180010098', 'Application No. 201180010214', 'Application No. 201180010289', 'Application No. 201180010045', 'Application No. 201180010045', 'Application No. 201180010045', 'Application No. 201180010045', 'Application No. 201180010048', 'Application No. 201180010048', 'Application No. 201180010048', 'Application No. 201180010048', 'Application No. 201180010061', 'Application No. 201180010061', 'Application No. 201180010061', 'Application No. 201180010061', 'Application No. 201180010082', 'Application No. 201180010082', 'Application No. 201180010082', 'Application No. 201180010090', 'Application No. 201180010090', 'Application No. 201180010090', 'Application No. 201180010098', 'Application No. 201180010098', 'Application No. 201180010214', 'Application No. 201180010214', 'Application No. 201180010289', 'Application No. 201180010289', 'Application No. 11705195', 'Application No. 11705195', 'Application No. 11705195', 'Application No. 11705195', 'art 10']

US9609342B2 - Compression for frames of a video signal using selected candidate blocks - Google Patents
Compression for frames of a video signal using selected candidate blocks Download PDF
US9609342B2
US9609342B2 US12/838,124 US83812410A US9609342B2 US 9609342 B2 US9609342 B2 US 9609342B2 US 83812410 A US83812410 A US 83812410A US 9609342 B2 US9609342 B2 US 9609342B2
US12/838,124
US20110206117A1 (en
2010-02-19 Priority to US30640610P priority Critical
2010-07-16 Application filed by Skype Ltd Ireland filed Critical Skype Ltd Ireland
2010-07-16 Priority to US12/838,124 priority patent/US9609342B2/en
2010-11-01 Assigned to SKYPE LIMITED reassignment SKYPE LIMITED ASSIGNMENT OF ASSIGNORS INTEREST (SEE DOCUMENT FOR DETAILS). Assignors: ANDERSEN, SOREN VANG, BIVOLARSKY, LAZAR, NILSSON, MATTIAS, VAFIN, RENAT
2011-02-18 Priority claimed from CN201180010045.1A external-priority patent/CN102804775B/en
2011-08-25 Publication of US20110206117A1 publication Critical patent/US20110206117A1/en
2017-03-28 Publication of US9609342B2 publication Critical patent/US9609342B2/en
238000007906 compression Methods 0 description title 11
A method of selecting reference blocks for intra or inter prediction coding of a current block of a video signal. Each reference blocks is selected by: (i) determining a group of candidate blocks comprising at least some candidate blocks other than immediately adjacent spatial neighbors of the current block; and (ii) selecting one of the candidate blocks as the reference block based on a second metric, different from the first metric, the second metric relating to a number of bits that would be required in the encoded bitstream to encode both the residual block and the side information identifying the respective reference block.
FIG. 1a shows the pixel values of blocks represented in the spatial domain,
FIG. 1b shows coefficients of blocks represented in the frequency domain,
FIG. 3a illustrates an example of block-sorting,
FIG. 3b illustrates an example of block matching prediction
Y ⁡ ( k x , k y ) = ∑ x = 0 N - 1 ⁢ ∑ y = 0 M - 1 ⁢ Y ⁡ ( x , y ) ⁢ cos ⁡ [ π ⁢ ⁢ k x 2 ⁢ N ⁢ ( 2 ⁢ x + 1 ) ] ⁢ cos ⁡ [ π ⁢ ⁢ k y 2 ⁢ M ⁢ ( 2 ⁢ y + 1 ) ]
For example consider an illustrative case as shown in FIGS. 1a and 1b . Here, the representation of a block in the frequency domain is achieved through a transform which converts the spatial domain pixel values to spatial frequencies. FIG. 1a shows some example pixel values of four 8×8 blocks in the spatial domain, e.g. which may comprise the luminance values Y(x,y) of individual pixels at the different pixel locations x and y within the block. FIG. 1b is the equivalent in the frequency domain after transform and quantization. E.g. in FIG. 1b such coefficients may represent the amplitudes Y(kx, ky) of the different possible frequency domain terms that may appear in the sum. The size of the block in spatial and frequency domain is the same, i.e. in this case 8×8 values or coefficients. However, due to the properties of these transforms then the energy of the block is compacted into only few coefficients in the frequency domain, so the entire block can be considered by processing only these few coefficients.
In the described example, the blocks b0 to b23 for the macroblock are sorted based on a measure (index value) of block energy or activity. FIG. 3a illustrates an example of block-sorting. The block energy used to order the sort can be measured in a number of different ways. According to one technique, the sort is based on the number of zero value coefficients in a block. In another technique, the sort is carried out using the average value of the modulus of non zero coefficients. Using a measure Δ of block energy, a search range is established within the sorted list as illustrated in FIG. 3 to identify candidate blocks (Step S4 of FIG. 2). The best candidate for prediction is then established as described above based on bit rate evaluation (Step S6 of FIG. 2).
Let X(m,n) denote a block mεM (a frame/slice consists of M blocks in total) of quantized coefficients (e.g. quantized DCT coefficients) at time-instance n. The blocks are conventionally fed to an entropy coder 10 (in H.264 more specifically the context adaptive variable length coder or the context adaptive binary arithmetic coder). That is, from the point where we have X(m,n), lossless compression is performed, i.e., the distortion is fixed. The method seeks to remove remaining redundancies (and thereby reduce the rate) prior to the arithmetic coder by means of a predictor. In one embodiment the prediction is formed as a subtraction between a current block and a reference block. The optimal indices (oopt, popt) for prediction of the current block X(m,n) is selected based on rate calculation/estimation, i.e.,
(o opt ,p opt)=argmino,p(R(X(m,n)−X(o,p))+R(p)) [1]
where R(X(m,n)−X(o,p)) denotes the bitrate of the prediction residual and R(o,p) the bitrate of side-information (i.e., the bitrate for transmission of the prediction block index o of frame p). The rate estimation can for instance be provided from parts of the arithmetic coding routine where the sum of log2 of the symbol probabilities can be used to estimate the rate. It could also be beneficial, from e.g. a computational aspect, to approximate the criterion in equation [1] by using another measure that correlates well with the rate. Generally, any metric can be used that relates in some way to a number of bits that would be required in the encoded bitstream to encode both the residual block and the side information identifying the respective reference block (i.e. would be required for each candidate if that candidate was chosen as the reference block), whether the metric is a direct measure the number or rate of bits or a metric that correlates with the number/rate.
The search for the optimal predictor can be made computationally more efficient by pre-ordering the candidates such that potential good candidates are located in the proximity of a specific position in an ordered array. Let Y(k,n) now denote element k in an M dimensional ordered array of the block indices mεM of frame n according to some measure. For instance, the blocks X (m,n)mεM can be ordered according to their ascending energy (or some other signal dependent properties).
Y(q(n)−W,n), . . . ,Y(q(n)−1,n);
Y(q(n)+1,n), . . . ,Y(q(n)+W,n); and
Y(q(n−i)−W,n−i), . . . Y(q(n−i)+W,n−i)i=1: NumRef, respectively.
Field No. Bits Frame Index (FrameIdx) 4 Add/Sub 1 Nat/Abs 1 Macroblock Address (MBAddr) 9 Block Address (BlockAdr) 3 Sub-block Address (SubBAdr) 2
Inter SIF WVGA 480p 4CIF 720p 1080p 4kx2k 8kx4k Values Max 4 bits FrameIdx 4 4 4 4 4 4 4 4 −8 . . . 7 0 Intra Sub/Add 1 1 1 1 1 1 1 1 0 . . . 1 1 −1 Nat/Abs 1 1 1 1 1 1 1 1 0 . . . 1 2 −2 MBAddrX 5 6 6 6 7 7 8 9 0 . . . Max 480 3 −3 MBAddrY 4 5 5 6 6 7 8 9 0 . . . Max 270 4 −4 BlockAdr 3 3 3 3 3 3 3 3 0 . . . 5 5 −5 SubBAdr 2 2 2 2 2 2 2 2 0 . . . 3 6 −6 Total/B 20 22 22 23 24 25 27 29 7 −7 Total/MB 120 132 132 138 144 150 162 174 −8 List
This improved prediction scheme is more effective than the current prediction schemed which use a higher bit rate to signal only part of the information that the improved scheme can transmit. The streamlined inter and intra prediction allows for simplified signalling method. FIG. 3b shows a block matching prediction example achieving bit savings. The table below shows the effective side information and coding for multiple resolutions.
Res X Res Y MB_X MB_Y MBs MBBits UpToMBs Bs BBits UpToBs Bits_X Bits_Y Bits_XY SIF 320 240 20 15 300 9 512 1800 11 2048 5 4 9 WVGA 640 400 40 25 1000 10 1024 6000 13 8192 6 5 11 480p 640 480 40 30 1200 11 2048 7200 13 8192 6 5 11 4CIF 704 576 44 36 1584 11 2048 9504 14 16384 6 6 12 720p 1280 720 80 45 3600 12 4096 21600 15 32768 7 6 13 1080p 1920 1080 120 68 8160 13 8192 48960 16 65536 7 7 14 4k × 2k 3840 2160 240 135 32400 15 32768 194400 18 262144 8 8 16 8k × 4k 7680 4320 480 270 129600 17 131072 777600 20 1048576 9 9 18
forming a sorted list of blocks that includes at least a plurality of current blocks to be encoded within a frame of the video signal, the plurality of blocks having both interframe and intraframe blocks;
for each of the plurality of current blocks to be encoded within the frame of the video signal, including both the interframe and intraframe blocks of the plurality of blocks to be encoded, selecting a respective reference block by:
determining a group of candidate blocks from the sorted list of blocks, the group of candidate blocks comprising at least some candidate blocks that are not adjacent to the current block; and
selecting one of the candidate blocks as the reference block based in part on a number of bits to encode, in an encoded bitstream, both difference data for the current block relative to the candidate block and side information that identifies the candidate block as the reference block using a position of the reference block relative to a fixed point in the frame that is specified in the side information as a whole number of blocks from the fixed point in the frame;
for each of the plurality of current blocks to be encoded within the frame of the video signal, generating the difference data for the current block relative to the respective reference block that is selected;
generating the encoded bitstream to include for the plurality of current blocks the generated difference data and the side information; and
outputting the bitstream for a decoder.
determining the group of candidate blocks comprises searching a set of blocks to select a subset of candidate blocks based on a first metric other than spatial proximity to the current block, the subset of candidate blocks that is selected comprising at least some candidate blocks that are not adjacent to the current block; and
selecting the one of the candidate blocks as the reference block comprises selecting one of the candidate blocks as the reference block based on a second metric, different from the first metric, the second metric relating to a number of bits to encode, in the encoded bitstream, both the difference data and the side information identifying the candidate block as the reference block.
3. The method of claim 2, wherein determining the group of candidate blocks is performed once for a plurality of said reference blocks, and the plurality of said reference blocks is selected from a same subset of candidate blocks.
4. The method of claim 2, wherein determining the group of candidate blocks comprises searching each of the blocks of at least one frame.
5. The method of claim 2, wherein the first metric is a measure of block energy.
6. The method of claim 5, wherein determining the group of candidate blocks comprises selecting a subset of candidate blocks based on block energy of the candidate blocks relative to block energy of the current block.
7. The method of claim 5, wherein each block comprises a plurality of coefficients, and said measure of block energy comprises one of: a number of zero coefficients in the block, a number of non-zero coefficients in the block, and an average or total of a modulus of coefficients in the block.
8. The method of claim 2, wherein the first metric is evaluated with respect to transform domain coefficients.
9. The method of claim 8, wherein block energy is evaluated based on the transform domain coefficients.
10. The method of claim 2, wherein forming the sorted list of blocks comprises sorting the plurality of current blocks into an order according to the first metric, and determining the group of candidate blocks from the sorted list of blocks comprises selecting a subset of candidate blocks based on proximity to the current block within the sorted list of blocks.
11. The method of claim 10, wherein selecting the one of the candidate blocks as the reference block comprises selecting the subset of candidate blocks within a predetermined window of the current block within the sorted list of blocks.
12. The method of claim 1, wherein each block comprises a plurality of coefficients, and said difference data is generated for all the coefficients of the current block based on all the coefficients of the reference block.
13. The method of claim 1, wherein selecting the one of the candidate blocks as the reference block comprises selecting the candidate block that, to encode both the difference data and the side information identifying the candidate as the reference block, uses the fewest bits in the encoded bitstream.
14. The method of claim 1, further comprising, prior to selecting the reference blocks, transforming blocks of one or more frames from a spatial domain representation to a transform domain representation to generate a respective set of transform domain coefficients for each block, the difference data being generated based on the transform domain coefficients.
15. The method of claim 1, wherein selecting the one of the candidate blocks as the reference block is further based in part on a bitrate to encode both the difference data and the side information identifying the candidate as the reference block.
16. The method of claim 15, wherein the bitrate is determined by summing log 2 probabilities of a plurality of different possible symbols for representing the difference data and the side information.
17. The method of claim 1, wherein generating the encoded bitstream comprises entropy encoding the difference data and side information.
18. The method of claim 17, wherein the number of bits to encode, in the encoded bitstream, the difference data and side information comprises the number of bits to encode the difference data and side information using the entropy encoding.
19. The method of claim 1, further comprising quantizing the blocks of each frame prior to selecting the respective reference block and generating the difference data for the current block relative to the respective reference block.
20. The method of claim 1, wherein for each of the plurality of current blocks to be encoded within a current frame of the video signal, selecting the respective reference block comprises selecting a respective reference block in the current frame, and generating the respective difference data according to an intraframe prediction of the current block by reference to the reference block in the current frame.
21. The method of claim 20, wherein determining the group of candidate blocks for the current frame comprises searching all the blocks of current frame.
22. The method of claim 20, wherein reference blocks selected for the intraframe prediction are selected from a same subset of candidates as reference blocks selected for an interframe prediction.
23. The method of claim 1, wherein for each of the plurality of current blocks to be encoded within a current frame of the video signal, selecting the respective reference block comprises selecting a respective reference block in a preceding frame, and generating the respective difference data according to an interframe prediction of the current block by reference to the reference block in the preceding frame.
24. The method of claim 23, wherein determining the group of candidate blocks comprises searching all the blocks of the preceding frame.
25. The method of claim 23, wherein the side information identifies the preceding frame.
26. The method of claim 23, wherein reference blocks selected for the interframe prediction are selected from a same subset of candidates as reference blocks selected for an intraframe prediction.
27. In a digital environment, a system to compress a video signal by one or more computing devices, the system comprising:
a memory configured to store instructions that are executable via the one or more processors to cause the one or more computing devices to compress a video signal by performing operations comprising:
receiving the video signal comprising a plurality of video frames, each frame representing an image at a different respective time, and each frame comprising a plurality of constituent blocks of the respective image;
sorting at least a plurality of current blocks to be encoded within a frame of the video signal to form a sorted list of blocks;
for each of a plurality of current blocks to be encoded within a frame of the video signal, selecting a respective reference block by:
determining a group of candidate blocks from the sorted list of blocks, the group of candidate blocks comprising at least some candidate blocks that are not adjacent to the current block, the group of candidate blocks that is determined being selectable as reference blocks for encoding current blocks of both intraframes and interframes in the video signal; and
selecting one of the candidate blocks as the reference block based in part on a number of bits to encode, in an encoded bitstream, both difference data for the current block and side information identifying the candidate block as the reference block, the side information identifying a corresponding frame in which the reference block is included and a block address of the reference block within the corresponding frame, the block address specified in the side information as a whole number of blocks relative to a fixed point in the corresponding frame;
for each of the plurality of current blocks to be encoded within the frame of the video signal, generating difference data for the current block relative to the respective reference block that is selected;
generating the encoded bitstream to include for the plurality of current blocks the generated difference data and side information; and
28. An encoder for compressing a video signal, the video signal comprising a plurality of video frames, each frame representing an image at a different respective time, and each frame comprising a plurality of constituent blocks of the respective image, the plurality of constituent blocks having both interframe and intraframe blocks; the encoder comprising:
a memory configured to store instructions that are executable via the one or more processors to implement a prediction coding module and an output module of the encoder, wherein:
the prediction coding module is configured, for each of a plurality of current blocks to be encoded within a frame of the video signal, including both the interframe and intraframe blocks of the plurality of blocks to be encoded, to select a respective reference block by:
determining a group of candidate blocks from a sorted list of blocks that includes at least the plurality of current blocks to be encoded within the frame of the video signal, the group of candidate blocks comprising at least some candidate blocks that are not adjacent to the current block; and
selecting one of the candidate blocks as the reference block based in part on a number of bits to encode, in an encoded bitstream, both difference data for the current block and side information that identifies the candidate block as the reference block using a reference to a corresponding frame in which the reference block is contained and an address of the reference block specified in the side information as a whole number of blocks relative to a fixed point in the corresponding frame rather than using a vector relative to the current block to identify the reference block;
the prediction coding module further configured, for each of the plurality of current blocks to be encoded within the frame of the video signal, to generate difference data for the current block relative to the reference block that is selected; and
the output module is configured to generate the encoded bitstream to include for the plurality of current blocks the difference data and the side information, and to output the bitstream for a decoder.
US12/838,124 2010-02-19 2010-07-16 Compression for frames of a video signal using selected candidate blocks Active 2031-09-22 US9609342B2 (en)
US30640610P true 2010-02-19 2010-02-19
US12/838,124 US9609342B2 (en) 2010-02-19 2010-07-16 Compression for frames of a video signal using selected candidate blocks
CN201180010045.1A CN102804775B (en) 2010-02-19 2011-02-18 Data compression for video
EP11706788.4A EP2520093B1 (en) 2010-02-19 2011-02-18 Data compression for video
US20110206117A1 US20110206117A1 (en) 2011-08-25
US9609342B2 true US9609342B2 (en) 2017-03-28
US12/838,124 Active 2031-09-22 US9609342B2 (en) 2010-02-19 2010-07-16 Compression for frames of a video signal using selected candidate blocks
EP (1) EP2520093B1 (en)
CN107454421A (en) * 2010-12-13 2017-12-08 韩国电子通信研究院 The method decoded based on inter prediction to vision signal
CA2822925C (en) * 2011-01-04 2017-09-19 Research In Motion Limited Coding of residual data in predictive compression
WO2014073173A1 (en) 2012-11-06 2014-05-15 日本電気株式会社 Video encoding method, video encoding device, and video encoding program
CN103747267B (en) * 2014-01-09 2017-04-12 上海交通大学 Compressive sensing spectral imaging measured value compression method based on embedded transformation coding
CN105472384B (en) * 2014-07-29 2018-12-07 浙江大华技术股份有限公司 A kind of video encoding method and device
JP2007060437A (en) 2005-08-25 2007-03-08 Canon Inc Recording and reproducing apparatus, recording and reproducing method, and computer program
US20070116370A1 (en) 2002-06-28 2007-05-24 Microsoft Corporation Adaptive entropy encoding/decoding for screen capture content
2010-07-16 US US12/838,124 patent/US9609342B2/en active Active
2011-02-18 WO PCT/EP2011/052460 patent/WO2011101449A1/en active Application Filing
2011-02-18 EP EP11706788.4A patent/EP2520093B1/en active Active
"Corrected Notice of Allowance", U.S. Appl. No. 13/029,710, Dec. 9, 2015, 2 pages.
"Corrected Notice of Allowance", U.S. Appl. No. 13/029,710, Feb. 16, 2016, 2 pages.
"Corrected Notice of Allowance", U.S. Appl. No. 13/029,710, Mar. 14, 2016, 2 pages.
"Examiner's Answer to Appeal Brief", U.S. Appl. No. 12/838,118, Feb. 11, 2016, 20 pages.
"Examiner's Answer to Appeal Brief", U.S. Appl. No. 12/838,168, Feb. 12, 2016, 27 pages.
"Extended European Search Report", EP Application No. 13166503.6, Nov. 27, 2013, 7 pages.
"Final Office Action", U.S. Appl. No. 12/838,118, (Mar. 15, 2013), 16 pages.
"Final Office Action", U.S. Appl. No. 12/838,118, Jan. 22, 2015, 17 pages.
"Final Office Action", U.S. Appl. No. 12/838,131, (Jan. 30, 2013), 15 pages.
"Final Office Action", U.S. Appl. No. 12/838,131, Jun. 6, 2014, 9 pages.
"Final Office Action", U.S. Appl. No. 12/838,131, Nov. 26, 2013, 13 pages.
"Final Office Action", U.S. Appl. No. 12/838,139, (Mar. 27, 2013), 12 pages.
"Final Office Action", U.S. Appl. No. 12/838,139, May 20, 2015, 17 pages.
"Final Office Action", U.S. Appl. No. 12/838,159, (Jul. 24, 2012), 15 pages.
"Final Office Action", U.S. Appl. No. 12/838,168, (Apr. 12, 2013), 19 pages.
"Final Office Action", U.S. Appl. No. 12/838,168, Jan. 2, 2015, 18 pages.
"Final Office Action", U.S. Appl. No. 12/838,197, (May 9, 2013), 12 pages.
"Final Office Action", U.S. Appl. No. 13/029,710, Jan. 29, 2014, 20 pages.
"Final Office Action", U.S. Appl. No. 13/029,710, Nov. 17, 2014, 21 pages.
"Foreign Notice of Allowance", CN Application No. 201180010082.2, Apr. 21, 2016, 4 pages.
"Foreign Notice of Allowance", CN Application No. 201180010098.3, Apr. 21, 2016, 4 pages.
"Foreign Notice of Allowance", CN Application No. 201180010214.1, Jan. 10, 2017, 4 pages.
"Foreign Notice of Allowance", CN Application No. 201180010289.X, Apr. 7, 2016, 4 pages.
"Foreign Office Action", CN Application No. 201180010045.1, Apr. 30, 2015, 12 pages.
"Foreign Office Action", CN Application No. 201180010045.1, Feb. 15, 2016, 7 pages.
"Foreign Office Action", CN Application No. 201180010045.1, Nov. 2, 2015, 7 pages.
"Foreign Office Action", CN Application No. 201180010045.1, Oct. 8, 2014, 22 pages.
"Foreign Office Action", CN Application No. 201180010048.5, Feb. 14, 2016, 13 pages.
"Foreign Office Action", CN Application No. 201180010048.5, Jun. 2, 2016, 9 pages.
"Foreign Office Action", CN Application No. 201180010048.5, May 15, 2015, 10 pages.
"Foreign Office Action", CN Application No. 201180010048.5, Nov. 2, 2014, 4 pages.
"Foreign Office Action", CN Application No. 201180010061.0, Apr. 21, 2016, 6 pages.
"Foreign Office Action", CN Application No. 201180010061.0, Aug. 11, 2014, 17 pages.
"Foreign Office Action", CN Application No. 201180010061.0, Jun. 12, 2015, 10 pages.
"Foreign Office Action", CN Application No. 201180010061.0, Nov. 11, 2015, 11 pages.
"Foreign Office Action", CN Application No. 201180010082.2, Dec. 9, 2015, 8 pages.
"Foreign Office Action", CN Application No. 201180010082.2, Nov. 25, 2014, 17 pages.
"Foreign Office Action", CN Application No. 201180010082.2, Sep. 2, 2015, 8 pages.
"Foreign Office Action", CN Application No. 201180010090.7, Feb. 22, 2016, 7 pages.
"Foreign Office Action", CN Application No. 201180010090.7, Nov. 3, 2014, 16 pages.
"Foreign Office Action", CN Application No. 201180010090.7, Sep. 9, 2015, 8 pages.
"Foreign Office Action", CN Application No. 201180010098.3, Dec. 2, 2014, 12 pages.
"Foreign Office Action", CN Application No. 201180010098.3, Oct. 21, 2015, 7 pages.
"Foreign Office Action", CN Application No. 201180010214.1, May 10, 2016, 6 pages.
"Foreign Office Action", CN Application No. 201180010214.1, Nov. 25, 2014, 16 pages.
"Foreign Office Action", CN Application No. 201180010289.X, Dec. 16, 2014, 14 pages.
"Foreign Office Action", CN Application No. 201180010289.X, Nov. 2, 2015, 11 pages.
"Foreign Office Action", EP Application No. 11705195.3, Dec. 13, 2013, 5 pages.
"Foreign Office Action", EP Application No. 11705195.3, Dec. 3, 2013, 5 pages.
"Foreign Office Action", EP Application No. 11705195.3, Oct. 21, 2014, 5 pages.
"Foreign Office Action", EP Application No. 11705195.3, Sep. 15, 2015, 4 pages.
"Information Technology-JPEG 2000 image coding system: Core coding system", ISO 15444 ITU-T Recommendation T.800, (Aug. 2002), 212 pages.
"International Preliminary Report on Patentability", Application No. PCT/EP2011/052446, Aug. 30, 2012, 8 pages.
"International Preliminary Report on Patentability", Application No. PCT/EP2011/052463, Aug. 30, 2012, 8 pages.
"International Search Report and Written Opinion", International Application No. PCT/EP2011/052446, (Dec. 29, 2011), 13 pages.
"International Search Report and Written Opinion", International Application No. PCT/EP2011/052449, (Apr. 20, 2011), 9 pages.
"International Search Report and Written Opinion", International Application No. PCT/EP2011/052458, (Oct. 14, 2011), 32 pages.
"International Search Report and Written Opinion", International Application No. PCT/EP2011/052460, (May 24, 2011), 19 pages.
"International Search Report and Written Opinion", International Application No. PCT/EP2011/052462, (May 24, 2011), 14 pages.
"International Search Report and Written Opinion", International Application No. PCT/EP2011/052464, (Sep. 1, 2011), 25 pages.
"International Search Report and Written Opinion", International Application No. PCT/EP2011/052465, (Sep. 26, 2011), 21 pages.
"Invitation to Pay Additional Fees and, Where Applicable, Protest Fee and Partial International Search", International Application No. PCT/EP2011/052458, (May 31, 2011), 9 pages.
"Invitation to Pay Additional Fees and, Where Applicable, Protest Fee and Partial International Search", International Application No. PCT/EP2011/052464, (Jun. 29, 2011), 11 pages.
"Invitation to Pay Additional Fees and, Where Applicable, Protest Fee and Partial International Search", International Application No. PCT/EP2011/052465, (Jul. 5, 2011), 10 pages.
"Non-Final Office Action", U.S. Appl. No. 12/838,118, (Sep. 14, 2012), 16 pages.
"Non-Final Office Action", U.S. Appl. No. 12/838,118, Aug. 1, 2014, 18 pages.
"Non-Final Office Action", U.S. Appl. No. 12/838,131, (Aug. 1, 2013),15 pages.
"Non-Final Office Action", U.S. Appl. No. 12/838,131, (Aug. 30, 2012), 13 pages.
"Non-Final Office Action", U.S. Appl. No. 12/838,131, Feb. 27, 2014, 18 pages.
"Non-Final Office Action", U.S. Appl. No. 12/838,139, (Dec. 7, 2012), 13 pages.
"Non-Final Office Action", U.S. Appl. No. 12/838,139, Jul. 31, 2014, 16 pages.
"Non-Final Office Action", U.S. Appl. No. 12/838,159, (Apr. 13, 2012), 11 pages.
"Non-Final Office Action", U.S. Appl. No. 12/838,168, (Aug. 31, 2012), 16 pages.
"Non-Final Office Action", U.S. Appl. No. 12/838,168, Aug. 1, 2014, 16 pages.
"Non-Final Office Action", U.S. Appl. No. 12/838,197, (Dec. 7, 2012), 14 pages.
"Non-Final Office Action", U.S. Appl. No. 12/838,197, Aug. 14, 2014, 14 pages.
"Non-Final Office Action", U.S. Appl. No. 13/029,710, (Aug. 23, 2013),15 pages.
"Non-Final Office Action", U.S. Appl. No. 13/029,710, Jul. 14, 2014, 17 pages.
"Non-Final Office Action", U.S. Appl. No. 13/029,710, Jul. 8, 2015, 22 pages.
"Notice of Allowance", U.S. Appl. No. 12/838,131, Aug. 11, 2014, 7 pages.
"Notice of Allowance", U.S. Appl. No. 12/838,159, (Mar. 29, 2013), 11 pages.
"Notice of Allowance", U.S. Appl. No. 12/838,159, Nov. 13, 2013, 12 pages.
"Notice of Allowance", U.S. Appl. No. 12/838,197, Mar. 2, 2015, 8 pages.
"Notice of Allowance", U.S. Appl. No. 13/029,710, Nov. 25, 2015, 7 pages.
"PCT Search Report and Written Opinion", Application No. PCT/EP2011/052463, (Mar. 16, 2012), 13 pages.
"Preliminary Examination Report", Application No. PCT/EP2011/052465, (Jun. 5, 2012), 10 pages.
"Restriction Requirement", U.S. Appl. No. 12/838,139, (Oct. 1, 2012), 6 pages.
"Restriction Requirement", U.S. Appl. No. 12/838,197, (Oct. 16, 2012), 6 pages.
"Restriction Requirement", U.S. Appl. No. 13/029,710, (Jun. 10, 2013), 6 pages.
"Supplemental Notice of Allowance", U.S. Appl. No. 12/838,197, Jun. 5, 2015, 2 pages.
"Information Technology—JPEG 2000 image coding system: Core coding system", ISO 15444 ITU-T Recommendation T.800, (Aug. 2002), 212 pages.
ANONYMOUS: "H.264 and MPEG-4 Video Compression, chapter 6, "H.264/MPEG4 Part 10", Iain E. Richardson", NOT KNOWN, Richards, 17 October 2003 (2003-10-17), XP030001626
ANONYMOUS: "H.264 and MPEG-4 Video Compression, chapter 7, "Design and Performance", Iain E. Richardson", NOT KNOWN, Richards, 17 October 2003 (2003-10-17), XP030001627
Bivolarski, L.M., et al., "Design Considerations for Computationally Constrained Two-Way Real-Time Video Communication," Applications of Digital Image Processing XXXII, A.G. Tescher, ed., in Proc. of SPIE, 7443: 74430I-1-744301I-17 (2009).
Freina, T., et al., "Predictive Fractal Image Coding: Hybrid Algorithms and Compression of Residuals," IEEE Comput. Soc., pp. 549 (1998).
Ginzburg, A., et al., "DCT—Domain Coder for Digital Video Applications", 2006 International Conference on Information Technology: Research and Education, pp. 110-114 (Oct. 1, 2006).
Hoang, D. T., et al., "Efficient Cost Measures for Motion Compensation at Low Bit Rates," IEEE Comput. Soc., pp. 102-111 (1996).
Hoang,"Efficient Cost Measures for Motion Estimation at Low Bit Rates", IEEE Transactions on Circuits and Systems for Video Technology vol. 8 No. 4, Aug. 31, 1998, 13 pages.
International Search Report and Written Opinion, PCT/EP2011/052462, Date of Mailing: May 24, 2011.
International Search Report and Written Opinion, PCT/EP2011/052464, date of mailing Sep. 1, 2011.
Invitation to Pay Additional Fees and Partial International Search Report, PCT/EP2011/052464, Date of Mailing: Jun. 29, 2011.
Invitation to Pay Additional Fees and, Where Applicable, Protest Fee and Partial International Search for Int'l Application No. PCT/EP2011/052458; Date of Mailing: May 31, 2011, 9 pp.
Kaneko, "A Unified Formulation of Segment Companding Laws and Synthesis of Codecs and Digital Compandors", Bell System Technical Journal, vol. 49, Sep. 1970, pp. 1555-1588.
Netravali,"Digital Pictures", 2nd Edition, Plenum Press, Ch. 1, pp. 38-39; Ch. 5 pp. 366-367 & pp. 406-409; Ch. 6 pp. 540-543., Jan. 31, 1995, 6 pages.
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority for Int'l Application No. PCT/EP2011/052465; Date of Mailing: Sep. 26, 2011.
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration, for Application No. PCT/EP2011/052460, mailed on May 24, 2011, consisting of 19 pages.
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration, International Application: PCT/EP2011/052446, Mailing Date: Dec. 29, 2011, 13 pp.
Notification of Transmittal of the International Search Report and the Written Opinion of the International Searching Authority, or the Declaration, PCT/EP2011/052458, Mailing Date: Oct. 14, 2011, 32 pp.
Rosenholtz, Ruth et al., "Perceptual Adaptive JPEG Coding", Proceedings of the International Conference on Image Processing (ICIP), Lausanne, Sep. 16-19, 1996, New York, IEEE, US. vol. 1, XP010202284, (Sep. 16, 1996), pp. 901-904.
Segall, Andrew et al., "Improved High-Definition Video by Encoding at an Intermediate Resolution", Visual Communications and Image Processing, SPIE vol. 5308, (2004), pp. 1007-1018.
Smith, "Instantaneous Companding of Quantized Signals", Bell System Technical Journal, vol. 36, May 1957, pp. 653-709.
Song,"Research on Super Resolution Reconstruction of Video and Image Sequences", China Doctor Dissertation, Full-text Database, Collection of Information, Science and Technology-English Abstract pp. 8-9, Jan. 15, 2014, 44 pages.
Song,"Research on Super Resolution Reconstruction of Video and Image Sequences", China Doctor Dissertation, Full-text Database, Collection of Information, Science and Technology—English Abstract pp. 8-9, Jan. 15, 2014, 44 pages.
Sullivan, G. J., "Rate-Distortion Optimization for Video Compression," IEEE Signal Processing Magazine, vol. 15, No. 6, pp. 74-90 (1998).
Zhu,"Transform-Exempted Calculation of Sum of Absolute Hadamard Transformed Differences", IEEE Transactions on Circuits and Systems for Video Technology archive vol. 19 Issue 8, Aug. 2009, 6 pages.
EP2520093B1 (en) 2019-11-27
WO2011101449A1 (en) 2011-08-25
CN102804775A (en) 2012-11-28
US20110206117A1 (en) 2011-08-25
EP2520093A1 (en) 2012-11-07
EP2629523A2 (en) 2013-08-21 Data compression for video with preprocessing
WO2010030732A2 (en) 2010-03-18 System and method for video encoding using constructed reference frame
KR101752989B1 (en) 2017-07-03 Mode decision simplification for intra prediction
JP6140237B2 (en) 2017-05-31 How to build a merge list