• Journal of Korea Multimedia Society
• /
• v.12 no.3
• /
• pp.354-361
• /
• 2009

Shot change detection is the main technique in the video segmentation which requirs real-time processing and automatical processing in hardware. Until now, there were few research reports about real-time shot change detection for applying to hardware terminals with low performance such as PMPs(Portable Media Player) and cellular phones. In this paper, we propose shot change detection technique using adaptive threshold setting method on variable reference block. Our proposed algorithm determines shot change detection by comparing the feature value of current frame and a mean of a feature value on variable reference blocks. The proposed method can be used independently from the feature value of frame, can adaptively set thresholds using a mean of a feature value on variable reference blocks. We obtained better detection ratio than the conventional methods maximally by precision 0.146, recall 0.083, F1 0.089 in the experiment with the same test sequences. We verified real-time operation of shot change detection by implementing our algorithm on the PMP from some company of H. Therefore, our proposing algorithm will be helpful in searching video data on portable media players such as PMPs and cellular phones.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.2 s.40
• /
• pp.111-119
• /
• 2006

Video viewers can not understand enough entire video contents because most video is long length data of large capacity. This paper propose efficient scene change detection and video abstracting using new shot clustering to solve this problem. Scene change detection is extracted by method that was merged color histogram with $\chi2$ histogram. Clustering is performed by similarity measure using difference of local histogram and new shot merge algorithm. Furthermore, experimental result is represented by using Real TV broadcast program.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.2 s.46
• /
• pp.103-109
• /
• 2007

In this paper, we detect shot boundaries using $X^2$-histogram comparison method which have enough spatial information that is more robust to the camera or object motion and produce more precise results. Also, we present normalization method to change Log-Formula and constant that is used for contrast enhancement of image in image processing and apply in difference value. And, present shot boundary detection algorithm to detect shot boundary based on general shot and abrupt shot's characteristic.

• Proceedings of the IEEK Conference
• /
• 2002.06a
• /
• pp.259-262
• /
• 2002

We propose a new algorithm to detect shot change, which is necessary in retrieval of video data. In order to solve the problems of abrupt brightness change and similar brightness between frames in the typical shot change methods, we propose the hi-polarity histogram method which takes into account the distribution and magnitude of brightness changes in consecutive frames. We evaluate our algorithm with compressed and uncompressed video data and demonstrate its improved performance.

• Journal of the Institute of Convergence Signal Processing
• /
• v.1 no.1
• /
• pp.58-63
• /
• 2000

This paper describes an efficient algorithm for shot boundary detection in MPEG video stream. There are two types of shot boundary: abrupt and gradual. The proposed algorithm for detecting the abrupt shot boundaries used DCT DC value in compressed domain. The proposed algorithm of the gradual change detection consists of two-pass mechanism. In the first pass, the expected positions of shot boundaries are extracted using ratio value of motion vectors. After decoding frames that are extracted in the first pass, we will make the dissolving image using (n)th and (n+2)th image of expected position. The gradual shot boundaries are selected by similarity of the dissolving image and the image of (n+1)th expected position. As applying the algorithm for detecting shot boundaries, the gradual changes as well as the abrupt changes are detected efficiently. Experimental results indicate that the proposed method is computationally fast for detecting shot boundaries and robust to the variation of the video characteristic that is different for the kind of videos.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.5
• /
• pp.21-29
• /
• 2015

This paper proposes a shot change detection algorithm by using frame segmentation and the object changes among moving blocks. In order to detect the rapid moving changes of objects between two consecutive frames, the moving blocks on the diagonal are defined, and their histograms are calculated. When a block of the current frame is compared to the moving blocks of the next frame, the block histograms are used and the threshold of a shot change detection is automatically adjusted by Otsu's threshold method. The proposed algorithm was tested for the various types of color or gray videos such as films, dramas, animations, and video tapes in National Archives of Korea. The experimental results showed that the proposed algorithm could enhance the detection rate when compared to the studied methods that use brightness, histogram, or segmentation.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.635-638
• /
• 2005

The purpose of video segmentation is to segment video sequence into shots where each shot represents a sequence of frames having the same contents, and then select key frames from each shot for indexing. There are two types of shot changes, abrupt and gradual. The major problem of shot change detection lies on the difficulty of specifying the correct threshold, which determines the performance of shot change detection. As to the clustering approach, the right number of clusters is hard to be found. Different clustering may lead to completely different results. In this thesis, we propose a video segmentation method using a color-X$^2$ intensity histogram-based fuzzy c-means clustering algorithm.

• Journal of Korea Multimedia Society
• /
• v.6 no.5
• /
• pp.797-804
• /
• 2003

Scene change detection algorithm, which is very important preprocessing technique for video indexing and retrieval and determines the performance of video database system, is being studied widely. In this paper, we propose a more effective abrupt scene change detection, which is robust to large motion, sudden change of light and successive abrupt shot transitions rapidly. And we also propose a new gradual scene change detection algorithm, which can detect dissolve, and fade in/out precisely. Furthermore, we also propose a representative frame extraction algorithm which performs content-based video summary by novel DCT DC image buffering technique and accumulative histogram intersection measure (AHIM).

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.1
• /
• pp.75-80
• /
• 2008

This paper proposes a method to detect scene change using global decision tree that extract boundary cut that have width of big change that happen by camera brake from difference value of frames. First, calculate frame difference value through regional X2-histogram and normalization, next, calculate distance between difference value using normalization. Shot boundary detection is performed by compare global threshold distance with distance value for two adjacent frames that calculating global threshold distance based on distance between calculated difference value. Global decision tree proposed this paper can detect easily sudden scene change such as motion from object or camera and flashlight.

• KSCI Review
• /
• v.14 no.1
• /
• pp.255-264
• /
• 2006

Video viewers can not understand enough entire video contents because most video is long length data of large capacity. This paper propose efficient scene change detection and video abstracting using new shot clustering to solve this problem. Scene change detection is extracted by method that was merged color histogram with ${\chi}^2$ histogram. Clustering is performed by similarity measure using difference of local histogram and new shot merge algorithm. Furthermore, experimental result is represented by using Real TV broadcast program.