# Patent

## Title
Advertisement insertion points detection for online video advertising

## Abstract

Systems and methods for determining insertion points in a first video stream are described. The insertions points being configured for inserting at least one second video into the first video. In accordance with one embodiment, a method for determining the insertion points includes parsing the first video into a plurality of shots. The plurality of shots includes one or more shot boundaries. The method then determines one or more insertion points by balancing a discontinuity metric and an attractiveness metric of each shot boundary.

## Background
BACKGROUND
Video advertisements typically have a greater impact on viewers than traditional online text-based advertisements. Internet users frequently stream online source video for viewing. A search engine may have indexed such a source video. The source video may be a video stream from a live camera, a movie, or any videos accessed over a network. If a source video includes a video advertisement clip (a short video, an animation such as a Flash or GIF, still images, etc.), a human being has typically manually inserted the video advertisement clip into the source video. Manually inserting advertisement video clips into source video is a time-consuming and labor-intensive process that does not take into account the real-time nature of interactive user browsing and playback of online source video.
SUMMARY
This Summary is provided to introduce a selection of concepts in a simplified form that is further described below in the Detailed Description. This Summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.
Described herein are embodiments of various technologies for determining of insertion points for a first video stream. In one embodiment, a method for determining the video advertisement insertion points includes parsing a first video into a plurality of shots. The plurality of shots includes one or more shot boundaries. The method then determines one or more insertion points by balancing the discontinuity and attractiveness for each of the one or more shot boundaries. The insertions points are configured for inserting at least one second video into the first video.
In a particular embodiment, the determination of the insertion points includes computing a degree of discontinuity for each of the one or more shot boundaries. Likewise, the determination of the insertion points also includes computing a degree of attractiveness for each of the one or more shot boundaries. The insertion points are then determined based on the degree of discontinuity and the degree of attractiveness of each shot boundary. Once the insertion points are determined, at least one second video is inserted at each of the determined insert points so that an integrated video stream is formed. In a further embodiment, the integrated video stream is provided to a viewer for playback. In turn, the viewer may assess the effectiveness of the insertion points based on viewer feedback to a played integrated video stream.
In another embodiment, a computer readable medium for determining insertion points for a first video stream includes computer-executable instructions. The computer executable instructions, when executed, perform acts that comprise parsing the first video into a plurality of shots. The plurality of shots includes one or more shot boundaries. A degree of discontinuity for each of the one or more shot boundaries is then computed. Likewise, a degree of attractiveness for each of the one or more shot boundaries is also computed. The insertion points are then determined based on the degree of discontinuity and the degree of attractiveness of each shot boundary. The insertions points being configured for inserting at least one second video into the first video.
Once the insertion points are determined, at least one second video is inserted at each of the determined insert points so that an integrated video stream is formed.
In an additional embodiment, a system for determining insertion points for a first video stream comprises one or more processors. The system also comprises memory allocated for storing a plurality of computer-executable instructions that are executable by the one or more processors. The computer-executable instructions comprise instructions for parsing the first video into a plurality of shots, the plurality of shots includes one or more shot boundaries, computing a degree of discontinuity for each of the one or more shot boundaries, computing a degree of attractiveness for each of the one or more shot boundaries. The instructions also enable the determination of the one or more insertion points based on the degree of discontinuity and the degree of attractiveness of each shot boundary. The insertions points being configured for inserting at least one second video into the first video. Finally, the instructions further facilitate the insertion of the at least one second video at each of the determined insert points to form an integrated video stream.
Other embodiments will become more apparent from the following detailed description when taken in conjunction with the accompanying drawings.



BRIEF DESCRIPTION OF THE DRAWINGS
The detailed description is described with reference to the accompanying figures. In the figures, the left-most digit(s) of a reference number identifies the figure in which the reference number first appears. The use of the same reference number in different figures indicates similar or identical items.
FIG. 1 is a simplified block diagram that illustrates an exemplary video advertisement insertion process.
FIG. 2 is a simplified block diagram that illustrates selected components of a video insertion engine that may be implemented in the representative computing environment shown in FIG. 12.
FIG. 3 is a diagram that illustrates exemplary schemes for the determination of video advertisement insertion points.
FIG. 4 depicts an exemplary flow diagram for determining video advertisement insertion points using the representative computing environment shown in FIG. 12.
FIG. 5 depicts an exemplary flow diagram for gauging viewer attention using the representative computing environment shown in FIG. 12.
FIG. 6 is a flow diagram showing an illustrative process gauging visual attention using the representative computing environment shown in FIG. 12.
FIG. 7 is a flow diagram showing an illustrative process gauging audio attention using the representative computing environment shown in FIG. 12.
FIG. 8 is a diagram that illustrates the use of the twin-comparison method on consecutive frames in a video segment, such as a shot from a video source, using the representative computing environment shown in FIG. 12.
FIG. 9 is a diagram that illustrates the proximity of video advertisement insertion points to a plurality parsed shots in a source video.
FIG. 10 is a diagram that illustrates a Left-Right Hidden Markov Model that is included in a best first merge model (BFMM).
FIG. 11 is a diagram that illustrates exemplary models of camera motion used for visual attention modeling.
FIG. 12 is a simplified block diagram that illustrates a representative computing environment. The representative environment may be a part of a computing device. Moreover, the representative computing environment may be used to implement the advertisement insertion point determination techniques and mechanisms described herein.



DETAILED DESCRIPTION
This disclosure is directed to systems and methods that facilitate the insertion of video advertisements into source videos. A typical video advertisement, or advertising clip, is a short video that includes text, image, or animation. Video advertisements may be inserted into a source video stream so that as a viewer watches the source video, the viewer is automatically presented with advertising clips at one or more points during playback. For instance, video advertisements may be superimposed into selected frames of a source video. A specific example may be an animation that appears and then disappears on the lower right corner of the video source. In other instances, video advertisements may be displayed in separate streams beside the source video stream. For example, a video advertisement may be presented in a separate viewing area during at least some duration of the source video playback. By presenting video advertisements simultaneously with the source video, the likelihood that the video advertisements will receive notice by the viewer may be enhanced.
The systems and methods in accordance with this disclosure determine one or more positions in the timeline of a source video stream where video advertisements may be inserted. These timeline positions may also be referred to as insertion points. According to various embodiments, the one or more insertion points may be positioned so that the impact of the inserted advertising clips on the viewer is maximized. The determination of video advertisement insertion points in a video source stream are described below with reference to FIGS. 1-12.
Exemplary Insertion Point Determination Concept
FIG. 1 shows an exemplary video advertisement insertion system 100. The video advertisement insertion system 100 enables content providers 102 to provide video sources 104. The content providers 102 may include anyone who owns video content, and is willing to disseminate such video content to the general public. For example, the content providers 102 may include professional as well as amateur artists. The video sources 104 are generally machine-readable works that contain a plurality of images, such as movies, video clips, homemade videos, etc.
Advertisers 106 may produce video advertisements 108. The video advertisements 108 are generally one or more images intended to generate viewer interest in particular goods, services, or points of view. In many instances, a video advertisement 108 may be a video clip. The video clip may be approximately 10-30 seconds in duration. In the exemplary system 100, the video sources 104 and the video advertisements 108 may be transferred to an advertising service 110 via one or more networks 112. The one or more networks 112 may include wide-area networks (WANs), local area networks (LANs), or other network architectures.
The advertising service 110 is generally configured to integrate the video sources 104 with the video advertisements 108. Specifically, the advertising service 110 may use the video insertion engine 114 to match portions of the video source 104 with video advertisements 108. According to various implementations, the video insertion engine 114 may determine one or more insertion points 116 in the time line of the video source 104. The video insertion engine 114 may then insert one or more video advertisements 118 at the insertion points 116. The integration of the video source 104 and the one or more video advertisements 118 produces an integrated video 120. As further described below, the determination of locations for the insertion points 116 may be based on assessing the “discontinuity” and the “attractiveness” of a video boundary one or more video segments, or shots, which make up the video source 104.
FIG. 2 illustrates selected components of one example of the video insertion engine 114. The video insertion engine 114 may include computer-program instructions being executed by a computing device such as a personal computer. Program instructions may include routines, programs, objects, components, and data structures that perform particular tasks or implement particular abstract data types. However, the video insertion engine 114 may also be implemented in hardware.
The video insertion engine 114 may include shot parser 202. The shot parser 202 can be configured to parse a video, such as video source 104 into video segments, or shots. Specifically, the shot parser 202 may employ a boundary determination engine 204 to first divide the video source into shots. Subsequently, the boundary determination engine 204 may further ascertain the breaks between the shots, that is, shot boundaries, to serve as potential video advertisement insertion points. Some of the potential advertisement insertion points may end up being actual advertisement insertion points 116, as shown in FIG. 1.
The example video insertion engine 114 may also include a boundary analyzer 206. As shown in FIG. 2, the boundary analyzer 206 may further include a discontinuity analyzer 208 and an attractiveness analyzer 210. The discontinuity analyzer 208 may be configured to analyze each shot boundary for “discontinuity,” which may further include “content discontinuity and “semantic discontinuity.” As described further below, “content discontinuity” is a measurement of the visual and/or audio discontinuity, as perceived by viewers. “Semantic discontinuity”, on the other hand, is the discontinuity as analyzed by a mental process of the viewers. To put it another way, the “discontinuity” at a particular shot boundary measures the dissimilarity of the pair of shots that are adjacent the shot boundary.
Moreover, the attractiveness analyze 210 of the boundary analyzer 206 may be configured to compute a degree of “attractiveness” for each shot boundary. In general, the degree of “attractiveness” is a measurement of the ability of the shot boundary to attract the attention of viewers. As further described below, the attractiveness analyze 210 may use a plurality of user attention models, or mathematical algorithms, to quantify the attractiveness of a particular shot boundary. The “discontinuity” and “attractiveness” of one or more shot boundaries in a source video are then analyzed by an insertion point generator 212.
The insertion point generator 212 may detect the appropriate locations in the time line of the source video to serve as insertion points based on the discontinuity measurements and attractiveness measurements. As further described below, in some embodiments, the insertion point generator 212 may include an evaluator 214 that is configured to adjust the weights assigned to the “discontinuity” and “attractiveness” measurements of the shot boundaries to optimize the placement of the insertion points 116.
The video insertion engine 114 may further include an advertisement embedder 216. The advertisement embedder 216 may be configured to insert one or more video advertisements, such as the video advertisements 118, at the detected insertion points 116. According to various implementations, the video embedder 216 may insert the one or more video advertisements directly into the source video stream at the insertion points 116. Alternatively, the video embedder 216 may insert the one or more video advertisements by overlaying or superimposing the video advertisements onto one or more frames of the video source, such as video source 104, at the insertion points 116. In some instances, the video embedder 216 may insert the one or more video advertisements by initiating their display as separate streams concurrently with the video source at the insertion points 116.
FIG. 3 illustrates exemplary schemes for the determination of insertion point locations in the timeline of a source video. Specifically, the schemes weigh the “attractiveness” and “discontinuity” measurements of the various shots in the video source. For these measurements, insertion point locations may be determined based on the balancing of “attractiveness” and “intrusiveness” considerations.
According to various implementations, “intrusiveness” of the video advertisement insertion point may be defined as the interruptive effect of the video advertisement on a viewer who is watching a playback of the video source stream. For example, a video advertisement in the form of an “embedded” animation is likely to be intrusive if it appears during a dramatic point (e.g., a shot or a scene) in the story being presented by the source video. Such presentation of the video advertisement may distract the viewer and detract from the viewer's ability to derive enjoyment from the story. However, the likelihood that the viewer will notice the video advertisement may be increased. In this way, as long as the intrusiveness of the video advertisement insertion point does not exceed viewer tolerance, the owner of the video advertisement may derive increased benefit. Thus, more “intrusive” video advertisement insertion points weigh the benefit to advertisers more heavily than the benefit to video source viewers.
Conversely, if an insertion point is configured so the video advertisement is displayed during a relatively uninteresting part of a story presented by the video source, the viewer is likely to feel less interrupted. Uninteresting parts of the video source may include the ends of a story or scene, or the finish of a shot. Because these terminations are likely to be natural breaking points, the viewer may perceive the video advertisements inserted at these points as less intrusive. Consequently, less “intrusive” video advertisement insertion points place a great emphasis on the benefit to viewers than the benefit to advertisers.
According to various embodiments, the “attractiveness” of a video advertisement insertion point is dependent upon the “attractiveness” of an associated video segment. Further, the “attractiveness” of a particular video segment may be approximate by the degree that the content of the video segment attracts viewer attention. For example, images that zoom in/out of view, as well as images that depict human faces, are generally ideal for attracting viewer attention.
Thus, if a video advertisement is shown close in time with a more “attractive” video segment, the video advertisement is likely to be perceived by the viewer as more “attractive.” Conversely, if a video advertisement is shown close in time to a video segment that is not as “attractive”, such as a relatively boring or uninteresting segment, the viewer is likely to deem the video advertisement as less “attractive.” Because more “attractive” video advertisement insertion points are generally closer in time to more “attractive” video segments, having a more “attractive” insertion point may be considered to be placing a greater emphasis on the benefit to advertisers. On the other hand, because less “attractive” video advertisement insertion points are approximate less “attractive” video segments, having a less “attractive” video advertisement insertion point may be considered to be weighing the benefit to the viewers more heavily than the benefit to advertisers.
As shown in FIG. 3, if the attractiveness of a video segment may be denoted by A, and the discontinuity of the video segment may be denoted by D, there are four combination scheme 302-308 that balance A and D during the detection of video advertisement insertion points. Additionally, α and β represent two parameters (non-negative real numbers), each of which can be set to 3. The measurements of A and D, as well as the combination of attractiveness and discontinuity represented by A and D, will be described below. According to various embodiments, the four combination schemes are configured to provide video advertisement insertion locations based on the desired “attractiveness” to “intrusiveness” proportions.
Exemplary Processes
FIGS. 4-7 illustrate exemplary processes of determination of video advertisement insertion points. The exemplary processes in FIGS. 4-7 are illustrated as a collection of blocks in a logical flow diagram, which represents a sequence of operations that can be implemented in hardware, software, and a combination thereof. In the context of software, the blocks represent computer-executable instructions that, when executed by one or more processors, perform the recited operations. Generally, computer-executable instructions include routines, programs, objects, components, data structures, and the like that perform particular functions or implement particular abstract data types. The order in which the operations are described is not intended to be construed as a limitation, and any number of the described blocks can be combined in any order and/or in parallel to implement the process. For discussion purposes, the processes are described with reference to the video insertion engine 114 of FIG. 1, although they may be implemented in other system architectures.
FIG. 4 shows a process 400 for determining video advertisement insertion points. At block 402, the boundary determination engine 204 of the shot parser 202 may implement a pre-processing step to parse a source video V into Ns shots.
According to some embodiments, the shot parser 202 may parse the source video V into Ns shots based on the visual details in each of the shots. In these embodiments, the parsing of the source video into a plurality of shots may employ a pair-wise comparison method to detect a qualitative change between two frames. Specifically, the pair-wise comparison method may include the comparison of corresponding pixels in the two frames to determine how many pixels have changed. In one implementation, a pixel is determined to be changed if the difference between its intensity values in the two frames exceeds a given threshold t. The comparison metric can be represented as a binary function D Pi(k, l) over the domain of two-dimensional coordinates of pixels, (k,l), where the subscript i denotes the index of the frame being compared with its successor. If Pi(k,l) denotes the intensity value of the pixel at coordinates (k,l) in frame i, then D Pi(k,l) may be defined as follows:




  
    
      
        
          
            DP
            i
          
          ⁡
          
            (
            
              k
              ,
              l
            
            )
          
        
        =
        
          {
          
            
              
                1
              
              
                
                  
                    if
                    ⁢
                    
                      
                    
                    ⁢
                    
                      
                      
                        
                          
                            P
                            i
                          
                          ⁡
                          
                            (
                            
                              k
                              ,
                              l
                            
                            )
                          
                        
                        -
                        
                          
                            P
                            
                              i
                              +
                              1
                            
                          
                          ⁡
                          
                            (
                            
                              K
                              ,
                              l
                            
                            )
                          
                        
                      
                      
                    
                  
                  >
                  t
                
              
            
            
              
                0
              
              
                otherwise
              
            
          
        
      
    
    
      
        (
        1
        )
      
    
  




The pair-wise segmentation comparison method counts the number of pixels changed from one frame to the next according to the comparison metric. A segment boundary is declared if more than a predetermined percentage of the total number of pixels (given as a threshold T) has changed. Since the total number of pixels in a frame of dimensions M by N is M*N, this condition may be represented by the following inequality:





  
    
      
        
          
            
              
                
                  ∑
                  
                    k
                    ,
                    
                      l
                      =
                      1
                    
                  
                  
                    M
                    ,
                    N
                  
                
                ⁢
                DP
              
              ,
              
                (
                
                  k
                  ,
                  l
                
                )
              
            
            
              M
              *
              N
            
          
          *
          100
        
        >
        T
      
    
    
      
        (
        2
        )
      
    
  




In particular embodiments, the boundary determination engine 204 may employ the use of a smoothing filter before the comparison of each pixel. The use of a smoothing filter may reduce or eliminate the sensitivity of this comparison method to camera panning. The large number of objects moving across successive frames, as associated with camera panning, may cause the comparison metric to judge that a large number of pixels as changed even if the pan entails the shift of only a few pixels. The smooth filter may serve to reduce this effect by replacing the value of each pixel in a frame with the mean value of its nearest neighbors.
In other embodiments, the parsing of the source video into a plurality of shots may make use of a likelihood ratio method. In contrast to the pair-wise comparison method described above, the likelihood ratio method may compare corresponding regions (blocks) in two successive frames on the basis of second-order statistical characteristics of their intensity values. For example, if mi and mi+1 denote the mean intensity values for a given region in two consecutive frames, and Si and Si+1 denote the corresponding variances, the following formula computes the likelihood ratio and determines whether or not it exceeds a given threshold t:




  
    
      
        
          
            
              [
              
                
                  
                    
                      S
                      i
                    
                    +
                    
                      S
                      i
                    
                    +
                    1
                  
                  2
                
                +
                
                  
                    (
                    
                      
                        
                          m
                          i
                        
                        +
                        
                          m
                          
                            i
                            +
                            1
                          
                        
                      
                      2
                    
                    )
                  
                  2
                
              
              ]
            
            2
          
          
            
              S
              i
            
            *
            
              S
              
                i
                +
                1
              
            
          
        
        >
        t
      
    
    
      
        (
        3
        )
      
    
  




By using this formula, breaks between shots may be detected by first partitioning the frames into a set of sample areas. A break between shots may then be declared whenever the total number of sample areas with likelihood ratio that exceed the threshold t is greater than a predetermined amount. In one implementation, this predetermined amount is dependent on how a frame is partitioned.
In alternative embodiments, the boundary determination engine 204 may parse the source video into a plurality of shots using an intensity level histogram method. Specifically, the boundary determination engine 204 may use a histogram algorithm to develop and compare the intensity level histograms for complete images on successive frames. The principle behind this algorithm is that two frames having an unchanging background and unchanging objects will show little difference in their respective histograms. The histogram comparison algorithm may exhibit less sensitivity to object motion as it ignores spatial changes in a frame.
For instance, if Hi(j) denote the histogram value for the i-th frame, where j is one of the G possible grey levels, then the difference between the i-th frame and its successor will be given by the following formula:




  
    
      
        
          SD
          i
        
        =
        
          
            ∑
            
              j
              =
              1
            
            G
          
          ⁢
          
            
            
              
                
                  H
                  i
                
                ⁡
                
                  (
                  j
                  )
                
              
              -
              
                
                  H
                  
                    i
                    +
                    1
                  
                
                ⁡
                
                  (
                  j
                  )
                
              
            
            
          
        
      
    
    
      
        (
        4
        )
      
    
  




In such an instance, if the overall difference SDi is larger than a given threshold T, a shot boundary may be declared. To select a suitable threshold T, SDi can be normalized by dividing it by the product of G and M*N. As described above, M*N represents the total number of pixels in a frame of dimensions M by N. Additionally, it will be appreciated that the number of histogram bins for the purpose of denoting the histogram values may be selected on the basis of the available grey-level resolution and the desired computation time. In additional embodiments, the boundary determination engine 204 may use a twin-comparison method to detect gradual transitions between shots in a video source. The twin-comparison method is shown in FIG. 8.
FIG. 8 illustrates the use of the twin-comparison method on consecutive frames in a video segment, such as a shot from a video source. As shown in graph 802, the twin-comparison method uses two cutoff thresholds: Tb and Ts. Tb represents a high threshold. The high threshold may be obtained using the likelihood ratio method described above. Ts represents a low threshold. Ts may be determined via the comparison of consecutive frames using a difference metric, such as the difference metric in Equation 4.
First, wherever the difference value between the consecutive frames exceeds threshold Tb, the twin-comparison method may recognize the location of the frame as a shot break. For example, the location Fb may be recognized as a shot break because it has a value that exceeds the threshold Tb.
Second, the twin-comparison method may be also capable of detecting differences that are smaller than Tb but larger than Ts. Any frame that exhibits such a difference value is marked as the potential start (Fs) of a gradual transition. As illustrated in FIG. 8, the frame having a difference value between the thresholds Tb and Ts is then compared to subsequent frames in what is known as an accumulated comparison. The accumulation comparison of consecutive frames, as defined by the difference metric SD′p,q, is shown in graph 804. During a gradual transition, the difference value will normally increase. Further, the end frame (Fe) of the transition may be detected when the difference between consecutive frames decreases to less than Ts while the accumulated comparison has increased to a value larger than Tb.
Further, the accumulated comparison value is only computed when the difference between consecutive frames exceeds Ts. If the consecutive difference value drops below Ts before the accumulated comparison value exceeds Tb, then the potential starting point is dropped and the search continues for other gradual transitions. By being configured to detect the simultaneous satisfaction of two distinct threshold conditions, the twin-comparison method is configured detect gradual breaks between as well as ordinary breaks between shots.
In other embodiments, the shot parser 202 may parse the source video V into Ns shots based on the audio stream in the source video. The audio stream is the audio signals that correspond to the visual images of the source video. In order to parse the source video into shots, the shot parser 202 may be configured to first select for features that reflect optimal temporal and spectral characteristics of the audio stream. These optimal features may include: (1) features that are selected using melfrequency cepstral coefficients (MFCCs); and (2) perceptual features. These features may then be combined as one feature vector after normalization.
Before feature extraction, the shot parser 202 may convert the audio stream associated with the source video into a general format. For example, the shot parser 202 may convert the audio stream into an 8 KHz, 16-bit, mono-channel format. The converted audio stream may be pre-emphasized to equalize any inherent spectral tilt. In one implementation, the audio steam of the source video may then be further divided non-overlapping 25 ms-long frames for feature extraction.
Subsequently, the shot parser 202 may use eight-order MFCCs to select for some of the features of the video source audio stream. The MFCCs may be expressed as:




  
    
      
        
          
            c
            n
          
          =
          
            
              
                2
                K
              
            
            ⁢
            
              
                ∑
                
                  k
                  =
                  1
                
                K
              
              ⁢
              
                
                  (
                  
                    log
                    ⁢
                    
                      
                    
                    ⁢
                    
                      S
                      k
                    
                  
                  )
                
                ⁢
                
                  cos
                  ⁡
                  
                    [
                    
                      
                        n
                        ⁡
                        
                          (
                          
                            k
                            -
                            0.5
                          
                          )
                        
                      
                      ⁢
                      
                        π
                        /
                        K
                      
                    
                    ]
                  
                
              
            
          
        
        ⁢
        
          

        
        ⁢
        
          
            n
            =
            1
          
          ,
          2
          ,
          
            ...
            ⁢
            
              
            
            ⁢
            L
          
        
      
    
    
      
        (
        5
        )
      
    
  




where K is the number of band-pass filters, Sk is the Mel-weighted spectrum after passing k-th triangular band-pass filter, and L is the order of the cepstrum. Since eight-order MFCCs are implemented in the embodiment, L=8.

As described above, perceptual features may also reflect optimal temporal and spectral characteristics of the audio stream. These perceptual features may include: (1) zero crossing rates (ZCR); (2) short time energy (STE); (3) sub-band powers distribution; (4) brightness, bandwidth, spectrum flux (SF); (5) band periodicity (BP), and (6) noise frame ratio (NFR).
Zero-crossing rate (ZCR) can be especially suited for discriminating between speech and music. Specifically, speech signals typically are composed of alternating voiced sounds and unvoiced sounds in the syllable rate, while music signals usually do not have this kind of structure. Hence, the variation of zero-crossing rate for speech signals will generally be greater than that for music signals. ZCR is defined as the number of time-domain zero-crossings within a frame. In other words, the ZCR is a measurement of the frequency content of a signal:




  
    
      
        ZCR
        =
        
          
            1
            
              2
              ⁢
              
                (
                
                  N
                  -
                  1
                
                )
              
            
          
          ⁢
          
            
              ∑
              
                m
                =
                1
              
              
                N
                -
                1
              
            
            ⁢
            
              
              
                
                  sgn
                  ⁡
                  
                    [
                    
                      x
                      ⁡
                      
                        (
                        
                          m
                          +
                          1
                        
                        )
                      
                    
                    ]
                  
                
                -
                
                  sgn
                  ⁡
                  
                    [
                    
                      x
                      ⁡
                      
                        (
                        m
                        )
                      
                    
                    ]
                  
                
              
              
            
          
        
      
    
    
      
        (
        6
        )
      
    
  




where sgn[.] is a sign function and x(m) is the discrete audio signal, m=1 . . . N.

Likewise, Short Term Energy (STE) is the spectrum power of the audio signal associated with a particular frame in the source video. The shot parser 202 may use the STE algorithm to discriminate speech from music. STE may be expressed as:




  
    
      
        STE
        =
        
          log
          (
          
            
              ∫
              0
              
                w
                0
              
            
            ⁢
            
              
                
                  
                  
                    F
                    ⁡
                    
                      (
                      x
                      )
                    
                  
                  
                
                2
              
              ⁢
              
                d
                w
              
            
          
        
      
    
    
      
        (
        7
        )
      
    
  




where F(w) denotes the Fast Fourier Transform (FFT) coefficients, |F(w)|2 is the power at the frequency w, and w0 is the half sampling frequency. The frequency spectrum may be divided into four sub-bands with intervals





  
    [
    
      0
      ,
      
        
          w
          0
        
        8
      
    
    ]
  
  ,
  
    

  
  ⁢
  
    [
    
      
        
          w
          0
        
        8
      
      ,
      
        
          w
          0
        
        4
      
    
    ]
  
  ,
  
    

  
  ⁢
  
    [
    
      
        
          w
          0
        
        4
      
      ,
      
        
          w
          0
        
        2
      
    
    ]
  
  ,
  
    
      and
      ⁢
      
        

      
      [
      
        
          
            w
            0
          
          2
        
        ,
        
          w
          0
        
      
      ]
    
    .
  




Additionally, the ratio between sub-band power and total power in a frame is defined as:





  
    
      
        D
        =
        
          
            1
            STE
          
          ⁢
          
            
              ∫
              
                L
                j
              
              
                H
                j
              
            
            ⁢
            
              
                
                  
                  
                    F
                    ⁡
                    
                      (
                      w
                      )
                    
                  
                  
                
                2
              
              ⁢
              
                d
                w
              
            
          
        
      
    
    
      
        (
        8
        )
      
    
  




where Lj and Hj are lower and upper bound of sub-band j, respectively.

Brightness and bandwidth represent the frequency characteristics. Specifically, the brightness is the frequency centroid of the audio signal spectrum associated with a frame. Brightness can be defined as:




  
    
      
        
          w
          c
        
        =
        
          
            
              ∫
              0
              
                w
                0
              
            
            ⁢
            
              w
              ⁢
              
                
                  
                  
                    F
                    ⁡
                    
                      (
                      w
                      )
                    
                  
                  
                
                2
              
              ⁢
              
                d
                w
              
            
          
          
            
              ∫
              0
              
                w
                0
              
            
            ⁢
            
              
                
                  
                  
                    F
                    ⁡
                    
                      (
                      w
                      )
                    
                  
                  
                
                2
              
              ⁢
              
                d
                w
              
            
          
        
      
    
    
      
        (
        9
        )
      
    
  




Bandwidth is the square root of the power-weighted average of the squared difference between the spectral components and frequency centroid:




  
    
      
        B
        =
        
          
            
              
                ∫
                0
                
                  w
                  0
                
              
              ⁢
              
                
                  
                    (
                    
                      w
                      -
                      
                        w
                        c
                      
                    
                    )
                  
                  2
                
                ⁢
                
                  
                    
                    
                      F
                      ⁡
                      
                        (
                        w
                        )
                      
                    
                    
                  
                  2
                
                ⁢
                
                  d
                  w
                
              
            
            
              
                ∫
                0
                
                  w
                  0
                
              
              ⁢
              
                
                  
                    
                    
                      F
                      ⁡
                      
                        (
                        w
                        )
                      
                    
                    
                  
                  2
                
                ⁢
                
                  d
                  w
                
              
            
          
        
      
    
    
      
        (
        10
        )
      
    
  




Brightness and Bandwidth may be extracted for the audio signal associated with each frame in the source video. The shot parser 202 may then compute the means and standard deviation for the audio signals associated with all the frames in the source video. In turn, the means and standard deviation represent a perceptual feature of the source video.
Spectrum Flux (SF) is the average variation value of spectrum in the audio signals associated with two adjacent frames in a shot. In general, speech signals are composed of alternating voiced sounds and unvoiced sounds in a syllable rate, while music signals do not have this kind of structure. Hence, the SF of a speech signal is generally greater than the SF of a music signal. SF may be especially useful for discriminating some strong periodicity environment sounds, such as a tone signal, from music signals. SF may be expressed as:




  
    
      
        
          SF
          =
          
            
              1
              
                
                  (
                  
                    N
                    -
                    1
                  
                  )
                
                ⁢
                
                  (
                  
                    K
                    -
                    1
                  
                  )
                
              
            
            ×
            
              
                ∑
                
                  n
                  =
                  1
                
                
                  N
                  -
                  1
                
              
              ⁢
              
                
                  ∑
                  
                    k
                    =
                    1
                  
                  
                    K
                    -
                    1
                  
                
                ⁢
                
                  
                    [
                    
                      
                        log
                        ⁡
                        
                          (
                          
                            
                              A
                              ⁡
                              
                                (
                                
                                  n
                                  ,
                                  k
                                
                                )
                              
                            
                            +
                            δ
                          
                          )
                        
                      
                      -
                      
                        log
                        ⁡
                        
                          (
                          
                            
                              A
                              ⁡
                              
                                (
                                
                                  
                                    n
                                    -
                                    1
                                  
                                  ,
                                  k
                                
                                )
                              
                            
                            +
                            δ
                          
                          )
                        
                      
                    
                    ]
                  
                  2
                
              
            
          
        
        ⁢
        
          

        
        ⁢
        where
      
    
    
      
        (
        11
        )
      
    
  
  
    
      
        
          A
          ⁡
          
            (
            
              n
              ,
              k
            
            )
          
        
        =
        
          
          
            
              ∑
              
                m
                =
                
                  -
                  ∞
                
              
              ∞
            
            ⁢
            
              
                x
                ⁡
                
                  (
                  m
                  )
                
              
              ⁢
              
                w
                ⁡
                
                  (
                  
                    nL
                    -
                    m
                  
                  )
                
              
              ⁢
              
                e
                
                  
                    -
                    j
                  
                  ⁢
                  
                    
                  
                  ⁢
                  
                    
                      2
                      ⁢
                      π
                    
                    L
                  
                  ⁢
                  km
                
              
            
          
          
        
      
    
    
      
        (
        12
        )
      
    
  




and x(m) is the is the input discrete audio signal, w(m) the window function, L is the window length, K is the order of discrete Fourier transform (DFT), δ a very small value to avoid calculation overflow, and N is the total number of frames in source video.

Band periodicity (BP) is the periodicity of each sub-band. BP can be derived from sub-band correlation analysis. In general, music band periodicities are much higher than those of environment sound. Accordingly, band periodicity is an effective feature in music and environment sound discrimination. In one implementation, four sub-bands may be selected with intervals




  
    [
    
      0
      ,
      
        
          w
          0
        
        8
      
    
    ]
  
  ,
  
    

  
  ⁢
  
    [
    
      
        
          w
          0
        
        8
      
      ,
      
        
          w
          0
        
        4
      
    
    ]
  
  ,
  
    

  
  ⁢
  
    [
    
      
        
          w
          0
        
        4
      
      ,
      
        
          w
          0
        
        2
      
    
    ]
  
  ,
  
    
      and
      ⁢
      
        

      
      [
      
        
          
            w
            0
          
          2
        
        ,
        
          w
          0
        
      
      ]
    
    .
  




The periodicity property of each sub-band is represented by the maximum local peak of the normalized correlation function. For example, the BP of a sine wave may be represented by 1, and the BP for white noise may be represented by 0. The normalized correlation function is calculated from a current frame and a previous frame:





  
    
      
        
          r
          
            i
            ,
            j
          
        
        =
        
          
            
              ∑
              
                m
                =
                0
              
              
                M
                -
                1
              
            
            ⁢
            
              
                
                  s
                  i
                
                ⁡
                
                  (
                  
                    m
                    -
                    k
                  
                  )
                
              
              ⁢
              
                
                  s
                  i
                
                ⁡
                
                  (
                  m
                  )
                
              
            
          
          
            
              
                
                  ∑
                  
                    m
                    =
                    0
                  
                  
                    M
                    -
                    1
                  
                
                ⁢
                
                  
                    s
                    i
                    2
                  
                  ⁡
                  
                    (
                    
                      m
                      -
                      k
                    
                    )
                  
                
              
            
            ⁢
            
              
                
                  ∑
                  
                    m
                    =
                    0
                  
                  
                    M
                    -
                    1
                  
                
                ⁢
                
                  
                    s
                    i
                    2
                  
                  ⁡
                  
                    (
                    m
                    )
                  
                
              
            
          
        
      
    
    
      
        (
        13
        )
      
    
  




where ri,j(k) is the normalized correlation function; i is the band index, and j is the frame index. si(n) is the i-th sub-band digital signal of current frame and previous frame, when n<0, the data is from the previous frame. Otherwise, the data is from the current frame. M is the total length of a frame.

Accordingly, the maximum local peak may be denoted as ri,j(kp), where kp is the index of the maximum local peak. In other words, ri,j(kp) is the band periodicity of the i-th sub-band of the j-th frame. Thus, the band periodicity may be calculated as:




  
    
      
        
          
            bp
            i
          
          =
          
            
              
                1
                N
              
              ⁢
              
                
                  ∑
                  
                    j
                    =
                    1
                  
                  N
                
                ⁢
                
                  
                    
                      r
                      
                        i
                        .
                        j
                      
                    
                    ⁡
                    
                      (
                      
                        k
                        p
                      
                      )
                    
                  
                  ⁢
                  i
                
              
            
            =
            1
          
        
        ,
        ...
        ⁢
        
          
        
        ,
        4
      
    
    
      
        (
        14
        )
      
    
  




where bpi is the band periodicity of i-th sub-band, N is the total number of frames in the source video.

The shot parser 202 may use noise frame ratio (NFR) to discriminate environment sound from music and speech, as well as discriminate noisy speech from pure speech and music more accurately. NFR is defined as the ratio of noise frames to non-noise frames in a given shot. A frame is considered as a noise frame if the maximum local peak of its normalized correlation function is lower than a pre-set threshold. In general, the NFR value of noise-like environment sound is higher than that for music, because there are much more noise frames.
Finally, shot parser 202 may concatenated the MFCC features and the perceptual features into a combined vector. In order to do so, shot parser 202 may normalize each feature to make their scale similar. The normalization is processed as x′i=(xi−μi)/σi, where xi is the i-th feature component. The corresponding mean and standard derivation σi can also be calculated. The normalized feature vector is the final representation of the audio stream of the source video.
Once the shot parser 202 has determined a final representation of the audio stream of the video source, the shot parser 202 may be configured to employ support vectors machines (SVMs) to segment the source video into shots based on the final representation of the audio stream of the source video. Support vector machines (SVMs) are a set of related supervised learning methods used for classification.
In one implementation, the audio stream of the source video may into classified into five classes. These classes may include: (1) silence, music, (2) background sound, (3) pure speech, and (4) non-pure speech. In turn, non-pure speech may include (1) speech with music, and (2) speech with noise. Initially, the shot parser 202 may classify the audio stream into silent and non-silent segments depending on the energy and zero-crossing rate information. For example, a portion of the audio stream may be marked as silence if the energy and zero-crossing rate is less than a predefined threshold.
Subsequently, a kernel SVM with a Gaussian Radial Basis function may be used to further classify the non-silent portions of the audio stream in a binary tree process. The kernel SVM may be derived from a hyper-plane classifier, which is represented by the equation:




  
    
      
        
          f
          ⁡
          
            (
            x
            )
          
        
        =
        
          sgn
          (
          
            
              
                ∑
                
                  i
                  =
                  1
                
              
              ⁢
              
                
                  
                    α
                    i
                  
                  _
                
                ⁢
                
                  y
                  i
                
                ⁢
                
                  x
                  i
                
                ⁢
                x
              
            
            +
            
              b
              _
            
          
          )
        
      
    
    
      
        (
        15
        )
      
    
  




where α and b are parameters for the classifier, and the solution vector xi is called as the Supper Vector with αi being non-zero. The kernel SVM is obtained by replacing the inner product x·y by a kernel function K(x,y), and then constructing an optimal separating hyper-plane in a mapped space. Accordingly, the kernel SVM may be represented as:





  
    
      
        
          f
          ⁡
          
            (
            x
            )
          
        
        =
        
          sgn
          (
          
            
              
                ∑
                
                  i
                  =
                  1
                
                l
              
              ⁢
              
                
                  
                    α
                    i
                  
                  _
                
                ⁢
                
                  y
                  i
                
                ⁢
                
                  K
                  ⁡
                  
                    (
                    
                      
                        x
                        i
                      
                      ,
                      x
                    
                    )
                  
                
              
            
            +
            
              b
              _
            
          
          )
        
      
    
    
      
        (
        16
        )
      
    
  




Moreover, the Gaussian Radial Basis function may be added to the kernel SVM by the equation





  
    K
    ⁡
    
      (
      
        x
        ,
        y
      
      )
    
  
  =
  
    exp
    -
    
      
        
          
            
            
              x
              -
              y
            
            
          
          2
        
        
          2
          ⁢
          
            σ
            2
          
        
      
      .
    
  




According to various embodiments, the use of the kernel SVMs with the Gaussian Radial Basis function to segment the audio stream, and thus the video source corresponding to the audio stream into shots, may be carried out in several steps. First, the video stream is classified into speech and non-speech segments by a kernel SVM. Then, the non-speech segment may be further classified into shots that contain music and background sound by a second kernel SVM. Likewise, the speech segment may be further classified into pure speech and non-pure speech shots by a third kernel SVM.
It will be appreciated that while some methods for detecting breaks between shots in a video source has been illustrated and described, the boundary determination engine 204 may carry out the detection of breaks using other methods. Accordingly, the exemplary methods discussed above are intended to be illustrative rather than limiting.
Once the source video V is parsed into Ns shots using one of the methods described above, si may be used to denote the i-th shot in V. Accordingly, V={si}, wherein i=1, . . . , Ns. As a result, the total number of candidate insertion points may be represented by (Ns+1). The relationships between candidate insertion points and the parsed shots are illustrated in FIG. 9.
FIG. 9 illustrates the proximity of the video advertisement insertion points to the parsed shots SNs in the source video V. As shown, the insertion points 902-910 are distributed between the shots 912-918. According to various embodiments, the candidate insertion potions correspond to shot breaks between the shots.
At block 404, the discontinuity analyzer 208 of the boundary analyzer 206 may determine the overall discontinuity of each shot in the source video. Specifically, in some embodiments, the overall discontinuity of the each shot may include a “content discontinuity.” Content discontinuity measures the visual and or audile perception-based discontinuity, and may be obtained using a best first model merging (BFMM) method.
Specifically, given the set of shots {si} (i=1, . . . , Ns) in a source video, the discontinuity analyzer 208 may use a best first model merging (BFMM) method to merge the shots into a video sequence. As described above, the shots may be obtained based on parsing a source video based on the visual details of the source video. Alternatively, the shots may be obtained by segmentation of the source video based on the audio stream that corresponds to the source video. Accordingly, the best first model merging (BFMM) may be used merge the shots in sequence based on factors such as color similarity between shots, audio similarity between shots, or a combination of these factors.
The merging of the shots may be treated as an ordered clustering of a group of consecutive time constrained shots. In one implementation, the shots of the video source may be regarded as a hidden state variable. Accordingly, the clustering problem may then involve the looping of boundaries between shots as the probabilistic of transition to the next states. According to various embodiments, probabilistic clustering may be used to carry out BFMM. Probabilistic clustering creates a conditional density model of the data, where the probability of generating a shot depends conditionally upon the cluster membership of the shot. In such an instance, the clustering metric is the likelihood of the data being generated by the model. In other words, BFMM is based on a formulation of maximum likelihood.
As shown in FIG. 10, the probabilistic model used may be a Left-Right Hidden Markov Model (HMM) 1000. Membership in the video sequence is a hidden state variable. For every state, there is a generative model for shots in that state. This generative model is content based. This means that a probability of generating the data of the shot, such as one of the shots 902-906, is conditioned on the state. In addition, for every state, there is a probability of transitioning to the next state when presented with a new shot.
BFMM may be initiated with every shot having its own model. Merging a pair of adjacent models causes a loss of data likelihood, because one combined model is more general and cannot fit the data as well as two individual models. For example, if Lx is the log likelihood of all of the images assigned to a shot x given an associated model of x, and if shot x and y are being merged to form video sequence z, then the change in likelihood associated with the merging is:

ΔL=Lz−Lx−Ly  (17)

At each merging step, the Best-First Model Merging algorithm may selectively merge the two adjacent shots with the most similarity, so that the merge causes the least loss of data likelihood. Additionally, a merging order may be assigned to the boundary between the two merged shots. This merging step may be repeated until all the shots in V are merged into one video sequence.
In this way, if P={pi} (i=2, . . . , Ns) denote the set of inserting points, a merging order for each shot break pi (i=2, . . . , Ns−1) may be obtained. Moreover, the content discontinuity Dc for each shot break pi may be further calculated. For example, if the shots s1 and si+1 are merged in the k step, then Pi=k and the content discontinuity Dc may be given as Dc(pi)=k/(Ns+1).
An exemplary pseudo code for the determination of content discontinuity, which may be carried out by the discontinuity analyzer 208, is given below:












  Input: S={si} i=1, ..., Ns, P={pj} j=1, ..., Ns+1


  Output: D={Dc(pj)} j=1, ..., Ns+1


1.   Initialize


  set Dc(pNs+1) = 1.00, Dc(p1) = 0.99


2.   Preprocess


  for σ=1 to 4 do


  Compute similarity Sim(si, si+σ) for each pair with scale σ


  if Sim(si, si+σ)<Ts do


  Merge {sk} (k=i+1, ..., i+σ) to si and Remove {sk} (k=i+1, ..., i+σ)


  from S


  {Dc(pk)}(k= i+1, ..., i+σ)=0


  Ns = Ns − (σ−1)


  end if


  end for


3.   BFMM


  set merging order Nm=1


  while Ns>0 do


  Compute Sim(·) for adjacent shots and get the closest pair (si, si+1)


  Merge si+1 to si and Remove si+1 from S


  Dc(pi+1) = Nm


  Nm ++, Ns −−


  end while


4.   Normalize


  for j=2 to Ns do


  Dc(pj) = Dc(pj) / Nm


  end for









In other embodiments, the overall discontinuity of the each shot, in addition to “content discontinuity” may include “semantic discontinuity.” Semantic discontinuity may be derived using concept detectors that are based on Support Vector Machines (SVM). Support vector machines (SVMs) are a set of related supervised learning methods used for classification. Each of the concept detectors is configured to detect a particular attribute of a shot. For instance, the discontinuity analyzer 208 may include concept detectors that may be configured to detect various attributes. These attributes may include whether the shot is an indoor shot, whether the shot shows an urban scene, whether the shot depicts a person, whether the shot depicts a water body, etc. In other instances, the discontinuity analyzer 208 may also include concept detectors that are used to detect attributes such as camera motions. These camera motions may include affine motions such as static, pan, tilt, zoom, rotation, as well as object motions. Nevertheless, it will be appreciated that the discontinuity analyzer 208 may include additional concept detectors that are configured to detect other attributes of the shots, including other types of motions.
In these embodiments, each concept detector may be further configured to output a confidence score for a shot. The confidence score indicates the degrees of correlation between the shot and the corresponding attribute detected by the concept detector. Accordingly, for each shot, the plurality of confidence scores may be composed into a multi-dimensional vector. The semantic discontinuity for each shot break, Ds(pi) may then be calculated by the distance, that is, difference, between two multi-dimensional vectors adjacent the an insertion point pi 
Accordingly, “content discontinuity” and “semantic discontinuity” may be calculated for two types of shots breaks. In one instance, “content discontinuity” and “semantic discontinuity” may be calculated for shot breaks belonging to shots that were parsed using visual details of the source video (visual shot boundaries). In another instance, “content discontinuity” and “semantic discontinuity” may be calculated for shot breaks belonging to shots that were parsed using the audio stream of the source video (audio shot boundaries).
Moreover, in embodiments where the overall discontinuity includes both “content discontinuity” and “semantic discontinuity”, an overall discontinuity, D(pi), may be calculated as the average of “content discontinuity”, Dc(pi), and “semantic discontinuity,” Ds(pi) In additional embodiments, the overall discontinuity, D(pi), may be calculated as the sum of weighted of “content discontinuity”, Dc(pi), and “semantic discontinuity,” Ds(pi), as shown by the equation:

D(pi)=λDc(pi)+(1−λ)Ds(pi)  (18)

wherein λ is a number between 0 and 1.

At block 406, the attractiveness analyze 210 of the boundary analyzer 206 may determine the attractiveness of each shot in the video source. In one embodiment, attractive of each shot may be based on an estimate of the degree which the content of the shot will attract viewer attention. In other words, the ability of a particular shot to attract viewer attention may be used as an approximation of attractiveness.
According to various implementations, a shot in the video source may be considered to be a compound of image sequence, audio track, and textural information. The image sequences in the shot may present motion (object motion and camera motion), color, texture, shape, and text. The audio channels may consist of speech, music, and various sound effects. Textural information in linguistic form may be obtained from sources such as closed captioning, automatic speech recognition (ASR), and superimposed text.
FIG. 5 shows a process 500 that gauges viewer attention. At block 502, the attractiveness analyze 210 may analyze a shot to extract content features. For example, the shot may be broke down into visual elements, aural elements, and linguistic elements. At block 504, the attractiveness analyze 210 may use a set of attention models to generate separate attention curves for the elements.
For instance, attention to visual elements may be modeled by several attention models. These models may include a motion attention model, a static attention model, a semantic attention model (face attention model), and a guided attention model (camera motion model). FIG. 6 further illustrates block 504 of the process 500 by depicting the use of these models.
FIG. 6 shows an exemplary process 600 for using the various attention models. At block 602, the motion attention model may be implemented by the attractiveness analyze 210. In the motion attention model, motion attention is estimated based on a motion vector field (MVF). A MVF can be obtained by block-based motion estimation. In other words, for a given frame in a shot, the motion field between the frame and the next frame may be extracted and calculated as a set of motion characteristics. In one implementation, when the shot is stored in MPEG format, the MVFs may be extracted from the MPEG data directly.
A MVF may have three inductors: intensity inductor, spatial coherence inductor, and temporal coherence inductor. When motion vectors in the MVFs pass these inductors, they may be transformed into three kinds of visual maps. The visual maps may include intensity map, spatial coherence map, and temporal coherence map, respectively. The normalized outputs from the three inductors are fused into a saliency map. The saliency map may indicate spatial-temporal distribution of motion attentions.
The MVF may include macro blocks, each macro block may correspond to the three inductors describe above. The intensity inductor at each macro block induces motion energy or activity, which may be represented by motion intensity I. Specifically, given a MVF with M*N macro blocks, the motion intensity at each macro block MBi,j,(0≦i≦M, 0≦i≦N) may be computed as the magnitude of motion vectors:

I(i,j)=√{square root over (dx2i,j+dy2i,j)}/MaxMag  (19)

where (dxi,j, dyi,j), denote two components of motion vector along the x-axis and y-axis, respectively, and where MaxMag is the normalization vector.

The spatial coherence inductor induces the spatial phase consistency of motion vectors. The regions with consistent motion vectors are most likely within a moving object. In contrast, the motion vectors with inconsistent phase are often located at object boundaries. Spatial coherency may be measured using an entropy based method. First, a phase histogram in a spatial window with the size of w*w (pixels) may be computed at each location of a macro block. Then, the coherence of phase distribution, Cs, may be measured by entropy:




  
    
      
        
          Cs
          ⁡
          
            (
            
              i
              .
              j
            
            )
          
        
        =
        
          -
          
            
              ∑
              
                t
                =
                1
              
              n
            
            ⁢
            
              
                
                  p
                  s
                
                ⁡
                
                  (
                  t
                  )
                
              
              ⁢
              
                Log
                ⁡
                
                  (
                  
                    
                      p
                      s
                    
                    ⁡
                    
                      (
                      t
                      )
                    
                  
                  )
                
              
            
          
        
      
    
    
      
        (
        20
        )
      
    
  
  
    
      
        
          
            P
            s
          
          ⁡
          
            (
            t
            )
          
        
        =
        
          
            
              SH
              
                i
                .
                j
              
              w
            
            ⁡
            
              (
              t
              )
            
          
          
            
              ∑
              
                k
                =
                1
              
              n
            
            ⁢
            
              
                SH
                
                  i
                  .
                  j
                
                w
              
              ⁡
              
                (
                k
                )
              
            
          
        
      
    
    
      
        (
        21
        )
      
    
  




where SHi,jw(t) is a spatial phase histogram and the corresponding probability distribution function of spatial phase is ps(t), and n is the number of histogram bins.

Similar to the spatial coherence inductor, temporal coherency, Ct, or the output of a temporal coherence inductor, may be defined in a sliding window with the size of L (frames) as follows:




  
    
      
        
          Ct
          ⁡
          
            (
            
              i
              .
              j
            
            )
          
        
        =
        
          -
          
            
              ∑
              
                t
                =
                1
              
              n
            
            ⁢
            
              
                
                  p
                  t
                
                ⁡
                
                  (
                  t
                  )
                
              
              ⁢
              
                Log
                ⁡
                
                  (
                  
                    
                      p
                      t
                    
                    ⁡
                    
                      (
                      t
                      )
                    
                  
                  )
                
              
            
          
        
      
    
    
      
        (
        22
        )
      
    
  
  
    
      
        
          
            P
            t
          
          ⁡
          
            (
            t
            )
          
        
        =
        
          
            
              TH
              
                i
                .
                j
              
              L
            
            ⁡
            
              (
              t
              )
            
          
          
            
              ∑
              
                k
                =
                1
              
              n
            
            ⁢
            
              
                TH
                
                  i
                  .
                  j
                
                L
              
              ⁡
              
                (
                k
                )
              
            
          
        
      
    
    
      
        (
        23
        )
      
    
  




where THi,jL(t) is a temporal phase histogram and the corresponding probability distribution function of temporal phase is pt(t), and n is the number of histogram bins.

In this manner, motion information from the three inductors I, Cs, and Ct may be obtained. The outputs from the three inductors I, Cs, and Ct can be used to characterize the dynamic spatial-temporal attribute of motion. Accordingly, motion attention may be defined as follows:

B=I×Ct×(1−I×Cs)  (24)

Moreover, by using this equation, the outputs from I, Cs, and Ct inductors may be integrated into a motion saliency map, in which areas with attention-attracting motion may be precisely identified.
For instance, additional image processing procedures may be employed to detect the salient motion regions. These additional image processing procedures may include Histogram Balance, Median Filtering, Binarization, Region Growing, and Region selection. Once motion detection is complete, a motion attention model may be calculated by accumulating the brightness of the detected motion regions in a saliency map as follows:




  
    
      
        
          M
          motion
        
        =
        
          
            
              ∑
              
                r
                ∈
                Λ
              
            
            ⁢
            
              
                ∑
                
                  q
                  ∈
                  
                    Ω
                    r
                  
                
              
              ⁢
              
                B
                q
              
            
          
          
            N
            MB
          
        
      
    
    
      
        (
        25
        )
      
    
  




wherein Bq is the brightness of a macro block in the saliency map, Λ is the set of attention-attracting areas caused by motion activities, Ωr denotes the set of macro blocks in each attention area, and NMB is the number of macro blocks in a MVF that is used for normalization. The motion attention value of each frame in the shot, Mmotion, may be used to form a continuous attention curve as a function of time.

At block 604, the attractiveness analyze 210 may implement the static attention model. The static attention model measures the ability of static region of images to attract view attention. According to various embodiments, the static attention model may be based on a contrast-based saliency map. This is because contrast is an important parameter in assessing vision. Whether an object can be perceived or not depends on the distinctiveness between itself and environment. Consequently, the contrast-based saliency map may be based on a generic contrast definition. For example, given an image with M*N pixels or blocks, the contrast value at a pixel or block is defined as follows:




  
    
      
        
          C
          
            i
            ,
            j
          
        
        =
        
          
            ∑
            
              q
              ∈
              Θ
            
          
          ⁢
          
            d
            ⁡
            
              (
              
                
                  P
                  
                    i
                    ,
                    j
                  
                
                ,
                q
              
              )
            
          
        
      
    
    
      
        (
        26
        )
      
    
  




where pi,j (iε[0,M], jε[0, N]) and q are representations of appearance at pixel/block (i,j) appearance at pixel/block, such as color. Θ is the neighborhood of pi,j and its size is able to control the sensitivity of the contrast measure. Moreover, d is the difference between pi,j and q, which may be any distance measurement required by different requirements. If all contrasts Ci,j are normalized, a saliency map may be formed. Such contrast-based saliency map may represent color, texture, and approximate shape information simultaneously.

Once a saliency map is developed, it may be further processed to show attention-attracting areas as bright areas on a gray-level map. The size, position, and the brightness of the attention-attracting areas in the gray saliency map indicate the degree of viewer attention they attract. Accordingly, a static attention model is computed based on the number of the attention-attracting areas as well as the brightness, area, and position of the attention-attracting areas:




  
    
      
        
          M
          static
        
        =
        
          
            1
            
              A
              frame
            
          
          ⁢
          
            
              ∑
              
                K
                =
                1
              
              N
            
            ⁢
            
              
                ∑
                
                  
                    (
                    
                      i
                      ,
                      j
                    
                    )
                  
                  ∈
                  
                    R
                    k
                  
                
              
              ⁢
              
                
                  B
                  
                    i
                    ,
                    j
                  
                
                ·
                
                  w
                  pos
                  
                    i
                    ,
                    j
                  
                
              
            
          
        
      
    
    
      
        (
        27
        )
      
    
  




where Bi,j denotes the brightness of the pixels in the attention-attracting area Rk, N denotes the number of the attention-attracting area, Aframe is the area of the frame, and wposi,j is a normalized Gaussian template with the center located at the center of the frame. Since viewers usually pay more attention to the areas near to frame center, this normalized Gaussian template assigns a weight to each pixel or block in this region. The static attention value of each frame in the shot, Mstatic, may then be used to form a continuous attention curve as a function of time.

At block 606, the attractiveness analyze 210 may implement the face attention model. The face attention model may be employed to assess the attention-attracting ability of faces in a shot. The appearances of dominant faces in a video usually attract viewer attention. In other words, the position and size of a face in a shot reflects importance of the face. Correspondingly, the position and size of a face also reflects the importance of the frame containing the face. Thus, face attention may be modeled as:




  
    
      
        
          M
          face
        
        =
        
          
            ∑
            
              K
              =
              1
            
            N
          
          ⁢
          
            
              
                A
                k
              
              
                A
                frame
              
            
            ×
            
              
                w
                posi
                i
              
              8
            
          
        
      
    
    
      
        (
        28
        )
      
    
  




wherein Ak denotes the size of Kth face, Aframe denote the area of the frame, wposi is the weight of a position as shown in FIG. 6, and iε[0,8] is the index of the position.

At block 608, the attractiveness analyze 210 may implement the camera attention model. The camera motion model may be configured to transform camera motion variation, including motion type, direction and velocity into an attention curve. For example, camera motion may be classified into the following types: (1) panning and tilting, or camera rotation around the x-axis and y-axis; (2) rolling, resulting from camera rotations around a z-axis; (3) tracking and booming, resulting from camera displacement along the x-axis and the y-axis; (4) dollying, resulting from camera displacement along the z-axis; (5) zooming, resulting from focus adjustment, and (6) stills.
According to various embodiments, the attention values caused by the above described camera motions are quantified to the range of [0 ̃2]. An attention value higher than “1” means emphasis, and an attention value smaller than “1” indicates neglect. An attention value that is equal to “1” indicates that the camera did not intend to attract the viewer's attention.
In some embodiments, camera attention may be modeled based on the following assumptions: (1) zooming and dollying are always used for emphasis. Specifically, the faster the zooming/dollying speed, the more important the focused content; (2) horizontal panning indicates neglect; (3) other camera motions have no obvious intention; and (4) if the camera motion changes too frequently, the motion is considered random or unstable. Accordingly, camera motions other than zooming, dollying, and horizontal panning, as well as rapid camera motion changes, may be assigned a value of “1”.
FIG. 11 illustrates exemplary models of camera motion. Specifically, graph 1002 shows zooming. As shown in graph 1102, the attention degree is assigned to “1” when zooming is started, and the attention degree of the end part of the zooming is a direct ratio of the speed of zooming Vz. As shown in graph 1104, if a camera becomes still after a zooming, the attention degree at the end of the zooming will continue for a certain period of time tk, and then return to “1”.
Additionally, the attention degree of panning is determined by two aspects; the speed Vp and the direction γ. Thus, the attention degree may be modeled as the product of the inverse speed and the quantization function of direction, as shown in graph 1106. Further, as shown in graph 1108, the motion direction γε[0 ̃π/2] may be mapped to [0 ̃2] by a subsection function. Specifically, 0 is assigned to the direction γ=π/4, 1 is assigned to γ=0, and 2 is assigned to the direction γ=π/2. Thus, the first section is monotonously decreasing while the second section is monotonously increasing.
Graph 1110 shows panning followed by still. In such a scenario, the attention degree may continue for a certain period of time tk, after panning has transitioned into zooming. Moreover, the attention degree will be an inverse ratio to the speed of panning Vp. Other models of the relationship between camera motion and attention degree are further illustrated in FIG. 11. For example, graph 1112 shows still and other types of camera motion, graph 1114 shows zooming followed by panning, graph 1116 shows panning followed by zooming, and graph 1118 shows still followed by zooming.
Audio attention is an important parts of the overall attention model frame work 400. For example, speech and music are semantically meaningful for human beings. Loud and sudden noises also tend to grab attention. Accordingly, the definition of audio attention may include three audio attention models. These models include an audio saliency attention model, a speech attention model, and a music attention model. According to various embodiments, these models may be implemented by the attractiveness analyze 210. FIG. 7 further illustrates block 406 of the process 400 by depicting the use of these audio attention models.
FIG. 7 illustrates an exemplary process 700 for using the various attention models. At block 702, the attractiveness analyze 210 may implement the audio saliency attention model. The audio saliency attention model may correlate audience attention with the amount of sound energy, or loudness of the sound. For example, viewers are often attracted to loud or sudden sounds. In various implementations, it is assumed that an individual may pay attention to a sound if: (1) an absolute loud sound, as measured by average energy of the sound, occurs; and (2) the sudden increase or decrease of a sound occurs, as measured by the average energy of the sound. Consequently, the aural saliency model is computed by:

Mas=Ēa·Ēp  (29)

where Ēa and Ēp are the two components of audio saliency: normalized average energy and normalized energy peak in an audio segment. They are calculated as follows, respectively:





  
    
      
        
          
            E
            _
          
          a
        
        =
        
          
            
              
                E
                _
              
              avr
            
            /
            Max
          
          ⁢
          
            
          
          ⁢
          
            E
            avr
          
        
      
    
    
      
        (
        30
        )
      
    
  
  
    
      
        
          
            E
            _
          
          a
        
        =
        
          
            
              
                E
                _
              
              peak
            
            /
            Max
          
          ⁢
          
            
          
          ⁢
          
            E
            peak
          
        
      
    
    
      
        (
        31
        )
      
    
  




where Eavr and Epeak denote the denote the average energy and energy peak of an audio segment, respectively. MaxEavr and MaxEpeak are the maximum average energy and energy peak of an entire audio segment corps. In particular embodiments, a sliding window may be used to compute audio saliency along an audio segment.

At block 704, the attractiveness analyze 210 may implement the speech and music attention models. The speech and music attention models may be used to correlate audience attention with speech and music. In general, audience usually pays more attention shots that are accompanied by speech/music. Accordingly, the saliency of speech/music is measured by the ratio of speech/music to other sounds. In one implementation, an audio segment accompanying a shot may be divided into sub segments. Feature may then be extracted from the sub segments. The features may include mel-frequency cepstral coefficients (MFCCs) and a number of perceptual features, such as short time energy (STE), zero crossing rates (ZCR), sub-band powers distribution, brightness, bandwidth, spectrum flux (SF), and band periodicity (BP). A support vector machine (SVC) may be employed to classify each audio sub segment into speech, music, silence, and other audio components. In this manner, speech ratio and music ratio may be computed as:




  
    
      
        
          M
          speech
        
        =
        
          
            N
            speech
            w
          
          /
          
            N
            total
            w
          
        
      
    
    
      
        (
        32
        )
      
    
  
  
    
      
        
          M
          music
        
        =
        
          
            N
            music
            w
          
          /
          
            N
            total
            w
          
        
      
    
    
      
        (
        33
        )
      
    
  




where Nspeechw, Nmusicw, and Ntotalw are the number of speech sub segments, music sub segments, and total sub segments in a sliding window w, respectively. Once block 704 is completed, the process 700 may return to block 508 of the process 500.

At block 508, the attractiveness analyze 210 may fuse the various visual and aural models into a final attention curve. The final attention curve may represent the attractiveness of a shot. According to various embodiments, the fusion of curves from the various attention models may be carried as a linear combination or a nonlinear combination.
In the linear fusion scheme, the curves from the various models may be first normalized. Subsequently, linear fusion may be implemented according to the following:

A=wv· Mv+wa· Ma+wl· Ml  (34)

wherein wv, wa, wl≧0 (wv+wa+wl=1) are the weights for linear combination, and Mv, Ma, and Ml are normalize visual, aural, and linguistic attention models, respectively. Mv, Ma, and Ml may be computed as:





  
    
      
        
          M
          v
        
        =
        
          
            (
            
              
                ∑
                
                  i
                  =
                  1
                
                p
              
              ⁢
              
                
                  w
                  i
                
                ·
                
                  
                    M
                    _
                  
                  i
                
              
            
            )
          
          ×
          
            
              (
              
                
                  M
                  _
                
                cm
              
              )
            
            
              S
              cm
            
          
        
      
    
    
      
        (
        35
        )
      
    
  
  
    
      
        
          M
          a
        
        =
        
          
            (
            
              
                ∑
                
                  j
                  =
                  1
                
                q
              
              ⁢
              
                
                  w
                  j
                
                ·
                
                  
                    M
                    _
                  
                  j
                
              
            
            )
          
          ×
          
            
              (
              
                
                  M
                  _
                
                as
              
              )
            
            
              S
              as
            
          
        
      
    
    
      
        (
        36
        )
      
    
  
  
    
      
        
          M
          i
        
        =
        
          (
          
            
              ∑
              
                K
                =
                1
              
              r
            
            ⁢
            
              
                w
                k
              
              ·
              
                
                  M
                  _
                
                k
              
            
          
          )
        
      
    
    
      
        (
        37
        )
      
    
  




where wi, wj, and wk are internal linear combination weights in visual, aural, and linguistic attention models, respectively, with the constraints of wi≧0, wj≧0, wk≧0, and





  
    
      
        ∑
        
          j
          =
          1
        
        q
      
      ⁢
      
        w
        j
      
    
    =
    1
  
  ,
  
    
      
        ∑
        
          k
          =
          1
        
        r
      
      ⁢
      
        w
        k
      
    
    =
    1.
  




Further, Mv, Mv, and Mv denote the normalized visual, aural and linguistic attention models, respectively. Mcm is the normalized camera motion model that is used as a magnifier in visual attention model. Scm works as the switch for this magnifier. If Scm≧1, the magnifier is turned on. Otherwise, Scm<1 means that the magnifier is turned off. The higher the value of Scm, the more evident the effects of magnifier are. Similarly, Mas is the normalized aural saliency model and used as a magnifier for the aural attention models. Sas may act as a switch for aural saliency. As magnifiers, Sas and Scm are all normalized to [0 ̃2]. In this manner, users may adjust the weights in equations 14-17 according to their preferences or application scenarios.

The nonlinear fusion scheme may be especially suitable for situations where one or more attention components may have relatively high attention values, but other attention components have very low values. For example, a shot with high motion attention but very low aural attention.
On the other hand, the nonlinear fusion scheme is a monotone increasing function. Specifically, if n is the number of features in a shot, the feature vector may be denoted by {right arrow over (x)}=(x1, x2, . . . xn), where 0≦xi≦1, 1≦i≦n, and the fusion function be denoted by f(x) or f(x1, x2, . . . xn), the nonlinear fusion scheme should satisfy two criteria (equation 38) and (equation 39) for the case of n=2:

f(x1,x2)<f(x1+ε,x2−ε)  (38)

where 0<ε≦x2≦x1, and

f(x1,x2)<f(x1+ε,x2)  (39)

where 0<ε.

Accordingly, a multi-dimensional Attention Fusion Function (AFF) may be obtained using:




  
    
      
        
          A
          ⁢
          
            
          
          ⁢
          F
          ⁢
          
            
          
          ⁢
          
            
              F
              n
              
                (
                γ
                )
              
            
            ⁡
            
              (
              
                x
                ⇀
              
              )
            
          
        
        =
        
          
            E
            ⁡
            
              (
              
                x
                ⇀
              
              )
            
          
          +
          
            
              1
              
                
                  2
                  ⁢
                  
                    (
                    
                      n
                      -
                      1
                    
                    )
                  
                
                +
                
                  n
                  ⁢
                  
                    
                  
                  ⁢
                  γ
                
              
            
            ⁢
            
              
                ∑
                
                  K
                  =
                  1
                
                n
              
              ⁢
              
                
                
                  
                    x
                    k
                  
                  -
                  
                    E
                    ⁡
                    
                      (
                      
                        x
                        ⇀
                      
                      )
                    
                  
                
                
              
            
          
        
      
    
    
      
        (
        40
        )
      
    
  




where γ>0 is a constant, and E({right arrow over (x)}) is the mean of feature vector ({right arrow over (x)}), and wherein the following inequalities (41) and (42) are satisfied:

AFFn(γ)(x1, . . . , xi, . . . , xn)<AFFn(γ)(x1, . . . xi+ε, . . . , xn)  (41)

where 1≦i≦n, ε≧n, and

AFFn(γ)(x1, . . . , xi, . . . , xj, . . . , xn)≦AFFn(γ)(x1, . . . , xi+ε, . . . , xj−ε, . . . , xn)  (42)

where 1≦i<j≦n, xi≧xj≧e>0.

At block 510, once an attention curve have been obtained using one of the linear and nonlinear fusion schemes, the attractiveness analyze 210 may extract the key frames and video segments from around the crests of the curve. According to the definition of the user attention model, the crests on the attention curve generally indicate the corresponding key frame or segment that is most likely to attract viewer attention. Moreover, a derivative curve may be generated based on attention to determine the precise position of the crests. The zero-crossing points from positive to negative on the derivative curve are the location of wave crests. Based on the wave crests, a multi-scale static abstraction may be generated to rank the key frames according to the attention value of each frame.
In some implementations, shots in a video source may be further ranked according to the key frames. For example, key frames between two shot boundaries may be used as representative frames of a shot. In such an example, the combined values of the key frames may be used to rank the shot. Additionally, in cases where there is no crest in a shot, the middle frame is chosen as the key frame, and the important value of this shot is assigned to zero.
In other instances, each shot in a video source may include only one key frame. In such instances, the ranking of each shot may be based on the attention value of the key frame. Moreover, if the total number of key frames present, as indicated by the crests, is more than the number of shots in a video, shots with lower importance values will be ignored. Once the attention value for each shot in the video source has been obtained, the process 500 may return to block 406.
At block 406, the attractiveness analyze 210 may ascertain the attractiveness A(pi), by computing the linear combination of attractiveness degrees from two adjacent shots besides a shot boundary pi as follows:

A(pi)=λ×A(si)+(1−λ)×A(si+1)  (43)

where λ is between 0 and 1.

At block 408, the insertion point generator 212 may determine the video advertisement insertion points based on the discontinuity and attractiveness of the shot boundary pi (i=2, . . . N). In embodiments where the shot boundaries include both visual shot boundaries and the audio shot boundaries, the insertion point generator 212 may first linearly combine the discontinuities of the visual and audio shot boundaries. In other embodiments, the insertion point generator 212 may directly detect the video advertisement insertion points. The detection of video advertisement insertion points can be formalized as finding peaks on a curve that is the linear combination of discontinuity and attractiveness, i.e., αA+βD, where −1<α and β<1. Specifically, different advertising strategies may lead to the selection of different α and β. For example, α may be set to greater than β, or α>β, to provider more benefits to advertisers than viewers. On the other hand, a may be set to less than β, or α>β, to provide more benefits to viewers than advertisers.
In alternative embodiments, the discontinuity/attractiveness evaluator 214 of the insertion point generator 214 may be employed to set video advertisement insertion points for the investigation of viewer tolerance to the inserted video advertisements, as well as the effectiveness of the video advertisements from the point of advertisers. For example, a set of different parameters (i.e., α and β) may be selected for generating a combined curve. Video advertisements are then inserted into a video source based on the combined curves. Viewers may then view the video source and provide feedbacks as to their reaction to the advertisement integrated source video (e.g., enjoyable, okay, annoyed, etc.). Moreover, advertisers may be asked to assess the effectiveness of the inserted video advertisements. For example, if the selected insertion points for the video advertisements are effective, the advertisers may observe an increase in website traffic or telephone calls originating from the inserted video advertisements. At block 410, the advertisement embedder 216 may insert at least one video advertisement at each of the detected insertion points.
The determination of optimal video advertisement insertion points based on the concept of “attractiveness” and “intrusiveness” may enable advertisers to maximize the impact of their video advertisements. Specially, optimal video advertisement insertion points may focus the attention of the viewers on the advertisements while keeping negative reactions from most viewers, such as irritation or annoyance, to a minimum. In this manner, content providers, advertisers, and the general public may all benefit. For example, providers of video sources, or content providers, may upload creative content. Meanwhile, advertisers may reach an audience by seamlessly integrating video advertisements into the uploaded content source. In turn, the content providers may then receive compensation for their creative efforts by receiving a share of the advertising revenue while distributing their content to viewers at no cost.
Exemplary System Architecture
FIG. 12 illustrates a representative computing environment 1200 that may be used to implement the insertion point determination techniques and mechanisms described herein. However, it will readily appreciate that the various embodiments of the transformation techniques may be implemented in different computing environments. The computing environment 1200 shown in FIG. 12 is only one example of a computing environment and is not intended to suggest any limitation as to the scope of use or functionality of the computer and network architectures. Neither should the computing environment 1200 be interpreted as having any dependency or requirement relating to any one or combination of components illustrated in the example computing environment.
As depicted in FIG. 12, the exemplary computing environment 1200 may include a computing device 1202 having one or more processors 1206. A system memory 1208 is coupled to the processor(s) 1206 by one or more buses 1210. The one or more buses 1210 may be implemented using any kind of bus structure or combination of bus structures, including a memory bus or memory controller, a peripheral bus, an accelerated graphics port, and a processor or local bus using any of a variety of bus architectures. It is appreciated that the one or more buses 1210 provide for the transmission of computer-readable instructions, data structures, program modules, and other data encoded in one or more modulated carrier waves. Accordingly, the one or more buses 1210 may also be characterized as computer-readable mediums.
The system memory 1208 may include both volatile and non-volatile memory, such as random access memory (RAM) 1212, and read only memory (ROM) 1214. The environment 1200 also includes one or more mass storage devices, which may also be characterized as mass storage type input/output devices, may include a variety of types of volatile and non-volatile media, each of which can be removable or non-removable. For example, the mass storage devices may include a hard disk drive 1218 for reading from and writing to a non-removable, non-volatile magnetic media, a magnetic disk drive 1220 for reading from and writing to a removable, non-volatile magnetic disk 1222 (e.g., a “floppy disk”), and an optical disk drive 1224 for reading from and/or writing to a removable, non-volatile optical disk 1226 such as a compact disk (CD), digital versatile disk (DVD), or other optical media. Although not shown, the one or more mass storage devices may also include other types of computer-readable medium, such as magnetic cassettes or other magnetic storage devices, flash memory cards, electrically erasable programmable read-only memory (EEPROM), or the like. The hard disk drive 1218, magnetic disk drive 1220, and optical disk drive 1224 may each be connected to the system bus 1210 by one or more data media interfaces 1228. Alternatively, the hard disk drive 1218, magnetic disk drive 1220, and optical disk drive 1224 may be coupled to the system bus 1210 by a SCSI interface (not shown), or other coupling mechanism.
In addition to the mass storage type input/output devices described above, the environment 1200 includes various input/output devices such as a display device 1204, a keyboard 1238, a pointing device 1240 (e.g., a “mouse”) and one or more communication ports 1250. In further embodiments, the input/output devices may also include speakers, microphone, printer, joystick, game pad, satellite dish, scanner, card reading devices, digital or video camera, or the like. The input/output devices may be coupled to the system bus 1210 through any kind of input/output interface 1242 and bus structures, such as a parallel port, serial port, game port, universal serial bus (USB) port, video adapter 1244 or the like.
The computing environment 1200 may further include one or more additional computing devices 1246 communicatively coupled by one or more networks 1248. Accordingly, the computing device 1202 may operate in a networked environment using logical connections to one or more remote computing devices 1246. The remote computing device 1246 can comprise any kind of computer equipment, including personal computers, server computers, hand-held or laptop devices, multiprocessor systems, microprocessor-base systems, set top boxes, game consoles, programmable consumer electronics, network PCs, minicomputers, and mainframe computers. The remote computing devices 1246 may include all of the features discussed above with respect to computing device 1202, or some subset thereof. The networked environment may further be utilized to implement a distributed computing environment. In a distributed computing environment, computing resources can be physically dispersed throughout the environment.
Any type of network 1248 can be used to couple the computing device 1202 with one or more remote computing devices 1246, such as a wide-area network (WAN), a local area network (LAN), and/or the like. The computing device 1202 may be coupled to the network 1248 via a communication port 1250, such as a network interface card. The communication port 1250 may utilize broadband connectivity, modem connectivity, DSL connectivity, or other connection strategy. Although not illustrated, the computing environment 1200 may also provide wireless communication functionality for connecting computing device 1202 with remote computing devices 1246 (e.g., via modulated radio signals, modulated infrared signals, etc.). It is appreciated that the one or more networks 1248 provide for the transmission of computer-readable instructions, data structures, program modules, and other data encoded in one or more modulated carrier waves.
Generally, one or more of the above-identified computer-readable mediums provide storage of computer-readable instructions, data structures, program modules, and other data for use by the computing device 1202. For instance, one or more of the computer-readable mediums may store the operating system 1230, one or more application functionalities 1232 (including functionality for implementing aspects of the software transformation methods), other program modules 1234, and program data 1236. More specifically, the ROM 1214 typically includes a basic input/output system (BIOS) 1216. BIOS 1216 contains the basic routines that help to transfer information between elements within computing device 1202, such as during start-up. The RAM 1212 typically contains the operating system 1230′, one or more applications functionalities 1232′, other program modules 1234′ and program data 1236′, in a form that can be quickly accessed by the processor 1206. The content in the RAM 1212 is typically transferred to and from one or more of the mass storage devices (e.g., hard disk drive 1218), for non-volatile storage thereof.
It is appreciated that the illustrated operating environment 1200 is only one example of a suitable operating environment and is not intended to suggest any limitation as to the scope of use or functionality of the invention. Other well-known computing systems, environments and/or configurations that may be suitable for use with the invention include, but are not limited to personal computers, server computers, hand-held or laptop devices, multiprocessor systems, microprocessor-base systems, set top boxes, game consoles, programmable consumer electronics, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and/or the like.
CONCLUSION
In closing, although the various embodiments have been described in language specific to structural features and/or methodological acts, it is to be understood that the subject matter defined in the appended claims is not necessarily limited to the specific features or acts described. Rather, the specific features and acts are disclosed as exemplary forms of implementing the claimed subject matter.

## Claims

1. A method, comprising:
parsing, at a computing device, a first video into a plurality of shots that includes one or more shot boundaries; and
determining, at the computing device, one or more insertion points for inserting a second video into the first video based on a discontinuity and an attractiveness of each of the one or more shot boundaries,
the discontinuity of a shot boundary being a measure of dissimilarity between a pair of shots that are adjacent to the shot boundary, and
the attractiveness of the shot boundary being an amount of viewer attention that a corresponding shot boundary attracts that is estimated based on applying one or more attention models to the corresponding shot boundary and combining results from the one or more attention models in accordance with at least one of a linear weighted relationship characterizing the one or more attention models or a non-linear increasing relationship characterizing the one or more attention models.

2. The method of claim 1, wherein the determining the one or more insertion points includes:
computing a degree of discontinuity for each of the one or more shot boundaries;
computing a degree of attractiveness for each of the one or more shot boundaries;
determining one or more insertion points based on the degree of discontinuity and the degree of attractiveness of each shot boundary; and
inserting the second video at the one or more determined insertion points of the first video to form an integrated video stream.

3. The method of claim 2, further comprising providing the integrated video stream for playback, and assessing effectiveness of the one or more insertion points based on viewer feedback to a played integrated video stream.

4. The method of claim 2, wherein the determining the one or more insertion points includes finding peaks in a linear combination of degrees of discontinuity and degrees of attractiveness of a plurality of shot boundaries.

5. The method of claim 2, wherein each shot boundary comprises a visual shot boundary or an audio shot boundary, and wherein the determining the one or more insertion points further includes linearly combining degrees of discontinuity of one or more visual shot boundaries and one or more audio shot boundaries.

6. The method of claim 2, wherein computing the degree of discontinuity for each of the one or more shot boundaries includes computing at least one of a degree of content discontinuity or a degree of semantic discontinuity for each shot boundary.

7. The method of claim 6, wherein the computing the degree of content discontinuity for each shot boundary includes:
using a merge method to merge one or more pairs of adjacent shots, wherein the each pair of adjacent shots includes a shot boundary;
assigning a merging order to each shot boundary, the merging order being assigned based on a chronological order in which a corresponding pair of adjacent shots are merged; and
calculating a content discontinuity value for each shot boundary based on the corresponding merging order.

8. The method of claim 6, wherein the computing the degree of the semantic discontinuity for each of the one or more shot boundaries includes:
using one or more first concept detectors to determine a first confidence score between a first shot and at least one corresponding first attribute;
using one or more second concept detectors to determine a second confidence score between a second shot and at least one corresponding second attribute;
composing at least the first confidence score into a first vector,
composing at least the second confidence score into a second vector; and
calculating a semantic discontinuity value for a shot boundary between the first and second shots based on a difference between the first vector and the second vector.

9. The method of claim 8, wherein the using the one or more first concept detectors and the one or more second concept detectors includes using concept detectors that are based on support vector machines (SVMs).

10. The method of claim 2, wherein the computing the degree of attractiveness includes computing the degree of attractiveness for each of the plurality of shots using at least one of a motion attention model, a static attention model, a semantic attention model, or a guided attention model.

11. The method of claim 10, wherein the computing the degree of attractiveness further includes computing the degree of attractiveness for each of the plurality of shots using at least one of an audio saliency model, a speech attention model, or a music attention model.

12. The method of claim 11, wherein the computing the degree of attractiveness for each of the one or more shot boundaries further includes:
obtaining one or more visual attractiveness values for at least one shot from a corresponding group of visual attention models;
obtaining one or more audio attractiveness values for the at least one shot from the corresponding group of audio attention models; and
combining the one or more visual attractiveness values and the one or more audio attractiveness values using one of the linear weighted relationship or the non-linear increasing relationship to obtain the degree of attractiveness for the at least one shot.

13. The method of claim 12, wherein the computing the degree of attractiveness for each of the one or more shot boundaries further includes:
acquiring a first degree of attractiveness for a first shot;
acquiring a second degree of attractiveness for a second shot that is adjacent the first shot;
computing a degree of overall attractiveness, A(pi), by computing a linear combination of attractiveness degrees from the first and second shots according to:


A(pi)=λ×A(si)+(1−λ)×A(si+1)


wherein A(si) represents the degree of attractiveness for the first shot, and A(si+1) represents the degree of attractiveness for the second shot, and λ is a number between 0 and 1.

14. The method of claim 2, wherein the determining the one or more insertion points includes:
constructing a linear combination curve of one or more degrees of overall discontinuity and one or more degrees of attractiveness; and
determining the one or more insertion points based on one or more peaks on the linear combination curve.

15. The method of claim 1, wherein the parsing the first video includes parsing the first video into the plurality of shots based on one of visual details of the first video or an audio stream of the first video.

16. The method of claim 15, wherein the parsing the first video into the plurality of shots based on the visual details of the first video includes using one of a pair-wise comparison method, a likelihood ratio method, an intensity level histogram method, or a twin-comparison method, and wherein the parsing the first video into the plurality of shots based on the audio stream of the first video includes using a plurality of kernel support vector machines.

17. A memory having computer-executable instructions that are executable to perform acts comprising:
parsing a first video into a plurality of shots, the plurality of shots includes one or more shot boundaries;
computing a degree of overall discontinuity for each of the one or more shot boundaries, each degree of discontinuity being a measure of dissimilarity between a pair of shots that are adjacent to a corresponding shot boundary;
computing a degree of attractiveness for each of the one or more shot boundaries, each degree of attractiveness being an amount of viewer attention that a corresponding shot boundary attracts that is estimated based on applying one or more attention models to the corresponding shot boundary and combining results from the one or more attention models in accordance with at least one of a linear weighted relationship characterizing the one or more attention models or a non-linear increasing relationship characterizing the one or more attention models;
determining one or more insertion points based on the degree of overall discontinuity and the degree of attractiveness of each shot boundary, the one or more insertion points being for inserting a second video into the first video; and
inserting the second video at the one or more determined insertion points to form an integrated video stream.

18. The memory of claim 17, further comprising providing the integrated video stream for playback, and assessing effectiveness of the one or more insertion points based on viewer feedback to a played integrated video stream.

19. The memory of claim 17, wherein the parsing the first video includes parsing the first video into the plurality of shots using one of a pair-wise comparison method, a likelihood ratio method, an intensity level histogram method, or a twin-comparison method.

20. The memory of claim 17, wherein the computing the degree of discontinuity for each shot boundary includes:
computing a degree of content discontinuity for a shot boundary;
computing a degree of semantic discontinuity for the shot boundary; and
computing a degree of overall discontinuity for the shot boundary based on an average of the degree of content discontinuity and the degree of semantic discontinuity.

21. The memory of claim 17, wherein computing the degree of discontinuity for each shot boundary includes:
computing a degree of content discontinuity for a shot boundary;
computing a degree of semantic discontinuity for the shot boundary; and
computing the degree of overall discontinuity, D(pi), by combining the degree of content discontinuity and the degree of semantic discontinuity for the shot boundary according to:


D(pi)=λDc(pi)+(1−λ)Ds(pi)


wherein Dc(pi) represents the degree of content discontinuity, Ds(pi) represents the degree of semantic discontinuity, and λ is a number between 0 and 1.

22. The memory of claim 17, wherein the determining the one or more insertion points includes:
constructing a linear combination curve of one or more degrees of overall discontinuity and one or more degrees of attractiveness; and
determining the one or more insertion points based on one or more peaks on the linear combination curve.

23. A system, the system comprising:
one or more processors; and
memory allocated for storing a plurality of computer-executable instructions which are executable by the one or more processors, the computer-executable instructions comprising:
instructions for parsing a first video into a plurality of shots, the plurality of shots includes one or more shot boundaries;
instructions for computing a degree of discontinuity for each of the one or more shot boundaries, each degree of discontinuity being a measure of dissimilarity between a pair of shots that are adjacent to a corresponding shot boundary that is computed based on an average of a computed degree of content discontinuity and a computed degree of semantic discontinuity for a corresponding shot boundary, the degree of semantic discontinuity being computed based on at least one attribute of the corresponding shot boundary that is detected by one or more concept detectors;
instructions for computing a degree of attractiveness for each of the one or more shot boundaries, each degree of attractiveness being an amount of viewer attention that a corresponding shot boundary attracts that is estimated based on applying one or more attention models to the corresponding shot boundary and combining results from the one or more attention models in accordance with at least one of a linear weighted relationship characterizing the one or more attention models or a non-linear increasing relationship characterizing the one or more attention models;
instructions for determining one or more insertion points based on the degree of discontinuity and the degree of attractiveness of each shot boundary, the one or more insertion points being for inserting a second video into the first video; and
instructions for inserting the second video at the one or more determined insertion points to form an integrated video stream.

24. The system of claim 23, further comprising instructions for providing the integrated video stream for playback, and assessing effectiveness of the one or more insertion points based on viewer feedback to a played integrated video stream.

25. A memory having computer-executable instructions that are executable to perform acts comprising:
parsing a first video into a plurality of shots, the plurality of shots includes one or more shot boundaries;
computing a degree of overall discontinuity for each of the one or more shot boundaries, each degree of discontinuity being a measure of dissimilarity between a pair of shots that are adjacent to a corresponding shot boundary;
computing a degree of attractiveness for each of the one or more shot boundaries, each degree of attractiveness being an amount of viewer attention that a corresponding shot boundary attracts that is estimated based on applying one or more attention models to the corresponding shot boundary;
determining one or more insertion points based on the degree of overall discontinuity and the degree of attractiveness of each shot boundary, the one or more insertion points being for inserting a second video into the first video, wherein determining the one or more insertion points comprises constructing a linear combination curve of one or more degrees of overall discontinuity and one or more degrees of attractiveness, and determining the one or more insertion points based on one or more peaks on the linear combination curve; and
inserting the second video at the one or more determined insertion points to form an integrated video stream.