This disclosure relates generally to network streaming services, and, more particularly, to methods, apparatus, and articles of manufacture to identify sources of network streaming services.
Audience measurement entities (AMEs) perform, for example, audience measurement, audience categorization, measurement of advertisement impressions, measurement of media exposure, etc., and link such measurement information with demographic information. AMEs can determine audience engagement levels for media based on registered panel members. That is, an AME enrolls people who consent to being monitored into a panel. The AME then monitors those panel members to determine media (e.g., television programs or radio programs, movies, DVDs, advertisements (ads), websites, etc.) exposed to those panel members.
Wherever possible, the same reference numbers will be used throughout the drawing(s) and accompanying written description to refer to the same or like parts. Connecting lines or connectors shown in the various figures presented are intended to represent example functional relationships and/or physical or logical couplings between the various elements.
AMEs typically identify the source of media (e.g., television programs or radio programs, movies, DVDs, advertisements (ads), websites, etc.) when measuring exposure to the media. In some examples, media has imperceptible audience measurement codes embedded therein (e.g., in an audio signal portion) that allow the media and a source of the media to be determined. However, media delivered via a network streaming service (e.g., NETFLIX®, HULU®, YOUTUBE®, AMAZON PRIME®, APPLE TV®, etc.) may not include audience measurement codes, rendering identification of media source difficult.
It has been advantageously discovered that, in some instances, different sources of streaming media (e.g., NETFLIX®, HULU®, YOUTUBE®, AMAZON PRIME®, APPLE TV®, etc.) use different audio compression configurations to store and stream the media they host. In some examples, an audio compression configuration is a set of one or more parameters, settings, etc. that define, among possibly other things, an audio coding format (e.g., a combination of an audio coder-decoder (codec) (MP1, MP2, MP3, AAC, AC-3, Vorbis, WMA, DTS, etc.), compression parameters, framing parameters, etc.), signal bandwidth, etc. Because different sources use different audio compression configurations, the sources can be distinguished (e.g., inferred, identified, detected, determined, etc.) based on the audio compression configuration applied to the media. While other methods may be used to distinguish between different sources of streaming media, for simplicity of explanation, the examples disclosed herein assume that different sources are associated with at least different audio compression configurations. The media is de-compressed during playback.
In some examples, an audio compression configuration can be identified from media that has been de-compressed and output using an audio device such as a speaker, and recorded. The recorded audio, which has undergone lossy compression and de-compression, can be re-compressed according to different trial audio coding formats, and/or have its signal bandwidth determined. In some examples, the de-compressed audio signal is (re-)compressed using different trial audio coding formats for compression artifacts. Because compression artifacts become detectable (e.g., perceptible, identifiable, distinct, etc.) when a particular audio coding format matches the audio coding format used during the original encoding, the presence of compression artifacts can be used to identify one of the trial audio coding formats as the audio coding format used originally. While examples disclosed herein only partially re-compress the audio (e.g., perform only the time-frequency analysis stage of compression), full re-compression may be performed.
After the audio coding format is identified, the AME can infer the original source of the audio. Example compression artifacts are discontinuities between points in a spectrogram, a plurality of points in a spectrogram that are small (e.g., below a threshold, relative to other points in the spectrogram), one or more values in a spectrogram having probabilities of occurrence that are disproportionate compared to other values (e.g., a large number of small values), etc. In instances where two or more sources use the same audio coding format and are associated with compression artifacts, the audio coding format may be used to reduce the number of sources to consider. In such examples, other audio compression configuration aspects (e.g., signal bandwidth) can be used to further distinguish between sources.
Additionally, and/or alternatively, a signal bandwidth of the de-compressed audio signal can be used separately, or in combination, to infer the original source of the audio, and/or to distinguish between sources identified using other audio compression configuration settings (e.g., audio coding format). In some examples, the signal bandwidth is identified by computing frequency components (e.g., using a discrete Fourier transform (DFT), a fast Fourier transform (FFT), etc.) of the de-compressed audio signal. The frequency components are, for example, compared to a threshold to identify a high-frequency cut-off of the de-compressed audio signal. The high-frequency cut-off represents a signal bandwidth of the de-compressed audio signal, which can be used to infer the signal bandwidth of the original audio compression. The bandwidth of the original audio compression can be used to determine the source of the original audio, and/or to distinguish between sources identified using other audio compression configuration settings (e.g., audio coding format).
Additionally, and/or alternatively, combinations of audio compression configuration aspects can be used to infer the original source of audio. For example, a combination of any of signal bandwidth, audio coding format, audio codec, framing parameters, and/or compression parameters. In some examples, confidence scores are computed for components of an audio compression configuration and used to, for example, to compute a weighted sum, to compute a majority vote, etc. that is used to infer the original source of the audio.
Reference will now be made in detail to non-limiting examples of this disclosure, examples of which are illustrated in the accompanying drawings. The examples are described below by referring to the drawings.
To present (e.g., playback, output, display, etc.) media, the example environment 100 of
To present (e.g., playback, output, etc.) audio (e.g., a song, an audio portion of a video, etc.), the example media presentation device 120 includes an example audio de-compressor 124, and an example audio output device 126. The example audio de-compressor 124 de-compresses the audio signal 110 to form de-compressed audio 128. In some examples, the audio compressor 116 specifies to the audio de-compressor 124 in the compressed audio signal 110 the audio compression configuration used by the audio compressor 116 to compress the audio. The de-compressed audio 128 is output by the example audio output device 126 as an audible signal 130. Example audio output devices 126 include, but are not limited, a speaker, an audio amplifier, headphones, etc. While not shown, the example media presentation device 120 may include additional output devices, ports, etc. that can present signals such as video signals. For example, a television includes a display panel, a set-top box includes video output ports, etc.
To record the audible signal 130, the example environment 100 of
To identify the media source 112 associated with the audible signal 130, the example AME 102 includes one or more parameter identifiers (e.g., an example audio coding format identifier 136, an example signal bandwidth identifier 138, etc.) and an example source identifier 140. The example audio coding format identifier 136 of
The example signal bandwidth identifier 138 of
The example source identifier 140 of
To store (e.g., buffer, hold, etc.) incoming samples of the recorded audio signal 134, the example audio coding format identifier 136 includes an example buffer 202. The example buffer 202 of
To perform time-frequency analysis, the example audio coding format identifier 136 includes an example time-frequency analyzer 204. The example time-frequency analyzer 204 of
To obtain portions of the example buffer 202, the example audio coding format identifier 136 includes an example windower 206. The example windower 206 of
To convert the samples obtained and windowed by the windower 206 to a spectrogram (three of which are designated at reference numeral 302, 304 and 306), the example coding format identifier 136 of
To compute compression artifacts, the example audio coding format identifier 136 of
To compute an average of the values of a spectrogram 302, 304 and 306, the artifact computer 210 of
To detect the small values, the example artifact computer 210 includes an example differencer 214. The example differencer 214 of
To identify the largest difference D1, D2, . . DN/2 between the averages A1, A2, . . . AN/2+1 of spectrograms 302, 304 and 306, the example artifact computer 210 of
A peak in the differences D1, D2, . . . DN/2 nominally occurs every T samples in the signal. In some examples, T is the hop size of the time-frequency analysis stage of a coding format, which is typically half of the window length L. In some examples, confidence scores 308 and offsets 310 from multiple blocks of samples of a longer audio recording are combined to increase the accuracy of coding format identification. In some examples, blocks with scores under a chosen threshold are ignored. In some examples, the threshold can be a statistic computed from the differences, for example, the maximum divided by the mean. In some examples, the differences can also be first normalized, for example, by using the standard score. To combine confidence scores 308 and offsets 310, the example audio coding format identifier 136 includes an example post processor 220. The example post processor 220 of
To store sets of audio compression configurations, the example coding format identifier 136 of
The audio compression configurations may be stored in the example audio compression configurations data store 224 using any number and/or type(s) of data structure(s). The audio compression configurations data store 224 may be implemented using any number and/or type(s) of non-volatile, and/or volatile computer-readable storage device(s) and/or storage disk(s). The example controller 226 of
While an example implementation of the coding format identifier 136 is shown in
A flowchart representative of example hardware logic, machine-readable instructions, hardware implemented state machines, and/or any combination thereof for implementing the example AME 102 of
The example program of
A flowchart representative of example hardware logic, machine-readable instructions, hardware implemented state machines, and/or any combination thereof for implementing the example audio coding format identifier 136 of
The example program of
U.S. patent application Ser. No. 15/899,220, which was filed on Feb. 19, 2018, and U.S. patent application Ser. No. 15/942,369, which was filed on Mar. 30, 2018, disclose methods and apparatus for efficient computation of multiple transforms for different windowed portions, blocks, etc. of an input signal. For example, the teachings of U.S. patent application Ser. No. 15/899,220, and U.S. patent application Ser. No. 15/942,369 can be used to efficiently compute sliding transforms that can be used to reduce the computations needed to compute the transforms for different combinations of starting samples and window functions in, for example, block 606 to block 612 of
When all blocks have been processed (block 622), the example post processor 220 translates the confidence score 308 and offset 310 pairs for the currently considered trial audio coding format set into polar coordinates, and computes a circular mean of the pairs in polar coordinates as an overall confidence score for the currently considered audio coding format (block 624).
When all trial audio coding formats have been processed (block 626), the controller 226 identifies the trial audio coding format with the largest overall confidence score as the audio coding format applied by the audio compressor 116 (block 628). Control then exits from the example program of
To compute signal frequency information, the example signal bandwidth identifier 138 includes an example transformer 804. The example transformer 804 of
U.S. patent application Ser. No. 15/899,220, which was filed on Feb. 19, 2018, and U.S. patent application Ser. No. 15/942,369, which was filed on Mar. 30, 2018, disclose methods and apparatus for efficient computation of multiple transforms for different windowed portions, blocks, etc. of an input signal. For example, the teachings of U.S. patent application Ser. No. 15/899,220, and U.S. patent application Ser. No. 15/942,369 can be used to efficiently compute sliding transforms that can be used to reduce the computations needed to compute the transforms for different window locations and/or window functions in, for example, the transformer 804 of
To identify the cutoff frequency for each frequency spectrum 902 (one of which is designated at reference numeral 912), the example signal bandwidth identifier 138 includes an example thresholder 806. The example thresholder 806 of
To reduce noise, the example signal bandwidth identifier 138 includes an example smoother 808. The example smoother 808 of
To identify the overall cutoff frequency for the recorded audio signal 134, the example signal bandwidth identifier 138 includes an example cutoff identifier 810. The example cutoff identifier 810 of
While an example implementation of the signal bandwidth identifier 138 is shown in
A flowchart representative of example hardware logic, machine-readable instructions, hardware implemented state machines, and/or any combination thereof for implementing the example AME 102 of
The example program of
A flowchart representative of example hardware logic, machine-readable instructions, hardware implemented state machines, and/or any combination thereof for implementing the example signal bandwidth identifier 138 of
The example program of
A flowchart representative of example hardware logic, machine-readable instructions, hardware implemented state machines, and/or any combination thereof for implementing the example AME 102 of
The example program of
“Including” and “comprising” (and all forms and tenses thereof) are used herein to be open ended terms. Thus, whenever a claim employs any form of “include” or “comprise” (e.g., comprises, includes, comprising, including, having, etc.) as a preamble or within a claim recitation of any kind, it is to be understood that additional elements, terms, etc. may be present without falling outside the scope of the corresponding claim or recitation. As used herein, when the phrase “at least” is used as the transition term in, for example, a preamble of a claim, it is open-ended in the same manner as the term “comprising” and “including” are open ended. The term “and/or” when used, for example, in a form such as A, B, and/or C refers to any combination or subset of A, B, C such as (1) A alone, (2) B alone, (3) C alone, (4) A with B, (5) A with C, (6) B with C, and (7) A with B and with C. As used herein in the context of describing structures, components, items, objects and/or things, the phrase “at least one of A and B” is intended to refer to implementations including any of (1) at least one A, (2) at least one B, and (3) at least one A and at least one B. Similarly, as used herein in the context of describing structures, components, items, objects and/or things, the phrase “at least one of A or B” is intended to refer to implementations including any of (1) at least one A, (2) at least one B, and (3) at least one A and at least one B. As used herein in the context of describing the performance or execution of processes, instructions, actions, activities and/or steps, the phrase “at least one of A and B” is intended to refer to implementations including any of (1) at least one A, (2) at least one B, and (3) at least one A and at least one B. Similarly, as used herein in the context of describing the performance or execution of processes, instructions, actions, activities and/or steps, the phrase “at least one of A or B” is intended to refer to implementations including any of (1) at least one A, (2) at least one B, and (3) at least one A and at least one B.
The processor platform 1300 of the illustrated example includes a processor 1310. The processor 1310 of the illustrated example is hardware. For example, the processor 1310 can be implemented by one or more integrated circuits, logic circuits, microprocessors, GPUs, DSPs or controllers from any desired family or manufacturer. The hardware processor may be a semiconductor based (e.g., silicon based) device. In this example, the processor implements the example time-frequency analyzer 204, the example windower 206, the example transformer 208, the example artifact computer 210, the example averager 212, the example differencer 214, the example peak identifier 216, the example post processor 220, the example controller 226, the example transformer 804, the example thresholder 806, the example smoother 808, and the example cutoff identifier 810.
The processor 1310 of the illustrated example includes a local memory 1312 (e.g., a cache). The processor 1310 of the illustrated example is in communication with a main memory including a volatile memory 1314 and a non-volatile memory 1316 via a bus 1318. The volatile memory 1314 may be implemented by Synchronous Dynamic Random-access Memory (SDRAM), Dynamic Random-access Memory (DRAM), RAMBUS® Dynamic Random-access Memory (RDRAM®) and/or any other type of random-access memory device. The non-volatile memory 1316 may be implemented by flash memory and/or any other desired type of memory device. Access to the main memory 1314, 1316 is controlled by a memory controller (not shown). In this example, the local memory 1312 and/or the memory 1314 implements the buffer 202.
The processor platform 1300 of the illustrated example also includes an interface circuit 1320. The interface circuit 1320 may be implemented by any type of interface standard, such as an Ethernet interface, a universal serial bus (USB) interface, a Bluetooth® interface, a near field communication (NFC) interface, and/or a peripheral component interface (PCI) express interface.
In the illustrated example, one or more input devices 1322 are connected to the interface circuit 1320. The input device(s) 1322 permit(s) a user to enter data and/or commands into the processor 1310. The input device(s) can be implemented by, for example, an audio sensor, a microphone, a camera (still or video), a keyboard, a button, a mouse, a touchscreen, a track-pad, a trackball, isopoint and/or a voice recognition system.
One or more output devices 1324 are also connected to the interface circuit 1320 of the illustrated example. The output devices 1324 can be implemented, for example, by display devices (e.g., a light emitting diode (LED), an organic light emitting diode (OLED), a liquid crystal display (LCD), a cathode ray tube display (CRT), an in-plane switching (IPS) display, a touchscreen, etc.) a tactile output device, a printer, and/or speakers. The interface circuit 1320 of the illustrated example, thus, typically includes a graphics driver card, a graphics driver chip and/or a graphics driver processor.
The interface circuit 1320 of the illustrated example also includes a communication device such as a transmitter, a receiver, a transceiver, a modem, a residential gateway, and/or network interface to facilitate exchange of data with external machines (e.g., computing devices of any kind) via a network 1326 (e.g., an Ethernet connection, a digital subscriber line (DSL), a telephone line, a coaxial cable, a cellular telephone system, a Wi-Fi system, etc.). In some examples of a Wi-Fi system, the interface circuit 1320 includes a radio frequency (RF) module, antenna(s), amplifiers, filters, modulators, etc.
The processor platform 1300 of the illustrated example also includes one or more mass storage devices 1328 for storing software and/or data. Examples of such mass storage devices 1328 include floppy disk drives, hard drive disks, CD drives, Blu-ray disk drives, redundant array of independent disks (RAID) systems, and DVD drives.
Coded instructions 1332 including the coded instructions of
From the foregoing, it will be appreciated that example methods, apparatus and articles of manufacture have been disclosed that identify sources of network streaming services. From the foregoing, it will be appreciated that methods, apparatus and articles of manufacture have been disclosed which enhance the operations of a computer to improve the correctness of and possibility to identify the sources of network streaming services. In some examples, computer operations can be made more efficient, accurate and robust based on the above techniques for performing source identification of network streaming services. That is, through the use of these processes, computers can operate more efficiently by relatively quickly performing source identification of network streaming services. Furthermore, example methods, apparatus, and/or articles of manufacture disclosed herein identify and overcome inaccuracies and inability in the prior art to perform source identification of network streaming services.
Example methods, apparatus, and articles of manufacture to identify the sources of network streaming services are disclosed herein. Further examples and combinations thereof include at least the following.
Example 1 is a method including receiving a first audio signal that represents a decompressed second audio signal, identifying, from the first audio signal, a parameter of an audio compression configuration used to form the decompressed second audio signal, and identifying a source of the decompressed second audio signal based on the identified audio compression configuration.
Example 2 is the method of example 1, further including identifying a signal bandwidth of the first audio signal as the parameter of the audio compression configuration.
Example 3 is the method of example 2, wherein the parameter is a first parameter, and further including identifying, from the first audio signal, an audio coding format used to compress a third audio signal to form the decompressed second audio signal as a second parameter of the audio compression configuration, and identifying the source of the decompressed second audio signal based on the first parameter and the second parameter.
Example 4 is the method of example 1, further including identifying, from the first audio signal, an audio coding format used to compress a third audio signal to form the decompressed second audio signal as the parameter of the audio compression configuration.
Example 5 is an apparatus including a signal bandwidth identifier to identify a signal bandwidth of a received first audio signal representing a decompressed second audio signal, and a source identifier to identify a source of the decompressed second audio signal based on the identified signal bandwidth.
Example 6 is the apparatus of example 5, wherein the signal bandwidth identifier includes a transformer to form a frequency spectrum for a time interval of the received first audio signal, and a thresholder to identify an index representative of a cutoff frequency for the time interval.
Example 7 is the apparatus of example 5, wherein the signal bandwidth identifier includes a transformer to form a plurality of frequency spectrums for respective ones of a plurality of time intervals of the received first audio signal, a thresholder is to identify a plurality of indices representative of cutoff frequencies of respective ones of the plurality of time intervals, and a smoother to determine a median of the plurality of indices, the median representative of an overall cutoff frequency of the received first audio signal.
Example 8 is the apparatus of example 7, wherein the thresholder is to identify an index representative of a cutoff frequency by sequentially comparing values of a frequency spectrum starting with a highest frequency with a threshold until a value of the frequency spectrum exceeds the threshold.
Example 9 is the apparatus of example 5, further including an audio coding format identifier to identify, from the received first audio signal, an audio coding format used to compress a third audio signal to form the decompressed second audio signal, wherein the source identifier is to identify the source of the decompressed second audio signal based on the identified signal bandwidth and the identified audio coding format.
Example 10 is the apparatus of example 9, further including a time-frequency analyzer to perform a first time-frequency analysis of a first block of the received first audio signal according to a first trial audio coding format, and perform a second time-frequency analysis of the first block of the received first audio signal according to a second trial audio coding format, an artifact computer to determine a first compression artifact resulting from the first time-frequency analysis, and determine a second compression artifact resulting from the second time-frequency analysis, and a controller to select between the first trial audio coding format and the second trial audio coding format as the audio coding format based on the first compression artifact and the second compression artifact.
Example 11 is the apparatus of example 10, wherein the time-frequency analyzer performs a third time-frequency analysis of a second block of the received first audio signal according to the first trial audio coding format, and performs a fourth time-frequency analysis of the second block of the received first audio signal according to the second trial audio coding format, the artifact computer determines a third compression artifact resulting from the third time-frequency analysis, and determine a fourth compression artifact resulting from the fourth time-frequency analysis, and the controller selects between the first trial audio coding format and the second trial audio coding format as the audio coding format based on the first compression artifact, the second compression artifact, the third compression artifact, and the fourth compression artifact.
Example 12 is the apparatus of example 11, further including a post processor to combine the first compression artifact and the third compression artifact to form a first score, and combine the second compression artifact and the fourth compression artifact to form a second score, wherein the controller selects between the first trial audio coding format and the second trial audio coding format as the audio coding format by comparing the first score and the second score.
Example 13 is the apparatus of example 5, wherein the received first audio signal is recorded at a media presentation device.
Example 14 is a method including receiving a first audio signal that represents a decompressed second audio signal, identifying a signal bandwidth of the first audio signal, and identifying a source of the decompressed second audio signal based on the signal bandwidth.
Example 15 is the method of example 14, wherein identifying the signal bandwidth includes forming a plurality of frequency spectrums for respective ones of a plurality of time intervals of the first audio signal, identifying a plurality of indices representative of cutoff frequencies for respective ones of the plurality of time intervals, and determining a median of the plurality of indices, the median representative of an overall cutoff frequency of the first audio signal.
Example 16 is the method of example 15, wherein identifying the plurality of indices representative of cutoff frequencies for respective ones of the plurality of time intervals includes sequentially comparing values of a frequency spectrum starting with a highest frequency with a threshold until a value of the frequency spectrum exceeds the threshold is identified.
Example 17 is the method of example 14, further including identifying, from the first audio signal, an audio coding format used to compress a third audio signal to form the decompressed second audio signal, and identifying the source of the decompressed second audio signal based on the identified signal bandwidth and the identified audio coding format.
Example 18 is the method of example 17, wherein the identifying, from the first audio signal, the audio coding format includes performing a first time-frequency analysis of a first block of the first audio signal according to a first trial audio coding format, determining a first compression artifact resulting from the first time-frequency analysis, performing a second time-frequency analysis of the first block of the first audio signal according to a second trial audio coding format, determining a second compression artifact resulting from the second time-frequency analysis, and selecting between the first trial audio coding format and the second trial audio coding format as the audio coding format based on the first compression artifact and the second compression artifact.
Example 19 is the method of example 18, further including performing a third time-frequency analysis of a second block of the first audio signal according to the first trial audio coding format, determining a third compression artifact resulting from the third time-frequency analysis, performing a fourth time-frequency analysis of the second block of the first audio signal according to the second audio coding format, determining a fourth compression artifact resulting from the fourth time-frequency analysis, and selecting between the first trial audio coding format and the second trial audio coding format as the audio coding format based on the first compression artifact, the second compression artifact, the third compression artifact, and the fourth compression artifact.
Example 20 is the method of example 19, wherein selecting between the first trial audio coding format and the second trial audio coding format as the audio coding format based on the first compression artifact, the second compression artifact, the third compression artifact, and the fourth compression artifact includes combining the first compression artifact and the third compression artifact to form a first score, combining the second compression artifact and the fourth compression artifact to form a second score, and comparing the first score and the second score.
Example 21 is the method of example 14, wherein the audio coding format indicates at least one of an audio codec, a time-frequency transform, a window function, or a window length.
Example 22 is a non-transitory computer-readable storage medium comprising instructions that, when executed, cause a machine to at least receive a first audio signal that represents a decompressed second audio signal, identify a signal bandwidth of the first audio signal, and identify a source of the decompressed second audio signal based on the identified signal bandwidth.
Example 23 is the non-transitory computer-readable storage medium of example 22, including further instructions that, when executed, cause the machine to identify the signal bandwidth by forming a plurality of frequency spectrums for a plurality of time intervals of the first audio signal, identifying a plurality of indices representative of cutoff frequencies for respective ones of the plurality of time intervals, and determining a median of the plurality of indices, the median representative of an overall cutoff frequency of the first audio signal.
Example 24 is the non-transitory computer-readable storage medium of example 22, including further instructions that, when executed, cause the machine to identify, from the first audio signal, an audio coding format used to compress a third audio signal to form the decompressed second audio signal, and identifying the source of the decompressed second audio signal based on the identified signal bandwidth and the identified audio coding format.
Any references, including publications, patent applications, and patents, cited herein are hereby incorporated by reference to the same extent as if each reference were individually and specifically indicated to be incorporated by reference and were set forth in its entirety herein.
Although certain example methods, apparatus and articles of manufacture have been disclosed herein, the scope of coverage of this patent is not limited thereto. On the contrary, this patent covers all methods, apparatus and articles of manufacture fairly falling within the scope of the claims of this patent.
This patent arises from a continuation of U.S. application Ser. No. 16/238,189 (now U.S. Pat. No. 11,049,507), which is titled “METHODS, APPARATUS, AND ARTICLES OF MANUFACTURE TO IDENTIFY SOURCES OF NETWORK STREAMING SERVICES,” and which was filed on Jan. 2, 2019, which is a continuation-in-part of U.S. patent application Ser. No. 15/793,543 (now U.S. Pat. No. 10,733,998), which is titled “METHODS, APPARATUS AND ARTICLES OF MANUFACTURE TO IDENTIFY SOURCES OF NETWORK STREAMING SERVICES,” and which was filed on Oct. 25, 2017. U.S. application Ser. No. 16/238,189 and U.S. application Ser. No. 15/793,543 are hereby incorporated herein by reference in its entirety. Priority to U.S. application Ser. No. 16/238,189 and U.S. application Ser. No. 15/793,543 is claimed.
Number | Name | Date | Kind |
---|---|---|---|
5373460 | Marks, II | Dec 1994 | A |
6820141 | Bennett | Nov 2004 | B2 |
7742737 | Peiffer et al. | Jun 2010 | B2 |
7907211 | Oostveen et al. | Mar 2011 | B2 |
8351645 | Srinivasan | Jan 2013 | B2 |
8553148 | Ramaswamy et al. | Oct 2013 | B2 |
8559568 | Clark | Oct 2013 | B1 |
8639178 | Anniballi et al. | Jan 2014 | B2 |
8768713 | Chaoui et al. | Jul 2014 | B2 |
8825188 | Stone et al. | Sep 2014 | B2 |
8856816 | Falcon | Oct 2014 | B2 |
9049496 | Raesig et al. | Jun 2015 | B2 |
9313359 | Stojancic et al. | Apr 2016 | B1 |
9456075 | Ponting et al. | Sep 2016 | B2 |
9515904 | Besehanic et al. | Dec 2016 | B2 |
9641892 | Panger et al. | May 2017 | B2 |
9648282 | Petrovic et al. | May 2017 | B2 |
9837101 | Bilobrov | Dec 2017 | B2 |
9905233 | Thagadur Shivappa | Feb 2018 | B1 |
10629213 | Rafii et al. | Apr 2020 | B2 |
10726852 | Rafii | Jul 2020 | B2 |
10733998 | Rafii et al. | Aug 2020 | B2 |
11049507 | Rafii et al. | Jun 2021 | B2 |
20030026201 | Arnesen | Feb 2003 | A1 |
20030086341 | Wells et al. | May 2003 | A1 |
20050015241 | Baum | Jan 2005 | A1 |
20060025993 | Aarts et al. | Feb 2006 | A1 |
20080169873 | Toda | Jul 2008 | A1 |
20130058522 | Raesig et al. | Mar 2013 | A1 |
20140088978 | Mundt et al. | Mar 2014 | A1 |
20140137146 | Topchy et al. | May 2014 | A1 |
20140336800 | Radhakrishnan et al. | Nov 2014 | A1 |
20150170660 | Han et al. | Jun 2015 | A1 |
20150222951 | Ramaswamy | Aug 2015 | A1 |
20150302086 | Roberts et al. | Oct 2015 | A1 |
20160196343 | Rafii | Jul 2016 | A1 |
20170048641 | Franck | Feb 2017 | A1 |
20170334234 | Curtis | Nov 2017 | A1 |
20170337926 | Chon et al. | Nov 2017 | A1 |
20180315435 | Goodwin et al. | Nov 2018 | A1 |
20180365194 | Grado et al. | Dec 2018 | A1 |
20190122673 | Rafii et al. | Apr 2019 | A1 |
20190139559 | Rafii et al. | May 2019 | A1 |
20200234722 | Rafii et al. | Jul 2020 | A1 |
20210027792 | Rafii et al. | Jan 2021 | A1 |
Number | Date | Country |
---|---|---|
2474508 | Apr 2011 | GB |
20140023389 | Feb 2014 | KR |
2012177870 | Dec 2012 | WO |
2019084065 | May 2019 | WO |
Entry |
---|
Kim, Bongjun, and Zafar Rafii. “Lossy audio compression identification.” 2018 26th European Signal Processing Conference (EUSIPCO). IEEE, 2018. (Year: 2018). |
Zakariah, Mohammed, Muhammad Khurram Khan, and Hafiz Malik. “Digital multimedia audio forensics: past, present and future.” Multimedia tools and applications 77 (2018): 1009-1040. (Year: 2018). |
Hicsonmez, Samet, Husrev T. Sencar, and Ismail Avcibas. “Audio codec identification from coded and transcoded audios.” Digital Signal Processing 23.5 (2013): 1720-1730. (Year: 2013). |
Yang, Rui, Yun Q. Shi, and Jiwu Huang. “Detecting double compression of audio signal.” Media Forensics and Security II. vol. 7541. SPIE, 2010. (Year: 2010). |
United States Patent and Trademark Office, “Non-Final Office Action”, issued in connection with U.S. Appl. No. 15/942,369, dated Jul. 19, 2019, 14 pages. |
United States Patent and Trademark Office, “Notice of Allowance and Fee(s) Due”, issued in connection with U.S. Appl. No. 15/942,369, dated Dec. 13, 2019, 7 pages. |
United States Patent and Trademark Office, “Supplemental Notice of Allowability”, issued in connection with U.S. Appl. No. 15/942,369, dated Feb. 10, 2020, 2 pages. |
United States Patent and Trademark Office, “Supplemental Notice of Allowability”, issued in connection with U.S. Appl. No. 15/942,369, dated Mar. 17, 2020, 2 pages. |
United States Patent and Trademark Office, “Notice of Allowance and Fee(s) Due”, issued in connection with U.S. Appl. No. 15/899,220, dated Feb. 11, 2020, 6 pages. |
United States Patent and Trademark Office, “Non-Final Office Action”, issued in connection with U.S. Appl. No. 16/238,189, dated Jul. 13, 2020, 16 pages. |
United States Patent and Trademark Office, “Final Office Action”, issued in connection with U.S. Appl. No. 16/238,189, dated Oct. 21, 2020, 15 pages. |
United States Patent and Trademark Office, “Notice of Allowance and Fee(s) Due”, issued in connection with U.S. Appl. No. 16/238,189, dated Feb. 25, 2021, 8 pages. |
United States Patent and Trademark Office, “Corrected Notice of Allowability”, issued in connection with U.S. Appl. No. 16/238,189, dated Jun. 3, 2021, 3 pages. |
United States Patent and Trademark Office, “Non-Final Office Action”, issued in connection with U.S. Appl. No. 16/984,091, dated Apr. 11, 2022, 10 pages. |
United States Patent and Trademark Office, “Final Office Action”, issued in connection with U.S. Appl. No. 16/984,091, dated Jul. 22, 2022, 13 pages. |
Patent Cooperation Treaty, “International Preliminary Report on Patentability”, issued in connection with International Application No. PCT/US2018/057183, dated Apr. 28, 2020, 5 pages. |
Hicsonmez et al. “Audio Codec Identification from Coded and Transcoded Audios,” Digital Signal Processing 23.5, 2013: pp. 1720-1730. |
Jenner et al., “Highly Accurate Non-Intrusive Speech Forensics for Codec Identifications from Observed Decoded Signals,” 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), IEEE 2012, pp. 1737-1740, 4 pages. |
Luo et al., “Compression History Identification for Digital Audio Signal,” 2021 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), IEEE, 2012, 4 pages. |
Luo et al., “Identification of AMR decompressed audio,” Digital Signal Processing vol. 37, 2015: pp. 85-91 (7 pages). |
United States Patent and Trademark Office, “Notice of Allowance and Fee(s) Due”, issued in connection with U.S. Appl. No. 15/899,220, dated Jun. 29, 2020, 3 pages. |
United States Patent and Trademark Office, “Final Office Action”, issued in connection with U.S. Appl. No. 15/899,220, dated Nov. 25, 2019, 6 pages. |
Todd et al., “AC-3: Flexible Perceptual Coding for Audio Transmission and Storage”, presented at the 96th Convention of the Audio Engineering Society, Feb. 26-Mar. 1, 1994, 13 pages. |
Brandenburg et al.,“ISO-MPEG-1 Audio: A Generic Standard for Coding of High-Quality Digital Audio”, presented at the 92nd Convention of the Audio Engineering Society, 1992; revised Jul. 15, 1994, 13 pages. |
Brandenburg, Karlheinz, “MP3 and AAC Explained”, presented at the Audio Engineering Society's 17th International Conference on High Quality Audio Coding, Sep. 2-5, 1999, 12 pages. |
Herre et al., “Analysis of Decompressed Audio—The “Inverse Decoder””, presented at the 109th Convention of the Audio Engineering Society, Sep. 22-25, 2000, 24 pages. |
Moehrs et al., “Analysing decompressed audio with the “Inverse Decoder”—towards an operative algorithm”, presented at the 112the Convention of the Audio Engineering Society, May 10-13, 2002, 22 pages. |
Bosi et al., “Introduction to Digital Audio Coding and Standards”, published by Kluwer Academic Publishers, 2003, 426 pages. |
Yang et al., “Detecting Digital Audio Forgeries by Checking Frame Offsets”, presented at the 10th annual ACM Multimedia & Security Conference, Sep. 22-23, 2008, 6 pages. |
D'Alessandro et al., “MP3 Bit Rate Quality Detection through Frequency Spectrum Analysis”, presented at the 11th annual ACM Multimedia & Security Conference, Sep. 7-8, 2009, 5 pages. |
Yang et al., “Defeating Fake-Quality MP3”, presented at the 11th annual ACM Multimedia & Security Conference, Sep. 7-8, 2009, 8 pages. |
Liu et al., “Detection of Double MP3 Compression”, published in Cognitive Computation, May 22, 2010, 6 pages. |
Hiçönmez et al., “Audio Codec Identification Through Payload Sampling”, published in Information Forensics and Security (WIFS), 2011, 6 pages. |
Advanced Television Systems Committee, “ATSC Standard: Digital Audio Compression (AC-3, E-AC-3)”, Dec. 17, 2012, 270 pages. |
Hiçönmez et al., “Methods for Identifying Traces of Compression in Audio”, published online, URL: https://www.researchgate.net/publication/26199644, May 1, 2014, 7 pages. |
Bianchi et al., “Detection and Classification of Double Compressed MP3 Audio Tracks”, presented at the 1st annual AMC workshop on Information Hiding & Multimedia Security, Jun. 17-19, 2013, 6 pages. |
Qiao et al., “Improved Detection of MP3 Double Compression using Content-Independent Features”, published in Signal Processing, Communication and Computing (ICSPCC), 2013, 4 pages. |
Korycki, Rafal, “Authenticity examination of compressed audio recordings using detection of multiple compression and encoders' identification”, published in Forensic Science International, Februray 7, 2014, 14 pages. |
Gärtner et al., “Efficient Cross-Codec Framing Grid Analysis for Audio Tampering Detection”, presented at the 136th Audio Engineering Society Convention, Apr. 26-29, 2014, 11 pages. |
Luo et al., “Identifying Compression History of Wave Audio and Its Applications”, published in ACM Transactions on Multimedia Computing, Communications and Applications, vol. 10, No. 3, Article 30, Apr. 2014, 19 pages. |
xiph.org Foundation, “Vorbis I Specification”, published Feb. 27, 2015, 74 pages. |
Seichter et al., “AAC Encoding Detection and Bitrate Estimation Using a Convolutional Neural Network”, published in Acoustics, Speech and Signal Processing (ICASSP), 2016, 5 pages. |
Hennequin et al., “Codec Independent Lossy Audio Compression Detection”, published in Acoustics, Speech and Signal Processing (ICASSP), 2017, 5 pages. |
Kim et al., “Lossy Compression Identification from Audio Recordings, version 1”, 5 pages. |
Kim et al., “Lossy Compression Identification from Audio Recordings, version 2”, 5 pages. |
Barry Van Oudtshoorn, “Investigating the Feasibility of Near Real-Time Music Transcription on Mobile Devices,” Honours Programme of the School of Computer Science and Software Engineering The University of Western Australia, 2008, 50 pages. |
Eric Jacobsen and Richard Lyons, “Sliding Spectrum Analysis,” Streamlining digital Signal Processing: A Tricks of the Trade Guidebook, IEEE, Chapter 14, 2007, 13 pages. |
Eric Jacobsen and Richard Lyons, “An update to the sliding DFT,” IEEE Signal Processing Magazine, 2004, 3 pages. |
Eric Jacobsen and Richard Lyons, “The Sliding DFT,” IEEE Signal Processing Magazine, 1053-5888, Mar. 2003, p. 74-80, 7 pages. |
Haitham Hassanieh, Piotr Indyk, Dina Katabi, and Eric Price, “Simple and Practical Algorithm for Sparse Fourier Transform,” SODA '12 Proceedings of the Twenty-Third Annual Symposium on Discrete Algorithms, 12 pages. |
Judith C. Brown and Miller S. Puckette, “An efficient algorithm for the calculation of a constant Q transform,” J. Acoust. Soc. Am. 92 (5), Nov. 1992, pp. 2698-2701, 4 pages. |
Judith C. Brown, “Calculation of a constant Q spectral transform,” J. Acoust. Soc. Am. 89 (1), Jan. 1991, pp. 425-434, 10 pages. |
Steve Arar, “DFT Leakage and the Choice of the Window Function,” Aug. 23, 2017, retrieved from www.allaboutcircuits.com/technical-articles, 11 pages. |
Tom Springer, “Sliding FFT computes frequency spectra in real time,” EDN Magazine, Sep. 29, 1988, reprint taken from Electronic Circuits, Systems and Standards: The Best of EDN, edited by lan Hickman, 1991, 7 pages. |
Kim et al., “Lossy Audio Compression Identification,” 10.23919/EUSIPCO.2018.8553611, Conference: 2018 26th European Signal Processing Conference, (Sep. 2018), 2459-2463. |
Kim et al., “Lossy Audio Compression Identification (Poster),” 10.23919/EUSIPCO.2018.8553611, Conference: 2018 26th European Signal Processing Conference, (Sep. 2018), 1 page. |
International Searching Authority, “International Search Report,” issued in connection with application No. PCT/US2018/057183, dated Feb. 13, 2019, 5 pages. |
International Searching Authority, “Written Opinion,” issued in connection with application No. PCT/US2018/057183, dated Feb. 12, 2019, 4 pages. |
United States Patent and Trademark Office, “Non-Final Office Action,” dated May 20, 2019 in connection with U.S. Appl. No. 15/899,220, 10 pages. |
United States Patent and Trademark Office, “Corrected Notice of Allowability,” dated Jun. 3, 2021 in connection with U.S. Appl. No. 16/238,189, 3 pages. |
European Patent Office, “Extended European Search Report”, issued in connection with EP Application No. 18871214.5, dated Jul. 2, 2021, 8 pages. |
European Patent Office, “Communication Pursuant to Rules 70(2) and 70a(2) EPC”, issued in connection with EP Application No. 18871214.5, dated Jul. 20, 2021, 1 page. |
United States Patent and Trademark Office, “Supplemental Notice of Allowability,” dated Jun. 29, 2020 in connection with U.S. Appl. No. 15/899,220, 3 pages. |
Korean Intellectual Preperty Office, “Notice of Preliminary Rejection”, issued in connection with KR Application No. 10-2020-7012223, dated Aug. 5, 2021, 15 pages. [English Translation Included]. |
United States Patent and Trademark Office, “Non-Final Office Action,” dated Nov. 24, 2021 in connection with U.S. Appl. No. 16/843,582, 8 pages. |
United States Patent and Trademark Office, “Notice of Allowance and Fee(s) Due,” dated Apr. 22, 2022 in connection with U.S. Appl. No. 16/843,582, 7 pages. |
Korean Intellectual Preperty Office, “Notice of Final Rejection”, issued in connection with KR Application No. 10-2020-7012223, dated Feb. 21, 2022, 8 pages. [English Translation Included]. |
Korean Intellectual Preperty Office, “Notice of Allowance”, issued in connection with KR Application No. 10-2020-7012223, dated Apr. 26, 2022, 4 pages. [English Translation Included]. |
Cho et al. “Coding History Detection of Speech Signal using Deep Neural Network”, vol. 23, No. 1, dated Jan. 2018, 7 pages. |
United States Patent and Trademark Office, “Non-Final Office Action,” dated Feb. 26, 2019 in connection with U.S. Appl. No. 15/793,543, 14 pages. |
United States Patent and Trademark Office, “Final Office Action,” dated Jul. 12, 2019 in connection with U.S. Appl. No. 15/793,543, 14 pages. |
United States Patent and Trademark Office, “Notice of Allowance and Fee(s) Due,” dated Mar. 25, 2020 in connection with U.S. Appl. No. 15/793,543, 9 pages. |
Number | Date | Country | |
---|---|---|---|
20210327444 A1 | Oct 2021 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 16238189 | Jan 2019 | US |
Child | 17360605 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 15793543 | Oct 2017 | US |
Child | 16238189 | US |