• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.139-140
• /
• 2012

This paper proposes a Video Browsing Service that provides both the video content retrieval and the video browsing by the real-time user interface on Web. For the scene segmentation and key frame extraction of video sequence, we proposes an efficient scene change detection method that combine the RGB color histogram with the ${\chi}2$ histogram.

• The KIPS Transactions:PartB
• /
• v.8B no.4
• /
• pp.411-418
• /
• 2001

비디오 하이라이트(highlights)는 원래의 비디오 보다 짧고 많은 양의 의미를 갖는다. 기존의 파노라마 형태의 추상화 기법은 여러 프레임을 하나의 프레임으로 모자이크하는 형태이었고, TV 드라마 하이라이트 방법은 카메라의 이동이나 특수효과에 의존하기 때문에 스포츠 비디오에 적용은 부적합하다. 이 논문에서는 축구 비디오를 대상으로 시각정보와 자막을 이용하는 새로운 비디오 하이라이트 생성 방법과 이벤트 기반 비디오 인덱싱 방법을 제안한다. 하이라이트 생성은 하이라이트 생성 규칙에 따라 자막에 의해 추출된 TIT을 중심으로 시각정보에 의해 추출된 샷을 합성하여 생성하였고, 인덱싱은 자막으로 추출된 샷은 주요소로, 시각정보에 의해 추출된 샷은 부가적 요소로 구성하였다. 실험에서는 샷 추출기법 중 대표적인 컬러히스토그램과 $\chi$$^2$히스토그램과의 성능을 비교하여 제안한 하이라이트 기법이 다른 방식보다 우수함을 증명하였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2013.05a
• /
• pp.101-103
• /
• 2013

Most pickpockets occurs at a place where a lot of people. However, the current occurs more commonly in a secluded place and unfrequented place. In this paper, we classified to the scene for submitting to image forensics evidence target for pickpockets of theft. Using the ${\chi}^2$ histogram to detect the scene change detection. We wish to submit evidence by classifying as a pickpocket scene video.

• Journal of Internet Computing and Services
• /
• v.3 no.2
• /
• pp.69-77
• /
• 2002

Recently, Digital video is one of the important information media delivered on the Internet and playing an increasingly important role in multimedia. This paper proposes a Video Browsing Service(VBS) that provides both the video content retrieval and the video browsing by the real-time user interface on Web, For the scene segmentation and key frame extraction of video sequence, we proposes an efficient scene change detection method that combines the RGB color histogram with the $x^2$(Chi Square) histogram. Resulting key frames are linked by both physical and logical indexing, This system involves the video editing and retrieval function of a VCR's, Three elements that are the date, the field and the subject are used for video browsing. A Video Browsing Service is implemented with MySQL, PHP and JMF under Apache Web Server.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.4 s.42
• /
• pp.147-154
• /
• 2006

Effective and efficient representation of color features of multiple video frames is an important vet challenging task for visual information management systems. This paper Proposes a Video Browsing Service(VBS) that provides both the video content retrieval and the video browsing by the real-time user interface on Web. For the scene segmentation and key frame extraction of video sequence, we proposes an efficient scene change detection method that combine the RGB color histogram with the X2 (Chi Square) histogram. Resulting key frames are linked by both physical and logical indexing. This system involves the video editing and retrieval function of a VCR's. Three elements that are the date, the need and the subject are used for video browsing. A Video Browsing Service is implemented with MySQL, PHP and JMF under Apache Web Server.

• The KIPS Transactions:PartD
• /
• v.11D no.4
• /
• pp.983-990
• /
• 2004

Multiple-count problem is occurred when rectangle objects span across several buckets. The CD histogram is a technique which selves this problem by keeping four sub-histograms corresponding to the four points of rectangle. Although It provides exact results with constant response time, there is still a considerable issue. Since it is based on a query window which aligns with a given grid, a number of errors nay be occurred when it is applied to real applications. In this paper, we propose selectivity estimation techniques using the generalized cumulative density histogram based on two probabilistic models : \circled1 probabilistic model which considers the query window area ratio, \circled2 probabilistic model which considers intersection area between a given grid and objects. Our method has the capability of eliminating an impact of the restriction on query window which the existing cumulative density histogram has. We experimented with real datasets to evaluate the proposed methods. Experimental results show that the proposed technique is superior to the existing selectivity estimation techniques. Furthermore, selectivity estimation technique based on probabilistic model considering the intersection area is very accurate(less than 5% errors) at 20% query window. The proposed techniques can be used to accurately quantify the selectivity of the spatial range query on rectangle objects.

• ETRI Journal
• /
• v.33 no.2
• /
• pp.219-229
• /
• 2011

In this paper, we propose a transformation scheme used to analyze online gaming traffic properties and develop a traffic model. We analyze the packet size and the inter departure time distributions of a popular first-person shooter game (Left 4 Dead) and a massively multiplayer online role-playing game (World of Warcraft) in order to compare them to the existing scheme. Recent online gaming traffic is erratically distributed, so it is very difficult to analyze. Therefore, our research focuses on a transformation scheme to obtain new smooth patterns from a messy dataset. It extracts relatively heavy-weighted density data and then transforms them into a corresponding dataset domain to obtain a simplified graph. We compare the analytical model histogram, the chi-square statistic, and the quantile-quantile plot of the proposed scheme to an existing scheme. The results show that the proposed scheme demonstrates a good fit in all parts. The chi-square statistic of our scheme for the Left 4 Dead packet size distribution is less than one ninth of the existing one when dealing with erratic traffic.

• Journal of Game and Entertainment
• /
• v.2 no.2
• /
• pp.45-50
• /
• 2006

In a face detection system based on template matching, histogram equalization or log transform is applied to an input image for the intensity normalization and the image improvement. It is known that they are noneffective in improving an image with intensity distortion by illumination variation. In this paper, we propose an efficient image improvement method called as a bilateral symmetry average for images with intensity distortion by illumination variation. Experimental results show that our method delivers the detection performance better than previous methods and also remarkably reduces the number of face candidates.

• Journal of Korea Water Resources Association
• /
• v.42 no.4
• /
• pp.355-363
• /
• 2009

The purpose of this paper is to investigate the influence of noise on chaotic time series. We used two time series of Lorenz system and of Great Salt Lake's volume data which are well known as chaotic systems. This study investigated the attractors, correlation dimensions, and Close Returns Plots and Close Returns Histograms of two time series to investigate the influence of noise as increasing noise level. We performed Chi-square test to the relative frequency of Close Returns Histogram from Close Returns Plot for the investigation of stochastic process of chaotic time series as increasing noise level of time series. As the results, two time series were changed from chaotic to stochastic series as noise level is increased. Finally, we analyzed the effect of noise cancellation by using Simple Moving Average method. The results of applications of Simple Moving Average method to Lorenz and GSL time series showed that we could effectively cancel the noise. Then we could confirm the applicability of Simple Moving Average method to cancel the noise for the hydrologic time series having chaotic characteristics.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.2
• /
• pp.1020-1042
• /
• 2019

Reversible data hiding in encrypted images (RDHEI) provides some real-time cloud applications; i.e. the cloud, acting as a data-hider, automatically embeds timestamp in the encrypted image uploaded by a content owner. Many existing methods of RDHEI only satisfy user privacy in which the data-hider does not know the original image, but leaks owner privacy in which the receiver can obtains the original image by decryption and extraction. In the literature, the method of Zhang et al. is the one providing weak content-owner privacy in which the content-owner and data-hider have to share a data-hiding key. In this paper, we take care of the stronger notion, called strong content-owner privacy, and achieve it by presenting a new reversible data hiding in encrypted images. In the proposed method, image decryption and message extraction are separately controlled by different types of keys, and thus such functionalities are decoupled to solve the privacy problem. At the technique level, the original image is segmented along a Hilbert filling curve. To keep image privacy, segments are transformed into an encrypted image by using random permutation. The encrypted image does not reveal significant information about the original one. Data embedment can be realized by using pixel histogram-style hiding, since this property, can be preserved before or after encryption. The proposed method is a modular method to compile some specific reversible data hiding to those in encrypted image with content owner privacy. Finally, our experimental results show that the image quality is 50.85dB when the averaged payload is 0.12bpp.