US 7,472,198 B2Grant
Media file format to support switching between multiple timeline-altered media streams
Issue Date:2008-12-30
•10 Claims
•9 Drawing Sheets
Abstract
Media content is streamed from a server computer to a client computer. A media file format is used to store data for multiple timeline-altered streams that provides support for switching between the different timeline-altered streams during their presentation. In one aspect, a user can switch between different timeline-altered streams. Upon receiving a user request to switch to a particular timeline-altered stream (the target stream), the client computer accesses a time code stream data object corresponding to the current data unit being presented. The time code stream data object identifies a primary stream presentation time corresponding to the data unit. The client then uses the primary stream presentation time to index into a table of mappings to byte offsets. The table provides a mapping of the primary stream presentation time to a corresponding byte offset of the target stream.
Metadata
Assignee
- Microsoft Corporation
Inventors
- Anoop Gupta
- Nosakhare D. Omoigui
- Li-Wei He
Application Information
Application Number:US 11/945,006
Filing Date:2007-11-26
Priority Date:2000-05-03
Art Unit:2139
Classifications
IPC:
G06F15/16H04N7/08
Patent Drawings (9 sheets)
Description
Related Application
[0001] This is a continuation of U.S. patent application Ser. No. 09/564,297, titled “Media File Format to Support Switching Between Multiple Timeline-Altered Media Streams”, filed on May 3, 2000, which is hereby incorporated in its entirety by reference.
Background of the Invention
[0002] Multimedia streaming—the continuous delivery of synchronized media data like video, audio, text, and animation—is a critical link in the digital multimedia revolution. Today, streamed media is primarily about video and audio, but a richer, broader digital media era is emerging with a profound and growing impact on the Internet and digital broadcasting.
[0003] Synchronized media means multiple media objects that share a common timeline. Video and audio are examples of synchronized media—each is a separate data stream with its own data structure, but the two data streams are played back in synchronization with each other. Virtually any media type can have a timeline. For example, an image object can change like an animated .gif file: text can change and move, and animation and digital effects happen over time. This concept of synchronizing multiple media types is gaining greater meaning and currency with the emergence of more sophisticated media composition frameworks implied by MPEG-4, Dynamic HTML, and other media playback environments.
[0004] The term “streaming” is used to indicate that the data representing the various media types is provided over a network to a client computer on a real-time, as-needed basis, rather than being pre-delivered in its entirety before playback. Thus, the client computer renders streaming data as it is received from a network server, rather than waiting for an entire “file” to be delivered.
[0005] The widespread availability of streaming multimedia enables a variety of informational content that was not previously available over the Internet or other computer networks. Live content is one significant example of such content. Using streaming multimedia, audio, video, or audio/visual coverage of noteworthy events can be broadcast over the Internet as the events unfold. Similarly, television and radio stations can transmit their live content over the Internet.
[0006] A U.S. patent application entitled “Multimedia Timeline Modification in Networked Client/Server Systems,” filed Sep. 15, 1998, Ser. No. 09/153,664, by inventors Anoop Gupta and Nosakhare D. Omoigui, describes a system that allows a user to vary the playback speed of streaming multimedia content using time-scale modification technology. It was noted that both linear and non-linear timeline alteration techniques might be used.
[0007] When using linear techniques, time modification is applied consistently in times and across all individual streams of a composite media stream. With non-linear techniques, on the other hand, some segments of an individual or composite stream might be more highly expanded or compressed (in time) than other segments. This presents problems in switching and synchronizing between different versions of streams that have been non-linearly altered by different amounts or through the use of different non-linear techniques.
[0008] The invention described below addresses these problems, providing a media file format that supports switching between different timeline-altered streams.
Summary of the Invention
[0009] In a networked client/server system, media content is streamed from a server computer to a client computer. Multiple timeline-altered streams for the media content are stored using a media file format that provides support for switching between the different timeline-altered streams during their presentation. In one aspect, a user can switch between different timeline-altered streams. Upon receiving a user request to switch to a particular timeline-altered stream (the target stream), the client computer accesses a time code stream data object corresponding to the current data unit being presented. The time code stream data object identifies a primary stream presentation time corresponding to the data unit. The client then uses the primary stream presentation time to index into a table of mappings to byte offsets. The table provides a mapping of the primary stream presentation time to a corresponding byte offset of the target stream.
[0010] This Summary is provided to introduce a selection of concepts in a simplified form that are further described below in the detailed description. This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used as an aid in determining the scope of the claimed subject matter
Brief Description of the Drawings
[0011] The present invention is illustrated by way of example and not limitation in the figures of the accompanying drawings. The same numbers are used throughout the figures to reference like components and/or features.
[0012] FIG. 1 shows a client/server network system and environment in accordance with certain embodiments of the invention.
[0013] FIG. 2 shows a general example of a computer that can be used as a client or server in accordance with certain embodiments of the invention.
[0014] FIG. 3 illustrates the flow of a composite media stream in accordance with certain embodiments of the invention.
[0015] FIG. 4 illustrates an exemplary index table and exemplary time code streams corresponding to timeline-altered streams in accordance with certain embodiments of the invention.
[0016] FIG. 5 illustrates an exemplary index object in accordance with one implementation of the invention.
[0017] FIG. 6 illustrates an exemplary index parameters object in accordance with one implementation of the invention.
[0018] FIG. 7 illustrates an exemplary time-compressed stream properties object in accordance with one implementation of the invention.
[0019] FIG. 8 illustrates an exemplary time-compressed stream data unit object in accordance with one implementation of the invention.
[0020] FIG. 9 is a flowchart illustrating an exemplary process for switching between presentation of two different timeline-altered streams in accordance with certain embodiments of the invention.
Detailed Description
General Network Structure
[0021] FIG. 1 shows a client/server network system and environment in accordance with certain embodiments of the invention. Generally, the system includes a network server computer 102 and a plurality of network client computers 104. The computers communicate with each other over a data communications network. The communications network in FIG. 1 comprises a public network 106 such as the Internet. The data communications network might also include local-area networks and/or private wide-area networks.
[0022] Server computer 102 has access to streaming media content in the form of different composite media streams. Some composite media streams might be stored as files in a database or other file storage system 108. Other composite media streams 110 might be supplied to the server on a “live” basis from other data source components through dedicated communications channels or through the Internet itself.
Streaming Media
[0023] In this discussion, the term “composite media stream” describes synchronized streaming data that represents a segment of multimedia content. The composite media stream has a timeline that establishes the speed at which the content is rendered. The composite media stream can be rendered to produce a plurality of different types of user-perceivable media, including synchronized audio or sound, video graphics or motion pictures, animation, textual content, command script sequences, or other media types that convey time-varying information or content in a way that can be sensed and perceived by a human. A composite media stream comprises a plurality of individual media streams representing the multimedia content. Each of the individual media streams corresponds to and represents a different media type and each of the media streams can be rendered by a network client to produce a user-perceivable presentation using a particular presentation medium. The individual media streams have their own timelines, which are synchronized with each other so that the media streams can be rendered simultaneously for a coordinated multimedia presentation. The individual timelines define the timeline of the composite stream.
[0024] There are various standards for streaming media content and composite media streams. “Advanced Streaming Format” (ASF) is an example of such a standard, including both accepted versions of the standard and proposed standards for future adoption. ASF specifies the way in which multimedia content is stored, streamed, and presented by the tools, servers, and clients of various multimedia vendors. ASF provides benefits such as local and network playback, extensible media types, component download, scalable media types, prioritization of streams, multiple language support, environment independence, rich inter-stream relationships, and expandability. Further details about ASF are available from Microsoft Corporation of Redmond, Wash.
[0025] Regardless of the streaming format used, an individual data stream contains a sequence of digital data sets or units that are rendered individually, in sequence, to produce an image, sound, or some other stimuli that is perceived by a human to be continuously varying. For example, an audio data stream comprises a sequence of sample values that are converted to a pitch and volume to produce continuously varying sound. A video data stream comprises a sequence of digitally-specified graphics frames that are rendered in sequence to produce a moving picture.
[0026] Typically, the individual data units of a composite media stream are interleaved in a single sequence of data packets. Various types of data compression might be used within a particular data format to reduce communications bandwidth requirements.
[0027] The sequential data units (such as audio sample values or video frames) are associated with both delivery times and presentation times, relative to an arbitrary start time. The delivery time of a data unit indicates when the data unit should be delivered to a rendering client. The presentation time indicates when the value should be actually rendered. Normally, the delivery time of a data unit precedes its presentation time.
[0028] The presentation times determine the actual speed of playback. For data streams representing actual events or performances, the presentation times correspond to the relative times at which the data samples were actually recorded. The presentation times of the various different individual data streams are consistent with each other so that the streams remain coordinated and synchronized during playback.
Exemplary Computer Environment
[0029] In the discussion below, the invention will be described in the general context of computer-executable instructions, such as program modules, being executed by one or more conventional personal computers. Generally, program modules include routines, programs, objects, components, data structures, etc. that perform particular tasks or implement particular abstract data types. Moreover, those skilled in the art will appreciate that the invention may be practiced with other computer system configurations, including hand-held devices, gaming consoles, multiprocessor systems, microprocessor-based or programmable consumer electronics, network PCs, minicomputers, mainframe computers, and the like. In a distributed computer environment, program modules may be located in both local and remote memory storage devices.
[0030] FIG. 2 shows a general example of a computer 120 that can be used as a client or server in accordance with certain embodiments of the invention. Computer 120 is shown as an example of a computer that can perform the functions of either server computer 102 or a client computer 104 of FIG. 1 .
[0031] Computer 120 includes one or more processors or processing units 121, a system memory 122, and a bus 123 that couples various system components including the system memory to processors 121. The bus 123 represents one or more of any of several types of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, and a processor or local bus using any of a variety of bus architectures. The system memory includes read only memory (ROM) 124 and random access memory (RAM) 125. A basic input/output system 126 (BIOS), containing the basic routines that help to transfer information between elements within server computer 120, such as during start-up, is stored in ROM 124.
[0032] Computer 120 further includes a hard disk drive 127 for reading from and writing to a hard disk, not shown, connected to bus 123 via a hard disk drive interface 155 (e.g., a SCSI, ATA, or other type of interface); a magnetic disk drive 128 for reading from and writing to a removable magnetic disk 129, connected to bus 123 via a magnetic disk drive interface 156; and an optical disk drive 130 for reading from or writing to a removable optical disk 131 such as a CD ROM, DVD, or other optical media, connected to bus 123 via an optical drive interface 157. The drives and their associated computer-readable media provide nonvolatile storage of computer readable instructions, data structures, program modules and other data for computer 120. Although the exemplary environment described herein employs a hard disk, a removable magnetic disk 129 and a removable optical disk 131, it should be appreciated by those skilled in the art that other types of computer readable media which can store data that is accessible by a computer, such as magnetic cassettes, flash memory cards, digital video disks, random access memories (RAMs) read only memories (ROM), and the like, may also be used in the exemplary operating environment.
[0033] A number of program modules may be stored on the hard disk, magnetic disk 129 optical disk 131, ROM 124, or RAM 125, including an operating system 135, one or more application programs 136, other program modules 137, and program data 138. A user may enter commands and information into computer 120 through input devices such as keyboard 140 and pointing device 142. Other input devices (not shown) may include a microphone, joystick, game pad, satellite dish, scanner, or the like. These and other input devices are connected to the processing unit 121 through an interface 146 that is coupled to the system bus. A monitor 147 or other type of display device is also connected to the system bus 123 via an interface, such as a video adapter 148. In addition to the monitor, personal computers typically include other peripheral output devices (not shown) such as speakers and printers.
[0034] Computer 120 operates in a networked environment using logical connections to one or more remote computers, such as a remote computer 149. The remote computer 149 may be another personal computer, a server, a router, a network PC, a peer device or other common network node, and typically includes many or all of the elements described above relative to computer 120, although only a memory storage device 150 has been illustrated in FIG. 2 . The logical connections depicted in FIG. 2 include a local area network (LAN) 151 and a wide area network (WAN) 152. Such networking environments are commonplace in offices, enterprise-wide computer networks, intranets, and the Internet. In the described embodiment of the invention, remote computer 149 executes an Internet Web browser program such as the “Internet Explorer” Web browser manufactured and distributed by Microsoft Corporation of Redmond, Wash.
[0035] When used in a LAN networking environment, computer 120 is connected to the local network 151 through a network interface or adapter 153. When used in a WAN networking environment, computer 120 typically includes a modem 154 or other means for establishing communications over the wide area network 152, such as the Internet. The modem 154, which may be internal or external, is connected to the system bus 123 via an interface (e.g., serial port interface 133). In a networked environment, program modules depicted relative to the personal computer 120, or portions thereof, may be stored in the remote memory storage device. It will be appreciated that the network connections shown are exemplary and other means of establishing a communications link between the computers may be used.
[0036] Computer 120 also optionally includes one or more broadcast tuners 158. Broadcast tuner 158 receives broadcast signals either directly (e.g., analog or digital cable transmissions fed directly into tuner 158) or via a reception device (e.g., an antenna, satellite dish, etc.).
[0037] Generally, the data processors of computer 120 are programmed by means of instructions stored at different times in the various computer-readable storage media of the computer. Programs and operating systems are typically distributed, for example, on floppy disks or CD-ROMs. From there, they are installed or loaded into the secondary memory of a computer. At execution, they are loaded at least partially into the computer's primary electronic memory. The invention described herein includes these and other various types of computer-readable storage media when such media contain instructions or programs for implementing the acts described below in conjunction with a microprocessor or other data processor. The invention also includes the computer itself when programmed according to the methods and techniques described below. Furthermore, certain sub-components of the computer may be programmed to perform the functions and acts described below. The invention includes such sub-components when they are programmed as described. In addition, the invention described herein includes data structures, described below, as embodied on various types of memory media.
[0038] For purposes of illustration, programs and other executable program components such as the operating system are illustrated herein as discrete blocks, although it is recognized that such programs and components reside at various times in different storage components of the computer, and are executed by the data processor(s) of the computer.
Multimedia Time-Scale Modification
[0039] As shown in FIG. 1 , a network system in accordance with the invention includes a network server 102 from which a plurality of composite media streams are available. In the described embodiment of the invention, the media streams are stored as files on some type of data storage device accessible by the server.
[0040] The system also includes network clients 104. Generally, network clients 104 are responsive to user input to select or request identified composite media streams. In response to a request for a composite media stream, server 102 streams the requested composite media stream to the requesting network client 104 in accordance with some known format, such as ASF. The client 104 renders the data streams to produce the multimedia content.
[0041] In accordance with the invention, a network client also accepts a speed designation or playback speed from a human user. The speed designation might be a speed factor relative to the original or default playback speed of the selected multimedia stream. For example, a speed factor of 1.2 indicates that the composite media stream is to be rendered at 1.2 times its original or default speed, thereby achieving time compression. A speed factor of 0.8 indicates that the composite media stream is to be rendered at 0.8 times its original or default speed, thereby achieving time expansion.
[0042] In addition, or alternatively, the speed designation might indicate one of a plurality of different types or levels of non-linear timeline compression. As an example, such levels might include a type of non-linear timeline compression that removes audio pauses from a spoken presentation. Another level, perhaps referred to as “summary” compression, might retain only short periods of a presentation that are marked by high energy levels in either audio or video portions of the content.
[0043] In response to the speed or playback designation from the user, the client requests a composite media stream from the server, indicating the desired type, level, or degree of timeline alteration. A plurality of composite streams are available at the server, corresponding to different possible timeline alterations. In response to the request from the client, the server begins streaming a composite stream that has already had its timeline altered in accordance with the speed designation.
[0044] With some types of media, such as video streams, timeline alteration involves either omitting selected frames or modifying the presentation times of the individual data units or video frames. In other cases, such as with audio streams, the time modification is more difficult—simply changing the presentation times would alter the pitch of the original audio and make it unintelligible. Accordingly, some type of audio processing technique is used to time-compress or time-expand audio streams, while maintaining the original pitch of the audio—thereby maintaining the intelligibility of the audio.
[0045] There are various known methods of audio time modification, commonly referred to as “time-scale-modification,” most of which concentrate on removing redundant information from the speech signal. In a method referred to as sampling, short segments are dropped from the speech signal at regular intervals. Cross fading or smoothing between adjacent segments improves the resulting sound quality.
[0046] Another method, referred to as synchronized overlap add method (SOLA or OLA), consists of shifting the beginning of a new speech segment over the end of the preceding segment to find the point of highest cross-correlation (i.e., maximum similarity). The overlapping frames are averaged, or smoothed together, as in the sampling method.
[0047] Sampling with dichotic presentation is a variant of the sampling method that takes advantage of the auditory system's ability to integrate information from both ears. In improves on the sampling method by playing the standard sampled signal to one ear and the “discarded” material to the other ear. Intelligibility and compression increase under this dichotic presentation condition when compared with standard presentation techniques.
[0048] More information regarding audio time modification is given in an article that appeared in the March, 1997, issue of “ACM Transactions on Computer-Human Interaction” (Volume 4, Number 1, pages 3-38) (1997). For purposes of this disclosure, it can be assumed that audio time modification involves some combination of changing individual data stream samples, dropping certain samples, and adjusting presentation times of any samples that are actually rendered.
[0049] The timeline alteration methods mentioned above are considered “linear” because all portions of the speech signal are compressed or expanded uniformly. That is, timeline alteration is applied consistently in time and across all individual streams of a composite media stream. With non-linear timeline alteration techniques, on the other hand, some segments of an individual or composite stream might be more highly expanded or compressed (in time) than other segments. Furthermore, the respective individual streams of a composite stream might be expanded or compressed by different amounts relative to each other.
[0050] One example of a non-linear time-compression method is referred to as pause removal. When using this method, a speech processing algorithm attempts to identify and remove any pauses in a recording. Similar techniques might be used in conjunction with video, by identifying and removing periods of relative inactivity. Non-linear timeline alteration presents special challenges when attempting to synchronize different streams having timelines altered by different techniques.
[0051] The need to synchronize between streams can occur when switching between different streams during playback. For example, a user might view the first two minutes of a multimedia stream at a normal or 1.0 playback speed, and then request a “pause removal” type of time compression. The system responds by streaming a new composite media stream, having the requested time compression. However, the user does not want to start over by again viewing the first two minutes of the presentation. Rather, the user wants to resume playback at the same point in the content at which the request to change the playback speed was made. This point is two minutes into the original stream, but is at some time less than two minutes into the time-compressed stream.
[0052] FIG. 3 illustrates the flow of a composite media stream in accordance with certain embodiments of the invention. Network server 102 streams a composite media stream 180 to network client 104. The composite media stream 180 has a plurality of individual media streams, as described above. For purposes of discussion, it is assumed in this example that the composite media stream has an audio stream and a video stream. Each media stream has a timeline, and the timelines of the individual streams are synchronized with each other so that the streams can be rendered in combination to produce coordinated multimedia content at the network client 104.
[0053] Client computer 104 has a demultiplexer component 182 that receives composite media stream 180 and separates out the individual media streams from the composite format in which the data is streamed (such as ASF). Assuming for purposes of discussion that the composite media streams consist of audio and video streams, this results in an audio media stream 184 and a video media stream 186. The individual media streams are sent to and received by respective decoders 188 and 190 that perform in accordance with the particular data format being employed. For example, the decoders might perform data decompression.
[0054] The decoded data streams are then sent to and received by respective renderers 192 and 194. The rendering components 192 and 194 render the streams in accordance with their potentially modified timelines, as the streams continue to be streamed from the network server.
[0055] For any particular multimedia segment, the server creates and stores several versions of a composite media stream. A plurality of such composite media streams are shown in FIG. 3 , referenced by numeral 196. The illustrated media streams all correspond to the same content. One of the media streams is referred to as a primary or reference version of the media stream. A primary media stream is typically not a stream that has been timeline-altered. In addition to the primary media stream, however, the server stores a number of timeline-altered streams, having timelines that have been altered in accordance with linear and/or non-linear techniques. In response to user's selection of a particular playback speed or time-compression method, the server selects and streams the appropriate one of the stored composite media streams to the client.
[0056] There is a known timeline correlation between the data units of the various media streams. The term “timeline correlation” as used herein refers to a correlation in content between two streams that differ in the degree and/or manner in which their timelines have been modified. The timeline correlations for non-linear timeline modification (and alternatively for linear timeline modification as well) are compiled and stored with the composite media streams, and typically are generated as the timeline modification is performed. The stored timeline correlation data is then referenced by the system when it becomes necessary to find content in one stream corresponding to the same content in another stream.
[0057] Specifically, server 102 stores an index table of timeline correlations mapping presentation times of the primary media stream to byte offsets of each of the timeline-altered media streams. Server 102 further stores, for each of the timeline-altered media streams, a time code stream mapping presentation times of the timeline-altered media stream to presentation times of the primary media stream.
[0058] FIG. 4 illustrates this more clearly. Shown in FIG. 4 are a primary media stream 202 and two timeline-altered media streams 204 and 206. Each of the streams 202-206 is a sequence of individual data units, with each of the data units being located at a particular byte offset from some point of reference (e.g., the beginning of an ASF file storing streams 202-206). In this example, the timeline-altered media streams have corresponding timelines that are non-linearly altered relative to the timeline of the primary media stream.
[0059] Also shown in FIG. 4 are an index table and time code streams corresponding to the media streams. Index table 208, associated with primary media stream 202, is a cross-reference containing mappings from presentation times of the primary media stream to timeline-correlated offsets of the timeline-altered media streams 204 and 206. Table 208 is indexed by presentation times of the primary media stream. Thus, for any given presentation time of the primary media stream, it is possible to quickly find a corresponding or timeline-correlated offset into either of the two timeline-altered media streams.
[0060] In one implementation, the correlated offsets into the timeline-altered streams are based on ranges of samples rather than specific samples. For example, the correlations may be based on 100 millisecond (ms) ranges (referred to as a 100 ms granularity). Thus, a single offset would correspond to each 100 ms time period (e.g., the offset corresponding to the time of 525 ms would be the same as corresponds to the time of 530 ms). Any of a wide range of granularities can be used, balancing increased accuracy (achieved from lower granularities) against reduced storage space requirements (achieved from higher granularities).
[0061] By itself, table 208 is useful when switching from primary media stream 202 to one of the timeline-altered media streams 204 or 206. To transition, for instance, from primary media stream 202 to timeline-altered media stream 204, the current presentation time of primary media stream 202 is noted. This presentation time is used as an index into table 208 to find the corresponding offset into the first media stream. This offset is a byte offset, identifying a number of bytes into the data of timeline-altered stream 204 that corresponds to the presentation time of primary media stream 202. Presentation of the media stream 204 is then initiated at the correlated offset as found in the table.
[0062] Time code streams 210 and 212 are associated respectively with first and second timeline-altered media streams 204 and 206, and are used as references to the primary media stream. Each of these time code streams includes objects with data that maps presentation times of its associated media stream to presentation times in primary media stream 202, at some specified fixed or variable granularity.
[0063] Index table 208 and time code streams 210 and 212 can be stored and referenced by server 102 of FIG. 1 . Alternatively, they can be stored by server 102 and downloaded to client 104 as needed. As a further alternative, the time code streams 210 and 212 can be provided with individual data units of the timeline-altered media streams 204 and 206 respectively. In accordance with this further alternative, each data unit of the timeline-altered media streams 204 and 206 is accompanied by a presentation time at which the data unit is to be rendered, and also by a reference presentation time, wherein the reference presentation time indicates a presentation time in the primary reference stream that corresponds to the presentation time of the data unit in the timeline-altered media stream. This reference presentation time is then used as an index into table 208 associated with primary stream 202.
[0064] FIGS. 5-8 illustrate exemplary data structures that can be used to create index table 208 and time code streams 210 and 212 of FIG. 4 . These data structures of FIGS. 5-8 are illustrated with reference to ASF. However, these data structures or analogous data structures can be used with various other streaming media formats. In the descriptions of FIGS. 5-8 , specific sizes (typically in terms of bits) are given. These specific sizes are exemplary sizes for illustration only; alternative implementations can use different sizes.
[0065] FIG. 5 illustrates an exemplary index object 220 that is used, in conjunction with index parameters object 222 in FIG. 6 (discussed below), to create index table 208 of FIG. 4 . Each set of composite media streams corresponding to the same media content (collectively referred to as an ASF file) includes one index object 220. Index object 220 can be broken into multiple blocks to facilitate more space-efficient storage. Each block indexes into a particular range of the data stream (using a 64-bit offset), with multiple index entries for each block, each index entry indexing into a particular range of its corresponding block (using a 32-bit identifier). Index object 220 can use as many blocks as necessary, depending on the size of the corresponding composite media stream.
[0066] Index object 220 includes an object identifier 224, an object size 226, an index entry time interval 228, an index specifier count 230, an index specifiers identifier 232, an index block count 234, and one or more index blocks 236. Object identifier 224 is a 128-bit globally unique identifier that uniquely identifies object 220 as an index object rather than some other type of object. Object size 226 is a 64-bit identifier that identifies the overall size (e.g., in bytes) of index object 220.
[0067] Index entry time interval 228 is a 32-bit identifier of the granularity of each index entry. That is, index entry time interval 228 identifies a temporal range of the multimedia content that each index entry corresponds to, as discussed in more detail below.
[0068] The index specifier count 230 is a 16-bit identifier of the number of index specifier entries that exist in index specifier identifiers 232, which identifies the different index specifiers that are used in index object 220. Examples of index specifiers include: Nearest Clean Point (the closest data unit containing an entire object that has the Clean Point Flag set, identifying whether the object is a “clean point” (e.g., a video key frame)); Nearest Object (the closest data unit containing an entire object or first fragment of an object); and Nearest Data Unit (the data unit with a presentation time closest to the index entry time).
[0069] Index block count 234 is a 32-bit identifier of the number of index blocks 236 that exist in the index object 220.
[0070] Each index block 236 includes a block position identifier 240, an index entry count 242, and one or more index entries 244. The block position identifier 240 is a 64-bit block offset into the data stream.
[0071] Index entry count 242 is a 32-bit identifier of the number of index entries 244 included in block 236. Each index entry 244 corresponds to a particular data unit of the composite data stream. The temporal range (granularity) of the multimedia content that the data units correspond to can vary between ASF files (e.g., 10 millisecond or 100 millisecond samples or frames). The temporal range that the data units correspond to, and thus the range that the index entries correspond to, is identified by index entry time interval 228 discussed above.
[0072] Each index entry 244 includes one or more 32-bit offsets into the data stream. In the illustrated example, each index entry 244 includes one 32-bit offset for each of the different index specifiers in specifiers identifier 232. The 32-bit offset of an index entry 244, in combination with the block position identifier 240, identifies a byte offset into the corresponding stream that is associated with the presentation time of the index entry 244. A different index entry 244 is associated with presentation time ranges (equal to the granularity identified by interval 228).
[0073] FIG. 6 illustrates an exemplary index parameters object 222 that is used in conjunction with index object 220 of FIG. 5 to create index table 208 of FIG. 4 . Each ASF file includes an index parameters object 222 for each of the different timeline-altered streams in the file. Index parameters object 222 includes an object identifier 252, an object size 254, an index entry time interval 256, an index specifier count 258, and multiple index specifiers 260.
[0074] Object identifier 252 is a 128-bit globally unique identifier that uniquely identifies object 222 as an index parameter object rather than some other type of object. Object size 254 is a 64-bit identifier that identifies the overall size of index object 222. Index entry time interval 256 is a 32-bit identifier of the granularity of each index entry (analogous to index entry time interval 228 of FIG. 5 ). Index specifier count 258 is a 16-bit identifier of the number of index specifier entries 260 that exist in index parameters object 222.
[0075] Each index specifier entry 260 includes a stream number identifier 264 and an index type 266. Stream number identifier 264 identifies a particular composite stream in the ASF file that the specifier entry 260 corresponds to. Index type 266 identifies which index specifier type (e.g., Nearest Clean Point, Nearest Object, or Nearest Data Unit) the specifier entry 260 corresponds to.
[0076] Each index specifier entry 260 corresponds to an index entry 244 of FIG. 5 . Multiple index entries 244 will be included in index object 220 each corresponding to the same presentation time of the primary stream, but corresponding to different timeline-altered streams (as identified by the corresponding index specifier entries 260). The combination of object 220 (FIG. 5 ) and object 222 (FIG. 6 ) provides a mapping from presentation time of the primary stream to corresponding byte offsets in each of the timeline-altered streams.
[0077] By way of example, the ASF file may include a primary stream that has not been timeline-altered and two secondary streams, one that has been timeline-altered with a speedup factor of 1.5× (e.g., 1.5 times faster than the primary stream), and another that has been timeline-altered with a speedup factor of 2.0× (e.g., 2 times faster than the primary stream). If the byte offset into the 1.5× secondary stream that corresponds to 30 seconds into the primary stream is desired (that is, 45 seconds into the 1.5× stream), then the index entry 244 that corresponds to the primary stream presentation time of 30 seconds and which has an index specifier entry 260 that indicates the entry 244 corresponds to the 1.5× stream is identified. The offset included in this index entry 244 is the byte offset into the 1.5× secondary stream corresponding to 30 seconds into the primary stream. Similarly, if the byte offset into the 2.0× secondary stream that corresponds to 30 seconds into the primary stream is desired (that is, 60 seconds into the 2.0× stream), then the index entry 244 that corresponds to the primary stream presentation time of 30 seconds and which has an index specifier entry 260 that indicates the entry 244 corresponds to the 2.0× stream is identified. The offset included in this index entry 244 is the byte offset into the 2.0× secondary stream corresponding to 30 seconds into the primary stream.
[0078] FIG. 7 illustrates an exemplary time-compressed stream properties object 282 that is used to identify properties of a timeline-altered stream. ASF includes a stream properties object for each media stream that defines the specific properties and characteristics of the media stream. The stream properties object defines how a multimedia stream is to be interpreted as well as the specific format (of elements) of the data units for that media stream. The properties object 282 defines additional properties for timeline-altered streams, and a properties object 282 is appended to the stream properties object for each of the timeline-altered streams.
[0079] Time-compressed stream properties object 282 includes an object identifier 284, an object size 286, a speedup factor 288, and a skimming level 290. Object identifier 284 is a 128-bit globally unique identifier that uniquely identifiers object 282 as a time-compressed stream object rather than some other type of object. Object size 286 is a 64-bit identifier that identifies the overall size of object 282.
[0080] Speedup factor 288 is a 64-bit identifier of the speedup factor for the timeline-altered stream. Speedup factor 288 can identify the amount of linear timeline alteration with respect to primary stream 202 of FIG. 4 (or some other stream), or alternatively an effective speedup factor that is the result of nonlinear timeline alteration.
[0081] Skimming level 290 is a 16-bit identifier of the skimming level or priority number of the timeline-altered stream. The number of different timeline-altered streams for particular media content, as well as their relative skimming levels or priority numbers can vary in accordance with the author's or designer's wishes.
[0082] FIG. 8 illustrates an exemplary time-compressed stream data unit object 302. Each time code stream 210 and 212 of FIG. 4 is made up of multiple time-compressed stream data unit objects 302. In the illustrated example, the time code stream includes one object 302 corresponding to each data unit in the associated timeline-altered stream. Each data unit in the timeline-altered stream includes an “extension data” field indicating whether extension data, which is time-compressed stream data unit object 302 in the illustrated example, is included in the ASF file.
[0083] Time-compressed stream data unit object 302 includes an object identifier 304, an object size 306, an extension system identifier 308, a data unit extension size 310, an extension system information size 312, and extension system information 314. Object identifier 304 is a 128-bit globally unique identifier that uniquely identifies object 302 as a time-compressed stream data unit object 282 of FIG. 7 , that the current stream is a timeline-altered stream, and accesses the time compressed stream object corresponding to the “current” data unit being presented (act 324), which is the data unit being presented when the user request is received. From that time compressed stream object, client 104 identifies the primary stream presentation time corresponding to the current data unit (act 326).
[0084] Client 104 then accesses an index table 208 of FIG. 4 to identify the appropriate byte offset into the target stream (act 328). Client 104 then forwards the byte offset to server 102, in response to which server 102 begins streaming the target stream to client 104 based on the location identified by the byte offset (act 330). Server 102 may begin streaming the target stream at the location identified by the byte offset, or alternatively at a point slightly before the location identified by the byte offset.
Conclusion
[0085] A media file format that supports switching between multiple different timeline-altered media streams of the same media content has been described. The file format of the invention includes an index table mapping presentation times of a primary media stream to byte offsets into each of the different timeline-altered media streams, and a time code stream for each of the different timeline-altered media streams that maps presentation times of the timeline-altered media stream to presentation times of the primary media stream. These time code streams and index table advantageously allow switching between presentation of the different timeline-altered streams.
[0086] Although the description above uses language that is specific to structural features and/or methodological acts, it is to be understood that the invention defined in the appended claims is not limited to the specific features or acts described. Rather, the specific features and acts are disclosed as exemplary forms of implementing the invention.
Claims
The invention claimed is:
1. A computer-readable data storage medium with computer-program instructions embedded thereon, the computer-program instructions being executable by a processor for performing operations comprising:
receiving a user selection to switch from a first timeline-altered media stream to a second timeline-altered media stream;
accessing a time-compressed stream object corresponding to a data unit, currently being rendered, of the first timeline-altered media stream;
identifying, from the time-compressed stream object, a presentation time of a primary media stream whose timeline has not been altered, the presentation time indicates when the data unit of the first timeline-altered media stream is to be rendered, the presentation time being independent of a delivery time that indicates when the data unit is to be delivered to a rendering client;
accessing an index table to identify an offset into the second timeline altered stream corresponding to the presentation time of the primary media stream; and
wherein the second timeline-altered media steam is for presentation to a user by the rendering client.
2. The computer-readable data storage medium of claim 1, wherein the computer-program instructions further comprise instructions for rendering the second timeline-altered media stream beginning at the location identified by the offset.
3. The computer-readable data storage medium of claim 1, wherein the computer-program instructions further comprise instructions for streaming the second timeline-altered media stream, beginning at the location identified by the offset, to a client computer for presentation to a user.
4. The computer-readable data storage medium of claim 1, wherein the computer-program instructions further comprise instructions for rendering the second timeline-altered media stream beginning at a location prior to the location identified by the offset.
5. The computer-readable data storage medium of claim 1, wherein the computer-program instructions further comprise instructions for streaming the second timeline-altered media stream, beginning at a location prior to the location identified by the offset, to a client computer for presentation to a user.
6. A computing device comprising:
a processor; and
a memory coupled to the processor, the memory comprising computer-program instructions executable by a processor for performing operations comprising:
receiving a user selection to switch from a first timeline-altered media stream to a second timeline-altered media stream;
accessing a tune-compressed stream object corresponding to a data unit, currently being rendered, of the first timeline-altered media stream;
identifying, from the time-compressed stream object, a presentation time of a primary media stream whose timeline has not been altered, the presentation time indicates when the data unit of the first timeline-altered media stream is to be rendered, the presentation time being independent of a delivery time that indicates when the data unit is to be delivered to a rendering client;
accessing an index table to identify an offset into the second timeline altered stream corresponding to the presentation time of the primary media stream; and
wherein the second timeline-altered media stream is for presentation to a user by the rendering client.
7. The computing device of claim 6, wherein the computer-program instructions further comprise instructions for rendering the second timeline-altered media stream beginning at the location identified by the offset.
8. The computing device of claim 6, wherein the computer-program instructions further comprise instructions for streaming the second timeline-altered media stream, beginning at the location identified by the offset, to a client computer for presentation to a user.
9. The computing device of claim 6, wherein the computer-program instructions further comprise instructions for rendering the second timeline-altered media stream beginning at a location prior to the location identified by the offset.
10. The computing device of claim 6, wherein the computer-program instructions further comprise instructions for streaming the second timeline-altered media stream, beginning at a location prior to the location identified by the offset, to a client computer for presentation to a user.
Patent Citations (124)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US4649499(A) | 1987-03-01 | Sutton et al. | Applicant |
| US4931950(A) | 1990-06-01 | Isle et al. | Applicant |
| US5050161(A) | 1991-09-01 | Golestani | Applicant |
| US5119474(A) | 1992-06-01 | Beitel et al. | Applicant |
| US5175769(A) | 1992-12-01 | Hejna, Jr. et al. | Applicant |
| US5274758(A) | 1993-12-01 | Beitel et al. | Applicant |
| US5309562(A) | 1994-05-01 | Li | Applicant |
| US5313454(A) | 1994-05-01 | Bustini et al. | Applicant |
| US5341474(A) | 1994-08-01 | Gelman et al. | Applicant |
| US5414455(A) | 1995-05-01 | Hooper et al. | Applicant |
| US5420801(A) | 1995-05-01 | Dockter et al. | Applicant |
| US5434848(A) | 1995-07-01 | Chimento, Jr. et al. | Applicant |
| US5455910(A) | 1995-10-01 | Johnson et al. | Applicant |
| US5479303(A) | 1995-12-01 | Suzuki et al. | Applicant |
| US5481542(A) | 1996-01-01 | Logston et al. | Applicant |
| US5490252(A) | 1996-02-01 | Macera et al. | Applicant |
| US5504744(A) | 1996-04-01 | Adams et al. | Applicant |
| US5519701(A) | 1996-05-01 | Colmant et al. | Applicant |
| US5521630(A) | 1996-05-01 | Chen et al. | Applicant |
| US5524193(A) | 1996-06-01 | Covington et al. | Applicant |
| US5533021(A) | 1996-07-01 | Branstad et al. | Applicant |
| US5537408(A) | 1996-07-01 | Branstad et al. | Applicant |
| US5541955(A) | 1996-07-01 | Jacobsmeyer | Applicant |
| US5559942(A) | 1996-09-01 | Gough et al. | Applicant |
| US5566175(A) | 1996-10-01 | Davis | Applicant |
| US5572643(A) | 1996-11-01 | Judson | Applicant |
| US5574724(A) | 1996-11-01 | Bales et al. | Applicant |
| US5614940(A) | 1997-03-01 | Cobbley et al. | Applicant |
| US5617423(A) | 1997-04-01 | Li et al. | Applicant |
| US5623690(A) | 1997-04-01 | Palmer et al. | Applicant |
| US5625405(A) | 1997-04-01 | DuLac et al. | Applicant |
| US5640320(A) | 1997-06-01 | Jackson et al. | Applicant |
| US5642497(A) | 1997-06-01 | Crary et al. | Applicant |
| US5664227(A) | 1997-09-01 | Mauldin et al. | Applicant |
| US5692213(A) | 1997-11-01 | Goldberg et al. | Applicant |
| US5692313(A) | 1997-12-01 | Ikeda et al. | Applicant |
| US5717691(A) | 1998-02-01 | Dighe et al. | Applicant |
| US5717869(A) | 1998-02-01 | Moran et al. | Applicant |
| US5719786(A) | 1998-02-01 | Nelson et al. | Applicant |
| US5721829(A) | 1998-02-01 | Dunn et al. | Applicant |
| US5742347(A) | 1998-04-01 | Kandlur et al. | Applicant |
| US5768533(A) | 1998-06-01 | Ran | Applicant |
| US5786814(A) | 1998-07-01 | Moran et al. | Applicant |
| US5793980(A) | 1998-08-01 | Glaser et al. | Applicant |
| US5794210(A) | 1998-08-01 | Goldhaber et al. | Applicant |
| US5794249(A) | 1998-08-01 | Orsolini et al. | Applicant |
| US5799292(A) | 1998-08-01 | Hekmatpour | Applicant |
| US5801685(A) | 1998-09-01 | Miller et al. | Applicant |
| US5808662(A) | 1998-09-01 | Kinney et al. | Applicant |
| US5818510(A) | 1998-10-01 | Cobbley et al. | Applicant |
| US5822537(A) | 1998-10-01 | Katseff et al. | Applicant |
| US5828848(A) | 1998-10-01 | MacCormack et al. | Applicant |
| US5832437(A) | 1998-11-01 | Nishiguchi et al. | Applicant |
| US5835495(A) | 1998-11-01 | Ferriere | Applicant |
| US5835667(A) | 1998-11-01 | Wactlar et al. | Applicant |
| US5838906(A) | 1998-11-01 | Doyle et al. | Applicant |
| US5842172(A) | 1998-11-01 | Wilson | Applicant |
| US5852705(A) | 1998-12-01 | Hanko et al. | Applicant |
| US5859641(A) | 1999-01-01 | Cave | Applicant |
| US5864682(A) | 1999-01-01 | Porter et al. | Applicant |
| US5870755(A) | 1999-02-01 | Stevens et al. | Applicant |
| US5873735(A) | 1999-02-01 | Yamada et al. | Applicant |
| US5880788(A) | 1999-03-01 | Bregler | Applicant |
| US5892506(A) | 1999-04-01 | Hermanson | Applicant |
| US5893053(A) | 1999-04-01 | Trueblood | Applicant |
| US5893062(A) | 1999-04-01 | Bhadkamkar et al. | Applicant |
| US5903673(A) | 1999-05-01 | Wang et al. | Applicant |
| US5918002(A) | 1999-06-01 | Klemets et al. | Applicant |
| US5930787(A) | 1999-07-01 | Minakuchi et al. | Applicant |
| US5941936(A) | 1999-08-01 | Taylor | Applicant |
| US5953506(A) | 1999-09-01 | Kalra et al. | Applicant |
| US5956716(A) | 1999-09-01 | Kenner et al. | Applicant |
| US5995941(A) | 1999-11-01 | Maquire et al. | Applicant |
| US5999979(A) | 1999-12-01 | Vellanki et al. | Applicant |
| US6006241(A) | 1999-12-01 | Purnaveja et al. | Applicant |
| US6014706(A) | 2000-01-01 | Cannon et al. | Applicant |
| US6023731(A) | 2000-02-01 | Chawla | Applicant |
| US6032130(A) | 2000-02-01 | Alloul et al. | Applicant |
| US6035341(A) | 2000-03-01 | Nunally et al. | Applicant |
| US6041345(A) | 2000-03-01 | Levi et al. | Applicant |
| US6049823(A) | 2000-04-01 | Hwang | Applicant |
| US6064794(A) | 2000-05-01 | McLaren et al. | Applicant |
| US6065050(A) | 2000-05-01 | DeMoney | Applicant |
| US6118450(A) | 2000-09-01 | Proehl et al. | Applicant |
| US6118817(A) | 2000-09-01 | Wang | Applicant |
| US6128653(A) | 2000-10-01 | del Val et al. | Applicant |
| US6133920(A) | 2000-10-01 | deCarmo et al. | Applicant |
| US6144375(A) | 2000-11-01 | Jain et al. | Applicant |
| US6148304(A) | 2000-11-01 | de Vries et al. | Applicant |
| US6154771(A) | 2000-11-01 | Rangan et al. | Applicant |
| US6166314(A) | 2000-12-01 | Weinstock et al. | Applicant |
| US6169843(B1) | 2001-01-01 | Lenihan et al. | Applicant |
| US6173317(B1) | 2001-01-01 | Chaddha et al. | Applicant |
| US6204840(B1) | 2001-03-01 | Petelycky et al. | Applicant |
| US6215910(B1) | 2001-04-01 | Chaddha | Applicant |
| US6230172(B1) | 2001-05-01 | Purnaveja et al. | Applicant |
| US6233389(B1) | 2001-05-01 | Barton et al. | Applicant |
| US6332147(B1) | 2001-12-01 | Moran et al. | Applicant |
| US6345293(B1) | 2002-02-01 | Chaddha | Applicant |
| US6392651(B1) | 2002-05-01 | Stradley | Applicant |
| US6415326(B1) | 2002-07-01 | Gupta et al. | Applicant |
| US6424792(B1) | 2002-07-01 | Tsukagoshi et al. | Applicant |
| US6442538(B1) | 2002-08-01 | Nojima | Applicant |
| US6452615(B1) | 2002-09-01 | Chiu et al. | Applicant |
| US6453336(B1) | 2002-09-01 | Beyda et al. | Applicant |
| US6484156(B1) | 2002-11-01 | Gupta et al. | Applicant |
| US6512552(B1) | 2003-01-01 | Subramanian | Applicant |
| US6675174(B1) | 2004-01-01 | Bolle et al. | Applicant |
| US6724401(B1) | 2004-04-01 | Hennum et al. | Applicant |
| US6907570(B2) | 2005-06-01 | Amir et al. | Applicant |
| US6965724(B1) | 2005-11-01 | Boccon-Gibod et al. | Applicant |
| US7302490(B1) | 2007-11-01 | Gupta et al. | Examiner |
| US2002/0038374(A1) | 2002-03-01 | Gupta et al. | Applicant |
| US2002/0129374(A1) | 2002-09-01 | Freeman et al. | Applicant |
| US2002/0133247(A1) | 2002-09-01 | Smith et al. | Applicant |
| US2003/0196164(A1) | 2003-10-01 | Gupta et al. | Applicant |
| EP605115 | 1994-07-01 | Applicant | |
| EP653884 | 1995-05-01 | Applicant | |
| EP669587 | 1995-08-01 | Applicant | |
| EP676898 | 1995-10-01 | Applicant | |
| EP746158 | 1996-12-01 | Applicant | |
| EP812112 | 1997-12-01 | Applicant | |
| WO9401964 | 1994-01-01 | Applicant | |
| WO9837698 | 1998-08-01 | Applicant |
Non-Patent Literature (19)
- “Advanced Streaming Format (ASF) Specification”, Microsoft Corporation and RealNetworks,Inc, Microsoft Corporation, 1997-1998, Feb. 26, 1998, Public Specification Version 1.0, pp. 56.Applicant
- “An Annotated Bibliography of Interactive Speech User Interfaces by Barry Arons”, retrieved on Dec. 1, 2003 at <<http://barons.www.media.mit.edu/people/barons/AronsAnnotated Bibliography.html>>, pp. 4.Applicant
- Arons, “SpeechSkimmer: A System for Interactively Skimming Recorded Speech”, Computer-Human, ACM, 1997, vol. 4, No. 1, pp. 29.Applicant
- Bugaj, et al., “Synchronized Multimedia Integration Language (SMIL) 1.0 Specification” http://www.w3.org.TR/REC-smil, Jun. 15, 1998, pp. 20.Applicant
- Chen, et al., “A Scalable Video-on Demand Service for the Provision of VCR-Like Functions”, IEEE, May 15,1995, pp. 65-72.Applicant
- Dionisio, et al., “A Unified Data Model for Representing Multimedia, Timeline, and Simulation Data,” IEEE, 1998, Knowledge and Data Engineering, vol. 10, No. 5, Sep./Oct. 1998, pp. 746-767.Applicant
- Gabbe, et al., “Towards Intelligent recognition of Multimedia Epsidoes in Real-Time applications”, 1994 ACM pp. 227-236.Applicant
- “GSM Full Rate Speech Transcoding”, Feb. 12, 1992, pp. 94.Applicant
- Hardman, et al., “Multimedia Authoring Paradigms,” Authoring and Application of Hypermedia-Besed User-Interface, IEEE, The Institution of Electrical Engineers, 1995, pp. 3.Applicant
- Informedia- Internet Reference, <<http://www.informedia.cs.cmu.edu>>, 1996, pp. 40.Applicant
- Pizano, et. al., “Integrated Multimedia Messaging Concepts and Applications”, ACM, 1996, pp. 12-16.Applicant
- “Merriam Webster's Collegiate Dictionary,Tenth Edition”, Merriam-Webster, Incorporated, 1996, pp. 5.Applicant
- Moseley, et al., “Microsoft Office 97” Second Edition, SYBEX Inc., 1996, pp. 19.Applicant
- Shelton, et al. “Media Server Content Preparation Specification and Default Parameters”, May 4, 1995, pp. 17.Applicant
- “Some Frequently Asked Questions about RTP” archived Jun. 7, 1997 http://www.(p.7, “Choosing”) columbia.edu/-hgs/rtp/faq.html.Applicant
- “U.S. Court of Appeals Federal Circuit”; The Bureau of National Affairs, Inc. 2002, pp. 10.Applicant
- Vary, et al., “Speech Codec for the European Mobile Radio System”, IEEE, 1988, pp. 227-230.Applicant
- “Webster's Encyclopedia Unabridge Dictionary of the English Language”, 1989, Portland House, 3 pages.Applicant
- Webster, “Webster's Seventh New Collegiate Dictionary”, G. & C. Merriam Co, 1971, pp. 4.Applicant