• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.04a
• /
• pp.1249-1252
• /
• 2011

최근 인터넷의 발달과 사용량의 증가로 데이터의 양이 급증하고 있다. 사용자들은 빠른 시간 내에 원하는 검색 결과를 얻기를 원한다. 또한 사용자 마다 모두 다른 선호도를 가지기 때문에 사용자 질의에 기반 하여 검색되어야 한다. 따라서 본 논문에서는 사용자 질의에 따라 빠른 시간 내에 효율적으로 List 기반의 접근법을 사용하여 top k 질의를 하는 기존의 연구를 소개 및 분석하고 문제점을 파악한다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.8
• /
• pp.3182-3202
• /
• 2015

Flexibly expanding the storage capacity required to process a large amount of rapidly increasing unstructured log data is difficult in a conventional computing environment. In addition, implementing a log processing system providing features that categorize and analyze unstructured log data is extremely difficult. To overcome such limitations, we propose and design a MongoDB-based unstructured log processing system (MdbULPS) for collecting, categorizing, and analyzing log data generated from banks. The proposed system includes a Hadoop-based analysis module for reliable parallel-distributed processing of massive log data. Furthermore, because the Hadoop distributed file system (HDFS) stores data by generating replicas of collected log data in block units, the proposed system offers automatic system recovery against system failures and data loss. Finally, by establishing a distributed database using the NoSQL-based MongoDB, the proposed system provides methods of effectively processing unstructured log data. To evaluate the proposed system, we conducted three different performance tests on a local test bed including twelve nodes: comparing our system with a MySQL-based approach, comparing it with an Hbase-based approach, and changing the chunk size option. From the experiments, we found that our system showed better performance in processing unstructured log data.

• Proceedings of the Korea Multimedia Society Conference
• /
• 2004.05a
• /
• pp.326-329
• /
• 2004

Content adaptation is an effective solution to support the quality of service over multimedia services over heterogeneous environments. This paper deals with the accuracy and the real-time requirement, two important issues in making decision on content adaptation. From our previous problem formulation, we propose an optimal algorithm and a fast approximation based on the Viterbi algorithm of dynamic programming. Through extensive experiments, we show that the proposed algorithms can enable accurate adaptation decisions, and especially they can support the real-time processing.

• Journal of the Korean Professional Engineers Association
• /
• v.29 no.5
• /
• pp.99-103
• /
• 1996

In this paper we discuss Gigabit information communication service utilizing Gigabit information super-highway, multimedia data processing technology for the services, multimedia communication protocol for transmitting multimedia data and construction of Gigabit information communication network which can be accessed everywhere and present items which should be tactically prepared for high-level information society of the 21 st century.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.11
• /
• pp.2797-2808
• /
• 1998

Multimedia scenario database system is a read-only multimedia-on-demand system which transfers scenarios representing the display ordering of multimedia objects. A scenario is a graph of multimedia objects and it contains spatial, temporal and contextual information of multimedia data. By structuring multimedia objects as a scenario, it is possible to enforce their display order based on their context. Furthermore, it can provide multiple display paths as well as the sharing of objects between different scenarios. As a result, the multimedia scenario database system can perform the pre-scheduling of multimedia objects, which makes it possible to reorder the transmission order of objects in a scenario. Consequently, the overall system resource such as data buffer and network bandwidth can be highly utilized. In this paper, we discuss the requirements of structuring a scenario to design a scenario database that stores and manages multimedia scenario. Furthermore, we devise and analyze several scheduling policies based on the reordering mechanism for the objects in a scenario.

• Proceedings of the Korean Information Science Society Conference
• /
• 2007.06c
• /
• pp.454-459
• /
• 2007

최근 다양한 형태의 멀티미디어의 확산과 영상에 대한 관심이 높아짐에 따라 필름 복원은 많은 사람들로부터 관심을 받고 있는 연구 분야다. 본 논문에서는 스크래치 텍스처 및 형태 특성을 이용하여 모든 종류의 스크래치를 자동으로 검출하고 복원 할 수 있는 방법을 제안한다. 제안된 방법은 손상된 필름에서 자주 발생되는 스크래치의 공간적인 정보를 이용하여 텍스처 분류기와 형태 필터링을 통해 스크래치를 검출 하고, 양선형 보간법을 사용하여 손상된 필름 영역을 주변 픽셀 값을 이용하여 스크래치를 제거 함으로써 영상을 복원한다. 본 논문에서 제안된 방법은 Kokaram의 논문에 제안된 방법보다 다양한 종류의 스크래치를 정확하게 인식하며, 적은 계산 비용임에도 불구하고 양선형 보간법은 스크래치 영역을 제거한다.

• IE interfaces
• /
• v.17 no.1
• /
• pp.121-127
• /
• 2004

In this paper, we present the base station(BS) processing capacity to provide the multimedia services in IMT-2000 wireless communication network. The IMT-2000 services are classified into two types, circuit and packet services, and user‘s environments such as indoor, pedestrian and vehicle are considered. Using the parameters of service economics and wireless technology, the user's reference traffic and BS‘s traffic are computed. The traffic is measured by throughput(kbps). Based on the measured traffic, the accommodating users in BS are also evaluated. In addition to, the BS design capacity is presented for varying the number of users and traffic distribution in different user's environments.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2014.11a
• /
• pp.39-40
• /
• 2014

카메라를 갖춘 모바일 기기가 보편화되면서 모바일 환경에서 영상처리를 이용한 다양한 응용이 확산되고 있다. 영상은 다른 정보에 비해 데이터의 양이 비교적 방대하기 때문에 모바일 환경에서 영상처리를 수행하기 위해서는 처리속도, 전력, 발열 등의 물리적 제약조건이 존재할 수 있다. 본 논문에서는 이러한 문제를 극복하기 위해 모바일 기기에서 코프로세서인 임베디드 GPU(Graphic Processing Unit)를 이용한 영상처리의 고속화 방법을 제시한다. 실험에서는 보편적으로 활용되는 영상처리 알고리즘에 대해 CPU(Central Processing Unit) 및 GPU 각각에서의 성능을 비교함으로써 고속화 방법의 우수성을 검증하고 특징을 분석하였다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2015.07a
• /
• pp.5-6
• /
• 2015

본 논문에서는 Matlab 공개 toolbox 인 k-wave 를 사용하여 실내 음향 파라미터를 측정하는 방법을 제시한다. 첫째, 본 논문에서 제시한 k-wave 를 이용한 방법의 유효성을 검증하기 위해, k-wave 로 얻은 실험값과 [1]에서 제시한 실제 실내에서 마이크를 통하여 측정된 값을 비교하였다. 그 결과 k-wave 를 사용하였을 때 잔향 시간은 [1]과 매우 유사하게 측정이 되었고 $D_{50}$ 값의 오차는 평균 5.2%로 측정되었다. 따라서 k-wave 를 이용하면 실제 측정값을 대체할 수 있는 양호한 결과를 얻을 수 있었다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2016.10a
• /
• pp.681-682
• /
• 2016

In this study we propose a novel approach to segment a terrain in two parts: ground and none-ground. The terrain is gained by a multi-channel 3D laser range sensor. We process each vertical line in each frame data. The vertical line is bounded by the sensor's position and a point in the largest circle of the frame. We consider each pair of two consecutive points in each line to find begin-ground and end-ground points. All points placed between a begin-ground point and an end-ground point are ground ones. The other points are none-ground. After examining all vertical lines in the frame, we obtain the terrain segmentation result.