We have implemented our system in Matlab. We tested our method on an Intel Core Duo processor, 1.6 Ghz, 2GB RAM.We have conducted experiments on 7 popular motion pictures, 9 soccer match highlights and two episodes of TV shows summing up to total of 19 hours 23 minutes of video. Our method detected lead stars in all the videos in an average of 14 minutes for an one hour video. The method [4] in the literature computes lead star of a motion picture in 23 hours, whereas we compute lead star for motion picture in an average of 30 minutes. We now provide more details.
Lead Actor Detection in Motion Picture
We ran our experiments on 7 box-office hit movies listed in the table given below. This totally sums up to 16 hours of video.
No. | Movie Name | Duration (hh:mm) | Computation Time for Detecting Lead Stars (hh:mm) | Computation Time for Refinement (hh:mm) |
1 | The Matrix | 02:16 | 00:22 | 00:49 |
2 | The Matrix Reloaded | 02:13 | 00:38 | 01:25 |
3 | Matrix Revolutions | 02:04 | 00:45 | 01:07 |
4 | Eyes Wide Shut | 02:39 | 00:12 | 00:29 |
5 | Austin Powers in Goldmember | 01:34 | 00:04 | 01:01 |
6 | The Sisterhood of the Traveling Pants | 01:59 | 00:16 | 00:47 |
7 | Titanic | 03:18 | 01:01 | 01:42 |
Total | 16:03 | 03:18 | 07:20 |
The lead stars in all these movies are computed in 3 hour 18 minutes. So the average computation time for a movie is around 30 minutes. From Table 1, we see that the best computation time is 4 minutes for the movie Austin Powers in Goldmember which is 1 hour 42 minutes in duration. The worst computation time is 45 minutes for the movie Matrix Revolutions of duration 2 hour 4 minutes. For movies like Eyes Wide Shut and Austin Powers in Goldmember, the computation is faster as there are fewer audio highlights. Whereas action movies like Titanic sequels take more time as there are many audio highlights. This causes the variation in computation time among movies.
The lead actors detected are shown in the Figure below. The topmost star is highlighted in red color and the next top star is highlighted in blue color. As you can notice in the figure, in most of the movies topmost stars are detected. Since the definition of "top" is subjective, it could be said that in some cases, top stars are not detected in some cases. Further, in some cases the program identifies the same actor multiple times. This could be due to disguise, or due to pose variation. The result is further refined for better accuracy.

Player of the Match Identification
We have conducted experiments on 11 soccer match highlights taken from BBC and listed in Table. Our method on an average takes half the time of the duration of the video. Note however, that these timings are for only sections that have already been manually edited by the BBC staff. If the video were run on a routine full soccer match, we expect our running time to be a lower percentage of the entire video.
No. | Soccer Match | Duration (hh:mm) | Computation (hh:mm) |
1 | Barnsley vs Chelsea | 00:02 | 00:01 |
2 | BirminghamCity vs Arsena | 00:12 | 00:04 |
3 | Tottenham vs Arsenal | 00:21 | 00:07 |
4 | Chelsea vs Arsenal | 00:14 | 00:05 |
5 | Chelsea vs Middlesborough | 00:09 | 00:05 |
6 | Liverpool vs Arsena | 00:12 | 00:05 |
7 | Liverpool vs Havant & Waterlooville | 00:15 | 00:06 |
8 | Liverpool vs Middlesbrough | 00:09 | 00:05 |
9 | Liverpool vs NewcaslteUnited | 00:18 | 00:04 |
Total | 01:52 | 00:43 |

The results of key player detection is presented in the Figure. The key players of the match are identified for all the matches.
Host Guest Detection
We conducted our experiment on the TV show Koffee with Karan. Two different episodes of the show were combined and fed as input. Our method identified the host in 4 minutes for a video of duration 1 hour 29 minutes. Our method is faster than the method proposed by Javed et. al.
TV show | Duration (hh:mm) | Computation (hh:mm) |
Koffee With Karan | 01:29 | 00:04 |

The result of our method for the TV show Koffee with Karan is presented in Figure. Our method has successfully identified the host.