Signalling buffer characteristics for splicing operations of video streams

Information

  • Patent Grant
  • 8949883
  • Patent Number
    8,949,883
  • Date Filed
    Wednesday, May 12, 2010
    14 years ago
  • Date Issued
    Tuesday, February 3, 2015
    9 years ago
Abstract
In one method embodiments, providing a transport stream to a client device, the transport stream comprising a head stream and a tail stream, the head stream and the tail stream each comprising a compressed video sequence; providing information in a transport stream packet associated with the head stream, the information configured to cause the client device to selectively control an output of at least one of a plurality of pictures of the head stream yet to be output from a decoded picture buffer (DPB) at an out-point from the head stream to the trail stream.
Description
TECHNICAL FIELD

This disclosure relates in general to television systems, and more particularly, to video processing in television systems.


DESCRIPTION OF THE RELATED ART

Broadcast and on-demand delivery of digital audiovisual content has become increasingly popular in cable and satellite television networks (generally, subscriber television networks). Various specifications and standards have been developed for communication of audiovisual content, including the MPEG-2 video coding standard and AVC video coding standard. One feature pertaining to the provision of programming in subscriber television systems requires the ability to concatenate video segments or video sequences, for example, as when inserting television commercials or advertisements. For instance, for local advertisements to be provided in national content, such as ABC news, etc., such programming may be received at a headend (e.g., via a satellite feed), with locations in the programming allocated for insertion at the headend (e.g., headend encoder) of local advertisements.





BRIEF DESCRIPTION OF THE DRAWINGS

The systems and methods described herein can be better understood with reference to the following drawings. The components in the drawings are not necessarily drawn to scale, emphasis instead being placed upon clearly illustrating the principles of the present disclosure. In the drawings, like reference numerals designate corresponding parts throughout the several views.



FIG. 1 is a block diagram that illustrates an example environment for implementing assistive information systems.



FIG. 2 is a block diagram of an example embodiment of a digital home communications terminal (DHCT).



FIGS. 3A-3B are block diagrams that illustrates an example embodiment of splicing mechanisms pertaining to yet to be output picture (YTBOP) intervals.



FIG. 4 is a flow diagram that illustrates an example headend side method for providing splice-out point properties.



FIG. 5 is a flow diagram that illustrates an example splicer method for receiving and processing splice-out point properties.





DESCRIPTION OF EXAMPLE EMBODIMENTS

Overview


In one method embodiments, providing a transport stream to a splicing device, the transport stream comprising a head stream concatenated to a tail stream, the head stream and the tail stream each comprising a compressed video sequence from a separate video source; providing in an adaptation field of a transport stream packet corresponding to the head stream an out-point that corresponds to a provided splice point, the splice point provided based on presentation time stamp (PTS) value, the out-point signaled by a descriptor in a program map table (PMT), the transport packet further comprising assistive information comprising one or more compressed picture buffer properties and one or more decoded picture buffer properties that are used in the concatenation of the head stream and the tail stream.


Example Embodiments


Certain assistive information (AI) system and method embodiments are disclosed that incorporate logic to provide, receive, and/or process information (e.g., messaging) in a video stream that signals to a digital home communications terminal (DHCT) a manner of managing, processing, and/or outputting buffered pictures. In one embodiment, a splice point (cut) in the video stream that corresponds to a provided splice point, announced as a presentation time stamp (PTS), is provided in an adaptation field of a transport packet. The provision of a splice point using the PTS is via SCTE-35 cue messaging, which is the current mechanism employed in MPEG-2 video. However, with AVC/H.264, finding the exact point in the video stream (e.g., in decode or transmission order) that corresponds to such a cue that signals the splice point in the video stream with a presentation time stamp (PTS) value is difficult. In one embodiment, the AI system signals the corresponding splice point (cut) in decode order so that it may be explicitly corresponded with existing mechanisms in use today for programs that have the video encoded according to MPEG-2 video. In addition, a program map table (PMT) is used to announce that the cut exists and that it is being provided in the transport packet. The corresponding cut is provided immediately prior to the cut point in decode order.


In some embodiments of the AI system, assistive information comprising properties of a decoded picture buffer (DPB) and/or a compressed picture buffer (CPB) is provided. For instance, with regard to CPB properties, since the CPB is much larger that MPEG-2 video's bit buffer, the large headroom results in error effects that accrue until carried ailments surface. Such error effects may result from buffer underrun/overruns over multiple splice operations that may provide a compounded effect. One mechanism to address such errors is to provide, at the out-point (splice-out point), assistive information corresponding to one or more CPB properties, such as the time of buffering (DTS-STC), the buffer level, the AVC level (e.g., L3.0, L4.0, L4.2), and upper and lower bounds for the intended levels of the CPB.


In some embodiments, the in-point (splice-in point) also needs consideration. For instance, and as explained further below in association with FIGS. 3A-3B, the time or interval corresponding to the yet to be output pictures (YTBOPs) in the head stream at the out-point should be honored. For instance, when the issuance of a no_output of_prior_pics_flag forces the decoder to disregard the output of DPB pictures (e.g., because of non-contiguous output times), the output of blank pictures may be required to maintain consistent CPB levels. With gaps in output time (e.g., non-contiguous PTS) of pictures in the DPB yet to be output at the splice point, a compliant AVC decoder is challenged—the no_output_of_prior_pics_flag is set equal to one (1) to prevent the output of those YTBOP pictures in the DPB. If the output of these decoded pictures is skipped (e.g., not displayed), a splicing device needs to improvise to for a number of output intervals equal to the number of DPB pictures that are not output (e.g., per a YTBOP flag) while accumulating pictures into the CPB to raise buffer levels (e.g., to avoid buffer underflow). With multiple splice operations, as noted above, the skipping of decoded pictures raises the risk of buffer underflow. If the latest PTS among the pictures yet to be output in the DPB at the splice point is signaled (e.g., last_PTS_flag), then a splicing device, without having to decode and determine based on the decoding operation, knows to provide that many pictures (delay their output) to compensate for the non-output, decoded pictures. While filling the CPB, a receiver either has to blank out pictures (e.g., black pictures) or continuously repeat the last output picture prior to the splice point. One mechanism to achieve this function is by the splicing device signaling the last output picture to be repeated. Further, byte stuffing in blank pictures may raise the CPB buffer level. Accordingly, the assistive information pertaining to the DPB properties includes one or more of configuring of the YTBOP of the head stream (at the out-point) with a maximum of sixteen 16 (e.g., four (4) bits), and a YTBOP_flag that provides all YTBOP pictures in the DPB have successive picture-output times and the first output time of the YTBOP pictures is the first frame interval after the out-point.


In some embodiments, the assistive information is not provided if it is not desired to output pictures from the DPB that would otherwise be discarded. Assistive information that specifies the output behavior of each non-previously output DPB picture allows for outputting a picture, not outputting, or outputting the picture for a number consecutive times prior to outputting the subsequent picture, as is explained further below.


In one embodiment, the assistive information is provided by a splicing device to a DHCT to convey information that alleviates the non-seamless transition incurred by repeating, over multiple frame times, the last output picture from a head stream at a splice operation. As a picture from the head stream is output from the DPB during a transition period from the head stream to a tail stream, control information specifies the outputting of each YTBOP from the DPB of the head stream.


Outputting may be consistent with a pic_struct, but for interlaced sources, a splicing device should provide information to prohibit the manifestation of motion jitter. Hence, for interlaced sources, the last output field of an interlaced frame is output, as both the top and bottom fields, to satisfy the repetition amount specified by command in the message.


The below description is provided in the context of a subscriber television system (STS) using a splicing device (also referred to herein as a splicer) and a DHCT that sends and receives, respectively, the messaging, with the understanding that other devices are contemplated to be within the scope of the disclosure. Additionally, the terms “frames” and “pictures” are used interchangeably herein unless specifically distinguished for purposes of explanation. Further, the discussion below is applicable to AVC access units in place of pictures. The description below also contemplates knowledge, by those having ordinary skill in the art, of MPEG-2 and AVC video coding and associated transport mechanisms, the known references or publications of which are as follows: a description of the MPEG-2 Video Coding standard can be found in the following publication: (1) ISO/IEC 13818-2, (2000), “Information Technology—Generic coding of moving pictures and associated audio—Video;” a description of the AVC video coding standard can be found in the following publication: (2) ITU-T Rec. H.264 (2005), “Advanced video coding for generic audiovisual services;” a description of MPEG-2 Systems for transporting AVC video streams in MPEG-2 Transport packets can be found in the following publications: (3) ISO/IEC 13818-1, (2000), “Information Technology—Generic coding of moving pictures and associated audio—Part 1: Systems,” and (4) ITU-T Rec. H.222.0|ISO/IEC 13818-1:2000/AMD.3, (2004), “Transport of AVC video data over ITU-T Rec. H222.0|ISO/IEC 13818-1 streams.”



FIG. 1 is a high-level block diagram depicting an example environment in which one or more embodiments of assistive information (AI) systems are implemented. In particular, FIG. 1 is a block diagram that depicts an example subscriber television system (STS) 100. In this example, the STS 100 includes a headend 110 and one or more digital home communications terminals (DHCTs) 200. The DHCTs 200 and the headend 110 are coupled via a network 130. The headend 110 and the DHCTs 200 cooperate to provide a user with television services, including, for example, broadcast television programming, interactive program guide (IPG) services, video-on-demand (VOD), and pay-per-view, as well as other digital services such as music, Internet access, commerce (e.g., home-shopping), voice-over-IP (VoIP), and/or other telephone or data services.


The STS 100 may comprise an IPTV network, a cable television network, a satellite television network, or a combination of two or more of these networks or other networks. Further, network PVR and switched digital video are also considered within the scope of the disclosure. Although described in the context of video processing, it should be understood that certain embodiments of the AI systems described herein also include functionality for the processing of other media content such as compressed audio streams.


The headend 110 may include one or more server devices (not shown) for providing video, audio, and other types of media or data to client devices such as, for example, the DHCT 200. The headend 110 may receive content from sources external to the headend 110 or STS 100 via a wired and/or wireless connection (e.g., satellite or terrestrial network), such as from content providers, and in some embodiments, may receive package-selected national or regional content with local programming (e.g., including local advertising) for delivery to subscribers. The headend 110 also receives splice triggers indicative of suitable splice points in the network feed. The headend 110 also includes one or more encoders (encoding devices or compression engines) 111 (one shown) and one or more video processing devices embodied as one or more splicers 112 (one shown) coupled to the encoder 111. In some embodiments, the encoder 111 and splicer 112 may be co-located in the same device and/or in the same locale (e.g., both in the headend 110 or elsewhere), while in some embodiments, the encoder 111 and splicer 112 may be distributed among different locations within the STS 100. For instance, though shown residing at the headend 110, the encoder 111 and/or splicer 112 may reside in some embodiments at other locations such as a hub or node. The encoder 111 and splicer 112 are coupled with suitable signalling or provisioned to respond to signalling for portions of a video service where commercials are to be inserted. For instance, the encoder 111 may receive splice triggers and provide messaging that announces to the splicer 112 suitable splice points corresponding to the splice triggers.


The AI systems and methods disclosed herein are applicable to any video compression method performed according to a video compression specification allowing for at least one type of compressed picture that can depend on the corresponding decompressed version of each of more than one reference picture for its decompression and reconstruction. For example, the encoder 111 may compress an inputted video signal (e.g., provided by a service provider in one of any of several forms, image capture device, a headend server, etc.) according to the specification of the AVC standard and produce an AVC stream containing different types of compressed pictures with a common picture format, some that may have a first compressed portion that depends on a first reference picture for their decompression and reconstruction, and a second compressed portion of the same picture that depends on a second and different reference picture. Since the compressed video (and audio) streams are produced in accordance with the syntax and semantics of a designated video (and audio) coding method, for example AVC, the compressed video (and audio) streams can be interpreted by an AVC-compliant decoder for decompression and reconstruction at the time of reception, at a future time, or both.


In one embodiment, each AVC stream is packetized into transport packets according to the syntax and semantics of transport specification, such as, for example, MPEG-2 transport defined in MPEG-2 systems. Each transport packet contains a header with a unique packet identification code, or PID, associated with the respective AVC stream. In one implementation, the encoded audio-video (A/V) content for a single program may be the only program carried in a transport stream (e.g., one or more packetized elementary stream (PES) packet streams sharing a common time base for the same video service), and in other implementations, the encoded A/V content for multiple programs may be carried as multiplexed programs in an MPEG-2 transport stream, each program associated with its own respective time base.


The header of a transport stream may include a sync byte that sets the start of a transport stream packet and allows transmission synchronization. The header of the transport stream may further include a payload unit start indicator that, when set to a certain value in the packets carrying the video stream, indicates that the transport packet's payload begins with a first byte of a packetized elementary stream (PES). Video streams carried in a PES may be constrained to carrying one compressed picture per PES packet, and to a requirement that a PES packet must always commence as the first byte of a transport streams' packet payload. Thus, the payload unit start indicator provisions the identification of the start of each successive picture of the video stream carried in the transport stream. Note that the transport packets carrying the video stream are identified by the parsing capabilities of DHCT 200 or other network devices from program associated information or program specific information (PSI). For instance, in MPEG-2 Transport, program map tables identify the packet identifier (PID) of the video stream in the program map table (PMT), which in turn is identified via the program association table (PAT).


In IPTV implementations, the program or transport stream may be further encapsulated in Internet protocol (IP) packets, and delivered via multicast (e.g., according to protocols based on Internet Group Management Protocol (IGMP), among other protocols), or in other cases such as video-on-demand (VOD), via unicast (e.g., Real-time Streaming Protocol or RTSP, among other protocols). For instance, multicast may be used to provide multiple user programs destined for many different subscribers. Communication of IP packets between the headend 110 and the DHCTs 200 may be implemented according to one or more of a plurality of different protocols or communication mechanisms, such as User Datagram Protocol (UDP)/IP, Transmission Control Protocol (TCP)/IP, transport packets encapsulated directly within UDP or Real-time Transport Protocol (RTP) packets, among others.


The encoder 111 provides a compressed video stream (e.g., in a transport stream) to the splicer 112 while both receive signals or cues that pertain to splicing or digital program insertion at the transport level. In some embodiments, the splicer 112 and/or DHCT 200 may receive information at other levels (e.g., non-transport levels, such as video coding levels), in lieu of or in addition to the transport stream information. In some embodiments, the encoder 111 does not receive these signals or cues.


In one embodiment of an AI system, the encoder 111 provides the assistive information corresponding to a splice point. As explained previously, the presence in a transport packet of the splice point that corresponds to the splice point corresponding to a PTS (e.g., as communicated via SCTE-35 messaging) may be announced to the splicer 112 via an SCTE adaptation field data descriptor in an elementary stream (ES) loop (e.g., ES_info_loop) of a program specific information table, such as a program map table (PMT). In one embodiment, the splice point is signaled immediately prior to the out-point in decode order, or in some embodiments, N pictures ahead.


The transport packet announced in advance via the SCTE adaptation field data descriptor in the ES_info_loop carries the assistive information in the adaptation field, such as in the private data bytes of the adaptation field. The assistive information may be provided, in embodiment, by a construct such as:


[TAG] [LENGTH] [DATA]


In one embodiment, a specific TAG value is assigned to this particular type of assistive information, and the data carries the assistive information described herein (e.g., DPB properties, the manner of output of YTBOP residing in the same, and/or compressed picture buffer (CPB) properties, such as DTS-STC, buffer level (e.g., top and/or bottom bounds), AVC level (e.g., L3.0, L4.0, L4.2, using, for instance, two bits), among other properties). The provision of the announcement and assistive information in the transport layer avoids the need to parse all the encapsulating layers to find information in the video stream.


In some embodiments, the assistive information and the announcement (e.g., announcing the splice point or packet just prior to the splice point corresponding to where the assistive information is to become effective) are combined in a single packet, and in some embodiments, the announcement and/or the assistive information is not provided (e.g., is optionally provided or functionality conforming to the information is implied).


The splicer 112 splices one or more video streams (e.g., tail streams, such as provided by a video source separate from the video source that provides the first video stream) into designated portions of the video stream (e.g., head stream) provided by the encoder 111 according to one or more suitable splice points, and/or in some embodiments, replaces one or more of the video sequences provided by the encoder 111 with other video sequences. Further, the splicer 112 may pass the assistive information provided by the encoder 111, with or without modification, to the DHCT 200, or the encoder 111 may provide the information directly (bypassing the splicer 112) to the DHCT 200.


Having described features of certain embodiments of the headend 110, attention is directed to the other portions of the STS 100 shown in FIG. 1. The network 130 may comprise a single network, or a combination of networks (e.g., local and/or wide area networks). Further, the communications medium of the network 130 may comprise a wired connection or wireless connection (e.g., satellite, terrestrial, wireless LAN, etc.), or a combination of both. In the case of wired implementations, the network 130 may comprise a hybrid-fiber coaxial (HFC) medium, coaxial, optical, twisted pair, etc. Other networks are contemplated to be within the scope of the disclosure, including networks that use packets incorporated with and/or are compliant to MPEG-2 transport or other transport layers or protocols.


The DHCT 200 is typically situated at a user's residence or place of business and may be a stand-alone unit or integrated into another device such as, for example, the display device 140, a personal computer, personal digital assistant (PDA), mobile phone, among other devices. In other words, the DHCT 200 (also referred to herein as a digital receiver or processing device or client device) may comprise one of many devices or a combination of devices, such as a set-top box, television with communication capabilities, cellular phone, personal digital assistant (PDA), or other computer or computer-based device or system, such as a laptop, personal computer, DVD/CD recorder, among others. As set forth above, the DHCT 200 may be coupled to the display device 140 (e.g., computer monitor, television set, etc.), or in some embodiments, may comprise an integrated display (with or without an integrated audio component).


The DHCT 200 receives signals (video, audio and/or other data) including, for example, digital video signals in a compressed representation of a digitized video signal such as, for example, AVC streams modulated on a carrier signal, and/or analog information modulated on a carrier signal, among others, from the headend 110 through the network 130, and provides reverse information to the headend 110 through the network 130. As explained further below, the DHCT 200 comprises, among other components, a video decoder and a decoded picture buffer (DPB).


The television services are presented via respective display devices 140, each which typically comprises a television set that, according to its type, is driven with an interlaced scan video signal or a progressive scan video signal. However, the display devices 140 may also be any other device capable of displaying video images including, for example, a computer monitor, a mobile phone, game device, etc. In one implementation, the display device 140 is configured with an audio component (e.g., speakers), whereas in some implementations, audio functionality may be provided by a device that is separate yet communicatively coupled to the display device 140 and/or DHCT 200. Although shown communicating with a display device 140, the DHCT 200 may communicate with other devices that receive, store, and/or process video streams from the DHCT 200, or that provide or transmit video streams or uncompressed video signals to the DHCT 200.


The STS 100 comprises additional components and/or facilities not shown, as should be understood by one having ordinary skill in the art. For instance, the STS 100 may comprise one or more additional servers (Internet Service Provider (ISP) facility servers, private servers, on-demand servers, channel change servers, multi-media messaging servers, program guide servers), modulators (e.g., QAM, QPSK, etc.), routers, bridges, gateways, multiplexers, transmitters, and/or switches (e.g., at the network edge, among other locations) that process and deliver and/or forward (e.g., route) various digital services to subscribers.


In one embodiment, the AI system comprises the headend 110 and one or more of the DHCTs 200. In some embodiments, the AI system comprises portions of each of these components, or in some embodiments, one of these components or a subset thereof. In some embodiments, one or more additional components described above yet not shown in FIG. 1 may be incorporated in an AI system, as should be understood by one having ordinary skill in the art in the context of the present disclosure.



FIG. 2 is an example embodiment of select components of a DHCT 200. It should be understood by one having ordinary skill in the art that the DHCT 200 shown in FIG. 2 is merely illustrative, and should not be construed as implying any limitations upon the scope of the disclosure. In one embodiment, an AI system may comprise all components shown in, or described in association with, the DHCT 200 of FIG. 2. In some embodiments, an AI system may comprise fewer components, such as those limited to facilitating and implementing decoding functionality. In some embodiments, functionality of the AI system may be distributed among the DHCT 200 and one or more additional devices as mentioned above.


The DHCT 200 includes a communication interface 202 (e.g., depending on the implementation, suitable for coupling to the Internet, a coaxial cable network, an HFC network, satellite network, terrestrial network, cellular network, etc.) coupled in one embodiment to a tuner system 204. The tuner system 204 includes one or more tuners for receiving downloaded (or transmitted) media content. The tuner system 204 can select from among a plurality of transmission signals provided by the STS 100 (FIG. 1). The tuner system 204 enables the DHCT 200 to tune to downstream media and data transmissions, thereby allowing a user to receive digital media content via the STS 100. In one embodiment, analog TV signals can be received via the tuner system 204. The tuner system 204 includes, in one implementation, an out-of-band tuner for bi-directional data communication and one or more tuners (in-band) for receiving television signals. In some embodiments (e.g., an IPTV-configured DHCT), the tuner system 204 may be omitted.


The tuner system 204 is coupled to a signal processing system 206 that in one embodiment comprises a transport demultiplexing/parsing system 208 (demux/pars, or hereinafter, demux) and a demodulating system 210 for processing broadcast and/or on-demand media content and/or data. One or more of the components of the signal processing system 206 may be implemented with software, a combination of software and hardware, or in hardware. The demodulating system 210 comprises functionality for demodulating analog or digital transmission signals.


The components of the signal processing system 206 are generally capable of QAM demodulation (though in some embodiments, other modulation formats may be processed such as QPSK, etc.), forward error correction, demultiplexing of MPEG-2 transport streams, and parsing of packets and streams. The signal processing system 206 has capabilities, such as filters, to detect bit patterns corresponding to fields in the transport packet's header information, adaptation field, and/or payload. Stream parsing may include parsing of packetized elementary streams or elementary streams. Packet parsing may include parsing and processing of data fields, such as the data fields in the adaptation fields in the transport packets that deliver assistive information, among other information.


In one embodiment, the parsing is performed by the signal processing system 206 (e.g., demux 208) extracting the assistive information and one or more processors 212 (one shown) processing and interpreting the assistive information. In some embodiments, the processor 212 performs the parsing, processing, and interpretation. The signal processing system 206 further communicates with the processor 212 via interrupt and messaging capabilities of the DHCT 200.


Concurrently, the signal processing system 206 precludes further processing of packets in the multiplexed transport stream that are irrelevant or not desired, such as packets of data corresponding to other video streams. As indicated above, parsing capabilities of the signal processing system 206 allow for the ingesting by the DHCT 200 of program associated information carried in the transport packets. The demux 208 is configured to identify and extract information in the transport stream to facilitate the identification, extraction, and processing of the compressed pictures. Such information includes Program Specific Information (PSI) (e.g., Program Map Table (PMT), Program Association Table (PAT), etc.) and parameters or syntactic elements (e.g., Program Clock Reference (PCR), time stamp information, payload unit start indicator, etc.) of the transport stream (including packetized elementary stream (PES) packet information). For instance, in some embodiments, a flag, field, or other indicator may be provided in the transport stream (e.g., adaptation field of one or more transport packets) that indicates to the decoding logic (or other components of the DHCT 200) that the video stream includes certain information to assist in decoding of concatenated streams.


In general, information extracted by the demux 208 may include information that assists PVR logic embodied in one embodiment as PVR application 214, as explained further below. Note that in some embodiments, the PVR application 214 may opt to disregard or modify the received information. In some embodiments, portions of the information may not be transmitted for defined periods of time of a program, or for portions of a video stream, such as portions corresponding to a commercial.


In an alternate embodiment, assistive information is extracted from the video stream and processed by decompression engine 218. In yet another embodiment, assistive information is extracted from the video stream and processed by processor 212. And in yet another embodiment, assistive information is extracted from the video stream by decompression engine 218 and interpreted by processor 212.


In one embodiment, the demux 208 is configured with programmable hardware (e.g., PES packet filters). In some embodiments, the signal processing system 206 or one or more components thereof is configured in software, hardware, or a combination of hardware and software.


The signal processing system 206 is coupled to one or more busses (a single bus 216 is shown) and to decoding logic configured in one embodiment as a decompression engine 218 (or media engine). In some embodiments, reference to decoding logic may include one or more additional components, such as memory, processor 212, etc. The decompression engine 218 comprises a video decompression engine 220 (or video decoder or video decompression logic) and audio decompression engine 222 (or audio decoder or audio decompression logic). The decompression engine 218 is further coupled to decompression engine memory 224 (or media memory or memory), the latter which, in one embodiment, comprises one or more respective buffers for temporarily storing compressed (compressed picture buffer or bit buffer, not shown) and/or reconstructed pictures (decoded picture buffer or DPB). In some embodiments, one or more of the buffers of the decompression engine memory 224 may reside in whole or in part in other or additional memory (e.g., memory 226) or components.


The DHCT 200 further comprises additional components coupled to the bus 216. For instance, the DHCT 200 further comprises a receiver 228 (e.g., infrared (IR), radio frequency (RF), etc.) configured to receive user input (e.g., via direct-physical or wireless connection via a keyboard, remote control, voice activation, etc.) to convey a user's request or command (e.g., for program selection, stream manipulation such as fast forward, rewind, pause, channel change, etc.), the processor 212 (indicated above) for controlling operations of the DHCT 200, and a clock circuit 230 comprising phase and/or frequency locked-loop circuitry to lock into a system time clock (STC) from a program clock reference, or PCR, received in the video stream to facilitate decoding and output operations.


For instance, time stamp information (e.g., presentation time stamp/decode time stamp, or PTS/DTS) in the received video stream is compared to the reconstructed system time clock (STC) (generated by the clock circuit 230) to enable a determination of when the buffered compressed pictures are provided to the video decompression engine 220 for decoding (DTS) and when the buffered, decoded pictures are output by the video decompression engine 220 according to their PTS via the output system 254. The output system 254 hence may comprise graphics and display pipelines and output logic including HDMI, DENC, or other known systems. In some embodiments, the clock circuit 230 may comprise plural (e.g., independent or dependent) circuits for respective video and audio decoding operations and output processing operations. Although described in the context of hardware circuitry, some embodiments of the clock circuit 230 may be configured as software (e.g., virtual clocks) or a combination of hardware and software.


The DHCT 200 further comprises memory 226, which comprises volatile and/or non-volatile memory, and is configured to store executable instructions or code associated with an operating system (O/S) 232, one or more other applications 234 (e.g., the PVR application 214, interactive programming guide (IPG), video-on-demand (VOD), WatchTV (associated with broadcast network TV), among other applications not shown such as pay-per-view, music, etc.), and driver software 236.


The DHCT 200 further comprises one or more storage devices (one shown, storage device 238). The storage device 238 may be located internal to the DHCT 200 and coupled to the bus 216 through a communication interface 250. The communication interface 250 may include an integrated drive electronics (IDE), small computer system interface (SCSI), IEEE-1394 or universal serial bus (USB), among others. In one embodiment, the storage device 238 comprises associated control logic, such as a controller 240, that in coordination with one or more associated drivers 236 effects the temporary storage of buffered media content and/or more permanent storage of recorded media content. Herein, references to write and/or read operations to the storage device 238 is understood to refer to write and/or read operations to/from one or more storage mediums of the storage device 238.


The device driver 236 is generally a software module interfaced with and/or residing in the operating system 232. The device driver 236, under management of the operating system 232, communicates with the storage device controller 240 to provide the operating instructions for the storage device 238. As conventional device drivers and device controllers are well known to those of ordinary skill in the art, further discussion of the detailed working of each will not be described further here. The storage device 238 may further comprise one or more storage mediums 242 such as hard disk, optical disk, or other types of mediums, and an index table 244, among other components (e.g., FAT, program information, etc.) as should be understood by one having ordinary skill in the art. In some embodiments, the storage device 238 may be configured as non-volatile memory or other permanent memory.


In one implementation, video streams are received in the DHCT 200 via communications interface 202 and stored in a temporary memory cache (not shown). The temporary memory cache may be a designated section of memory 226 or an independent memory attached directly, or as part of a component in the DHCT 200. The temporary cache is implemented and managed to enable media content transfers to the storage device 238 (e.g., the processor 212 causes the transport stream in memory 226 to be transferred to a storage device 238). In some implementations, the fast access time and high data transfer rate characteristics of the storage device 238 enable media content to be read from the temporary cache and written to the storage device 238 in a sufficiently fast manner. Multiple simultaneous data transfer operations may be implemented so that while data is being transferred from the temporary cache to the storage device 238, additional data may be received and stored in the temporary cache.


Alternatively or additionally, the storage device 238 may be externally connected to the DHCT 200 via a communication port, such as communication port 252. The communication port 252 may be configured according to IEEE-1394, USB, SCSI, or IDE, among others. The communications port 252 (or ports) may be configured for other purposes, such as for receiving information from and/or transmitting information to devices other than an externally-coupled storage device.


One having ordinary skill in the art should understand that the DHCT 200 may include other components not shown, including compression engine, decryptors, samplers, digitizers (e.g., analog-to-digital converters), multiplexers, conditional access processor and/or application software, Internet browser, among others. In some embodiments, functionality for one or more of the components illustrated in, or described in association with, FIG. 2 may be combined with another component into a single integrated component or device or distributed among several components or devices.


The AI system may comprise the entirety of the DHCT 200 in one embodiment, the headend 110 in some embodiments, or a combination of both components in certain embodiments. In some embodiments, the AI system may comprise or one or more components or sub-components thereof, or additional components not shown. The AI system (including in some embodiments the splicer 112 (or portions thereof), the encoder 111 (or portions thereof), and/or the DHCT 200 (or portions thereof)), may be implemented in hardware, software, firmware, or a combination thereof. To the extent certain embodiments of the AI system or a portion thereof are implemented in software or firmware, executable instructions for performing one or more tasks of the AI system are stored in memory or any other suitable computer readable medium and executed by a suitable instruction execution system. In the context of this document, a computer readable medium is an electronic, magnetic, optical, or other physical device or means that can contain or store a computer program for use by or in connection with a computer related system or method.


To the extent certain embodiments of the AI system or portions thereof are implemented in hardware, the AI system may be implemented with any or a combination of the following technologies, which are all well known in the art: a discrete logic circuit(s) having logic gates for implementing logic functions upon data signals, an application specific integrated circuit (ASIC) having appropriate combinational logic gates, programmable hardware such as a programmable gate array(s) (PGA), a field programmable gate array (FPGA), etc.


Having described an example environment and corresponding components of certain embodiments of AI systems, attention is directed to FIGS. 3A and 3B, which respectively provides an illustration of the provision (and absence thereof) of assistive information pertaining to DPB properties. FIG. 3A shows a network feed 302 in decode order and in output order 304. The network feed 302 comprises three consecutive, equal-length segments 306, 308, and 310, and the output order version similarly comprises three consecutive, equal length segments 312, 314, and 316. The decode order stream 304 further illustrates network out-point (splice-out point) 305 and network in-point (splice-in point) 307 corresponding to the spliced-in second or tail stream 314. In other words, for the output order version 304, segments 312 and 316 each comprise a portion of a head stream, and segment 314 comprises a tail stream spliced into the head stream between segments 312 and 316. Based on assistive information conveyed in the associated transport stream (e.g., as described above), the YTBOP of the DPB associated with the head stream is incorporated into each splice point 305 and 307 to provide a graceful transition between concatenations. In other words, each splice point 305 and 307 corresponds respectively to YTBOP 318 and 320 of a DPB. The spliced in-point 307 requires the following buffering: (PTSin-1−DTSin-1)=YTBOP+1, where YTBOP is the number of yet to be output pictures in the head stream 312 at the splice-out point, PTSin-1 is the first output picture in the tail stream 314, and DTSin-1 is the first DTS in the tail stream 314. For purposes of illustration, each YTBOP comprises six pictures representing 25% of the frame rate (e.g., for each splice point, representing approximately 0.25 seconds).



FIG. 3B similarly comprises an example where the YTBOP interval described above is not honored, and in particular, illustrating the need for the in-point to abide by (PTSin-1−DTSin-1)=YTBOP+1. In particular, a decode order stream 322 and output order version 324 each comprise plural consecutive segments (326, 328, 330 for the decode order 322 and 332, 336, and 338 for the output order 324). As shown, without the YTBOP interval at the splice-out point 309, the tail stream 336 is spliced in, using the example parameters above, 0.25 seconds too early. Such a result may occur due to a no_output_of_prior_pics_flag equal to one (1). As expressed above, with gaps in output time (e.g., non-contiguous PTS) of pictures in the DPB yet to be output at the splice point, a compliant AVC decoder is challenged—the no_output_of_prior_pics_flag is set equal to one (1) to prevent the output of those YTBOP pictures in the DPB. If the output of these decoded pictures is skipped (e.g., not displayed), a splicing device needs to improvise to for a number of output intervals equal to the number of DPB pictures that are not output (e.g., per a YTBOP flag) while accumulating pictures into the CPB to raise buffer levels (e.g., to avoid buffer underflow). With multiple splice operations, as noted above, the skipping of decoded pictures raises the risk of buffer underflow. If the latest PTS among the pictures yet to be output in the DPB at the splice point is signaled (e.g., last_PTS_flag), then a splicing device, without having to decode and determine based on the decoding operation, knows to provide that many pictures (delay their output) to compensate for the non-output, decoded pictures. While filling the CPB, a receiver either has to blank out pictures (e.g., black pictures, such as the 0.50 second interval shown in FIG. 3B) or continuously repeat the last output picture prior to the splice point. One mechanism to achieve this function is by the splicing device signaling the last output picture to be repeated. Further, byte stuffing in blank pictures may raise the CPB buffer level. Accordingly, the assistive information pertaining to the DPB properties includes, in one embodiment, the configuring of the YTBOP of the head stream (at the out-point) with a maximum of sixteen 16 (e.g., four (4) bits), and a YTBOP_flag that provides all YTBOP pictures in the DPB have successive picture-output times and the first output time of the YTBOP pictures is the first frame interval after the out-point.


The YTBOP intervals at each splice point allow for an overlap transition period over YTBOP frame intervals, enabling a graceful output transition and/or better bit-rate management. In other words, the inclusion of the YTBOP intervals enables the splicer 112 to perform better stream conditioning, where pictures from the headstream are output from the DPB while pictures from the tail stream are being decoded and stored in the DPB, while avoiding error in CPB buffer management.


In some embodiments, as expressed above, optional assistive information may be provided to the DHCT 200 when there are YTBOPs in the DPB having discontinuous output times, for instance in non-seamless applications. For instance, one example embodiment of “yet to be output pictures” (YTBOP) message syntax is as follows:














pic_output_cue( payloadSize ) {
C
Descriptor







num_prior_pics_in_dpb
5
u(5)


for (j = 0; j < num_prior_pics_in_dpb; j++) {


 output_cue[ i ]
5
u(3)


 }









This example message assists the DHCT 200 in outputting prior pictures remaining in DPB from the head stream. The message helps a decoder in the DHCT 200 to maintain continuous picture output for streams having YTBOPs with discontinuous output times. The YTBOP message semantics are described below as follows:

  • num_prior_pics_in_dpb indicates the number of YTBOP remaining in the DPB at the splice out-point.
  • output_cue[i] indicates cues for the output of each respective YTBOP in the DPB, according to the Table below. The pictures are sorted by corresponding picture order counts from smallest value to highest value.













Value
Recommended output cue for picture







0
Picture may be discarded without output


1
Picture may be output according to picture's pic_struct*


2
Picture's output as indicated by pic_struct* may be



repeated once


3
Picture's output as indicated by pic_struct* may be



repeated twice


4
Picture's output as indicated by pic_struct* may be



repeated indefinitely until first picture is output from DPB after



the decoding of the IDR access unit


5 . . . 7
Reserved





*For interlaced video source, repetition means that the last output field of an interlaced frame is output as both the top and bottom fields to satisfy the number of repetitions specified by output cue.






In some embodiments, assistive information messaging is provided that assists decoding logic of the DHCT 200 in processing YTBOPs of the DPB where discontinuities or gaps arise from no_output of_prior_pics flags with a value of one (1) alone or in association with an IDR access unit. For instance, when a compliant (e.g., compliant to MPEG-2) DHCT receives a no_output of_prior_pics_flag=1, the compliant DHCT outputs a blank picture or frozen frame intervals. One alternative approach to handling such a stream parameter is to selectively control the output of each otherwise discarded DPB picture at the splice-out point. One example embodiment of assistive information configured as a picture output message syntax is as follows:














pic_output( payloadSize ) {
C
Descriptor







num_prior_pics_in_dpb
5
u(5)


for (j = 0; j < num_prior_pics_in_dpb; j++) {


 output_cue[ i ]
5
u(3)


 }









  • This example message applies to the control and management of YTBOPs from the DPB at splice out-points. The pictures output message semantics are described below as follows:

  • num_prior_pics_in_dpb indicates the number of YTBOPs in the DPB at a corresponding splice out-point. This may be accompanied by an IDR access unit and issuance of the no_output_of_prior_Pics_flag in AVC video with a value of 1.


    output_cue[i] indicates cues for the output of each prior picture in the DPB, according to the following Table. The pictures are sorted by corresponding picture order counts from smallest value to highest value. The decoder may make use of the output_cue for better visual experience.














Value
Recommended output cue for picture







0
Picture may be discarded without output


1
Picture may be output according to picture's pic_struct*


2
Picture's output as indicated by pic_struct* may be repeated once


3
Picture's output as indicated by pic_struct* may be repeated twice


4
Picture's output as indicated by pic_struct* may be repeated



indefinitely until first picture is output from DPB after the



decoding of the IDR access unit


5
Repeat picture output as indicated by pic_struct* until the output



time of the next picture in the DPB.


6
Output the last picture once again*


7
Reserved





*For interlaced video source, repetition means that the last output field of an interlaced frame is output as both the top and bottom fields to satisfy the number of repetitions specified by output cue.






Through the use of the assistive information provided via these or other suitable message syntaxes, pictures may be output from the DPB in a manner that reduces output discontinuities and gaps at non-seamless concatenations. For instance, rather than outputting a last picture of the DPB repeatedly at a concatenation when no_output of_prior_pics_flag is equal to one (1) (due to non-contiguous output times or gaps), the assistive information comprises a mechanism to issue a control command for each YTBOP in the DPB such that some pictures are repeated and/or some pictures are displayed only once.


It is noted that in some embodiments, the second field of an interlaced frame may be repeated just once. For instance, for a top-field-first frame, one display order is as follows: top-field (at top-field position), bottom-field (at bottom-field position), bottom-field (at top-field position). One benefit of such a scheme, among others, is that of assisting the display process of the DHCT 200 in case of a splice that leads to a field parity violation at the splice point. In other words, sometimes for a transition in field parity at a splice, there is a need for an odd number of fields (by repetition of the last field of an interlaced frame), and with the last field position on the lines of the opposite parity (e.g., the lines of an odd field displayed on the even lines).


In view of the above description, it should be appreciated that one AI method embodiment 400, implemented by the headend 110 and shown in FIG. 4, comprises providing a transport stream to a splicing device, the transport stream comprising a head stream concatenated to a tail stream, the head stream and the tail stream each comprising a compressed video sequence from a separate video source (402); providing in an adaptation field of a transport stream packet corresponding to the head stream an out-point that corresponds to a provided splice point, the splice point provided based on presentation time stamp (PTS) value, the out-point signaled by a descriptor in a program map table (PMT), the transport packet further comprising assistive information comprising one or more compressed picture buffer (CPB) properties and one or more decoded picture buffer (DPB) properties that are used in the concatenation of the head stream and the tail stream (404).


In view of the above description, it should be appreciated that another AI method embodiment 500, as shown in FIG. 5 and implemented by a splicer 112, comprises receiving a transport stream, the transport stream comprising a head stream concatenated to a tail stream, the head stream and the tail stream each comprising a compressed video sequence from a separate video source (502); and receiving in an adaptation field of a transport stream packet corresponding to the head stream an out-point that corresponds to a provided splice point, the splice point provided based on presentation time stamp (PTS) value, the out-point signaled by a descriptor in a program map table (PMT), the transport packet further comprising assistive information comprising one or more compressed picture buffer (CPB) properties and one or more decoded picture buffer (DPB) properties that are used in the concatenation of the head stream and the tail stream (504).


Note that the methods described in FIGS. 4-5 may also be implemented in other components or systems, in whole or in part, such as at a client device, hub, etc.


Any process descriptions or blocks in flow charts or flow diagrams should be understood as representing modules, segments, or portions of code which include one or more executable instructions for implementing specific logical functions or steps in the process, and alternate implementations are included within the scope of the present disclosure in which functions may be executed out of order from that shown or discussed, including substantially concurrently or in reverse order, depending on the functionality involved, as would be understood by those reasonably skilled in the art. In some embodiments, steps of a process identified in FIGS. 4-5 using separate boxes can be combined. Further, the various steps in the flow diagrams illustrated in conjunction with the present disclosure are not limited to the architectures described above in association with the description for the flow diagram (as implemented in or by a particular module or logic) nor are the steps limited to the example embodiments described in the specification and associated with the figures of the present disclosure. In some embodiments, one or more steps may be added to one or more of the methods described in FIGS. 4-5, either in the beginning, end, and/or as intervening steps, and that in some embodiments, fewer steps may be implemented.


It should be emphasized that the above-described embodiments of the disclosure are merely possible examples, among others, of the implementations, setting forth a clear understanding of the principles of the disclosure. Many variations and modifications may be made to the above-described embodiments without departing substantially from the principles set forth herein. All such modifications and variations are intended to be included herein within the scope of the disclosure. In addition, the scope of the disclosure includes embodying the functionality of the embodiments in logic embodied in hardware and/or software-configured mediums.

Claims
  • 1. A method, comprising: providing a transport stream to a splicing device, the transport stream comprising a head stream concatenated to a tail stream, the head stream and the tail stream each comprising a compressed video sequence from a separate video source; andproviding in an adaptation field of a transport stream packet corresponding to the head stream a splice out-point that corresponds to a splice point, the splice point provided based on presentation time stamp (PTS) value, the splice out-point signaled by a descriptor in a program map table (PMT), the transport packet further comprising assistive information comprising one or more compressed picture buffer (CPB) properties and one or more decoded picture buffer (DPB) properties that are used in the concatenation of the head stream and the tail stream, wherein the CPB properties comprises at least an Advanced Video Coding level, wherein the DPB properties comprise:a first flag corresponding to a last PTS value corresponding to a last picture in the DPB; anda second flag, the second flag signaling that all of the plurality of pictures yet to be output residing in the DPB have successive picture output times; andthe second flag further signals that a first output time of the yet to be output pictures is a first frame interval after the splice out-point.
  • 2. The method of claim 1, wherein the provided splice point is provided according to a message compliant with Society of Cable and Telecommunications Engineers Standard 35—Digital Program Insertion Cueing Message for Cable.
  • 3. The method of claim 1, wherein the transport packet is located immediately prior to the splice out-point connecting the head stream to the tail stream.
  • 4. The method of claim 1, wherein the descriptor comprises an elementary stream (ES) descriptor loop of the PMT.
  • 5. The method of claim 1, wherein the CPB properties further comprises a value corresponding to a decoded time stamp (DTS) value minus a system time clock (STC) value.
  • 6. The method of claim 1, wherein the CPB properties further comprises a value corresponding to a decoded time stamp (DTS) value minus a system time clock (STC) value and a buffer level.
  • 7. The method of claim 1, wherein the CPB properties further comprises a value corresponding to a decoded time stamp (DTS) value minus a system time clock (STC) value, a buffer level, and an intended CPB upper bound level and CPB lower bound level.
  • 8. The method of claim 1, further comprising honoring at the splicing device a yet to be output picture (YTBOP) interval at the splice out-point and a splice in-point, the splice in-point corresponding to the splice in point connecting the tail stream to the head stream.
  • 9. The method of claim 1, wherein responsive to a no_ouput_of_prior_pics_flag_value equal to one (1), outputting at the splicing device pictures equal to a value corresponding to a last_PTS flag provided in the assistive information while filling a CPB.
  • 10. The method of claim 9, wherein outputting the pictures comprises repeating a last picture output prior to the splice out-point.
  • 11. The method of claim 9, wherein outputting the pictures comprises repeating outputting blank pictures.
  • 12. The method of claim 11, wherein the splicing device is located in a subscriber television system.
  • 13. A splicing device, comprising: a processor configured to:receive a transport stream, the transport stream comprising a head stream concatenated to a tail stream, the head stream and the tail stream each comprising a compressed video sequence from a separate video source; andreceive in an adaptation field of a transport stream packet corresponding to the head stream a splice out-point that corresponds to a provided splice point, the splice point provided based on presentation time stamp (PTS) value, the splice out-point signaled by a descriptor in a program map table (PMT), the transport packet further comprising assistive information comprising one or more compressed picture buffer (CPB) properties and one or more decoded picture buffer (DPB) properties that are used in the concatenation of the head stream and the tail stream, wherein the CPB properties comprises at least an Advanced Video Coding level, wherein the DPB properties comprise:a first flag corresponding to a last PTS value corresponding to a last picture in the DPB; anda second flag, the second flag signaling that all of the plurality of pictures yet to be output residing in the DPB have successive picture output times; andthe second flag further signals that a first output time of the yet to be output pictures is a first frame interval after the splice out-point.
  • 14. The splicing device of claim 13, wherein the CPB properties further comprises one or more of a value corresponding to a decoded time stamp (DTS) value minus a system time clock (STC) value, a buffer level, and an intended CPB upper bound level and CPB lower bound level.
  • 15. The splicing device of claim 13, wherein the DPB properties comprises a first flag corresponding to a last PTS value corresponding to a last picture in the DPB and a second flag, the second flag signaling that all of the plurality of pictures yet to be output residing in the DPB have successive picture output times.
  • 16. A computing device, comprising: a processor configured to:provide a transport stream to a client device, the transport stream comprising a head stream and a tail stream, the head stream and the tail stream each comprising a compressed video sequence from a separate video source; andprovide information in a transport stream packet associated with the head stream, the information configured to cause the client device to selectively control an output of at least one of a plurality of pictures of the head stream yet to be output from a decoded picture buffer (DPB) at a splice out-point from the head stream to the trail stream, the splice out-point signaled by a descriptor in a program map table (PMT), wherein the CPB properties comprises at least an Advanced Video Coding level, wherein the DPB properties comprise:a first flag corresponding to a last PTS value corresponding to a last picture in the DPB; anda second flag, the second flag signaling that all of the plurality of pictures yet to be output residing in the DPB have successive picture output times; andthe second flag further signals that a first output time of the yet to be output pictures is a first frame interval after the splice out-point.
CROSS REFERENCE TO RELATED APPLICATION

The present application claims priority to and the benefit of provisional patent application having Ser. No. 61/177,336, filed on May 12, 2009, and incorporated herein by reference in its entirety.

US Referenced Citations (330)
Number Name Date Kind
4764805 Rabbani et al. Aug 1988 A
5440345 Shimoda Aug 1995 A
5606359 Youden Feb 1997 A
5734443 O'Grady Mar 1998 A
5734783 Shimoda Mar 1998 A
5828370 Moeller Oct 1998 A
5854873 Mori et al. Dec 1998 A
5917830 Chen et al. Jun 1999 A
5917988 Eto Jun 1999 A
5943447 Tkhor et al. Aug 1999 A
5949948 Krause et al. Sep 1999 A
5963260 Bakhmutsky Oct 1999 A
5970028 Shimabukuro Oct 1999 A
6144375 Jain et al. Nov 2000 A
6160889 Yagasaki Dec 2000 A
6188436 Williams et al. Feb 2001 B1
6201927 Commer Mar 2001 B1
6222979 Willis et al. Apr 2001 B1
6263022 Chen et al. Jul 2001 B1
6304714 Krause et al. Oct 2001 B1
6310915 Wells et al. Oct 2001 B1
6393057 Thoreau et al. May 2002 B1
6411725 Rhoads Jun 2002 B1
6421387 Rhee Jul 2002 B1
6453115 Boyle Sep 2002 B1
6512552 Subramanian Jan 2003 B1
6587506 Noridomi et al. Jul 2003 B1
6594798 Chou et al. Jul 2003 B1
6643327 Wang Nov 2003 B1
6658199 Hallberg Dec 2003 B1
6754373 de Cuetos et al. Jun 2004 B1
6785289 Ward et al. Aug 2004 B1
6806909 Radha et al. Oct 2004 B1
6906743 Maurer Jun 2005 B1
6907075 Felts et al. Jun 2005 B2
6909743 Ward et al. Jun 2005 B1
6912251 Ward et al. Jun 2005 B1
6980594 Wang et al. Dec 2005 B2
7027713 Hallberg Apr 2006 B1
7050603 Rhoads et al. May 2006 B2
7053874 Koyama May 2006 B2
7085322 Ngai et al. Aug 2006 B2
7085381 Kubota et al. Aug 2006 B2
7085424 Kajiki et al. Aug 2006 B2
7095783 Sotheran et al. Aug 2006 B1
7096481 Forecast et al. Aug 2006 B1
7113523 Kubota et al. Sep 2006 B1
7129962 Cote et al. Oct 2006 B1
7185018 Archbold Feb 2007 B2
7224730 Kim et al. May 2007 B2
7236520 Kim et al. Jun 2007 B2
7239801 Himeno et al. Jul 2007 B2
7243193 Walmsley Jul 2007 B2
7317839 Holcomb Jan 2008 B2
7376335 De Haan May 2008 B2
7397858 Garrido et al. Jul 2008 B2
7443889 Gonguet et al. Oct 2008 B2
7467297 Ji et al. Dec 2008 B2
7480335 Payson Jan 2009 B2
7577198 Holcomb Aug 2009 B2
7584495 Hannuksela et al. Sep 2009 B2
7586924 Wiegand Sep 2009 B2
7590180 Kang Sep 2009 B2
7599435 Marpe et al. Oct 2009 B2
7599438 Holcomb Oct 2009 B2
7606308 Holcomb Oct 2009 B2
7616692 Holcomb Nov 2009 B2
7620106 Holcomb Nov 2009 B2
7623574 Holcomb Nov 2009 B2
7649937 Rabenold et al. Jan 2010 B2
7656410 Chiu Feb 2010 B2
7720145 Muthukrishnan et al. May 2010 B2
7733910 Mace et al. Jun 2010 B2
7733956 Kalra et al. Jun 2010 B1
7751324 Vadakital et al. Jul 2010 B2
7809059 Yin et al. Oct 2010 B2
7809060 Toma et al. Oct 2010 B2
7889788 Toma et al. Feb 2011 B2
7903743 Ho Mar 2011 B2
7912219 Michener et al. Mar 2011 B1
8102406 Peleg et al. Jan 2012 B2
8136140 Hodge Mar 2012 B2
8155207 Rodriguez et al. Apr 2012 B2
8254446 Toma et al. Aug 2012 B2
8259814 Rodriguez et al. Sep 2012 B2
8259817 Rodriguez et al. Sep 2012 B2
8265154 Gardner Sep 2012 B2
8279926 Rodriguez et al. Oct 2012 B2
8320465 Rodriguez et al. Nov 2012 B2
8326131 Rodriguez Dec 2012 B2
8416858 Rodriguez et al. Apr 2013 B2
8416859 Rodriguez et al. Apr 2013 B2
8681876 Rodriguez et al. Mar 2014 B2
5705631 Shepherd et al. Apr 2014 A1
8699578 Rodriguez et al. Apr 2014 B2
8718388 Rodriguez et al. May 2014 B2
8761266 Rodriguez et al. Jun 2014 B2
8782261 Rodriguez et al. Jul 2014 B1
8804843 Rodriguez et al. Aug 2014 B2
8804845 Rodriguez et al. Aug 2014 B2
8873932 Rodriguez et al. Oct 2014 B2
8875199 Rodriguez et al. Oct 2014 B2
8886022 Rodriguez et al. Nov 2014 B2
20020071485 Caglar et al. Jun 2002 A1
20020075402 Robson et al. Jun 2002 A1
20020092017 Klosterman et al. Jul 2002 A1
20020133819 Jackson Sep 2002 A1
20020149591 Van Der Vleuten et al. Oct 2002 A1
20020162111 Shimizu et al. Oct 2002 A1
20020176025 Kim Nov 2002 A1
20020178444 Trajkovic et al. Nov 2002 A1
20030012554 Zeidler et al. Jan 2003 A1
20030043847 Haddad Mar 2003 A1
20030067479 Jung et al. Apr 2003 A1
20030072555 Yap et al. Apr 2003 A1
20030081934 Kirmuss May 2003 A1
20030093418 Archbold May 2003 A1
20030093800 Demas et al. May 2003 A1
20030113098 Willis Jun 2003 A1
20030123849 Nallur Jul 2003 A1
20030135857 Pendakur et al. Jul 2003 A1
20030161407 Murdock et al. Aug 2003 A1
20030189982 MacInnis Oct 2003 A1
20030195977 Liu et al. Oct 2003 A1
20040010807 Urdang et al. Jan 2004 A1
20040012510 Chen Jan 2004 A1
20040028227 Yu Feb 2004 A1
20040040035 Carlucci et al. Feb 2004 A1
20040071354 Adachi et al. Apr 2004 A1
20040078186 Nair Apr 2004 A1
20040128578 Jonnalagadda Jul 2004 A1
20040133908 Smith et al. Jul 2004 A1
20040139462 Hannuksela et al. Jul 2004 A1
20040177369 Akins Sep 2004 A1
20040179619 Tian et al. Sep 2004 A1
20040210925 Miyazawa et al. Oct 2004 A1
20040218816 Hannuksela Nov 2004 A1
20040230994 Urdang et al. Nov 2004 A1
20040257472 Mpr et al. Dec 2004 A1
20050002574 Fukuhara et al. Jan 2005 A1
20050013249 Kong et al. Jan 2005 A1
20050022245 Nallur et al. Jan 2005 A1
20050053134 Holcomb Mar 2005 A1
20050053140 Holcomb Mar 2005 A1
20050053141 Holcomb Mar 2005 A1
20050053142 Holcomb Mar 2005 A1
20050053143 Holcomb Mar 2005 A1
20050053144 Holcomb Mar 2005 A1
20050053155 Holcomb et al. Mar 2005 A1
20050053295 Holcomb Mar 2005 A1
20050058201 Fernandes Mar 2005 A1
20050069212 Bottreau et al. Mar 2005 A1
20050084166 Boneh et al. Apr 2005 A1
20050123056 Wang Jun 2005 A1
20050175098 Narasimhan et al. Aug 2005 A1
20050190774 Wiegand Sep 2005 A1
20050207733 Gargi Sep 2005 A1
20050226323 Secker Oct 2005 A1
20050226325 Dei et al. Oct 2005 A1
20050226327 Kim Oct 2005 A1
20050229225 Klausberger et al. Oct 2005 A1
20050254498 Itoh Nov 2005 A1
20050281329 Chin Dec 2005 A1
20060013305 Sun Jan 2006 A1
20060036551 Oliveira et al. Feb 2006 A1
20060072597 Hannuksela Apr 2006 A1
20060083298 Wang Apr 2006 A1
20060083311 Winger Apr 2006 A1
20060093045 Anderson et al. May 2006 A1
20060093315 Kelly et al. May 2006 A1
20060109856 Deshpande May 2006 A1
20060117357 Surline Jun 2006 A1
20060120463 Wang Jun 2006 A1
20060126728 Yu et al. Jun 2006 A1
20060129914 Ellis Jun 2006 A1
20060132822 Walmsley Jun 2006 A1
20060133645 Rhoads et al. Jun 2006 A1
20060147121 Maeda et al. Jul 2006 A1
20060170571 Martinian et al. Aug 2006 A1
20060188169 Tener et al. Aug 2006 A1
20060222319 Russ Oct 2006 A1
20060224763 Altunbasak et al. Oct 2006 A1
20060227873 Toebes et al. Oct 2006 A1
20060262861 Kobayashi Nov 2006 A1
20060277566 Vince et al. Dec 2006 A1
20060282319 Maggio Dec 2006 A1
20060294171 Bossen Dec 2006 A1
20070011447 Murray et al. Jan 2007 A1
20070019724 Tourapis Jan 2007 A1
20070025688 Pejhan Feb 2007 A1
20070030186 Archbold Feb 2007 A1
20070030356 Yea Feb 2007 A1
20070030818 Bahnck et al. Feb 2007 A1
20070031110 Rijckaert Feb 2007 A1
20070038921 Pekonen et al. Feb 2007 A1
20070053665 Kato Mar 2007 A1
20070081586 Raveendran et al. Apr 2007 A1
20070091997 Fogg et al. Apr 2007 A1
20070106760 Houh et al. May 2007 A1
20070109409 Yea May 2007 A1
20070112721 Archbold May 2007 A1
20070116277 Ro et al. May 2007 A1
20070116426 Toma et al. May 2007 A1
20070121721 Kim et al. May 2007 A1
20070133674 Garnier et al. Jun 2007 A1
20070140358 Schwartz et al. Jun 2007 A1
20070147686 Joshi Jun 2007 A1
20070153679 Jost et al. Jul 2007 A1
20070153916 Demircin et al. Jul 2007 A1
20070172133 Kim Jul 2007 A1
20070183494 Hannuksela Aug 2007 A1
20070186240 Ward et al. Aug 2007 A1
20070194975 Jang et al. Aug 2007 A1
20070223595 Hannuksela et al. Sep 2007 A1
20070230460 Jeong et al. Oct 2007 A1
20070230496 Guo et al. Oct 2007 A1
20070245382 Doi et al. Oct 2007 A1
20070253490 Makino Nov 2007 A1
20070280350 Mathew et al. Dec 2007 A1
20070292107 Yahata et al. Dec 2007 A1
20070297460 Muneishi et al. Dec 2007 A1
20080022340 Hannuksela et al. Jan 2008 A1
20080025399 Le Leannec et al. Jan 2008 A1
20080037656 Hannuksela et al. Feb 2008 A1
20080037658 Price et al. Feb 2008 A1
20080037957 Nallur et al. Feb 2008 A1
20080055463 Lerner Mar 2008 A1
20080056383 Ueki et al. Mar 2008 A1
20080063074 Gallant et al. Mar 2008 A1
20080089422 Karczewicz Apr 2008 A1
20080115175 Rodriguez May 2008 A1
20080115176 Rodriguez May 2008 A1
20080117985 Chen May 2008 A1
20080127255 Ress et al. May 2008 A1
20080131079 Toma Jun 2008 A1
20080137728 Van Der Stok et al. Jun 2008 A1
20080137742 Chen Jun 2008 A1
20080141091 Kalluri Jun 2008 A1
20080151101 Tian et al. Jun 2008 A1
20080152005 Oguz et al. Jun 2008 A1
20080152006 Chen et al. Jun 2008 A1
20080163308 Kim Jul 2008 A1
20080192817 Llach et al. Aug 2008 A1
20080219393 Toma et al. Sep 2008 A1
20080225850 Oran et al. Sep 2008 A1
20080225951 Young Sep 2008 A1
20080244658 Chen Oct 2008 A1
20080247463 Buttimer Oct 2008 A1
20080256409 Oran et al. Oct 2008 A1
20080260045 Rodriguez et al. Oct 2008 A1
20080273596 Oguz et al. Nov 2008 A1
20080311869 Koga et al. Dec 2008 A1
20080320558 Imanishi et al. Dec 2008 A1
20090002379 Baeza Jan 2009 A1
20090003439 Wang et al. Jan 2009 A1
20090003446 Wu Jan 2009 A1
20090003447 Christoffersen Jan 2009 A1
20090016203 Yahata et al. Jan 2009 A1
20090028247 Suh Jan 2009 A1
20090028447 Yatabe et al. Jan 2009 A1
20090034627 Rodriguez et al. Feb 2009 A1
20090034633 Rodirguez et al. Feb 2009 A1
20090041130 Yoon et al. Feb 2009 A1
20090073928 Power Mar 2009 A1
20090086816 Leontaris et al. Apr 2009 A1
20090097568 Karczewicz et al. Apr 2009 A1
20090100482 Rodriguez et al. Apr 2009 A1
20090103635 Pahalawatta Apr 2009 A1
20090109342 Heng et al. Apr 2009 A1
20090116558 Chen May 2009 A1
20090138668 Blankenship May 2009 A1
20090141168 Chen et al. Jun 2009 A1
20090147859 McGowan et al. Jun 2009 A1
20090148056 Rodriguez et al. Jun 2009 A1
20090148132 Rodriguez et al. Jun 2009 A1
20090154560 Hong Jun 2009 A1
20090154563 Hong Jun 2009 A1
20090161770 Dong Jun 2009 A1
20090180546 Rodriguez et al. Jul 2009 A1
20090180547 Rodriguez et al. Jul 2009 A1
20090190655 Shimada Jul 2009 A1
20090190849 Huang Jul 2009 A1
20090196571 Rodriguez et al. Aug 2009 A1
20090199231 Tsuria et al. Aug 2009 A1
20090201988 Glazier et al. Aug 2009 A1
20090207904 Pandit et al. Aug 2009 A1
20090210412 Oliver Aug 2009 A1
20090214178 Takahashi Aug 2009 A1
20090220012 Rodriguez et al. Sep 2009 A1
20090226105 Huang Sep 2009 A1
20090262804 Pandit Oct 2009 A1
20090279608 Jeon Nov 2009 A1
20090296811 Jeon Dec 2009 A1
20090310934 Rodriguez et al. Dec 2009 A1
20090313662 Rodriguez Dec 2009 A1
20090313668 Shepherd Dec 2009 A1
20090323822 Rodriguez et al. Dec 2009 A1
20100003015 Rodriguez Jan 2010 A1
20100020870 Jeon Jan 2010 A1
20100026882 Jeon Feb 2010 A1
20100026883 Jeon Feb 2010 A1
20100026884 Jeon Feb 2010 A1
20100027417 Franceschini et al. Feb 2010 A1
20100027653 Jeon Feb 2010 A1
20100027654 Jeon Feb 2010 A1
20100027659 Jeon Feb 2010 A1
20100027660 Jeon Feb 2010 A1
20100027667 Samuelsson et al. Feb 2010 A1
20100027682 Jeon Feb 2010 A1
20100074340 Luo et al. Mar 2010 A1
20100088717 Candelore et al. Apr 2010 A1
20100118973 Rodriguez et al. May 2010 A1
20100118974 Rodriguez et al. May 2010 A1
20100118978 Rodriguez et al. May 2010 A1
20100118979 Rodriguez et al. May 2010 A1
20100122311 Rodriguez et al. May 2010 A1
20100150232 Nguyen et al. Jun 2010 A1
20100150234 Koo et al. Jun 2010 A1
20100150527 Sandoval Jun 2010 A1
20100195721 Wu et al. Aug 2010 A1
20100215338 Rodriguez Aug 2010 A1
20100218232 Rodriguez Aug 2010 A1
20100241753 Garbajs et al. Sep 2010 A1
20100292820 Yahata et al. Nov 2010 A1
20100322302 Rodriguez Dec 2010 A1
20110222837 Walton et al. Sep 2011 A1
20120263228 Rodriguez et al. Oct 2012 A1
20130028314 Rodriguez et al. Jan 2013 A1
20140307804 Rodriguez et al. Oct 2014 A1
20140351854 Rodriguez et al. Nov 2014 A1
Foreign Referenced Citations (21)
Number Date Country
101129066 Feb 2008 CN
0 812 112 Dec 1997 EP
1 292 138 Mar 2003 EP
1 328 119 Jul 2003 EP
1 480 460 Nov 2004 EP
05-236465 Sep 1993 JP
10-2004-0054708 Jun 2004 KR
WO 0000981 Jan 2000 WO
WO 0062552 Oct 2000 WO
0101702 Jan 2001 WO
WO 0143440 Jun 2001 WO
WO 0163774 Aug 2001 WO
WO 2004102571 Nov 2004 WO
WO 2005106875 Nov 2005 WO
WO 2006083824 Aug 2006 WO
WO 2006101979 Sep 2006 WO
WO 2006114761 Nov 2006 WO
2008005040 Jan 2008 WO
WO 2008063881 May 2008 WO
WO 2009018360 Feb 2009 WO
WO 2009052262 Apr 2009 WO
Non-Patent Literature Citations (163)
Entry
European Communication dated Aug. 9, 2011 in Application No. 08 838 787.3.
European Communication dated Dec. 14, 2011 in Application No. 09 751 294.1.
U.S. Non-Final Office Action in U.S. Appl. No. 12/417,864 dated Apr. 18, 2011.
U.S. Final Office Action mailed Jul. 5, 2011 in U.S. Appl. No. 12/417,864.
U.S. Non-Final Office Action mailed Aug. 5, 2011 in U.S. Appl. No. 11/831,906.
U.S. Final Office Action mailed Aug. 5, 2011 in U.S. Appl. No. 12/417,869.
U.S. Non-Final Office Action mailed Sep. 14, 2011 in U.S. Appl. No. 12/124,779.
U.S. Non-Final Office Action mailed Sep. 22, 2011 in U.S. Appl. No. 11/831,912.
U.S. Final Office Action mailed Sep. 28, 2011 in U.S. Appl. No. 11/831,916.
U.S. Non-Final Office Action mailed Nov. 10, 2011 in U.S. Appl. No. 12/483,925.
U.S. Non-Final Office Action mailed Nov. 23, 2011 in U.S. Appl. No. 12/141,015.
U.S. Non-Final Office Action mailed Nov. 29, 2011 in U.S. Appl. No. 12/492,117.
U.S. Non-Final Office Action mailed Nov. 23, 2011 in U.S. Appl. No. 12/141,017.
U.S. Non-Final Office Action mailed Dec. 21, 2011 in U.S. Appl. No. 12/333,296.
U.S. Non-Final Office Action mailed Dec. 22, 2011 in U.S. Appl. No. 12/617,043.
U.S. Non-Final Office Action mailed Dec. 27, 2011 in U.S. Appl. No. 12/417,869.
U.S. Non-Final Office Action mailed Dec. 27, 2011 in U.S. Appl. No. 12/252,632.
U.S. Non-Final Office Action mailed Jan. 4, 2012 in U.S. Appl. No. 12/617,062.
U.S. Non-Final Office Action mailed Jan. 10, 2012 in U.S. Appl. No. 12/333,301.
U.S. Non-Final Office Action mailed Jan. 18, 2012 in U.S. Appl. No. 12/617,015.
U.S. Final Office Action mailed Jan. 19, 2012 in U.S. Appl. No. 12/124,779.
U.S. Final Office Action mailed Feb. 17, 2012 in U.S. Appl. No. 11/627,452.
U.S. Appl. No. 12/417,864, filed Apr. 3, 2009 entitled “System and Method for Authorization of Segment Boundary Notifications”, Inventors: Theodore R. Grevers, Arturo A. Rodriguez, and Anthony J. Wasilewski.
U.S. Appl. No. 12/417,868, filed Apr. 3, 2009 entitled “Segment Boundary Notification to a Digital Media Receiver”, Inventors: Theodore R. Grevers, Arturo A. Rodriguez, and Anthony J. Wasilewski.
U.S. Appl. No. 12/417,869, filed Apr. 3, 2009 entitled “System and Method for Processing Segment Boundary Notifications”, Inventors: Theodore R. Grevers, Arturo A. Rodriguez, and Anthony J. Wasilewski.
U.S. Appl. No. 12/709,851, filed Feb. 22, 2010 entitled “Signalling of Decodable Sub-Sequences”, Inventor: Arturo A. Rodriguez.
U.S. Appl. No. 12/713,153, filed Feb. 25, 2010 entitled “Signalling of Auxiliary Information that Assists Processing of Video According to Various Formats”, Inventors: Rodriguez et al.
U.S. Appl. No. 12/722,117, filed Mar. 11, 2010 entitled “Management of Picture Referencing in Video Streams for Plural Playback Modes”, Inventors: Walton et al.
ITU-T Telecommunication Standardization Sector of ITU, Infrastructure of Audiovisual Services—Coding of Moving Video, “Advanced Video Coding for Generic Audiovisual Services”, International Telecommunication Union, H.264, May 2003, XP008095420, 282 pages.
Tian et al., “Sub-Sequence Video Coding for Improved Temporal Scalability”, 4 pages.
Gruneberg et al., International Organisation for Standardisation Organisation Internationale de Normalisation ISO/IEC JTC1/SC29/WG11 Coding of Moving Pictures and Audio, “Proposal for MPEG-2 Transport Stream Extensions for Scalable Video Coding”, XP030043296, Jul. 2007, 6 pages.
Amon et al., “File Format for Scalable Video Coding”, IEEE Transactions on Circuits and Systems for Video Technology, vol. 17 No. 9, Sep. 2007, pp. 1174-1185.
ITU: “Series H: Audiovisual and Multimedia Systems: Infrastructure of Audiovisual Services—Transmission Multiplexing and Synchronization”, Systems ITU-T Recommendation H.222.0, May 2006, http://mirror.itu.int/dms/pay/itu-t/rec/h/T-REC-H.222.0-200605-I PDF E.pdf, XP007905991, pp. 1-76.
MacInnis et al., International Organisation for Standardization Organisation Internationale Normalisation ISO/IEC JTC1/SC29/WG11 Coding of Moving Pictures and Audio, “NAL for AVC Video with MPEG-2 Systems”, Video Standards and Drafts, Mar. 2002, pp. 1-11.
“Splice Points for MPEG-2 Transport Streams”, SMPTE Journal, Smpte Inc., vol. 107 No. Oct. 1998, XP-000793004, pp. 916-925.
Rodriguez et al., “SEI message to convey suitable splice points in the bitstream”, JVT Meeting, Document JVT-Z040, Filename JVT-Z040.doc, XP-30007329, Jan. 2008, pp. 1-8.
Luo et al., “On HRD conformance for splice bitstreams”, JVT Meeting, Document JVT-V055r1, Filename JVT-V055r1.doc, XP-30006863, Jan. 2007, pp. 1-11.
Hurst et al., “MPEG Splicing Tutorial and Proposed SMPTE Standard”, Proceedings of the SMPTE Technical Conference, Nov. 1997, pp. 105-117.
International Search Report dated Sep. 4, 2009 cited in International Application No. PCT/US2009/047237.
Written Opinion dated Sep. 4, 2009 cited in International Application No. PCT/US2009/047237.
International Search Report dated Sep. 4, 2009 cited in International Application No. PCT/US2009/044370.
Written Opinion dated Sep. 4, 2009 cited in International Application No. PCT/US2009/044370.
International Search Report dated May 23, 2008 cited in International Application No. PCT/US2007/083867.
Written Opinion dated May 23, 2008 cited in International Application No. PCT/US2007/083867.
International Search Report and Written Opinion dated Oct. 30, 1998 cited in International Application No. PCT/US2008/071621.
International Search Report and Written Opinion dated Oct. 18, 2004 cited in International Application No. PCT/US2004/023279.
International Search Report and Written Opinion dated Apr. 15, 2009 cited in International Application No. PCT/US2008/080128.
International Preliminary Report on Patentability and Written Opinion dated Feb. 2, 2010 cited in International Application No. PCT/US2008/071111.
International Search Report and Written Opinion dated Apr. 15, 2010 cited in International Application No. PCT/US2010/024927.
Canadian Office Action dated Dec. 11, 2009 in Application No. 2,533,169.
European Examination dated May 4, 2010 in Application No. 07 844 937.8.
U.S. Non-final Office Action dated Dec. 28, 2007 in U.S. Appl. No. 10/623,683.
U.S. Final Office Action dated Jul. 25, 2008 in U.S. Appl. No. 10/623,683.
U.S. Non-Final Office Action dated Feb. 1, 2010 in U.S. Appl. No. 11/831,916.
U.S. Final Office Action in U.S. Appl. No. 11/627,452 dated Mar. 4, 2011.
U.S. Non-Final Office Action in U.S. Appl. No. 11/831,916 dated Mar. 31, 2011.
U.S. Non-Final Office Action in U.S. Appl. No. 12/417,869 dated Apr. 4, 2011.
Stuhlmuller, Klaus, et al., “Analysis of Video Transmission over Lossy Channels”; IEEE Journal on Selected Areas in Communication, vol. 18, No. 6, Jun. 2000, pp. 1012-1032.
PCT Search Report cited in International Appln No. PCT/US2009/064180 mailed Jan. 8, 2010.
PCT Written Opinion cited in International Appln No. PCT/US2009/064180 mailed Jan. 8, 2010.
PCT Search Report cited in International Appln No. PCT/US2009/047521 mailed Dec. 22, 2009.
PCT Written Opinion cited in International Appln No. PCT/US2009/047521 mailed Dec. 22, 2009.
European Examination dated Sep. 16, 2010 in Application No. 08 796 875.6.
U.S. Non-Final Office Action in U.S. Appl. No. 11/627,452 dated Nov. 10, 2010.
U.S. Non-Final Office Action in U.S. Appl. No. 11/831,916 dated Aug. 4, 2010.
U.S. Final Office Action mailed Jan. 2, 2014 in U.S. Appl. No. 12/483,925, 47 pages.
U.S. Final Office Action mailed Jan. 16, 2014 in U.S. Appl. No. 12/333,296, 18 pages.
U.S. Final Office Action mailed Jan. 27, 2014 in U.S. Appl. No. 12/492,117, 23, pages.
U.S. Non-Final Office Action mailed Jan. 29, 2014 in U.S. Appl. No. 12/252,632, 22 pages.
U.S. Final Office Action mailed Jan. 30, 2014 in U.S. Appl. No. 12/722,117, 22 pages.
U.S. Office Action mailed Feb. 10, 2014 in U.S. Appl. No. 12/713,153, 18 pages.
U.S. Non-Final Office Action mailed Feb. 13, 2014 in U.S. Appl. No. 13/633,672, 5 pages.
U.S. Office Action mailed Mar. 21, 2014 in U.S. Appl. No. 11/831,906, 20 pages.
U.S. Non-Final Office Action mailed Apr. 9, 2013 in U.S. Appl. No. 12/492,117, 20 pages.
U.S. Non-Final Office Action mailed Apr. 9, 2013 in U.S. Appl. No. 11/627,452, 11 pages.
U.S. Final Office Action mailed Jun. 6, 2013 in U.S. Appl. No. 12/617,043, 27 pages.
U.S. Final Office Action mailed Jun. 19, 2013 in U.S. Appl. No. 12/713,153, 19 pages.
U.S. Non-Final Office Action mailed Jun. 21, 2013 in U.S. Appl. No. 12/483,925, 40 pages.
U.S. Non-Final Office Action mailed Jul. 3, 2013 in U.S. Appl. No. 13/443,580, 25 pages.
U.S. Non-Final Office Action mailed Jul. 16, 2013 in U.S. Appl. No. 12/333,296, 32 pages.
U.S. Non-Final Office Action mailed Jul. 18, 2013 in U.S. Appl. No. 12/417,864, 14 pages.
U.S. Non-Final Office Action mailed Aug. 7, 2013 in U.S. Appl. No. 12/333,301, 20 pages.
U.S. Final Office Action mailed Sep. 6, 2013 in U.S. Appl. No. 12/492,117, 27, pages.
U.S. Non-Final Office Action mailed Sep. 6, 2013 in U.S. Appl. No. 13/633,672, 22 pages.
U.S. Non-Final Office Action mailed Sep. 11, 2013 in U.S. Appl. No. 12/722,117, 21 pages.
U.S. Final Office Action mailed Sep. 26, 2013 in U.S. Appl. No. 11/831,912, 25 pages.
U.S. Non-Final Office Action mailed Oct. 1, 2013 in U.S. Appl. No. 12/616,991, 18 pages.
U.S. Final Office Action mailed Nov. 12, 2013 in U.S. Appl. No. 11/627,452, 22 pages.
U.S. Final Office Action mailed Nov. 13, 2013 in U.S. Appl. No. 11/831,906, 32 pages.
U.S. Final Office Action mailed Dec. 4, 2013 in U.S. Appl. No. 13/443,580, 9 pages.
U.S. Non-Final Office Action mailed Dec. 13, 2013 in U.S. Appl. No. 12/141,019, 8 pages.
U.S. Office Action mailed Mar. 28, 2014 in U.S. Appl. No. 12/417,869, 12 pgs.
U.S. Office Action mailed Jun. 20, 2014 in U.S. Appl. No. 13/633,672, 7 pgs.
U.S. Office Action mailed Jul. 14, 2014 in U.S. Appl. No. 12/722,117, 31 pgs.
U.S. Office Action mailed Jul. 25, 2014 in U.S. Appl. No. 12/713,153, 29 pgs.
D.T. Nguyen and J. Ostermann, “Congestion Control using Scalable Video Coding based on H. 264/AVC,” IEEE Journal of Selected Topics in Signal Processing, vol. 1 No. 2, Aug. 2007, 8 pages.
Digital Video Image Quality and Perceptual Coding edited by H.R. Wu and K.R. Rao, CRC Press 2005, pp. 503-541.
Author Unknown, SMPTE Standard for Television—Splice Points for MPEG-2 Transport Streams, The Society of Motion Picture and Television Engineers, Copyright 1999, http://www.ietf.org/mail-archive/web/avtext/current/pdf6u0ckuE66s.pdf, accessed May 30, 2012, 20 pages.
Hannuksela et al., “H.264/AVC Video for Wireless Transmission,” IEEE Wireless Communications, IEEE Service Center, Piscataway, NJ, US, vol. 12, No. 4, Aug. 1, 2005, pp. 6-13.
Psannis K. et al., “Efficient Flexible Macroblock Ordering Technique,” IEICE Transactions on Communications, Communications Society, Tokyo JP, vol. E19B, No. 8, Aug. 1, 2008, pp. 2692-2701.
Tom A. S. et al., “Packet Video for Cell Loss Protection Using Deinterleaving and Scrambling,” Speech Processing 1. Toronto, May 14-17, 1991; [International Conference on Acoustics, Speech & Signal Processing. ICASSP], New York, IEEE, US, vol. Conf. 16, Apr. 14, 1991, pp. 2857-2860.
Schwarz H. et al., “SVC Overview,” 21. JVT Metting; 78. MPEG Meeting; Oct. 20-27, 2006; Hangzhou CN; (Joint Video Team of ISO/IEC JTC1/SC29/WG11 and ITU-T SG.16), No. JVT-U145, Oct. 20, 2006, 20 pages.
Yao Wang et al., “Error Control and Concealment for Video Communication: A Review,” Proceedings of the IEEE, New York, vol. 86, No. 5, May 1, 1998, 24 pages.
Zhu et al., “Coding and Cell-Loss Recovery in DCT-Based Packet Video,” IEEE Transactions on Circuits and Systems for Video Technology, Jun. 3, 1993, New York U.S., 11 pages.
U.S. Appl. No. 14/253,043, filed Apr. 15, 2014, entitled “Methods and Systems for Processing Latticed Time-Skewed Video Streams,” Rodrigeuz et al.
U.S. Appl. No. 14/313,266, filed Jun. 24, 2014, entitled “Receiving and Processing Multi-Latticed Video ,” Rodrigeuz et al.
European Communication dated Sep. 22, 2011 in Application No. 08796584.4, 9 pages.
Chinese First Office Action mailed Dec. 31, 2011 in Application No. 200880121233.X, 7 pages.
Canadian Office Action dated Jun. 6, 2012 in Application No. 2,669,552, 3 pages.
European Communication dated Jul. 5, 2012 in Application No. 08838787.3, 6 pages.
Supplementary European Search Report dated Jul. 17, 2012 in Application No. 09826735, 3 pages.
Supplementary European Search Report dated Jul. 26, 2012 in Application No. 09767598, 7 pages.
Chinese First Office Action mailed Aug. 31, 2012 in Application No. 200980118689.5, 12 pages.
Chinese First Office Action mailed Feb. 21, 2013 in Application No. 200980145072.2, 16 pages.
European Communication dated Mar. 22, 2013 in Application No. 09 826 735.4, 7 pages.
European Communication dated Mar. 22, 2013 in Application No. 09 767 598.7, 5 pages.
European Communication dated Oct. 15, 2013 in Application No. 09 767 598.7, 6 pages.
Chinese Second Office Action mailed Oct. 25, 2013 in Application No. 200980145072.2, 4 pages.
Chinese Office Action mailed Nov. 13, 2013 in Appln No. 200980124140.7, 15 pgs.
U.S. Non-Final Office Action mailed Mar. 8, 2012 in U.S. Appl. No. 12/351,776, 31 pages.
U.S. Final Office Action mailed Mar. 13, 2012 in U.S. Appl. No. 11/831,906, 24 pages.
U.S. Final Office Action mailed Mar. 19, 2012 in U.S. Appl. No. 11/831,912, 20 pages.
U.S. Non-Final Office Action mailed Mar. 26, 2012 in U.S. Appl. No. 12/395,676, 37 pages.
U.S. Non-Final Office Action mailed Apr. 23, 2012 in U.S. Appl. No. 12/709,851, 29 pages.
U.S. Non-Final Office Action mailed Apr. 25, 2012 in U.S. Appl. No. 12/141,019, 28 pages.
U.S. Final Office Action mailed May 11, 2012 in U.S. Appl. No. 12/141,015, 25 pages.
U.S. Final Office Action mailed May 18, 2012 in U.S. Appl. No. 12/492,117, 17 pages.
U.S. Non-Final Office Action mailed May 23, 2012 in U.S. 12/616,974, 30 pages.
U.S. Final Office Action mailed May 23, 2012 in U.S. Appl. No. 12/333,296, 21 pages.
U.S. Final Office Action mailed May 23, 2012 in U.S. Appl. No. 12/333,301, 18 pages.
U.S. Final Office Action mailed Jun. 4, 2012 in U.S. Appl. No. 12/252,632, 22 pages.
U.S. Final Office Action mailed Jun. 11, 2012 in U.S. Appl. No. 12/141,017, 23 pages.
U.S. Non-Final Office Action mailed Jun. 15, 2012 in U.S. Appl. No. 12/124,779, 12 pages.
U.S. Non-Final Office Action mailed Jun. 20, 2012 in U.S. Appl. No. 12/722,117, 30 pages.
U.S. Non-Final Office Action mailed Jun. 25, 2012 in U.S. Appl. No. 12/417,868, 37 pages.
U.S. Final Office Action mailed Jul. 6, 2012 in U.S. Appl. No. 12/617,043, 26 pages.
U.S. Non-Final Office Action mailed Jul. 10, 2012 in U.S. Appl. No. 12/417,869, 8 pages.
U.S. Final Office Action mailed Jul. 16, 2012 in U.S. Appl. No. 12/351,776, 6 pages.
U.S. Non-Final Office Action mailed Jul. 18, 2012 in U.S. Appl. No. 12/616,991, 25 pages.
U.S. Non-Final Office Action mailed Aug. 10, 2012 in U.S. Appl. No. 12/483,925, 35 pages.
U.S. Non-Final Office Action mailed Sep. 13, 2012 in U.S. Appl. No. 12/141,015, 22 pages.
U.S. Non-Final Office Action mailed Oct. 2, 2012 in U.S. Appl. No. 12/417,864, 17 pages.
U.S. Final Office Action mailed Nov. 23, 2012 in U.S. Appl. No. 12/417,869, 16 pages.
U.S. Final Office Action mailed Nov. 27, 2012 in U.S. Appl. No. 12/616,991, 34 pages.
U.S. Final Office Action mailed Dec. 19, 2012 in U.S. Appl. No. 12/722,117, 24 pages.
U.S. Final Office Action mailed Jan. 4, 2013 in U.S. Appl. No. 12/417,868, 19 pages.
U.S. Non-Final Office Action mailed Jan. 24, 2013 in U.S. Appl. No. 12/713,153, 41 pages.
U.S. Non-Final Office Action mailed Feb. 26, 2013 in U.S. Appl. No. 12/617,043, 31 pages.
U.S. Final Office Action mailed Feb. 26, 2013 in U.S. Appl. No. 12/141,019, 14 pages.
U.S. Final Office Action mailed Feb. 28, 2013 in U.S. Appl. No. 12/483,925, 37 pages.
U.S. Final Office Action mailed Mar. 18, 2013 in U.S. Appl. No. 12/141,015, 23 pages.
U.S. Final Office Action mailed Mar. 18, 2013 in U.S. Appl. No. 12/417,864, 13 pages.
U.S. Non-Final Office Action mailed Mar. 20, 2013 in U.S. Appl. No. 11/831,912, 17 pages.
U.S. Non-Final Office Action mailed Apr. 9, 2013 in U.S. Appl. No. 12/831,906, 22 pages.
U.S. Office Action mailed Jun. 20, 2014 in U.S. Appl. No. 12/417,868, 41 pgs.
U.S. Office Action mailed Aug. 14, 2014 in U.S. Appl. No. 12/252,632, 23 pgs.
U.S. Office Action mailed Aug. 27, 2014 in U.S. Appl. No. 12/492,117, 37 pgs.
U.S. Office Action mailed Aug. 28, 2014 in U.S. Appl. No. 12/417,869, 11 pgs.
U.S. Appl. No. 14/502,651, filed Sep. 30, 2014, entitled “Determining Tracking Picture Candidates with Multiple Level Tiers”, Rodriguez et al.
U.S. Appl. No. 14/501,905, filed Sep. 30, 2014, entitled “Signaling Tier Information to Assist MMCO Stream Manipulation”, Rodriguez et al.
U.S. Office Action mailed Sep. 17, 2014 in U.S. Appl. No. 12/351,776, 29 pgs.
U.S. Office Action mailed Nov. 6, 2014 in U.S. Appl. No. 12/417,868, 41 pgs.
U.S. Office Action mailed Nov. 6, 2014 in U.S. Appl. No. 13/633,672, 7 pgs.
Related Publications (1)
Number Date Country
20100293571 A1 Nov 2010 US
Provisional Applications (1)
Number Date Country
61177336 May 2009 US