CA2564162C - Using reference files associated with nodes of a tree - Google Patents
Using reference files associated with nodes of a tree Download PDFInfo
- Publication number
- CA2564162C CA2564162C CA2564162A CA2564162A CA2564162C CA 2564162 C CA2564162 C CA 2564162C CA 2564162 A CA2564162 A CA 2564162A CA 2564162 A CA2564162 A CA 2564162A CA 2564162 C CA2564162 C CA 2564162C
- Authority
- CA
- Canada
- Prior art keywords
- profile
- mini
- matches
- chunks
- input
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Classifications
-
- G—PHYSICS
- G10—MUSICAL INSTRUMENTS; ACOUSTICS
- G10L—SPEECH ANALYSIS OR SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING; SPEECH OR AUDIO CODING OR DECODING
- G10L25/00—Speech or voice analysis techniques not restricted to a single one of groups G10L15/00 - G10L21/00
- G10L25/48—Speech or voice analysis techniques not restricted to a single one of groups G10L15/00 - G10L21/00 specially adapted for particular use
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/60—Information retrieval; Database structures therefor; File system structures therefor of audio data
- G06F16/63—Querying
- G06F16/632—Query formulation
- G06F16/634—Query by example, e.g. query by humming
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
- G06F16/60—Information retrieval; Database structures therefor; File system structures therefor of audio data
- G06F16/68—Retrieval characterised by using metadata, e.g. metadata not derived from the content or metadata generated manually
- G06F16/683—Retrieval characterised by using metadata, e.g. metadata not derived from the content or metadata generated manually using metadata automatically derived from the content
-
- G—PHYSICS
- G10—MUSICAL INSTRUMENTS; ACOUSTICS
- G10H—ELECTROPHONIC MUSICAL INSTRUMENTS; INSTRUMENTS IN WHICH THE TONES ARE GENERATED BY ELECTROMECHANICAL MEANS OR ELECTRONIC GENERATORS, OR IN WHICH THE TONES ARE SYNTHESISED FROM A DATA STORE
- G10H2240/00—Data organisation or data communication aspects, specifically adapted for electrophonic musical tools or instruments
- G10H2240/121—Musical libraries, i.e. musical databases indexed by musical parameters, wavetables, indexing schemes using musical parameters, musical rule bases or knowledge bases, e.g. for automatic composing methods
- G10H2240/131—Library retrieval, i.e. searching a database or selecting a specific musical piece, segment, pattern, rule or parameter set
- G10H2240/141—Library retrieval matching, i.e. any of the steps of matching an inputted segment or phrase with musical database contents, e.g. query by humming, singing or playing; the steps may include, e.g. musical analysis of the input, musical feature extraction, query formulation, or details of the retrieval process
Abstract
An input profile is generated from an input audio file using a measurable attribute that was used to generate reference profiles from reference audio files.
The input profile is then subjected to a process that was also used to generate a reference profiles tree, which is structured as a sparse binary tree, which is used by the audio matcher to facilitate and expedite the matching process from the reference profiles. The input profile is then compared with this subset of the reference profiles, representing potential matches, to determine that either it matches one of the reference profiles, or that it is a spoof, or that it does not match any of the reference profiles.
The input profile is then subjected to a process that was also used to generate a reference profiles tree, which is structured as a sparse binary tree, which is used by the audio matcher to facilitate and expedite the matching process from the reference profiles. The input profile is then compared with this subset of the reference profiles, representing potential matches, to determine that either it matches one of the reference profiles, or that it is a spoof, or that it does not match any of the reference profiles.
Description
WO 2005/109179 PCT/11JS2005/0156 t3 USING REFERENCE FILES ASSOCIATED
WITH NODES OF A TREE
FIELD OF THE INVENTION
[00 021 The present invention generally relates to techniques for identifying digitized samples of time varying signals and in particular, to a method and apparatus for identifying input files using reference files associated with nodes of a sparse binary tree.
BACKGROUND OF THE INVENTION
[0 0 031 In searching for particular audio files on the Internet, it is useful to be able to determine the identity of untitled audio files as well as to confirm that titled audio files are what they purport to be. Although a human may conceivably make such determinations and confirmations by simply listening to the content of the audio files by playing them through a media player, such an approach is not always reliable. Also, a process such as this involving human judgment is inherently very slow.
[00041 Therefore, it is advantageous to employ a computer to determine the identity of untitled audio files as well as to confirm that titled audio files are what they purport to be. The computer can not only store a lot of information to assist in identifying an input audio file, it can also process that information very quickly.
[ 0 0 051 In one technique employing a computer, an algorithm is used to uniquely identify audio file content. Using this approach, a master code is generated by performing the algorithm on content in a master audio file. By applying the same algorithm to the content of an input audio file, the calculated code may then be compared with the master code to determine a match.
[ 0 0 0 61 Use of such an algorithm, however, does not always lead to proper identification, because the content of an audio file may not have exactly the same length of recording as the content of the master audio file, for example, by starting at a point a little later in time, thus giving rise to a calculated code that would not match the master code. Also, if the content of the input audio file contains noise spikes or background noise, this would also give rise to a calculated code that would not match the master code. Thus, in both of these cases, the stored content is not properly identified.
OBJECTS AND SUMMARY OF THE INVENTION
[ 0 0 0 71 Accordingly, one object of the present invention is to provide a method and apparatus for identifying input files that are reliable even if their content is offset in time, or contains noise spikes or background noise.
[ 0 0 0 8 ] Another object is to provide a method and apparatus for identifying input files that are computationally fast when performed in a computer system.
[ 0 0 0 91 Another object is to provide a method and apparatus for identifying input files that minimize data storage requirements in a computer system.
[00101 These and other objects are accomplished by the various aspects of the present invention, wherein briefly stated, one aspect is a method for matching an input audio file with reference audio files, comprising: identifying potential matches of an input audio file among reference audio files based upon at least one common characteristic; and searching for a match of the input audio file among the potential matches.
WITH NODES OF A TREE
FIELD OF THE INVENTION
[00 021 The present invention generally relates to techniques for identifying digitized samples of time varying signals and in particular, to a method and apparatus for identifying input files using reference files associated with nodes of a sparse binary tree.
BACKGROUND OF THE INVENTION
[0 0 031 In searching for particular audio files on the Internet, it is useful to be able to determine the identity of untitled audio files as well as to confirm that titled audio files are what they purport to be. Although a human may conceivably make such determinations and confirmations by simply listening to the content of the audio files by playing them through a media player, such an approach is not always reliable. Also, a process such as this involving human judgment is inherently very slow.
[00041 Therefore, it is advantageous to employ a computer to determine the identity of untitled audio files as well as to confirm that titled audio files are what they purport to be. The computer can not only store a lot of information to assist in identifying an input audio file, it can also process that information very quickly.
[ 0 0 051 In one technique employing a computer, an algorithm is used to uniquely identify audio file content. Using this approach, a master code is generated by performing the algorithm on content in a master audio file. By applying the same algorithm to the content of an input audio file, the calculated code may then be compared with the master code to determine a match.
[ 0 0 0 61 Use of such an algorithm, however, does not always lead to proper identification, because the content of an audio file may not have exactly the same length of recording as the content of the master audio file, for example, by starting at a point a little later in time, thus giving rise to a calculated code that would not match the master code. Also, if the content of the input audio file contains noise spikes or background noise, this would also give rise to a calculated code that would not match the master code. Thus, in both of these cases, the stored content is not properly identified.
OBJECTS AND SUMMARY OF THE INVENTION
[ 0 0 0 71 Accordingly, one object of the present invention is to provide a method and apparatus for identifying input files that are reliable even if their content is offset in time, or contains noise spikes or background noise.
[ 0 0 0 8 ] Another object is to provide a method and apparatus for identifying input files that are computationally fast when performed in a computer system.
[ 0 0 0 91 Another object is to provide a method and apparatus for identifying input files that minimize data storage requirements in a computer system.
[00101 These and other objects are accomplished by the various aspects of the present invention, wherein briefly stated, one aspect is a method for matching an input audio file with reference audio files, comprising: identifying potential matches of an input audio file among reference audio files based upon at least one common characteristic; and searching for a match of the input audio file among the potential matches.
[00111 Another aspect is a method for matching an input audio file with reference audio files, comprising: identifying potential matches of an input audio file among reference audio files based upon at least one common characteristic;
and comparing an input profile resulting from a measurable attribute of the input audio file with reference profiles resulting from the same measurable attribute of the potential matches to determine a match.
[00121 Another aspect is a method for matching an input file with reference files, comprising: identifying potential matches of an input file among reference files by associating nodes of a sparse binary tree with the input file in a same manner used to associate nodes of the sparse binary tree with the reference files; and searching for a match of the input file among the potential matches., [00131 Another aspect is a method for matching an input file with reference files, comprising: identifying potential matches of an input file among reference files by associating nodes of a sparse binary tree with the input file in a same manner used to associate nodes of the sparse binary tree with the reference files; and comparing a profile resulting from a measurable attribute of the input file with profiles resulting from the same measurable attribute of the potential matches to determine a match.
[00141 Another aspect is a method for matching an input audio file with reference audio files, comprising: generating an input profile from an input audio file based upon a measurable attribute also used to generate reference profiles from reference audio files; identifying potential matches among the reference profiles with the input profile by processing the input profile in a manner used to associate individual of the reference profiles with nodes of a sparse binary tree;
and comparing the input profile with the potential matches to determine a match.
[0 0151 Still another aspect is a method for matching an input audio file with reference audio files, comprising: generating reference profiles from reference audio files using a measurable attribute; generating a sparse binary tree by applying a process to the reference profiles such that identifications of the reference profiles are associated at resulting nodes of the sparse binary tree;
generating an input profile from the input audio file using the measurable attribute; applying the process to the input profile so that associated reference profiles are identified from resulting nodes of the sparse binary tree; and comparing at least a portion of the input profile with corresponding portions of the identified reference profiles to determine a match.
[00161 Another aspect is an apparatus for matching an input audio file with reference audio files, comprising at least one computer configured to:
identify potential matches of an input audio file among reference audio files based upon at least one common characteristic; and search for a match of the input audio file among the potential matches.
[00171 Another aspect is an apparatus for matching an input audio file with reference audio files, comprising at least one computer configured to:
identify potential matches of an input audio file among reference audio files based upon at least one common characteristic; and compare an input profile resulting from a measurable attribute of the input audio file with reference profiles resulting from the same measurable attribute of the potential matches to determine a match.
[0 0181 Another aspect is an apparatus for matching an input file with reference files, comprising at least one computer configured to: identify potential matches of an input file among reference files by associating nodes of a sparse binary tree with the input file in a same manner used to associate nodes of the sparse binary tree with the reference files; and search for a match of the input file among the potential matches.
[ 0 019 ] Another aspect is an apparatus for matching an input file with reference files, comprising at least one computer configured to: identify potential matches of an input file among reference files by associating nodes of a sparse binary tree with the input file in a same manner used to associate nodes of the sparse binary tree with the reference files; and compare a profile resulting from a measurable attribute of the input file with profiles resulting from the same measurable attribute of the potential matches to determine a match.
[ 0 02 0 ] Another aspect is an apparatus for matching an input audio file with reference audio files, comprising at least one computer configured to:
generate an input profile from an input audio file based upon a measurable attribute also used to generate reference profiles from reference audio files;
identify potential matches among the reference profiles with the input profile by processing the input profile in a manner used to associate individual of the reference profiles with nodes of a sparse binary tree; and compare the input profile with the potential matches to determine a match.
[00211 Yet another aspect is an apparatus for matching an input audio file with reference audio files, comprising at least one computer configured to:
generate reference profiles from reference audio files using a measurable attribute; generate a sparse binary tree by applying a process to the reference profiles such that identifications of the reference profiles are associated at resulting nodes of the sparse binary tree; generate an input profile from the input audio file using the measurable attribute; apply the process to the input profile so that associated reference profiles are identified from resulting nodes of the sparse binary tree; and compare at least a portion of the input profile with corresponding portions of the identified reference profiles to determine a match.
[ 0 0221 Additional objects, features and advantages of the various aspects of the present invention will become apparent from the following description of its preferred embodiment, which description should be taken in conjunction with the accompanying drawings.
BRIEF DESCRIPTION OF THE DRAWINGS
[ 0 0231 FIG. 1 illustrates a data flow diagram for an audio matcher program, utilizing aspects of the present invention.
[ 0 0241 FIG. 2 illustrates a flow diagram of a method for generating reference profiles and a reference profiles tree, utilizing aspects of the present invention.
[0 0251 FIG. 3 illustrates a flow diagram of a method for generating profiles from digitized audio clips, utilizing aspects of the present invention.
[ 0 02 61 FIG. 4 illustrates a flow diagram of a method for generating a reference profiles tree, utilizing aspects of the present invention.
[0 0271 FIG. 5 illustrates a flow diagram of a method for associating reference profile information with nodes of a reference profiles tree, utilizing aspects of the present invention.
[ 0 02 81 FIG. 6 illustrates a flow diagram of a method for storing a profile hook into a reference profiles tree for each chunk offset of a reference profile identified as being a local maximum, utilizing aspects of the present invention.
[0 029] FIG. 7 illustrates a flow diagram of a method for generating an input profile from an input audio clip.
[ 0 03 0 ] FIG. 8 illustrates a diagram for functions performed by an audio matcher, utilizing aspects of the present invention.
[0031] FIG. 9 illustrates a flow diagram of a method for sampling input profile chunks and determining chunk offsets to be used for searching a reference profiles tree for profile hooks, utilizing aspects of the present invention.
[ 0 032 ] FIG. 10 illustrates a flow diagram of a method for searching a reference profiles tree for profile hooks corresponding to an input profile chunk offset, utilizing aspects of the present invention.
[ 0 0331 FIG. 11 illustrates a flow diagram of a method for comparing an input profile against reference profiles corresponding to profile hooks retrieved from a reference profiles tree search, utilizing aspects of the present invention.
[00341 FIG. 12 illustrates a flow diagram of a method for merging mini-matches, utilizing aspects of the present invention.
[ 0 03 51 FIG. 13 illustrates a diagram for sub-functions performed by an audio matcher, utilizing aspects of the present invention.
[ 0 03 61 FIG. 14 illustrates a flow diagram of a method for identifying an input file as a spoof file, utilizing aspects of the present invention.
[ 0 03 71 FIG. 15 illustrates a flow diagram of a method for identifying a best match for an input file, utilizing aspects of the present invention.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT
[ 0 03 8 ] All methods, generators and programs described herein are preferably performed on one or more computers cooperating together such as in a distributed or other processing environment.
[ 0 03 91 Referring to FIG. 1, an audio matcher program 100 matches an input profile 101 of an input audio clip to one of a store of reference profiles 102 of reference audio clips. In addition to the input profile 101 and the reference profiles 102, a reference profiles tree 103 is also used by the audio matcher 100 to facilitate and expedite the matching process, which in this case, results in one of the following outcomes: a determination that the input profile 101 is a spoof (for example, its corresponding input audio clip is not what it purports to be), or an identification of an acceptable best match for the input profile 101 among the reference profiles 102, or a determination that no acceptable match has been found for the input profile 101 among the reference profiles 102.
[ 0 04 01 The reference audio clips in this case may be published music that is protected by copyright law, and the input audio clips may be audio files either residing on user computers or being transmitted through the Internet using a file sharing network. Formats for the audio clips may be any standard format such as MP3.
[ 0 04 1] FIG. 2 illustrates, as an example, a method by which the reference profiles and the reference profiles tree are generated. In particular, a profile generator 202 generates the reference profiles 102 from corresponding reference audio clips 201. A reference profiles tree generator 203 then generates a references profiles tree 103 from the reference profiles 102. The format of the reference profiles tree 103 is a sparse binary tree in order to minimize data storage requirements and maximize search performance.
[ 0 0421 FIG. 3 illustrates, as an example, a method performed by the profile generator 202 to generate profiles from digitized audio clips. In the method, a chunk represents a programmable period of time such as 0.1 seconds of the audio clip. In 301, digitized sample information for a first chunk of the audio clip is serially read, and in 302, the number of zero crossings in the chunk is counted. A zero crossing occurs each time the sign changes between adjacent samples. In 303, a determination is made whether the current chunk is a last chunk in the profile. If the determination results in a YES, then the profile generator 202 terminates. On the other hand, if the determination is NO, then in 304, digitized sample information for a next chunk of the audio clip is serially read, and the process continues by jumping back to 302 and repeating 302-304 until the last chunk in the profile has been processed through 302.
[ 0 0431 The profile generator 202 is used to generate reference profiles 102 from reference audio clips 201 (as shown in FIG. 2) and to generate an input profile 101 from an input audio clip 701 (as shown in FIG. 7). In addition to counting zero crossings as described in reference to FIG. 3, the profile generator 202 may also generate other information such as amplitude ratios between successive chunks to better characterize audio clips in its generated profiles and improve matching accuracy by the audio matcher 100 through the use of such enhanced profiles.
[00441 FIG. 4 illustrates, as an example, a method performed by the reference profiles tree generator 203 to generate a reference profiles tree 103 by including reference profile information for each of the reference profiles 102 in it.
As previously described, the reference profiles tree 103 is generated as a sparse binary tree.
[00451 FIG. 5 illustrates, as an example, a method performed in function 402 of FIG. 4 to add reference profile information to the reference profiles tree 103. As noted in FIG. 4, this method will be performed for each of the reference profiles 102, so that information of all of the reference profiles will be stored in the same reference profiles tree 103. The reference profiles tree 103 and particularly, its sparse binary tree architecture, will subsequently be used by the audio matcher to significantly speed up the matching process.
[ 0 04 61 As used herein, the term "chunk offset" means the difference in number of chunks between a current chunk of the reference profile and a first chunk of the reference profile, plus one. Thus, the number of the chunk is equal to the chunk offset in this convention.
[00471 Two programmable parameters are used in the method. The term "velocity" means the number of chunks between local maximums in the reference profile, and the term "acceleration" means the change in velocity divided by the number of chunks over which the change occurs. Initial values for velocity and acceleration are pre-defined prior to performance of the function 402. As an example, the initial velocity may be set to 1, and the initial acceleration may also be set to 1. The velocity is then modified according to the method. The acceleration, on the other hand, is generally constant at its initial value.
[00481 In 501, the chunk offset is initialized to be equal to the initial velocity. In 502, a determination is made whether the zero crossing count for the current chunk is a local maximum. To be considered a local maximum, the zero crossing count for the current chunk must be greater by a programmed threshold value than both the zero crossing count for the chunk right before the current chunk and the zero crossing count for the chunk right after the current chunk.
In situations where the current chunk does not have either a chunk right before it (i.e., it is the first chunk in the reference profile) or a chunk right after it (i.e., it is the last chunk in the reference profile), a zero will be assumed for the zero crossing count in those cases.
[00491 If the determination in 502 is YES, then in 503, a profile hook for this chunk offset is stored in the reference profiles tree 103. Additional details on 503 are described in reference to FIG. 6 below.
[00501 On the other hand, if the determination in 502 is NO, then in 504, the chunk offset is incremented by the velocity.
[00511 In 505, a determination is then made whether the end of the reference file has been reached. This determination would be YES, if the new chunk offset is greater than the chunk number of the last chunk in the reference profile. Therefore, if the determination in 505 is YES, then the method is done, and another reference profile can be processed as shown in FIG. 4.
[00521 On the other hand, if the determination in 505 is NO, then in 506, the velocity is incremented by the acceleration. By incrementing the velocity in this fashion, chunks will be processed in a more efficient manner. Rather then processing every chunk in a reference profile to see if it is a local maximum, chunks are processed in a quadratically increasing fashion to take advantage of the observation that matches between input profiles and reference profiles usually can be determined early on in the profiles.
[ 0 0531 The method then loops back to 502 to process the newly calculated chunk offset, and continues looping through 502506 until the end of the reference profile is determined in 505.
[0 0541 FIG. 6 illustrates, as an example, a method performed in function 503 of FIG. 5 to store a profile hook into the reference profiles tree 103 for each chunk offset identified in 502 of FIG. 5 as having a local maximum zero crossing count. In 601 and 602 respectively, the current node at which processing starts on the sparse binary tree is set to its root node and the chunk at which processing starts is set to the chunk offset being processed at the time.
[0055] In 603, a determination is made whether the zero crossing count for the current chunk is greater than a programmable constant or threshold value.
If the determination in 603 is NO, then in 604, the current node is changed to a right-branch child node, which is created at that time if it doesn't already exist in the reference profiles tree 103. On the other hand, if the determination in 603 is YES, then in 605, the current node is changed to a left-branch child node, which is created at that time if it doesn't already exist in the reference profiles tree 103.
[ 0 05 61 In 606, a determination is then made whether the current chunk is the last chunk in the reference profile. If the determination in 606 is NO, then in 607, the current chunk is incremented by 1, and the method loops back to 603, and continues looping through 603607 until the determination in 606 is YES.
When the determination in 606 is YES, then in 608, the method stores the profile hook in the then current node, and is done. The profile hook in this case includes a profile identification or "ID" and the chunk offset that is being processed at the time in function 503. The profile ID serves to uniquely identify the content of thee reference profile in this case.
[0 0571 In the following description, it is now assumed that generation of the reference profiles tree 103 is complete so that it contains information of profile hooks for each of the reference profiles 102 at various of its nodes.
[ 0 0 5 8 ] FIG. 7 illustrates, as an example, a method for generating an input profile 101 that parallels the method used for generating each of the reference profiles 102.
[ 0 05 91 FIG. 8 illustrates three primary functions performed by the audio matcher 100. In a first function 801, the audio matcher 100 identifies mini-matches of an input profile 101 in the reference profiles tree 103. If no mini-matches are found, then this function reports back that the input profile is a no-match. Since the no-match is determined early on in the process, this avoids the necessity to perform subsequent processing to determine a best match or that the input profile is for a spoof.
[ 0 0 601 Assuming mini-matches have been identified between the input profile and one or more reference profiles, then in a second function 802, the audio matcher 100 then stores and merges when appropriate the mini-matches for subsequent processing. In a third function 803, the audio matcher 100 then determines one of the following: an acceptable best match for the input profile; a determination that the input profile is a spoof; or a no-match if the input profile is not determined to be a spoof or if an acceptable best match cannot be found.
[0 0611 FIG. 9 illustrates, as an example, a method for performing the mini-match identifying function 801 of FIG. 8. The method parallels that of FIG. 5, wherein local maximums in a reference profile are identified so that profile hooks can be stored in the reference profiles tree 103. In this case, however, local maximums in the input profile are identified so that mini-matches may be found in the reference profiles tree 103. In particular, the identification of zero crossing count local maximums in the input profile as performed in 901, and 904-906 are performed identically as their counterparts 501, 502 and 504506 of FIG. 5 in identifying zero crossing count local maximums in a reference profile.
[0 0 62 ] In 903, however, rather than storing a profile hook in the reference profiles tree for the chunk offset as performed in 503 of FIG. 5, the chunk offset is used to search for matches in the reference profiles tree 103.
[ 0 0 63 ] FIG. 10 illustrates, as an example, a method performed in function 903 of FIG. 9. The method is similar to that of FIG. 6, wherein movement down the reference profiles tree 103 is performed. In this case, however, zero crossing counts in the input profile are used instead of the zero crossing counts in a reference profile to determine the movement down the reference profiles tree 103.
[0064] Starting in 1001, the current node in the reference profiles tree 103 is initially set to the root node, and in 1002, the current chunk is set to the chunk offset currently being processed.
[0065] In 1003, a determination is made whether the zero crossing count for the current chunk is greater than a programmable constant. The constant that is to be used here is the same as that used in 603 of FIG. 6.
[ 0 0661 If the determination in 1003 is NO, then in 1004, the current node is changed to a right-branch child node. On the other hand, if the determination in 1003 is YES, then in 1005, the current node is changed to a left-branch child node.
[ 0 0 671 In 1006, a determination is then made whether the current chunk is the last chunk in the input profile. If the determination in 1006 is NO, then in 1007, the current chunk is incremented by 1, and the method loops back to 1003, and continues looping through 10031007 until the determination in 1006 is YES. When the determination in 1006 is YES, then in 1008, the method matches the input profile against all reference profiles identified in profile hooks stored at the current node of the reference profiles tree 103.
[0 0 68 ] FIG. 11 illustrates, as an example, a method for performing the function 1008 of FIG. 10. In 1101, a determination is first made whether there are any reference profiles identified in reference profile hooks stored at the current node of the reference profiles tree 103. If the determination in 1101 is NO, then the method has nothing more to do so it ends.
[0 0 6 9 ] On the other hand, if the determination in 1101 is YES, then in 1102, the first N chunks of the input profile are compared with the corresponding first N chunks of a first reference profile identified. In 1103, a determination is made whether they match. In order for corresponding chunks to match, their zero crossing counts do not have to be exactly equal. As long as the absolute difference between the zero crossing counts is within a programmed tolerance, they may be determined to be a match. Also, it may not be necessary for all of the first N chunks to match, the match determination may be a YES as long as a high enough percentage of the first N chunks match.
[ 0 07 01 If the determination in 1103 is a YES, then in 1104, a mini-match at the current offset of the input profile is generated. Generation of the mini-match involves including the information in the following table in the mini-match.
Table 1. Information included in a mini-match.
Parameter Description time, The offset into the input profile at which this match begins.
time2 The offset into the input profile at which this match ends.
wt1 The offset into the input profile at which the reference profile begins.
wt2 The offset into the input profile at which the reference profile ends.
time matched The amount of match time represented by this mini-match.
full match "True" if this is a "full" match.
source The ID for the reference profile corresponding to this mini-match.
err The total amount of error in this mini-match.
ID An identifier for the mini-match.
[00711 On the other hand, if the determination in 1103 is a NO, then in 1105, a determination is made whether there is another reference profile identified at the current node of the reference profiles tree 103. If the determination in 1105 is YES, then in 1106, the first N chunks of the input profile are then compared with those of the next identified reference profile, and the method continues by looping through 11031106 until either a match is found or there are no more reference profiles to be compared against the input profile.
[ 0 072 ] If the determination in 1105 results at any time in a NO, then in 1107, the method generates a "non-full" mini-match using the best matching one of the reference profiles identified at the current node of the reference profiles tree 103 (i.e., the reference profile whose first N chunks came closest to being determined as a match to the first N chunks of the input profile). As with the "full" mini-match generated in 1104, the "non-full" mini-match will also be associated to the current offset of the input profile.
[ 0 0 73 ] FIG. 12 illustrates, as an example, a method for performing the mini-match storing and merger function 802 of FIG. 8. In 1201, a first one of the mini-matches generated in the function 801 of FIG. 8 is input. The mini-match can be either a "full" or "non-full" mini-match. In 1202, a determination is made whether any mini-matches have already been stored in the audio matcher 100 for subsequent processing. If the determination in 1202 is NO (as it will be for the first mini-match being input for the input profile), then in 1203, the mini-match is added to the store and the method jumps down to 1207.
[00741 In 1207, a determination is then made whether there are any more mini-matches to be input. If the determination in 1207 is YES, then the method jumps back to 1201 to input the next mini-match. In 1202, a determination is once again made whether there are any stored mini-matches. This time, since the first mini-match was stored, the determination will result in a YES, so that the method proceeds to 1204.
[00751 In 1204, a search is performed to find a merger candidate for the current mini-match among the mini-matches already in the store. In order to be considered a merger candidate, the current mini-match and the stored mini-match must refer to the same reference profile ID, and any difference between their respective wt, parameters (offsets into the input profile at which the reference profile begins) must be within a specified tolerance such as 50 chunks or 5 seconds.
[ 0 0 76] In 1205, a determination is then made whether a merger candidate has been found. If the determination in 1205 is NO, then the current mini-match is added to the store in 1203, and the method proceeds from there as previously described.
[0 077] On the other hand, if the determination in 1205 is YES, then in 1206, the current mini-match is merged with the merger candidate. When merging the current mini-match with the merger candidate, the parameter values for wtl, wt2, time, and time2 of the merged mini-match are weighted averages of the current mini-match and the merger candidate values, weighted by their respective matched times. The parameter value for "err" of the merged mini-match is the sum of the current mini-match and the merger candidate values. If either the current mini-match or the merger candidate is a "full" match, then the merged mini-match has its full match parameter set to true.
[0 0781 After merger, the method proceeds to 1207.
[ 0 0791 In 1207, a determination is made whether there are any more mini-matches to be processed. If the determination in 1207 is YES, then the method proceeds by looping through 12011207 until all mini-matches have been processed by either being stored individually in the audio matcher store or merged with another mini-match already stored in the audio matcher store, and the determination in 1207 at that time results in a NO.
[ 0 08 01 FIG. 13 illustrates, as an example, a software structure for implementing the function 803 of FIG. 8 in which a first function 1301 determines if the input profile is a spoof, and a second function 1302 finds a best match from the store of mini-matches generated in 802 of FIG. 8. The first and second functions 1301 and 1302 maybe performed serially, or in parallel as shown. If both functions 1301 and 1302 fail (i.e., the first function 1301 fails to identify the input profile 101 as a spoof and the second function 1302 fails to find an acceptable best match), then in 1303, it is determined that the input profile 101 is a no-match (i.e., no match has been found for it among the reference profiles 102).
[00811 FIG. 14 illustrates, as an example, a method for performing the first function 1301 to determine whether the input profile is a spoof. In 1401, a determination is made whether there is more than one reference profile identified by the mini-matches in the store. If the determination in 1401 results in a NO, then in 1402, a no spoof found conclusion is made and the method stops at that point.
[ 0 0821 On the other hand, if the determination in 1401 is YES, then in 1403, a determination is made whether the sum of the time matched for all the mini-matches in the store is greater than some threshold percentage of the input profile such as, for example, 70%. If the determination in 1403 results in a NO, then in 1402, a no spoof found conclusion is made and the method stops at that point.
[ 0 0 8 3 ] On the other hand, if the determination in 1403 is YES, then in 1404, a determination is made whether each mini-match has an error/second value that is less than some maximum value. The error/second value for each mini-match may be calculated by the ratio of the mini-match's "err" parameter and "time matched" parameter. If the determination in 1404 results in a NO, then in 1402, a no spoof found conclusion is made and the method stops at that point.
[ 0 0 841 On the other hand, if the determination in 1404 is YES, then in 1405, a spoof found conclusion is made and the method stops at that point. In this case, the spoof maybe formed by compositing several tracks together or looping the same segment of one track. Since these kinds of spoofs are quite common on peer-to-peer networks, the ability to automatically identify them is useful.
[0 0 85] FIG. 15 illustrates, as an example, a method for performing the second function 1302 to find an acceptable best match for the input profile 101.
In 1501 and 1502, the method starts by ignoring all "non-full" mini-matches and all mini-matches having an errors/second greater than a maximum allowable value.
[ 0 0 86] In 1503, the method then identifies one of the remaining mini-matches as a best match according to programmed criteria such as its errors/second value, its time matched value, and the percentage of its reference profile that it recognizes. Typically, the best match will be a mini-match that exceeds all other mini-matches in all of these criteria. In the event that two mini-matches are close, some weighting of the criteria may be performed to determine a best match between the two.
[ 0 0871 In 1504, a determination is then made whether the percentage of the input profile and the reference profile covered by the best match exceeds some minimum value. If the determination in 1504 is YES, then in 1505, the best match identified in 1503 is concluded to be an acceptable best match and the method ends at that point. On the other hand, if the determination in 1504 is NO, then the best match identified in 1503 is concluded in 1506 to be an unacceptable best match and the method ends at that point with a conclusion in this case that no acceptable best match was found.
[00881 Although the various aspects of the present invention have been described with respect to a preferred embodiment, it will be understood that the invention is entitled to full protection within the full scope of the appended claims.
and comparing an input profile resulting from a measurable attribute of the input audio file with reference profiles resulting from the same measurable attribute of the potential matches to determine a match.
[00121 Another aspect is a method for matching an input file with reference files, comprising: identifying potential matches of an input file among reference files by associating nodes of a sparse binary tree with the input file in a same manner used to associate nodes of the sparse binary tree with the reference files; and searching for a match of the input file among the potential matches., [00131 Another aspect is a method for matching an input file with reference files, comprising: identifying potential matches of an input file among reference files by associating nodes of a sparse binary tree with the input file in a same manner used to associate nodes of the sparse binary tree with the reference files; and comparing a profile resulting from a measurable attribute of the input file with profiles resulting from the same measurable attribute of the potential matches to determine a match.
[00141 Another aspect is a method for matching an input audio file with reference audio files, comprising: generating an input profile from an input audio file based upon a measurable attribute also used to generate reference profiles from reference audio files; identifying potential matches among the reference profiles with the input profile by processing the input profile in a manner used to associate individual of the reference profiles with nodes of a sparse binary tree;
and comparing the input profile with the potential matches to determine a match.
[0 0151 Still another aspect is a method for matching an input audio file with reference audio files, comprising: generating reference profiles from reference audio files using a measurable attribute; generating a sparse binary tree by applying a process to the reference profiles such that identifications of the reference profiles are associated at resulting nodes of the sparse binary tree;
generating an input profile from the input audio file using the measurable attribute; applying the process to the input profile so that associated reference profiles are identified from resulting nodes of the sparse binary tree; and comparing at least a portion of the input profile with corresponding portions of the identified reference profiles to determine a match.
[00161 Another aspect is an apparatus for matching an input audio file with reference audio files, comprising at least one computer configured to:
identify potential matches of an input audio file among reference audio files based upon at least one common characteristic; and search for a match of the input audio file among the potential matches.
[00171 Another aspect is an apparatus for matching an input audio file with reference audio files, comprising at least one computer configured to:
identify potential matches of an input audio file among reference audio files based upon at least one common characteristic; and compare an input profile resulting from a measurable attribute of the input audio file with reference profiles resulting from the same measurable attribute of the potential matches to determine a match.
[0 0181 Another aspect is an apparatus for matching an input file with reference files, comprising at least one computer configured to: identify potential matches of an input file among reference files by associating nodes of a sparse binary tree with the input file in a same manner used to associate nodes of the sparse binary tree with the reference files; and search for a match of the input file among the potential matches.
[ 0 019 ] Another aspect is an apparatus for matching an input file with reference files, comprising at least one computer configured to: identify potential matches of an input file among reference files by associating nodes of a sparse binary tree with the input file in a same manner used to associate nodes of the sparse binary tree with the reference files; and compare a profile resulting from a measurable attribute of the input file with profiles resulting from the same measurable attribute of the potential matches to determine a match.
[ 0 02 0 ] Another aspect is an apparatus for matching an input audio file with reference audio files, comprising at least one computer configured to:
generate an input profile from an input audio file based upon a measurable attribute also used to generate reference profiles from reference audio files;
identify potential matches among the reference profiles with the input profile by processing the input profile in a manner used to associate individual of the reference profiles with nodes of a sparse binary tree; and compare the input profile with the potential matches to determine a match.
[00211 Yet another aspect is an apparatus for matching an input audio file with reference audio files, comprising at least one computer configured to:
generate reference profiles from reference audio files using a measurable attribute; generate a sparse binary tree by applying a process to the reference profiles such that identifications of the reference profiles are associated at resulting nodes of the sparse binary tree; generate an input profile from the input audio file using the measurable attribute; apply the process to the input profile so that associated reference profiles are identified from resulting nodes of the sparse binary tree; and compare at least a portion of the input profile with corresponding portions of the identified reference profiles to determine a match.
[ 0 0221 Additional objects, features and advantages of the various aspects of the present invention will become apparent from the following description of its preferred embodiment, which description should be taken in conjunction with the accompanying drawings.
BRIEF DESCRIPTION OF THE DRAWINGS
[ 0 0231 FIG. 1 illustrates a data flow diagram for an audio matcher program, utilizing aspects of the present invention.
[ 0 0241 FIG. 2 illustrates a flow diagram of a method for generating reference profiles and a reference profiles tree, utilizing aspects of the present invention.
[0 0251 FIG. 3 illustrates a flow diagram of a method for generating profiles from digitized audio clips, utilizing aspects of the present invention.
[ 0 02 61 FIG. 4 illustrates a flow diagram of a method for generating a reference profiles tree, utilizing aspects of the present invention.
[0 0271 FIG. 5 illustrates a flow diagram of a method for associating reference profile information with nodes of a reference profiles tree, utilizing aspects of the present invention.
[ 0 02 81 FIG. 6 illustrates a flow diagram of a method for storing a profile hook into a reference profiles tree for each chunk offset of a reference profile identified as being a local maximum, utilizing aspects of the present invention.
[0 029] FIG. 7 illustrates a flow diagram of a method for generating an input profile from an input audio clip.
[ 0 03 0 ] FIG. 8 illustrates a diagram for functions performed by an audio matcher, utilizing aspects of the present invention.
[0031] FIG. 9 illustrates a flow diagram of a method for sampling input profile chunks and determining chunk offsets to be used for searching a reference profiles tree for profile hooks, utilizing aspects of the present invention.
[ 0 032 ] FIG. 10 illustrates a flow diagram of a method for searching a reference profiles tree for profile hooks corresponding to an input profile chunk offset, utilizing aspects of the present invention.
[ 0 0331 FIG. 11 illustrates a flow diagram of a method for comparing an input profile against reference profiles corresponding to profile hooks retrieved from a reference profiles tree search, utilizing aspects of the present invention.
[00341 FIG. 12 illustrates a flow diagram of a method for merging mini-matches, utilizing aspects of the present invention.
[ 0 03 51 FIG. 13 illustrates a diagram for sub-functions performed by an audio matcher, utilizing aspects of the present invention.
[ 0 03 61 FIG. 14 illustrates a flow diagram of a method for identifying an input file as a spoof file, utilizing aspects of the present invention.
[ 0 03 71 FIG. 15 illustrates a flow diagram of a method for identifying a best match for an input file, utilizing aspects of the present invention.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT
[ 0 03 8 ] All methods, generators and programs described herein are preferably performed on one or more computers cooperating together such as in a distributed or other processing environment.
[ 0 03 91 Referring to FIG. 1, an audio matcher program 100 matches an input profile 101 of an input audio clip to one of a store of reference profiles 102 of reference audio clips. In addition to the input profile 101 and the reference profiles 102, a reference profiles tree 103 is also used by the audio matcher 100 to facilitate and expedite the matching process, which in this case, results in one of the following outcomes: a determination that the input profile 101 is a spoof (for example, its corresponding input audio clip is not what it purports to be), or an identification of an acceptable best match for the input profile 101 among the reference profiles 102, or a determination that no acceptable match has been found for the input profile 101 among the reference profiles 102.
[ 0 04 01 The reference audio clips in this case may be published music that is protected by copyright law, and the input audio clips may be audio files either residing on user computers or being transmitted through the Internet using a file sharing network. Formats for the audio clips may be any standard format such as MP3.
[ 0 04 1] FIG. 2 illustrates, as an example, a method by which the reference profiles and the reference profiles tree are generated. In particular, a profile generator 202 generates the reference profiles 102 from corresponding reference audio clips 201. A reference profiles tree generator 203 then generates a references profiles tree 103 from the reference profiles 102. The format of the reference profiles tree 103 is a sparse binary tree in order to minimize data storage requirements and maximize search performance.
[ 0 0421 FIG. 3 illustrates, as an example, a method performed by the profile generator 202 to generate profiles from digitized audio clips. In the method, a chunk represents a programmable period of time such as 0.1 seconds of the audio clip. In 301, digitized sample information for a first chunk of the audio clip is serially read, and in 302, the number of zero crossings in the chunk is counted. A zero crossing occurs each time the sign changes between adjacent samples. In 303, a determination is made whether the current chunk is a last chunk in the profile. If the determination results in a YES, then the profile generator 202 terminates. On the other hand, if the determination is NO, then in 304, digitized sample information for a next chunk of the audio clip is serially read, and the process continues by jumping back to 302 and repeating 302-304 until the last chunk in the profile has been processed through 302.
[ 0 0431 The profile generator 202 is used to generate reference profiles 102 from reference audio clips 201 (as shown in FIG. 2) and to generate an input profile 101 from an input audio clip 701 (as shown in FIG. 7). In addition to counting zero crossings as described in reference to FIG. 3, the profile generator 202 may also generate other information such as amplitude ratios between successive chunks to better characterize audio clips in its generated profiles and improve matching accuracy by the audio matcher 100 through the use of such enhanced profiles.
[00441 FIG. 4 illustrates, as an example, a method performed by the reference profiles tree generator 203 to generate a reference profiles tree 103 by including reference profile information for each of the reference profiles 102 in it.
As previously described, the reference profiles tree 103 is generated as a sparse binary tree.
[00451 FIG. 5 illustrates, as an example, a method performed in function 402 of FIG. 4 to add reference profile information to the reference profiles tree 103. As noted in FIG. 4, this method will be performed for each of the reference profiles 102, so that information of all of the reference profiles will be stored in the same reference profiles tree 103. The reference profiles tree 103 and particularly, its sparse binary tree architecture, will subsequently be used by the audio matcher to significantly speed up the matching process.
[ 0 04 61 As used herein, the term "chunk offset" means the difference in number of chunks between a current chunk of the reference profile and a first chunk of the reference profile, plus one. Thus, the number of the chunk is equal to the chunk offset in this convention.
[00471 Two programmable parameters are used in the method. The term "velocity" means the number of chunks between local maximums in the reference profile, and the term "acceleration" means the change in velocity divided by the number of chunks over which the change occurs. Initial values for velocity and acceleration are pre-defined prior to performance of the function 402. As an example, the initial velocity may be set to 1, and the initial acceleration may also be set to 1. The velocity is then modified according to the method. The acceleration, on the other hand, is generally constant at its initial value.
[00481 In 501, the chunk offset is initialized to be equal to the initial velocity. In 502, a determination is made whether the zero crossing count for the current chunk is a local maximum. To be considered a local maximum, the zero crossing count for the current chunk must be greater by a programmed threshold value than both the zero crossing count for the chunk right before the current chunk and the zero crossing count for the chunk right after the current chunk.
In situations where the current chunk does not have either a chunk right before it (i.e., it is the first chunk in the reference profile) or a chunk right after it (i.e., it is the last chunk in the reference profile), a zero will be assumed for the zero crossing count in those cases.
[00491 If the determination in 502 is YES, then in 503, a profile hook for this chunk offset is stored in the reference profiles tree 103. Additional details on 503 are described in reference to FIG. 6 below.
[00501 On the other hand, if the determination in 502 is NO, then in 504, the chunk offset is incremented by the velocity.
[00511 In 505, a determination is then made whether the end of the reference file has been reached. This determination would be YES, if the new chunk offset is greater than the chunk number of the last chunk in the reference profile. Therefore, if the determination in 505 is YES, then the method is done, and another reference profile can be processed as shown in FIG. 4.
[00521 On the other hand, if the determination in 505 is NO, then in 506, the velocity is incremented by the acceleration. By incrementing the velocity in this fashion, chunks will be processed in a more efficient manner. Rather then processing every chunk in a reference profile to see if it is a local maximum, chunks are processed in a quadratically increasing fashion to take advantage of the observation that matches between input profiles and reference profiles usually can be determined early on in the profiles.
[ 0 0531 The method then loops back to 502 to process the newly calculated chunk offset, and continues looping through 502506 until the end of the reference profile is determined in 505.
[0 0541 FIG. 6 illustrates, as an example, a method performed in function 503 of FIG. 5 to store a profile hook into the reference profiles tree 103 for each chunk offset identified in 502 of FIG. 5 as having a local maximum zero crossing count. In 601 and 602 respectively, the current node at which processing starts on the sparse binary tree is set to its root node and the chunk at which processing starts is set to the chunk offset being processed at the time.
[0055] In 603, a determination is made whether the zero crossing count for the current chunk is greater than a programmable constant or threshold value.
If the determination in 603 is NO, then in 604, the current node is changed to a right-branch child node, which is created at that time if it doesn't already exist in the reference profiles tree 103. On the other hand, if the determination in 603 is YES, then in 605, the current node is changed to a left-branch child node, which is created at that time if it doesn't already exist in the reference profiles tree 103.
[ 0 05 61 In 606, a determination is then made whether the current chunk is the last chunk in the reference profile. If the determination in 606 is NO, then in 607, the current chunk is incremented by 1, and the method loops back to 603, and continues looping through 603607 until the determination in 606 is YES.
When the determination in 606 is YES, then in 608, the method stores the profile hook in the then current node, and is done. The profile hook in this case includes a profile identification or "ID" and the chunk offset that is being processed at the time in function 503. The profile ID serves to uniquely identify the content of thee reference profile in this case.
[0 0571 In the following description, it is now assumed that generation of the reference profiles tree 103 is complete so that it contains information of profile hooks for each of the reference profiles 102 at various of its nodes.
[ 0 0 5 8 ] FIG. 7 illustrates, as an example, a method for generating an input profile 101 that parallels the method used for generating each of the reference profiles 102.
[ 0 05 91 FIG. 8 illustrates three primary functions performed by the audio matcher 100. In a first function 801, the audio matcher 100 identifies mini-matches of an input profile 101 in the reference profiles tree 103. If no mini-matches are found, then this function reports back that the input profile is a no-match. Since the no-match is determined early on in the process, this avoids the necessity to perform subsequent processing to determine a best match or that the input profile is for a spoof.
[ 0 0 601 Assuming mini-matches have been identified between the input profile and one or more reference profiles, then in a second function 802, the audio matcher 100 then stores and merges when appropriate the mini-matches for subsequent processing. In a third function 803, the audio matcher 100 then determines one of the following: an acceptable best match for the input profile; a determination that the input profile is a spoof; or a no-match if the input profile is not determined to be a spoof or if an acceptable best match cannot be found.
[0 0611 FIG. 9 illustrates, as an example, a method for performing the mini-match identifying function 801 of FIG. 8. The method parallels that of FIG. 5, wherein local maximums in a reference profile are identified so that profile hooks can be stored in the reference profiles tree 103. In this case, however, local maximums in the input profile are identified so that mini-matches may be found in the reference profiles tree 103. In particular, the identification of zero crossing count local maximums in the input profile as performed in 901, and 904-906 are performed identically as their counterparts 501, 502 and 504506 of FIG. 5 in identifying zero crossing count local maximums in a reference profile.
[0 0 62 ] In 903, however, rather than storing a profile hook in the reference profiles tree for the chunk offset as performed in 503 of FIG. 5, the chunk offset is used to search for matches in the reference profiles tree 103.
[ 0 0 63 ] FIG. 10 illustrates, as an example, a method performed in function 903 of FIG. 9. The method is similar to that of FIG. 6, wherein movement down the reference profiles tree 103 is performed. In this case, however, zero crossing counts in the input profile are used instead of the zero crossing counts in a reference profile to determine the movement down the reference profiles tree 103.
[0064] Starting in 1001, the current node in the reference profiles tree 103 is initially set to the root node, and in 1002, the current chunk is set to the chunk offset currently being processed.
[0065] In 1003, a determination is made whether the zero crossing count for the current chunk is greater than a programmable constant. The constant that is to be used here is the same as that used in 603 of FIG. 6.
[ 0 0661 If the determination in 1003 is NO, then in 1004, the current node is changed to a right-branch child node. On the other hand, if the determination in 1003 is YES, then in 1005, the current node is changed to a left-branch child node.
[ 0 0 671 In 1006, a determination is then made whether the current chunk is the last chunk in the input profile. If the determination in 1006 is NO, then in 1007, the current chunk is incremented by 1, and the method loops back to 1003, and continues looping through 10031007 until the determination in 1006 is YES. When the determination in 1006 is YES, then in 1008, the method matches the input profile against all reference profiles identified in profile hooks stored at the current node of the reference profiles tree 103.
[0 0 68 ] FIG. 11 illustrates, as an example, a method for performing the function 1008 of FIG. 10. In 1101, a determination is first made whether there are any reference profiles identified in reference profile hooks stored at the current node of the reference profiles tree 103. If the determination in 1101 is NO, then the method has nothing more to do so it ends.
[0 0 6 9 ] On the other hand, if the determination in 1101 is YES, then in 1102, the first N chunks of the input profile are compared with the corresponding first N chunks of a first reference profile identified. In 1103, a determination is made whether they match. In order for corresponding chunks to match, their zero crossing counts do not have to be exactly equal. As long as the absolute difference between the zero crossing counts is within a programmed tolerance, they may be determined to be a match. Also, it may not be necessary for all of the first N chunks to match, the match determination may be a YES as long as a high enough percentage of the first N chunks match.
[ 0 07 01 If the determination in 1103 is a YES, then in 1104, a mini-match at the current offset of the input profile is generated. Generation of the mini-match involves including the information in the following table in the mini-match.
Table 1. Information included in a mini-match.
Parameter Description time, The offset into the input profile at which this match begins.
time2 The offset into the input profile at which this match ends.
wt1 The offset into the input profile at which the reference profile begins.
wt2 The offset into the input profile at which the reference profile ends.
time matched The amount of match time represented by this mini-match.
full match "True" if this is a "full" match.
source The ID for the reference profile corresponding to this mini-match.
err The total amount of error in this mini-match.
ID An identifier for the mini-match.
[00711 On the other hand, if the determination in 1103 is a NO, then in 1105, a determination is made whether there is another reference profile identified at the current node of the reference profiles tree 103. If the determination in 1105 is YES, then in 1106, the first N chunks of the input profile are then compared with those of the next identified reference profile, and the method continues by looping through 11031106 until either a match is found or there are no more reference profiles to be compared against the input profile.
[ 0 072 ] If the determination in 1105 results at any time in a NO, then in 1107, the method generates a "non-full" mini-match using the best matching one of the reference profiles identified at the current node of the reference profiles tree 103 (i.e., the reference profile whose first N chunks came closest to being determined as a match to the first N chunks of the input profile). As with the "full" mini-match generated in 1104, the "non-full" mini-match will also be associated to the current offset of the input profile.
[ 0 0 73 ] FIG. 12 illustrates, as an example, a method for performing the mini-match storing and merger function 802 of FIG. 8. In 1201, a first one of the mini-matches generated in the function 801 of FIG. 8 is input. The mini-match can be either a "full" or "non-full" mini-match. In 1202, a determination is made whether any mini-matches have already been stored in the audio matcher 100 for subsequent processing. If the determination in 1202 is NO (as it will be for the first mini-match being input for the input profile), then in 1203, the mini-match is added to the store and the method jumps down to 1207.
[00741 In 1207, a determination is then made whether there are any more mini-matches to be input. If the determination in 1207 is YES, then the method jumps back to 1201 to input the next mini-match. In 1202, a determination is once again made whether there are any stored mini-matches. This time, since the first mini-match was stored, the determination will result in a YES, so that the method proceeds to 1204.
[00751 In 1204, a search is performed to find a merger candidate for the current mini-match among the mini-matches already in the store. In order to be considered a merger candidate, the current mini-match and the stored mini-match must refer to the same reference profile ID, and any difference between their respective wt, parameters (offsets into the input profile at which the reference profile begins) must be within a specified tolerance such as 50 chunks or 5 seconds.
[ 0 0 76] In 1205, a determination is then made whether a merger candidate has been found. If the determination in 1205 is NO, then the current mini-match is added to the store in 1203, and the method proceeds from there as previously described.
[0 077] On the other hand, if the determination in 1205 is YES, then in 1206, the current mini-match is merged with the merger candidate. When merging the current mini-match with the merger candidate, the parameter values for wtl, wt2, time, and time2 of the merged mini-match are weighted averages of the current mini-match and the merger candidate values, weighted by their respective matched times. The parameter value for "err" of the merged mini-match is the sum of the current mini-match and the merger candidate values. If either the current mini-match or the merger candidate is a "full" match, then the merged mini-match has its full match parameter set to true.
[0 0781 After merger, the method proceeds to 1207.
[ 0 0791 In 1207, a determination is made whether there are any more mini-matches to be processed. If the determination in 1207 is YES, then the method proceeds by looping through 12011207 until all mini-matches have been processed by either being stored individually in the audio matcher store or merged with another mini-match already stored in the audio matcher store, and the determination in 1207 at that time results in a NO.
[ 0 08 01 FIG. 13 illustrates, as an example, a software structure for implementing the function 803 of FIG. 8 in which a first function 1301 determines if the input profile is a spoof, and a second function 1302 finds a best match from the store of mini-matches generated in 802 of FIG. 8. The first and second functions 1301 and 1302 maybe performed serially, or in parallel as shown. If both functions 1301 and 1302 fail (i.e., the first function 1301 fails to identify the input profile 101 as a spoof and the second function 1302 fails to find an acceptable best match), then in 1303, it is determined that the input profile 101 is a no-match (i.e., no match has been found for it among the reference profiles 102).
[00811 FIG. 14 illustrates, as an example, a method for performing the first function 1301 to determine whether the input profile is a spoof. In 1401, a determination is made whether there is more than one reference profile identified by the mini-matches in the store. If the determination in 1401 results in a NO, then in 1402, a no spoof found conclusion is made and the method stops at that point.
[ 0 0821 On the other hand, if the determination in 1401 is YES, then in 1403, a determination is made whether the sum of the time matched for all the mini-matches in the store is greater than some threshold percentage of the input profile such as, for example, 70%. If the determination in 1403 results in a NO, then in 1402, a no spoof found conclusion is made and the method stops at that point.
[ 0 0 8 3 ] On the other hand, if the determination in 1403 is YES, then in 1404, a determination is made whether each mini-match has an error/second value that is less than some maximum value. The error/second value for each mini-match may be calculated by the ratio of the mini-match's "err" parameter and "time matched" parameter. If the determination in 1404 results in a NO, then in 1402, a no spoof found conclusion is made and the method stops at that point.
[ 0 0 841 On the other hand, if the determination in 1404 is YES, then in 1405, a spoof found conclusion is made and the method stops at that point. In this case, the spoof maybe formed by compositing several tracks together or looping the same segment of one track. Since these kinds of spoofs are quite common on peer-to-peer networks, the ability to automatically identify them is useful.
[0 0 85] FIG. 15 illustrates, as an example, a method for performing the second function 1302 to find an acceptable best match for the input profile 101.
In 1501 and 1502, the method starts by ignoring all "non-full" mini-matches and all mini-matches having an errors/second greater than a maximum allowable value.
[ 0 0 86] In 1503, the method then identifies one of the remaining mini-matches as a best match according to programmed criteria such as its errors/second value, its time matched value, and the percentage of its reference profile that it recognizes. Typically, the best match will be a mini-match that exceeds all other mini-matches in all of these criteria. In the event that two mini-matches are close, some weighting of the criteria may be performed to determine a best match between the two.
[ 0 0871 In 1504, a determination is then made whether the percentage of the input profile and the reference profile covered by the best match exceeds some minimum value. If the determination in 1504 is YES, then in 1505, the best match identified in 1503 is concluded to be an acceptable best match and the method ends at that point. On the other hand, if the determination in 1504 is NO, then the best match identified in 1503 is concluded in 1506 to be an unacceptable best match and the method ends at that point with a conclusion in this case that no acceptable best match was found.
[00881 Although the various aspects of the present invention have been described with respect to a preferred embodiment, it will be understood that the invention is entitled to full protection within the full scope of the appended claims.
Claims (38)
1. A method for matching an input audio file with a plurality of reference audio files, comprising:
generating an input profile by segmenting the input audio file into chunks and determining a value for a characteristic attribute of each of the chunks;
identifying chunks of the input profile whose characteristic attribute values satisfy a criterion;
determining nodes of a sparse binary tree that are associated with individual of the plurality of reference audio files to identify potential matches for the input audio file by processing, for and only for each chunk of the input profile whose characteristic attribute value satisfies the criterion, all chunks from the characteristic attribute value satisfying chunk to a last chunk of the input profile so as to move down left and right branch child nodes of the sparse binary tree starting from a root node wherein the determination of whether to move down the left or right branch child node for each chunk being processed depends upon whether the chunk being processed has a characteristic attribute value greater than a specified value; and searching for a match of the input audio file among the potential matches.
generating an input profile by segmenting the input audio file into chunks and determining a value for a characteristic attribute of each of the chunks;
identifying chunks of the input profile whose characteristic attribute values satisfy a criterion;
determining nodes of a sparse binary tree that are associated with individual of the plurality of reference audio files to identify potential matches for the input audio file by processing, for and only for each chunk of the input profile whose characteristic attribute value satisfies the criterion, all chunks from the characteristic attribute value satisfying chunk to a last chunk of the input profile so as to move down left and right branch child nodes of the sparse binary tree starting from a root node wherein the determination of whether to move down the left or right branch child node for each chunk being processed depends upon whether the chunk being processed has a characteristic attribute value greater than a specified value; and searching for a match of the input audio file among the potential matches.
2. The method according to claim 1, further comprising:
generating, prior to identifying potential matches for the input audio file, a plurality of reference profiles from corresponding ones of the plurality of reference audio files by segmenting each reference audio file into chunks and determining a value for the characteristic attribute for each of the chunks.
generating, prior to identifying potential matches for the input audio file, a plurality of reference profiles from corresponding ones of the plurality of reference audio files by segmenting each reference audio file into chunks and determining a value for the characteristic attribute for each of the chunks.
3. The method according to claim 2, wherein the plurality of reference profiles are associated with nodes of the sparse binary tree by identifying chunks of the plurality of reference profiles whose characteristic attribute values satisfy the criterion and processing, for and only for each chunk whose characteristic attribute value satisfies the criterion, all chunks from the characteristic attribute value satisfying chunk to a last chunk of its reference profile down left and right branch child nodes of the sparse binary tree starting with the root node wherein the determination of whether to move down the left or right branch child node for each chunk being processed depends upon whether the chunk being processed has a characteristic attribute value greater than the specified value so that upon completion of such processing, a profile hook identifying the reference audio file of the chunk being processed is stored at a current node upon completion of the processing for the characteristic attribute value satisfying chunk.
4. The method according to claim 3, wherein individual chunks of the input audio file includes information of digitized samples of an audio clip over a period of time and the characteristic attribute is a number of zero crossings of the digitized samples in the chunk.
5. The method according to claim 4, wherein the criterion is satisfied if the zero crossing count of a chunk is a local maximum.
6. The method according to claim 3, wherein the identification of chunks whose characteristic attribute values satisfy the criterion is performed on an ever increasing sampling basis.
7. The method according to claim 6, wherein the ever increasing sampling basis is a quadratically increasing sample basis.
8. The method according to claim 6, wherein the ever increasing sampling basis is an exponentially increasing sample basis.
9. The method according to claim 6, wherein the identification of chunks whose characteristic attribute values satisfy the criterion is performed by incrementing through the chunks at a specified velocity and acceleration.
10. The method according to claim 9, wherein the velocity is the number of chunks between local maxima in the input profile and the acceleration is the change in velocity divided by the number of chunks over which the change occurs.
11. The method according to claim 3, wherein the identification of potential matches for the input audio file with the plurality of reference profiles comprises identifying potential mini-matches by retrieving profile hooks associated with nodes in the sparse binary tree.
12. The method according to claim 11, wherein the identification of mini-matches among the plurality of reference profiles further comprises for individual reference profiles corresponding to the retrieved profile hooks:
comparing a number of chunks of the input profile and corresponding chunks of the reference profile; and identifying a mini-match if corresponding chunks of the reference profile substantially matches those of the input profile.
comparing a number of chunks of the input profile and corresponding chunks of the reference profile; and identifying a mini-match if corresponding chunks of the reference profile substantially matches those of the input profile.
13. The method according to claim 12, wherein the identification of mini-matches among the plurality of reference profiles further comprises: identifying a non-full mini-match using a best matching one of the reference profiles with the input profile if none of the reference profiles identified by the profile hooks substantially matches those of the input profile.
14. The method according to claim 13, wherein the identification of potential matches further comprises: merging any mini-matches and non-full mini-matches corresponding to the same reference profile and having an offset into the input profile at which the reference profile begins within a specified tolerance.
15. The method according to claim 14, wherein if a mini-match is merged with a non-full mini-match, then the merged entity is referred to as a mini-match.
16. The method according to claim 15, further comprising:
identifying the input audio file as a spoof if all mini-matches identified for the input profile do not refer to the same reference profile.
identifying the input audio file as a spoof if all mini-matches identified for the input profile do not refer to the same reference profile.
17. The method according to claim 16, wherein the input audio file is not identified as a spoof if the sum of the total audio time covered by the mini-matches is less than a specified threshold value.
18. The method according to claim 17, wherein the input audio file is not identified as a spoof even if the sum of the total audio time covered by the mini-matches is not less than the specified threshold value or if any of the mini-matches has an associated error per second value that is greater than a first specified maximum value.
19. The method according to claim 18, wherein the searching for the match results in a best match being found if a percentage of the input profile and the reference profile covered by the best match exceeds some minimum value after ignoring all non-full mini-matches, ignoring mini-matches having an error per second value that is greater than a second specified maximum value, and taking into consideration any other programmed criteria.
20. An apparatus for matching an input audio file with a plurality of reference audio files, comprising at least one computer configured to: generate an input profile by segmenting the input audio file into chunks and determining a value for a characteristic attribute of each of the chunks;
identify chunks of the input profile whose characteristic attribute values satisfy a criterion; determine nodes of a sparse binary tree that are associated with individual of the plurality of reference audio files to identify potential matches for the input audio file by processing, for and only for each chunk of the input profile whose characteristic attribute value satisfies the criterion, all chunks from the characteristic attribute value satisfying chunk to a last chunk of the input profile so as to move down left and right branch child nodes of the sparse binary tree starting from a root node wherein the determination of whether to move down the left or right branch child node for each chunk being processed depends upon whether the chunk being processed has a characteristic attribute value greater than a specified value; and search for a match of the input audio file among the potential matches.
identify chunks of the input profile whose characteristic attribute values satisfy a criterion; determine nodes of a sparse binary tree that are associated with individual of the plurality of reference audio files to identify potential matches for the input audio file by processing, for and only for each chunk of the input profile whose characteristic attribute value satisfies the criterion, all chunks from the characteristic attribute value satisfying chunk to a last chunk of the input profile so as to move down left and right branch child nodes of the sparse binary tree starting from a root node wherein the determination of whether to move down the left or right branch child node for each chunk being processed depends upon whether the chunk being processed has a characteristic attribute value greater than a specified value; and search for a match of the input audio file among the potential matches.
21. The apparatus according to claim 20, wherein the at least one computer is further configured to: generate, prior to identifying potential matches for the input audio file, a plurality of reference profiles from corresponding ones of the plurality of reference audio files by segmenting each reference audio file into chunks and determining a value for the characteristic attribute for each of the chunks.
22. The apparatus according to claim 21, wherein the at least one computer is configured to generate the plurality of reference profiles so as to be associated with nodes of the sparse binary tree by identifying chunks of the plurality of reference profiles whose characteristic attribute values satisfy the criterion and processing, for and only for each chunk whose characteristic attribute value satisfies the criterion, all chunks from the characteristic attribute value satisfying chunk to a last chunk of its reference profile down left and right branch child nodes of the sparse binary tree starting with the root node wherein the determination of whether to move down the left or right branch child node for each chunk being processed depends upon whether the chunk being processed has a characteristic attribute value greater than the specified value so that upon completion of such processing, a profile hook identifying the reference audio file of the chunk being processed is stored at a current node upon completion of the processing for the characteristic attribute value satisfying chunk.
23. The apparatus according to claim 22, wherein the at least one computer is configured to generate individual of the chunks of the input audio file so as to include information of digitized samples of an audio clip over a period of time and the characteristic attribute is a number of zero crossings of the digitized samples in the chunk.
24. The apparatus according to claim 23, wherein the criterion used by the at least one computer is satisfied if the zero crossing count of a sampled chunk is a local maximum.
25. The method according to claim 22, wherein the at least one computer is configured to identify the chunks whose characteristic attribute values satisfy the criterion on an increasing sampling basis.
26. The apparatus according to claim 25, wherein the increasing sampling basis used by the at least one computer is a quadratically increasing sample basis.
27. The apparatus according to claim 25, wherein the increasing sampling basis used by the at least one computer is an exponentially increasing sample basis.
28. The apparatus according to claim 25, wherein the at least one computer is configured to identify the chunks whose characteristic attribute values satisfy the criterion by incrementing through the chunks at a specified velocity and acceleration.
29. The apparatus according to claim 28, wherein the velocity used by the at least one computer is the number of chunks between local maxima in the input profile and the acceleration used by the at least one computer is the change in velocity divided by the number of chunks over which the change occurs.
30. The apparatus according to claim 22, wherein the at least one computer is configured to identify potential matches for the input audio file with the plurality of reference profiles by identifying potential mini-matches by retrieving profile hooks associated with nodes in the sparse binary tree.
31. The apparatus according to claim 30, wherein the at least one computer is configured to identify the mini-matches for individual reference profiles corresponding to the retrieved profile hooks by comparing a number of chunks of the input profile and corresponding chunks of the reference profile and identifying a mini-match if corresponding chunks of the reference profile substantially matches those of the input profile.
32. The apparatus according to claim 31, wherein the at least one computer is configured to identify the mini-matches by identifying a non-full mini-match using a best matching one of the reference profiles with the input profile if none of the reference profiles identified by the profile hooks substantially matches those of the input profile.
33. The apparatus according to claim 32, wherein the at least one computer is configured to identify the potential matches by merging any mini-matches and non-full mini-matches corresponding to the same reference profile and having an offset into the input profile at which the reference profile begins within a specified tolerance.
34. The apparatus according to claim 33, wherein the at least one computer is configured so that if a mini-match is merged with a non-full mini-match, then the merged entity is referred to as a mini-match.
35. The apparatus according to claim 34, wherein the at least one computer is configured to identify the input audio file as a spoof if all mini-matches identified for the input profile do not refer to the same reference profile.
36. The apparatus according to claim 35, wherein the at least one computer is configured to not identify the input audio file as a spoof if the sum of the total audio time covered by the mini-matches is less than a specified threshold value.
37. The apparatus according to claim 36, wherein the at least one computer is configured to not identify the input audio file as a spoof even if the sum of the total audio time covered by the mini-matches is not less than the specified threshold value of if any of the mini-matches has an associated error per second value that is greater than a first specified maximum value.
38. The apparatus according to claim 37, wherein the at least one computer is configured to search for the match so as to result in a best match being found if a percentage of the input profile and the reference profile covered by the best match exceeds some minimum value after ignoring all non-full mini-matches, ignoring mini-matches having an en-or per second value that is greater than a second specified maximum value, and taking into consideration any other programmed criteria.
Applications Claiming Priority (5)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US56888104P | 2004-05-06 | 2004-05-06 | |
| US60/568,881 | 2004-05-06 | ||
| US10/963,306 US7715934B2 (en) | 2003-09-19 | 2004-10-12 | Identification of input files using reference files associated with nodes of a sparse binary tree |
| US10/963,306 | 2004-10-12 | ||
| PCT/US2005/015643 WO2005109179A2 (en) | 2004-05-06 | 2005-05-05 | Using reference files associated with nodes of a tree |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2564162A1 CA2564162A1 (en) | 2005-11-17 |
| CA2564162C true CA2564162C (en) | 2011-08-23 |
Family
ID=35320864
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA2564162A Expired - Fee Related CA2564162C (en) | 2004-05-06 | 2005-05-05 | Using reference files associated with nodes of a tree |
Country Status (5)
| Country | Link |
|---|---|
| US (1) | US7715934B2 (en) |
| EP (1) | EP1763793A4 (en) |
| AU (1) | AU2005241532B2 (en) |
| CA (1) | CA2564162C (en) |
| WO (1) | WO2005109179A2 (en) |
Families Citing this family (38)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6834308B1 (en) * | 2000-02-17 | 2004-12-21 | Audible Magic Corporation | Method and apparatus for identifying media content presented on a media playing device |
| US7562012B1 (en) | 2000-11-03 | 2009-07-14 | Audible Magic Corporation | Method and apparatus for creating a unique audio signature |
| GB0107104D0 (en) * | 2001-03-21 | 2001-05-09 | Netpd Ltd | Method and apparatus for identifying electronic files |
| US7363278B2 (en) | 2001-04-05 | 2008-04-22 | Audible Magic Corporation | Copyright detection and protection system and method |
| US7529659B2 (en) * | 2005-09-28 | 2009-05-05 | Audible Magic Corporation | Method and apparatus for identifying an unknown work |
| US8972481B2 (en) | 2001-07-20 | 2015-03-03 | Audible Magic, Inc. | Playlist generation method and apparatus |
| US7877438B2 (en) * | 2001-07-20 | 2011-01-25 | Audible Magic Corporation | Method and apparatus for identifying new media content |
| US8332326B2 (en) * | 2003-02-01 | 2012-12-11 | Audible Magic Corporation | Method and apparatus to identify a work received by a processing system |
| US20050114709A1 (en) * | 2003-10-25 | 2005-05-26 | Macrovision Corporation | Demand based method for interdiction of unauthorized copying in a decentralized network |
| US20050203851A1 (en) * | 2003-10-25 | 2005-09-15 | Macrovision Corporation | Corruption and its deterrence in swarm downloads of protected files in a file sharing network |
| US20050108378A1 (en) * | 2003-10-25 | 2005-05-19 | Macrovision Corporation | Instrumentation system and methods for estimation of decentralized network characteristics |
| US20050091167A1 (en) * | 2003-10-25 | 2005-04-28 | Macrovision Corporation | Interdiction of unauthorized copying in a decentralized network |
| US20050089014A1 (en) * | 2003-10-27 | 2005-04-28 | Macrovision Corporation | System and methods for communicating over the internet with geographically distributed devices of a decentralized network using transparent asymetric return paths |
| US7877810B2 (en) * | 2004-03-02 | 2011-01-25 | Rovi Solutions Corporation | System, method and client user interface for a copy protection service |
| US8130746B2 (en) * | 2004-07-28 | 2012-03-06 | Audible Magic Corporation | System for distributing decoy content in a peer to peer network |
| EP1667360A1 (en) | 2004-12-06 | 2006-06-07 | BMC Software, Inc. | Generic discovery for computer networks |
| US9137115B2 (en) | 2004-12-06 | 2015-09-15 | Bmc Software, Inc. | System and method for resource reconciliation in an enterprise management system |
| US7809943B2 (en) | 2005-09-27 | 2010-10-05 | Rovi Solutions Corporation | Method and system for establishing trust in a peer-to-peer network |
| US20070124293A1 (en) * | 2005-11-01 | 2007-05-31 | Ohigo, Inc. | Audio search system |
| US8086722B2 (en) * | 2005-12-21 | 2011-12-27 | Rovi Solutions Corporation | Techniques for measuring peer-to-peer (P2P) networks |
| US7912894B2 (en) * | 2007-05-15 | 2011-03-22 | Adams Phillip M | Computerized, copy-detection and discrimination apparatus and method |
| US8006314B2 (en) | 2007-07-27 | 2011-08-23 | Audible Magic Corporation | System for identifying content of digital data |
| US20150006411A1 (en) * | 2008-06-11 | 2015-01-01 | James D. Bennett | Creative work registry |
| US10831724B2 (en) * | 2008-12-19 | 2020-11-10 | Bmc Software, Inc. | Method of reconciling resources in the metadata hierarchy |
| US8199651B1 (en) | 2009-03-16 | 2012-06-12 | Audible Magic Corporation | Method and system for modifying communication flows at a port level |
| US8712979B2 (en) | 2010-03-26 | 2014-04-29 | Bmc Software, Inc. | Statistical identification of instances during reconciliation process |
| US8589171B2 (en) | 2011-03-17 | 2013-11-19 | Remote Media, Llc | System and method for custom marking a media file for file matching |
| US8688631B2 (en) | 2011-03-17 | 2014-04-01 | Alexander Savenok | System and method for media file synchronization |
| US8478719B2 (en) | 2011-03-17 | 2013-07-02 | Remote Media LLC | System and method for media file synchronization |
| US10127296B2 (en) | 2011-04-07 | 2018-11-13 | Bmc Software, Inc. | Cooperative naming for configuration items in a distributed configuration management database environment |
| TWI510028B (en) * | 2012-04-25 | 2015-11-21 | Realtek Semiconductor Corp | Device for realizing upstream aggregation and downstream translation of a virtual local area network and method thereof |
| US9081778B2 (en) | 2012-09-25 | 2015-07-14 | Audible Magic Corporation | Using digital fingerprints to associate data with a work |
| GB2507751A (en) | 2012-11-07 | 2014-05-14 | Ibm | Storing data files in a file system which provides reference data files |
| US9158799B2 (en) | 2013-03-14 | 2015-10-13 | Bmc Software, Inc. | Storing and retrieving context sensitive data in a management system |
| CN104320690B (en) * | 2014-10-13 | 2018-02-16 | 四川长虹电器股份有限公司 | A kind of television broadcasting method and terminal televisions |
| CN104992713B (en) * | 2015-05-14 | 2018-11-13 | 电子科技大学 | A kind of quick broadcast audio comparison method |
| US9516377B1 (en) * | 2015-06-12 | 2016-12-06 | Sorenson Media, Inc. | Detecting channel change in automatic content recognition fingerprint matching |
| GB2551209B (en) * | 2016-06-06 | 2019-12-04 | Cirrus Logic Int Semiconductor Ltd | Voice user interface |
Family Cites Families (89)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4790017A (en) * | 1983-03-10 | 1988-12-06 | American Telephone And Telegraph Company, At&T Bell Laboratories | Speech processing feature generation arrangement |
| US5437050A (en) * | 1992-11-09 | 1995-07-25 | Lamb; Robert G. | Method and apparatus for recognizing broadcast information using multi-frequency magnitude detection |
| US7069451B1 (en) | 1995-02-13 | 2006-06-27 | Intertrust Technologies Corp. | Systems and methods for secure transaction management and electronic rights protection |
| CA2683230C (en) | 1995-02-13 | 2013-08-27 | Intertrust Technologies Corporation | Systems and methods for secure transaction management and electronic rights protection |
| EP2270687A2 (en) * | 1995-04-11 | 2011-01-05 | Kinetech, Inc. | Identifying data in a data processing system |
| US6003030A (en) | 1995-06-07 | 1999-12-14 | Intervu, Inc. | System and method for optimized storage and retrieval of data on a distributed computer network |
| US5918223A (en) * | 1996-07-22 | 1999-06-29 | Muscle Fish | Method and article of manufacture for content-based analysis, storage, retrieval, and segmentation of audio information |
| US5708759A (en) * | 1996-11-19 | 1998-01-13 | Kemeny; Emanuel S. | Speech recognition using phoneme waveform parameters |
| US5925843A (en) * | 1997-02-12 | 1999-07-20 | Virtual Music Entertainment, Inc. | Song identification and synchronization |
| US5914714A (en) | 1997-04-01 | 1999-06-22 | Microsoft Corporation | System and method for changing the characteristics of a button by direct manipulation |
| US5956671A (en) * | 1997-06-04 | 1999-09-21 | International Business Machines Corporation | Apparatus and methods for shift invariant speech recognition |
| US6112239A (en) | 1997-06-18 | 2000-08-29 | Intervu, Inc | System and method for server-side optimization of data delivery on a distributed computer network |
| US6553403B1 (en) * | 1998-06-03 | 2003-04-22 | International Business Machines Corporation | System, method and computer program product for monitoring in a distributed computing environment |
| US6321338B1 (en) | 1998-11-09 | 2001-11-20 | Sri International | Network surveillance |
| US6625643B1 (en) | 1998-11-13 | 2003-09-23 | Akamai Technologies, Inc. | System and method for resource management on a data network |
| GB9918611D0 (en) | 1999-08-07 | 1999-10-13 | Sibelius Software Ltd | Music database searching |
| US7020701B1 (en) | 1999-10-06 | 2006-03-28 | Sensoria Corporation | Method for collecting and processing data using internetworked wireless integrated network sensors (WINS) |
| US6188010B1 (en) * | 1999-10-29 | 2001-02-13 | Sony Corporation | Music search by melody input |
| US6754699B2 (en) | 2000-07-19 | 2004-06-22 | Speedera Networks, Inc. | Content delivery and global traffic management network system |
| US6665726B1 (en) | 2000-01-06 | 2003-12-16 | Akamai Technologies, Inc. | Method and system for fault tolerant media streaming over the internet |
| US6678680B1 (en) * | 2000-01-06 | 2004-01-13 | Mark Woo | Music search engine |
| AU2001227857A1 (en) | 2000-01-14 | 2001-07-24 | Saba Software, Inc. | Method and apparatus for a business applications management system platform |
| US6981180B1 (en) | 2000-03-16 | 2005-12-27 | Akamai Technologies, Inc. | Method and apparatus for testing request-response service using live connection traffic |
| US20010037314A1 (en) * | 2000-03-30 | 2001-11-01 | Ishikawa Mark M. | System, method and apparatus for authenticating the distribution of data |
| IL135555A0 (en) | 2000-04-09 | 2001-05-20 | Vidius Inc | Preventing unauthorized access to data sent via computer networks |
| AU2001265051A1 (en) | 2000-05-26 | 2001-12-11 | Akamai Technologies, Inc. | Global load balancing across mirrored data centers |
| US20020049760A1 (en) | 2000-06-16 | 2002-04-25 | Flycode, Inc. | Technique for accessing information in a peer-to-peer network |
| US7155723B2 (en) | 2000-07-19 | 2006-12-26 | Akamai Technologies, Inc. | Load balancing service |
| US6990453B2 (en) * | 2000-07-31 | 2006-01-24 | Landmark Digital Services Llc | System and methods for recognizing sound and music signals in high noise and distortion |
| US6732180B1 (en) * | 2000-08-08 | 2004-05-04 | The University Of Tulsa | Method to inhibit the identification and retrieval of proprietary media via automated search engines utilized in association with computer compatible communications network |
| WO2002033505A2 (en) * | 2000-10-16 | 2002-04-25 | Vidius Inc. | A method and apparatus for supporting electronic content distribution |
| KR20020030610A (en) * | 2000-10-19 | 2002-04-25 | 스톰 씨엔씨 인코포레이티드 | A method for preventing reduction of sales amount of phonograph records by way of digital music file unlawfully circulated through communication network |
| US7072982B2 (en) | 2000-11-22 | 2006-07-04 | Microsoft Corporation | Universal naming scheme for peer to peer resources |
| US7594030B2 (en) | 2000-11-22 | 2009-09-22 | Microsoft Corporation | Locator and tracking service for peer to peer resources |
| JP4162181B2 (en) | 2000-11-27 | 2008-10-08 | ヤマハ株式会社 | Program creation / playback apparatus, program creation / playback method, and storage medium |
| US7627897B2 (en) * | 2001-01-03 | 2009-12-01 | Portauthority Technologies Inc. | Method and apparatus for a reactive defense against illegal distribution of multimedia content in file sharing networks |
| US7350228B2 (en) * | 2001-01-23 | 2008-03-25 | Portauthority Technologies Inc. | Method for securing digital content |
| US7681032B2 (en) | 2001-03-12 | 2010-03-16 | Portauthority Technologies Inc. | System and method for monitoring unauthorized transport of digital content |
| GB0107104D0 (en) * | 2001-03-21 | 2001-05-09 | Netpd Ltd | Method and apparatus for identifying electronic files |
| JP2004534274A (en) * | 2001-03-23 | 2004-11-11 | インスティチュート・フォー・インフォコム・リサーチ | Method and system for displaying music information on a digital display for use in content-based multimedia information retrieval |
| JP2002297490A (en) * | 2001-03-30 | 2002-10-11 | Toshiba Corp | Apparatus and method for data delivery |
| US20020141387A1 (en) * | 2001-04-03 | 2002-10-03 | David Orshan | System, method and computer program product for delivery of internet services from a central system to multiple internet service providers at guaranteed service levels |
| US7580988B2 (en) | 2001-04-05 | 2009-08-25 | Intertrust Technologies Corporation | System and methods for managing the distribution of electronic content |
| US7363278B2 (en) | 2001-04-05 | 2008-04-22 | Audible Magic Corporation | Copyright detection and protection system and method |
| US20020152261A1 (en) * | 2001-04-17 | 2002-10-17 | Jed Arkin | Method and system for preventing the infringement of intellectual property rights |
| US20020152262A1 (en) * | 2001-04-17 | 2002-10-17 | Jed Arkin | Method and system for preventing the infringement of intellectual property rights |
| US7185052B2 (en) | 2001-05-16 | 2007-02-27 | Akamai Technologies, Inc. | Meta content delivery network system |
| US7065482B2 (en) * | 2001-05-17 | 2006-06-20 | International Business Machines Corporation | Internet traffic analysis tool |
| US7356487B2 (en) | 2001-06-14 | 2008-04-08 | Qurio Holdings, Inc. | Efficient transportation of digital files in a peer-to-peer file delivery network |
| US7383433B2 (en) | 2001-07-31 | 2008-06-03 | Sun Microsystems, Inc. | Trust spectrum for certificate distribution in distributed peer-to-peer networks |
| US7203753B2 (en) | 2001-07-31 | 2007-04-10 | Sun Microsystems, Inc. | Propagating and updating trust relationships in distributed peer-to-peer networks |
| US7793326B2 (en) * | 2001-08-03 | 2010-09-07 | Comcast Ip Holdings I, Llc | Video and digital multimedia aggregator |
| US7260215B2 (en) * | 2001-09-04 | 2007-08-21 | Portauthority Technologies Inc. | Method for encryption in an un-trusted environment |
| US8041803B2 (en) * | 2001-09-26 | 2011-10-18 | Qurio Holdings, Inc. | Method and system for delivering files in digital file marketplace |
| US20030095660A1 (en) | 2001-10-15 | 2003-05-22 | Overpeer, Inc. | System and method for protecting digital works on a communication network |
| US20030093794A1 (en) * | 2001-11-13 | 2003-05-15 | Koninklijke Philips Electronics N.V. | Method and system for personal information retrieval, update and presentation |
| US20030097299A1 (en) * | 2001-11-21 | 2003-05-22 | O'kane Robert | Peer-to-peer (P2P) and internet content digital acknowledgement trigger used for file transfer |
| US20030135548A1 (en) | 2001-12-17 | 2003-07-17 | Bushkin Arthur A. | System and method for disseminating knowledge over a global computer network |
| US6892227B1 (en) | 2001-12-21 | 2005-05-10 | Networks Associates Technology, Inc. | Enterprise network analyzer host controller/zone controller interface system and method |
| US20030130953A1 (en) * | 2002-01-09 | 2003-07-10 | Innerpresence Networks, Inc. | Systems and methods for monitoring the presence of assets within a system and enforcing policies governing assets |
| US7565155B2 (en) | 2002-04-10 | 2009-07-21 | Networks In Motion | Method and system for dynamic estimation and predictive route generation |
| US7367044B2 (en) | 2002-06-14 | 2008-04-29 | Clink Systems, Ltd. | System and method for network operation |
| US6931413B2 (en) * | 2002-06-25 | 2005-08-16 | Microsoft Corporation | System and method providing automated margin tree analysis and processing of sampled data |
| JP2004032364A (en) * | 2002-06-26 | 2004-01-29 | Matsushita Electric Ind Co Ltd | Network system |
| DE10335943A1 (en) | 2002-08-06 | 2004-06-03 | Brainshield Technologies Inc. | Device for copy-protected distribution of electronic documents via public electronic data network e.g. the internet, with time-limited access to reconstruction server for reconstruction of encrypted document |
| EP3547599A1 (en) | 2002-08-06 | 2019-10-02 | Apple Inc. | Methods for secure enrollment and backup of personal identity credentials into electronic devices |
| US7487509B2 (en) | 2002-08-08 | 2009-02-03 | Sun Microsystems, Inc. | System and method for providing multiple embodiments of abstract software modules in peer-to-peer network environments |
| US7484225B2 (en) | 2002-08-08 | 2009-01-27 | Sun Microsystems, Inc. | System and method for describing and identifying abstract software modules in peer-to-peer network environments |
| US7376749B2 (en) | 2002-08-12 | 2008-05-20 | Sandvine Incorporated | Heuristics-based peer to peer message routing |
| US7136922B2 (en) | 2002-10-15 | 2006-11-14 | Akamai Technologies, Inc. | Method and system for providing on-demand content delivery for an origin server |
| US7549047B2 (en) | 2002-11-21 | 2009-06-16 | Xerox Corporation | Method and system for securely sharing files |
| US6947386B2 (en) | 2002-12-06 | 2005-09-20 | Microsoft Corporation | Practical network node coordinate estimation |
| JP2004258777A (en) | 2003-02-24 | 2004-09-16 | Fujitsu Ltd | Security monitoring device, its system, its method and its program |
| US7313619B2 (en) | 2003-03-21 | 2007-12-25 | Intel Corporation | System and method for managing distributed objects as a single representation |
| US7409644B2 (en) | 2003-05-16 | 2008-08-05 | Microsoft Corporation | File system shell |
| US7143170B2 (en) | 2003-04-30 | 2006-11-28 | Akamai Technologies, Inc. | Automatic migration of data via a distributed computer network |
| GB0315886D0 (en) | 2003-07-07 | 2003-08-13 | Way Benjamin B P | Anti-piracy system |
| US20050091167A1 (en) * | 2003-10-25 | 2005-04-28 | Macrovision Corporation | Interdiction of unauthorized copying in a decentralized network |
| US20050108378A1 (en) | 2003-10-25 | 2005-05-19 | Macrovision Corporation | Instrumentation system and methods for estimation of decentralized network characteristics |
| US20050114709A1 (en) * | 2003-10-25 | 2005-05-26 | Macrovision Corporation | Demand based method for interdiction of unauthorized copying in a decentralized network |
| US20050203851A1 (en) | 2003-10-25 | 2005-09-15 | Macrovision Corporation | Corruption and its deterrence in swarm downloads of protected files in a file sharing network |
| US20050089014A1 (en) | 2003-10-27 | 2005-04-28 | Macrovision Corporation | System and methods for communicating over the internet with geographically distributed devices of a decentralized network using transparent asymetric return paths |
| US7660889B2 (en) | 2003-11-18 | 2010-02-09 | Cisco Technology, Inc. | Initialization and acquisition of peers in a peers' list in a peer-to-peer network |
| US20050198317A1 (en) | 2004-02-24 | 2005-09-08 | Byers Charles C. | Method and apparatus for sharing internet content |
| US7877810B2 (en) | 2004-03-02 | 2011-01-25 | Rovi Solutions Corporation | System, method and client user interface for a copy protection service |
| US20050267945A1 (en) | 2004-04-08 | 2005-12-01 | Ori Cohen | Systems and methods for deterring internet file-sharing networks |
| US7730482B2 (en) | 2004-06-08 | 2010-06-01 | Covia Labs, Inc. | Method and system for customized programmatic dynamic creation of interoperability content |
| US7809943B2 (en) | 2005-09-27 | 2010-10-05 | Rovi Solutions Corporation | Method and system for establishing trust in a peer-to-peer network |
| US8086722B2 (en) | 2005-12-21 | 2011-12-27 | Rovi Solutions Corporation | Techniques for measuring peer-to-peer (P2P) networks |
-
2004
- 2004-10-12 US US10/963,306 patent/US7715934B2/en active Active
-
2005
- 2005-05-05 CA CA2564162A patent/CA2564162C/en not_active Expired - Fee Related
- 2005-05-05 AU AU2005241532A patent/AU2005241532B2/en not_active Ceased
- 2005-05-05 EP EP05745729A patent/EP1763793A4/en not_active Withdrawn
- 2005-05-05 WO PCT/US2005/015643 patent/WO2005109179A2/en active Application Filing
Also Published As
| Publication number | Publication date |
|---|---|
| WO2005109179A3 (en) | 2006-03-09 |
| CA2564162A1 (en) | 2005-11-17 |
| WO2005109179A2 (en) | 2005-11-17 |
| EP1763793A2 (en) | 2007-03-21 |
| US20050216433A1 (en) | 2005-09-29 |
| AU2005241532A1 (en) | 2005-11-17 |
| AU2005241532B2 (en) | 2009-01-08 |
| US7715934B2 (en) | 2010-05-11 |
| EP1763793A4 (en) | 2011-06-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2564162C (en) | Using reference files associated with nodes of a tree | |
| CN108595709B (en) | Music originality analysis method and device based on block chain | |
| Bertin-Mahieux et al. | Large-scale cover song recognition using hashed chroma landmarks | |
| JP5090523B2 (en) | Method and apparatus for improving audio / video fingerprint search accuracy using a combination of multiple searches | |
| KR101609088B1 (en) | Media identification system with fingerprint database balanced according to search loads | |
| US11487814B2 (en) | Multiple stage indexing of audio content | |
| WO2020167887A1 (en) | Hybrid blockchains and streamchains using non-crypto hashes for securing audio-, video-, image-, and speech-based transactions and contracts | |
| US10068017B2 (en) | Stream recognition and filtering | |
| BR112016020457B1 (en) | METHOD OF SEARCHING AUDIO FINGERPRINTS STORED IN A DATABASE WITHIN AN AUDIO FINGERPRINT DETECTION SYSTEM | |
| WO2008004181A2 (en) | Methods and devices for managing a play-list of digital content | |
| Breitinger et al. | Performance issues about context-triggered piecewise hashing | |
| WO2016189307A1 (en) | Audio identification method | |
| EP3477643A1 (en) | Audio fingerprint extraction and audio recognition using said fingerprints | |
| ES2344123T3 (en) | PROCEDURE AND APPLIANCE TO GENERATE A REPRODUCTION LIST AUTOMATICALLY BY COMPARISON BY CHARACTERISTIC SEGMENT. | |
| Nucci et al. | A phylogenetic analysis of near-duplicate audio tracks | |
| US20170024441A1 (en) | Systems and methods for continuously detecting and identifying songs in a continuous audio stream | |
| CN113821630B (en) | Data clustering method and device | |
| US20210357363A1 (en) | File comparison method | |
| JP2004531754A (en) | Method and apparatus for identifying electronic files | |
| JP2005321530A (en) | Utterance identification system and method therefor | |
| Wang et al. | Structural fingerprint based hierarchical filtering in song identification | |
| Ma et al. | UCDC: unlimited content-defined chunking, a file-differing method apply to file-synchronization among multiple hosts | |
| US11954149B2 (en) | Multiple stage indexing of audio content | |
| CN114968351B (en) | Hierarchical multi-feature code homologous analysis method and system | |
| Vötter et al. | Song Popularity Prediction using Ordinal Classification |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| MKLA | Lapsed |
Effective date: 20180507 |
|
| MKLA | Lapsed |
Effective date: 20180507 |