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

3D 방송서비스를 위해 다양한 방식이 제안되어 왔으며 최근에는 주파수 효율성을 극대화한 방식인 고정 및 이동 방송 융합형 3DTV 방송 방식이 북미 표준으로 채택되었다. 고정 및 이동 방송 융합형 3DTV 방송 방식은 기존의 고정 방송 및 이동 방송망을 활용하여 좌안 영상과 우안 영상 스트림을 전송하는 방식이며, 3D 방송서비스 제공을 위해 별도의 주파수 할당을 할 필요가 없으므로 높은 주파수 효율성을 제공할 수 있다. 본 논문에서는 ATSC의 고정 및 이동 방송 규격과 DVB T2의 고정 및 이동 방송 규격의 차이를 시그널링 정보 전송 관점에서 분석하고 고정 및 이동 방송 융합형 3DTV 서비스를 DVB T2 방송환경에서 제공하기 위한 시그널링 방식을 제안한다.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.11a
• /
• pp.211-215
• /
• 2012

증강방송 서비스란 방송망과 인터넷망을 연동하는 하이브리드 방송(Hybrid Broadcasting) 환경 하에서 실제 환경과 같은 현실감 있는 증강방송 콘텐츠를 다운로드 받아 서비스를 제공하는 양방향 콘텐츠 서비스를 의미한다. 또한 국제 표준화 회의 MPEG에서는 증강 방송 서비스를 위해 객체 활성화 기술인 MPEG-4 BIFS(BInary Format for Scenes)[1]의 확장으로 증강현실 어플리케이션 포맷 표준기술을 제정중이다. 하지만 본 기술은 현 방송 시스템의 환경에서는 구현하기 어려운 상황이며, 현재 각 단말의 호환성을 고려하면 상용화에 어려움이 따른다. 따라서 본 논문에서는 기존 지상파 방송 시스템인 MPEG-2 SYSTEM: Transport Stream[2]을 활용하여 증강방송 콘텐츠와 현재 방송스트림 과의 동기화를 가능하게 하는 메카니즘을 제안하려 한다.

• Annual Conference of KIPS
• /
• 2004.11a
• /
• pp.157-160
• /
• 2004

디지털 방송 환경에서 메타데이터 서비스가 가장 주목 받고 있는 기술 중 하나이다. 그리고 컨텐트의 주요 장면만을 나타내는 하이라이트 메타데이터 서비스가 가장 혁신적이다. 계층 구조화된 하이라이트 메타데이터는 시청자가 다양한 관점(viewpoint)에서 방송을 시청할 수 있으며, 스포츠 경기의 하이라이트 장면만 선택적으로 볼 수 있는 서비스를 제공 한다. 하이라이트 메타데이터 서비스를 제공 하기 위해서는 실시간 하이라이트 메타데이터를 생성 하는 기법이 필요하다. 본 논문에서는 실시간 하이라이트 메타 데이터를 생성할 수 있는 두 가지 색인 단계를 정의하고, 시청자의 STB(Set-top Box) 저장된 디지털 스트림과 방송시간과의 동기화 방법을 제안한다. 그리고 하이라이트 정보를 MPEG-7 표준 스키마의 xml로 서술방법을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.10a
• /
• pp.372-376
• /
• 2006

본 논문에서는 홈 내에서 헬스케어 상황정보 서비스를 제공하기 위한 모바일 프락시에 대해 기술한다. 모바일 프락시는 헬스케어 홈 서비스의 목적에 따라 분산자원의 통합 및 맞춤형 관리모델인 분산객체그룹 프레임워크를 기반으로 한다. 모바일 프락시의 주요 기능은 이동성을 지원 및 멀티미디어 스트림 동기화 그리고 그룹통신 지원한다. 특히, 클라이언트의 가용환경에 따라 수행객체에 대한 이동성을 제공한다. 이를 기반으로 헬스케어 상황정보 서비스를 제공하기 위해 사용되는 상황정보는 거주자의 위치, 홈 내에 설치된 센서/기기로부터 수집된 위치, 건강 그리고 쾌적환경 정보를 포함한다. 또한 헬스케어 상황정보 서비스를 위한 응용객체, 자원들의 그룹관리 지원 DOGF를 기반으로 이동성 지원 컴포넌트인 모바일프락시는 거주자 위치이동에 따라 적합한 헬스케어 상황정보 서비스를 제공한다. 모바일프락시를 이용한 헬스케어 상황정보 서비스는 헬스케어 지원 음악치료, 원격상담 서비스와 처방 주의 및 스케줄 알림서비스를 구현했다. 끝으로 제안한 환경에서 거주자의 위치, 시간 및 상황인식에 따라 구현하여 수행한 헬스케어 상황정보 서비스 결과를 보였다.

• KIPS Transactions on Software and Data Engineering
• /
• v.5 no.4
• /
• pp.171-180
• /
• 2016

As social networking services such as twitter become increasingly popular, data streams are widely prevalent these days. In order to search data accumulated from data streams efficiently, the use of an index structure is essential. In this paper, we propose an update-efficient, disk-based inverted index structure for efficient keyword search on data streams. When new data arrive at the data stream, the index needs to be updated to incorporate the new data. The traditional inverted index is very inefficient to update in terms of disk I/O, because all index data stored in the disk need to be read and written to the disk each time the index is updated. To solve this problem, we divide the whole inverted index into a sequence of inverted indices with exponentially increasing size. When new data arrives, it is first inserted into the smallest index and, later, the small indices are merged with the larger indices, which leads to a small amortize update cost for each new data. Furthermore, when indices stored in the disk are merged with each other, we minimize the disk I/O cost incurred for the merge operation, resulting in an even smaller update cost. Through various experiments, we compare the update efficiency of the proposed index structure with the previous one, and show the performance advantage of the proposed structure in terms of the update cost.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.8 no.5
• /
• pp.159-166
• /
• 2008

Recently, according to the rapid development of location positioning technology and wireless communications technology and increasement of usage of moving object data, many researches and developments on the real-time locating systems which provides real time service of moving object data stream are under proceeding. However, MO (Moving Object) DBMS used based system in the in these systems is the inefficient management of moving object data streams, and the existing DSMS (Data Stream Management System) has problems that spatio-temporal data are not handled efficiently. Therefore, in this thesis, we designed and implemented spatio-temporal DSMS for efficient real-time management of moving object data stream. This thesis implemented spatio-temporal DSMS based STREAM (STanford stREam dAta Manager) of Stanford University is supporting real-time management of moving object data stream and spatio-temproal query processing and filtering for reduce the input loading. Specifically, spatio-temporal operators of the spatio-temporal DSMS support standard interface of SQL form which extended "Simple Feature Specification for SQL" standard specifications presented by OGC for compatibility. Finally, implemented spatio-temporal DSMS in this thesis, proved the effectiveness of the system that as applied real-time monitoring areas that require real-time locating of object data stream DSMS.

• Journal of Internet Computing and Services
• /
• v.17 no.6
• /
• pp.53-59
• /
• 2016

Recently, huge stream data have been generated in real time from various applications such as wireless sensor networks, Internet of Things services, and social network services. For this reason, to develop an efficient method have become one of significant issues in order to discover useful information from such data by processing and analyzing them and employing the information for better decision making. Since stream data are generated continuously and rapidly, there is a need to deal with them through the minimum access. In addition, an appropriate method is required to analyze stream data in resource limited environments where fast processing with low power consumption is necessary. To address this issue, the sliding window model has been proposed and researched. Meanwhile, one of data mining techniques for finding meaningful information from huge data, pattern mining extracts such information in pattern forms. Frequency-based traditional pattern mining can process only binary databases and treats items in the databases with the same importance. As a result, frequent pattern mining has a disadvantage that cannot reflect characteristics of real databases although it has played an essential role in the data mining field. From this aspect, high utility pattern mining has suggested for discovering more meaningful information from non-binary databases with the consideration of the characteristics and relative importance of items. General high utility pattern mining methods for static databases, however, are not suitable for handling stream data. To address this issue, sliding window based high utility pattern mining has been proposed for finding significant information from stream data in resource limited environments by considering their characteristics and processing them efficiently. In this paper, we conduct various experiments with datasets for performance evaluation of sliding window based high utility pattern mining algorithms and analyze experimental results, through which we study their characteristics and direction of improvement.

• Journal of KIISE:Software and Applications
• /
• v.35 no.4
• /
• pp.207-218
• /
• 2008

With the growth of the Internet, multimedia streaming becomes an important means to deliver video contents over the Internet and the amount of the streaming multimedia contents is also getting increased. However, it becomes difficult to guarantee the quality of service in real-time over the IP network environment with instantaneously varying bandwidth. In this paper, we propose an optimal adaptation framework for streaming contents over the Internet in the sense that the perceptual quality of the multi-angie content with multiple visual objects is maximized given the constraints such as available bandwidth and transcoding cost. In the multi-angle video service framework, the user can select his/her preferred alternate views among the given multiple video streams captured at different view angles for a same event. This enhanced experience often entails streaming problems in real-time over the network, such as instantaneous bandwidth changes in the Internet. In order to cope with this problem, we assume that multi-angle video contents are encoded at different bitrates and the appropriate video streams are then selected or transcoded for delivery to meet such bandwidth constraints. For the user selective consumption of the various bitstreams in the multi-angle video service, the bitstream in each angle can be encoded in various bitrate, and the user can select a sub-bitrstream in the given bitrstreams or transcode the corresponding content in order to deliver the optimally adapted video contents to the instantaneously changing network condition. Therefore, we define the transcoding cost which means the time taken for transcoding the video stream and formulate a unified optimization framework which maximizes the perceptual quality of the multiple video objects in the given constraints such as the transcoding cost and the network bandwidth. Finally, we present plenty of the experimental results to show the effectiveness of the proposed method.

• The KIPS Transactions:PartA
• /
• v.13A no.2 s.99
• /
• pp.111-122
• /
• 2006

As VOD service over the Internet becomes popular, a large sealable VOD system in P2P streaming environment has become increasing important. In this paper, we propose a new proxy caching scheme, called P2Proxy, to replace the traditional proxy with a sealable P2P proxy in P2P streaming environment. In the proposed scheme, each client in a group stores a different part of the stream from a server into its local buffer and then uses a group of clients as a proxy. Each client receives the request stream from other clients as long as the parts of the stream are available in the client group. The only missing parts of the stream which are not in the client group are directly received from the server. We represent the caching process between clients in a group and a server and then describe a group creation process. This paper proposes the directory structure to share the caching information among clients. By using the directory information, we minimize message exchange overload for a stream caching and playing. We also propose a recovery method for failures about the irregular behavior of P2P clients. In this paper, we evaluate the performance of our proposed scheme and compare the performance with the existing P2P streaming systems.

• Journal of Korea Multimedia Society
• /
• v.11 no.5
• /
• pp.685-691
• /
• 2008

Recently with the rapid evolution of the mobile computing and communication technologies, mobile VOD service becomes increasingly important for wireless mobile users. The VOD service is being widely used in various areas of application, such as education, entertainment and business, because it provides users convenience in easily having access to video information at any time in any places. However, in reality, the mobile system has many difficulties in providing the smooth VOD service owing to frequent transfers and cutoffs of clients. The importance of a technique to transmit broadcasting is being stressed as a method for providing stabler mobile VOD service to a large number of clients. This paper is aimed at showing how to reduce demands for server bandwidth and delay of earlier service through performance analysis by suggesting an effective VOD broadcasting transmission technique through channel division in the mobile atmosphere. Many researches have been made about regular broadcasting techniques in particular. This study divides the methods used for assigning channels which have been decided by the size of segments into a group of regular channels and assistant channels using wireless gap-fillers to provide effective VOD services to a large number of clients at the mobile environment using small bandwidth resources. The regular channels transfer regular streams, while assistant channels repeatedly transfer the first segment to reduce early service delay time to receive regular streams. In this way, the study suggests a technique to reduce server bandwidth demand and early service delay time. Through the proposed technique, the server bandwidth demand could be reduced by more than 30 percent and the study continuously shows reduced early service delay time through conducting performance analysis.