• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.4A
• /
• pp.356-363
• /
• 2002

Video scene segmentation is fundamental role for content based video analysis and many kinds of scene segmentation schemes have been proposed in previous researches. However, there is a problem, which is to find optimal threshold value according to various kinds of movies and its content because only fixed single threshold value usually used for cut detection. In this paper, we proposed the variable dynamic threshold method, which change the threshold value by a probability distribution of cut detection interval and information of frame feature differences and cut detection interval in previous cut detection is used to determine the next cut detection. For this, we present a cut detection algorithm and a parameter generation method to change the threshold value in runtime. We also show the proposed method, which can minimize fault alarm rate than the existing methods efficiently by experimental results.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.9B
• /
• pp.1690-1696
• /
• 1999

Video sequence should be hierachically classified for the content-based retrieval. Cut detection algorithm is an essential process to classify shots. It is generally difficult for cut detection algorithms to detect cut points since a current frame is compared with a previous one, because movement of camera or object made adrupt scene change. We reduce ratio of failed cut detection so that compare the difference between frames of predicted cut point and their neighbors. In this paper, first we get predicted cut point, then we judge that the predicted cut point is true point or not. And we extracted DC images in MPEG video sequence for comparison. As a result of experiments. We confirmed that the cut detection ratio of the proposed algorithm is higher than of any other algorithms.

• The KIPS Transactions:PartC
• /
• v.12C no.4 s.100
• /
• pp.609-616
• /
• 2005

Signature-based Intrusion Detection has many false positive and many difficulties to detect new and changed attacks. Alpha-cut is introduced which reduces false positive with a combination of signature-based IDS and machine learning-based IDS in prior paper [1]. This research is a study of a succession of Alpha-cut, and we introduce Beta-rick in which attacks can be detected but cannot be detected in single signature-based detection. Alpha-cut is a way of increasing detection accuracy for the signature based IDS, Beta-pick is a way which decreases the case of treating attack as normality. For Alpha-cut and Beta-pick we use XIBL as a learning algorithm and also show the difference of result of Sd.5. To describe the value of proposed method we apply Alpha-cut and Beta-pick to signature-based IDS and show the decrease of false alarms.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.17 no.5
• /
• pp.289-296
• /
• 2022

In this paper, we developed a deep learning-based recyclable object detection model. The model is developed based on YOLOv5 that is a one-stage detector. The deep learning model detects and classifies the recyclable object into 7 categories: paper, carton, can, glass, pet, plastic, and vinyl. We propose two methods for recyclable object detection models to solve problems during training. Bounding Box CutMix solved the no-objects training images problem of Mosaic, a data augmentation used in YOLOv5. Standardized Distance-based IoU replaced DIoU using a normalization factor that is not affected by the center point distance of the bounding boxes. The recyclable object detection model showed a final mAP performance of 0.91978 with Bounding Box CutMix and 0.91149 with Standardized Distance-based IoU.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.919-922
• /
• 1998

A content-base search method is required for video which has an unformatted and huge size of data. The index techniue is necessary for the content-based search of the video data. The first step of the video indexing is a cut detection. We propose a dynamic threshold method which change a threshold value during the cut detection process. We demonstrate that the proposed method is more efficient than the existing methods.

• Journal of Institute of Control, Robotics and Systems
• /
• v.7 no.4
• /
• pp.304-308
• /
• 2001

The increase of video data makes the demand of efficient retrieval, storing, and browsing technologies necessary. In this paper, a video segmentation method (scene change detection method, or shot boundary detection method) for the development of such systems is proposed. For abrupt cut detection, inter-frame similarities are computed using luminance and edge histograms and a cut is declared when the similarities are under th predetermined threshold values. A gradual scene change detection is based on the similarities between the current frame and the previous shot boundary frame. A correlation method is used to obtain universal threshold values, which are applied to various video data. Experimental results show that propose method provides 90% precision and 98% recall rates for abrupt cut, and 59% precision and 79% recall rates for gradual change.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.39 no.1
• /
• pp.67-74
• /
• 2002

A study on image searching and management techniques is actively developed by user requirements for multimedia information that are existing as images, audios, texts data from various information processing devices. If we can automatically detect and segment changing scenes from real-time image sequences, we can improve an effectiveness of image searching systems. In this paper, we propose cut detection techniques based on image color distribution and we evaluated its performance on various real-time image sequences. Results of experiments show that the proposed method are robust on various image patterns than color histogram method using statistical informations of images. Also, these methods can be used for cut detection on real-time image sequences.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10c
• /
• pp.411-413
• /
• 1998

Video영상을 의미있는 부분으로 나누는 Video segmentation을 위해서는 Video Cut의 검출이 필요하다. 본 논문에서는 Video Cut의 검출을 위하여 신경망을 이용하였으며, cut의 측정 방법으로 보색(complementary color)의 개념을 도입하였다. 이 방법을 이용하여, 여러개의 Video data로부터 학습을 한 뒤 새로운 Video에 대해서 테스트한 결과 좋은 성능을 보였다.

• Journal of the Korea Computer Industry Society
• /
• v.2 no.3
• /
• pp.389-396
• /
• 2001

In detection of a scene change of the moving pictures which has massive information capacity, the temporal sampling method has a faster searching speed and lower missing scene change detection than the sequential searching method for the whole moving pictures, yet employed searching algorithm and detection interval greatly affect missing frame and searching precision. In this study, the whole moving pictures were primarily retrieved threshold by the temporal difference of histogram scene change detection method. We suggested a dynamic threshold algorithm using cut detection interval and derived an equation formula to determine optimal primary retrieval threshold which can cut detection interval computation. Experimental results show that the proposed dynamic threshold algorithm using cut detection interval method works up about 30 percent in precision of performance than the sequential searching method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.24 no.8B
• /
• pp.1567-1576
• /
• 1999

In this paper, we propose new methods to detect a scene cut and a dissolve region in compressed MPEG video sequences. The scene cut detection method uses edge images obtained using DCT AC coefficients and the dissolve detection method utilizes the macroblock type information of the MPEG stream. The proposed scene cut detection method is insensitive to brightness and can detect scene changes more precisely than the methods using DC coefficients since AC edge images can express original images more exactly than DC edge images do. The proposed dissolve detection method using the number of intra macroblocks(MBs) computationally efficient since it does not require the decoding process. Experimental results show that the proposed methods perform better in detection scene changes than conventional other methods.