Efficient encoding algorithms for delivery of server-centric interactive program guide

• US 7,433,406 B2
• Filed: 10/30/2003
• Issued: 10/07/2008
• Est. Priority Date: 04/15/1999
• Status: Expired due to Term

• Current Assignee: TiVo Corporation (Adeia Inc.)
• Original Assignee: Sedna Patent Services LLC
• Inventors: Edmonds, Jeremy S., Gordon, Donald F., Bayrakeri, Sadik, Ludvig, Edward A., Comito, John P., Gershtein, Eugene
• Primary Examiner(s): PHILIPPE, GIMS S
• Application Number:
  US10/697,623
• Publication Number:
  US 20040086040A1
• Time in Patent Office: 1,804 Days
• Field of Search: 375/240.26, 375/240.01, 375/240.12, 375/240.28, 375/240.1, 382/232, 382/260, 382/261, 348/699, 725/39, 725/43, 725/66, 725/68, 725/138
• US Class Current: 375/240.1
• CPC Class Codes: H04N 19/00 Methods or arrangements for coding, decoding, compressing or decompressing digital video signals
• CPC Class Codes: H04N 19/577 Motion compensation with bidirectional frame interpolation, i.e. using B-pictures
• CPC Class Codes: H04N 21/23424 involving splicing one content stream with another content stream, e.g. for inserting or substituting an advertisement
• CPC Class Codes: H04N 21/23608 Remultiplexing multiplex streams, e.g. involving modifying time stamps or remapping the packet identifiers
• CPC Class Codes: H04N 21/23614 Multiplexing of additional data and video streams arrangements for simultaneous broadcast of plural pieces of information H04H20/28
• CPC Class Codes: H04N 21/2365 Multiplexing of several video streams
• CPC Class Codes: H04N 21/4143 embedded in a Personal Computer [PC]
• CPC Class Codes: H04N 21/4316 for displaying supplemental content in a region of the screen, e.g. an advertisement in a separate window
• CPC Class Codes: H04N 21/4344 Remultiplexing of multiplex streams, e.g. by modifying time stamps or remapping the packet identifiers
• CPC Class Codes: H04N 21/4347 Demultiplexing of several video streams
• CPC Class Codes: H04N 21/4348 Demultiplexing of additional data and video streams
• CPC Class Codes: H04N 21/44016 involving splicing one content stream with another content stream, e.g. for substituting a video clip
• CPC Class Codes: H04N 21/4532 involving end-user characteristics, e.g. viewer profile, preferences monitoring of user activities for profile generation for accessing a video database G06F16/739; user profiles in network data switching protocols H04L67/306; processing of user preferences or user profiles in wireless networks H04W8/18
• CPC Class Codes: H04N 21/47 End-user applications
• CPC Class Codes: H04N 21/482 End-user interface for program selection broadcast systems using EPGs H04H60/72
• CPC Class Codes: H04N 21/4821 using a grid, e.g. sorted out by channel and broadcast time
• CPC Class Codes: H04N 21/6547 comprising parameters, e.g. for client setup
• CPC Class Codes: H04N 21/84 Generation or processing of descriptive data, e.g. content descriptors systems specially adapted for using meta-information in broadcast systems H04H60/73
• CPC Class Codes: H04N 5/45 Picture in picture , e.g. displaying simultaneously another television channel in a region of the screen
• CPC Class Codes: H04N 7/163 by receiver means only
• CPC Class Codes: H04N 7/165 : Centralised control of user terminal subsequent to an upstream request signal H04N7/17345; Registering at central by two-way working H04N7/17309

Abstract

A data structure for representing program data that includes a number of streams. Each stream comprises a group of pictures (GOP) having a first picture and remaining pictures. The data structure includes a first set of one or more elements for representing data for the first pictures in the GOPs, and a second set of one or more elements for representing data for the remaining pictures in the GOPs. At least one element in the first set represents data for the first picture of at least one respective GOP, with each such first picture having been encoded as a reference I picture. Each remaining element (if any) in the first set represents data for the first picture of a respective remaining GOP, with each such remaining first picture having been encoded as either a difference picture or a P picture. Each element in the second set represents data for a particular remaining picture in one of the GOPs, with each such remaining picture having been encoded as either a P or B picture. Each stream is represented by one or more elements in the first set and one or more elements in the second set.

Claims

1. A computer readable medium for storing a computer program which, when executed by a processor, provides a data structure for representing a plurality of image frame sequences, where each image frame sequence comprises image frames having common image frame portions and respective image frame portions, each of said plurality of image frame sequences having associated with it a respective stream, wherein each stream comprises groups of pictures (GOP) having a first picture and at least one remaining picture, the data structure comprising:

a first set of at least one element for representing data for the first pictures in the plurality of GOPs, wherein each of at least one element in the first set represents data for at least a portion of the first picture of a respective GOP encoded as an I-picture, and wherein each of remaining elements in the first set represents data for at least a portion of the first picture of a respective remaining GOP encoded as at least one of a B-picture and a P-picture; and

a second set of one or more elements for representing data for the one or more remaining pictures in the plurality of GOPs, wherein each element in the second set represents data for at least a portion of a particular remaining picture in one of the plurality of GOPs encoded as at least one of a B-picture and a P-picture, and

wherein each of the plurality of streams is represented by one or more elements in the first set and one or more elements in the second set.

2. The computer readable medium of claim 1, wherein the first set includes a plurality of elements, one element for each of the plurality of GOPs.

3. The computer readable medium of claim 2, wherein each of the elements in the first set represents data of the first picture of a respective GOP encoded as an I-picture.

4. The computer readable medium of claim 2, wherein one element in the first set represents data of the first picture of a particular GOP encoded as an I-picture, and

wherein each remaining element in the first set represents data of the first picture of a respective remaining GOP encoded as a difference picture.

5. The computer readable medium of claim 1, wherein the first set includes a single element for representing data for the first picture of one of the plurality of GOPs.

6. The computer readable medium of claim 1, wherein the second set includes a plurality of elements, one element for each of the remaining pictures in one particular GOP.

7. The computer readable medium of claim 6, wherein the elements in the second set represent data for the particular GOP.

8. The computer readable medium of claim 6, wherein each of the elements in the second set represents data for a respective remaining picture of the particular GOP, which is encoded as either a P picture or a B picture.

9. The computer readable medium of claim 6, wherein the elements in the second set represents data for at least one remaining picture of each of the plurality of GOPs.

10. The computer readable medium of claim 1, wherein each picture of the plurality of GOPs includes

a first portion indicative of static information, and

a second portion indicative of moving information,

information for one or more groups of channels.

11. The computer readable medium of claim 1, wherein the pictures are encoded using slice-based encoding.

12. A computer readable medium for storing a computer program which, when executed by a processor, provides a data structure, comprising:

a multiplexed stream comprising a plurality of video streams representing respective first portions of a group of pictures (GOP) information structure, each of said respective first portions including an access unit associated with an I-picture, and a video stream representing a remaining portion of said GOP information structure including at least one of an access unit associated with a P-picture and an access unit associated with a B-picture, wherein;

a concatenation of one of said respective first portions of said GOP information structure and said remaining portion of said GOP structure results in a complete GOP information structure.

13. The computer readable medium of claim 12, wherein:

said data structure provides imagery for a plurality of image screens, each of said plurality of image screens including imagery common to all of said plurality of image screens and imagery not common to all of said plurality of image screens;

said respective first portions of said GOP structure including both common and non-common screen imagery, said respective second portions of said GOP structure including at least common screen imagery.

14. The computer readable medium of claim 12, wherein said GOP comprises one of a closed GOP data structure and an open GOP data structure.

15. The computer readable medium of claim 12, wherein said multiplexed stream comprises a transport stream.

16. A method, comprising:

multiplexing each of a plurality of video streams representing respective first portions of groups of pictures (GOP) information structures, each of said respective first portions including an access unit associated with an I-picture, and a video stream representing a remaining portion of said GOP information structure including at least one of an access unit associated with a P-picture and an access unit associated with a B-picture, wherein;

a concatenation of one of said respective first portions of said GOP information structure and said remaining portion of said GOP structure results in a complete GOP information structure.