• Proceedings of the Korea Society for Industrial Systems Conference
• /
• 2004.06a
• /
• pp.55-60
• /
• 2004

XML 문서의 관계형 데이터베이스로의 맵핑과. 데이터베이스의 성능을 향상시키기 위한 방안으로 내용질의와 함께 XML 문서의 특성을 활용한 구조 검색 질의를 하기 위한 효율적인 색인 모델을 제안한다. 내용 색인과 구조 색인, 애트리뷰트 색인을 각각 구성하여 내용과 구조가 혼합된 효율적인 검색이 가능하도록 하였다. 검색의 효율성을 위해 노드 간의 위치 정보와 함께 독립적인 ID를 부여하여 경로테이블을 생성하여 질의의 효율을 높인다.

• Proceedings of the Korean Institute of Surface Engineering Conference
• /
• 2009.10a
• /
• pp.227-228
• /
• 2009

플라즈마 공정 중에 플라즈마는 공정조건에 따라 다양한 빛을 발산하며, 이를 플라즈마 감시에 활용할 수 있다. 본 연구에서는 반도체 공정 중에서 발생하는 플라즈마의 색상 정보 (X, Y, Tc)를 수집했다. 그리고 공정 조건 중 소스파워와 바이어스파워의 값을 다양하게 변화시키면서 색 정보의 민감도를 비교, 분석하였다. 소스와 바이어스 파워의 변화에 대해 색 정보는 반대의 경향을 보였다. 또한 소스 파워의 경우 X, 그리고 바이어스 파워의 경우 Tc가 효과적인 감시 변수임을 확인하였다.

• Journal of Korea Multimedia Society
• /
• v.12 no.10
• /
• pp.1499-1507
• /
• 2009

With the abundance of digital contents, the necessity of precise indexing technology is consistently required. To meet these requirements, the intelligent software entity needs to be the subject of information retrieval and the interoperability among intelligent entities including human must be supported. In this paper, we analyze the unifying framework for multi-modality indexing that Snoek and Worring proposed. Our work investigates the method of improving the authenticity of indexing information in contents-based automated indexing techniques. It supports the creation and control of abstracted high-level indexing information through ontological concepts of Semantic Web skills. Moreover, it attempts to present the fundamental model that allows interoperability between human and machine and between machine and machine. The memory-residence model of processing ontology is inappropriate in order to take-in an enormous amount of indexing information. The use of ontology repository and inference engine is required for consistent retrieval and reasoning of logically expressed knowledge. Our work presents an experiment for storing and retrieving the designed knowledge by using the Minerva ontology repository, which demonstrates satisfied techniques and efficient requirements. At last, the efficient indexing possibility with related research is also considered.

• Journal of Broadcast Engineering
• /
• v.19 no.6
• /
• pp.877-895
• /
• 2014

It is common sense that providing specific odor can increase the video reality when video scene has an object having specific odor. However, people still do not know how to increase video reality and emotional immersion when there is no information on specific odor in the scene. So, present study explores how we improve video reality and immersion when the scene has no concrete odor information from some objects. Especially, this research focuses on diverse previous studies about matching between odor and color and then we expect providing odor can increase video reality if the odor is well-matched with the video's color. To do this, we collected 48 odors and investigated which color was well-matched with each odor. As a result, we get 5 odors which had clearly well-matched colors and decide ill-matched colors of those 5 odors as complementary colors of well-matched colors (Experiment 1). After that, we organize 3 conditions such as coloring image and video clip with well-matched color (color-odor match condition), coloring those with ill-matched color (color-odor mismatch condition), and coloring those with achromatic color by removing color saturation (color-odor neutral condition). Under each of these three conditions, image-odor matching, increment of reality with the odor, increment of immersion with the odor, and odor preference are asked (Experiment 2; 3). The results showed that the scores of all 4 questions in color-odor match condition were higher than color-odor mismatch condition and neutral condition. These results mean that providing matching odor with the scene's color in video is very effective to increase video reality and immersion. We expect experiencing better reality and immersion with olfactory information by adding various future research.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2008.11a
• /
• pp.207-210
• /
• 2008

채색화는 흑백 영상에 색 정보를 추가하거나 영상의 색을 변환하는 영상 개선 기법이다. 본 연구는 최소한의 사용자 개입을 통해 흑백 영상을 자연스러운 칼라 (color) 영상으로 전환하는 채색화 기법을 제안한다. 우리는 우선 자연스러운 채색 결과를 위한 채색화 함수를 정의한다. 제안하는 채색화 함수는 유사한 밝기 정보를 가지는 이웃 픽셀들은 비슷한 색 정보를 가질 확률이 높다는 간단한 가정 하에 MRF (Markov Random Field)에 기반하여 모델링한다. 채색화 함수에 의해 색이 전체적으로 자연스럽게 분포될 수 있도록, 확산 신뢰도를 정의한 후 신뢰도에 따라 채색 순서를 결정한다. 이후, 채색 순서에 따라 각 픽셀에 채색화 함수를 적용하여 자연스러운 채색 결과를 도출한다. 실험 결과에서 보듯이, 제안 기법은 적은 색상 정보의 입력을 통해 효과적으로 채색화 하며, 기존 기법에 비해 자연스러운 결과를 제시한다.

• Proceedings of the Korea Institute of Convergence Signal Processing
• /
• 2003.06a
• /
• pp.118-121
• /
• 2003

본 논문은 동영상 압축 부호화에 대한 표준안인 MPEG기반의 압축 비디오 stream에서［1, 2］, 질의 영상에 대한 효율적인 검색 기법을 제안한다. 비디오 검색은 높은 차원의 색인 정보를 이용하는데, 높은 차원의 data set을 색인 정보로 하여 효율적인 검색 능력을 보여주는 KD-Trees(K Dimensional-Trees)알고리즘［3］을 비디오 검색기법에 적용하고자 한다. 먼저, key frame에 PCA (Principal Component Analysis) 알고리즘［4］을 이용하여 색인 정보를 추출한 다음, 추출된 색인 정보를 KD-Trees에 적용하여 효율적인 검색을 가능하게 한다. 실험 결과, 기존의 검색 기법보다 상당한 양의 처리 시간과 메모리 공간을 줄일 수 있음을 보였다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2011.05a
• /
• pp.615-616
• /
• 2011

There are many colors in the world, the colors can always send any signal or sign to humans. This paper find out color preference and hunam character. Humans unconsciously react to the colors and are affected be the color. These colors give humans a very large effect and impacrt. Seeing colors, we are look up or sinking and lighter or better of atmosphere. In other words, a man gets a message of color from the light. If you accept the message by recognizing and self-awareness, you can see the general meaning of the color, and you can know how to use color more effectively.

• Journal of the Korea Society of Computer and Information
• /
• v.15 no.1
• /
• pp.103-109
• /
• 2010

As color was used for formative language since a human activity was beginning, all the symptoms in the world that the human eye can see is present. In this paper, we identify Korea traditional color harmony for extracted key frames from scene change detection. Traditional color is classified as 5-Jung-color and 5-Kan-color, and determine whether to harmony. Red, blue, yellow, black, and white, called 5-Jung-color and pink, blue, purple, sulfur, and green, called the 5-Kan-color was identified. First, we extract edge using Canny algorithm. And, we are labeling and clustering colors around the edge. Finally, we identify the traditional color using identification method of traditional color harmony. The proposed study in this paper has been proven through experiments.

• Journal of Korean Library and Information Science Society
• /
• v.36 no.2
• /
• pp.327-348
• /
• 2005

The purpose of this study is to emphasize the importance of index definition and to prepare the basis of optimal index in bibliographic retrieval system. For the purpose, this research studied a index extraction theory on index tag definition and index normalization from the bibliographic marc database and analyzed a retrieval utilization rate of extracted index. In this experiment, we divided index between text-type and code-type about the generated 29,219,853 indexes from 2,200,488 bibliographic records and analyzed utilization rate by the comparison of index-type and index term of web logs. According to the result, the text-type indexes such as title, author, publication, subject are showed high utilization rate while the code-type indexes were showed low utilization rate. So this study suggests that the unused index is removed from index definition to optimize index.

• The KIPS Transactions:PartD
• /
• v.13D no.4 s.107
• /
• pp.477-490
• /
• 2006

Existing index structures need very much update cost because they repeat delete and insert operations in order to update continuously moving objects. In this paper, we propose a new index structure which reduces the update cost of continuously moving objects. The proposed index structure consists of a space partitioning index structure that stores the location of the moving objects and an auxiliary index structure that directly accesses to their current positions. In order to increase the fanout of the node, it stores not the real partitioning area but kd-tree as the information about the child node of the node. In addition, we don't traverse a whole index structure, but access the leaf nodes directly and accomplish a bottom-up update strategy for efficiently updating the positions of moving objects. We show through the various experiments that our index structure outperforms the existing index structures in terms of insertion, update and retrieval.