This disclosure generally relates to encryption. More particularly, the disclosure relates to encrypted video content.
Some current video playback configurations for playback of video content downloaded from the Internet utilize an encryption mechanism to protect the video content. As an example, when a user would like to play video content on a website, the user may be required to have a video player that includes a scripting code, which may be utilized to initiate and load playback of the video content. The scripting code may be included within a file as part of the video player. The video content may be loaded as an asset into the video player at runtime when downloaded.
Further, the video player may be integrated with advertisements, customer graphics, and other content provider specific information that may be utilized to generate revenue from playback of the video content. Accordingly, content providers and advertisers have to ensure that the video player that is provided to a user is the video player that is utilized to play the provided content so that the advertisements and other revenue generating mechanisms are present in the player utilized by the user to play the content. However, current approaches are vulnerable to users retrieving the scripting code from the provided video player and putting the scripting code into their own video players so that they can avoid the advertisements.
A current approach involves the video player performing a hash on the scripting code and sending the hashed scripting code to a server for verification. However, that approach involves the possibility of the hashed scripting code being intercepted en route from the video player to the server. In other words, a security vulnerability may arise if the hashed scripting code is moved from the video player to the server.
In one aspect of the disclosure, a computer program product is provided. The computer program product includes a computer useable medium having a computer readable program. The computer readable program when executed on a computer causes the computer to receive, at a server, a media content identifier and a media player identifier from a media player through a network. The media content identifier identifies media content. The media player identifier identifies a media player. Further, the computer readable program when executed on the computer causes the computer to provide the media player identifier to a function generator to generate an indicium of the media player identifier. In addition, the computer readable program when executed on the computer causes the computer to perform a first operation on an initialization vector and the indicium to generate a first result. The computer readable program when executed on the computer also causes the computer to perform a second operation on a first subset of plaintext and the first result to generate a second result. The plaintext is the media content. Further, the computer readable program when executed on the computer causes the computer to encrypt the second result with an encryption key to generate a first set of ciphertext.
In another aspect of the disclosure, a process is provided. The process sends, from a video player, a video content identifier and a video player identifier through a network to a server. The video content identifier identifies video content. The video player identifier identifies the video player. Further, the process receives, from the server, a first subset of encrypted video content and an initialization vector. In addition, the process generates a hash of the video player identifier. The process also decrypts the first subset of the encrypted video content with a decryption key to generate a first result. Further, the process performs a first operation on the initialization vector and the hash to generate a second result. In addition, the process performs a second operation on the first result and the second result to generate a first subset of plaintext of video content.
In yet another aspect of the disclosure, system is provided. The system includes a communication module that receives, at a server, a video content identifier and a video player identifier from a video player through a network. The video content identifier identifies video content. The video player identifier identifies a video player. Further, the system includes a hash generator that generates a hash of the video player identifier that is utilized as an initialization vector. In addition, the system includes a processor that (i) performs a first operation on a first subset of plaintext and the initialization vector to generate a first result and (ii) encrypts the first result with an encryption key to generate a first set of ciphertext, the plaintext being the video content.
In another aspect of the disclosure, a computer program product is provided. The computer program product includes a computer useable medium having a computer readable program. The computer readable program when executed on a computer causes the computer to receive, at a server, a video content identifier and a video player identifier from a video player through a network. The video content identifier identifies video content. The video player identifier identifies a video player. Further, the computer readable program when executed on the computer causes the computer to provide the video player identifier to a hash generator to generate a hash of the video player identifier such that the hash is an encryption key. In addition, the computer readable program when executed on the computer causes the computer to encrypt plaintext of the video content with the encryption key to generate ciphertext.
In yet another aspect of the disclosure, a process is provided. The process receives, at a server, a video content identifier and a video player identifier from a video player through a network. The video content identifier identifies video content. The video player identifier identifies a video player. Further, the process provides the video player identifier to a hash generator to generate a hash of the video player. In addition, the process encrypts plaintext of the video content with the encryption key to generate ciphertext. The process also encrypts the encryption key with the hash to generate an encrypted encryption key.
In another aspect of the disclosure, a system is provided. The system includes a communication module that receives, at a server, a video content identifier and a video player identifier from a video player through a network. The video content identifier identifies video content. The video player identifier identifies a video player. Further, the system includes a hash generator that generates a hash of the video player identifier such that the hash is an encryption key. In addition, the system includes a processor that encrypts plaintext of the video content with the encryption key to generate ciphertext.
The above-mentioned features of the present disclosure will become more apparent with reference to the following description taken in conjunction with the accompanying drawings wherein like reference numerals denote like elements and in which:
A configuration is provided that binds encrypted video to a video player. The ‘fingerprint’, e.g., an identifier, of the video player is integrated into the video itself. As a result, the file including a scripting code that initiates download and playback is prevented from being reused, modified, or hosted in alternate locations. Further, the scripting code that is playing back the video is ensured to be the scripting code that was created by the publisher. In addition, the scripting code is maintained securely as a hash of the scripting code is not sent from the video player to the server. The time of validating the video player is also reduced as a hash of the scripting code is not sent from the video player to the server.
In one embodiment, a cryptographic hash is calculated at the time of asset acquisition, i.e., video download, by both the server of the video content and the consumer of the video content, i.e., the video player. This cryptographic hash is then utilized as an encryption parameter for the encryption of the content.
A cipher is an approach utilized for encryption and/or decryption. Further, a block cipher is a cipher that is utilized to encrypt and/or decrypt data of a fixed length, i.e., blocks. An initialization vector is an input provided to a block cipher that may be utilized for randomization. In one embodiment, the hash 110 is utilized as an initialization vector input into a block cipher. Further, the initialization vector, an encryption key, and video content 112 may then be provided to an encryption engine 114. The encryption engine may utilize the initialization vector and the encryption key as inputs to the block cipher to encrypt the video content 112 to generate an encrypted video 116. The encrypted video 116 may then be sent to the video player 102. In one embodiment, the video player 102 knows in advance the hash configuration that was utilized to generate the hash by the video content provider 106 and the block cipher that was utilized to encrypt the encrypted video 116. The video player 102 then calculates the hash 110 and utilizes the hash 110 to decrypt the encrypted video 116.
In one embodiment, a server 118 may comprise the content provider 106, the hash generator 108, and the encryption engine 114. Accordingly, the video player 102 may communicate with the server 118. In another embodiment, some or all of the content provider 106, the hash generator 108, and the encryption engine 114 may be implemented on different computing devices. The hash generator 108 is provided merely as an example of a function generator. The function generator may generate an indicium for the video player ID such as a hash.
The server 118 may incorporate the hash 110 of the video player ID into the protection of the video asset. Any hash configuration may be utilized. The hash 110 of the video player ID is not sent from the client to the server 118. As a result, the hash 110 may be kept or calculated in a secure location on the client and a secure location on the server without being exposed to the outside world. Both the server 118 and the client have the ability to calculate the hash 110 of the video player ID as both the server 118 and the client have access to the video file 104. The server 118 has access to the video file 104 as the server 118 may store copies of all video files and/or corresponding hashes. Further, the client has access to the video file 104 as the client utilizes the video file 104 to play back the video content 112.
By utilizing the hash 110 as a block cipher initialization vector to encrypt the video content 112, a pre-determined key may be utilized for the encryption. As a result, the same encryption key may be utilized any time the video content 112 is encrypted by the encryption engine 114. However, the encryption may be modified on different encryption actions as a result of the hash 110 being inputted into the block cipher.
An additional subset of plaintext 206 may also be encrypted by utilizing the hash 110. Instead of utilizing the initialization vector 202, an operation is performed on the hash 110 and the ciphertext 212. As an example, the operation may be an XOR. A further operation, e.g., an XOR, may then be performed on the result and the additional subset of plaintext 206. The result and the encryption key may then be provided to the block cipher encryption engine 210 for encryption of the result into additional ciphertext 214.
The hashed cipher block chaining may be utilized for the remaining of the blocks of plaintext. As an example, yet another subset of plaintext 208 may be provided to the block cipher encryption engine 210. Instead of utilizing the initialization vector 202, an operation is performed on the hash 110 and the ciphertext 214. As an example, the operation may be an XOR. A further operation, e.g., an XOR, may then be performed on the result and the other subset of plaintext 208. The result and the encryption key may then be provided to the block cipher encryption engine 210 for encryption of the result into additional ciphertext 216.
The illustrated hashed cipher block chaining encryption may be performed according to the following formula: Ci=Ek(Pi XOR (H XOR (Ci−1)), H XOR C0=IV. The variable C is ciphertext, the function E is encryption, the variable P is plaintext, the variable H is hash, and the variable IV is initialization vector. In other words, an XOR is performed on the hash 110 and the initialization vector 202 for the first block of plaintext. An XOR operation is performed on the result and the first block of plaintext. That result is then encrypted. Subsequent blocks of data utilize the ciphertext from the previous block. An XOR operation is performed on the ciphertext from the previous block and the hash 110. Another XOR operation is then performed on that result and the plaintext. Encryption is then performed on that result.
Additional or fewer of blocks of plaintext may be encrypted. The examples provided herein are provided only for illustrative purposes.
A set of data 218 may then be sent to the video player 102. The set of data 218 may include the initialization vector 202 and the various blocks of ciphertext. The video player 202 may then decrypt the blocks of ciphertext by generating the hash 110 and then utilizing the hash, a decryption key, and the initialization vector 202 to decrypt the blocks of ciphertext.
In another embodiment, the hash 110 itself is utilized as the initialization vector 202. Accordingly, an operation would not have to be performed on the hash 110 and the initialization vector 202. Further, the initialization vector 202 would not have to be sent as part of the set of data 118 to the video player 102 as the video player 102 is capable of generating the hash 110.
In one embodiment, the encryption methodology that is utilized is symmetrical encryption. Accordingly, the same key may be utilized both for encryption and decryption. As a result, the client and the server may both store the same key. In another embodiment, the encryption methodology that is utilized is asymmetrical. Accordingly, different keys are utilized for encryption and decryption. Therefore, the server may store an encryption key whereas the client may store a decryption key.
The subsequent blocks utilize the ciphertext of the previous block rather than the initialization vector 202. The block cipher decryption engine 302 utilizes a key to decrypt the block of ciphertext 214. Further, an operation is performed on the decrypted result. The operation may be an XOR operation or a variety of other operations. In addition, an operation, e.g., an XOR operation, is performed on the previous block of ciphertext 212 and the hash 110. An operation, e.g., an XOR operation, is performed on that result and the decrypted result to generate the subset of plaintext 206.
In addition, the block cipher decryption engine 302 utilizes a key to decrypt the block of ciphertext 216. Further, an operation is performed on the decrypted result. The operation may be an XOR operation or a variety of other operations. In addition, an operation, e.g., an XOR operation, is performed on the previous block of ciphertext 214 and the hash 110. An operation, e.g., an XOR operation, is performed on that result and the decrypted result to generate the subset of plaintext 208.
In another embodiment, the hash 110 itself is utilized as the initialization vector 202. Accordingly, an operation would not have to be performed on the hash 110 and the initialization vector 202.
The illustrated hashed cipher block chaining decryption may be performed according to the following formula: Pi=Dk(Ci XOR (H XOR (Ci−1)), H XOR C0=IV. The variable C is ciphertext, the function D is encryption, the variable P is plaintext, the variable H is hash, and the variable IV is initialization vector. In other words, a decryption of the first block of ciphertext is performed. An XOR is performed on that result and the result of an XOR performed on the initialization vector 202 and the hash 110 to generate the first set of plaintext. Subsequent blocks of data utilize the ciphertext from the previous block. An XOR operation is performed on the ciphertext from the previous block and the hash 110. Another XOR operation is then performed on that result and the decrypted subsequent block of ciphertext. Encryption is then performed on that result.
Any of the configurations described herein may be utilized with a variety of computing devices. A computing device may be personal computer (“PC”), laptop, notebook, smartphone, cell phone, tablet device, personal digital assistant (“PDA”), kiosk, or the like.
The Input/Output (“I/O”) devices 508 can be coupled directly to the system configuration 500 or through intervening input/output controllers. Further, the I/O devices 508 may include a keyboard, a keypad, a mouse, a microphone for capturing speech commands, a pointing device, and other user input devices that will be recognized by one of ordinary skill in the art. Further, the I/O devices 508 may include output devices such as a printer, display screen, or the like. Further, the I/O devices 508 may include a receiver, transmitter, speaker, display, image capture sensor, biometric sensor, etc. In addition, the I/O devices 508 may include storage devices such as a tape drive, floppy drive, hard disk drive, compact disk (“CD”) drive, etc. Any of the modules described herein may be single monolithic modules or modules with functionality distributed in a cloud computing infrastructure utilizing parallel and/or pipeline processing.
Network adapters may also be coupled to the system configuration 500 to enable the system configuration 500 to become coupled to other systems, remote printers, or storage devices through intervening private or public networks. Modems, cable modems, and Ethernet cards are just a few of the currently available types of network adapters.
In yet another embodiment, the video player 102 may be utilized to protect the video content without a hashed block cipher methodology as described with respect to
The processes described herein may be implemented in a general, multi-purpose or single purpose processor. Such a processor will execute instructions, either at the assembly, compiled or machine-level, to perform the processes. Those instructions may be written by one of ordinary skill in the art following the description of the figures corresponding to the processes and stored or transmitted on a computer readable medium. The instructions may also be created utilizing source code or any other known computer-aided design tool. A computer readable medium may be any medium capable of carrying those instructions and include a CD-ROM, DVD, magnetic or other optical disc, tape, silicon memory (e.g., removable, non-removable, volatile or non-volatile), packetized or non-packetized data through wireline or wireless transmissions locally or remotely through a network. A computer is herein intended to include any device that has a general, multi-purpose or single purpose processor as described above. Further, the system configuration 500 may be utilized to implement the process 700 illustrated in
Although an example of a video player has been illustrated, various other types of media players may be utilized. Further, various other types of media identifiers other than video identifiers may be utilized.
It should be understood that the computer program products, processes, apparatuses, and systems described herein can take the form of entirely hardware embodiments, entirely software embodiments, or embodiments containing both hardware and software elements. If software is utilized to implement the method or system, the software may include but is not limited to firmware, resident software, microcode, etc.
It is understood that the computer program products, processes, apparatuses, and systems described herein may also be applied in other types of computer program products, processes, apparatuses, and systems. Those skilled in the art will appreciate that the various adaptations and modifications of the embodiments of the computer program products, processes, apparatuses, and systems described herein may be configured without departing from the scope and spirit of the present computer program products, processes, apparatuses, and systems. Therefore, it is to be understood that, within the scope of the appended claims, the present computer program products, processes, apparatuses, and systems may be practiced other than as specifically described herein.
Number | Name | Date | Kind |
---|---|---|---|
5671283 | Michener et al. | Sep 1997 | A |
6122375 | Takaragi et al. | Sep 2000 | A |
6266412 | Berenzweig et al. | Jul 2001 | B1 |
6333983 | Enichen et al. | Dec 2001 | B1 |
6370247 | Takaragi et al. | Apr 2002 | B1 |
6480957 | Liao et al. | Nov 2002 | B1 |
6778667 | Bakhle et al. | Aug 2004 | B1 |
6792113 | Ansell et al. | Sep 2004 | B1 |
6804355 | Graunke | Oct 2004 | B1 |
7003107 | Ananth | Feb 2006 | B2 |
7103181 | Ananth | Sep 2006 | B2 |
7142669 | Dworkin et al. | Nov 2006 | B2 |
7200226 | Bace | Apr 2007 | B2 |
7213156 | Fukuda | May 2007 | B2 |
7218733 | Li et al. | May 2007 | B2 |
7221756 | Patel et al. | May 2007 | B2 |
7269664 | Hutsch et al. | Sep 2007 | B2 |
7269854 | Simmons et al. | Sep 2007 | B2 |
7350070 | Smathers et al. | Mar 2008 | B2 |
7412060 | Fukuda | Aug 2008 | B2 |
7418100 | McGrew et al. | Aug 2008 | B2 |
7536016 | Benaloh | May 2009 | B2 |
7603563 | Ansell et al. | Oct 2009 | B2 |
7636691 | Maari | Dec 2009 | B2 |
7680269 | Nicolai et al. | Mar 2010 | B2 |
7693278 | Hiramatsu et al. | Apr 2010 | B2 |
7715591 | Owechko et al. | May 2010 | B2 |
7757299 | Robert et al. | Jul 2010 | B2 |
7827408 | Gehringer et al. | Nov 2010 | B1 |
7836311 | Kuriya et al. | Nov 2010 | B2 |
7861312 | Lee et al. | Dec 2010 | B2 |
7884854 | Banner et al. | Feb 2011 | B2 |
8051287 | Shetty et al. | Nov 2011 | B2 |
8082592 | Harris | Dec 2011 | B2 |
8095795 | Levy | Jan 2012 | B2 |
8099519 | Ueda et al. | Jan 2012 | B2 |
8130952 | Shamoon et al. | Mar 2012 | B2 |
8184182 | Lee et al. | May 2012 | B2 |
8189769 | Ramasamy et al. | May 2012 | B2 |
8245033 | Shetty et al. | Aug 2012 | B1 |
8291219 | Eto | Oct 2012 | B2 |
8300812 | Van De Ven | Oct 2012 | B2 |
8345976 | Wang et al. | Jan 2013 | B2 |
8417806 | Chawla et al. | Apr 2013 | B2 |
8428390 | Li et al. | Apr 2013 | B2 |
8520083 | Webster et al. | Aug 2013 | B2 |
8619082 | Ciurea et al. | Dec 2013 | B1 |
20020154779 | Asano et al. | Oct 2002 | A1 |
20040030656 | Kambayashi et al. | Feb 2004 | A1 |
20050015343 | Nagai et al. | Jan 2005 | A1 |
20050201591 | Kiselewich | Sep 2005 | A1 |
20050232463 | Hirvonen et al. | Oct 2005 | A1 |
20060078194 | Fradkin et al. | Apr 2006 | A1 |
20060173846 | Omae et al. | Aug 2006 | A1 |
20080120230 | Lebegue et al. | May 2008 | A1 |
20090125726 | Iyer et al. | May 2009 | A1 |
20090259684 | Knight et al. | Oct 2009 | A1 |
20090276628 | Cho et al. | Nov 2009 | A1 |
20090279697 | Schneider | Nov 2009 | A1 |
20090290710 | Tkachenko et al. | Nov 2009 | A1 |
20090307489 | Endoh | Dec 2009 | A1 |
20090315670 | Naressi et al. | Dec 2009 | A1 |
20100105454 | Weber et al. | Apr 2010 | A1 |
20100153747 | Asnaashari et al. | Jun 2010 | A1 |
20100172567 | Prokoski | Jul 2010 | A1 |
20100246816 | Thomas et al. | Sep 2010 | A1 |
20100257368 | Yuen | Oct 2010 | A1 |
20100279766 | Pliska et al. | Nov 2010 | A1 |
20110131219 | Martin-Cocher et al. | Jun 2011 | A1 |
20110161669 | Eto | Jun 2011 | A1 |
20120042167 | Marking et al. | Feb 2012 | A1 |
20120173865 | Swaminathan | Jul 2012 | A1 |
20120173880 | Swaminathan | Jul 2012 | A1 |
20120216300 | Vivolo et al. | Aug 2012 | A1 |
20120321172 | Jachalsky et al. | Dec 2012 | A1 |
20130132733 | Agrawal et al. | May 2013 | A1 |
20130142331 | Schultz | Jun 2013 | A1 |
20130191491 | Kotha et al. | Jul 2013 | A1 |
20140023291 | Lin | Jan 2014 | A1 |
20140119643 | Price | May 2014 | A1 |
20140135962 | King et al. | May 2014 | A1 |
20140136976 | King et al. | May 2014 | A1 |
20140140626 | Cho | May 2014 | A1 |
20140142947 | King | May 2014 | A1 |
20140148933 | King | May 2014 | A1 |
20140152776 | Cohen | Jun 2014 | A1 |
20140153816 | Cohen | Jun 2014 | A1 |
20140168215 | Cohen | Jun 2014 | A1 |
20140169660 | Cohen | Jun 2014 | A1 |
20140177903 | Price | Jun 2014 | A1 |
20140201630 | Bryan | Jul 2014 | A1 |
Number | Date | Country |
---|---|---|
WO 2010086317 | Aug 2010 | WO |
Entry |
---|
“Time Domain Pitch Scaling using Synchronous Overlap and Add”, retrieved from <http://homepages.inspire.net.nz/˜jamckinnon/report/sola.htm> on Nov. 12, 2012, 3 pages. |
“Waveform Similarity Based Overlap-Add (WSOLA)”, retrieved from <http://www.pjsip.org/pjmedia/docs/html/group—PJMED—WSOLA.htm> on Nov. 12, 2012, 4 pages. |
De Gotzen, Amalia et al., “Traditional (?) Implementations of a Phase-Vocoder: The Tricks of the Trade”, Proceedings of the Cost G-6 Conference on Digital Audio Effects (DAFX-00), Verona, Italy, Dec. 7-9, 2000, retrieved from <http://128.112.136.35/courses/archive/spring09/cos325/Bernardini.pdf> on Nov. 12, 2012,(Dec. 7, 2000),7 pages. |
Dolson, Mark “The Phase Vocoder: A Tutorial”, retrieved from <http://www.panix.com/˜jens/pvoc-dolson.par> on Nov. 12, 2012, 11 pages. |
Gutierrez-Osuna, Ricardo “L19: Prosodic Modificatin of Speech”, Lecture based on [Taylor, 2009, ch. 14; Holmes, 2001, ch. 5; Moulines and Charpentier, 1990], retrieved from <http://research.cs.tamu.edu/prism/lectures/sp/I19.pdf> on Nov. 12, 2012,35 pages. |
He, et al., “Corner detector based on global and local curvature properties”, Retrieved from <http://hub.hku.hk/bitstream/10722/57246/1/142282.pdf> on Dec. 21, 2012, (May 2008),13 pages. |
Hirsch, et al., “Fast Removal of Non-uniform Camera Shake”, Retrieved from <http://webdav.is.mpg.de/pixel/fast—removal—of—camera—shake/files/Hirsch—ICCV2011—Fast%20removal%20of%20non-uniform%20camera%20shake.pdf> on Dec. 21, 2012, 8 pages. |
Jia, Jiaya “Single Image Motion Deblurring Using Transparency”, Retrieved from <http://www.cse.cuhk.edu.hk/˜leojia/all—final—papers/motion—deblur—cvpr07.pdf> on Dec. 21, 2012, 8 pages. |
Klingbeil, Michael “SPEAR: Sinusoidal Partial Editing Analysis and Resynthesis”, retrieved from <http://www.klingbeil.com/spear/> on Nov. 12, 2012, 3 pages. |
Levin, et al., “Image and Depth from a Conventional Camera with a Coded Aperture”, ACM Transactions on Graphics, SIGGRAPH 2007 Conference Proceedings, San Diego, CA, Retrieved from <http://groups.csail.mit.edu/graphics/CodedAperture/CodedAperture-LevinEtAl-SIGGRAPH07.pdf> on Dec. 21, 2012,(2007), 9 pages. |
McAulay, R. J., et al., “Speech Processing Based on a Sinusoidal Model”, The Lincoln Laboratory Journal, vol. 1, No. 2, 1998, retrieved from <http://www.II.mit.edu/publications/journal/pdf/vol01—no2/1.2.3.speechprocessing.pdf> on Nov. 12, 2012,(1988), pp. 153-168. |
Moinet, Alexis et al., “PVSOLA: A Phase Vocoder with Synchronized Overlap-Add”, Proc. of the 14th Int. Conference on Digital Audio Effects (DAFx-11), Paris, France, Sep. 19-23, 2011, retrieved from <http://tcts.fpms.ac.be/publications/papers/2011/dafx2011—pvsola—amtd.pdf> on Nov. 12, 2012,(Sep. 19, 2011), 7 pages. |
Patton, Joshua “ELEC 484 Project—Pitch Synchronous Overlap-Add”, retrieved from <http://www.joshpatton.org/yeshua/Elec484/Elec484—files/ELEC%20484%20-%20PSOLA%20Final%20Project%20Report.pdf> on Nov. 12, 2012, 11 pages. |
Rodet, Xavier “Musical Sound Signal Analysis/Synthesis: Sinusoidal+Residual and Elementary Waveform Models”, TFTS'97 (IEEE Time-Frequency and Time-Scale Workshop 97), Coventry, Grande Bretagne, août, 1997, retrieved from <http://articles.ircam.fr/textes/Rodet97e/index.html> on Nov. 12, 2012,(1997), 16 pages. |
Roelands, Marc et al., “Waveform Similarity Based Overlap-Add (WSOLA) for Time-Scale Modification of Speech: Structures and Evaluation”, retrieved from <http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.58.1356> on Nov. 12, 2012, 4 pages. |
Serra, Xavier “A System for Sound Analysis/Transformation/Synthesis Based on a Deterministic Plus Stochastic Decomposition”, retrieved from <https://ccrma.stanford.edu/files/papers/stanm58.pdf> on Nov. 12, 2012, (Oct. 1989), 166 pages. |
Serra, Xavier “Approaches to Sinusoidal Plus Residual Modeling”, retrieved from <http://www.dtic.upf.edu/˜xserra/cursos/CCRMA-workshop/lectures/7-SMS-related-research.pdf> on Nov. 12, 2012, 21 pages. |
Serra, Xavier “Musical Sound Modeling with Sinusoids Plus Noise”, published in C. roads, S. Pope, A. Picialli, G. De Poli, editors. 1997. “Musical Signal Processing”, Swets & Zeitlinger Publsihers, retrieved from <http://web.media.mit.edu/˜tristan/Classes/MAS.945/Papers/Technical/Serra—SMS—97.pdf> on Nov. 12, 2012, (1997), 25 pages. |
Smith III, Julius O., “MUS421/EE367B Applications Lecture 9C: Time Scale Modification (TSM) and Frequency Scaling/Shifting”, retrieved from <https://ccrma.stanford.edu/˜jos/TSM/TSM.pdf> on Nov. 12, 2012, (Mar. 8, 2012), 15 pages. |
Upperman, Gina “Changing Pitch with PSOLA for Voice Conversion”, retrieved from <http://cnx.org/content/m12474/latest/?collection=col10379/1.1> on Nov. 12, 2012, 1 page. |
Verhelst, Werner “Overlap-Add Methods for Time-Scaling of Speech”, retrieved from <http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.128.7991> on Nov. 12, 2012, 25 pages. |
Verhelst, Werner et al., “An Overlap-Add Technique Based on Waveform Similarity (WSOLA) for High Quality Time-Scale Modification of Speech”, retrieved from <http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.202.5460&rep=rep1&type=pdf> on Nov. 12, 2012, 4 pages. |
Yuan, et al., “Image Deblurring with Blurred/Noisy Image Pairs”, Retrieved from <http://www.cs.ust.hk/˜quan/publications/yuan-deblur-siggraph07.pdf> on Dec. 21, 2012, 9 pages. |
“Non-Final Office Action”, U.S. Appl. No. 13/310,032, (Jan. 3, 2013),18 pages. |
“Final Office Action”, U.S. Appl. No. 13/310,032, Oct. 31, 2013, 21 pages. |
Felzenszwalb, et al., “Efficient Belief Propagation for Early Vision”, International Journal of Computer Vision, 70(1), 2006, pp. 41-54. |
Gastal, et al., “Shared Sampling for Real-Time Alpha Matting”, Eurographics 2010, vol. 29, No. 2, 2010, 10 pages. |
He, et al., “A Global Sampling Method for Alpha Matting”, CVPR 2011, pp. 2049-2056. |
Kubo, et al., “Characterization of the Tikhonov Regularization for Numerical Analysis of Inverse Boundary Value Problems by Using the Singular Value Decomposition”, Inverse Problems in Engineering Mechanics, 1998, pp. 337-344. |
Levin, et al., “A Closed Form Solution to Natural Image Matting”, CVPR, 2006, 8 pages. |
Park, et al., “Extracting Salient Keywords from Instructional Videos Using Joint Text, Audio and Visual Cues”, Proceedings of the Human Language Technology Conference of the North American Chapter of the ACL, Association for Computational Linguistics, Jun. 2006, pp. 109-112. |
Radhakrishnan, et al., “A Content-Adaptive Analysis and Representation Framework for Audio Event Discovery from “Unscripted” Multimedia”, Hindawi Publishing Corporation, EURASIP Journal on Applied Signal Processing, vol. 2006, Article ID 89013, 2006, 24 pages. |
Smaragdis, “A Probabilistic Latent Variable Model for Acoustic Modeling”, NIPS, 2006, 6 pages. |
Smaragdis, “Supervised and Semi-Supervised Separation of Sounds from Single-Channel Mixtures”, ICA'07 Proceedings of the 7th international conference on Independent component analysis and signal separation, 2007, 8 pages. |
Smith, et al., “Blue Screen Matting”, SIGGRAPH 96 Conference Proceedings, Aug. 1996, 10 pages. |
Yang, et al., “A Constant-Space Belief Propagation Algorithm for Stereo Matching”, CVPR, 2010, 8 pages. |
“Non-Final Office Action”, U.S. Appl. No. 13/310,032, Mar. 7, 2014, 21 pages. |
“Non-Final Office Action”, U.S. Appl. No. 13/690,755, Mar. 28, 2014, 7 pages. |
“Restriction Requirement”, U.S. Appl. No. 13/660,159, Jun. 12, 2014, 6 pages. |
“Notice of Allowance”, U.S. Appl. No. 13/310,032, Aug. 26, 2014, 6 pages. |
“Final Office Action”, U.S. Appl. No. 13/690,755, Sep. 10, 2014, 7 pages. |
“Non-Final Office Action”, U.S. Appl. No. 13/680,952, Aug. 4, 2014, 8 pages. |
Zhu, et al.,' “Fusion of Time-of-Flight Depth and Stereo for High Accuracy Depth Maps”, IEEE Conference on Computer Vision and Pattern Recognition, Jun. 23, 2008, 8 pages. |
Number | Date | Country | |
---|---|---|---|
20130142330 A1 | Jun 2013 | US |