The present disclosure relates generally to media monitoring and, more particularly, to methods and apparatus to perform audio watermarking and watermark detection and extraction.
Identifying media information and, more specifically, audio streams (e.g., audio information) is useful for assessing audience exposure to television, radio, or any other media. For example, in television audience metering applications, a code may be inserted into the audio or video of media, wherein the code is later detected at monitoring sites when the media is presented (e.g., played at monitored households). The information payload of the code/watermark embedded into original signal can consist of unique source identification, time of broadcast, transactional or additional content metadata. Monitoring sites typically include locations such as, for example, households where the media consumption of audience members or audience member exposure to the media is monitored. For example, at a monitoring site, codes from the audio and/or video are captured and may be associated with audio or video streams of media associated with a selected channel, radio station, media source, etc. The collected codes may then be sent to a central data collection facility for analysis. However, the collection of data pertinent to media exposure or consumption need not be limited to in-home exposure or consumption.
The following description makes reference to audio encoding and decoding that is also commonly known as audio watermarking and watermark detection, respectively. It should be noted that in this context, audio may be any type of signal having a frequency falling within the normal human audibility spectrum. For example, audio may be speech, music, an audio portion of an audio and/or video program or work (e.g., a television program, a movie, an Internet video, a radio program, a commercial spot, etc.), a media program, noise, or any other sound.
In general, the encoding of the audio inserts one or more codes into the audio and ideally leaves the code inaudible to hearers of the audio. However, there may be certain situations in which the code may be audible to certain listeners. Additionally, the following refers to codes that may be encoded or embedded in audio; these codes may also be referred to as watermarks. The codes that are embedded in audio may be of any suitable length and any suitable technique for assigning the codes to information may be selected. Furthermore, as described below, the codes may be converted into symbols that are represented by signals having selected frequencies that are embedded in the audio. Any suitable encoding or error correcting technique may be used to convert codes into symbols.
The following examples pertain generally to encoding an audio signal with information, such as a code, and obtaining that information from the audio via a decoding process. The following example encoding and decoding processes may be used in several different technical applications to convey information from one place to another.
The example encoding and decoding processes described herein may be used to perform broadcast identification. In such an example, before a work is broadcast, that work is encoded to include a code indicative of the source of the work, the broadcast time of the work, the distribution channel of the work, or any other information deemed relevant to the operator of the system. When the work is presented (e.g., played through a television, a radio, a computing device, or any other suitable device), persons in the area of the presentation are exposed not only to the work, but, unbeknownst to them, are also exposed to the code embedded in the work. Thus, persons may be provided with decoders that operate on a microphone-based platform so that the work may be obtained by the decoder using free-field detection and processed to extract codes therefrom. The codes may then be logged and reported back to a central facility for further processing. The microphone-based decoders may be dedicated, stand-alone devices, or may be implemented using cellular telephones or any other types of devices having microphones and software to perform the decoding and code logging operations. Alternatively, wire-based systems may be used whenever the work and its attendant code may be picked up via a hard wired connection.
The example encoding and decoding processes described herein may be used, for example, in tracking and/or forensics related to audio and/or video works by, for example, marking copyrighted audio and/or associated video content with a particular code. The example encoding and decoding processes may be used to implement a transactional encoding system in which a unique code is inserted into a work when that work is purchased by a consumer. Thus, allowing a media distribution to identify a source of a work. The purchasing may include a purchaser physically receiving a tangible media (e.g., a compact disk, etc.) on which the work is included, or may include downloading of the work via a network, such as the Internet. In the context of transactional encoding systems, each purchaser of the same work receives the work, but the work received by each purchaser is encoded with a different code. That is, the code inserted in the work may be personal to the purchaser, wherein each work purchased by that purchaser includes that purchaser's code. Alternatively, each work may be may be encoded with a code that is serially assigned.
Furthermore, the example encoding and decoding techniques described herein may be used to carry out control functionality by hiding codes in a steganographic manner, wherein the hidden codes are used to control target devices programmed to respond to the codes. For example, control data may be hidden in a speech signal, or any other audio signal. A decoder in the area of the presented audio signal processes the received audio to obtain the hidden code. After obtaining the code, the target device takes some predetermined action based on the code. This may be useful, for example, in the case of changing advertisements within stores based on audio being presented in the store, etc. For example, scrolling billboard advertisements within a store may be synchronized to an audio commercial being presented in the store through the use of codes embedded in the audio commercial.
An example encoding and decoding system 100 is shown in
The audio signal 104 may be any form of audio including, for example, voice, music, noise, commercial advertisement audio, audio associated with a television program, live performance, etc. In the example of
Although the transmit side of the example system 100 shown in
The transmitter 106 may include one or more of a radio frequency (RF) transmitter that may distribute the encoded audio signal through free space propagation (e.g., via terrestrial or satellite communication links) or a transmitter used to distribute the encoded audio signal through cable, fiber, etc. In one example, the transmitter 106 may be used to broadcast the encoded audio signal throughout a broad geographical area. In other cases, the transmitter 106 may distribute the encoded audio signal through a limited geographical area. The transmission may include up-conversion of the encoded audio signal to radio frequencies to enable propagation of the same. Alternatively, the transmission may include distributing the encoded audio signal in the form of digital bits or packets of digital bits that may be transmitted over one or more networks, such as the Internet, wide area networks, or local area networks. Thus, the encoded audio signal may be carried by a carrier signal, by information packets or by any suitable technique to distribute the audio signals.
When the encoded audio signal is received by a receiver 110, which, in the media monitoring context, may be located at a statistically selected metering site 112, the audio signal portion of the received program signal is processed to recover the code, even though the presence of that code is imperceptible (or substantially imperceptible) to a listener when the encoded audio signal is presented by speakers 114 of the receiver 110. To this end, a decoder 116 is connected either directly to an audio output 118 available at the receiver 110 or to a microphone 120 placed in the vicinity of the speakers 114 through which the audio is reproduced. The received audio signal can be either in a monaural or stereo format. Further details regarding decoding and example decoders are provided below.
As explained above, the encoder 102 inserts one or more inaudible (or substantially inaudible) codes into the audio 104 to create encoded audio. One example encoder 102 is shown in
In one example in which the audio 104 is provided to the encoder 102 in analog form, the sampler 202 may be implemented using an analog-to-digital (A/D) converter or any other suitable digitizer. The sampler 202 may sample the audio 104 at, for example, 48,000 Hertz (Hz) or any other sampling rate suitable to sample the audio 104 while satisfying the Nyquist criteria. For example, if the audio 104 is frequency-limited at 15,000 Hz, the sampler 202 may operate at 30,000 Hz. Each sample from the sampler 202 may be represented by a string of digital bits, wherein the number of bits in the string indicates the precision with which the sampling is carried out. For example, the sampler 202 may produce 8-bit, 16-bit, 24-bit, or 32-bit.
In addition to sampling the audio 104, the example sampler 202 accumulates a number of samples (i.e., an audio block) that are to be processed together. For example, the example sampler 202 accumulates a 512 sample audio block that is passed to the masking evaluator 204 at one time. Alternatively, in one example, the masking evaluator 204 may include an accumulator in which a number of samples (e.g., 512) may be accumulated in a buffer before they are processed.
The masking evaluator 204 receives or accumulates the samples (e.g., 512 samples) and determines an ability of the accumulated samples to hide code frequencies to human hearing. That is, the masking evaluator determines if code frequencies can be hidden within the audio represented by the accumulated samples by evaluating each critical band of the audio as a whole to determine its energy and determining the noise-like or tonal-like attributes of each critical band and determining the sum total ability of the critical bands to mask the code frequencies. Critical frequency bands, which were determined by experimental studies carried out on human auditory perception, may vary in width from single frequency bands at the low end of the spectrum to bands containing ten or more adjacent frequencies at the upper end of the audible spectrum. If the masking evaluator 204 determines that code frequencies can be hidden in the audio 104, the masking evaluator 204 indicates the amplitude levels at which the code frequencies can be inserted within the audio 104, while still remaining hidden and provides the amplitude information to the code synthesizer 208.
In one example, the masking evaluator 204 conducts the masking evaluation by determining a maximum change in energy Eb or a masking energy level that can occur at any critical frequency band without making the change perceptible to a listener. The masking evaluation carried out by the masking evaluator 204 may be carried out as outlined in the Moving Pictures Experts Group-Advanced Audio Encoding (MPEG-AAC) audio compression standard ISO/IEC 13818-7:1997, for example. The acoustic energy in each critical band influences the masking energy of its neighbors and algorithms for computing the masking effect are described in the standards document such as ISO/IEC 13818-7:1997. These analyses may be used to determine for each audio block the masking contribution due to tonality (e.g., how much the audio being evaluated is like a tone) as well as noise like (i.e., how much the audio being evaluated is like noise) features. Further analysis can evaluate temporal masking that extends masking ability of the audio over short time, typically, for 50-100 ms. The resulting analysis by the masking evaluator 204 provides a determination, on a per critical band basis, the amplitude of a code frequency that can be added to the audio 104 without producing any noticeable audio degradation (e.g., without being audible).
In one example, the code frequency selector 206 may be implemented using a lookup table that relates an input code 103 to a state, wherein each state is represented by a number of code frequencies that are to be emphasized in the encoded audio signal. For example, the code frequency selector 206 may include information relating symbols or data states to sets of code frequencies that redundantly represent the data states. Of course, the number of states selected for use may be based on the types of input codes. For example, an input code representing two bits may be converted to code frequencies representing one of four symbols or states (e.g., 22). In another example, an input code representing four bits of information may be represented by one of 16 symbols or states (e.g., 24). Of course, some other encoding may be used to build in error correction when converting the code 103 to one or more symbols or states. Additionally, in some examples, more than one code may be embedded in the audio 104.
One example chart illustrating a code frequency configuration is shown in
As shown in
As shown in
Thus, if the code frequency selector 206 operates premised on the chart 300 of
The encoding used to select states in the chart 300 to convey information may include data blocks and synchronization blocks. For example, the message to be encoded by the system using these 144 different states consists of a synchronization block that is followed by several data blocks. Each of the synchronization block and the data blocks is encoded into 18,432 samples and is represented by emphasizing the indices of one of the states shown in the chart 300 table below by emphasizing frequency indices shown in one column of the chart 300.
For example, a synchronization block is represented by emphasizing the indices of one of 16 states selected to represent synchronization information. That is, the synchronization block indicates the start of one of 16 different message types. For example, when considering media monitoring, network television stations may use a first state to represent synchronization and a local affiliate may use a second state to represent synchronization. Thus, at the start of a transmission, one of 16 different states is selected to represent synchronization and transmitted by emphasizing the indices associated with that state. Information payload data follows synchronization data.
In the foregoing example, with regard to how these 16 states representing synchronization information are distributed throughout the 144 states, in one example the 16 states are selected so that a frequency range including first code frequencies representing each of those 16 states is larger than a frequency amount separating that frequency range from an adjacent frequency range including second code frequencies also representing each of those 16 states. For example, the 16 states representing the synchronization information may be spaced every 9 states in the table above, such that states S1, S10, S19, S28, S37, S46, S54, S63, S72, S81, S90, S99, S108, S117, S126, S135 represent possible states that the synchronization information may take. In Code Band 0 and Code Band 1, this corresponds to a width in frequency indices of 135 indices. The frequency spacing between the highest possible synchronization state (S135) of Code Band 0 and the lowest possible synchronization state (S1) of Code Band 1 is 10 frequency indices. Thus, the range of each collection of frequency indices representing the synchronization information is much larger (e.g., 135 indices) than the amount separating adjacent collections (e.g., 10 indices).
In this example, the remaining 128 states of the 144 state space that are not used to represent synchronization may be used to transmit information data. The data may be represented by any number of suitable states required to represent the number of desired bits. For example, 16 states may be used to represent four bits of information per state, or 128 states may be used to represent seven bits of information per state. In one example, the states selected to represent data are selected such that a frequency range including first code frequencies representing each of the data states is larger than a frequency amount separating that frequency range from an adjacent frequency range including second code frequencies also representing each of the data states. Thus, states used to represent potential data include at least one substantially low numbered state (e.g., S2) and at least one substantially high numbered state (e.g., S144). This ensures that the ranges including states that may be used to represent data occupy a wide bandwidth within their respective code bands, and that the spacing between adjacent ranges are narrow.
The encoder 102 may repeat the encoding process and, thereby, encode a number of audio blocks with a particular code. That is, the selected code frequencies may be inserted into several consecutive 512-sample audio blocks. In one example, the code frequencies representing symbols may be repeated in 36 consecutive audio blocks of 512 samples or 72 overlapping blocks of 256 samples. Thus, at the receive side, when 18,432 samples are processed by a Fourier transformation, the emphasized code frequencies will be visible in the resulting spectrum.
As with the chart 300 of
Chart 360 of
In an example encoder 102 operating according to the chart 360 of
As with the charts 300 and 330 described above, the chart 360 indicates that the code bands are separated by the same frequency distance as the frequency indices representing adjacent symbol. For example, Code Band 0 includes a code frequency component having a frequency index of 83, which is one frequency index from the Code Band 1 frequency index 84 representing the state S1.
Returning now to
While the foregoing describes an example code synthesizer 208 that generates sine waves or data representing sine waves, other example implementations of code synthesizers are possible. For example, rather than generating sine waves, another example code synthesizer 208 may output frequency domain coefficients that are used to adjust amplitudes of certain frequencies of audio provided to the combiner 210. In this manner, the spectrum of the audio may be adjusted to include the requisite sine waves.
The combiner 210 receives both the output of the code synthesizer 208 and the audio 104 and combines them to form encoded audio. The combiner 210 may combine the output of the code synthesizer 208 and the audio 104 in an analog or digital form. If the combiner 210 performs a digital combination, the output of the code synthesizer 208 may be combined with the output of the sampler 202, rather than the audio 104 that is input to the sampler 202. For example, the audio block in digital form may be combined with the sine waves in digital form. Alternatively, the combination may be carried out in the frequency domain, wherein frequency coefficients of the audio are adjusted in accordance with frequency coefficients representing the sine waves. As a further alternative, the sine waves and the audio may be combined in analog form. The encoded audio may be output from the combiner 210 in analog or digital form. If the output of the combiner 210 is digital, it may be subsequently converted to analog form before being coupled to the transmitter 106.
An example encoding process 400 is shown in
After the code is obtained (block 402), the example process 400 samples the audio into which the code is to be embedded (block 404). The sampling may be carried out at 48,000 Hz or at any other suitable frequency. The example process 400 then assembles the audio samples into a block of audio samples (block 406). The block of samples may include, for example, 512 audio samples. In some examples, blocks of samples may include both old samples (e.g., samples that have been used before in encoding information into audio) and new samples (e.g., samples that have not been used before in encoding information into audio). For example, a block of 512 audio samples may include 256 old samples and 256 new samples. Upon a subsequent iteration of the example process 400, the 256 new samples from a prior iteration may be used as the 256 old samples of the next iteration of the example process 400.
The example process 400 then determines the code frequencies that will be used to include the code (obtained at block 402) into the audio block (obtained at block 406) (block 408). This is an encoding process in which a code or code bits are converted into symbols that will be represented by frequency components. As described above, the example process 400 may use one or more lookup tables to convert codes to be encoded into symbols representative of the codes, wherein those symbols are redundantly represented by code frequencies in the audio spectrum. As described above, seven frequencies may be used to redundantly represent the selected symbol in the block of audio. The selection of symbols to represent codes may include consideration of the block number being processed error coding, etc.
Having obtained the audio into which the codes are to be included (block 406), as well as the code frequencies that are to be used to represent the codes (block 408), the process 400 computes the ability of the audio block to mask the selected code frequencies (block 410). As explained above, the masking evaluation may include conversion of the audio block to the frequency domain and consideration of the tonal or noise-like properties of the audio block, as well as the amplitudes at various frequencies in the block. Alternatively, the evaluation may be carried out in the time domain. Additionally, the masking may also include consideration of audio that was in a previous audio block. As noted above, the masking evaluation may be carried out in accordance with the MPEG-AAC audio compression standard ISO/IEC 13818-7:1997, for example. The result of the masking evaluation is a determination of the amplitudes or energies of the code frequencies that are to be added to the audio block, while such code frequencies remain inaudible or substantially inaudible to human hearing.
Having determined the amplitudes or energies at which the code frequencies should be generated (block 410), the example process 400 synthesizes one or more sine waves having the code frequencies (block 412). The synthesis may result in actual sine waves or may result in digital data equivalent representative of sine waves. In one example, the sine waves may be synthesized with amplitudes specified by the masking evaluation. Alternatively, the code frequencies may be synthesized with fixed amplitudes and then amplitudes of the code frequencies may be adjusted subsequent to synthesis.
The example process 400 then combines the synthesized code frequencies with the audio block (block 414). The combination may be carried out through addition of data representing the audio block and data representing the synthesized sine waves, or may be carried out in any other suitable manner.
In another example, the code frequency synthesis (block 412) and the combination (block 414) may be carried out in the frequency domain, wherein frequency coefficients representative of the audio block in the frequency domain are adjusted per the frequency domain coefficients of the synthesized sine waves.
As explained above, the code frequencies are redundantly encoded into consecutive audio blocks. In one example, a particular set of code frequencies is encoded into 36 consecutive blocks. Thus, the example process 400 monitors whether it has completed the requisite number of iterations (block 416) (e.g., the process 400 determines whether the example process 400 has been repeated 36 times to redundantly encode the code frequencies). If the example process 400 has not completed the requisite iterations (block 416), the example process 400 samples audio (block 404), analyses the masking properties of the same (block 410), synthesizes the code frequencies (block 412) and combines the code frequencies with the newly acquired audio block (block 414), thereby encoding another audio block with the code frequencies.
However, when the requisite iterations to redundantly encode the code frequencies into audio blocks have completed (block 416), the example process 400 obtains the next code to be included in the audio (block 402) and the example process 400 iterates. Thus, the example process 400 encodes a first code into a predetermined number of audio blocks, before selecting the next code to encode into a predetermined number of audio blocks, and so on. It is, however, possible, that there is not always a code to be embedded in the audio. In that instance, the example process 400 may be bypassed. Alternatively, if no code to be included is obtained (block 402), no code frequencies will by synthesized (block 412) and, thus, there will be no code frequencies to alter an audio block. Thus, the example process 400 may still operate, but audio blocks may not always be modified-especially when there is no code to be included in the audio.
In general, the decoder 116 detects the code signal that was inserted into the audio to form encoded audio at the encoder 102. That is, the decoder 116 looks for a pattern of emphasis in code frequencies it processes. Once the decoder 116 has determined which of the code frequencies have been emphasized, the decoder 116 determines, based on the emphasized code frequencies, the symbol present within the encoded audio. The decoder 116 may record the symbols, or may decode those symbols into the codes that were provided to the encoder 102 for insertion into the audio.
As shown in
The samples from the sampler 502 are provided to a time to frequency domain converter 504. The time to frequency domain converter 504 may be implemented using a discrete Fourier transformation (DFT), or any other suitable technique to convert time-based information into frequency-based information. In one example, the time to frequency domain converter 504 may be implemented using a sliding DFT in which a spectrum is calculated each time a new sample is provided to the example time to frequency converter 504. In one example, the time to frequency domain converter 504 uses 18,432 samples of the encoded audio and determines a spectrum therefrom. The resolution of the spectrum produced by the time to frequency domain converter 504 increases as the number of samples used to generate the spectrum. Thus, the number of samples processed by the time to frequency domain converter 504 should match the resolution used to select the indices in the charts of
The spectrum produced by the time to frequency domain converter 504 passes to a code frequency monitor 506, which monitors all the frequencies or spectral lines corresponding to the frequency indices that can potentially carry codes inserted by the example encoder 102. For example, if the example encoder 102 sends data based on the chart of
The monitoring of the code frequencies includes evaluating the spectral energies at each of the code frequencies. Thus, the code frequency monitor 506 normalizes the energies for a specific row of the chart of
Based on the normalized energies produced by the code frequency monitor 506, a symbol determiner 508 to determines the symbol that was present in the encoded audio. In one example, the symbol determiner 508 sums all of the normalized energies corresponding to each state. That is, the symbol determiner 508 creates 144 sums, each corresponding to a column, or state, in the chart 300. The column or state having the highest sum of normalized energies is determined to be the symbol that was encoded. The symbol determiner may use a lookup table similar to the lookup table of
The most probable symbols are processed by the validity checker 510 to determine if the received symbols correspond to valid data. That is, the validity checker 510 determines if bits corresponding to the most probable symbol are valid given the encoding scheme used to convert the code into a symbol at the code frequency selector 206 of the encoder 102. The output of the validity checker 510 is the code, which corresponds to the code provided to the code frequency selector 206 of
An example decoding process 600 is shown in
As each sample is obtained, a sliding time to frequency conversion is performed on a collection of samples including numerous older samples and the newly added sample obtained at block 602 (block 604). In one example, a sliding DFT may be used to process streaming input samples including 18,431 old samples and the one newly added sample. In one example, the DFT using 18,432 samples results in a spectrum having a resolution of 2.6 Hz.
After the spectrum is obtained through the time to frequency conversion (block 604), the energies of the code frequencies are determined (block 606). In one example, the energies may be obtained by taking the magnitude of the result of the time to frequency conversion (block 604) for the frequency components that may be emphasized to encode the audio. Importantly, to save processing time and minimize memory consumption, only frequency information corresponding to the code frequencies may be retained and processed further, because those frequencies are the only frequencies at which encoded information may be located. Of course, the example process 600 may use other information that the energies. For example, the example process 600 could retain both magnitude and phase information and process the same.
Additionally, the frequencies that are processed in the process 600 may be further reduced by considering a previously-received synchronization symbol. For example, if a particular synchronization symbol is always followed by one of six different symbols, the frequencies that are processed may be reduced to those of the six different symbols after that particular synchronization symbol is received.
After the energies are determined (block 606), the example process 600 normalizes the code frequency energies of each Code Block based on the largest energy in that Code Block (block 608). That is, the maximum energy of a code frequency in a Code Block is used as a divisor against itself and all other energies in that Code Block. The normalization results in each Code Block having one frequency component having a normalized energy value of one, with all other normalized energy values in that Code Block having values less than one. Thus, with reference to
The example process 600 then operates on the normalized energy values to determine the most likely symbol based thereon (block 610). As explained above, this determination includes, for example, summing the normalized energy values corresponding to each symbol, thereby resulting in the same number of sums as symbols (e.g., in consideration of the chart of
After having determining the received symbol (block 610), the example process 600 determines the code corresponding to the received symbol (block 612). That is, the example process 600 decodes the encoding of a code into a symbol that was carried out by the example encoding process 400 (e.g., the encoding performed by block 408).
After the decoding is complete and codes are determined from symbols (block 612), the example process 600 analyzes the code for validity (block 614). For example, the received codes may be examined to determine if the code sequence is valid based on the encoding process by which codes are sent. Valid codes are logged and may be sent back to a central processing facility at a later time, along with a time and date stamp indicating when the codes were received.
While example manners of implementing any or all of the example encoder 102 and the example decoder 116 have been illustrated and described above one or more of the data structures, elements, processes and/or devices illustrated in the drawings and described above may be combined, divided, re-arranged, omitted, eliminated and/or implemented in any other way. Further, the example encoder 102 and example decoder 116 may be implemented by hardware, software, firmware and/or any combination of hardware, software and/or firmware. Thus, for example, the example encoder 102 and the example decoder 116 could be implemented by one or more circuit(s), programmable processor(s), application specific integrated circuit(s) (ASIC(s)), programmable logic device(s) (PLD(s)) and/or field programmable logic device(s) (FPLD(s)), etc. For example, the decoder 116 may be implemented using software on a platform device, such as a mobile telephone. If any of the appended claims is read to cover a purely software implementation, at least one of the example sampler 202, the example masking evaluator 204, the example code frequency selector 206, the example code synthesizer 208, and the example combiner 210 of the encoder 102 and/or one or more of the example sampler 502, the example time to frequency domain converter 504, the example code frequency monitor 506, the example statistical processor 508, the example symbol determiner 510 and/or the example validity checker 512 of the example decoder 116 are hereby expressly defined to include a tangible medium such as a memory, DVD, CD, etc. Further still, the example encoder 102 and the example decoder 116 may include data structures, elements, processes and/or devices instead of, or in addition to, those illustrated in the drawings and described above, and/or may include more than one of any or all of the illustrated data structures, elements, processes and/or devices.
The processor platform 700 of the example of
The processor platform 700 also includes an interface circuit 730. The interface circuit 730 may be implemented by any type of interface standard, such as a USB interface, a Bluetooth interface, an external memory interface, serial port, general purpose input/output, etc. One or more input devices 735 and one or more output devices 740 are connected to the interface circuit 730.
Although certain example apparatus, methods, and articles of manufacture are described herein, other implementations are possible. The scope of coverage of this patent is not limited to the specific examples described herein. On the contrary, this patent covers all apparatus, methods, and articles of manufacture falling within the scope of the invention.
This disclosure is a continuation of U.S. patent application Ser. No. 18/157,681, filed Jan. 20, 2023, issued as U.S. patent Ser. No. ______, which is a continuation of U.S. patent application Ser. No. 17/216,239, filed Mar. 29, 2021, now U.S. Pat. No. 11,562,752, which is a continuation of U.S. patent application Ser. No. 16/806,851, filed Mar. 2, 2020, now U.S. Pat. No. 10,964,333, which is a continuation of U.S. patent application Ser. No. 15/973,154, filed May 7, 2018, now U.S. Pat. No. 10,580,421, which is a continuation of U.S. patent application Ser. No. 15/269,158, filed Sep. 19, 2016, now U.S. Pat. No. 9,972,332, which is a continuation of U.S. patent application Ser. No. 13/730,271, filed Dec. 28, 2012, now U.S. Pat. No. 9,460,730, which is a divisional of U.S. patent application Ser. No. 12/249,619, filed Oct. 10, 2008, now U.S. Pat. No. 8,369,972, which claims the benefit of U.S. Provisional Application Ser. Nos. 60/987,280 and 61/043,952, filed Nov. 12, 2007, and Apr. 10, 2008, respectively. U.S. patent application Ser. No. 18/157,681, U.S. patent application Ser. No. 17/216,239, U.S. patent application Ser. No. 16/806,851, U.S. patent application Ser. No. 15/973,154, U.S. patent application Ser. No. 15/269,158, U.S. patent application Ser. No. 13/730,271, U.S. patent application Ser. No. 12/249,619, U.S. Provisional Application Ser. No. 60/987,280 and U.S. Provisional Application Ser. No. 61/043,952 are hereby incorporated herein by reference in their respective entireties. Priority to U.S. patent application Ser. No. 18/157,681, U.S. patent application Ser. No. 17/216,239, U.S. patent application Ser. No. 16/806,851, U.S. patent application Ser. No. 15/973,154, U.S. patent application Ser. No. 15/269,158, U.S. patent application Ser. No. 13/730,271, U.S. patent application Ser. No. 12/249,619, U.S. Provisional Application Ser. No. 60/987,280 and U.S. Provisional Application Ser. No. 61/043,952 is claimed.
Number | Date | Country | |
---|---|---|---|
61043952 | Apr 2008 | US | |
60987280 | Nov 2007 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 12249619 | Oct 2008 | US |
Child | 13730271 | US |
Number | Date | Country | |
---|---|---|---|
Parent | 18157681 | Jan 2023 | US |
Child | 18630494 | US | |
Parent | 17216239 | Mar 2021 | US |
Child | 18157681 | US | |
Parent | 16806851 | Mar 2020 | US |
Child | 17216239 | US | |
Parent | 15973154 | May 2018 | US |
Child | 16806851 | US | |
Parent | 15269158 | Sep 2016 | US |
Child | 15973154 | US | |
Parent | 13730271 | Dec 2012 | US |
Child | 15269158 | US |