Open GoogleCodeExporter opened 9 years ago
I was thinking along the lines of standard deviation.
The first measure of completeness is how much the set of clips 'covers' the
time of the video. Making the assumption that most videos have an even
distribution of the times when description is desirable, the more complete
description is the one that has rather evenly-spaced clips, in other words, a
low clustering of clips. So, the standard deviation of the times between clips
should be a good first approximation of completeness. The computation should
include the time from the beginning of the video to the first clip, and the
time from the last clip to the end of the video. This will avoid the case of a
set of evenly distributed clips that are only in the beginning of the video.
Original comment by keith...@gmail.com
on 29 Apr 2014 at 1:07
An implementation based on the algorithm Josh describes is in:
http://youdescribe.ski.org/testtabs/
for example:
http://youdescribe.ski.org/testtabs/player.php?v=5OLlemqd3SE
Original comment by Owen.R.E...@gmail.com
on 19 Jun 2014 at 6:28
Original issue reported on code.google.com by
joshua.a...@gmail.com
on 8 May 2013 at 4:41