The present invention relates in general to video encoding.
In many lossy compression schemes of audio and video, the strength of the compression can be selected to achieve a compression level that is perceptually acceptable to the human visual system (HVS). Because the human visual system is complex, it is difficult to select an optimal compression level. On one hand, it is desirable to compress an image into a relatively small number of bits, thus reducing the bandwidth required to transmit the image. On the other hand, some compression schemes can result in a reduced image quality as perceived by the HVS if the image is compressed at too high a compression ratio.
Methods and apparatuses for encoding a video signal are disclosed herein.
In accordance with one aspect of the disclosed embodiments, a method for compressing a video signal includes storing a function derived from a set of ratings in a memory, identifying within at least a portion of the video signal at least one content-based feature and inputting the at least one identified content-based feature into the stored function. The method also includes determining a compression ratio based on the function using a processor and compressing the portion of the video signal having identified content-based features at the at the determined compression ratio.
In accordance with another aspect of the disclosed embodiments, an apparatus for compressing a video signal is provided. The apparatus comprises a memory with a function derived from a set of human ratings stored thereon and a processor configured to execute instructions stored in the memory to identify within at least a portion of the video signal at least one content-based feature, input the at least one identified content-based feature into the stored function, determine a compression ratio based on the function using a processor and compress the portion of the video signal having identified content-based features.
In accordance with yet another aspect of the disclosed embodiments, an apparatus for compressing a video signal is provided. The apparatus comprises means for storing a function derived from a set of ratings in a memory, means for identifying within at least a portion of the video signal at least one content-based feature and means for inputting the at least one identified content-based feature into the stored function. The apparatus also includes means for determining a compression ratio based on the function and means for compressing the portion of the video signal having identified content-based features at the determined compression ratio.
These and other embodiments will be described in additional detail hereafter.
The description herein makes reference to the accompanying drawings wherein like reference numerals refer to like parts throughout the several views, and wherein:
Embodiments are disclosed herein in which a function is used to predict acceptable compression level based on acoustic and/or visual features, given a set of human judgments about perceptual quality of compressed audio or video.
Referring to
A network 17 connects transmitting station 12 and a receiving station 18 for encoding and decoding of the video stream. Specifically, the video stream can be encoded by an encoder in transmitting station 12 and the encoded video stream can be decoded by a decoder 80 in receiving station 18. Network 17 can, for example, be the Internet. Network 17 can also be a local area network (LAN), wide area network (WAN), virtual private network (VPN), or any other means of transferring the video stream from transmitting station 12.
Receiving station 18, in one example, can be a computer having an internal configuration of hardware include a processor such as a central processing unit (CPU) 20 and a memory 22. Processor 20 is a controller for controlling the operations of receiving station 18. CPU 20 can be connected to memory 22 by, for example, a memory bus. Memory 22 can be RAM or any other suitable memory device. Memory 22 stores data and program instructions which are used by CPU 32. Other suitable implementations of receiving station 18 are possible.
A display 24 configured to display a video stream can be connected to receiving station 18. Display 24 can be implemented in various ways, including with a liquid crystal display (LCD) or a cathode-ray tube (CRT). The display 24 can be configured to display a video stream decoded by the decoder in receiving station 18.
Other implementations of the encoder and decoder system 10 are possible. For example, one implementation can omit the network 17 and/or the display 24. In another implementation, a video stream can be encoded and then stored for transmission at a later time by transmitting station 12 or any other device having memory. In another implementation, additional components can be added to the encoder and decoder system 10. For example, a display or a video camera can be attached to transmitting station 12 to capture the video stream to be encoded.
When input video stream 30 is presented for encoding, each frame 34 within input video stream 30 is processed in units of blocks. At intra/inter prediction stage 46, each block can be encoded using either intra-frame prediction (i.e., within a single frame) or inter-frame prediction (i.e. from frame to frame). In either case, a prediction block can be formed. In the case of intra-prediction, a prediction block can be formed from samples in the current frame that have been previously encoded and reconstructed. In the case of inter-prediction, a prediction block can be formed from samples in one or more previously constructed reference frames as described in additional detail herein.
Next, still referring to
The reconstruction path in
When compressed bitstream 44 is presented for decoding, the data elements within compressed bitstream 44 can be decoded by entropy decoding stage 66 (using, for example, Context Adaptive Binary Arithmetic Decoding) to produce a set of quantized transform coefficients. Dequantization stage 68 dequantizes the quantized transform coefficients, and inverse transform stage 70 inverse transforms the dequantized transform coefficients to produce a derivative residual that can be identical to that created by the reconstruction stage in the encoder 40. Using header information decoded from the compressed bitstream 44, decoder 80 can use intra/inter prediction stage 72 to create the same prediction macroblock as was created in encoder 40. At the reconstruction stage 74, the prediction macroblock can be added to the derivative residual to create a reconstructed macroblock. The loop filter 76 can be applied to the reconstructed macroblock to reduce blocking artifacts. Deblocking filter 78 can be applied to the reconstructed macroblock to reduce blocking distortion, and the result is output as output video stream 64. Other variations of decoder 80 can be used to decode compressed bitstream 44. For example, a decoder can produce output video stream 64 without deblocking filtering stage 78.
In addition to high frequency content color, brightness, audio content and movement any other number of detectable video based content features can be detected in a video stream, video frame or frame segment. Identifying various content-based features within video sequences allows a function such as a prediction curve to predict how a human will perceive the quality of those features at various bit rates. Because human perception of each combination of content-based features is impacted more or less severely by video compression, the prediction curve must be able to anticipate a high degree of potential content-based features that can be contained in a video signal. In general, the function of compression is to reduce digitized audio and video to bit rates that can be supported by a channel or to otherwise more efficiently transmit image or video. Higher compression ratios discard more bits from original video content than do lower compression ratios. Higher compression ratios can be achieved by decreasing the frame rate, increasing quantizer step size or any other known method which reduces the number of bits spent to encode a video. In general, the higher a compression ratio is, the lower the quality of reconstructed video is when it is received because fewer bits are used to accurately reconstruct the original video stream. Accordingly, more compression efficiency results in a tradeoff with reduced video quality.
Because of the complexities of the human visual system (HVS), degradation of some audio and video content-based features are perceived more readily than others, affecting a viewers perception of video quality differently for different content-based features contained in a given video. For example, a human viewer can be more likely to perceive an increased compression ratio in a video sequence with a high degree of motion than in a video sequence with a little or no motion. To illustrate this example, in
One way to discover the effect of a compression ratio on human perception is for a set of human evaluators to rate a series of videos with varying content-based characteristics at several different compression ratios. However, implementing such a process for all possible video content features would be prohibitively expensive. One exemplary solution is to collect perceptual quality evaluations from human raters for a limited set of videos with varying content-based features. Each video with its own unique set of content features can be rated by humans at varying compression rates. Content-based features contained in each video can be evaluated by a human for low, medium and high compression ratios, for example. A suitable number of features to be evaluated is 2000, but more or fewer can be selected. The scale used by a human evaluator can be 1-10, 1-5 or any other scale which conveys relative perceived quality. The human evaluation can include human viewers watching a video clip at five different bit rates or compression ratios, for example. Each clip can be evaluated by a group of humans at each compression ratio so that the final human rating is an average of multiple ratings. Any number of ratings, videos and compression ratios can be considered in building the database of human ratings. Generally speaking, the larger the database the more effective the ability to discover acceptable compression ratios in accordance with the disclosed embodiments.
In one exemplary embodiment,
With respect to
Once the data is collected these ratings will indicate the relative perceived quality of each video with its own set of unique characteristics at varying compression ratios.
Once data from human evaluators has been collected, for example, as shown in
With respect to the vector of video features x shown in equation (1), video content-based features can be represented by data corresponding to local binary patterns, motion vector information, transform coefficient frequency, histograms of colors in local sectors of a video frame or any other method of detecting content-based features in a video or image. For a detailed to discussion on how to represent various types of video content-based features with data, see for example “CVPR 2005” by Serre Wolf and Poggio, or “object recognition from local scale-invariant features” by DG Lowe. Furthermore, content features can be audio features represented by spectrograms, Mel frequency cepstral coefficients (MFCC's), stabilized auditory images, pitch distribution, harmonics, tempo or beat. See for example, Chechik et al., Neural Computation 2010.
For example, a local binary pattern feature can be created by scanning every image (video frame) and matching each block in the image to one of a plurality of predetermined texture patterns. A histogram of these patterns is then computed for every frame. One form of LBP uses binary texture patterns of 8 bits, hence the histogram would be of (28) 256 features. Similar approach can be used to collect color histograms.
Accordingly, each video contains an extensive array or vector x of d content-based features possibly of different types. Based on this extensive array of features, all features that make up a video stream can be represented as a feature vector x with d total dimensions representing each of the video features according to (1):
xεRd (1)
Given a vector x representing all content features of a video stream, human ratings y are collected for each data set x. This process is repeated for any number of videos with their own unique data set x. The more videos included in the process, the more accurate a trained function can become. Accordingly, the process of training a function can involve thousands of videos with thousands of corresponding vectors of video content-based features xi or more. Each human rating yik will correspond to one or more vectors of video content data xi at a particular bit rate, BRk For example the number of different bit rates, k in
yik′=fw(xi,BRk,w) (2)
In equation (2), x, represents the d dimensional vector of features for an ith video, yik is the human rating for the i-th video at bit rate k and BRk represents the bit rate of the ith video currently being rated. Alternatively, bit rate BRk can be included as a video feature in vector xi such that output yi′ is defined by equation (3). Each video will be rated at multiple bit rates as shown in
yi′=fw(xi) (3)
fw(x)=w1x1+ . . . wdxd=<w,x> (4)
Alternatively, f can be a polynomial function or the logistic function according to equation (5):
fw(x)=1/(1+exp(−b<w,x>) (5)
Alternatively, f can be another non linear function. For example, it can depend non linearly on x through a kernel function, or implemented using a neural network. In these cases the number of parameters w can be different from the dimension of the input d. For non linear regression approaches, weights are also assigned to combination of features. For example, a weight can be assigned to the product of the low-frequency content and the prominence of movement features.
In training a prediction curve, the parameters w for each video content feature x1-xd must be selected in such a way that will make yi′ the most similar on average to the human ratings yi, collected at step 804 in
Regression techniques fit a function fw such as equation (4) to a data set, such as a data set including content feature vector xi, human rating yik, and bit rate BRk. As stated above, bit rate can also be included in the content feature vector xi. In that case, fitting linear equation (4) can be done by minimizing an error function that measures the misfit between the function fw (xi, w) for any given value of w and the data points collected at step 604. The regression technique can use the sum of the squares of errors as the error function or any other suitable type of error function. If the regression technique uses the sum of the squares of errors as the selected error function, the error can be represented as shown in equation (6), where x1 . . . xn is the full set of n examples, each being a d-dimensional vector, and y is the set if n ratings corresponding to these examples.
As depicted in
A prediction curve such as in exemplary equations (2) or (3) can have functions such as exemplary equations (4) and (5) that can be trained for a large set of video content features such that each weight w1-wd is continually updated for the most accurate prediction of a human rating. Each time the equation is compared with a data set corresponding to a video and a human rating of that video, the prediction curve can be further calibrated. In many cases, the subjective testing data shown in
Referring to
Once the content characteristics of a video stream 30 are determined at stage 62, these determined characteristics can be used as an input to the trained prediction curve yi′. For example, with respect to equation (3), once a vector of characteristics xi for a given video stream 30 are determined, the appropriate weight w determined from step 606 that is associated with each the of determined characteristics xi can also be input into equation (3). Once xi and w are input to equation (3), the trained prediction curve for those inputs can be simulated to predict the human rating for those inputs. In one aspect of a disclosed embodiment, the trained prediction curve can be simulated for a first vector of video characteristics x1 associated with a first video stream 30. Furthermore, the prediction curve can estimate a human rating at multiple bit rates such as BR1 and BR2 as shown in
Once a predicted human rating is given for a vector of video characteristics at one or more bit rates, encoder 40 can select a bit rate at which to transmit compressed bit stream 44. Preparing the encoder 40 to transmit at a specified bit rate can involve altering various aspects of the encoding process including but not limited to altering the frame rate of the video stream, altering the quantization parameter step size, performing zero bin alterations, altering motion vector values or various other suitable bit rate altering techniques.
Encoder 40 can select a bit rate, for example, by having a predetermined minimum human rating for all compressed bit streams transmitted. It should be noted that the regression described above can be used to interpolate the full continuum of bit values. The minimum human rating can also be computed real time based on conditions at the encoder or decoder. Specifically, encoder 40 can take all the predicted human ratings generated at step 914 as seen in
The embodiments of transmitting station 12 and/or receiving station 18 (and the algorithms, methods, instructions etc. stored thereon and/or executed thereby) can be realized in hardware, software, or any combination thereof including, for example, IP cores, ASICS, programmable logic arrays, optical processors, programmable logic controllers, microcode, quantum or molecular processors, firmware, microcontrollers, servers, microprocessors, digital signal processors or any other suitable circuit. In the claims, the term “processor” should be understood as encompassing any the foregoing, either singly or in combination. The terms “signal” and “data” are used interchangeably. Further, portions of transmitting station 12 and receiving station 18 do not necessarily have to be implemented in the same manner.
The operation of encoding can be performed in many different ways and can produce a variety of encoded data formats. The above-described embodiments of encoding or decoding may illustrate some exemplary encoding techniques. However, in general, encoding and decoding are understood to include any transformation or any other change of data whatsoever.
Further, in one embodiment, for example, transmitting station 12 or receiving station 18 can be implemented using a general purpose computer/processor with a computer program that, when executed, carries out any of the respective methods, algorithms and/or instructions described herein. In addition or alternatively, for example, a special purpose computer/processor can be utilized which can contain specialized hardware for carrying out any of the methods, algorithms, or instructions described herein.
Transmitting station 12 and receiving station 18 can, for example, be implemented on computers in a screen casting system. Alternatively, transmitting station 12 can be implemented on a server and receiving station 18 can be implemented on a device separate from the server, such as a hand-held communications device (i.e. a cell phone). In this instance, transmitting station 12 can encode content using an encoder into an encoded video signal and transmit the encoded video signal to the communications device. In turn, the communications device can then decode the encoded video signal using a decoder. Alternatively, the communications device can decode content stored locally on the communications device (i.e. no transmission is necessary). Other suitable transmitting station 12 and receiving station 18 implementation schemes are available. For example, receiving station 18 can be a personal computer rather than a portable communications device.
Further, all or a portion of embodiments of the present invention can take the form of a computer program product accessible from, for example, a computer-usable or computer-readable medium. A computer-usable or computer-readable medium can be any device that can, for example, tangibly contain, store, communicate, or transport the program for use by or in connection with any processor. The medium can be, for example, an electronic, magnetic, optical, electromagnetic, or a semiconductor device. Other suitable mediums are also available.
The above-described embodiments have been described in order to allow easy understanding of the present invention and do not limit the present invention. On the contrary, the invention is intended to cover various modifications and equivalent arrangements included within the scope of the appended claims, which scope is to be accorded the broadest interpretation so as to encompass all such modifications and equivalent structure as is permitted under the law.
This application is a continuation of U.S. patent application Ser. No. 13/182,136, filed Jul. 13, 2011, and entitled, “METHOD AND APPARATUS FOR DATA COMPRESSION USING CONTENT-BASED FEATURES,” the entirety of which is incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
5168352 | Naka et al. | Dec 1992 | A |
5241382 | Paik et al. | Aug 1993 | A |
5402146 | Rodriguez et al. | Mar 1995 | A |
5557334 | Legate | Sep 1996 | A |
5821997 | Kawamura et al. | Oct 1998 | A |
5907586 | Katsuragawa et al. | May 1999 | A |
5986707 | Geshwind | Nov 1999 | A |
6025882 | Geshwind | Feb 2000 | A |
6366705 | Chiu et al. | Apr 2002 | B1 |
6476805 | Shum et al. | Nov 2002 | B1 |
6661463 | Geshwind | Dec 2003 | B1 |
6675158 | Rising et al. | Jan 2004 | B1 |
6704022 | Aleksic | Mar 2004 | B1 |
6832006 | Savakis et al. | Dec 2004 | B2 |
6968012 | Meggers | Nov 2005 | B1 |
7296031 | Platt et al. | Nov 2007 | B1 |
7412425 | Rifkin et al. | Aug 2008 | B2 |
7613270 | Komaili et al. | Nov 2009 | B2 |
7653252 | Hernandez et al. | Jan 2010 | B2 |
7903737 | Martinian et al. | Mar 2011 | B2 |
8131786 | Bengio et al. | Mar 2012 | B1 |
8176523 | Kortum et al. | May 2012 | B2 |
8185403 | Pang et al. | May 2012 | B2 |
8284837 | Yin et al. | Oct 2012 | B2 |
8463719 | Lyon et al. | Jun 2013 | B2 |
8787454 | Chechik et al. | Jul 2014 | B1 |
20010003813 | Sugano et al. | Jun 2001 | A1 |
20020114455 | Asahi et al. | Aug 2002 | A1 |
20020136396 | Witty et al. | Sep 2002 | A1 |
20020176353 | Atlas et al. | Nov 2002 | A1 |
20030033347 | Bolle et al. | Feb 2003 | A1 |
20030059121 | Savakis et al. | Mar 2003 | A1 |
20030133505 | Koyanagi | Jul 2003 | A1 |
20030169934 | Naito | Sep 2003 | A1 |
20030221541 | Platt | Dec 2003 | A1 |
20040120594 | Vitali et al. | Jun 2004 | A1 |
20040125877 | Chang et al. | Jul 2004 | A1 |
20040179110 | Hashimoto | Sep 2004 | A1 |
20040190633 | Ali et al. | Sep 2004 | A1 |
20050063472 | Vella et al. | Mar 2005 | A1 |
20060029364 | Kosugi | Feb 2006 | A1 |
20060092282 | Herley et al. | May 2006 | A1 |
20060235812 | Rifkin et al. | Oct 2006 | A1 |
20060269161 | Ramsay et al. | Nov 2006 | A1 |
20070019729 | Nakagomi et al. | Jan 2007 | A1 |
20070093716 | Radulescu | Apr 2007 | A1 |
20070121722 | Martinian et al. | May 2007 | A1 |
20070133679 | Yang et al. | Jun 2007 | A1 |
20070146553 | Mori et al. | Jun 2007 | A1 |
20070171982 | Meggers | Jul 2007 | A1 |
20070242138 | Manico et al. | Oct 2007 | A1 |
20070280350 | Mathew et al. | Dec 2007 | A1 |
20080059159 | Komaili et al. | Mar 2008 | A1 |
20080165861 | Wen et al. | Jul 2008 | A1 |
20080228576 | Yonezaki | Sep 2008 | A1 |
20100027663 | Dai et al. | Feb 2010 | A1 |
20100061461 | Bankoski et al. | Mar 2010 | A1 |
20100098155 | Demircin et al. | Apr 2010 | A1 |
20100166069 | Goel | Jul 2010 | A1 |
20100172404 | Isnardi et al. | Jul 2010 | A1 |
20100260268 | Cowan et al. | Oct 2010 | A1 |
20110087673 | Chen et al. | Apr 2011 | A1 |
20110119212 | De Bruin et al. | May 2011 | A1 |
20110150085 | Andrijanic et al. | Jun 2011 | A1 |
20110299721 | He et al. | Dec 2011 | A1 |
20120051440 | Parfenov et al. | Mar 2012 | A1 |
20120260145 | Yang et al. | Oct 2012 | A1 |
Entry |
---|
“Series H: Audiovisual and Multimedia Systems; Infrastructure of audiovisual services—Coding of moving video; Advanced video coding for generic audiovisual services”. H.264. Version 1. International Telecommunication Union. Dated May 2003. |
“Series H: Audiovisual and Multimedia Systems; Infrastructure of audiovisual services—Coding of moving video; Advanced video coding for generic audiovisual services”. H.264. Version 3. International Telecommunication Union. Dated Mar. 2005. |
“Overview; VP7 Data Format and Decoder”. Version 1.5. On2 Technologies. Inc. Dated Mar. 28, 2005. |
“Series H: Audiovisual and Multimedia Systems; Infrastructure of audiovisual services—Coding of moving video; Advanced video coding for generic audiovisual services”. H.264. Amendment 1: Support of additional colour spaces and removal of the High 4:4:4 Profile. International Telecommunication Union. Dated Jun. 2006. |
“VP6 Bitstream & Decoder Specification”. Version 1.02. On2 Technologies, Inc. Dated Aug. 17, 2006. |
“Series H: Audiovisual and Multimedia Systems; Infrastructure of audiovisual services—Coding of moving video”. H.264. Amendment 2: New profiles for professional applications. International Telecommunication Union. Dated Apr. 2007. |
“VP6 Bitstream & Decoder Specification”. Version 1.03. On2 Technologies, Inc. Dated Oct. 29, 2007. |
“Series H: Audiovisual and Multimedia Systems; Infrastructure of audiovisual services—Coding of moving video”. H.264. Advanced video coding for generic audiovisual services. Version 8. International Telecommunication Union. Dated Nov. 1, 2007. |
“Series H: Audiovisual and Multimedia Systems; Infrastructure of audiovisual services—Coding of moving video”. H.264. Advanced video coding for generic audiovisual services. International Telecommunication Union. Version 11. Dated Mar. 2009. |
“Series H: Audiovisual and Multimedia Systems; Infrastructure of audiovisual services—Coding of moving video”. H.264. Advanced video coding for generic audiovisual services. International Telecommunication Union. Version 12. Dated Mar. 2010. |
“Implementors' Guide; Series H: Audiovisual and Multimedia Systems; Coding of moving video: Implementors Guide for H.264: Advanced video coding for generic audiovisual services”. H.264. International Telecommunication Union. Version 12. Dated Jul. 30, 2010. |
“VP8 Data Format and Decoding Guide”. WebM Project. Google On2. Dated: Dec. 1, 2010. |
Bankoski, et al., “VP8 Data Format and Decoding Guide; drafl-bankoski-vp8-bitstream-02” Network Working Group. Dated May 18, 2011. |
Office Action for U.S. Appl. No. 13/182,136, dated Aug. 12, 2013, 93 pages. |
Grainer, et al “A Discriminative Kernel-Based Model to Rank Images from Text Queries”, Aug. 2008. |
Office Action for U.S. Appl. No. 13/182,136, dated Dec. 27, 2013, 45 pages. |
Wang, et al, “Rate Scalable Video Coding Using a Foveation-Based Human Visual System Model,” 2001. |
Ong, et al, “Perceptual Quality Metric for H.264 Low Bit Rate Videos,” 2006. |
Notice of Allowance for U.S. Appl. No. 13/182,136, dated Mar. 10, 2014, 12 pages. |
Number | Date | Country | |
---|---|---|---|
Parent | 13182136 | Jul 2011 | US |
Child | 14301309 | US |