Apparatus and method for decoding video images

Television – Bandwidth reduction system

Patent

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

348390, 382233, 382234, H04N 730, H04N 732

Patent

active

060467738

DESCRIPTION:

BRIEF SUMMARY
DESCRIPTION

1. Field of the Invention
The invention relates to an apparatus and method for decoding video images, especially for decoding a video sequence, compressed according to a known data modelling method suitable for transmission or storage, into decompressed frames, suitable for viewing, said encoded data model comprising a plurality of spatial intensity change patterns, called intensity loads, a plurality of spatial address change patterns, called address loads, and a plurality of values, called scores, specifying for each frame how much of each load should be present. The invention further relates to a method for transforming a source image, consisting of picture elements given in integer positions in a first two-dimensional coordinate system, into a target image consisting of picture elements given in integer positions in a second two-dimensional coordinate system.
2. Background of the Invention
The use of digital techniques for transmission and storage of images is becoming more and more widespread. However, the high number of bits required to represent digital images in raw form is often a problem, demanding high transmission band width or large amounts of storage media. This is the motivation for using compression techniques, which aim at reducing the number of bits required to represent the images without impairing image quality too much.
Early methods of digital image transmission and storage used Pulse Code Modulation (PCM). More recent systems use digital compression techniques. One such compression technique is JPEG, where each frame is compressed as a still image, independent of the other frames. The frame is digitized into picture elements, called pixels, and the pixels are grouped together into blocks of 8.times.8 pixels. Each block is transformed using DCT (Discrete Cosine Transform). The transform coefficients are quantized and run length coded, and the result is then coded with a Variable Length Code like Huffman code or Arithmetic Coding. The resulting bit stream is then transmitted or stored.
In a TV signal, subsequent frames are often related to each other, in that the same objects can be seen in several frames, possibly at differing positions in the frame corresponding to object or camera motion. This gives rise to the family of motion compensated compression techniques. One such technique is MPEG. In MPEG, some frames are compressed using still image coding similar to JPEG. Other frames are coded by prediction and motion compensation: For each block, the encoder performs a search for the most similar block in a small search region around the current block position but in a previously transmitted frame. Only the position of the found best match relative to the current block position, called the motion vector for the block, need to be transferred, together with a DCT coded residual. The decoder can then reconstruct the frame by collecting pixels according to the motion vector, perform an inverse DCT on the coded residual and can then add the results together.
Research is being done on model based compression techniques, like wire frames or object-based region coding, but a commercial breakthrough has not come yet.
One possible application for digital compression and decompression techniques is the storage of video films on CD-ROMs. Without compression, less than one minute of a digitized video film can be put on a single disk. In order to store a full video film on a disk, compression techniques must be used. The resulting data must then be decompressed before or when it is viewed.
Another possible application is Video On Demand, implemented so that many users are connected to one common distribution central. Each user has the possibility to choose one from a large number of films for immediate playback, and the distribution central must then transmit the wanted film to this user. A highest possible number of users is wanted, and they should be interconnected using a least possible expensive cable network. The distribution central therefore often uses compression techniques, cre

REFERENCES:
patent: 5067019 (1991-11-01), Juday et al.
patent: 5363475 (1994-11-01), Baker et al.
patent: 5479603 (1995-12-01), Stone et al.
patent: 5497498 (1996-03-01), Taylor
patent: 5759044 (1998-06-01), Redmond
patent: 5765011 (1998-06-01), Wilkinson et al.
Yuichiro Nakaya and Hiroshi Harashima, An Iterative Motion Estimation Method Using Triangular Patches For Motion Compensation, Nov. 11, 1991, pp. 546-557/SPIE vol. 1605, Visual Communications and Image Processing '91.
Norbert Diehl, Object-Oriented Motion Estimation and Segmentation in Image Sequences, vol. 3, No. 1, Signal Processing: Image Communications, Feb. 1991, pp. 23-56.
S. Hartwig, W. Endemann, Digitale Bildcodierung, FKT Fernseh-und Kino-Technik, Jan. 1993, pp. 33-42.
Y. Nakaya and H. Harashima, Motion Compensation at Very Low Rates, PCS'93 1993 Picture Coding Symposium Proceedings, Swiss Federal Institute of Technology, Lausanne, Switzerland, Mar. 17, 1993, pp. 10.2/a-b.
Chung-Lin Huang and Chao-Yuen Hsu, A New Motion Compensation Method For Image Sequence Coding Using Hierarchical Grid Interpolation, IEEE Transactions on Circuits and Systems for Video Technology, Feb. 4, 1994, vol. 4, No. 1.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Apparatus and method for decoding video images does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Apparatus and method for decoding video images, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Apparatus and method for decoding video images will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-370096

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.