| 摘要 |
PROBLEM TO BE SOLVED: To permit suitable contents display concerning entire video by calculating the difference of frames sampled before and after and selecting frames corresponding to the maximum frame difference as candidate frames. SOLUTION: When determining a key frame, in order to decrease the number of frames to be processed among a lot of candidate frames as input to a hierarchical clustering algorithm, frames are sampled two to five times a second (701). Next, the difference of sampled frames and frames sampled before is calculated while using any one of various interval references (702). Next, in order to select N candidates, an N/2-th maximum interval (maximum difference) between following frames is determined and frames before and after a boundary as a candidate boundary are selected as candidate frames (703). Thus, one set of key frames for appropriately explaining the entire video clip can be determined. |
