Media streaming with enhanced seek operation

Information

  • Patent Grant
  • 8370887
  • Patent Number
    8,370,887
  • Date Filed
    Thursday, August 7, 2008
    15 years ago
  • Date Issued
    Tuesday, February 5, 2013
    11 years ago
Abstract
The present disclosure relates to playback of video/audio streaming media data. The media stream is available from the network at multiple bit rates. When a seek operation is performed, a playback device requests a lower bit rate media stream in order to quickly fill a playback buffer so that playback can commence more readily. After a seek start-up period is complete, the playback device can return to downloading the media stream associated with higher bit rates in order to increase the quality of the playback.
Description
BACKGROUND

With the increasing popularity of playing streaming audio and video over networks such as the Internet, there is a need for optimizing the data transferred from a server to a client such that the client's experience is maximized even if network conditions during playback are inconsistent. Optimizing the client's experience involves making encoding decisions such that the video can be transferred and reconstructed with a minimal number of errors.


The term “streaming” is typically used to indicate that the data representing the media is provided by a host computer over a network to a playback device (i.e., a media playback computer implemented as any of a variety of conventional computing devices, such as a desktop PC, a notebook or portable computer a cellular telephone or other wireless communication device, a personal digital assistant (PDA), a gaming console, etc.) The client computer typically renders the streaming content as it is received from the host, rather than waiting for the entire file to be delivered.


The quality level is generally dictated by the bit rate specified for the encoded audio or video portions of the input stream. A higher bit rate generally indicates that a larger amount of information about the original audio or video is encoded and retained, and therefore a more accurate reproduction of the original input audio or video can be presented during video playback. Conversely, a lower bit rate indicates that less information about the original input audio or video is encoded and retained, and thus a less accurate reproduction of the original audio or video will be presented during video playback.


Generally, the bit rate is specified for encoding each of the audio and video based on several factors. The first factor is the network condition between the server and the client. A network connection that can transfer a high amount of data indicates that a higher bit rate can be specified for the input video that is subsequently transferred over the network connection. The second factor is the desired start-up latency. Start-up latency is the delay that a video playback tool experiences when first starting up due to the large amount of data that has to be received, processed, and buffered. Start-up latency can also occur after a seek operation, where the user selects variable positions in the streaming content to view. A third factor is the processing capabilities of the playback device. The fourth factor is the tolerance to glitching. Glitching occurs when the content is not displayed at the rate it was authored causing the playback device to run out of data to display. In most cases any amount of start-up latency or glitching is intolerable, and it is therefore desirable to optimize the bit rate specified such that the start-up latency and the glitching are minimized or eliminated.


SUMMARY

The present disclosure relates to playback of video/audio streaming media data. The media stream is available from the network at multiple encoded bit rates. When a seek operation is performed, a playback device can request a lower bit rate media stream in order to quickly fill a playback buffer so that playback can commence more readily. After a seek start-up period is complete, the playback device can return to downloading the media stream encoded at higher bit rates in order to increase the quality of the playback.


The foregoing and other objects, features, and advantages of the invention will become more apparent from the following detailed description, which proceeds with reference to the accompanying figures.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 illustrates an exemplary environment suitable for sending streaming media content over a network from a host device to a playback device.



FIG. 2 illustrates an example encoder on the host device.



FIG. 3 illustrates an example media stream having multiple, fixed bit rates.



FIG. 4 illustrates an example media stream having multiple, variable bit rates.



FIG. 5 illustrates an example application for rendering streaming media content on the playback device wherein a heuristics module is in the same application as a media pipeline.



FIG. 6 illustrates an example application for rendering streaming media content on the playback device wherein the media pipeline is in a platform and the heuristics module is in a downloadable (e.g., plug-in) program.



FIG. 7 illustrates an exemplary computing environment.



FIG. 8 illustrates an exemplary media pipeline on the playback device.



FIG. 9 illustrates a detailed view of a downloadable program coupled to a network.



FIG. 10 is a flowchart of a method to ensure fast start-up after a seek operation.



FIG. 11 is a flowchart of a method for fast ramp-up of a bit rate after a seek operation.



FIG. 12 is a detailed flowchart of a method for implementing playback after a seek operation.



FIG. 13 illustrates using thumbnails in cooperation with a seek operation.





DETAILED DESCRIPTION

As used in this application and in the claims, the singular forms “a,” “an” and “the” include the plural forms unless the context clearly dictates otherwise. Additionally, the term “includes” means “comprises.” Although the operations of some of the disclosed methods and apparatus are described in a particular, sequential order for convenient presentation, it should be understood that this manner of description encompasses rearrangement, unless a particular ordering is required by specific language set forth below. For example, operations described sequentially can in some cases be rearranged or performed concurrently.


Any of the methods described herein can be performed (at least in part) using software comprising computer-executable instructions stored on one or more computer-readable media. Furthermore, any intermediate or final results of the disclosed methods can be stored on one or more computer-readable media. It should be understood that the disclosed technology is not limited to any specific computer language, program, or computer. For instance, a wide variety of commercially available computer languages, programs, and computers can be used.



FIG. 1 illustrates an exemplary environment 100 which can be suitable for transmitting media content being streamed over a network 106 from a host computer device 102 to a playback computer device 104. The network 106 can be any of a variety of conventional network topologies and types (including optical, wired and/or wireless networks), using a variety of conventional network protocols (including public and/or proprietary protocols). The network 106 can include, for example, a home network, a corporate network, or the Internet, as well as possibly at least portions of one or more local area networks (LANs) and/or wide area networks (WANs) or telephone networks.


A host device 102 generally stores media content and streams media content to the playback device 104. The playback device 104 can receive streaming media content via the network 106 from host device 102 and plays it for a user. Additionally, the playback device 102 can request a desired bit rate from the host device, which offers multiple bit rates to download. Host device 102 may be implemented as any of a variety of conventional computing devices, including, for example, a desktop PC, a notebook or portable computer, a workstation, an Internet appliance, and combinations thereof. Playback device 104 may also be implemented as any of a variety of conventional computing devices, including, for example, a desktop PC, a notebook or portable computer, a workstation, an Internet appliance, a gaming console, a handheld PC, a cellular telephone or other wireless communications device, a personal digital assistant (PDA), a set-top box, and combinations thereof.


Host device 102 can make any of a variety of data available for streaming to playback device 104, including content, such as audio, video, text, images, animation, and the like. However, as used herein with respect to the exemplary embodiments described below, media content is intended to represent audio/video (A/V) content or just video content. Furthermore, references made herein to “media content”, “streaming media”, “streaming video”, “video content”, and any variation thereof are generally intended to include audio/video content. The term “streaming” is used to indicate that the data representing the media content is provided over a network 106 to a playback device 104 and that playback of the content can begin prior to the content being delivered in its entirety.



FIG. 2 illustrates an exemplary encoding tool 200 that can be implemented on the host device 102. The tool includes a segmenter 210 that accepts input video 205 and splits the input video into a plurality of segments each comprising a certain number of frames. Input video generally refers to a stream comprising both audio components and video components. In certain embodiments, the segments each comprise 60 frames. In other embodiments the segments can vary across a range of values such as comprising between 30 frames to 90 frames. The number of frames in the segment can be based on factors such as scene changes in the input video 205. For example, if a segment contains a scene change, the frames before the scene change could be drastically different than the frames after the scene change.


The segmenter 210 outputs the segments to a bit rate controller 215. The bit rate controller 215 analyzes each segment and selects bit rates for one or more bit rate layers for each of the segments. A bit rate layer is a layer comprising a specific bit rate used to encode the input video 205. The number of bit rate layers and their respective bit rates for each segment may be affected by factors associated with the segment such as the number of frames in the segment or the complexity of the input video 205 in the given segment. Additionally, the number of bit rate layers and their corresponding bit rates may be affected by factors not associated with the given segment such as limits on the size of the file or the maximum or minimum bandwidth of the network that the encoded input video 205 will be transferred through. In one embodiment, the bit rate controller 215 selects the bit rates for the bit rate layers for each of the segments independently from each of the other segments. Thus, a given segment may be encoded at the same or different bit rates as any other segment.


The segmenter 210 also outputs the segments to an encoder 220, and the bit rate controller 215 signals the bit rate layers for each segment to the encoder 220. The encoder 220 can encode according to a Windows Media Video or VC-1 format, MPEG-x format (e.g., MPEG-1, MPEG-2, or MPEG-4), H.26x format (e.g., H.261, H.262, H.263, or H.264), or other format. The encoder 220 may also be able to encode according to one or more audio standards such as WAV, FLAC, MP3, WMA, or some other standard. In some embodiments the encoder 220 encodes each segment as each bit rate layer and outputs a series of chunks in an encoded bit stream 225. Generally speaking, a chunk is a segment encoded as a particular bit rate layer. Thus, the encoder 220 can produce one or more chunks for each segment. In other embodiments, the encoder may encode the segment with less than all of the available bit rate layers. This may occur if, for example, a user defines a certain amount of time available for encoding, or conditions make certain bit rate layers un-necessary or undesirable.


As is well-understood in the art, the embodiment of FIG. 2 can be modified to encode a continuous media stream that is not divided into chunks. It is, however, desirable to be able to extract portions of the continuous media stream and to be able to logically define different portions of the media stream for extraction, if desired.


In certain embodiments, the encoding tool 200 may include a splitter (not shown) that splits the input video 205 into a separate video component and an audio component. In these embodiments, a separate segmenter, bit rate controller and encoder can be used to encode each of the video component and the audio component. The encoder for the video component can encode according to WMV or VC-1 format, MPEG-x format, H.26x format, or some other format. The encoder for the audio component can encode according to WAV, FLAC, MP3, WMA, or some other standard. Additionally, the segments for the video component and the segments for the audio component may be selected independently of each other. In this embodiment the segments of the video component may, but do not have to, comprise the same frames as the segments of the audio component.



FIG. 3 shows multiple bit rates 1-N for particular content generated by the encoding tool of FIG. 2. The content is identical at each bit rate, but the quality increases with higher bit rates. In the illustrated example, there are N bit rates shown, where N could be any number. In particular embodiments, N is equal to 4. Additionally, the media streams can be divided into segments (also called fragments or chunks). The fragments may range from two to five seconds each in certain embodiments, although any duration may be used. A particular example includes video segments that are 2 seconds in length and audio segments are 5 seconds in length. In the example of FIG. 3, the bit rates are encoded at substantially constant rates (e.g., 1 kbps, 2 kbps, etc.).



FIG. 4 is an example of media streams encoded at variable bit rates 400 that may also be used with any of the embodiments described herein and that is generated by the encoding tool. Variable bit rates allocate a different amount of data to a scene based on complexity. Some scenes require a lower bit rate, such as dark scenes with low levels of movement. Other scenes, such as action scenes, require a higher bit rate because the scenes are more complex. A lower complexity scene can be seen between 0 and 50 seconds and has a small bit rate distribution between the media streams. The higher complexity scenes have a high amount of bit rate distribution as seen at about 100 seconds. In a case with such variance in the bit rates, although the bit rate of one media stream may, on average, be the highest, that media stream's bit rate may fall below the maximum bit rate for other media streams. For purposes of illustration, the bit rates are classified as index 1, 2, 3, . . . N. The bit rates for index 1 and 2 are shown at 402, 404, respectively. At a time shown at 406, the bit rate for index 1 is about 1050 bps. However, as can be seen at a time shown at 404, index 2 is about 2000 bps, which is a higher bit rate than index 1 at time 406. Thus, although index 1 is always higher than index 2 at any particular point of time, over the entire time period, index 2 can peak above values of index 1.



FIG. 5 illustrates an application 502 loaded on a playback device for rendering content. The application 502 may be run on any desired playback device that renders a media stream, such as a gaming console, a cellular phone, a personal digital assistant, in a browser on a computer, etc. The application can include a network communication module 504, a source filter 506, a media pipeline 508, a UI rendering module 510, and a heuristics module 512. The network communication module 504 generally includes software to communicate with a network server from which the media content is streamed. Thus, it is a downloader to obtain the media stream from the network. One example network communication module includes software for implementing a hypertext transfer protocol when communicating with a Web server. Other well-known protocols can be used depending on the playback device. The network communications module chooses an appropriate bitrate of a media stream as directed by the heuristics module. The source filter 506 can be coupled to the network communication module in order to receive audio and video content from the network. The source filter extracts the core media data (by parsing the file, if necessary) and splits the audio and video into two streams for use by the media pipeline. An example media pipeline 508 is shown in FIG. 8 and is described more fully below. The source filter 506 can be included in the media pipeline or separated there from. In any event, the media pipeline decodes the audio and video streams and provides the decoded streams to the UI rendering module 510 for display. Alternatively, the media pipeline 508 can be coupled to a storage device (not shown) that persistently stores the uncompressed data stream. Any variety of media pipelines may be used. The heuristics module 512 monitors the network (via the network communication module 504) and the media pipeline 508 to make intelligent decisions about which bit rate to request from the server in order to minimize glitches that are rendered on the playback device. The heuristics module also can select appropriate bit rates related to a seek operation. As described more fully below, when a seek operation is requested, the heuristics module 512 can direct the network communication module 504 to download a media stream encoded at a low bit rate in order to ensure the fastest possible start-up of rendering. After the start-up period is over, the heuristics module can direct that media streams encoded at higher bit rates are downloaded in order to increase the quality of the playback.



FIG. 6 illustrates another possible environment used to render content on the playback device 104. The lowest layer (not shown) is an operating system executing on the playback device. A platform 602 is an executable file that is downloaded one time from a web server and remains resident on the playback device 104. The platform 602 includes a media pipeline 604 that is explained further below in FIG. 8, a simple source module 606, and a UI rendering module 608 used to render the media stream. A download management program 610 is typically downloaded each time a website is accessed and includes a managed source 612 and a heuristics module 614, which include the intelligence to make decisions about a desired bit rate to download from the host device 102. The purpose of the simple source 606 is to communicate with the managed source 612. Both the managed source 612 and the heuristics module 614 are described further below. The download management program 610 and platform 602 are part of an application 620 that is loaded in a browser 622.



FIG. 7 illustrates a generalized example of a suitable computing environment 700 in which several of the described embodiments may be implemented. The computing environment 700 is not intended to suggest any limitation as to scope of use or functionality, as the techniques and tools may be implemented in diverse general-purpose or special-purpose computing environments.


With reference to FIG. 7, the computing environment 700 includes at least one processing unit 710 and memory 720. Similar computing devices may be used as either the host device 102 or the playback device 104. This most basic configuration 730 is included within a dashed line. The processing unit 710 executes computer-executable instructions and may be a real or a virtual processor. In a multi-processing system, multiple processing units execute computer-executable instructions to increase processing power. The memory 720 may be volatile memory (e.g., registers, cache, RAM), non-volatile memory (e.g., ROM, EEPROM, flash memory, etc.), or some combination of the two.


A computing environment may have additional features. For example, the computing environment 700 includes storage 740, one or more input devices 750, one or more output devices 760, and one or more communication connections 770. An interconnection mechanism (not shown) such as a bus, controller, or network interconnects the components of the computing environment 700. Typically, operating system software (not shown) provides an operating environment for other software executing in the computing environment 700, and coordinates activities of the components of the computing environment 700.


The storage 740 may be removable or non-removable, and includes magnetic disks, magnetic tapes or cassettes, CD-ROMs, DVDs, or any other medium which can be used to store information and which can be accessed within the computing environment 700. The storage 740 stores instructions for the software 780 implementing the video encoder and/or decoder.


The input device(s) 750 may be a touch input device such as a keyboard, mouse, pen, or trackball, a voice input device, a scanning device, or another device that provides input to the computing environment 700. The input device(s) 750 may be a sound card, video card, TV tuner card, or similar device that accepts audio or video input in analog or digital form, or a CD-ROM or CD-RW that reads audio or video samples into the computing environment 700. The output device(s) 760 may be a display, printer, speaker, CD-writer, or another device that provides output from the computing environment 700.


The communication connection(s) 770 enable communication over a communication medium to another computing entity. The communication medium conveys information such as computer-executable instructions, audio or video input or output, or other data in a modulated data signal. A modulated data signal is a signal that has one or more of its characteristics set or changed in such a manner as to encode information in the signal. By way of example, and not limitation, communication media include wired or wireless techniques implemented with an electrical, optical, RF, infrared, acoustic, or other carrier.


The techniques and tools can be described in the general context of computer-readable media. Computer-readable media are any available media that can be accessed within a computing environment. By way of example, and not limitation, with the computing environment 700, computer-readable media include memory 720, storage 740, communication media, and combinations of any of the above.


The techniques and tools can be described in the general context of computer-executable instructions, such as those included in program modules, being executed in a computing environment on a target real or virtual processor. Generally, program modules include routines, programs, libraries, objects, classes, components, data structures, etc. that perform particular tasks or implement particular abstract data types. The functionality of the program modules may be combined or split between program modules as desired in various embodiments. Computer-executable instructions for program modules may be executed within a local or distributed computing environment.


For the sake of presentation, the detailed description uses terms like “produce” and “encode” to describe computer operations in a computing environment. These terms are high-level abstractions for operations performed by a computer, and should not be confused with acts performed by a human being. The actual computer operations corresponding to these terms vary depending on implementation. Generally, the computing environment 700 can be used as the playback device 104.



FIG. 8 shows an example of the media pipeline 804 in more detail. The illustrated media pipeline is only an example of a possible media pipeline that can be used. In this example, a source filter 800 is included in the media pipeline and is coupled to the network to receive audio and video content from the network. The source filter can extract the core media data (by parsing the file, if necessary) and can split the audio and video into two streams. Two decoders 806, 808 can be used to decompress the encoded audio and video, respectively. Two transform modules 810, 812 can transform the decompressed audio and video signals. The transform operations can include a variety of operations, such as changing color space, changing scale, adding special effects, etc. Finally, sinks 814, 816 can be used to transmit the content to the audio and video drivers, respectively.



FIG. 9 shows an example of the download management program 610 in more detail. An index file 900 is provided by the host and generally describes the different bit rates for the media streams that are available from the network and an address (e.g., URL) where to obtain the source content. In general, the managed source 612 reads data from the network (e.g., Internet), parses the index file 900 that describes the content, parses the file received from the network (e.g., remove header information), communicates with the heuristics module 614 about which bit rate to download next, and maintains an input buffer. The heuristics module 614 instructs the managed source 612 which bit rate to pull next based on empirical data, such as one or more of the following:


1) current and historic bandwidth levels;


2) current and historic buffer levels; and


3) capabilities of the playback device.


An example index file can have separate sections for video and audio and describe the different bit rates that are available to pull from the host. It also can include the URLs, the duration of the content segments, quality information, the size of the files, the number of content segments, position in time of the content segments, the media attributes, etc. In sum, the index file includes information about the time-varying properties of the encoded media streams. An example index file is as follows:














      manifest


<MediaIndex MajorVersion=“0” MinorVersion=“1”>


 <Attribute Name=“XCP_MS_UINT64_DURATION” Value=“30”/>


<StreamIndex


 Type = “video”


 Subtype = “WVC1”


 Chunks = “15”


 Url = “{1}/chunk_{1}_{0}.vid”


>


 <Bitrate Kbps = “200”/>


 <Bitrate Kbps = “700”/>


 <Bitrate Kbps = “1500”/>


 <Attribute Name=“XCP_MS_UINT32_4CC” Value=“WVC1”/>


 <Attribute Name=“XCP_MS_UINT32_WIDTH” Value=“720”/>


 <Attribute Name=“XCP_MS_UINT32_HEIGHT” Value=“480”/>


 <Attribute Name=“XCP_MS_BLOB_VIDEO_CODEC”


Value=“270000010FCBEE1670EF8A16783BF180C9089CC4AFA11C0000010E1207F840”/>


 <c n=“0” d=“20020000”/><c n=“1” d=“20020000”/><c n=“2” d=“20020000”/><c


n=“3” d=“20020000”/><c n=“4” d=“20020000”/><c n=“5” d=“20020000”/><c n=“6”


d=“20020000”/><c n=“7” d=“20020000”/><c n=“8” d=“20020000”/><c n=“9” d=“20020000”/>


 <c n=“10” d=“20020000”/><c n=“11” d=“20020000”/><c n=“12” d=“20020000”/><c


n=“13” d=“20020000”/><c n=“14” d=“20020000”/>


</StreamIndex>


<StreamIndex


 Type = “audio”


 Subtype = “WMA”


 Chunks = “15”


 Url = “audio/chunk_{1}_{0}.aud”


 Language=“en-us”


>


 <Bitrate Kbps = “700”/>


 <Attribute Name=“XCP_MS_BLOB_WAVEFORMATEX”


Value=“6101020044AC0000853E00009D0B10000A00008800000F0000000000”/>


 <c n=“0” d=“20630000”/><c n=“1” d=“20810000”/><c n=“2” d=“19390000”/><c


n=“3” d=“20430000”/><c n=“4” d=“18800000”/><c n=“5” d=“20210000”/><c n=“6”


d=“20440000”/><c n=“7” d=“19500000”/><c n=“8” d=“21370000”/><c n=“9” d=“19040000”/>


 <c n=“10” d=“19960000”/><c n=“11” d=“20610000”/><c n=“12” d=“18870000”/><c


n=“13” d=“21360000”/><c n=“14” d=“19510000”/>


</StreamIndex>


</MediaIndex>









The content is divided into segments (called chunks) that are generally 2-5 seconds each. The chunks are available at multiple bit rates. As already discussed, the chunks may be physically divided segments or virtually divided segments (in the case of a continuous stream). After a predetermined period of time, the quality and bit rate are reevaluated to ensure a glitch-free display of the media stream.


The designation of “bit rates” refers to the bit rates available for the media stream. The “attribute” names can provide information used by the decoder in the media pipeline in order to decode the media stream. One example is that the attributes can be initialization information for the decoder. There can be different sections in the index file for “video” and “audio”, so that the chunks are described independently for each. The designation of “n=” refers to a chunk number. The chunks can be numbered sequentially. The designation of “d=” following each chunk number refers to the duration of the chunk. As can be seen, the chunks are of varying duration but are approximately equal in length. Other characteristics of the media stream can easily be inserted into the index file, such as the size of files associated with the chunks or the duration of the entire media segment. An additional characteristic is also resolution that can be useful to proper rendering. The illustrated index file is only an example and not all of the data elements described need to be used. Indeed, one or more of any of the data elements can be used.


Another example index file is as follows:














<MediaIndex MajorVersion=“0” MinorVersion=“3”>


<Attribute Name=“XCP_MS_UINT64_DURATION_HNS” Value=“1169500000”/>


<StreamIndex Type=“Video” SubType=“WVC1”


Url=“mbr/JennaEasyHD_1280×720_30fps_{1}_{0}.vid” Chunks=“62” Bitrates=“12”>


<Bitrate n=“0” Kbps=“3960” w=“1280” h=“720”/>


<Bitrate n=“1” Kbps=“2083” w=“1280” h=“720”/>


<Bitrate n=“2” Kbps=“1813” w=“1280” h=“720”/>


<Bitrate n=“3” Kbps=“1564” w=“1280” h=“720”/>


<Bitrate n=“4” Kbps=“1396” w=“1280” h=“720”/>


<Bitrate n=“5” Kbps=“1140” w=“1280” h=“720”/>


<Bitrate n=“6” Kbps=“925” w=“600” h=“400”/>


<Bitrate n=“7” Kbps=“781” w=“600” h=“400”/>


<Bitrate n=“8” Kbps=“597” w=“600” h=“400”/>


<Bitrate n=“9” Kbps=“455” w=“600” h=“400”/>


<Bitrate n=“10” Kbps=“349” w=“600” h=“400”/>


<Bitrate n=“11” Kbps=“249” w=“600” h=“400”/>


<Attribute Name=“XCP_MS_UINT32_4CC” Value=“WVC1”/>


<Attribute Name=“XCP_MS_UINT32_WIDTH” Value=“1280”/>


<Attribute Name=“XCP_MS_UINT32_HEIGHT” Value=“720”/>


<Attribute Name=“XCP_MS_BLOB_VIDEO_CODEC”


Value=“250000010fd3fe27f1678a27f859f180c8800000010e5a0040”/>


<c n=“0” d=“20020000”><f n=“0” s=“839” q=“4930”/><f n=“1” s=“413” q=“2421”/><f n=“2”


s=“367” q=“2148”/><f n=“3” s=“322” q=“1885”/><f n=“4” s=“290” q=“1696”/><f n=“5”


s=“232” q=“1355”/><f n=“6” s=“184” q=“1076”/><f n=“7” s=“164” q=“953”/><f n=“8”


s=“124” q=“721”/><f n=“9” s=“99” q=“575”/><f n=“10” s=“79” q=“454”/><f n=“11” s=“58”


q=“334”/></c>


<c n=“1” d=“22020000”><f n=“0” s=“837” q=“4761”/><f n=“1” s=“435” q=“2469”/><f n=“2”


s=“397” q=“2255”/><f n=“3” s=“342” q=“1941”/><f n=“4” s=“308” q=“1748”/><f n=“5”


s=“251” q=“1422”/><f n=“6” s=“194” q=“1099”/><f n=“7” s=“168” q=“946”/><f n=“8”


s=“130” q=“731”/><f n=“9” s=“108” q=“605”/><f n=“10” s=“88” q=“494”/><f n=“11” s=“65”


q=“359”/></c>









This index file includes additional information about each chunk. As already described above, “n” is the chunk number and “d” is the duration of the chunk. Additional information can include a designation “s=”, which is a size of each chunk. The “q” designation represents each chunk's average quality. The average quality of a chunk can be calculated during encoding. In the particular example shown, the higher quality number generally means less information is lost due to video compression. As described further below, the heuristics module makes a determination based on a number of factors, such as empirical data of the playback, which bit rate to choose. Quality levels can also be considered into the decision. For example, quality information allows intelligent decisions about accepting lower bit rates for low quality content in order to reserve bandwidth for higher bit rates for high quality content. For example, low bit rates can be used for dark scenes that have little motion (where high quality might not necessarily be visually different than low quality) in favor of using high bit rates for scenes that are complex with a lot of motion.


Any of the described index files can be represented as an XML file with the specific schema, potentially, with a simple encoding to hide clear text. It can contain media level attributes (e.g. total playback duration), and description of individual streams. Stream descriptions can include media stream-specific information, such as type of the stream (e.g. video, audio), encoding and other codec information (e.g. fourCC code, width, height), available bitrates, and information on individual media segments represented by chunks of different available bitrates (e.g. segment duration, chunk sizes). Also, the stream description can include information that allows production of individual chunks URLs for download, which is normally a text pattern that includes calculated fields based on chunk number, chunk bitrate, chunk stream and stream type.



FIG. 10 is a flowchart of a method for seeking in a media stream. In process block 1000, the playback device 104 receives user input to seek to an entry location in a media stream. A typical user input is to drag a location indicator to a new position along a time line. For example, media segments may be viewed on the Internet that include an indicator showing the current position of a video presentation and how much of the presentation remains. The indicator may be dragged along the time line to a new position. Such a drag-and-drop operation results in a seek starting from the new location. Other types of user input for a seek operation may also be used, as is well understood in the art. In process block 1002, the media stream is downloaded substantially at the new location. However, a lower bit rate version of the media stream is used to ensure fast start-up. Generally, a bit rate is used that is lower than the user's network bandwidth can sustain in order to maximize speed of start-up, rather than quality. For example, the lowest bit rate available can be used to ensure that the playback buffer fills quickly. By filling the buffer quickly, the media stream is rendered at a faster speed, albeit quality is sacrificed. Additionally, the location can be a starting point of the nearest fragment or chunk. It may also be possible (if the stream is continuous) to start the media segment at the actual location in time corresponding to the position indicator. In process block 1004, the media stream is rendered starting at the new location or as close to the new location as is possible.



FIG. 11 is a flowchart of a method showing another aspect of the seek operation. In process block 1100, a determination of a sustainable bit rate is made after the seek start-up period is completed. The seek start-up period can be any desired duration. For example, the start-up period can be a predetermined time period (e.g., 2, 3, 4 seconds, etc.) or it can be a certain number of chunks that are downloaded (1, 2, 3, 4, etc.). Generally, the heuristics module determines the sustainable bit rate based on historical information, etc., as already described. In process block 1102, the bit rate is ramped up or changed to the determined bit rate. More particularly, the media stream encoded with the determined bit rate is downloaded from the server. Thus, after a seek operation, the bit rate of the media stream rendered is temporarily reduced in order to have fast start up. After the start-up period, the media stream returns to higher bit rates to render with the highest sustainable quality. As a result, the playback device renders the media stream encoded at a first bit rate and then after a seek operation renders a media stream encoded at a lower, second bit rate, and then after a predetermined period of time after the seek, the playback device renders the media stream encoded at a higher, third bit rate that can be equal to the first bit rate or another bit rate as determined by the heuristics module.


Using a chunking scheme works well with a seek operation. For example, where each chunk has a duration of 2 seconds, if the user wants to seek to the 30th second into the content, the playback device only needs to start downloading the 15th chunk into the stream. Alternatively, the index file can be used to determine the proper location. For example, the index file can allow calculation of a chunk number associated with a selected location in the media stream. In any event, the index file can be used in cooperation with the heuristics module to convert the user seek request into a request from the server to download the media segment from a desired point.



FIG. 12 is a detailed flowchart of a method for implementing a playback after a seek operation. In process block 1200, the playback device receives user input to seek to an entry location in a media stream. In process block 1202, the entry location is used to determine a chunk number in the media stream. For example, if the entry location is 60 seconds and the chunks are 2 seconds each, then the chunk number associated with the entry location is 30. The timing can be determined using the index file described above. In process block 1204, an address (e.g., URL) associated with the chunk is determined. The address can also be determined using the index file. Additionally, the lowest bit rate associated with the media stream is selected in order to fill the playback buffer as quickly as possible to ensure fast playback. In process block 1206, a network request (e.g., HTTP request) is made using the generated network address. The playback is then initiated using the media segment encoded at a low bit rate. For example, if the media stream is encoded at 1, 2, 3, and 4 kbps, the heuristics module can select 1 kbps after a seek operation, even if this is below the network and playback device's ability to download and render. In process block 1208, a next address is generated for the subsequent chunk to be displayed. A determination is made by the heuristics module whether to elect a higher bit rate or maintain the current bit rate. If the start-up period is complete, and the playback buffer substantially full, the heuristics module can elect to increase the bit rate in order to maximize quality. For example, the heuristics module can decide to download a media stream encoded at a bit rate of 3 or 4 kbps. In process block 1210, the new address and bit rate is used to request a next chunk (i.e., fragment) from the network. In process block 1212, the playback continues and a loop is performed as shown at 1214 until the playback is completed. If another seek operation occurs, the flowchart starts again at process block 1200.



FIG. 13 is a user interface diagram showing a seek line 1300 with a current location indicator 1302 that indicates the current location of the content relative to the total duration. Multiple thumbnail photos 1304 are shown along the seek line to indicate actual or logical entry points into the content. The index file can include the information about where to place the thumbnail photos as the encoder generally knows where the scene changes are located. Thus, a user drags the current rendering location indicator 1302 to the desired point and drops to start viewing the content at the new location. Such a drag-and-drop operation causes a seek operation to occur.


Any of the examples described herein are only for purposes of illustration. For example, the example bit rates provided can easily be modified to whatever bit rates work on the system and allow for appropriate rendering of a media stream on a playback device.


In view of the many possible embodiments to which the principles of the disclosed invention may be applied, it should be recognized that the illustrated embodiments are only preferred examples of the invention and should not be taken as limiting the scope of the invention. Rather, the scope of the invention is defined by the following claims. We therefore claim as our invention all that comes within the scope of these claims.

Claims
  • 1. A method for performing a seek operation in a media stream displayed on a playback device, comprising: receiving a media stream from a network, the media stream being associated with a first bit rate and including a plurality of fragments;receiving a user request to seek to a new location in the media stream;using the new location to determine a corresponding network address of one of the plurality of fragments in the media stream;in response to the user request, downloading the media stream, associated with a second bit rate that is less than the first bit rate, from substantially the new location to ensure fast start-up by using the network address in the media stream, wherein the content of the media stream is identical at the first and second bit rates, but quality increases with higher bit rates;rendering the media stream starting at the new location; andramping-up the bit rate of the media stream after the fast start-up based on a previously stored network bandwidth.
  • 2. The method of claim 1, wherein the media stream is available from a server computer coupled to the playback device at multiple bit rates.
  • 3. The method of claim 1, further including displaying an indicator of a current point in the media segment being displayed and displaying thumbnail photos as seek points that can be selected.
  • 4. The method of claim 1, wherein the media stream is divided into the plurality of fragments of substantially equal time duration.
  • 5. The method of claim 1, further including generating a network address for the new location using an index file associated with the media stream.
  • 6. The method of claim 1, wherein the media stream includes multiple logical or actual entry points.
  • 7. The method of claim 1, wherein the playback device includes one of the following: a computer, a mobile phone, a gaming console, and a television; and wherein the network is the Internet.
  • 8. The method of claim 1, wherein the first and second bit rates for the media stream are at substantially constant bit rates or variable bit rates.
  • 9. A method for performing a seek operation, comprising: receiving a media segment, associated with a first bit rate, from a network;displaying the media segment including a location indicator showing a current time point being viewed in the media segment;receiving a request to view the media segment from a second time point that is different than the current time point;using the second time point to determine one of a plurality of fragments in the media segment associated with the second time point;receiving the media segment starting with the determine one of the plurality of fragments in the media segment, associated with a second bit rate that is lower than the first bit rate, the media segment at the second bit rate including a same content as the media segment at the first bit rate from the network for rendering from the second time point to ensure fast start-up for viewing the media segment; andreturning to receiving the media segment associated with the first bit rate from the network after the start-up is completed.
  • 10. The method of claim 9, wherein the request to view the media segment from the second time point is in response to a user drag-and-drop operation on the location indicator.
  • 11. The method of claim 9, wherein the network is the Internet.
  • 12. The method of claim 9, wherein the media segment is divided into the plurality of fragments; and further including switching to a higher bit rate after the fragment associated with the second time point is received.
  • 13. A method for performing a seek operation, comprising: receiving a media segment to display from a network, wherein the media segment comprises at least multiple sequential media fragments encoded at a first bit rate;displaying the media segment by displaying the fragments sequentially in association with a location indicator showing a current point being viewed in the media segment;receiving a seek request to view the media segment from a second, different point;generating a network address associated with the second point;requesting, from a server computer, a next fragment in the media segment that is encoded at a second bit rate, different than the first bit rate, the next fragment being at the generated network address and continuing to receive fragments at the second bit rate for a start-up period; andafter the start-up period, returning to receiving the fragments associated with the media segment that are encoded at the first bit rate or another bit rate higher than the second bit rate.
  • 14. The method of claim 13, wherein generating the network address includes using an index file that associates location in the media segment to time to generate a fragment number.
  • 15. The method of claim 13, wherein a heuristics module determines which bit rate to download from the network.
  • 16. The method of claim 15, wherein the heuristics module is in a plug-in to a browser.
  • 17. The method of claim 13, wherein the media segment is available on the network at multiple bit rates and the bit rates are constant or variable.
  • 18. The method of claim 13, further including displaying the location indicator with thumbnails representing points that can be jumped to in the media segment.
CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of U.S. Provisional Patent Application No. 61/057,759, filed on May 30, 2008, and U.S. Provisional Patent Application No. 61/057,755, filed May 30, 2008. Both applications are hereby incorporated in their entirety.

US Referenced Citations (424)
Number Name Date Kind
4051470 Esteban et al. Sep 1977 A
4454546 Mori Jun 1984 A
4493091 Gundry Jan 1985 A
4706260 Fedele et al. Nov 1987 A
4802224 Shiraki et al. Jan 1989 A
4849812 Borgers et al. Jul 1989 A
4937036 Beard et al. Jun 1990 A
4954892 Asai et al. Sep 1990 A
5043919 Callaway et al. Aug 1991 A
5089889 Sugiyama Feb 1992 A
5091782 Krause et al. Feb 1992 A
5136377 Johnston et al. Aug 1992 A
5223949 Honjo Jun 1993 A
5235618 Sakai et al. Aug 1993 A
5258836 Murata Nov 1993 A
5262964 Bonsall et al. Nov 1993 A
5266941 Akeley et al. Nov 1993 A
5317672 Crossman et al. May 1994 A
5335299 Atkinson Aug 1994 A
5394170 Akeley et al. Feb 1995 A
5398069 Huang et al. Mar 1995 A
5400371 Natarajan Mar 1995 A
5412430 Nagata May 1995 A
5414796 Jacobs et al. May 1995 A
RE34965 Sugiyama Jun 1995 E
5422676 Herpel et al. Jun 1995 A
5448297 Alattar et al. Sep 1995 A
5457495 Hartung Oct 1995 A
RE35093 Wang et al. Nov 1995 E
5467086 Jeong Nov 1995 A
5467134 Laney et al. Nov 1995 A
RE35158 Sugiyama Feb 1996 E
5533052 Bhaskar Jul 1996 A
5539466 Igarashi et al. Jul 1996 A
5570363 Holm Oct 1996 A
5579430 Grill et al. Nov 1996 A
5586200 Devaney et al. Dec 1996 A
5602959 Bergstrom et al. Feb 1997 A
5623424 Azadegan et al. Apr 1997 A
5627938 Johnston May 1997 A
5650860 Uz Jul 1997 A
5654760 Ohtsuki Aug 1997 A
5661755 Van De Kerkhof et al. Aug 1997 A
5666161 Kohiyama et al. Sep 1997 A
5666461 Igarashi et al. Sep 1997 A
5678002 Fawcett et al. Oct 1997 A
5686964 Tabatabai et al. Nov 1997 A
5699476 Van Der Meer Dec 1997 A
5701164 Kato et al. Dec 1997 A
5724453 Ratnakar et al. Mar 1998 A
5742735 Eberlein et al. Apr 1998 A
5745738 Ricard Apr 1998 A
5754974 Griffin et al. May 1998 A
5764807 Pearlman Jun 1998 A
5764814 Chen et al. Jun 1998 A
5787203 Lee et al. Jul 1998 A
5796438 Hosono Aug 1998 A
RE35910 Nagata et al. Sep 1998 E
5802213 Gardos Sep 1998 A
5819215 Dobson et al. Oct 1998 A
5825310 Tsutsui Oct 1998 A
5835149 Astle Nov 1998 A
5835495 Ferriere Nov 1998 A
5845243 Smart et al. Dec 1998 A
5867230 Wang et al. Feb 1999 A
5874995 Naimpally et al. Feb 1999 A
5884039 Ludwig et al. Mar 1999 A
5886276 Levine et al. Mar 1999 A
5903892 Hoffert et al. May 1999 A
5917830 Chen et al. Jun 1999 A
5926226 Proctor et al. Jul 1999 A
5933451 Ozkan et al. Aug 1999 A
5946419 Chen et al. Aug 1999 A
5949489 Nishikawa et al. Sep 1999 A
5952943 Walsh et al. Sep 1999 A
5963258 Nishikawa et al. Oct 1999 A
5970173 Lee et al. Oct 1999 A
5970175 Nishikawa et al. Oct 1999 A
5974184 Eifrig Oct 1999 A
5982305 Taylor Nov 1999 A
5986712 Peterson et al. Nov 1999 A
5987376 Olson et al. Nov 1999 A
5990945 Sinha et al. Nov 1999 A
5990960 Murakami et al. Nov 1999 A
5995151 Naveen et al. Nov 1999 A
6000053 Levine et al. Dec 1999 A
6002439 Murakami et al. Dec 1999 A
6006241 Purnaveja et al. Dec 1999 A
RE36507 Iu Jan 2000 E
6014706 Cannon et al. Jan 2000 A
6029126 Malvar Feb 2000 A
6040863 Kato Mar 2000 A
6041345 Levi et al. Mar 2000 A
6049630 Wang et al. Apr 2000 A
6058362 Malvar May 2000 A
6072831 Chen Jun 2000 A
6073153 Malvar Jun 2000 A
6075768 Mishra Jun 2000 A
6081554 Lee et al. Jun 2000 A
6088392 Rosenberg Jul 2000 A
RE36822 Sugiyama Aug 2000 E
6097759 Murakami et al. Aug 2000 A
6108382 Gringeri et al. Aug 2000 A
6111914 Bist Aug 2000 A
6115689 Malvar Sep 2000 A
6141053 Saukkonen Oct 2000 A
6154495 Yamaguchi et al. Nov 2000 A
6160846 Chiang et al. Dec 2000 A
6167162 Jacquin et al. Dec 2000 A
6182034 Malvar Jan 2001 B1
6188794 Nishikawa et al. Feb 2001 B1
6192075 Jeng Feb 2001 B1
6208761 Passaggio et al. Mar 2001 B1
6212232 Reed et al. Apr 2001 B1
6215820 Bagni et al. Apr 2001 B1
6223162 Chen et al. Apr 2001 B1
6226407 Zabih et al. May 2001 B1
6240380 Malvar May 2001 B1
RE37222 Yonemitsu et al. Jun 2001 E
6243497 Chiang et al. Jun 2001 B1
6259739 Kondo Jul 2001 B1
6259810 Gill et al. Jul 2001 B1
6275531 Li Aug 2001 B1
6278735 Mohsenian Aug 2001 B1
6292585 Yamaguchi et al. Sep 2001 B1
6304928 Mairs et al. Oct 2001 B1
6307973 Nishikawa et al. Oct 2001 B2
6311209 Olson et al. Oct 2001 B1
6320825 Bruekers et al. Nov 2001 B1
6324216 Igarashi et al. Nov 2001 B1
6332003 Matsuura Dec 2001 B1
6339794 Bolosky et al. Jan 2002 B2
6351226 Saunders et al. Feb 2002 B1
6370502 Wu et al. Apr 2002 B1
6404813 Haskell et al. Jun 2002 B1
6421738 Ratan et al. Jul 2002 B1
6421739 Holiday Jul 2002 B1
6441754 Wang et al. Aug 2002 B1
6466987 Bolosky et al. Oct 2002 B2
6473409 Malvar Oct 2002 B1
6490554 Endo et al. Dec 2002 B2
6493388 Wang Dec 2002 B1
6496601 Migdal et al. Dec 2002 B1
6501797 van der Schaar et al. Dec 2002 B1
6501798 Sivan Dec 2002 B1
6522693 Lu et al. Feb 2003 B1
6539124 Sethuraman et al. Mar 2003 B2
6560636 Cohen et al. May 2003 B2
6573905 MacInnis et al. Jun 2003 B1
6573915 Sivan et al. Jun 2003 B1
6574593 Gao et al. Jun 2003 B1
6614442 Ouyang et al. Sep 2003 B1
6625321 Li et al. Sep 2003 B1
6628712 Le Maguet Sep 2003 B1
6646195 Puryear Nov 2003 B1
6654417 Hui Nov 2003 B1
6654419 Sriram et al. Nov 2003 B1
6654790 Ogle et al. Nov 2003 B2
6675199 Mohammed et al. Jan 2004 B1
6683987 Sugahara Jan 2004 B1
6697072 Russell et al. Feb 2004 B2
6704813 Smirnov et al. Mar 2004 B2
6728317 Demos Apr 2004 B1
6732071 Lopez-Estrada et al. May 2004 B2
6745364 Bhatt et al. Jun 2004 B2
6754715 Cannon et al. Jun 2004 B1
6760482 Taubman Jul 2004 B1
6760598 Kurjenniemi Jul 2004 B1
6763374 Levi et al. Jul 2004 B1
6785331 Jozawa et al. Aug 2004 B1
6789123 Li et al. Sep 2004 B2
6792449 Colville et al. Sep 2004 B2
6798364 Chen et al. Sep 2004 B2
6801947 Li Oct 2004 B1
6810083 Chen et al. Oct 2004 B2
6819714 Yamada et al. Nov 2004 B2
6836791 Levi et al. Dec 2004 B1
6862402 Kim Mar 2005 B2
6876703 Ismaeil et al. Apr 2005 B2
6885471 Minowa et al. Apr 2005 B1
6895050 Lee May 2005 B2
6934677 Chen et al. Aug 2005 B2
6937770 Oguz et al. Aug 2005 B1
6961631 Puryear Nov 2005 B1
6968364 Wong et al. Nov 2005 B1
6974901 Puryear Dec 2005 B2
6980695 Mehrotra Dec 2005 B2
7016409 Unger Mar 2006 B2
7023915 Pian Apr 2006 B2
7027982 Chen et al. Apr 2006 B2
7031700 Weaver et al. Apr 2006 B1
7046805 Fitzhardinge et al. May 2006 B2
7054365 Kim et al. May 2006 B2
7054774 Batterberry et al. May 2006 B2
7072973 Newson et al. Jul 2006 B1
7107606 Lee Sep 2006 B2
7111044 Lee Sep 2006 B2
7124164 Chemtob Oct 2006 B1
7143030 Chen et al. Nov 2006 B2
7146313 Chen et al. Dec 2006 B2
7149247 Sullivan Dec 2006 B2
7151749 Vega-Garcia et al. Dec 2006 B2
7162533 Klemets Jan 2007 B2
7174384 Cheung Feb 2007 B2
7174385 Li Feb 2007 B2
7176957 Ivashin et al. Feb 2007 B2
7177642 Sanchez Herrero et al. Feb 2007 B2
7184959 Gibbon Feb 2007 B2
7190670 Varsa et al. Mar 2007 B2
7206822 Levi et al. Apr 2007 B2
7206854 Kauffman et al. Apr 2007 B2
7248740 Sullivan Jul 2007 B2
7260525 Chen et al. Aug 2007 B2
7263482 Chen et al. Aug 2007 B2
7266613 Brown et al. Sep 2007 B1
7283881 Puryear Oct 2007 B2
7283966 Zhang et al. Oct 2007 B2
7286748 Srinivasan et al. Oct 2007 B2
7296063 Levi et al. Nov 2007 B2
7302490 Gupta et al. Nov 2007 B1
7313236 Amini et al. Dec 2007 B2
7313755 Rahman et al. Dec 2007 B2
7342924 Levi et al. Mar 2008 B2
7343291 Thumpudi et al. Mar 2008 B2
7346007 Curcio et al. Mar 2008 B2
7348483 Puryear Mar 2008 B2
7359955 Menon et al. Apr 2008 B2
7360230 Paz et al. Apr 2008 B1
7365752 Xie Apr 2008 B2
7383180 Thumpudi et al. Jun 2008 B2
7391717 Klemets et al. Jun 2008 B2
7392316 Klemets et al. Jun 2008 B2
7401221 Adent et al. Jul 2008 B2
7409145 Antoun et al. Aug 2008 B2
7424730 Chou Sep 2008 B2
7433746 Puryear Oct 2008 B2
7444419 Green Oct 2008 B2
7451229 Klemets et al. Nov 2008 B2
7466721 Levi et al. Dec 2008 B2
7472198 Gupta et al. Dec 2008 B2
7480382 Dunbar et al. Jan 2009 B2
7483532 Alkove et al. Jan 2009 B2
7492769 Klemets Feb 2009 B2
7493644 Tanskanen Feb 2009 B1
7505485 Sullivan et al. Mar 2009 B2
7528314 Puryear May 2009 B2
7529541 Cho et al. May 2009 B2
7536469 Chou et al. May 2009 B2
7538267 Puryear May 2009 B2
7552227 Wang Jun 2009 B2
7554922 Vega-Garcia et al. Jun 2009 B2
7555464 Candelore Jun 2009 B2
7558472 Locket et al. Jul 2009 B2
7565429 Fernandez Jul 2009 B1
7581255 Alkove et al. Aug 2009 B2
7603387 Gates et al. Oct 2009 B2
7631015 Gupta et al. Dec 2009 B2
7631039 Eisenberg Dec 2009 B2
7633005 Puryear Dec 2009 B2
7644172 Stewart et al. Jan 2010 B2
7663049 Puryear Feb 2010 B2
7667121 Puryear Feb 2010 B2
7672743 Messer et al. Mar 2010 B2
7673306 Puryear Mar 2010 B2
7673315 Wong et al. Mar 2010 B1
7676495 Qian Mar 2010 B2
7684566 Oliveira et al. Mar 2010 B2
7720908 Newson et al. May 2010 B1
7725557 Klemets et al. May 2010 B2
7761609 Srinivasan et al. Jul 2010 B1
7769880 Paka et al. Aug 2010 B2
7783772 Klemets Aug 2010 B2
7783773 Wu et al. Aug 2010 B2
7797720 Gopalakrishnan et al. Sep 2010 B2
7809851 Klemets Oct 2010 B2
7839895 Sullivan et al. Nov 2010 B2
7860996 Musayev et al. Dec 2010 B2
7873040 Karlsgodt Jan 2011 B2
20020012394 Hatano et al. Jan 2002 A1
20020073084 Kauffman et al. Jun 2002 A1
20020087634 Ogle et al. Jul 2002 A1
20020114388 Ueda Aug 2002 A1
20020118809 Eisenberg Aug 2002 A1
20020122491 Karczewicz et al. Sep 2002 A1
20020133547 Lin et al. Sep 2002 A1
20020136406 Fitzhardinge et al. Sep 2002 A1
20020138619 Ramaley et al. Sep 2002 A1
20020143556 Kadatch Oct 2002 A1
20020146102 Lang Oct 2002 A1
20020154693 Demos Oct 2002 A1
20020168066 Li Nov 2002 A1
20020176624 Kostrzewski et al. Nov 2002 A1
20020178138 Ender et al. Nov 2002 A1
20020184391 Phillips Dec 2002 A1
20020194608 Goldhor Dec 2002 A1
20030007464 Balani Jan 2003 A1
20030037103 Salmi et al. Feb 2003 A1
20030055995 Ala-Honkola Mar 2003 A1
20030061607 Hunter et al. Mar 2003 A1
20030072370 Girod et al. Apr 2003 A1
20030078972 Tapissier et al. Apr 2003 A1
20030093530 Syed May 2003 A1
20030110236 Yang et al. Jun 2003 A1
20030113026 Srinivasan et al. Jun 2003 A1
20030115041 Chen Jun 2003 A1
20030115042 Chen Jun 2003 A1
20030115050 Chen Jun 2003 A1
20030115051 Chen Jun 2003 A1
20030115052 Chen Jun 2003 A1
20030125932 Wang et al. Jul 2003 A1
20030172131 Ao Sep 2003 A1
20030220972 Montet et al. Nov 2003 A1
20030236905 Choi et al. Dec 2003 A1
20030236906 Klemets et al. Dec 2003 A1
20040042549 Huang et al. Mar 2004 A1
20040098748 Bo et al. May 2004 A1
20040117427 Allen et al. Jun 2004 A1
20040131340 Antoun et al. Jul 2004 A1
20040136457 Funnell et al. Jul 2004 A1
20040141651 Hara et al. Jul 2004 A1
20040172478 Jacobs Sep 2004 A1
20040268397 Dunbar et al. Dec 2004 A1
20050002453 Chang et al. Jan 2005 A1
20050009520 Herrero et al. Jan 2005 A1
20050015259 Thumpudi et al. Jan 2005 A1
20050015528 Du Jan 2005 A1
20050016363 Puryear Jan 2005 A1
20050024487 Chen Feb 2005 A1
20050036759 Lin et al. Feb 2005 A1
20050047503 Han et al. Mar 2005 A1
20050050152 Penner et al. Mar 2005 A1
20050066063 Grigorovitch et al. Mar 2005 A1
20050076039 Ludwig et al. Apr 2005 A1
20050076136 Cho Apr 2005 A1
20050084015 Han et al. Apr 2005 A1
20050084166 Boneh et al. Apr 2005 A1
20050105815 Zhang et al. May 2005 A1
20050117641 Xu et al. Jun 2005 A1
20050123058 Greenbaum Jun 2005 A1
20050135484 Lee Jun 2005 A1
20050157784 Tanizawa et al. Jul 2005 A1
20050204385 Sull et al. Sep 2005 A1
20050207734 Howell Sep 2005 A1
20050234731 Sirivara et al. Oct 2005 A1
20050234858 Torii et al. Oct 2005 A1
20050246384 Foehr et al. Nov 2005 A1
20050254508 Aksu et al. Nov 2005 A1
20050254584 Kim et al. Nov 2005 A1
20050267994 Wong et al. Dec 2005 A1
20060015637 Chung Jan 2006 A1
20060026294 Virdi Feb 2006 A1
20060029065 Fellman Feb 2006 A1
20060047779 Deshpande Mar 2006 A1
20060062302 Yin et al. Mar 2006 A1
20060088094 Cieplinski et al. Apr 2006 A1
20060126713 Chou et al. Jun 2006 A1
20060136597 Shabtai et al. Jun 2006 A1
20060156363 Wu et al. Jul 2006 A1
20060165166 Chou Jul 2006 A1
20060184697 Virdi Aug 2006 A1
20060218264 Ogawa et al. Sep 2006 A1
20060235883 Krebs et al. Oct 2006 A1
20060242080 Van Dyke et al. Oct 2006 A1
20060242315 Nichols Oct 2006 A1
20060248570 Witwer Nov 2006 A1
20060270404 Tuohino et al. Nov 2006 A1
20060282540 Tanimoto Dec 2006 A1
20060282566 Virdi et al. Dec 2006 A1
20060288099 Jefferson et al. Dec 2006 A1
20070006064 Colle Jan 2007 A1
20070037599 Tillet et al. Feb 2007 A1
20070038873 Oliveira et al. Feb 2007 A1
20070058926 Virdi Mar 2007 A1
20070078768 Dawson Apr 2007 A1
20070081586 Raveendran et al. Apr 2007 A1
20070083886 Kauffman et al. Apr 2007 A1
20070097816 Van Gassel May 2007 A1
20070100891 Nee May 2007 A1
20070198931 Ono et al. Aug 2007 A1
20070204321 Shen et al. Aug 2007 A1
20070274383 Yu et al. Nov 2007 A1
20070276954 Chan et al. Nov 2007 A1
20080022005 Wu et al. Jan 2008 A1
20080037954 Lee Feb 2008 A1
20080046939 Lu et al. Feb 2008 A1
20080060029 Park et al. Mar 2008 A1
20080086570 Dey et al. Apr 2008 A1
20080091838 Miceli Apr 2008 A1
20080172441 Speicher Jul 2008 A1
20080195743 Brueck et al. Aug 2008 A1
20080195744 Bowra Aug 2008 A1
20080195761 Jabri et al. Aug 2008 A1
20080201386 Maharajh et al. Aug 2008 A1
20080211901 Civanlar et al. Sep 2008 A1
20080256085 Lee et al. Oct 2008 A1
20080312923 Crinon et al. Dec 2008 A1
20090006538 Risney et al. Jan 2009 A1
20090043906 Hurst et al. Feb 2009 A1
20090049186 Agnihotri et al. Feb 2009 A1
20090055417 Hannuksela Feb 2009 A1
20090076904 Serena Mar 2009 A1
20090089401 Zhang et al. Apr 2009 A1
20090132599 Soroushian et al. May 2009 A1
20090132721 Soroushian et al. May 2009 A1
20090254672 Zhang Oct 2009 A1
20090279605 Holcomb et al. Nov 2009 A1
20090282162 Mehrotra et al. Nov 2009 A1
20090282475 George et al. Nov 2009 A1
20090300145 Musayev et al. Dec 2009 A1
20090300203 Virdi et al. Dec 2009 A1
20090300204 Zhang et al. Dec 2009 A1
20090319681 Freelander et al. Dec 2009 A1
20090328124 Khouzam et al. Dec 2009 A1
20100011119 Knowlton et al. Jan 2010 A1
20100058061 Folta et al. Mar 2010 A1
20100080290 Mehrotra Apr 2010 A1
20100114921 Bocharov et al. May 2010 A1
20100135636 Zhang et al. Jun 2010 A1
20100158101 Wu et al. Jun 2010 A1
20100180011 Sood et al. Jul 2010 A1
20100189183 Gu et al. Jul 2010 A1
20100191974 Dubhashi et al. Jul 2010 A1
20100235472 Sood et al. Sep 2010 A1
20100235528 Bocharov et al. Sep 2010 A1
Foreign Referenced Citations (8)
Number Date Country
0397402 Nov 1990 EP
0526163 Feb 1993 EP
62 213 494 Sep 1987 JP
6 078 298 Mar 1994 JP
10 056 644 Feb 1998 JP
2008-523687 Jul 2008 JP
WO 0036753 Jun 2000 WO
WO 2007058515 May 2007 WO
Non-Patent Literature Citations (125)
Entry
Agarwal et al., “Optimal Buffering Policy for Downloading Music in Heterogeneous Wireless Networks,” Wireless Communications and Networking Conference, vol. 1, pp. 337-341, Mar. 17-21, 2002.
Chavez et al., “Monitoring-Based Adaptive Overlay Streaming Media,” printed from http://www.eecs.berkeley.edu/Programs/ugrad/superb/papers2003/Brian%20Chavez.pdf on Aug. 12, 2008.
Huang et al., “Adaptive Live Video Streaming by Priority Drop,” Proceedings of the IEEE Conference on Advanced Video and Signal Based Surveillance, pp. 342-347, Jul. 21-22, 2003.
Qazzaz et al., “Providing Interactive Video on Demand Services in Distributed Architecture,” 29th Proceedings of the Euromicro Conference, pp. 215-222, Sep. 1-6, 2003.
Reibman et al., “Video Quality Estimation for Internet Streaming,” International World Wide Web Conference, pp. 1168-1169, 2005.
Srinivasan et al., “Windows Media Video 9: Overview and Applications,” Signal Processing: Image Communication, vol. 19, pp. 851-875, Oct. 2004.
Zhang et al., “Seamless Bit-Stream Switching in Multirate-Based Video Streaming Systems,” EURASIP Journal on Applied Signal Processing, vol. 2006, No. 18, p. 1-11, 2006.
U.S. Appl. No. 60/341,674, filed Dec. 17, 2001, Lee et al.
Advanced Television Systems Committee, “ATSC Standard: Digital Audio Compression (AC-3), Revision A,” pp. 1-140 (Aug. 2001).
Aksoy, “Wireless Thin Client Optimization for Multimedia Applications,” M.S. Thesis, 166 pp. (2000).
Barker et al., “Dynamic Programming Based Smoothing of VBR Video Traffic,” 10 pp. (document marked Mar. 6, 2002).
Baron et al, “Coding the Audio Signal,” Digital Image and Audio Communications, pp. 101-128 (1998).
Beerends, “Audio Quality Determination Based on Perceptual Measurement Techniques,” Applications of Digital Signal Processing to Audio and Acoustics, Chapter 1, Ed. Mark Kahrs, Karlheinz Brandenburg, Kluwer Acad. Publ., pp. 1-38 (1998).
Caetano et al., “Rate Control Strategy for Embedded Wavelet Video Coders,” Electronic Letters, pp. 1815-1817 (Oct. 14, 1999).
Cheung et al., “A Comparison of Scalar Quantization Strategies for Noisy Data Channel Data Transmission,” IEEE Transactions on Communications, vol. 43, No. 2/3/4, pp. 738-742 (Apr. 1995).
Crisafulli et al., “Adaptive Quantization: Solution via Nonadaptive Linear Control,” IEEE Transactions on Communications, vol. 41, pp. 741-748 (May 1993).
Dai, “Rate-Distortion Analysis and Traffic Modeling of Scalable Video Coders,” Dissertation, Texas A&M University, 172 pp. (Dec. 2004).
Dalgic et al., “Characterization of Quality and Traffic for Various Video Encoding Schemes and Various Encoder Control Schemes,” Technical Report No. CSL-TR-96-701 (Aug. 1996).
De Luca, “AN1090 Application Note: STA013 MPEG 2.5 Layer III Source Decoder,” STMicroelectronics, 17 pp. (1999).
de Queiroz et al., “Time-Varying Lapped Transforms and Wavelet Packets,” IEEE Transactions on Signal Processing, vol. 41, pp. 3293-3305 (1993).
“DivX Multi Standard Video Encoder,” 2 pp. (Downloaded from the World Wide Web on Jan. 24, 2006).
Doering, “Low-Cost, High-Impact Video Production Techniques for Laboratory Instructional Materials,” ASEE/IEEE Frontiers in Education Conference, Session F1C, pp. 14-18 (Oct. 2001.).
Dolby Laboratories, “AAC Technology,” 4 pp. [Downloaded from the web site aac-audio.com on World Wide Web on Nov. 21, 2001].
Fraunhofer-Gesellschaft, “MPEG Audio Layer-3,” 4 pp. [Downloaded from the World Wide Web on Oct. 24, 2001].
Fraunhofer-Gesellschaft, “MPEG-2 AAC,” 3 pp. [Downloaded from the World Wide Web on Oct. 24, 2001].
Gibson et al, Digital Compression for Multimedia, Chapter 4, “Quantization,” pp. 113-138 (1998).
Gibson et al., Digital Compression for Multimedia, Chapter 7, “Frequency Domain Coding,” Morgan Kaufman Publishers, Inc., pp. iii., v-xi, and 227-262 (1998).
Gibson et al., Digital Compression for Multimedia, Chapter 8, “Frequency Domain Speech and Audio Coding Standards,” Morgan Kaufman Publishers, Inc., pp. 263-290 (1998).
Gibson et al., Digital Compression for Multimedia, Chapter 11.4, “MPEG Audio,” Morgan Kaufman Publishers, Inc., pp. 398-402 (1998).
Gibson et al., Digital Compression for Multimedia, Chapter 11.6.2-11.6.4, “More MPEG,” Morgan Kaufman Publishers, Inc., pp. 415-416 (1998).
Gill et al., “Creating High-Quality Content with Microsoft Windows Media Encoder 7,” 4 pp. (2000). [Downloaded from the World Wide Web on May 1, 2002.].
Girod et al., “Advances in channel-adaptive video streaming,” Wireless Communications and Mobile Computing, 24 pp. (Sep. 2002).
Guo et al., “P2Cast: Peer-to-peer Patching Scheme for VoD Service,” Proceedings of the 12th International Conference on World Wide Web, 2003, 9 pages.
Herley et al., “Tilings of the Time-Frequency Plane: Construction of Arbitrary Orthogonal Bases and Fast Tiling Algorithms,” IEEE Transactions on Signal Processing, vol. 41, No. 12, pp. 3341-3359 (1993).
He et al., “A Unified Rate-Distortion Analysis Framework for Transform Coding,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 11, No. 12, pp. 1221-1236 (Dec. 2001).
Hsu et al., “Joint Selection of Source and Channel Rate for VBR Video Transmission Under ATM Policing Constraints,” IEEE Journal on Selected Areas in Communications, vol. 15, No. 6, pp. 1016-1028 (Aug. 1997).
Huang et al., “Optimal Coding Rate Control of Scalable and Multi Bit Rate Streaming Media,” Microsoft Research Technical Report, MSR-TR-2005-47, 26 pp. (Apr. 2005).
Huang et al., “Optimal Control of Multiple Bit Rates for Streaming Media,” Proc. Picture Coding Symposium, 4 pp. (Dec. 2004).
International Search Report and Written Opinion dated Mar. 22, 2010, from Application No. PCT/US2009/054081, 9 pp.
ISO, “MPEG-4 Video Verification Model version 18.0,” ISO/IEC JTC1/SC29/WG11 N3908, Pisa, pp. 1-10, 299-311 (Jan. 2001).
ISO/IEC, “Information Technology—Coding of Audio-Visual Objects: Visual, ISO/IEC 14496-2, Committee Draft,” 330 pp. (1998).
ISO/IEC, “ISO/IEC 11172-2: Information Technology—Coding of Moving Pictures and Associatged Audio for Storage Medua at up to About 1.5 Mbit/s,” 122 pp. (1993).
ISO/IEC 11172-3, Information Technology—Coding of Moving Pictures and Associated Audio for Digital Storage Media at Up to About 1.5 Mbit/s—Part 3 Audio, 154 pp, (1993).
ISO/IEC 13818-7, “Information Technology—Generic Coding of Moving Pictures and Associated Audio Information,” Part 7: Advanced Audio Coding (AAC), pp. i-iv, 1-145 (1997).
ISO/IEC 13818-7, Technical Corrigendum 1, “Information Technology—Generic Coding of Moving Pictures and Associated Audio Information,” Part 7: Advanced Audio Coding (AAC), Technical Corrigendum, pp. 1-22 (1997).
ITU-T, “ITU-T Recommendation H.261: Video Codec for Audiovisual Services at p x 64 kbits,” 28 pp. (1993).
ITU-T, “ITU-T Recommendation H.262: Information Technology—Generic Coding of Moving Pictures and Associated Audio Information: Video,” 218 pp. (1995).
ITU-T, “ITU-T Recommendation H.263: Video Coding for Low Bit Rate Communication,” 167 pp. (1998).
ITU, Recommendation ITU-R BS 1115, Low Bit-Rate Audio Coding, 9 pp. (1994).
ITU, Recommendation ITU-R BS 1387, Method for Objective Measurements of Perceived Audio Quality, 89 pp. (1998).
Jafarkhani et al., “Entropy-Constrained Successively Refinable Scalar Quantization,” IEEE Data Compression Conference, pp. 337-346 (Mar. 1997).
Jayant et al., Digital Coding of Waveforms, Principles and Applications to Speech and Video, Prentice Hall, pp. 428-445 (Mar. 1984).
Jenkac et al., “On Video Streaming over Variable Bit-rate and Wireless Channels,” presented at Packet Video 2003, Nantes, France, Apr. 28-29, 2003, 11 pp.
Jesteadt et al., “Forward Masking as a Function of Frequency, Masker Level, and Signal Delay,” Journal of Acoustical Society of America, vol. 71, pp. 950-962 (1982).
Johansen, “Rate-Distortion Optimization for Video Communication in Resource Constrained IP Networks,” Thesis, Norwegian University of Science and Technology, 161 pp. (Dec. 2007).
Joint Video Team of ISO/IEC MPEG and ITU-T VCEG, “Committee Draft of Joint Video Specification (ITU-T Recommendation H.264, ISO/IEC 14496-10 AVC,” 142 pp. (Aug. 2002).
Kalman et al., “Rate-Distortion Optimized Video Streaming with Adaptive Playout,” Proc. Int'l Conf. on Image Processing, 4 pp (Jun. 2002).
Kammin et al., “Video multiplexing for the MPEG-2 VBR encoder using a deterministic method,” Second Int'l Conf. on Automated Production of Cross Media Content for Multi-Channel Distribution, 8 pp. (Dec. 2006).
Kondoz, Digital Speech: Coding for Low Bit Rate Communications Systems, “Chapter 3.3: Linear Predictive Modeling of Speech Signals,” and “Chapter 4: LPC Parameter Quantisation Using LSFs,” John Wiley & Sons, pp. 42-53 and 79-97 (1994).
Li et al., “Optimal Linear Interpolation Coding for Server-Based Computing,” Proc. IEEE Int'l Conf. on Communications, 5 pp. (Apr. 2002).
Lutfi, “Additivity of Simultaneous Masking,” Journal of Acoustic Society of America, vol. 73, pp. 262-267 (1983).
Malvar, “Biorthogonal and Nonuniform Lapped Transforms for Transform Coding with Reduced Blocking and Ringing Artifacts,” IEEE Transactions on Signal Processing, Special Issue on Multirate Systems, Filter Banks, Wavelets, and Applications, vol. 46, 29 pp. (1998).
Malvar, “Lapped Transforms for Efficient Transform/Subband Coding,” IEEE Transactions on Acoustics, Speech and Signal Processing, vol. 38, No. 6, pp. 969-978 (1990).
Malvar, Signal Processing with Lapped Transforms, Artech House, Norwood, MA, pp. iv, vii-xi, 175-218, and 353-357 (1992).
Matthias, “An Overview of Microsoft Windows Media Screen Technology,” 3 pp. (2000). [Downloaded from the World Wide Web on May 1, 2002.].
Mook, “Next-Gen Windows Media Player Leaks to the Web,” BetaNews, 17 pp. (Jul. 19, 2002) [Downloaded from the World Wide Web on Aug. 8, 2003].
Naveen et al., “Subband Finite State Scalar Quantization,” IEEE Transactions on Image Processing, vol. 5, No. 1, pp. 150-155 (Jan. 1996).
OPTICOM GmbH, “Objective Perceptual Measurement,” 14 pp. [Downloaded from the World Wide Web on Oct. 24, 2001].
OPTX International, “OPTX Improves Technology-Based Training with ScreenWatch™ 3.0. Versatile Screen Capture Software Adds High Color and Live Webcast Support,” 1 p., document marked Feb. 15, 2001 [Downloaded from the World Wide Web on Sep. 22, 2005.].
OPTX International, “OPTX International Marks One Year Anniversary of Screen Watch With Release of New 2.0 Version,” 1 p. document marked May 16, 2000 [Downloaded from the World Wide Web on Sep. 22, 2005.].
OPTX International, “New ScreenWatch™ 4.0 Click and Stream™ Wizard From OPTX International Makes Workplace Communication Effortless,” 1 p., document marked Sep. 24, 2001 [Downloaded from the World Wide Web on Sep. 22, 2005.].
Ortega et al., “Adaptive Scalar Quantization Without Side Information,” IEEE Transactions on Image Processing, vol. 6, No. 5, pp. 665-676 (May 1997).
Ortega, “Optimal bit allocation under multiple rate constraints,” Proc. of the Data Compression Conf., 10 pp. (Apr. 1996).
Ortega et al., “Optimal Buffer-Constrained Source Quantization and Fast Approximations,” IEEE, pp. 192-195 (May 1992).
Ortega et al., “Optimal Trellis-based Buffered Compression and Fast Approximation,” IEEE Transactions on Image Processing, vol. 3, No. 1, pp. 26-40 (Jan. 1994).
Palmer et al., “Shared Desktop: A Collaborative Tool for Sharing 3-D Applications Among Different Window Systems,” Digital Tech. Journal, vol. 9, No. 3, pp. 42-49 (1997).
Pao, “Encoding Stored Video for Streaming Applications,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 11, No. 2, pp. 199-209 (Feb. 2001).
Phamdo, “Speech Compression,” 13 pp. [Downloaded from the World Wide Web on Nov. 25, 2001].
Printouts of FTP directories from http://ftp3.itu.ch, 8 pp. (downloaded from the World Wide Web on Sep. 20, 2005).
Ramchandran et al., “Bit Allocation for Dependent Quantization with Applications to MPEG Video Coders,” IEEE, pp. v-381-v-384 (Apr. 1993).
Ratnakar et al., “RD-OPT: An Efficient Algorithm for Optimizing DCT Quantization Tables,” IEEE, pp. 332-341 (Mar. 1995).
Reader, “History of MPEG Video Compression—Ver. 4.0,” 99 pp. (document marked Dec. 16, 2003).
Reed et al., “Constrained Bit-Rate Control for Very Low Bit-Rate Streaming-Video Applications,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 11, No. 7, pp. 882-889 (Jul. 2001).
Reibman et al., “Constraints on Variable Bit-rate Video for ATM Networks,” IEEE Transactions on Circuits and Systems for Video Technology, No. 4, pp. 361-372 (Dec. 1992).
Rexford et al., “Online Smoothing of Live, Variable-Bit-Rate Video,” IEEE, pp. 235-243 (May 1997).
Ribas Corbera et al., “Rate Control in DCT Video Coding for Low-Delay Communications,” IEEE Transactions on Circuits and Systems for Video Technology, vol. 9, No. 1, pp. 172-185 (Feb. 1999).
Ronda et al., “Rate Control and Bit Allocation for MPEG-4,” IEEE Transactions on Circuits and Systems for Video Technology, pp. 1243-1258 (Dec. 1999).
Schaar-Mitrea et al., “Hybrid Compression of Video with Graphics in DTV Communications Systems,” IEEE Trans. on Consumer Electronics, pp. 1007-1017 (2000).
Shlien, “The Modulated Lapped Transform, Its Time-Varying Forms, and Its Applications to Audio Coding Standards,” IEEE Transactions on Speech and Audio Processing, vol. 5, No. 4, pp. 359-366 (Jul. 1997).
Schulzrinne, “Operating System Issues for Continuous Media,” ACM Multimedia Systems, vol. 4, No. 5, 13 pp. (Mar. 1996).
Schuster et al., “A Theory for the Optimal Bit Allocation Between Displacement Vector Field and Displaced Frame Difference,” IEEE J. on Selected Areas in Comm., vol. 15, No. 9, pp. 1739-1751 (Dec. 1997).
Sheu et al., “A Buffer Allocation Mechanism for VBR Video Playback,” Communication Tech. Proc. 2000, WCC-ICCT 2000, vol. 2, pp. 1641-1644 (Aug. 2000).
Sidiropoulos, “Optimal Adaptive Scalar Quantization and Image Compression,” ICIP, pp. 574-578 (Oct. 1998).
Sjoberg et al., “Run-length Coding of Skipped Macroblocks,” ITU-T SG16/Q.6 VCEG-M57, pp. 1-5 (Apr. 2001).
Solari, Digital Video and Audio Compression, Title Page, Contents, “Chapter 8: Sound and Audio,” McGraw-Hill, Inc., pp. iii, v-vi, and 187-211 (1997).
Srinivasan et al., “High-Quality Audio Compression Using an Adaptive Wavelet Packet Decomposition and Psychoacoustic Modeling,” IEEE Transactions on Signal Processing, vol. 46, No. 4, pp. 1085-1093 (Apr. 1998).
Sullivan, “Optimal Entropy Constrained Scalar Quantization for Exponential and Laplacian Random Variables,” ICASSP, pp. V-265-V-268 (Apr. 1994).
Sullivan et al., “Rate-Distortion Optimization for Video Compression,” IEEE Signal Processing Magazine, pp. 74-90 (Nov. 1998).
Sullivan et al., “The H.264/AVC Advanced Video Coding Standard: Overview and Introduction to the Fidelity Range Extensions,” 21 pp. (Aug. 2004).
Sun et al., “Seamless Switching of Scalable Video Bitstreams for Efficient Streaming,” IEEE Transactions on Multimedia, vol. 6, No. 2, pp. 291-303 (Apr. 2004).
Tao et al., “Adaptive Model-driven Bit Allocation for MPEG Video Coding,” IEEE Transactions on Circuits and Systems for Video Tech., vol. 10, No. 1, pp. 147-157 (Feb. 2000).
Techsmith Corporation, “Camtasia Feature of the Week: Quick Capture,” 2 pp. [Downloaded from the World Wide Web on May 9, 2002; document dated Jan. 4, 2001].
Techsmith Corporation, “Camtasia Screen Recorder SDK DLL API User Guide,” Version 1.0, 66 pp. (2001).
Techsmith Corporation, “Camtasia v.3.0.1—README.TXT,” 19 pp. (Jan. 2002).
Techsmith Corporation, “Techsmith Camtasia Screen Recorder SDK,” 2 pp. (2001).
Terhardt, “Calculating Virtual Pitch,” Hearing Research, vol. 1, pp. 155-182 (1979).
Trushkin, “On the Design on an Optimal Quantizer,” IEEE Transactions on Information Theory, vol. 39, No. 4, pp. 1180-1194 (Jul. 1993).
Tsang et al., “Fuzzy based rate control for real-time MPEG video,” 12 pp. (Nov. 1998).
Vetro et al., “An Overview of MPEG-4 Object-Based Encoding Algorithms,” IEEE International Symposium on Information Technology, pp. 366-369 (2001).
Vicars-Harris, “An Overview of Advanced Systems Format,” 3 pp. (May 2003) [Downloaded from the World Wide Web on Mar. 16, 2004].
Walpole et al., “A Player for Adaptive MPEG Video Streaming over the Internet,” Proc. SPIE, vol. 3240, pp. 270-281 (Mar. 1998).
Westerink et al., “Two-pass MPEG-2 Variable-bit-rate Encoding,” IBM J. Res. Develop., vol. 43, No. 4, pp. 471-488 (Jul. 1999).
Wong, “Progressively Adaptive Scalar Quantization,” ICIP, pp. 357-360 (Sep. 1996).
Wragg et al., “An Optimised Software Solution for an ARM Powered™ MP3 Decoder,” 9 pp. [Downloaded from the World Wide Web on Oct. 27, 2001].
Wu et al., “Entropy-Constrained Scalar Quantization and Minimum Entropy with Error Bound by Discrete Wavelet Transforms in Image Compression,” IEEE Transactions on Image Processing, vol. 48, No. 4, pp. 1133-1143 (Apr. 2000).
Wu et al., “Joint estimation of forward and backward motion vectors for interpolative prediction of video,” IEEE Transactions on Image Processing, vol. 3, No. 5, pp. 684-687 (Sep. 1994).
Wu et al., “Quantizer Monotonicities and Globally Optimally Scalar Quantizer Design,” IEEE Transactions on Information Theory, vol. 39, No. 3, pp. 1049-1053 (May 1993).
Wu et al., “SMART: An Efficient, Scalable and Robust Streaming Video System,” EURASIP on Applied Signal Processing, vol. 2, 39 pp. (Feb. 2004).
Yang et al., “Rate Control for Videophone Using Local Perceptual Cues,” IEEE Transactions on Circuits and Systems for Video Tech., vol. 15, No. 4, pp. 496-507 (Apr. 2005).
Zwicker et al., Das Ohr als Nachrichtenempfanger, Title Page, Table of Contents, “I: Schallschwingungen,” Index, Hirzel-Verlag, Stuttgart, pp. iii, ix-xi, 1-26 and 231-232 (1967).
Zwicker, Psychoakustik, Title Page, Table of Contents, “Teil I: Einfuhrung,” Index, Springer-Verlag, Berlin Heidelberg, New York, pp. ii, ix-xi, 1-30 and 157-162 (1982).
Hsu et al., “Rate Control for Robust Video Transmission over Burst-Error Wireless Channels,” IEEE Journal on Selected Areas of Communication, vol. 17, No. 5, pp. 756-773 (May 1999).
Chang et al., “BubbleUp: Low Latency Fast-Scan for Media Servers,” Fifth ACM International Conference on Multimedia 1997, Nov. 1997, 12 pages.
Microsoft TechNet, “Streaming Media Services Role,” Jan. 2008, 3 pages.
Zheng et al., “Multimedia Over High Speed Networks: Reducing Network Requirements with Fast Buffer Fillup,” IEEE GLOBECOM-98, Nov. 1998, 6 pages.
Related Publications (1)
Number Date Country
20090297123 A1 Dec 2009 US
Provisional Applications (2)
Number Date Country
61057755 May 2008 US
61057759 May 2008 US