• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.7
• /
• pp.1399-1404
• /
• 2004

The development of computer technology and the advancement of the technology of information and communications spread the technology of multimedia and increased the use of multimedia data with large capacity. Users can grasp the overall video data and they are able to play wanted video back. To grasp the overall video data it is necessary to offer the list of summarized video data information. In order to search video efficiently an index process of video data is essential and it is also indispensable skill. Therefore, this thesis suggested the effective method about the cut detection of frames which will become a basis of an index based on contents of video image data. This suggested method was detected as the unchanging pixel rotor intelligence value, classified into diagonal direction. Pixel value of color detected in each frame of video data is stored as A(i, i) matrix - i is the number of frames, i is an image height of frame. By using the stored pixel value as the method of UE(Mean Square Error) I calculated a specified value difference between frames and detected cut quickly and exactly in case it is bigger than threshold value set in advance. To carry out an experiment on the cut detection of lames comprehensively, 1 experimented on many kinds of video, analyzing and comparing efficiency of the cut detection system.

• Journal of Korea Multimedia Society
• /
• v.12 no.3
• /
• pp.427-435
• /
• 2009

Users are able to search and read interesting items and hence click hyperlink linked to the item which is detailed content unit such as menu, login, news, video, etc. Small screen like mobile device is very difficult to viewing all web contents at once. Browsing and searching for interesting items by scrolling to left and right or up and down is discomfort to users in small screen. Searching and displaying directly the item preferred by users can reduces difficulty of interface manipulation of mobile device. To archive it, web contents based on desktop will be segmented on a per-item basis which component unit of web contents. Most segment algorithms are based on segment method through analysis of HTML code or mobile size. However, it is difficult to extract item blocks. Because present web content is getting more complicated and diversified in structure and content like web portal services. A web content segment algorithm suggested in this paper is based on extracting item blocks is component units of web contents.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10d
• /
• pp.750-753
• /
• 2006

e-Learning 분야는 정부, 기업, 학교 등 많은 조직에서 교육을 위한 수단으로 사용되어지고 있다. 이러한 e-Learning은 독립적인 운영플렛폼의 개발부터 웹 기반의 코스웨어(Courseware)까지 발전해왔다. 코스웨어는 컴퓨터 전달 체제를 통하여 교수-학습 과정을 촉진시켜 명시된 교수 목표 하에 학습자의 지식과 기능의 바람직한 변화를 목적으로 설계 및 개발된 교육용 소프트웨어와 데이터라고 할 수 있다. 또한 컴퓨터 언어 및 저작도구(Authoring Tools)를 이용하여 각 과목별 교육내용을 음성, 그림, 애니메이션, 동영상 등의 다양한 형태로 제시될 수 있도록 저작된 프로그램으로 주로 눈으로 보고 귀로 들으면서 학습하는 유형이다. 현재 코스웨어에서 제공되는 정보는 학습에 대한 정보와 교수정보 그리고 Client의 학습 진행 상황 등을 제공한다. 하지만 학습에 연관된 다른 학습이나 학습에 관련된 교수들의 전공정보, 또한 학습에 관련된 어플리케이션 등을 검색하려 할 때는 하나하나 따로 검색을 해야 하는 어려움이 따른다. 본 논문에서는 이러한 문제점을 해결하기 위하여 학습에 대한 목적과 관련학습, 관련교수, 관련연구, 관련 어플리케이션 등의 연관성을 토픽맵(TopicMap)을 이용하여 학습에 대한 더 정확한 정보를 쉽게 검색할 수 있게 한다. Client가 찾으려는 토픽을 중심으로 연관된 토픽과 카테고리를 나열하여 수작업으로 인한 검색시간과 잘못된 키워드 검색을 해결하였다.

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.133-136
• /
• 2001

Numerous challenges have been made to retrieve video using the contents. Recently MPEG-7 had set up a set of visual descriptors for such purpose of searching and retrieving multimedia data. Among them, color and motion descriptors are employed to develop a content-based video retrieval system to search for videos that have similar characteristics in terms of color and motion features of the video sequence. In this paper, the performance of the proposed system is analyzed and evaluated. Experimental results indicate that the processing time required for a retrieval using MPEG-7 descriptors is relatively short at the expense of the retrieval accuracy.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.3
• /
• pp.289-300
• /
• 2010

Recently, diverse information which are location, call history, SMS history, photographs, and video can be collected constantly from mobile devices such as cellular phone, smart phone, and PDA. There are many researchers who study services for searching and abstraction of personal daily life with contextual information in mobile environment. In this paper, we introduce MyLifeBrowser which is developed in our previous work. Also, we explain LPS and correction of GPS coordinates as extensions of previous work and show LPS performance test and evaluate the performance of expanded keywords. MyLifeBrowser which provides searching personal information in mobile device and support of detecting related information according to a fragmentary keyword and common knowledge in ConceptNet. It supports the functionality of searching related locations using Bayesian network that is designed by the authors. In our experiment, we visualize real data through MyLifeBrowser and show the feasibility of LPS server and expanded keywords using both Bayesian network and ConceptNet.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.5 no.2
• /
• pp.54-68
• /
• 2002

In this paper, We propose a multi-dimensional index structure, called a VA (vector approximate) -tree that constructs a tree with vector approximates of multi-dimensional feature vectors. To save storage space for index structures, the VA-tree employs vector approximation concepts of VA-file that presents feature vectors with much smaller number of bits than original value. Since the VA-tree is a tree structure, it does not suffer from performance degradation owing to the increase of data. Also, even though the VA-tree is MBR Minimum Bounding Region) based tree structure like a R-tree, its split algorithm never allows overlap between MBRs. We show through various experiments that our proposed VA-tree is the efficient index structure for large amount of multi-dimensional data.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.9
• /
• pp.2305-2310
• /
• 1999

Histogram-based methods have been used generally for retrieving an image to be searched in the video database. In this paper, we present an algorithm to retrieve an image incorporating the HVS. Comparing the performance of the previous algorithm with that of the proposed one, the new and better algorithm is proposed than the previous algorithm.

• Korean Journal of Remote Sensing
• /
• v.23 no.2
• /
• pp.125-130
• /
• 2007

This paper introduce a satellite image based blog system built by JeonNam local province. Main goals of this system are as follows : (1)Overcome the static aspect of traditional Web-GIS, (2)Providing a geoUCC generating platform by combining multimedia technology and GIS in a single web environment, (3)Building a two-way Web-GIS through user's participation, (4)Creating a new communicative way between government and citizen by using this system. As a result of the system building, this system enables users to create his/her own UCC(User Created Contents) on high-resolution satellite image and enables users to share his/her own UCC with other system using Web2.0 technology.

• The KIPS Transactions:PartB
• /
• v.9B no.3
• /
• pp.293-302
• /
• 2002

Gradual scene change detection is known as more difficult problem then abrupt scene change detection on video data analysis for contents based retrieval. In this paper, we present a new method for scene change detection far both abrupt and gradual change using the variable dynamic threshold arid cut frame difference (CFD). For this, We present the characteristics arid mathematical models of gradual transitions anti then, how can be detected by the CFD. And also we present new scene change detection algorithm based on cut frame difference. By the experimental result using real world video data indicate that the proposed method detect various scene changes both abrupt and gradual change efficiently without time-consuming computation and any dependency on a kind of gradual change effects.

• 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.