• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.3 s.309
• /
• pp.17-24
• /
• 2006

In this paper, an algorithm for anchor frame detection in news video is proposed, which consists of four steps. In the first step, the cumulative histogram method is used to detect shot boundaries in order to segment a news video into video shots. In the second step, skin color information is used to detect face regions in each shot boundary. In the third step, color information of upper body regions is used to extract anchor object, which produces candidate anchor frames. Then, from the candidate anchor frames, a graph-theoretic cluster analysis algorithm is utilized to classify the news video into anchor-person frames and non-anchor frames. Experiment results have shown the effectiveness of the proposed algorithm.

• Journal of KIISE:Software and Applications
• /
• v.35 no.9
• /
• pp.572-587
• /
• 2008

The Self-organizing Feature Map(SOFM) that is one of unsupervised neural networks is a very powerful tool for data clustering and visualization in high-dimensional data sets. Although the SOFM has been applied in many engineering problems, it needs to cluster similar weights into one class on the trained SOFM as a post-processing, which is manually performed in many cases. The traditional clustering algorithms, such as t-means, on the trained SOFM however do not yield satisfactory results, especially when clusters have arbitrary shapes. This paper proposes automatic clustering on trained SOFM, which can deal with arbitrary cluster shapes and be globally optimized by graph cuts. When using the graph cuts, the graph must have two additional vertices, called terminals, and weights between the terminals and vertices of the graph are generally set based on data manually obtained by users. The Proposed method automatically sets the weights based on mode-seeking on a distance matrix. Experimental results demonstrated the effectiveness of the proposed method in texture segmentation. In the experimental results, the proposed method improved precision rates compared with previous traditional clustering algorithm, as the method can deal with arbitrary cluster shapes based on the graph-theoretic clustering.