• Title/Summary/Keyword: Streaming system

Search Result 679, Processing Time 0.027 seconds

TPEG Application as a Protocol of Traffic Information for DMB in Korea (TPEG의 국내 DMB 교통정보 전송형식 적용 가능성 연구)

  • Hyun Cheol-Seung;Han Won-Sub;Kim Dong-Hyo;Hong You-Sik
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.43 no.9 s.351
    • /
    • pp.128-134
    • /
    • 2006
  • Traffic information protocol in DMB is very different from existing analog broadcasting and wireless communication network. In this paper, we examined whether traffic information protocol of Europe Broadcasting Union(TPEG) is applicable to domestic DMB. Also, we proposed a division of classification on kinds of franc information, and related data that it is required to transmit traffic information of TPEG form. We composed of experiment equipment and studied whether is expressed traffic informations as like accident, event, traffic condition and CCTV image on car navigation system. The results obtained it can be given expression to phrases from TPEG streaming data and to link with electronics map by decoding TPEG straming data. Also it can be expressed CCTV and graphic image which is composed of TPEG form.

A video transmission system for a high quality and fault tolerance based on multiple paths using TCP/IP (다중 경로를 이용한 TCP/IP 기반 고품질 및 고장 감내 비디오 전송 시스템)

  • Kim, Nam-Su;Lee, Jong-Yeol;Pyun, Kihyun
    • Journal of Internet Computing and Services
    • /
    • v.15 no.6
    • /
    • pp.1-8
    • /
    • 2014
  • As the e-learning spreads widely and demands on the internet video service, transmitting video data for many users over the Internet becomes popular. To satisfy this needs, the traditional approach uses a tree structure that uses the video server as the root node. However, this approach has the danger of stopping the video service even when one of the nodes along the path has a some problem. In this paper, we propose a video-on-demand service that uses multiple paths. We add new paths for backup and speed up for transmitting the video data. We show by simulation experiments that our approach provides a high-quality of video service.

Fabrication of smart alarm service system using a tiny flame detection sensor based on a Raspberry Pi (라즈베리파이 기반 미소 불꽃 감지를 이용한 스마트 경보 서비스 시스템 구현)

  • Lee, Young-Min;Sohn, Kyung-Rak
    • Journal of Advanced Marine Engineering and Technology
    • /
    • v.39 no.9
    • /
    • pp.953-958
    • /
    • 2015
  • Raspberry Pi is a credit card-sized computer with support for a large number of input and output peripherals. This makes it the perfect platform for interaction with many different devices and for usage in a wide range of applications. When combined with Wi-Fi, it can communicate remotely, therefore increasing its suitability for the construction of wireless sensor nodes. In addition, data processing and decision-making can be based on artificial intelligence, what is performed in developed testbed on the example of monitoring and determining the confidence of fire. In this paper, we demonstrated the usage of Raspberry Pi as a sensor web node for fire-safety monitoring in a building. When the UV-flame sensors detect a flame as thin as that of a candle, the Raspberry Pi sends a push-message to notify the assigned smartphone of the on-site situation through the GCM server. A mobile app was developed to provide a real-time video streaming service in order to determine a false alarm. If an emergency occurs, one can immediately call for help.

A Scheme for Push/Pull Buffer Management in the Multimedia Communication Environments (멀티미디어 통신 환경에서 Push/Pull 버퍼 관리 기법)

  • Jeong, Chan-Gyun;Lee, Seung-Ryong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.2S
    • /
    • pp.721-732
    • /
    • 2000
  • Multimedia communication systems require not only high-performance computer hardwares and high-speed networks, but also a buffer management mechanism to process many data efficiently. Two buffer handling methods, Push and Pull, are commonly used. In the Push method, a server controls the flow of dat to a client, while in the Pull method, a client controls the flow of data from a server. Those buffering schemes can be applied to the data transfer between the packet receiving buffer, which receives media data from a network server, and media playout devices, which play the recived media data. However, the buffer management mechanism in client-sides mainly support either one of the Push or the Pull method. Consequently, they have some limitations to support various media playout devices. Futhermore, even though some of them support both methods, it is difficult to use since they can't provide a unified structure. To resolved these problems, in this paper, we propose an efficient and flexible Push/Pull buffer management mechanism at client-side. The proposed buffer management scheme supports both Push and Pull method to provide various media playout devices and to support buffering function to absorb network jitter. The proposed scheme can support the various media playback devices using a single buffer space which in consequence, saves memory space compared to the case that a client keeps tow types of buffers. Moreover, it facilitates the single buffer as a mechanism for the absorbing network jitter effectively and efficiently. The proposed scheme has been implemented in an existing multimedia communication system, so called ISSA (Integrated Streaming Service Architecture), and it shows a good performance result compared to the conventional buffering methods in multimedia communication environments.

  • PDF

IPC-based Dynamic SM management on GPGPU for Executing AES Algorithm

  • Son, Dong Oh;Choi, Hong Jun;Kim, Cheol Hong
    • Journal of the Korea Society of Computer and Information
    • /
    • v.25 no.2
    • /
    • pp.11-19
    • /
    • 2020
  • Modern GPU can execute general purpose computation on the graphic processing unit, and provide high performance by exploiting many core on GPU. To run AES algorithm efficiently, parallel computational resources are required. However, computational resource of CPU architecture are not enough to cryptographic algorithm such as AES whereas GPU architecture has mass parallel computation resources. Therefore, this paper reduce the time to execute AES by employing parallel computational resource on GPGPU. Unfortunately, AES cannot utilize computational resource on GPGPU since it isn't suitable to GPGPU architecture. In this paper, IPC based dynamic SM management technique are proposed to efficiently execute AES on GPGPU. IPC based dynamic SM management can increase and decrease the number of active SMs by using IPC in run-time. According to simulation results, proposed technique improve the performance by increasing resource utilization compared to baseline GPGPU architecture. The results show that AES improve the performance by 41.2% on average.

Adaptive Intra Fast Algorithm of H.264 for Video Surveillance (보안 영상 시스템에 적합한 H.264의 적응적 인트라 고속 알고리즘)

  • Jang, Ki-Young;Kim, Eung-Tae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.33 no.12C
    • /
    • pp.1055-1061
    • /
    • 2008
  • H.264 is the prominent video coding standard in various applications such as real-time streaming and digital multimedia broadcasting, since it provides enhanced compression performance, error resilience tools, and network adaptation. Compression efficiency of H.264 has been improved, however, it requires more computing and memory access than traditional methods. In this paper we proposed adaptive intra fast algorithm for real-time video surveillance system reducing the encoding complexity of H264/A VC. For this aim, temporal interrelationship between macroblock in the previous and the current frame is used to decide the encoding mode of macroblock fast. As a result, though video quality was deteriorated a little, less than 0.04dB, and bit rate was somewhat increased in suggested method, however, proposed method improved encoding time significantly and, in particular, encoding time of an image with little changes of neighboring background such as surveillance video was more shortened than traditional methods.

Mitigating the Side-effect of Starting New Session in Multimedia Streaming using Multi-zoned Disk (구역분할 디스크를 사용하는 멀티미디어 서버에서 새로운 세션 시작에 따른 스케줄링 지연 현상의 최소화)

  • Cho, Kyeong-Sun;Won, You-Jip;Shin, Il-Hoon;Koh, Kern
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.31 no.8
    • /
    • pp.445-452
    • /
    • 2004
  • Zoning technology of disk improved the performance of disk subsystem with increase of storage capacity and average transfer bandwidth. SCAN disk scheduling with double buffering is used to utilize the performance of zoned disk in multimedia system. However, this method has a problem that generates jitter when the number of steams increases. In this article, we propose the novel approach, pre-buffering policy, to overcome this problem. Pre-buffering avoids jitter by buffering the lack of data before starting service, which is estimated from the current cycle length and the maximum cycle length. We can calculate cycle length, data sire needed in each cycle and the possible lack of data caused by the increase of the number of streams using the numerical model of disk subsystem. Pre-buffering can be applied for multimedia systems and contribute to provide clients with high quality service without jitter.

Efficient Video Service Providing Methods for Mobile of Indoor AP Terminals (실내 AP간 단말 이동에 따른 효율적인 동영상 서비스 제공 방안)

  • Hong, Sung-Hwa;Kim, Byoung-Kug
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2022.10a
    • /
    • pp.585-587
    • /
    • 2022
  • The visual motivation between AP devices is NTP-based visual motivation through the access of the Internet through the internal wired LAN, but this has several seconds of visual difference in hundreds of milliseconds (msec) depending on the network. The frame for the output of the video will vary depending on the application, but usually 24 (image) frames are output to the screen in one second. Therefore, the visual synchronization between peripheral devices can be performed through the adjacent moving camera device, not the wired method. The programming method of generating API for synchronization command when creating an application for visual synchronization and delivering it to AP through MAC may differ from the time in synchronization command according to the environment of the operating system at the transmission side and the situation of the buffer queue of the MAC. Therefore, as a method to solve this problem, the renewal of visual information in the device driver terminal controlling MAC can be much more effective.

  • PDF

P2P-based divisional data transmission system for live media streaming service (라이브 미디어 스트리밍 서비스를 위한 P2P기반 데이터 분할 전송 시스템)

  • Sun Choi;Heasun Byun;Meejeong Lee
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2008.11a
    • /
    • pp.1348-1351
    • /
    • 2008
  • 최근 인터넷 사용자들의 요구는 멀티미디어로 집중되고 있으며 그중 라이브 미디어 스트리밍 서비스에 대한 요구가 증가하고 있다. 라이브 서비스에서는 적절한 시간에 사용자에게 데이터가 도착하는 것이 중요하다. 따라서 라이브의 시간적절성을 충족시켜 줄 효율적이고 신속한 데이터 전달구조와 전송기법이 요구된다. 이에 본 논문에서는 트리와 메시 구조를 혼합한 하이브리드 방식으로 네트워크 자원을 효율적으로 사용하면서 빠른 데이터 전송으로 라이브의 시간적절성을 충족시킬 수 있는 데이터 분할 전송 방식의 P2P(Peer-to-Peer) 오버레이 구조를 제안한다. 제안하는 ToG(Tree of Groups)는 n개의 피어들이 메시로 그룹을 형성하고, 그렇게 형성된 그룹들이 트리를 이루는 구조이다. ToG에서 그룹 내의 각 피어들은 상위그룹의 피어 한 개와 부모-자식으로 연결되어 있어서 그룹 사이에 여러 개의 연결이 존재하게 된다. 따라서 그룹 내에서 어느 한 피어가 그룹을 빠져 나가더라도 상위그룹과의 여러 연결에 의해서 서비스 지속성을 보장 할 수 있다. ToG는 그룹단위로 트리가 형성되기 때문에 피어의 개수가 같을 때 피어단위로 트리를 형성하는 구조보다 트리의 깊이가 줄어든다. 그에 따라 말단에 있는 피어들에게까지 빠른 시간에 데이터가 전달 될 수 있다. ToG의 데이터 전달은 소스로부터 세그먼트가 일정한 값 n으로 나뉘어져 각 피어들에게 전달된다. 세그먼트 조각은 소스로부터 나뉘어져 전송 될 때 책임적으로 전달해야할 피어와 전달 순서가 정해져있고, 데이터 전송 스케줄링을 위한 버퍼 맵 교환은 필요하지 않다.

User Playlist-Based Music Recommendation Using Music Metadata Embedding (음원 메타데이터 임베딩을 활용한 사용자 플레이리스트 기반 음악 추천)

  • Kyoung Min Nam;Yu Rim Park;Ji Young Jung;Do Hyun Kim;Hyon Hee Kim
    • The Transactions of the Korea Information Processing Society
    • /
    • v.13 no.8
    • /
    • pp.367-373
    • /
    • 2024
  • The growth of mobile devices and network infrastructure has brought significant changes to the music industry. Online streaming services has allowed music consumption without constraints of time and space, leading to increased consumer engagement in music creation and sharing activities, resulting in a vast accumulation of music data. In this study, we define metadata as "song sentences" by using a user's playlist. To calculate similarity, we embedded them into a high-dimensional vector space using skip-gram with negative sampling algorithm. Performance eva luation results indicated that the recommended music algorithm, utilizing singers, genres, composers, lyricists, arrangers, eras, seasons, emotions, and tag lists, exhibited the highest performance. Unlike conventional recommendation methods based on users' behavioral data, our approach relies on the inherent information of the tracks themselves, potentially addressing the cold start problem and minimizing filter bubble phenomena, thus providing a more convenient music listening experience.