The present invention relates to digital media delivery and playback, and in particular to systems and methods for implementing cross-fading, interstitials and other effects/processing of two or more media elements on a downstream device so as to replicate, to the extent possible, the feel, sound and flow of broadcast programming or “DJ” (disc jockey) enhanced playlists.
Media delivery of both audio and video programming relies heavily on the ability to provide crossfades, blends and other processing or interstitial effects, to both enhance the user experience and to provide high quality delivery to the customer.
In a traditional broadcast model, such as, for example, FM radio, or a national television network, these kinds of effects are typically generated at the broadcast station or headend, typically by an automation system. This approach to effect insertion works well because all users receive the same broadcast stream, and complex effects can be processed, implemented and tightly controlled at a single location. Moreover, the amount of processing required is both constant for a given effect and independent of the number of end users.
With modern multimedia delivery, especially systems that deliver a personalized experience, where each user receives different programming or content that (i) varies with time relative to all other users, and that (ii) is personalized, to a greater or lesser degree, for each user, this traditional model does not work. In a personalized service, all users receive a custom set of audio or video elements usually based on a customized playlist.
If blends, interstitial effects, processing or cross fading are required or desired between successive media elements in such a personalized stream, one approach is to push the burden of processing the effect or crossfade to the client device, including the responsibility to both manage the download of the various elements needed, with sufficient lead time. This approach is often sub optimal. Not all client devices may be capable of processing complex effects to deliver a high-quality user experience, for a variety of reasons. For example, some devices may not be capable of such processing because of processing power, memory size, power or other limitations of processing effects. Other devices may have been the zenith of their class at one time, but are now legacy devices, and as techniques for on device cross fading advance, their capabilities are no longer sufficient. This can easily lead to a spectrum of unsatisfactory user experiences.
What are thus needed in the art are systems and methods to address these problems of the prior art so as to implement and facilitate cross-fading, interstitials and other effects/processing of two or more media elements from the server side, and have the ultimate result easily effected and implemented on the downstream device.
Systems, methods and computer readable media are provided to implement and facilitate cross-fading, interstitials and other effects/processing of two or more media elements in a personalized media delivery service so that each client or user has a consistent high quality experience. The various effects or crossfade processing can occur on the broadcast, music service, publisher or other server-side, but can still be personalized to a specific user, thus still allowing for a personalized experience for each individual user, in a manner where the processing burden is minimized on the downstream side, or client device. This approach enables a consistent user experience, independent of client device capabilities, both static and dynamic. The cross-fade, for example, can be implemented after decoding the relevant chunks of each component clip, and then processing, recoding and rechunking. Alternatively, in a preferred embodiment, the cross-fade or other effect can be implemented on the relevant chunks to that effect in the compressed domain, thus obviating any loss of quality by re-encoding. A large scale personalized content delivery service can be implemented by limiting the processing to essentially the first and last chunks of any file, since there is no need to process the full clip. This type of processing can easily be accommodated in cloud computing technology, where the first and last files may be conveniently extracted and processed within the cloud to meet the required load. Processing may also be done locally, for example, by the broadcaster, with sufficient processing power to manage peak load.
In exemplary embodiments of the present invention, systems and methods are provided to implement and facilitate cross-fading, interstitials and other effects/processing of two or more media elements in a personalized media delivery service so that each client or user has a consistent high quality experience.
Thus, in exemplary embodiments of the present invention, the desired effects, for example, crossfade processing, can occur on the broadcast, publisher, music service, or other server-side, but may still be personalized to a specific user, thus allowing a personalized experience for each individual user in a manner where the processing burden is minimized on the downstream side, or client device. This approach enables a consistent user experience, independent of client device capabilities, both static and dynamic.
One contemporary method of media delivery is called “Progressive Download”. According to this method, compressed audio or video bitstreams are encoded at the broadcast side and divided into chunks, for example, of mostly equal lengths. This chunking produces many small files which can easily be distributed over a low-cost infrastructure such as, for example, a web server. In addition, streams may be encoded using multiple bit rates, and a client device can switch between the streams, at file boundaries, to optimize playback quality at any given delivery rate. Examples of this kind of technique include, for example, Apple's HLS or Microsoft's Smooth Streaming. Players for this type of decoding and playback are able to seamlessly splice the discrete file chunks, and provide a smooth, uninterrupted playback of audio and video. In exemplary embodiments of the present invention, the chunking feature of Progressive Download can be leveraged to implement cross fading, blends and other interstitial processing/effects on the server side, as next described.
Exemplary Server Side Cross Fade: Sub-Optimal Method
In the following illustrative description, with reference to
Returning to
It is noted that in the example of
Additionally, unless the last chunk of Clip1—here Clip1:Chunk 4—or the first chunk of Clip2—here Clip2:Chunk 1, is equal to the crossfade length, the resultant chunk made from the last chunk of the prior clip, the first chunk of the subsequent clip and the overlap between them, will often be longer than the chunk length limit. In such cases there may, for example, be two “revised” chunks taking the place of, for example, original Clip1:Chunk 4 and Clip2:Chunk 1. For example, a last chunk of 3 second duration with a 2 second crossfade could either (a) produce a new 1 second chunk followed by a 20 second chunk which includes the crossfade, or (b) produce a 21 second chunk including the crossfade. In exemplary embodiments of the present invention, either option is valid.
The particular embodiment shown in
Exemplary Server Side Cross Fade: Optimal Method
Core Chunks and Processed Chunks—Optimizing Personalized Service Delivery
Thus,
As noted, if the desired effect(s) or crossfade duration is less than that of the last chunk in the file, then only the last chunk needs to be retrieved and processed. As also noted, if the required crossfade duration is longer than the last chunk N, then chunk N and second to the last chunk N−1 must be retrieved for processing. Similar considerations apply to the first chunk in the subsequent file. For example, as noted, if the crossfade duration is longer than 20 seconds as considered in the examples provided above, then both Chunk 1 and Chunk 2 of Clip2 must be retrieved for processing.
As can thus readily be seen, by limiting the processing to essentially the first and last chunks of a file, techniques according to exemplary embodiments of the present invention can be successfully scaled to many hundreds of thousands, or even millions, of simultaneous users, since it does not require processing the full clip—as to any of the many clips in a given library. In exemplary embodiments of the present invention, this type of processing can easily be accommodated in cloud computing technology, where the first and last files may be conveniently extracted and processed within the cloud to meet the required load. Alternatively, processing may also be done locally, for example, by the broadcaster, or music service provider, with sufficient processing power to manage peak load.
Encryption of Content Clips
For security reasons, in exemplary embodiments of the present invention compressed audio chunks may be encrypted. If this is the case, decryption will be required for the first and last chunk (or, for example, additional chunks if the effect's duration exceeds a chunk length, as noted above) prior to processing. An alternate approach would be to allow the first and last chunks (or additional chunks, as noted) to remain unencrypted, which would alleviate the requirement for decryption, but not sacrifice security in any material way.
Server Side Crossfade System
Exemplary generation of server-side crossfade segments is illustrated in
Exemplary Cross Fade (Client)
To illustrate a simple crossfade, involving two sequential songs using server side generated crossfade clips, the following example is provided.
An exemplary crossfade on an Android device was accomplished using two Media Players and setVolume( ). Crossfade using the transition clips works by playing the from-clip followed by the transition clip (constructed using techniques as described in PCT/2013/158804 for compressed domain crossfades, or by adding together the PCM (Pulse Code Modulation) values of the from-clip and to-clip over the transition interval for non-compressed domain crossfades).
As an example, a Playlist Type can have four distinct functions that can be used for differing channels (or playlists), including, for example, a logarithmic function, a linear function and two sigmoid functions. The Playlist Type can also have parameters, which can be constants that adjust the trajectory of the function over the interval, as described below. Table I below provides exemplary values for such functions and parameters for four such Playlist Types, namely Heavy Metal, Easy Listening, Country and Rock.
Similarly, Table II below provides exemplary TransitionTypes that can be applied in exemplary embodiments of the present invention.
Where the mathematical functions follow (i) some form of logarithm (as is popular in the broadcast community), (ii) a sigmoid function or (iii) some other monotonically increasing function, the parameters “ParamA” and “ParamB”, as described in the two tables provided above can be, for example, constants which can adjust the slope of the function. For example, when using the tan h function, a parameter ParamA can be used such that tan h(Ax) is the actual value. It is noted that FIG. 3A of U.S. patent application Ser. No. 14/358,919, entitled SYSTEMS AND METHODS FOR IMPLEMENTING CROSS-FADING, INTERSTITIALS AND OTHER EFFECTS DOWNSTREAM, referenced above, provides a comparison of some exemplary Sigmoid functions. In that FIG. 3A (of that application) all of the functions are normalized in such a way that their slope at 0 is 1.
It is understood that these functions can, for example, be realized as a set of discrete values over the interval, and it is these (attenuation) values that can be downloaded as a table or array to a client device to be used to adjust the volume of the content during the fade. For example, a 1 second linear fade out with a sample rate of 44.1 KHz can be represented as 44,100 multipliers, each with the value 1 diminished by 1/44,100 for each sample from the start. (e.g., 1.0, 0.999909, 0.999818, 0.999727, etc). The tradeoff between storing and computing the function, as opposed to downloading and using a table (with interpolation between values as needed), is an engineering decision and can, in exemplary embodiments of the present invention, be context specific, based on the instruction set of the client and performance considerations, as understood in the art.
The interaction between the Playlist Type (which defines an overall experience for a particular type of Playlist, such as a Channel) and the TransitionType (which defines an experience between two successive clips independent of the Channel) is one of priority. Thus, in exemplary embodiments of the present invention, if there is no TransitionType defined between two adjacent clips then a standard Playlist Type transition for that Channel can be used. If, on the other hand, a TransitionType is defined for those clips, then the defined Transition Type can be used instead of a default Playlist Type transition.
Continuing with reference to
Information stored in Device Profile repository 560 can then, for example, be used by Content Scheduler 540 to schedule content for distribution and client device management. An example Device Profile table, Table III, with two sample entries, is provided below for illustrative purposes. In exemplary embodiments of the present invention the information provided in such a table allows an exemplary Content Scheduler 540 to optimize what content can be downloaded and played on a given device, and at what times.
In exemplary embodiments of the present invention, a system can further contain a Content Repository 550 which can be used, for example, to store actual audio clips in compressed form. In the exemplary system of
Coordination of the delivery of content to a client device can, for example, be accomplished by Play Control instructions issuing from Content Scheduler 540, and/or Client Device Control instructions issuing from Decoder Management 590 to particular client devices. Further, for example, Content Scheduler 540 may provide message communication regarding the availability of the playlists authored by Playlist Editor 510, and can also, for example, be responsible for allowing a client to obtain profile information regarding both devices and user preferences. Decoder Management 590 (also known as “Client Device Management” 590) can, for example, provide message communication regarding low level interactions between the service provider and the client with respect to delivery of clip elements to a particular user that are to be merged together. In general, such messages will reflect a “taxonomy” of variables, parameters, and data fields defined by the content distribution system as needed to adequately manage a client device downstream component to perform the various transition effects for any cross-fade.
Exemplary Implementations
Any suitable programming language can be used to implement the routines of particular exemplary embodiments including, but not limited to, the following: C, C++, Java, JavaScript, Python, Ruby, CoffeeScript, assembly language, etc. Different programming techniques can be employed such as procedural or object oriented. The routines can execute on a single processing device or multiple processors. Although the steps, operations, or computations may be presented in a specific order, this order may be changed in different particular embodiments. In some particular embodiments, multiple steps shown as sequential in this specification can be performed at the same time.
Particular embodiments may be implemented in a computer-readable storage device or non-transitory computer readable medium for use by or in connection with the instruction execution system, apparatus, system, or device. Particular embodiments can be implemented in the form of control logic in software or hardware or a combination of both. The control logic, when executed by one or more processors, may be operable to perform that which is described in particular embodiments.
Particular embodiments may be implemented by using a programmed general purpose digital computer, by using application specific integrated circuits, programmable logic devices, field programmable gate arrays, optical, chemical, biological, quantum or nanoengineered systems, components and mechanisms may be used. In general, the functions of particular embodiments can be achieved by any means as is known in the art. Distributed, networked systems, components, and/or circuits can be used. Communication, or transfer, of data may be wired, wireless, or by any other means.
It will also be appreciated that one or more of the elements depicted in the drawings/figures can also be implemented in a more separated or integrated manner, or even removed or rendered as inoperable in certain cases, as is useful in accordance with a particular application. It is also within the spirit and scope to implement a program or code that can be stored in a machine-readable medium, such as a storage device, to permit a computer to perform any of the methods described above.
As used in the description herein and throughout the claims that follow, “a”, “an”, and “the” includes plural references unless the context clearly dictates otherwise. Also, as used in the description herein and throughout the claims that follow, the meaning of “in” includes “in” and “on” unless the context clearly dictates otherwise.
While there have been described methods for implementing efficient cross-fading between compressed audio streams, it is to be understood that many changes may be made therein without departing from the spirit and scope of the invention. Insubstantial changes from the claimed subject matter as viewed by a person with ordinary skill in the art, no known or later devised, are expressly contemplated as being equivalently within the scope of the claims. Therefore, obvious substitutions now or later known to one with ordinary skill in the art are defined to be within the scope of the defined elements. The described embodiments of the invention are presented for the purpose of illustration and not of limitation
The above-presented description and accompanying figures are intended by way of example only and are not intended to limit the present invention in any way except as set forth in the following claims. It is particularly noted that persons skilled in the art can readily combine the various technical aspects of the various exemplary embodiments described into a wide variety of techniques, systems and methods, all being encompassed within the present invention. For the sake of clarity, it is noted that the term “crossfade” includes any transition, blend or interstitial effect implemented on or near a boundary between two successive content clips or files provided in a content delivery service or method.
This is a continuation of U.S. patent application Ser. No. 14/516,884, filed on Oct. 17, 2014, which is a continuation-in-part of PCT/2013/037013, which published as WO 2013/158787. As such, the present application claims priority to U.S. Provisional Patent Application Nos. 61/687,049, filed on Apr. 17, 2012 entitled SERVER SIDE CROSSFADE FOR PROGRESSIVE DOWNLOAD MEDIA, and 61/687,048, filed on Apr. 17, 2012 entitled SYSTEMS AND METHODS FOR IMPLEMENTING EFFICIENT CROSS-FADING BETWEEN COMPRESSED AUDIO STREAMS the entire disclosure of each which is hereby fully incorporated herein by reference. The present application is also a continuation-in-part of (i) PCT/2013/037034, which published as WO 2013/158804, entitled SYSTEMS AND METHODS FOR IMPLEMENTING EFFICIENT CROSS-FADING BETWEEN COMPRESSED AUDIO STREAMS, which also claims the benefit of U.S. Provisional Patent Application Nos. 61/687,049, filed on Apr. 17, 2012, and 61/687,048, filed on Apr. 17, 2012, and (ii) U.S. patent application Ser. No. 14/358,919, filed on May 16, 2014, and entitled SYSTEMS AND METHODS FOR IMPLEMENTING CROSS-FADING, INTERSTITIALS AND OTHER EFFECTS DOWNSTREAM, which is a national phase application of PCT/US2012/065943, filed on Nov. 19, 2012, which itself claims the benefit of each of U.S. Provisional Patent Application Nos. (i) 61/561,593, filed on Nov. 18, 2011, (ii) 61/631,440, filed on Jan. 3, 2012, (iii) 61/607,532, filed on Mar. 6, 2012, and (iv) 61/687,049 the entire disclosure of each of which is also hereby fully incorporated herein by reference.
Number | Name | Date | Kind |
---|---|---|---|
5479518 | Zampini | Dec 1995 | A |
5899969 | Fielder | May 1999 | A |
6184937 | Williams et al. | Feb 2001 | B1 |
6262777 | Brewer | Jul 2001 | B1 |
6323914 | Linzer | Nov 2001 | B1 |
6370199 | Bock | Apr 2002 | B1 |
6973130 | Wee | Dec 2005 | B1 |
7302396 | Cooke | Nov 2007 | B1 |
7571016 | Rahman | Aug 2009 | B2 |
7908172 | Corts et al. | Mar 2011 | B2 |
8026918 | Murphy | Sep 2011 | B1 |
8156526 | Lee | Apr 2012 | B2 |
8359382 | Gailloux | Jan 2013 | B1 |
8458595 | Margulis | Jun 2013 | B1 |
8655854 | Claman et al. | Feb 2014 | B2 |
8724830 | Fedigan | May 2014 | B1 |
8805693 | Lindahl et al. | Aug 2014 | B2 |
8818175 | Dubin et al. | Aug 2014 | B2 |
8938393 | Gunatilake et al. | Jan 2015 | B2 |
8948894 | Bhat | Feb 2015 | B2 |
9330722 | Chang et al. | May 2016 | B2 |
9355649 | King et al. | May 2016 | B2 |
9406303 | Lowe et al. | Aug 2016 | B2 |
20010002183 | Kimura | May 2001 | A1 |
20020105951 | Hannuksela et al. | Aug 2002 | A1 |
20020133357 | McLean | Sep 2002 | A1 |
20020159375 | Eguchi et al. | Oct 2002 | A1 |
20030033325 | Boogaard | Feb 2003 | A1 |
20040117822 | Karaoguz et al. | Jun 2004 | A1 |
20050201723 | Islam | Sep 2005 | A1 |
20050249336 | Basir et al. | Nov 2005 | A1 |
20060093038 | Boyce | May 2006 | A1 |
20060192478 | Basu | Aug 2006 | A1 |
20060271372 | Escott | Nov 2006 | A1 |
20080046953 | Kossila | Feb 2008 | A1 |
20080165985 | Hsu et al. | Jul 2008 | A1 |
20080195695 | Tanaka | Aug 2008 | A1 |
20080249644 | Jehan | Oct 2008 | A1 |
20080270523 | Parmar et al. | Oct 2008 | A1 |
20090024234 | Archibald | Jan 2009 | A1 |
20090163183 | O'Donoghue et al. | Jun 2009 | A1 |
20090228423 | Hicken et al. | Sep 2009 | A1 |
20100010997 | Amidon et al. | Jan 2010 | A1 |
20100030859 | Huang | Feb 2010 | A1 |
20100063825 | Williams | Mar 2010 | A1 |
20100142730 | Lindahl | Jun 2010 | A1 |
20110138299 | Pugsley et al. | Jun 2011 | A1 |
20110211812 | Tzoukermann et al. | Sep 2011 | A1 |
20110268424 | Holland et al. | Nov 2011 | A1 |
20120038762 | Davidson | Feb 2012 | A1 |
20120046954 | Lindahl et al. | Feb 2012 | A1 |
20120259642 | Takada | Oct 2012 | A1 |
20130073983 | Rasmussen et al. | Mar 2013 | A1 |
20130131507 | Salazar-Ferrer et al. | May 2013 | A1 |
20130167029 | Friesen et al. | Jun 2013 | A1 |
20140237361 | Martin et al. | Aug 2014 | A1 |
20140316789 | Lowe et al. | Oct 2014 | A1 |
20150128039 | Wieder | May 2015 | A1 |
20150142456 | Lowe et al. | May 2015 | A1 |
20150248219 | Wieder | Sep 2015 | A1 |
20150309844 | Lowe et al. | Oct 2015 | A1 |
20170053660 | Lowe et al. | Feb 2017 | A1 |
Number | Date | Country |
---|---|---|
10-0781513 | Dec 2007 | KR |
10-2009-0025038 | Mar 2009 | KR |
10-0973654 | Aug 2010 | KR |
10-2011-0023490 | Mar 2011 | KR |
02097791 | Dec 2002 | WO |
Entry |
---|
International Search Report, dated Feb. 25, 2013, issued in corresponding Int'l. Appln. No. PCT/US2012/065943. |
Written Opinion, dated Feb. 25, 2013, issued in corresponding Int'l. Appln. No. PCT/US2012/065943. |
International Search Report, dated Jun. 25, 2013, issued in corresponding Int'l. Appln. No. PCT/US2013/029721. |
Written Opinion, dated Jun. 25, 2013, issued in corresponding Int'l. Appln. No. PCT/US2013/029721. |
International Search Report, dated Jul. 26, 2013, issued in corresponding Int'l. Appln. No. PCT/US2013/037034. |
Written Opinion, dated Jul. 26, 2013, issued in corresponding Int'l. Appln. No. PCT/US2013/037034. |
Written Opinion, dated Aug. 23, 2013, issued in corresponding Int'l. Appln. No. PCT/US2013/037013. |
International Search Report, International Application No. PCT/US2013/037013, International Filing Date Apr. 17, 2013, dated Aug. 23, 2013. |
Number | Date | Country | |
---|---|---|---|
20180005667 A1 | Jan 2018 | US |
Number | Date | Country | |
---|---|---|---|
61687049 | Apr 2012 | US | |
61687048 | Apr 2012 | US | |
61607532 | Mar 2012 | US | |
61631440 | Jan 2012 | US | |
61561593 | Nov 2011 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 14516884 | Oct 2014 | US |
Child | 15706820 | US |
Number | Date | Country | |
---|---|---|---|
Parent | PCT/US2013/037034 | Apr 2013 | US |
Child | 14516884 | US | |
Parent | PCT/US2013/037013 | Apr 2013 | US |
Child | PCT/US2013/037034 | US | |
Parent | 14358919 | US | |
Child | PCT/US2013/037013 | US |