Video coding -> Monitor Keywords
Fresh Patents
Monitor Patents Patent Organizer File a Provisional Patent Browse Inventors Browse Industry Browse Agents Browse Locations
site info Site News  |  monitor Monitor Keywords  |  monitor archive Monitor Archive  |  organizer Organizer  |  account info Account Info  |  
08/16/07 - USPTO Class 375 |  111 views | #20070189398 | Prev - Next | About this Page  375 rss/xml feed  monitor keywords

Video coding

USPTO Application #: 20070189398
Title: Video coding
Abstract: A method of encoding a video signal representing a sequence of pictures, the method comprising comparing a first picture with a second picture, calculating a measure of the similarity between the first and the second pictures, comparing the measure of similarity with a predetermined criterion of similarity and, when the measure of similarity does not meet the predetermined criterion of similarity, outputting an indicator indicating that a non-temporally predictive error concealment method should be used by a subsequent decoder and, when the measure of similarity meets the predetermined criterion of similarity, outputting an indicator indicating that a temporally predictive error concealment method should be used by a subsequent decoder. (end of abstract)



Agent: Foley & Lardner LLP - San Diego, CA, US
Inventors: Miska Hannuksela, Kerem Caglar
USPTO Applicaton #: 20070189398 - Class: 375240270 (USPTO)

Related Patent Categories: Pulse Or Digital Communications, Bandwidth Reduction Or Expansion, Television Or Motion Video Signal, Associated Signal Processing, Error Detection Or Correction

Video coding description/claims


The Patent Description & Claims data below is from USPTO Patent Application 20070189398, Video coding.

Brief Patent Description - Full Patent Description - Patent Application Claims
  monitor keywords

BACKGROUND OF THE INVENTION

[0001] This invention relates to video coding and in particular to concealing artifacts introduced by errors.

[0002] A video sequence consists of a series of still pictures or frames. Video compression methods are based on reducing the redundant and perceptually irrelevant parts of video sequences. The redundancy in video sequences can be categorized into spectral, spatial and temporal redundancy. Spectral redundancy refers to the similarity between the different colour components of the same picture. Spatial redundancy results from the similarity between neighbouring pixels in a picture. Temporal redundancy exists because objects appearing in a previous image are also likely to appear in the current image. Compression can be achieved by taking advantage of this temporal redundancy and predicting the current picture from another picture, termed an anchor or reference picture. Further compression is achieved by generating motion compensation data that describes the motion between the current picture and the reference picture.

[0003] However, sufficient compression cannot usually be achieved by only reducing the inherent redundancy of the sequence. Thus, video encoders also try to reduce the quality of those parts of the video sequence which are subjectively less important. In addition, the redundancy of the encoded bit-stream is reduced by means of efficient lossless coding of compression parameters and coefficients. The main technique is to use variable length codes.

[0004] Video compression methods typically differentiate between pictures that utilise temporal redundancy reduction and those that do not, Compressed pictures that do not utilise temporal redundancy reduction methods are usually called INTRA or I-frames or I-pictures Temporally predicted images are usually forwardly predicted from a picture occurring before the current picture and are called INTER or P-frames. In the INTER frame case, the predicted motion compensated picture is rarely precise enough and therefore a spatially compressed prediction error frame is associated with each INTER frame. INTER pictures may contain INTRA-coded areas.

[0005] Many video compression schemes also use temporally bi-directionally predicted frames, which are commonly referred to as B-pictures or B-frames. B-pictures are inserted between anchor picture pairs of I- and/or P-frames and are predicted from either one or both of these anchor pictures. B-pictures normally yield increased compression as compared with forward-predicted pictures B-pictures are not used as anchor pictures, i.e., other pictures are not predicted from them. Therefore they can be discarded (intentionally or unintentionally) without impacting the picture quality of future pictures. Whilst B-pictures may improve compression performance as compared with P pictures, their generation requires greater computational complexity and memory usage, and they introduce additional delays. This may not be a problem for non-real time encoding such as video streaming but may cause problems in real-time applications such as video-conferencing.

[0006] A compressed video clip typically consists of a sequence of pictures, which can be roughly categorized into temporally independent INTRA pictures and temporally differentially coded INTER pictures. Since the compression efficiency in INTRA pictures is normally lower than in INTER pictures, INTRA pictures are used sparingly, especially in low bit-rate applications.

[0007] A video sequence may consist of a number of scenes or shots. The picture contents may be remarkably different from one scene to another, and therefore the first picture of a scene is typically INTRA-coded. There are frequent scene changes in television and film material, whereas scene cuts are relatively rare in video conferencing. In addition, INTRA pictures are typically inserted to stop temporal propagation of transmission errors in a reconstructed video signal and to provide random access points to a video bitstream.

[0008] Compressed video is easily corrupted by transmission errors, mainly for two reasons. Firstly, due to utilisation of temporal predictive differential coding (INTER frames), an error is propagated both spatially and temporally. In practice this means that, once an error occurs, it is easily visible to the human eye for a relatively long time. Especially susceptible are transmissions at low bit-rates where there are only a few INTRA-coded frames, so temporal error propagation is not stopped for some time. Secondly, the use of variable length codes increases the susceptibility to errors. When a bit error alters the codeword, the decoder will lose codeword synchronisation and also decode subsequent error-free codewords (comprising several bits) incorrectly until the next synchronisation (or start) code. A synchronisation code is a bit pattern which cannot be generated from any legal combination of other codewords and such codes are added to the bit stream at intervals to enable resynchronisation. In addition, errors occur when data is lost during transmission. For example, in video applications using the unreliable UDP transport protocol in IP networks, network elements may discard parts of the encoded video bit-stream.

[0009] There are many ways for the receiver to address the corruption introduced in the transmission path. In general, on receipt of a signal, transmission errors are first detected and then corrected or concealed by the receiver. Error correction refers to the process of recovering the erroneous data perfectly as if no errors had been introduced in the first place. Error concealment refers to the process of concealing the effects of transmission errors so that they are hardly visible in the reconstructed video sequence. Typically some amount of redundancy is added by the source or transport coding in order to help error detection, correction and concealment. Error concealment techniques can be roughly classified into three categories: forward error concealment, error concealment by post-processing and interactive error concealment. The term "forward error concealment` refers to those techniques in which the transmitter side adds redundancy to the transmitted data to enhance the error resilience of the encoded data. Error concealment by post-processing refers to operations at the decoder in response to characteristics of the received signals. These methods estimate the correct representation of erroneously received data. In interactive error concealment, the transmitter and receiver co-operate in order to minimize the effect of transmission errors. These methods heavily utilise feedback information provided by the receiver. Error concealment by post-processing can also be referred to as passive error concealment whereas the other two categories represent forms of active error concealment.

[0010] There are numerous known concealment algorithms, a review of which is given by Y. Wang and Q.-F. Zhu in "Error Control and Concealment for Video Communication: A Review", Proceedings of the IEEE, Vol. 86, No. 5, May 1998, pp. 974-997 and an article by P. Salama, N. B. Shroff, and E. J. Delp, "Error Concealment in Encoded Video," submitted to IEEE Journal on Selected Areas in Communications.

[0011] Current video coding standards define a syntax for a self-sufficient video bitstream. The most popular standards at the time of writing are ITU-T Recommendation H263, "Video coding for low bit rate communication", February 1998; ISO/IEC 14496-2, "Generic Coding of Audio-Visual Objects. Part 2: Visual", 1999 (known as MPEG-4); and ITU-T Recommendation H.262 (ISOiIEC 13818-2) (known as MPEG-2). These standards define a hierarchy for bit-streams and correspondingly for image sequences and images.

[0012] To assist in error concealment. the MPEG-2 video coding standard allows for the transmission of motion vectors for INTRA macroblocks within INTRA pictures. These motion vectors are used only for error concealment. as follows: if are INTRA macroblock is lost (or corrupted), the decoder uses the motion vectors belonging to the macroblock above the lost one to get resembling blocks from a reference picture. If the INTRA macroblock does not contain motion information, the decoder conceals the errors with a spatial algorithm.

[0013] In H.263, the syntax has a hierarchical structure with four layers: picture, picture segment, macroblock, and block layer. The picture layer data contain parameters affecting the whole picture area and the decoding of the picture data. Most of this data is arranged in a so-called picture header.

[0014] The picture segment layer can either be a group of blocks layer or a slice layer. By default, each picture is divided into groups of blocks. A group of blocks (GOB) typically comprises 16 successive pixel lines. Data for each GOB consists of an optional GOB header followed by data for macroblocks. If the optional slice structured mode is used, each picture is divided into slices instead of GOBs. A slice contains a number of successive macroblocks in scan-order. Data for each slice consists of a slice header followed by data for the macroblocks.

[0015] Each GOB or slice is divided into macroblocks. A macroblock relates to 16.times.16 pixels (or 2.times.2 blocks) of luminance and the spatially corresponding 8.times.8 pixels (or block) of chrominance components. A block relates to 8.times.8 pixels of luminance or chrominance.

[0016] Block layer data consist of uniformly quantised discrete cosine transform coefficients, which are scanned in zigzag order, processed with a run-length encoder and coded with variable length codes. MPEG-2 and MPEG-4 layer hierarchies resemble that used in H.263.

[0017] In H.263, the issue of error concealment is typically perceived as a postprocessing function and is generally left to the decoder. In ITU-T Study Group 16 Question 15 documents no. 17, 18, 19, 20, 21 & 22, presented at the Ninth meeting of ITU-T Study Group 16 in New Jersey in the USA in October 1999, it is proposed to add normative language to H.263 to specify several error concealment techniques and to define a signalling mechanism by which an encoder can announce this to a decoder, preferably on a picture-by-picture basis.

[0018] However this approach is unduly restrictive on the decoder since the error concealment method to be used by the decoder is specified by the encoder. Thus other concealment methods cannot be used, even if the decoder has these methods available to use.

SUMMARY OF THE INVENTION

[0019] According to a first aspect of the invention there is provided a method of encoding a video signal representing a sequence of pictures, the method comprising comparing a first picture with a second picture, calculating a measure of the similarity between the first and the second pictures, comparing the measure of similarity with a predetermined criterion of similarity and, when the measure of similarity does not meet the predetermined criterion of similarity, outputting an indicator indicating that a non-temporally predictive error concealment method should be used by a subsequent decoder and, when the measure of similarity meets the predetermined criterion of similarity, outputting an indicator indicating that a temporally predictive error concealment method should be used by a subsequent decoder.

[0020] Consequently, the decoder is free to choose an appropriate type of error concealment method for a corrupted picture on the basis of the indicator. However the indicator does not specify a particular algorithm and thus the decoder is not restricted to using a particular algorithm.

[0021] Preferably the error concealment indicator is updated when the measure of similarity does not meet the predetermined criterion, The indicator then indicates what may be viewed as a change in scene.

[0022] Thus the invention enables the decoder to detect which pictures belong to the same scene and, on the basis of this indication, to select an appropriate type of error concealment method, if required. Thus, when the error concealment indicator changes from one frame to another, the decoder responds by applying a non-predictive error concealment method. If the error concealment indicator is the same from one frame to another, responds by applying a temporally predictive error concealment method.

Continue reading about Video coding...
Full patent description for Video coding

Brief Patent Description - Full Patent Description - Patent Application Claims

Click on the above for other options relating to this Video coding patent application.
###
monitor keywords

How KEYWORD MONITOR works... a FREE service from FreshPatents
1. Sign up (takes 30 seconds). 2. Fill in the keywords to be monitored.
3. Each week you receive an email with patent applications related to your keywords.  
Start now! - Receive info on patent apps like Video coding or other areas of interest.
###


Previous Patent Application:
Video encoding method and apparatus, video decoding method and apparatus, programs therefor, and storage media for storing the programs
Next Patent Application:
Wireless video link synchronization
Industry Class:
Pulse or digital communications

###

FreshPatents.com Support
Thank you for viewing the Video coding patent info.
IP-related news and info


Results in 0.1743 seconds


Other interesting Feshpatents.com categories:
Medical: Surgery Surgery(2) Surgery(3) Drug Drug(2) Prosthesis Dentistry   174
filepatents (1K)

* Protect your Inventions
* US Patent Office filing
patentexpress PATENT INFO