Seamless multimedia branching

• US 6,111,567 A
• Filed: 04/03/1997
• Issued: 08/29/2000
• Est. Priority Date: 04/03/1997
• Status: Expired due to Term

• Current Assignee: Microsoft Technology Licensing LLC (Microsoft Corporation)
• Original Assignee: Microsoft Corporation
• Inventors: Sun, Yi, Nelson, Robert B., Savchenko, Alexander V., Nirkhe, Vivek
• Primary Examiner(s): Breene, John E.
• Assistant Examiner(s): Robinson, Greta L.
• Application Number:
  US08/826,545
• Time in Patent Office: 1,244 Days
• Field of Search: 345/302, 707/104, 707/514, 707/512, 709/103, 709/102
• US Class Current: 715/202
• CPC Class Codes: G06F 16/40 of multimedia data, e.g. slideshows comprising image and additional audio data retrieval of still image data G06F16/50; retrieval of audio data G06F16/60; retrieval of video data G06F16/70
• CPC Class Codes: G06F 16/48 Retrieval characterised by using metadata, e.g. metadata not derived from the content or metadata generated manually
• CPC Class Codes: Y10S 707/99945 Object-oriented database structure processing
• CPC Class Codes: Y10S 707/99948 Application of database or data structure, e.g. distributed, multimedia, or image
• CPC Class Codes: Y10S 707/99953 Recoverability

Abstract

Described above are methods of authoring multimedia titles and of storing and delivering multimedia content that implements guaranteed seamless branching on digital media with high seek latency and a fixed upper bound on this latency. Continuous media content is arranged as individual clips on a storage medium. Seamless branches between clips are identified by an author. A method is disclosed to identify individual clips as carrier clips or non-carrier clips to guarantee specified seamless behavior while optimizing bridge memory usage and availability of seamless jumps. Bridge data of a particular target media clip is interleaved or otherwise associated on the storage medium with a carrier clip that is upstream of the target media clip, and delivered along with the upstream media clip. As bridge data are delivered, they are stored in bridge memory, to be used to implement a subsequent seamless branch. After the branch is implemented or after the branch is no longer an option, the bridge data is cleared from the bridge memory. Additional methods are disclosed for dealing with intervening file access and for accounting for no-latency branches that are possible when using some forms of storage devices.

Claims

1. A method of authoring a media title comprising a plurality of continuous media clips connected by seamless branches, the media clips having bridge data, the method comprising:

assigning certain media clips to be non-carrier clips;

assigning other media clips to be carrier clips;

identifying a target bridge set corresponding to respective media clips wherein a target bridge set corresponding to a particular media clip comprises (a) target bridge sets of all non-carrier clips that are immediate targets of the particular media clip and (b) the bridge data of all carrier clips that are immediate targets of the particular media clip;

identifying the largest target bridge set, wherein the largest target bridge set corresponds to a minimum requirement for bridge memory; and

scheduling delivery of bridge data for media clips during immediately upstream carrier clips.

2. A method as recited in claim 1, wherein some of the non-carrier clips are data clips having no outgoing branches, wherein the bridge data of a data clip comprises the entire data clip.

3. A method as recited in claim 1, further comprising a step of disallowing seamless branches during initial parts of carrier clips until bridge data has been delivered.

4. A method as recited in claim 1, wherein some of the branches are no-latency seamless branches, wherein the scheduling step does not include scheduling delivery of bridge data for target clips of no-latency seamless branches.

5. A method as recited in claim 1, further comprising a step of calculating bridge memory requirements based on a particular assignment of carrier and non-carrier clips.

6. A method as recited in claim 1, further comprising the following additional steps:

calculating bridge memory requirements based on a particular assignment of carrier and non-carrier clips;

reassigning individual media clips to be carrier or non-carrier clips to change bridge memory requirements.

7. A method of scheduling bridge data delivery in a seamless domain of media clips having bridge data and having seamless branches between the media clips, the method comprising the following steps:

assigning at least one of the media clips to be a carrier clip and at least another of the media clips to be non-carrier clip, wherein said carrier and non-carrier clips are connected by seamless branches to target media clips;

defining target bridge sets corresponding to respective media clips, wherein a target bridge set for a particular media clip comprises a union of (a) target bridge sets of non-carrier clips that are immediate targets of the particular media clip and (b) bridge data of media clips that are immediate targets of the particular media clip; and

scheduling the target bridge set of a particular carrier clip to be delivered during said carrier clip.

8. A method as recited in claim 7, wherein the target bridge set corresponding to a particular carrier clip does not include any bridge data that is included in the target bridge sets of all media clips that are immediately upstream of the particular carrier clip.

9. A method as recited in claim 7, further comprising a step of designating any entry media clip having an outgoing seamless branch as a carrier clip.

10. A method as recited in claim 7, further comprising a step of assigning further media clips to be carrier clips as required to limit target bridge sets to a predetermined bridge memory size.

11. A method as recited in claim 7, wherein some of the non-carrier clips are data media clips having no outgoing branches, and wherein the bridge data corresponding to a particular data clip comprises the whole data clip.

12. A method as recited in claim 7, further comprising a step of interleaving the target bridge set of a particular carrier clip in said carrier clip.

13. A method as recited in claim 7, wherein said target bridge set corresponding to said particular media clip does not include bridge data of any media clips that are targeted by no-latency branches from said particular media clip.

14. A media authoring tool that utilizes the steps of claim 7 to assist an author in preparing a media work.

15. A computer-readable storage medium containing computer-executable instructions for performing the steps of claim 7.

16. A method of determining minimum requirements for bridge memory in a system having a plurality of continuous media clips interconnected by seamless branches from source clips to target clips, each media clip being designated as a carrier clip or a non-carrier clip and having bridge data, the method comprising the following steps:

identifying target bridge sets corresponding to respective media clips, wherein a target bridge set for a particular media clip comprises a union of (a) target bridge sets of non-carrier clips that are immediate targets of the particular media clip and (b) bridge data of media clips that are immediate targets of the particular media clip; and

determining sizes of the target bridge sets;

wherein the minimum requirement for bridge memory corresponds to the largest target bridge set.

17. A method as recited in claim 16, wherein the target bridge set corresponding to a particular carrier clip does not include any bridge data that is included in the target bridge sets of all media clips that are immediately upstream of the particular carrier clip.

18. A method as recited in claim 16, wherein some of the non-carrier clips are data clips having no outgoing branches, wherein the bridge data corresponding to a particular data clip comprises the whole data clip.

19. A method as recited in claim 16, wherein said target bridge set corresponding to said particular media clip does not include bridge data of any media clips that are targeted by no-latency branches from said particular media clip.

20. A media authoring tool that utilizes the steps of claim 16 to assist an author in preparing a media work.

21. A computer-readable storage medium containing computer-executable instructions for performing the step of claim 16.

22. A computer-readable storage medium containing computer-executable instructions for performing steps comprising:

specifying a plurality of continuous media clips;

designating seamless branches from source media clips to target media clips, in response to user instructions;

designating as carrier clips a plurality of media clips that are not assigned by a user to be non-carrier clips;

defining target bridge sets corresponding to respective media clips, wherein a target bridge set for a particular media clip comprises a union of (a) target bridge sets of non-carrier clips that are immediate targets of the particular media clip and (b) bridge data of media clips that are immediate targets of the particular media clip; and

scheduling the target bridge set of a particular carrier clip to be delivered during said carrier clip.

23. A computer-readable storage medium as recited in claim 22, wherein the target bridge set corresponding to a particular carrier clip does not include any bridge data that is included in the target bridge sets of all media clips that are immediately upstream of the particular carrier clip.

24. A computer-readable storage medium as recited in claim 22, containing further instructions for performing additional steps comprising:

calculating the minimum size of bridge memory required for any configuration of carrier and non-carrier nodes by identifying the size of the largest target bridge set;

notifying the user of said minimum size of bridge memory.

25. A computer-readable storage medium as recited in claim 22, containing further instructions for performing an additional step of assigning any entry media clip having an outgoing seamless branch to be a carrier clip.

26. A computer-readable storage medium as recited in claim 22, containing further instructions for performing an additional step of assigning further media clips to be carrier clips as required to limit all target bridge sets to a predetermined bridge memory size.

27. A computer-readable storage medium as recited in claim 22, wherein some of the non-carrier clips are data media clips having no outgoing branches, and wherein the bridge data corresponding to a particular data clip comprises the whole data clip.

28. A computer-readable storage medium as recited in claim 22, containing further instructions for performing an additional step of interleaving target bridge sets in corresponding carrier clips.

29. A computer-readable storage medium as recited in claim 22, wherein said target bridge set corresponding to said particular media clip does not include bridge data of any media clips that are targeted by no-latency branches from said particular media clip.