# Patent

## Title
Measuring content coherence and measuring similarity

## Abstract

Embodiments for measuring content coherence and embodiments for measuring content similarity are described. Content coherence between a first audio section and a second audio section is measured. For each audio segment in the first audio section, a predetermined number of audio segments in the second audio section are determined. Content similarity between the audio segment in the first audio section and the determined audio segments is higher than that between the audio segment and all the other audio segments in the second audio section. An average of the content similarity between the audio segment in the first audio section and the determined audio segments is calculated. The content coherence is calculated as an average, the maximum or the minimum of the averages calculated for the audio segments in the first audio section. The content similarity may be calculated based on Dirichlet distribution.

## Background
CROSS-REFERENCE TO RELATED APPLICATIONS
This application is a divisional of U.S. patent application Ser. No. 14/237,395, filed Feb. 6, 2014, which is the U.S. national stage of International Patent Application No. PCT/US2012/049876, filed Aug. 7, 2012 and claims priority to Chinese Patent Application No. 201110243107.5, filed Aug. 19, 2011, and U.S. patent Provisional Application No. 61/540,352, filed Sep. 28, 2011, each of which are hereby incorporated by reference in its entirety.


TECHNICAL FIELD
The present invention relates generally to audio signal processing. More specifically, embodiments of the present invention relate to methods and apparatus for measuring content coherence between audio sections, and methods and apparatus for measuring content similarity between audio segments.
BACKGROUND
Content coherence metric is used to measure content consistency within audio signals or between audio signals. This metric involves computing content coherence (content similarity or content consistency) between two audio segments, and serves as a basis to judge if the segments belong to the same semantic cluster or if there is a real boundary between these two segments.
Methods of measuring content coherence between two long windows have been proposed. According to the method, each long window is divided into multiple short audio segments (audio elements), and the content coherence metric is obtained by computing the semantic affinity between all pairs of segments and drawn from the left and right window based on the general idea of overlapping similarity links. The semantic affinity can be computed by measuring content similarity between the segments or by their corresponding audio element classes. (For example, see L. Lu and A. Hanjalic. “Text-Like Segmentation of General Audio for Content-Based Retrieval,” IEEE Trans. on Multimedia, vol. 11, no. 4, 658-669, 2009, which is herein incorporated by reference for all purposes).
The content similarity may be computed based on a feature comparison between two audio segments. Various metrics such as Kullback-Leibler Divergence (KLD) have been proposed to measure the content similarity between two audio segments.
The approaches described in this section are approaches that could be pursued, but not necessarily approaches that have been previously conceived or pursued. Therefore, unless otherwise indicated, it should not be assumed that any of the approaches described in this section qualify as prior art merely by virtue of their inclusion in this section. Similarly, issues identified with respect to one or more approaches should not assume to have been recognized in any prior art on the basis of this section, unless otherwise indicated.
SUMMARY
According to an embodiment of the invention, a method of measuring content coherence between a first audio section and a second audio section is provided. For each of audio segments in the first audio section, a predetermined number of audio segments in the second audio section are determined. Content similarity between the audio segment in the first audio section and the determined audio segments is higher than that between the audio segment in the first audio section and all the other audio segments in the second audio section. An average of the content similarity between the audio segment in the first audio section and the determined audio segments are calculated. First content coherence is calculated as an average, the minimum or the maximum of the averages calculated for the audio segments in the first audio section.
According to an embodiment of the invention, an apparatus for measuring content coherence between a first audio section and a second audio section is provided. The apparatus includes a similarity calculator and a coherence calculator. For each of audio segments in the first audio section, the similarity calculator determines a predetermined number of audio segments in the second audio section. Content similarity between the audio segment in the first audio section and the determined audio segments is higher than that between the audio segment in the first audio section and all the other audio segments in the second audio section. The similarity calculator also calculates an average of the content similarity between the audio segment in the first audio section and the determined audio segments. The coherence calculator calculates first content coherence as an average, the minimum or the maximum of the averages calculated for the audio segments in the first audio section.
According to an embodiment of the invention, a method of measuring content similarity between two audio segments is provided. First feature vectors are extracted from the audio segments. All the feature values in each of the first feature vectors are non-negative and normalized so that the sum of the feature values is one. Statistical models for calculating the content similarity are generated based on Dirichlet distribution from the feature vectors. The content similarity is calculated based on the generated statistical models.
According to an embodiment of the invention, an apparatus for measuring content similarity between two audio segments is provided. The apparatus includes a feature generator, a model generator and a similarity calculator. The feature generator extracts first feature vectors from the audio segments. All the feature values in each of the first feature vectors are non-negative and normalized so that the sum of the feature values is one. The model generator generates statistical models for calculating the content similarity based on Dirichlet distribution from the feature vectors. The similarity calculator calculates the content similarity based on the generated statistical models.
Further features and advantages of the invention, as well as the structure and operation of various embodiments of the invention, are described in detail below with reference to the accompanying drawings. It is noted that the invention is not limited to the specific embodiments described herein. Such embodiments are presented herein for illustrative purposes only. Additional embodiments will be apparent to persons skilled in the relevant art(s) based on the teachings contained herein.



BRIEF DESCRIPTION OF DRAWINGS
The present invention is illustrated by way of example, and not by way of limitation, in the figures of the accompanying drawings and in which like reference numerals refer to similar elements and in which:
FIG. 1 is a block diagram illustrating an example apparatus for measuring content coherence according to an embodiment of the present invention;
FIG. 2 is a schematic view for illustrating content similarity between an audio segment in a first audio section and a subset of audio segments in a second audio section;
FIG. 3 is a flow chart illustrating an example method of measuring content coherence according to an embodiment of the present invention;
FIG. 4 is a flow chart illustrating an example method of measuring content coherence according to a further embodiment of the method in FIG. 3;
FIG. 5 is a block diagram illustrating an example of the similarity calculator according to an embodiment of the present invention;
FIG. 6 is a flow chart for illustrating an example method of calculating the content similarity by adopting statistical models;
FIG. 7 is a block diagram illustrating an exemplary system for implementing embodiments of the present invention.



DETAILED DESCRIPTION
The embodiments of the present invention are below described by referring to the drawings. It is to be noted that, for purpose of clarity, representations and descriptions about those components and processes known by those skilled in the art but not necessary to understand the present invention are omitted in the drawings and the description.
As will be appreciated by one skilled in the art, aspects of the present invention may be embodied as a system (e.g., an online digital media store, cloud computing service, streaming media service, telecommunication network, or the like), device (e.g., a cellular telephone, portable media player, personal computer, television set-top box, or digital video recorder, or any media player), method or computer program product. Accordingly, aspects of the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment (including firmware, resident software, microcode, etc.) or an embodiment combining software and hardware aspects that may all generally be referred to herein as a “circuit,” “module” or “system.” Furthermore, aspects of the present invention may take the form of a computer program product embodied in one or more computer readable medium(s) having computer readable program code embodied thereon.
Any combination of one or more computer readable medium(s) may be utilized. The computer readable medium may be a computer readable signal medium or a computer readable storage medium. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples (a non-exhaustive list) of the computer readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or Flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the context of this document, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
A computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof.
A computer readable signal medium may be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device.
Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to wireless, wired line, optical fiber cable, RF, etc., or any suitable combination of the foregoing.
Computer program code for carrying out operations for aspects of the present invention may be written in any combination of one or more programming languages, including an object oriented programming language such as Java, Smalltalk, C++ or the like and conventional procedural programming languages, such as the “C” programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the latter scenario, the remote computer may be connected to the user's computer through any type of network, including a local area network (LAN) or a wide area network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet Service Provider).
Aspects of the present invention are described below with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each block of the flowchart illustrations and/or block diagrams, and combinations of blocks in the flowchart illustrations and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer readable medium that can direct a computer, other programmable data processing apparatus, or other devices to function in a particular manner, such that the instructions stored in the computer readable medium produce an article of manufacture including instructions which implement the function/act specified in the flowchart and/or block diagram block or blocks.
The computer program instructions may also be loaded onto a computer, other programmable data processing apparatus, or other devices to cause a series of operational steps to be performed on the computer, other programmable apparatus or other devices to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide processes for implementing the functions/acts specified in the flowchart and/or block diagram block or blocks.
FIG. 1 is a block diagram illustrating an example apparatus 100 for measuring content coherence according to an embodiment of the present invention.
As illustrated in FIG. 1, apparatus 100 includes a similarity calculator 101 and a coherence calculator 102.
Various audio signal processing applications, such as speaker change detection and clustering in dialogue or meeting, song segmentation in music radio, chorus boundary refinement in songs, audio scene detection in composite audio signals and audio retrieval, may involve measuring content coherence between audio signals. For example, in the application of song segmentation in music radio, an audio signal is segmented into multiple sections, with each section containing a consistent content. For another example, in the application of speaker change detection and clustering in dialogue or meeting, audio sections associated with the same speaker are grouped into one cluster, with each cluster containing consistent contents. Content coherence between segments in an audio section may be measured to judge whether the audio section contains a consistent content. Content coherence between audio sections may be measured to judge whether contents in the audio sections are consistent.
In the present specification, the terms “segment” and “section” both refer to a consecutive portion of the audio signal. In the context that a larger portion is split into smaller portions, the term “section” refers to the larger portion, and the term “segment” refers to one of the smaller portions.
The content coherence may be represented by a distance value or a similarity value between two segments (sections). The greater distance value or smaller similarity value indicates the lower content coherence, and the smaller distance value or greater similarity value indicates the higher content coherence.
A predetermined processing may be performed on the audio signal according to the measured content coherence measured by apparatus 100. The predetermined processing depends on the applications.
The length of the audio sections may depend on the semantic level of object contents to be segmented or grouped. The higher semantic level may require the greater length of the audio sections. For example, in the scenarios where audio scenes (e.g., songs, weather forecasts, and action scenes) are cared about, the semantic level is high, and content coherence between longer audio sections is measured. The lower semantic level may require the smaller length of the audio sections. For example, in the applications of boundary detection between basic audio modalities (e.g. speech, music, and noise) and speaker change detection, the semantic level is low, and content coherence between shorter audio sections is measured. In an example scenario where audio sections include audio segments, the content coherence between the audio sections relates to the higher semantic level, and the content coherence between the audio segments relates to the lower semantic level.
For each audio segment si,l in a first audio section, similarity calculator 101 determines a number K, K>0 of audio segments sj,r in a second audio section. The number K may be determined in advance or dynamically. The determined audio segments forms a subset KNN(si,l) of audio segments sj,r in the second audio section. Content similarity between audio segments si,l and audio segments sj,r in KNN(si,l) is higher than content similarity between audio segments si,l and all the other audio segments in the second audio section except for those in KNN(si,l). That is to say, in case that the audio segments in the second audio section are sorted in descending order of their content similarity with audio segment si,l, the first K audio segments form the set KNN(si,l). The term “content similarity” has the similar meaning with the term “content coherence”. In the context that sections include segments, the term “content similarity” refers to content coherence between the segments, while the term “content coherence” refers to content coherence between the sections.
FIG. 2 is a schematic view for illustrating the content similarity between an audio segment si,l in the first audio section and the determined audio segments in KNN(si,l) corresponding to audio segment si,l in the second audio section. In FIG. 2, blocks represent audio segments. Although the first audio section and the second audio section are illustrated as adjoining with each other, they may be separated or located in different audio signals, depending on the applications. Also depending on the applications, the first audio section and the second audio section may have the same length or different lengths. As illustrated in FIG. 2, for one audio segment si,l in the first audio section, content similarity S(si,l, sj,r) between audio segment si,l and audio segments sj,r, 0<j<M+1 in the second audio section may be calculated, where M is the length of the second audio section in units of segment. From the calculated content similarity S(si,l, sj,r), 0<j<M+1, first K greatest content similarity S(si,l, sj1,r) to S(si,l, sjK,r), 0<j1, . . . , jK<M+1 are determined and audio segments sj1,r to sjK,r are determined to form the set KNN(si,l). Arrowed arcs in FIG. 2 illustrate the correspondence between audio segment si,l and the determined audio segments sj1,r to sjK,r in KNN(si,l).
For each audio segment si,l in the first audio section, similarity calculator 101 calculates an average A(si,l) of the content similarity S(si,l, sj1,r) to S(si,l, sjK,r), between audio segment si,l and the determined audio segments sj1,r to sjK,r in KNN(si,l). The average A(si,l) may be a weighted or an un-weighted one. In case of weighted average, the average A(si,l) may be calculated as




  
    
      
        
          A
          ⁡
          
            (
            
              s
              
                i
                ,
                l
              
            
            )
          
        
        =
        
          
            ∑
            
              
                s
                
                  jk
                  ,
                  r
                
              
              ∈
              
                KNN
                ⁡
                
                  (
                  
                    s
                    
                      i
                      ,
                      l
                    
                  
                  )
                
              
            
          
          ⁢
          
            
          
          ⁢
          
            
              w
              jk
            
            ⁢
            
              S
              ⁡
              
                (
                
                  
                    s
                    
                      i
                      ,
                      l
                    
                  
                  ,
                  
                    s
                    
                      jk
                      ,
                      r
                    
                  
                
                )
              
            
          
        
      
    
    
      
        (
        1
        )
      
    
  




where wjk is a weighting coefficient which may be 1/K, or alternatively, wjk may be larger if the distance between jk and i is smaller, and smaller if the distance is larger.

For the first audio section and the second audio section, coherence calculator 102 calculates content coherence Coh as an average of the averages A(si,l), 0<i<N+1, where N is the length of the first audio section in units of segment. The content coherence Coh may be calculated as




  
    
      
        Coh
        =
        
          
            ∑
            
              i
              =
              1
            
            N
          
          ⁢
          
            
          
          ⁢
          
            
              w
              i
            
            ⁢
            
              A
              ⁡
              
                (
                
                  s
                  
                    i
                    ,
                    l
                  
                
                )
              
            
          
        
      
    
    
      
        (
        2
        )
      
    
  




where N is the length of the first audio section in units of audio segment, and wi is a weighting coefficient which may be e.g., 1/N. The content coherence Coh may also be calculated as the minimum or the maximum of the averages A(si,l).

Various metric such as Hellinger distance, Square distance, Kullback-Leibler divergence, and Bayesian Information Criteria difference may be adopted to calculate the content similarity S(si,l, sj,r). Also, the semantic affinity described in L. Lu and A. Hanjalic. “Text-Like Segmentation of General Audio for Content-Based Retrieval,” IEEE Trans. on Multimedia, vol. 11, no. 4, 658-669, 2009 may be calculated as the content similarity S(si,l, sj,r).
There may be various cases where contents of two audio sections are similar. For example, in a perfect case, any audio segment in the first audio section is similar to all the audio segments in the second audio section. In many other cases, however, any audio segment in the first audio section is similar to a portion of the audio segments in the second audio section. By calculating the content coherence Coh as an average of the content similarity between every segment si,l in the first audio section and some audio segments, e.g., audio segments sj,r of KNN(si,l) in the second audio section, it is possible to identify all these cases of similar contents.
In a further embodiment of apparatus 100, each content similarity S(si,l, sj,r) between the audio segment si,l in the first audio section and the audio segment sj,r of KNN(si,l) may be calculated as content similarity between sequence [si,l, . . . , si+L-1,l] in the first audio section and sequence [sj,r, . . . , sj+L-1,r] in the second audio section, L>1. Various methods of calculating content similarity between two sequences of segments may be adopted. For example, the content similarity S(si,l, sj,r) between sequence [si,l, . . . , si+L-1,l] and sequence [sj,r, . . . , sj+L-1,r] may be calculated as




  
    
      
        
          S
          ⁡
          
            (
            
              
                s
                
                  i
                  ,
                  l
                
              
              ,
              
                s
                
                  j
                  ,
                  r
                
              
            
            )
          
        
        =
        
          
            ∑
            
              k
              =
              0
            
            
              L
              -
              1
            
          
          ⁢
          
            
          
          ⁢
          
            
              w
              k
            
            ⁢
            
              
                S
                ′
              
              ⁡
              
                (
                
                  
                    s
                    
                      
                        i
                        +
                        k
                      
                      ,
                      l
                    
                  
                  ,
                  
                    s
                    
                      
                        j
                        +
                        k
                      
                      ,
                      r
                    
                  
                
                )
              
            
          
        
      
    
    
      
        (
        3
        )
      
    
  




where wk is a weighting coefficient may be set to, e.g., 1/(L−1).

Various metric such as Hellinger distance, Square distance, Kullback-Leibler divergence, and Bayesian Information Criteria difference may be adopted to calculate the content similarity S′(si,l, sj,r). Also, the semantic affinity described in L. Lu and A. Hanjalic. “Text-Like Segmentation of General Audio for Content-Based Retrieval,” IEEE Trans. on Multimedia, vol. 11, no. 4, 658-669, 2009 may be calculated as the content similarity S′(si,l, sj,r).
In this way, temporal information may be accounted for by calculating the content similarity between two audio segments as that between two sequences starting from the two audio segments respectively. Consequently, a more accurate content coherence may be achieved.
Further, the content similarity S(si,l, sj,r) between the sequence [si,l, . . . , si+L-1,l] and the sequence [sj,r, . . . , sj+L-1,r] may be calculated by applying a dynamic time warping (DTW) scheme or a dynamic programming (DP) scheme. The DTW scheme or the DP scheme is an algorithm for measuring the content similarity between two sequences which may vary in time or speed, in which the optimal matching path is searched, and the final content similarity is computed based on the optimal path. In this way, possible tempo/speed changes may be accounted for. Consequently, a more accurate content coherence may be achieved.
In an example of applying the DTW scheme, for a given sequence [si,l, . . . , si+L-1,l] in the first audio section, the best matched sequence [sj,r, . . . , sj+L′-1,r] may be determined in the second audio section by checking all the sequences starting from audio segment sj,r in the second audio section. Then the content similarity S(si,l, sj,r) between the sequence [si,l, . . . , si+L-1,l] and the sequence [sj,r, . . . , sj+L′-1,r] may be calculated as

S(si,l,sj,r)=DTW([si,l, . . . ,si+L-1,l],[sj,r, . . . ,sj+L-1,r])  (4)

where DTW([ ],[ ]) is a DTW-based similarity score which also considers the insertion and deletion costs.

In a further embodiment of apparatus 100, symmetric content coherence may be calculated. In this case, for each audio segment sj,r in the second audio section, similarity calculator 101 determines the number K of audio segments si,l in the first audio section. The determined audio segments forms a set KNN(sj,r). Content similarity between audio segments sj,r and audio segments si,l in KNN(sj,r) is higher than content similarity between audio segments sj,r and all the other audio segments in the first audio section except for those in KNN(sj,r).
For each audio segment sj,r in the second audio section, similarity calculator 101 calculates an average A(sj,r) of the content similarity S(sj,r, si1,l) to S(sj,r, siK,l) between audio segment sj,r and the determined audio segments si1,l to siK,l in KNN(sj,r). The average A(sj,r) may be a weighted or an un-weighted one.
For the first audio section and the second audio section, coherence calculator 102 calculates content coherence Coh′ as an average of the averages A(sj,r), 0<j<N+1, where N is the length of the second audio section in units of segment. The content coherence Coh′ may also be calculated as the minimum or the maximum of the averages A(si,l). Further, coherence calculator is 102 calculates a final symmetric content coherence based on the content coherence Coh and the content coherence Coh′.
FIG. 3 is a flow chart illustrating an example method 300 of measuring content coherence according to an embodiment of the present invention.
In method 300, a predetermined processing is performed on the audio signal according to measured content coherence. The predetermined processing depends on the applications. The length of the audio sections may depend on the semantic level of object contents to be segmented or grouped.
As illustrated in FIG. 3, method 300 starts from step 301. At step 303, for one audio segment si,l in a first audio section, a number K, K>0 of audio segments sj,r in a second audio section are determined. The number K may be determined in advance or dynamically. The determined audio segments forms a set KNN(si,l). Content similarity between audio segments si,l and audio segments sj,r in KNN(si,l) is higher than content similarity between audio segments si,l and all the other audio segments in the second audio section except for those in KNN(si,l).
At step 305, for the audio segment si,l, an average A(si,l) of the content similarity S(si,l, sj1,r) to S(si,l, sjK,r) between audio segment si,l and the determined audio segments sj1,r to sjK,r in KNN(si,l) is calculated. The average A(si,l) may be a weighted or an un-weighted one.
At step 307, it is determined whether there is another audio segment sk,l not processed yet in the first audio section. If yes, method 300 returns to step 303 to calculate another average A(sk,l). If no, method 300 proceeds to step 309.
At step 309, for the first audio section and the second audio section, content coherence Coh is calculated as an average of the averages A(si,l), 0<i<N+1, where N is the length of the first audio section in units of segment. The content coherence Coh may also be calculated as the minimum or the maximum of the averages A(si,l).
Method 300 ends at step 311.
In a further embodiment of method 300, each content similarity S(si,l, sj,r) between the audio segment si,l in the first audio section and the audio segment sj,r of KNN(si,l) may be calculated as content similarity between sequence [si,l, . . . , si+L-1,l] in the first audio section and sequence [sj,r, . . . , sj+L-1,r] in the second audio section, L>1.
Further, the content similarity S(si,l, sj,r) between the sequence [si,l, . . . , si+L-1,l] and the sequence [sj,r, . . . , sj+L-1,r] may be calculated by applying a dynamic time warping (DTW) scheme or a dynamic programming (DP) scheme. In an example of applying the DTW scheme, for a given sequence [si,l, . . . , si+L-1,l] in the first audio section, the best matched sequence [sj,r, . . . , sj+L′-1,r] may be determined in the second audio section by checking all the sequences starting from audio segment sj,r in the second audio section. Then the content similarity S(si,l, sj,r) between the sequence [si,l, . . . , si+L-1,l] and the sequence [sj,r, . . . , sj+L′-1,r] may be calculated by Eq. (4).
FIG. 4 is a flow chart illustrating an example method 400 of measuring content coherence according to a further embodiment of method 300.
In method 400, steps 401, 403, 405, 409 and 411 have the same functions with steps 301, 303, 305, 309 and 311 respectively, and will not be described in detail herein.
After step 409, method 400 proceeds to step 423.
At step 423, for one audio segment sj,r in the second audio section, the number K of audio segments si,l in the first audio section are determined. The determined audio segments forms a set KNN(sj,r). Content similarity between audio segments sj,r and audio segments si,l in KNN(sj,r) is higher than content similarity between audio segments sj,r and all the other audio segments in the first audio section except for those in KNN(sj,r).
At step 425, for the audio segment sj,r an average A(sj,r) of the content similarity S(sj,r, si1,l) to S(sj,r, siK,l) between audio segment sj,r and the determined audio segments si1,l to siK,l in KNN(sj,r) is calculated. The average A(sj,r) may be a weighted or an un-weighted one.
At step 427, it is determined whether there is another audio segment sk,r not processed yet in the second audio section. If yes, method 400 returns to step 423 to calculate another average A(sk,r). If no, method 400 proceeds to step 429.
At step 429, for the first audio section and the second audio section, content coherence Coh′ is calculated as an average of the averages A(sj,r), 0<j<N+1, where N is the length of the second audio section in units of segment. The content coherence Coh′ may also be calculated as the minimum or the maximum of the averages A(si,l).
At step 431, a final symmetric content coherence is calculated based on the content coherence Coh and the content coherence Coh′. Then step 400 ends at step 411.
FIG. 5 is a block diagram illustrating an example of similarity calculator 501 according to the embodiment.
As illustrated in FIG. 5, similarity calculator 501 includes a feature generator 521, a model generator 522 and a similarity calculating unit 523.
For the content similarity to be calculated, feature generator 521 extracts first feature vectors from the associated audio segments.
Model generator 522 generates statistical models for calculating the content similarity from the feature vectors.
Similarity calculating unit 523 calculates the content similarity based on the generated statistical models.
In calculating the content similarity between two audio segments, various metric may be adopted, including but not limited to KLD, Bayesian Information Criteria (BIC), Hellinger distance, Square distance, Euclidean distance, cosine distance, and Mahalonobis distance. The calculation of the metric may involve generating statistical models from the audio segments and calculating similarity between the statistical models. The statistical models may be based on the Gaussian distribution.
It is also possible to extract feature vectors where all the feature values in the same feature vector are non-negative and have a sum of one from the audio segments (called as simplex feature vectors). This kind of feature vectors complies with the Dirichlet distribution more than the Gaussian distribution. Examples of the simplex feature vectors include, but not limited to, sub-band feature vector (formed of energy ratios of all the sub-bands with respect to the entire frame energy) and chroma feature which is generally defined as a 12-dimensional vector where each dimension corresponds to the intensity of a semitone class.
In a further embodiment of similarity calculator 501, for the content similarity to be calculated between two audio segments, feature generator 521 extracts simplex feature vectors from the audio segments. The simplex feature vectors are supplied to model generator 522.
In response, model generator 522 generates statistical models for calculating the content similarity based on the Dirichlet distribution from the simplex feature vectors. The statistical models are supplied to similarity calculating unit 523.
The Dirichlet distribution of a feature vector x (order d≧2) with parameters α1, . . . , αd>0 may be expressed as




  
    
      
        
          Dir
          ⁡
          
            (
            α
            )
          
        
        =
        
          
            p
            ⁡
            
              (
              
                x
                |
                α
              
              )
            
          
          =
          
            
              
                Γ
                ⁡
                
                  (
                  
                    
                      ∑
                      
                        k
                        =
                        1
                      
                      d
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      α
                      k
                    
                  
                  )
                
              
              
                
                  ∏
                  
                    k
                    =
                    1
                  
                  d
                
                ⁢
                
                  
                
                ⁢
                
                  Γ
                  ⁡
                  
                    (
                    
                      α
                      k
                    
                    )
                  
                
              
            
            ⁢
            
              
                ∏
                
                  k
                  =
                  1
                
                d
              
              ⁢
              
                
              
              ⁢
              
                x
                k
                
                  
                    α
                    k
                  
                  -
                  1
                
              
            
          
        
      
    
    
      
        (
        5
        )
      
    
  




where Γ( ) is a gamma function, and the feature vector x satisfies the following simplex property,

xk≧0,Σk=1dxk=1  (6)

The simplex property may be achieved by feature normalization, e.g. L1 or L2 normalization.
Various methods may be adopted to estimate parameters of the statistical models. For example, the parameters of the Dirichlet distribution may be estimated by a maximum likelihood (ML) method. Similarly, Dirichlet mixture model (DMM) may also be estimated to deal with more complex feature distributions, which is inherently a mixture of multiple Dirichlet models, as




  
    
      
        
          DMM
          ⁡
          
            (
            α
            )
          
        
        =
        
          
            ∑
            
              m
              =
              1
            
            M
          
          ⁢
          
            
          
          ⁢
          
            
              ω
              m
            
            ⁢
            
              
                Γ
                ⁡
                
                  (
                  
                    
                      ∑
                      
                        k
                        =
                        1
                      
                      d
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      α
                      mk
                    
                  
                  )
                
              
              
                
                  ∏
                  
                    k
                    =
                    1
                  
                  d
                
                ⁢
                
                  
                
                ⁢
                
                  Γ
                  ⁡
                  
                    (
                    
                      α
                      mk
                    
                    )
                  
                
              
            
            ⁢
            
              
                ∏
                
                  k
                  =
                  1
                
                d
              
              ⁢
              
                
              
              ⁢
              
                x
                k
                
                  
                    α
                    mk
                  
                  -
                  1
                
              
            
          
        
      
    
    
      
        (
        7
        )
      
    
  




In response, similarity calculating unit 523 calculates the content similarity based on the generated statistical models.
In a further example of similarity calculating unit 523, the Hellinger distance is adopted to calculate the content similarity. In this case, the Hellinger distance D(α,β) between two Dirichlet distributions Dir(α) and Dir(β) generated from two audio segments respectively may be calculated as




  
    
      
        
          D
          ⁡
          
            (
            
              α
              ,
              β
            
            )
          
        
        =
        
          
            ∫
            
              
                
                  (
                  
                    
                      
                        p
                        ⁡
                        
                          (
                          
                            x
                            |
                            α
                          
                          )
                        
                      
                    
                    -
                    
                      
                        p
                        ⁡
                        
                          (
                          
                            x
                            |
                            β
                          
                          )
                        
                      
                    
                  
                  )
                
                2
              
              ⁢
              
                d
                x
              
            
          
          =
          
            
              2
              -
              
                2
                ⁢
                
                  ∫
                  
                    
                      
                        
                          p
                          ⁡
                          
                            (
                            
                              x
                              |
                              α
                            
                            )
                          
                        
                        ⁢
                        
                          p
                          ⁡
                          
                            (
                            
                              x
                              |
                              β
                            
                            )
                          
                        
                      
                    
                    ⁢
                    
                      d
                      x
                    
                  
                
              
            
            =
            
              2
              -
              
                2
                ×
                
                  
                    [
                    
                      
                        
                          Γ
                          ⁡
                          
                            (
                            
                              
                                ∑
                                
                                  k
                                  =
                                  1
                                
                                d
                              
                              ⁢
                              
                                
                              
                              ⁢
                              
                                α
                                k
                              
                            
                            )
                          
                        
                        
                          
                            ∏
                            
                              k
                              =
                              1
                            
                            d
                          
                          ⁢
                          
                            
                          
                          ⁢
                          
                            Γ
                            ⁡
                            
                              (
                              
                                α
                                k
                              
                              )
                            
                          
                        
                      
                      ×
                      
                        
                          Γ
                          ⁡
                          
                            (
                            
                              
                                ∑
                                
                                  k
                                  =
                                  1
                                
                                d
                              
                              ⁢
                              
                                
                              
                              ⁢
                              
                                β
                                k
                              
                            
                            )
                          
                        
                        
                          
                            ∏
                            
                              k
                              =
                              1
                            
                            d
                          
                          ⁢
                          
                            
                          
                          ⁢
                          
                            Γ
                            ⁡
                            
                              (
                              
                                β
                                k
                              
                              )
                            
                          
                        
                      
                    
                    ]
                  
                  
                    1
                    2
                  
                
                ×
                
                  
                    
                      ∏
                      
                        k
                        =
                        1
                      
                      d
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      Γ
                      ⁡
                      
                        (
                        
                          
                            
                              α
                              k
                            
                            +
                            
                              β
                              k
                            
                          
                          2
                        
                        )
                      
                    
                  
                  
                    Γ
                    ⁡
                    
                      (
                      
                        
                          ∑
                          
                            k
                            =
                            1
                          
                          d
                        
                        ⁢
                        
                          
                        
                        ⁢
                        
                          
                            
                              α
                              k
                            
                            +
                            
                              β
                              k
                            
                          
                          2
                        
                      
                      )
                    
                  
                
              
            
          
        
      
    
    
      
        (
        8
        )
      
    
  




Alternatively, the square distance is adopted to calculate the content similarity. In this case, the square distance Ds between two Dirichlet distributions Dir(α) and Dir(β) generated from two audio segments respectively may be calculated as




  
    
      
        
          
            
              
                
                  D
                  s
                
                =
                
                ⁢
                
                  ∫
                  
                    
                      
                        (
                        
                          
                            p
                            ⁡
                            
                              (
                              
                                x
                                |
                                α
                              
                              )
                            
                          
                          -
                          
                            p
                            ⁡
                            
                              (
                              
                                x
                                |
                                β
                              
                              )
                            
                          
                        
                        )
                      
                      2
                    
                    ⁢
                    
                      d
                      x
                    
                  
                
              
            
          
          
            
              
                =
                
                ⁢
                
                  ∫
                  
                    
                      (
                      
                        
                          
                            
                              Γ
                              ⁡
                              
                                (
                                
                                  
                                    ∑
                                    
                                      k
                                      =
                                      1
                                    
                                    d
                                  
                                  ⁢
                                  
                                    
                                  
                                  ⁢
                                  
                                    α
                                    k
                                  
                                
                                )
                              
                            
                            
                              
                                ∏
                                
                                  k
                                  =
                                  1
                                
                                d
                              
                              ⁢
                              
                                
                              
                              ⁢
                              
                                Γ
                                ⁡
                                
                                  (
                                  
                                    α
                                    k
                                  
                                  )
                                
                              
                            
                          
                          ⁢
                          
                            
                              ∏
                              
                                k
                                =
                                1
                              
                              d
                            
                            ⁢
                            
                              
                            
                            ⁢
                            
                              x
                              k
                              
                                
                                  α
                                  k
                                
                                -
                                1
                              
                            
                          
                        
                        -
                        
                          
                            
                              Γ
                              ⁡
                              
                                (
                                
                                  
                                    ∑
                                    
                                      k
                                      =
                                      1
                                    
                                    d
                                  
                                  ⁢
                                  
                                    
                                  
                                  ⁢
                                  
                                    β
                                    k
                                  
                                
                                )
                              
                            
                            
                              
                                ∏
                                
                                  k
                                  =
                                  1
                                
                                d
                              
                              ⁢
                              
                                
                              
                              ⁢
                              
                                Γ
                                ⁡
                                
                                  (
                                  
                                    β
                                    k
                                  
                                  )
                                
                              
                            
                          
                          ⁢
                          
                            
                              ∏
                              
                                k
                                =
                                1
                              
                              d
                            
                            ⁢
                            
                              
                            
                            ⁢
                            
                              x
                              k
                              
                                
                                  β
                                  k
                                
                                -
                                1
                              
                            
                          
                        
                      
                      )
                    
                    ⁢
                    
                      d
                      x
                    
                  
                
              
            
          
          
            
              
                =
                
                ⁢
                
                  
                    
                      T
                      1
                      2
                    
                    ⁢
                    
                      
                        
                          ∏
                          
                            k
                            =
                            1
                          
                          d
                        
                        ⁢
                        
                          
                        
                        ⁢
                        
                          Γ
                          ⁡
                          
                            (
                            
                              
                                2
                                ⁢
                                
                                  α
                                  k
                                
                              
                              -
                              1
                            
                            )
                          
                        
                      
                      
                        Γ
                        ⁡
                        
                          (
                          
                            
                              ∑
                              
                                k
                                =
                                1
                              
                              d
                            
                            ⁢
                            
                              
                            
                            ⁢
                            
                              (
                              
                                
                                  2
                                  ⁢
                                  
                                    α
                                    k
                                  
                                
                                -
                                1
                              
                              )
                            
                          
                          )
                        
                      
                    
                  
                  -
                  
                    2
                    ⁢
                    
                      
                    
                    ⁢
                    
                      T
                      1
                    
                    ⁢
                    
                      T
                      2
                    
                    ⁢
                    
                      
                        
                          ∏
                          
                            k
                            =
                            1
                          
                          d
                        
                        ⁢
                        
                          
                        
                        ⁢
                        
                          (
                          
                            
                              α
                              k
                            
                            +
                            
                              β
                              k
                            
                            -
                            1
                          
                          )
                        
                      
                      
                        Γ
                        ⁡
                        
                          (
                          
                            
                              ∑
                              
                                k
                                =
                                1
                              
                              d
                            
                            ⁢
                            
                              
                            
                            ⁢
                            
                              (
                              
                                
                                  α
                                  k
                                
                                +
                                
                                  β
                                  k
                                
                                -
                                1
                              
                              )
                            
                          
                          )
                        
                      
                    
                  
                  +
                
              
            
          
          
            
              
                
                ⁢
                
                  
                    T
                    2
                    2
                  
                  ⁢
                  
                    
                      
                        ∏
                        
                          k
                          =
                          1
                        
                        d
                      
                      ⁢
                      
                        
                      
                      ⁢
                      
                        (
                        
                          
                            2
                            ⁢
                            
                              β
                              k
                            
                          
                          -
                          1
                        
                        )
                      
                    
                    
                      Γ
                      ⁡
                      
                        (
                        
                          
                            ∑
                            
                              k
                              =
                              1
                            
                            d
                          
                          ⁢
                          
                            
                          
                          ⁢
                          
                            (
                            
                              
                                2
                                ⁢
                                
                                  β
                                  k
                                
                              
                              -
                              1
                            
                            )
                          
                        
                        )
                      
                    
                  
                
              
            
          
        
        ⁢
        
          

        
        ⁢
        
          
            where
            ⁢
            
              
            
            ⁢
            
              T
              1
            
          
          =
          
            
              
                
                  Γ
                  ⁡
                  
                    (
                    
                      
                        ∑
                        
                          k
                          =
                          1
                        
                        d
                      
                      ⁢
                      
                        
                      
                      ⁢
                      
                        α
                        k
                      
                    
                    )
                  
                
                
                  
                    ∏
                    
                      k
                      =
                      1
                    
                    d
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    Γ
                    ⁡
                    
                      (
                      
                        α
                        k
                      
                      )
                    
                  
                
              
              ⁢
              
                
              
              ⁢
              and
              ⁢
              
                
              
              ⁢
              
                T
                2
              
            
            =
            
              
                
                  Γ
                  ⁡
                  
                    (
                    
                      
                        ∑
                        
                          k
                          =
                          1
                        
                        d
                      
                      ⁢
                      
                        
                      
                      ⁢
                      
                        β
                        k
                      
                    
                    )
                  
                
                
                  
                    ∏
                    
                      k
                      =
                      1
                    
                    d
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    Γ
                    ⁡
                    
                      (
                      
                        β
                        k
                      
                      )
                    
                  
                
              
              .
            
          
        
      
    
    
      
        (
        9
        )
      
    
  




Feature vectors not having the simplex property may also be extracted, for example, in case of adopting features such as Mel-frequency Cepstral Coefficient (MFCC), spectral flux and brightness. It is also possible to convert these non-simplex feature vectors into simplex feature vectors.
In a further example of similarity calculator 501, feature generator 521 may extract non-simplex feature vectors from the audio segments. For each of the non-simplex feature vectors, feature generator 521 may calculate an amount for measuring a relation between the non-simplex feature vector and each of reference vectors. The reference vectors are also non-simplex feature vectors. Supposing there are M reference vectors zj, j=1, . . . , M, M is equal to the number of dimensions of the simplex features vectors to be generated by feature generator 521. An amount vj for measuring the relation between one non-simplex feature vector and one reference vector refers to the degree of relevance between the non-simplex feature vector and the reference vector. The relation may be measured in various characteristics obtained by observing the reference vector with respect to the non-simplex feature vector. All the amounts corresponding to the non-simplex feature vectors may be normalized and form the simplex feature vector v.
For example, the relation may be one of the followings:
1) distance between the non-simplex feature vector and the reference vector;
2) correlation or inter-product between the non-simplex feature vector and the reference vector; and
3) posterior probability of the reference vector with the non-simplex feature vector as the relevant evidence.
In case of the distance, it is possible to calculate the amount vj as the distance between the non-simplex feature vector x and the reference vector zj, and then normalize the obtained distances to 1, that is




  
    
      
        
          v
          j
        
        =
        
          
            
              
              
                x
                -
                
                  z
                  j
                
              
              
            
            2
          
          
            
              ∑
              
                j
                =
                1
              
              M
            
            ⁢
            
              
            
            ⁢
            
              
                
                
                  x
                  -
                  
                    z
                    j
                  
                
                
              
              2
            
          
        
      
    
    
      
        (
        10
        )
      
    
  




where ∥ ∥ represents Euclidean distance.
Statistical or probabilistic methods may be also applied to measure the relation. In case of posterior probability, supposing that each reference vector is modeled by some kinds of distribution, the simplex feature vector may be calculated as

v=[p(z1|x),p(z2|x), . . . ,p(zM|x)]  (11)

where p(x|zj) represents the probability of the non-simplex feature vector x given the reference vector zj. The probability p(zj|x) may be calculated as the following by assuming that the prior p(zj) is uniformly distributed,





  
    
      
        
          p
          ⁡
          
            (
            
              
                z
                j
              
              |
              x
            
            )
          
        
        =
        
          
            
              
                p
                ⁡
                
                  (
                  
                    x
                    |
                    
                      z
                      j
                    
                  
                  )
                
              
              ⁢
              
                p
                ⁡
                
                  (
                  
                    z
                    j
                  
                  )
                
              
            
            
              p
              ⁡
              
                (
                x
                )
              
            
          
          =
          
            
              
                
                  p
                  ⁡
                  
                    (
                    
                      x
                      |
                      
                        z
                        j
                      
                    
                    )
                  
                
                ⁢
                
                  p
                  ⁡
                  
                    (
                    
                      z
                      j
                    
                    )
                  
                
              
              
                
                  ∑
                  
                    j
                    =
                    1
                  
                  M
                
                ⁢
                
                  
                
                ⁢
                
                  
                    p
                    ⁡
                    
                      (
                      
                        x
                        |
                        
                          z
                          j
                        
                      
                      )
                    
                  
                  ⁢
                  
                    p
                    ⁡
                    
                      (
                      
                        z
                        j
                      
                      )
                    
                  
                
              
            
            =
            
              
                p
                ⁡
                
                  (
                  
                    x
                    |
                    
                      z
                      j
                    
                  
                  )
                
              
              
                
                  ∑
                  
                    j
                    =
                    1
                  
                  M
                
                ⁢
                
                  
                
                ⁢
                
                  p
                  ⁡
                  
                    (
                    
                      x
                      |
                      
                        z
                        j
                      
                    
                    )
                  
                
              
            
          
        
      
    
    
      
        (
        12
        )
      
    
  




There may be alternative ways to generate the reference vectors.
For example, one method is to randomly generate a number of vectors as the reference vectors, similar to the method of Random Projection.
For another example, one method is unsupervised clustering where training vectors extracted from training samples are grouped into clusters and the reference vectors are calculated to represent the clusters respectively. In this way, each obtained cluster may be considered as a reference vector and represented by its center or a distribution (e.g., a Gaussian by using its mean and covariance). Various clustering methods, such as k-means and spectral clustering, may be adopted.
For another example, one method is supervised modeling where each reference vector may be manually defined and learned from a set of manually collected data.
For another example, one method is eigen-decomposition where the reference vectors are calculated as eigenvectors of a matrix with the training vectors as its rows. General statistical approaches such as principle component analysis (PCA), independent component analysis (ICA), and linear discriminant analysis (LDA) may be adopted.
FIG. 6 is a flow chart for illustrating an example method 600 of calculating the content similarity by adopting statistical models.
As illustrated in FIG. 6, method 600 starts from step 601. At step 603, for the content similarity to be calculated between two audio segments, feature vectors are extracted from the audio segments. At step 605, statistical models for calculating the content similarity are generated from the feature vectors. At step 607, the content similarity is calculated based on the generated statistical models. Method 600 ends at step 609.
In a further embodiment of method 600, simplex feature vectors are extracted from the audio segments at step 603.
At step 605, the statistical models based on the Dirichlet distribution are generated from the simplex feature vectors.
In a further example of method 600, the Hellinger distance is adopted to calculate the content similarity. Alternatively, the square distance is adopted to calculate the content similarity.
In a further example of method 600, non-simplex feature vectors are extracted from the audio segments. For each of the non-simplex feature vectors, an amount for measuring a relation between the non-simplex feature vector and each of reference vectors is calculated. All the amounts corresponding to the non-simplex feature vectors may be normalized and form the simplex feature vector v. More details about the relation and the reference vectors have been described in connection with FIG. 5, and will not be described in detail here.
While various distributions can be applied to measure content coherence, the metrics with regard to different distributions can be combined together. Various combination ways are possible, from simply using a weighted average to using statistical models.
The criterion for calculating the content coherence may be not limited to that described in connection with FIG. 2. Other criteria may also be adopted, for example, the criterion described in L. Lu and A. Hanjalic. “Text-Like Segmentation of General Audio for Content-Based Retrieval,” IEEE Trans. on Multimedia, vol. 11, no. 4, 658-669, 2009. In this case, methods of calculating the content similarity described in connection with FIG. 5 and FIG. 6 may be adopted.
FIG. 7 is a block diagram illustrating an exemplary system for implementing the aspects of the present invention.
In FIG. 7, a central processing unit (CPU) 701 performs various processes in accordance with a program stored in a read only memory (ROM) 702 or a program loaded from a storage section 708 to a random access memory (RAM) 703. In the RAM 703, data required when the CPU 701 performs the various processes or the like is also stored as required.
The CPU 701, the ROM 702 and the RAM 703 are connected to one another via a bus 704. An input/output interface 705 is also connected to the bus 704.
The following components are connected to the input/output interface 705: an input section 706 including a keyboard, a mouse, or the like; an output section 707 including a display such as a cathode ray tube (CRT), a liquid crystal display (LCD), or the like, and a loudspeaker or the like; the storage section 708 including a hard disk or the like; and a communication section 709 including a network interface card such as a LAN card, a modem, or the like. The communication section 709 performs a communication process via the network such as the internet.
A drive 710 is also connected to the input/output interface 705 as required. A removable medium 711, such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like, is mounted on the drive 710 as required, so that a computer program read therefrom is installed into the storage section 708 as required.
In the case where the above-described steps and processes are implemented by the software, the program that constitutes the software is installed from the network such as the internet or the storage medium such as the removable medium 711.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the invention. As used herein, the singular forms “a”, “an” and “the” are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms “comprises” and/or “comprising,” when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of one or more other features, integers, steps, operations, elements, components, and/or groups thereof.
The corresponding structures, materials, acts, and equivalents of all means or step plus function elements in the claims below are intended to include any structure, material, or act for performing the function in combination with other claimed elements as specifically claimed. The description of the present invention has been presented for purposes of illustration and description, but is not intended to be exhaustive or limited to the invention in the form disclosed. Many modifications and variations will be apparent to those of ordinary skill in the art without departing from the scope and spirit of the invention. The embodiment was chosen and described in order to best explain the principles of the invention and the practical application, and to enable others of ordinary skill in the art to understand the invention for various embodiments with various modifications as are suited to the particular use contemplated.
The following exemplary embodiments (each an “EE”) are described.
EE 1. A method of measuring content coherence between a first audio section and a second audio section, comprising:
for each of audio segments in the first audio section,

    
    
        determining a predetermined number of audio segments in the second audio section, wherein content similarity between the audio segment in the first audio section and the determined audio segments is higher than that between the audio segment in the first audio section and all the other audio segments in the second audio section; and
        calculating an average of the content similarity between the audio segment in the first audio section and the determined audio segments; and
    
    


calculating first content coherence as an average, the minimum or the maximum of the averages calculated for the audio segments in the first audio section.
EE 2. The method according to EE 1, further comprising:
for each of the audio segments in the second audio section,

    
    
        determining a predetermined number of audio segments in the first audio section, wherein content similarity between the audio segment in the second audio section and the determined audio segments is higher than that between the audio segment in the second audio section and all the other audio segments in the first audio section; and
        calculating an average of the content similarity between the audio segment in the second audio section and the determined audio segments;
    
    


calculating second content coherence as an average, the minimum or the maximum of the averages calculated for the audio segments in the second audio section;
calculating symmetric content coherence based on the first content coherence and the second content coherence.
EE 3. The method according to EE 1 or 2, wherein each of the content similarity S(si,l, sj,r) between the audio segment si,l in the first audio section and the determined audio segments sj,r is calculated as content similarity between sequence [si,l, . . . , si+L-1,l] in the first audio section and sequence [sj,r, . . . , sj+L-1,r] in the second audio section, L>1.
EE 4. The method according to EE 3, wherein the content similarity between the sequences is calculated by applying a dynamic time warping scheme or a dynamic programming scheme.
EE 5. The method according to EE 1 or 2, wherein the content similarity between two audio segments is calculated by
extracting first feature vectors from the audio segments;
generating statistical models for calculating the content similarity from the feature vectors; and
calculating the content similarity based on the generated statistical models.
EE 6. The method according to EE 5, wherein all the feature values in each of the first feature vectors are non-negative and the sum of the feature values is one, and the statistical models are based on Dirichlet distribution.
EE 7. The method according to EE 6, wherein the extracting comprises:
extracting second feature vectors from the audio segments; and
for each of the second feature vectors, calculating an amount for measuring a relation between the second feature vector and each of reference vectors, wherein all the amounts corresponding to the second feature vectors form one of the first feature vectors.
EE 8. The method according to EE 7, wherein the reference vectors are determined through one of the following methods:
random generating method where the reference vectors are randomly generated;
unsupervised clustering method where training vectors extracted from training samples are grouped into clusters and the reference vectors are calculated to represent the clusters respectively;
supervised modeling method where the reference vectors are manually defined and learned from the training vectors; and
eigen-decomposition method where the reference vectors are calculated as eigenvectors of a matrix with the training vectors as its rows.
EE 9. The method according to EE 7, wherein the relation between the second feature vectors and each of the reference vectors is measured by one of the following amounts:
distance between the second feature vector and the reference vector;
correlation between the second feature vector and the reference vector;
inter product between the second feature vector and the reference vector; and
posterior probability of the reference vector with the second feature vector as the relevant evidence.
EE 10. The method according to EE 9, wherein the distance vj between the second feature vector x and the reference vector zj is calculated as




  
    
      v
      j
    
    =
    
      
        
          
          
            x
            -
            
              z
              j
            
          
          
        
        2
      
      
        
          ∑
          
            j
            =
            1
          
          M
        
        ⁢
        
          
        
        ⁢
        
          
            
            
              x
              -
              
                z
                j
              
            
            
          
          2
        
      
    
  
  ,




where M is the number of the reference vectors, ∥ ∥ represents Euclidean distance.

EE 11. The method according to EE 9, wherein the posterior probability p(zj|x) of the reference vector zj with the second feature vector x as the relevant evidence is calculated as




  
    
      p
      ⁢
      
        (
        
          
            z
            j
          
          |
          x
        
        )
      
    
    =
    
      
        
          p
          ⁡
          
            (
            
              x
              |
              
                z
                j
              
            
            )
          
        
        ⁢
        
          p
          ⁡
          
            (
            
              z
              j
            
            )
          
        
      
      
        
          ∑
          
            j
            =
            1
          
          M
        
        ⁢
        
          
        
        ⁢
        
          
            p
            ⁡
            
              (
              
                x
                |
                
                  z
                  j
                
              
              )
            
          
          ⁢
          
            p
            ⁡
            
              (
              
                z
                j
              
              )
            
          
        
      
    
  
  ,




where p(x|zj) represents the probability of the second feature vector x given the reference vector zj, M is the number of the reference vectors, p(zj) is the prior distribution.

EE 12. The method according to EE 6, wherein the parameters of the statistical models are estimated by a maximum likelihood method.
EE 13. The method according to EE 6, wherein the statistical models are based on one or more Dirichlet distributions.
EE 14. The method according to EE 6, wherein the content similarity is measured by one of the following metric:
Hellinger distance;
Square distance;
Kullback-Leibler divergence; and
Bayesian Information Criteria difference.
EE 15. The method according to EE 14, wherein the Hellinger distance D(α,β) is calculated as




  
    
      D
      ⁡
      
        (
        
          α
          ,
          β
        
        )
      
    
    =
    
      2
      -
      
        2
        ×
        
          
            [
            
              
                
                  Γ
                  (
                  
                    
                      ∑
                      
                        k
                        =
                        1
                      
                      d
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      α
                      k
                    
                  
                  )
                
                
                  
                    ∏
                    
                      k
                      =
                      1
                    
                    d
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    Γ
                    ⁡
                    
                      (
                      
                        α
                        k
                      
                      )
                    
                  
                
              
              ×
              
                
                  Γ
                  (
                  
                    
                      ∑
                      
                        k
                        =
                        1
                      
                      d
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      β
                      k
                    
                  
                  )
                
                
                  
                    ∏
                    
                      k
                      =
                      1
                    
                    d
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    Γ
                    ⁡
                    
                      (
                      
                        β
                        k
                      
                      )
                    
                  
                
              
            
            ]
          
          
            1
            2
          
        
        ×
        
          
            
              ∏
              
                k
                =
                1
              
              d
            
            ⁢
            
              
            
            ⁢
            
              Γ
              (
              
                
                  
                    α
                    k
                  
                  +
                  
                    β
                    k
                  
                
                2
              
              )
            
          
          
            Γ
            (
            
              
                ∑
                
                  k
                  =
                  1
                
                d
              
              ⁢
              
                
              
              ⁢
              
                
                  
                    α
                    k
                  
                  +
                  
                    β
                    k
                  
                
                2
              
            
            )
          
        
      
    
  
  ,




where α1, . . . , αd>0 are parameters of one of the statistical models and β1, . . . , βd>0 are parameters of another of the statistical models, d≧2 is the number of dimensions of the first feature vectors, and Γ( ) is a gamma function.

EE 16. The method according to EE 14, wherein the Square distance Ds is calculated as



  
    
      
        D
        s
      
      =
      
        
          
            T
            1
            2
          
          ⁢
          
            
              
                ∏
                
                  k
                  =
                  1
                
                d
              
              ⁢
              
                
              
              ⁢
              
                Γ
                ⁡
                
                  (
                  
                    
                      2
                      ⁢
                      
                        α
                        k
                      
                    
                    -
                    1
                  
                  )
                
              
            
            
              Γ
              (
              
                
                  ∑
                  
                    k
                    =
                    1
                  
                  d
                
                ⁢
                
                  
                
                ⁢
                
                  (
                  
                    
                      2
                      ⁢
                      
                        α
                        k
                      
                    
                    -
                    1
                  
                  )
                
              
              )
            
          
        
        -
        
          2
          ⁢
          
            T
            1
          
          ⁢
          
            T
            2
          
          ⁢
          
            
              
                ∏
                
                  k
                  =
                  1
                
                d
              
              ⁢
              
                
              
              ⁢
              
                (
                
                  
                    α
                    k
                  
                  +
                  
                    β
                    k
                  
                  -
                  1
                
                )
              
            
            
              Γ
              (
              
                
                  ∑
                  
                    k
                    =
                    1
                  
                  d
                
                ⁢
                
                  
                
                ⁢
                
                  (
                  
                    
                      α
                      k
                    
                    +
                    
                      β
                      k
                    
                    -
                    1
                  
                  )
                
              
              )
            
          
        
        +
        
          
            T
            2
            2
          
          ⁢
          
            
              
                ∏
                
                  k
                  =
                  1
                
                d
              
              ⁢
              
                
              
              ⁢
              
                (
                
                  
                    2
                    ⁢
                    
                      β
                      k
                    
                  
                  -
                  1
                
                )
              
            
            
              Γ
              (
              
                
                  ∑
                  
                    k
                    =
                    1
                  
                  d
                
                ⁢
                
                  
                
                ⁢
                
                  (
                  
                    
                      2
                      ⁢
                      
                        β
                        k
                      
                    
                    -
                    1
                  
                  )
                
              
              )
            
          
        
      
    
    ,
    
      

    
    ⁢
    
      
    
    ⁢
    where
  




  
    
      
    
    ⁢
    
      
        
          T
          1
        
        =
        
          
            Γ
            (
            
              
                ∑
                
                  k
                  =
                  1
                
                d
              
              ⁢
              
                
              
              ⁢
              
                α
                k
              
            
            )
          
          
            
              ∏
              
                k
                =
                1
              
              d
            
            ⁢
            
              
            
            ⁢
            
              Γ
              ⁡
              
                (
                
                  α
                  k
                
                )
              
            
          
        
      
      ,
      
        
          T
          2
        
        =
        
          
            Γ
            (
            
              
                ∑
                
                  k
                  =
                  1
                
                d
              
              ⁢
              
                
              
              ⁢
              
                β
                k
              
            
            )
          
          
            
              ∏
              
                k
                =
                1
              
              d
            
            ⁢
            
              
            
            ⁢
            
              Γ
              ⁡
              
                (
                
                  β
                  k
                
                )
              
            
          
        
      
      ,
    
  



α1, . . . , αd>0 are parameters of one of the statistical models and β1, . . . , βd>0 are parameters of another of the statistical models, d≧2 is the number of dimensions of the first feature vectors, and Γ( ) is a gamma function.

EE 17. An apparatus for measuring content coherence between a first audio section and a second audio section, comprising:
a similarity calculator which, for each of audio segments in the first audio section,

    
    
        determines a predetermined number of audio segments in the second audio section, wherein content similarity between the audio segment in the first audio section and the determined audio segments is higher than that between the audio segment in the first audio section and all the other audio segments in the second audio section; and
        calculates an average of the content similarity between the audio segment in the first audio section and the determined audio segments; and
    
    


a coherence calculator which calculates first content coherence as an average, the minimum or the maximum of the averages calculated for the audio segments in the first audio section.
EE 18. The apparatus according to EE 17, wherein the similarity calculator is further configured to, for each of the audio segments in the second audio section,
determine a predetermined number of audio segments in the first audio section, wherein content similarity between the audio segment in the second audio section and the determined audio segments is higher than that between the audio segment in the second audio section and all the other audio segments in the first audio section; and
calculate an average of the content similarity between the audio segment in the second audio section and the determined audio segments, and
wherein the coherence calculator is further configured to
calculate second content coherence as an average, the minimum or the maximum of the averages calculated for the audio segments in the second audio section, and
calculate symmetric content coherence based on the first content coherence and the second content coherence.
EE 19. The apparatus according to EE 17 or 18, wherein each of the content similarity S(si,l, sj,r) between the audio segment si,l in the first audio section and the determined audio segments sj,r is calculated as content similarity between sequence [si,l, . . . , si+L-1,l] in the first audio section and sequence [sj,r, . . . , sj+L-1,r] in the second audio section, L>1.
EE 20. The apparatus according to EE 19, wherein the content similarity between the sequences is calculated by applying a dynamic time warping scheme or a dynamic programming scheme.
EE 21. The apparatus according to EE 17 or 18, wherein the similarity calculator comprises:
a feature generator which, for each of the content similarity, extracts first feature vectors from the associated audio segments;
a model generator which generates statistical models for calculating each of the content similarity from the feature vectors; and
a similarity calculating unit which calculates the content similarity based on the generated statistical models.
EE 22. The apparatus according to EE 21, wherein all the feature values in each of the first feature vectors are non-negative and the sum of the feature values is one, and the statistical models are based on Dirichlet distribution.
EE 23. The apparatus according to EE 22, wherein the feature generator is further configured to
extract second feature vectors from the audio segments; and
for each of the second feature vectors, calculate an amount for measuring a relation between the second feature vector and each of reference vectors, wherein all the amounts corresponding to the second feature vectors form one of the first feature vectors.
EE 24. The apparatus according to EE 23, wherein the reference vectors are determined through one of the following methods:
random generating method where the reference vectors are randomly generated;
unsupervised clustering method where training vectors extracted from training samples are grouped into clusters and the reference vectors are calculated to represent the clusters respectively;
supervised modeling method where in the reference vectors are manually defined and learned from the training vectors; and
eigen-decomposition method where the reference vectors are calculated as eigenvectors of a matrix with the training vectors as its rows.
EE 25. The apparatus according to EE 23, wherein the relation between the second feature vectors and each of the reference vectors is measured by one of the following amounts:
distance between the second feature vector and the reference vector;
correlation between the second feature vector and the reference vector;
inter product between the second feature vector and the reference vector; and
posterior probability of the reference vector with the second feature vector as the relevant evidence.
EE 26. The apparatus according to EE 25, wherein the distance vj between the second feature vector x and the reference vector zj is calculated as




  
    
      v
      j
    
    =
    
      
        
          
          
            x
            -
            
              z
              j
            
          
          
        
        2
      
      
        
          ∑
          
            j
            =
            1
          
          M
        
        ⁢
        
          
        
        ⁢
        
          
            
            
              x
              -
              
                z
                j
              
            
            
          
          2
        
      
    
  
  ,




where M is the number of the reference vectors, ∥ ∥ represents Euclidean distance.

EE 27. The apparatus according to EE 25, wherein the posterior probability p(zj|x) of the reference vector zj with the second feature vector x as the relevant evidence is calculated as




  
    
      p
      ⁡
      
        (
        
          
            z
            j
          
          ❘
          x
        
        )
      
    
    =
    
      
        
          p
          ⁡
          
            (
            
              x
              ❘
              
                z
                j
              
            
            )
          
        
        ⁢
        
          p
          ⁡
          
            (
            
              z
              j
            
            )
          
        
      
      
        
          ∑
          
            j
            =
            1
          
          M
        
        ⁢
        
          
        
        ⁢
        
          
            p
            ⁡
            
              (
              
                x
                ❘
                
                  z
                  j
                
              
              )
            
          
          ⁢
          
            p
            ⁡
            
              (
              
                z
                j
              
              )
            
          
        
      
    
  
  ,




where p(x|zj) represents the probability of the second feature vector x given the reference vector zj, M is the number of the reference vectors, p(zj) is the prior distribution

EE 28. The apparatus according to EE 22, wherein the parameters of the statistical models are estimated by a maximum likelihood method.
EE 29. The apparatus according to EE 22, wherein the statistical models are based on one or more Dirichlet distributions.
EE 30. The apparatus according to EE 22, wherein the content similarity is measured by one of the following metric:
Hellinger distance;
Square distance;
Kullback-Leibler divergence; and
Bayesian Information Criteria difference.
EE 31. The apparatus according to EE 30, wherein the Hellinger distance D(α,β) is calculated as




  
    
      D
      ⁡
      
        (
        
          α
          ,
          β
        
        )
      
    
    =
    
      2
      -
      
        2
        ×
        
          
            [
            
              
                
                  Γ
                  (
                  
                    
                      ∑
                      
                        k
                        =
                        1
                      
                      d
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      α
                      k
                    
                  
                  )
                
                
                  
                    ∏
                    
                      k
                      =
                      1
                    
                    d
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    Γ
                    ⁡
                    
                      (
                      
                        α
                        k
                      
                      )
                    
                  
                
              
              ×
              
                
                  Γ
                  (
                  
                    
                      ∑
                      
                        k
                        =
                        1
                      
                      d
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      β
                      k
                    
                  
                  )
                
                
                  
                    ∏
                    
                      k
                      =
                      1
                    
                    d
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    Γ
                    ⁡
                    
                      (
                      
                        β
                        k
                      
                      )
                    
                  
                
              
            
            ]
          
          
            1
            2
          
        
        ×
        
          
            
              ∏
              
                k
                =
                1
              
              d
            
            ⁢
            
              
            
            ⁢
            
              Γ
              (
              
                
                  
                    α
                    k
                  
                  +
                  
                    β
                    k
                  
                
                2
              
              )
            
          
          
            Γ
            (
            
              
                ∑
                
                  k
                  =
                  1
                
                d
              
              ⁢
              
                
              
              ⁢
              
                
                  
                    α
                    k
                  
                  +
                  
                    β
                    k
                  
                
                2
              
            
            )
          
        
      
    
  
  ,




where α1, . . . , αd>0 are parameters of one of the statistical models and β1, . . . , βd>0 are parameters of another of the statistical models, d≧2 is the number of dimensions of the first feature vectors, and Γ( ) is a gamma function.

EE 32. The apparatus according to EE 30, wherein the Square distance Ds is calculated as



  
    
      
        D
        s
      
      =
      
        
          
            T
            1
            2
          
          ⁢
          
            
              
                ∏
                
                  k
                  =
                  1
                
                d
              
              ⁢
              
                
              
              ⁢
              
                Γ
                ⁡
                
                  (
                  
                    
                      2
                      ⁢
                      
                        α
                        k
                      
                    
                    -
                    1
                  
                  )
                
              
            
            
              Γ
              (
              
                
                  ∑
                  
                    k
                    =
                    1
                  
                  d
                
                ⁢
                
                  
                
                ⁢
                
                  (
                  
                    
                      2
                      ⁢
                      
                        α
                        k
                      
                    
                    -
                    1
                  
                  )
                
              
              )
            
          
        
        -
        
          2
          ⁢
          
            T
            1
          
          ⁢
          
            T
            2
          
          ⁢
          
            
              
                ∏
                
                  k
                  =
                  1
                
                d
              
              ⁢
              
                
              
              ⁢
              
                (
                
                  
                    α
                    k
                  
                  +
                  
                    β
                    k
                  
                  -
                  1
                
                )
              
            
            
              Γ
              (
              
                
                  ∑
                  
                    k
                    =
                    1
                  
                  d
                
                ⁢
                
                  
                
                ⁢
                
                  (
                  
                    
                      α
                      k
                    
                    +
                    
                      β
                      k
                    
                    -
                    1
                  
                  )
                
              
              )
            
          
        
        +
        
          
            T
            2
            2
          
          ⁢
          
            
              
                ∏
                
                  k
                  =
                  1
                
                d
              
              ⁢
              
                
              
              ⁢
              
                (
                
                  
                    2
                    ⁢
                    
                      β
                      k
                    
                  
                  -
                  1
                
                )
              
            
            
              Γ
              (
              
                
                  ∑
                  
                    k
                    =
                    1
                  
                  d
                
                ⁢
                
                  
                
                ⁢
                
                  (
                  
                    
                      2
                      ⁢
                      
                        β
                        k
                      
                    
                    -
                    1
                  
                  )
                
              
              )
            
          
        
      
    
    ,
    
      

    
    ⁢
    
      
    
    ⁢
    where
  




  
    
      
    
    ⁢
    
      
        
          T
          1
        
        =
        
          
            Γ
            (
            
              
                ∑
                
                  k
                  =
                  1
                
                d
              
              ⁢
              
                
              
              ⁢
              
                α
                k
              
            
            )
          
          
            
              ∏
              
                k
                =
                1
              
              d
            
            ⁢
            
              
            
            ⁢
            
              Γ
              ⁡
              
                (
                
                  α
                  k
                
                )
              
            
          
        
      
      ,
      
        
          T
          2
        
        =
        
          
            Γ
            (
            
              
                ∑
                
                  k
                  =
                  1
                
                d
              
              ⁢
              
                
              
              ⁢
              
                β
                k
              
            
            )
          
          
            
              ∏
              
                k
                =
                1
              
              d
            
            ⁢
            
              
            
            ⁢
            
              Γ
              ⁡
              
                (
                
                  β
                  k
                
                )
              
            
          
        
      
      ,
    
  



α1, . . . , αd>0 are parameters of one of the statistical models and β1, . . . , βd>0 are parameters of another of the statistical models, d≧2 is the number of dimensions of the first feature vectors, and Γ( ) is a gamma function.

EE 33. A method of measuring content similarity between two audio segments, comprising:
extracting first feature vectors from the audio segments, wherein all the feature values in each of the first feature vectors are non-negative and normalized so that the sum of the feature values is one;
generating statistical models for calculating the content similarity based on Dirichlet distribution from the feature vectors; and
calculating the content similarity based on the generated statistical models.
EE 34. The method according to EE 33, wherein the extracting comprises:
extracting second feature vectors from the audio segments; and
for each of the second feature vectors, calculating an amount for measuring a relation between the second feature vector and each of reference vectors, wherein all the amounts corresponding to the second feature vectors form one of the first feature vectors.
EE 35. The method according to EE 34, wherein the reference vectors are determined through one of the following methods:
random generating method where the reference vectors are randomly generated;
unsupervised clustering method where training vectors extracted from training samples are grouped into clusters and the reference vectors are calculated to represent the clusters respectively;
supervised modeling method where in the reference vectors are manually defined and learned from the training vectors; and
eigen-decomposition method where the reference vectors are calculated as eigenvectors of a matrix with the training vectors as its rows.
EE 36. The method according to EE 34, wherein the relation between the second feature vectors and each of the reference vectors is measured by one of the following amounts:
distance between the second feature vector and the reference vector;
correlation between the second feature vector and the reference vector;
inter product between the second feature vector and the reference vector; and
posterior probability of the reference vector with the second feature vector as the relevant evidence.
EE 37. The method according to EE 36, wherein the distance vj between the second feature vector x and the reference vector zj is calculated as




  
    
      v
      j
    
    =
    
      
        
          
          
            x
            -
            
              z
              j
            
          
          
        
        2
      
      
        
          ∑
          
            j
            =
            1
          
          M
        
        ⁢
        
          
        
        ⁢
        
          
            
            
              x
              -
              
                z
                j
              
            
            
          
          2
        
      
    
  
  ,




where M is the number of the reference vectors, ∥ ∥ represents Euclidean distance.

EE 38. The method according to EE 36, wherein the posterior probability p(zj|x) of the reference vector zj with the second feature vector x as the relevant evidence is calculated as




  
    
      p
      ⁡
      
        (
        
          
            z
            j
          
          ❘
          x
        
        )
      
    
    =
    
      
        
          p
          ⁡
          
            (
            
              x
              ❘
              
                z
                j
              
            
            )
          
        
        ⁢
        
          p
          ⁡
          
            (
            
              z
              j
            
            )
          
        
      
      
        
          ∑
          
            j
            =
            1
          
          M
        
        ⁢
        
          
        
        ⁢
        
          
            p
            ⁡
            
              (
              
                x
                ❘
                
                  z
                  j
                
              
              )
            
          
          ⁢
          
            p
            ⁡
            
              (
              
                z
                j
              
              )
            
          
        
      
    
  
  ,




where p(x|zj) represents the probability of the second feature vector x given the reference vector zj, M is the number of the reference vectors, p(zj) is the prior distribution.

EE 39. The method according to EE 33, wherein the parameters of the statistical models are estimated by a maximum likelihood method.
EE 40. The method according to EE 33, wherein the statistical models are based on one or more Dirichlet distributions.
EE 41. The method according to EE 33, wherein the content similarity is measured by one of the following metric:
Hellinger distance;
Square distance;
Kullback-Leibler divergence; and
Bayesian Information Criteria difference.
EE 42. The method according to EE 41, wherein the Hellinger distance D(α,β) is calculated as




  
    
      D
      ⁡
      
        (
        
          α
          ,
          β
        
        )
      
    
    =
    
      2
      -
      
        2
        ×
        
          
            [
            
              
                
                  Γ
                  (
                  
                    
                      ∑
                      
                        k
                        =
                        1
                      
                      d
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      α
                      k
                    
                  
                  )
                
                
                  
                    ∏
                    
                      k
                      =
                      1
                    
                    d
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    Γ
                    ⁡
                    
                      (
                      
                        α
                        k
                      
                      )
                    
                  
                
              
              ×
              
                
                  Γ
                  (
                  
                    
                      ∑
                      
                        k
                        =
                        1
                      
                      d
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      β
                      k
                    
                  
                  )
                
                
                  
                    ∏
                    
                      k
                      =
                      1
                    
                    d
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    Γ
                    ⁡
                    
                      (
                      
                        β
                        k
                      
                      )
                    
                  
                
              
            
            ]
          
          
            1
            2
          
        
        ×
        
          
            
              ∏
              
                k
                =
                1
              
              d
            
            ⁢
            
              
            
            ⁢
            
              Γ
              (
              
                
                  
                    α
                    k
                  
                  +
                  
                    β
                    k
                  
                
                2
              
              )
            
          
          
            Γ
            (
            
              
                ∑
                
                  k
                  =
                  1
                
                d
              
              ⁢
              
                
              
              ⁢
              
                
                  
                    α
                    k
                  
                  +
                  
                    β
                    k
                  
                
                2
              
            
            )
          
        
      
    
  
  ,




where α1, . . . , αd>0 are parameters of one of the statistical models and β1, . . . , βd>0 are parameters of another of the statistical models, d≧2 is the number of dimensions of the first feature vectors, and Γ( ) is a gamma function.

EE 43. The method according to EE 41, wherein the Square distance Ds is calculated as



  
    
      
        D
        s
      
      =
      
        
          
            T
            1
            2
          
          ⁢
          
            
              
                ∏
                
                  k
                  =
                  1
                
                d
              
              ⁢
              
                
              
              ⁢
              
                Γ
                ⁡
                
                  (
                  
                    
                      2
                      ⁢
                      
                        α
                        k
                      
                    
                    -
                    1
                  
                  )
                
              
            
            
              Γ
              (
              
                
                  ∑
                  
                    k
                    =
                    1
                  
                  d
                
                ⁢
                
                  
                
                ⁢
                
                  (
                  
                    
                      2
                      ⁢
                      
                        α
                        k
                      
                    
                    -
                    1
                  
                  )
                
              
              )
            
          
        
        -
        
          2
          ⁢
          
            T
            1
          
          ⁢
          
            T
            2
          
          ⁢
          
            
              
                ∏
                
                  k
                  =
                  1
                
                d
              
              ⁢
              
                
              
              ⁢
              
                (
                
                  
                    α
                    k
                  
                  +
                  
                    β
                    k
                  
                  -
                  1
                
                )
              
            
            
              Γ
              (
              
                
                  ∑
                  
                    k
                    =
                    1
                  
                  d
                
                ⁢
                
                  
                
                ⁢
                
                  (
                  
                    
                      α
                      k
                    
                    +
                    
                      β
                      k
                    
                    -
                    1
                  
                  )
                
              
              )
            
          
        
        +
        
          
            T
            2
            2
          
          ⁢
          
            
              
                ∏
                
                  k
                  =
                  1
                
                d
              
              ⁢
              
                
              
              ⁢
              
                (
                
                  
                    2
                    ⁢
                    
                      β
                      k
                    
                  
                  -
                  1
                
                )
              
            
            
              Γ
              (
              
                
                  ∑
                  
                    k
                    =
                    1
                  
                  d
                
                ⁢
                
                  
                
                ⁢
                
                  (
                  
                    
                      2
                      ⁢
                      
                        β
                        k
                      
                    
                    -
                    1
                  
                  )
                
              
              )
            
          
        
      
    
    ,
    
      

    
    ⁢
    
      
    
    ⁢
    where
  




  
    
      
    
    ⁢
    
      
        
          T
          1
        
        =
        
          
            Γ
            (
            
              
                ∑
                
                  k
                  =
                  1
                
                d
              
              ⁢
              
                
              
              ⁢
              
                α
                k
              
            
            )
          
          
            
              ∏
              
                k
                =
                1
              
              d
            
            ⁢
            
              
            
            ⁢
            
              Γ
              ⁡
              
                (
                
                  α
                  k
                
                )
              
            
          
        
      
      ,
      
        
          T
          2
        
        =
        
          
            Γ
            (
            
              
                ∑
                
                  k
                  =
                  1
                
                d
              
              ⁢
              
                
              
              ⁢
              
                β
                k
              
            
            )
          
          
            
              ∏
              
                k
                =
                1
              
              d
            
            ⁢
            
              
            
            ⁢
            
              Γ
              ⁡
              
                (
                
                  β
                  k
                
                )
              
            
          
        
      
      ,
    
  



α1, . . . , αd>0 are parameters of one of the statistical models and β1, . . . , βd>0 are parameters of another of the statistical models, d≧2 is the number of dimensions of the first feature vectors, and Γ( ) is a gamma function.

EE 44. An apparatus for measuring content similarity between two audio segments, comprising:
a feature generator which extracts first feature vectors from the audio segments, wherein all the feature values in each of the first feature vectors are non-negative and normalized so that the sum of the feature values is one;
a model generator which generates statistical models for calculating the content similarity based on Dirichlet distribution from the feature vectors; and
a similarity calculator which calculates the content similarity based on the generated statistical models.
EE 45. The apparatus according to EE 44, wherein the feature generator is further configured to
extract second feature vectors from the audio segments; and
for each of the second feature vectors, calculate an amount for measuring a relation between the second feature vector and each of reference vectors, wherein all the amounts corresponding to the second feature vectors form one of the first feature vectors.
EE 46. The apparatus according to EE 45, wherein the reference vectors are determined through one of the following methods:
random generating method where the reference vectors are randomly generated;
unsupervised clustering method where training vectors extracted from training samples are grouped into clusters and the reference vectors are calculated to represent the clusters respectively;
supervised modeling method where in the reference vectors are manually defined and learned from the training vectors; and
eigen-decomposition method where the reference vectors are calculated as eigenvectors of a matrix with the training vectors as its rows.
EE 47. The apparatus according to EE 45, wherein the relation between the second feature vectors and each of the reference vectors is measured by one of the following amounts:
distance between the second feature vector and the reference vector;
correlation between the second feature vector and the reference vector;
inter product between the second feature vector and the reference vector; and
posterior probability of the reference vector with the second feature vector as the relevant evidence.
EE 48. The apparatus according to EE 47, wherein the distance vj between the second feature vector x and the reference vector zj is calculated as




  
    
      v
      j
    
    =
    
      
        
          
          
            x
            -
            
              z
              j
            
          
          
        
        2
      
      
        
          ∑
          
            j
            =
            1
          
          M
        
        ⁢
        
          
        
        ⁢
        
          
            
            
              x
              -
              
                z
                j
              
            
            
          
          2
        
      
    
  
  ,




where M is the number of the reference vectors, ∥ ∥ represents Euclidean distance.

EE 49. The apparatus according to EE 47, wherein the posterior probability p(zj|x) of the reference vector zj with the second feature vector x as the relevant evidence is calculated as




  
    
      p
      ⁡
      
        (
        
          
            z
            j
          
          ❘
          x
        
        )
      
    
    =
    
      
        
          p
          ⁡
          
            (
            
              x
              ❘
              
                z
                j
              
            
            )
          
        
        ⁢
        
          p
          ⁡
          
            (
            
              z
              j
            
            )
          
        
      
      
        
          ∑
          
            j
            =
            1
          
          M
        
        ⁢
        
          
        
        ⁢
        
          
            p
            ⁡
            
              (
              
                x
                ❘
                
                  z
                  j
                
              
              )
            
          
          ⁢
          
            p
            ⁡
            
              (
              
                z
                j
              
              )
            
          
        
      
    
  
  ,




where p(x|zj) represents the probability of the second feature vector x given the reference vector zj, M is the number of the reference vectors, p(zj) is the prior distribution.

EE 50. The apparatus according to EE 44, wherein the parameters of the statistical models are estimated by a maximum likelihood method.
EE 51. The apparatus according to EE 44, wherein the statistical models are based on one or more Dirichlet distributions.
EE 52. The apparatus according to EE 44, wherein the content similarity is measured by one of the following metric:
Hellinger distance;
Square distance;
Kullback-Leibler divergence; and
Bayesian Information Criteria difference.
EE 53. The apparatus according to EE 52, wherein the Hellinger distance D(α,β) is calculated as




  
    
      D
      ⁡
      
        (
        
          α
          ,
          β
        
        )
      
    
    =
    
      2
      -
      
        2
        ×
        
          
            [
            
              
                
                  Γ
                  (
                  
                    
                      ∑
                      
                        k
                        =
                        1
                      
                      d
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      α
                      k
                    
                  
                  )
                
                
                  
                    ∏
                    
                      k
                      =
                      1
                    
                    d
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    Γ
                    ⁡
                    
                      (
                      
                        α
                        k
                      
                      )
                    
                  
                
              
              ×
              
                
                  Γ
                  (
                  
                    
                      ∑
                      
                        k
                        =
                        1
                      
                      d
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      β
                      k
                    
                  
                  )
                
                
                  
                    ∏
                    
                      k
                      =
                      1
                    
                    d
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    Γ
                    ⁡
                    
                      (
                      
                        β
                        k
                      
                      )
                    
                  
                
              
            
            ]
          
          
            1
            2
          
        
        ×
        
          
            
              ∏
              
                k
                =
                1
              
              d
            
            ⁢
            
              
            
            ⁢
            
              Γ
              (
              
                
                  
                    α
                    k
                  
                  +
                  
                    β
                    k
                  
                
                2
              
              )
            
          
          
            Γ
            (
            
              
                ∑
                
                  k
                  =
                  1
                
                d
              
              ⁢
              
                
              
              ⁢
              
                
                  
                    α
                    k
                  
                  +
                  
                    β
                    k
                  
                
                2
              
            
            )
          
        
      
    
  
  ,




where α1, . . . , αd>0 are parameters of one of the statistical models and β1, . . . , βd>0 are parameters of another of the statistical models, d≧2 is the number of dimensions of the first feature vectors, and Γ( ) is a gamma function.

EE 54. The apparatus according to EE 52, wherein the Square distance Ds is calculated as



  
    
      
        D
        s
      
      =
      
        
          
            T
            1
            2
          
          ⁢
          
            
              
                ∏
                
                  k
                  =
                  1
                
                d
              
              ⁢
              
                
              
              ⁢
              
                Γ
                ⁡
                
                  (
                  
                    
                      2
                      ⁢
                      
                        α
                        k
                      
                    
                    -
                    1
                  
                  )
                
              
            
            
              Γ
              (
              
                
                  ∑
                  
                    k
                    =
                    1
                  
                  d
                
                ⁢
                
                  
                
                ⁢
                
                  (
                  
                    
                      2
                      ⁢
                      
                        α
                        k
                      
                    
                    -
                    1
                  
                  )
                
              
              )
            
          
        
        -
        
          2
          ⁢
          
            T
            1
          
          ⁢
          
            T
            2
          
          ⁢
          
            
              
                ∏
                
                  k
                  =
                  1
                
                d
              
              ⁢
              
                
              
              ⁢
              
                (
                
                  
                    α
                    k
                  
                  +
                  
                    β
                    k
                  
                  -
                  1
                
                )
              
            
            
              Γ
              (
              
                
                  ∑
                  
                    k
                    =
                    1
                  
                  d
                
                ⁢
                
                  
                
                ⁢
                
                  (
                  
                    
                      α
                      k
                    
                    +
                    
                      β
                      k
                    
                    -
                    1
                  
                  )
                
              
              )
            
          
        
        +
        
          
            T
            2
            2
          
          ⁢
          
            
              
                ∏
                
                  k
                  =
                  1
                
                d
              
              ⁢
              
                
              
              ⁢
              
                (
                
                  
                    2
                    ⁢
                    
                      β
                      k
                    
                  
                  -
                  1
                
                )
              
            
            
              Γ
              (
              
                
                  ∑
                  
                    k
                    =
                    1
                  
                  d
                
                ⁢
                
                  
                
                ⁢
                
                  (
                  
                    
                      2
                      ⁢
                      
                        β
                        k
                      
                    
                    -
                    1
                  
                  )
                
              
              )
            
          
        
      
    
    ,
    
      

    
    ⁢
    
      
    
    ⁢
    where
  




  
    
      
    
    ⁢
    
      
        
          T
          1
        
        =
        
          
            Γ
            (
            
              
                ∑
                
                  k
                  =
                  1
                
                d
              
              ⁢
              
                
              
              ⁢
              
                α
                k
              
            
            )
          
          
            
              ∏
              
                k
                =
                1
              
              d
            
            ⁢
            
              
            
            ⁢
            
              Γ
              ⁡
              
                (
                
                  α
                  k
                
                )
              
            
          
        
      
      ,
      
        
          T
          2
        
        =
        
          
            Γ
            (
            
              
                ∑
                
                  k
                  =
                  1
                
                d
              
              ⁢
              
                
              
              ⁢
              
                β
                k
              
            
            )
          
          
            
              ∏
              
                k
                =
                1
              
              d
            
            ⁢
            
              
            
            ⁢
            
              Γ
              ⁡
              
                (
                
                  β
                  k
                
                )
              
            
          
        
      
      ,
    
  



α1, . . . , αd>0 are parameters of one of the statistical models and β1, . . . , βd>0 are parameters of another of the statistical models, d≧2 is the number of dimensions of the first feature vectors, and Γ( ) is a gamma function.

EE 55. A computer-readable medium having computer program instructions recorded thereon, when being executed by a processor, the instructions enabling the processor to execute a method of measuring content coherence between a first audio section and a second audio section, comprising:
for each of audio segments in the first audio section,

    
    
        determining a predetermined number of audio segments in the second audio section, wherein content similarity between the audio segment in the first audio section and the determined audio segments is higher than that between the audio segment in the first audio section and all the other audio segments in the second audio section; and
        calculating an average of the content similarity between the audio segment in the first audio section and the determined audio segments; and
    
    


calculating first content coherence as an average of the averages calculated for the audio segments in the first audio section.
EE 56. A computer-readable medium having computer program instructions recorded thereon, when being executed by a processor, the instructions enabling the processor to execute a method of measuring content similarity between two audio segments, comprising:
extracting first feature vectors from the audio segments, wherein all the feature values in each of the first feature vectors are non-negative and normalized so that the sum of the feature values is one;
generating statistical models for calculating the content similarity based on Dirichlet distribution from the feature vectors; and
calculating the content similarity based on the generated statistical models.

## Claims

1. A method of measuring content similarity between two audio segments, comprising:
extracting first feature vectors from the audio segments, wherein all the feature values in each of the first feature vectors are non-negative and normalized so that the sum of the feature values is one;
generating statistical models for calculating the content similarity based on Dirichlet distribution from the feature vectors; and
calculating the content similarity based on the generated statistical models, wherein the extracting comprises:
extracting second feature vectors from the audio segments; and
for each of the second feature vectors, calculating an amount for measuring a relation between the second feature vector and each of reference vectors, wherein all the amounts corresponding to the second feature vectors form one of the first feature vectors, wherein the reference vectors are determined through one of the following methods:
random generating method where the reference vectors are randomly generated;
unsupervised clustering method where training vectors extracted from training samples are grouped into clusters and the reference vectors are calculated to represent the clusters respectively;
supervised modeling method where in the reference vectors are manually defined and learned from the training vectors; and
eigen-decomposition method where the reference vectors are calculated as eigenvectors of a matrix with the training vectors as its rows.

2. The method according to claim 1, wherein the relation between the second feature vectors and each of the reference vectors is measured by one of the following amounts:
distance between the second feature vector and the reference vector;
correlation between the second feature vector and the reference vector;
inter product between the second feature vector and the reference vector; and
posterior probability of the reference vector with the second feature vector as the relevant evidence.

3. An apparatus for measuring content similarity between two audio segments, comprising:
a feature generator which extracts first feature vectors from the audio segments, wherein all the feature values in each of the first feature vectors are non-negative and normalized so that the sum of the feature values is one;
a model generator which generates statistical models for calculating the content similarity based on Dirichlet distribution from the feature vectors; and
a similarity calculator which calculates the content similarity based on the generated statistical models, wherein the feature generator is further configured to
extract second feature vectors from the audio segments; and
for each of the second feature vectors, calculate an amount for measuring a relation between the second feature vector and each of reference vectors, wherein all the amounts corresponding to the second feature vectors form one of the first feature vectors, wherein the reference vectors are determined through one of the following methods:
random generating method where the reference vectors are randomly generated;
unsupervised clustering method where training vectors extracted from training samples are grouped into clusters and the reference vectors are calculated to represent the clusters respectively;
supervised modeling method where in the reference vectors are manually defined and learned from the training vectors; and
eigen-decomposition method where the reference vectors are calculated as eigenvectors of a matrix with the training vectors as its rows.

4. The Apparatus according to claim 3, wherein the relation between the second feature vectors and each of the reference vectors is measured by one of the following amounts:
distance between the second feature vector and the reference vector;
correlation between the second feature vector and the reference vector;
inter product between the second feature vector and the reference vector; and
posterior probability of the reference vector with the second feature vector as the relevant evidence.