• Title/Summary/Keyword: 네트워크 스트리밍

Search Result 554, Processing Time 0.025 seconds

Manipulation of the Compressed Video for Multimedia Networking : A Bit rate Shaping of the Compressed Video (멀티미디어 네트워킹을 위한 압축 신호상에서 동영상 처리 : 압축 동영상 비트율 변환)

  • 황대환;조규섭;황수용
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.11A
    • /
    • pp.1908-1924
    • /
    • 2001
  • Interoperability and inter-working in the various network and media environment with different technology background is very important to enlarge the opportunity of service access and to increase the competitive power of service. The ITU-T and advanced counties are planning ahead for provision of GII enabling user to access advanced global communication services supporting multimedia communication applications, embracing all modes of information. In this paper, we especially forced the heterogeneity of end user applications for multimedia networking. The heterogeneity has several technical aspects, like different medium access methods, heterogeneous coding algorithms for audio-visual data and so on. Among these elements, we have been itemized bit rate shaping algorithm on the compressed moving video. Previous manipulations of video has been done on the uncompressed signal domain. That is, compressed video should be converted to linear PCM signal. To do such a procedures, we should decode, manipulate and then encode the video to compressed signal once again. The traditional approach for processing the video signa1 has several critical weak points, requiring complexity to implement, degradation of image quality and large processing delay. The bit rate shaping algorithm proposed in this paper process the manipulation of moving video on the completely compressed domain to cope with above deficit. With this algorithms. we could realized efficient video bit rate shaping and the result of software simulation shows that this method has significant advantage than that of pixel oriented algorithms.

  • PDF

Clustering Method based on Genre Interest for Cold-Start Problem in Movie Recommendation (영화 추천 시스템의 초기 사용자 문제를 위한 장르 선호 기반의 클러스터링 기법)

  • You, Tithrottanak;Rosli, Ahmad Nurzid;Ha, Inay;Jo, Geun-Sik
    • Journal of Intelligence and Information Systems
    • /
    • v.19 no.1
    • /
    • pp.57-77
    • /
    • 2013
  • Social media has become one of the most popular media in web and mobile application. In 2011, social networks and blogs are still the top destination of online users, according to a study from Nielsen Company. In their studies, nearly 4 in 5active users visit social network and blog. Social Networks and Blogs sites rule Americans' Internet time, accounting to 23 percent of time spent online. Facebook is the main social network that the U.S internet users spend time more than the other social network services such as Yahoo, Google, AOL Media Network, Twitter, Linked In and so on. In recent trend, most of the companies promote their products in the Facebook by creating the "Facebook Page" that refers to specific product. The "Like" option allows user to subscribed and received updates their interested on from the page. The film makers which produce a lot of films around the world also take part to market and promote their films by exploiting the advantages of using the "Facebook Page". In addition, a great number of streaming service providers allows users to subscribe their service to watch and enjoy movies and TV program. They can instantly watch movies and TV program over the internet to PCs, Macs and TVs. Netflix alone as the world's leading subscription service have more than 30 million streaming members in the United States, Latin America, the United Kingdom and the Nordics. As the matter of facts, a million of movies and TV program with different of genres are offered to the subscriber. In contrast, users need spend a lot time to find the right movies which are related to their interest genre. Recent years there are many researchers who have been propose a method to improve prediction the rating or preference that would give the most related items such as books, music or movies to the garget user or the group of users that have the same interest in the particular items. One of the most popular methods to build recommendation system is traditional Collaborative Filtering (CF). The method compute the similarity of the target user and other users, which then are cluster in the same interest on items according which items that users have been rated. The method then predicts other items from the same group of users to recommend to a group of users. Moreover, There are many items that need to study for suggesting to users such as books, music, movies, news, videos and so on. However, in this paper we only focus on movie as item to recommend to users. In addition, there are many challenges for CF task. Firstly, the "sparsity problem"; it occurs when user information preference is not enough. The recommendation accuracies result is lower compared to the neighbor who composed with a large amount of ratings. The second problem is "cold-start problem"; it occurs whenever new users or items are added into the system, which each has norating or a few rating. For instance, no personalized predictions can be made for a new user without any ratings on the record. In this research we propose a clustering method according to the users' genre interest extracted from social network service (SNS) and user's movies rating information system to solve the "cold-start problem." Our proposed method will clusters the target user together with the other users by combining the user genre interest and the rating information. It is important to realize a huge amount of interesting and useful user's information from Facebook Graph, we can extract information from the "Facebook Page" which "Like" by them. Moreover, we use the Internet Movie Database(IMDb) as the main dataset. The IMDbis online databases that consist of a large amount of information related to movies, TV programs and including actors. This dataset not only used to provide movie information in our Movie Rating Systems, but also as resources to provide movie genre information which extracted from the "Facebook Page". Formerly, the user must login with their Facebook account to login to the Movie Rating System, at the same time our system will collect the genre interest from the "Facebook Page". We conduct many experiments with other methods to see how our method performs and we also compare to the other methods. First, we compared our proposed method in the case of the normal recommendation to see how our system improves the recommendation result. Then we experiment method in case of cold-start problem. Our experiment show that our method is outperform than the other methods. In these two cases of our experimentation, we see that our proposed method produces better result in case both cases.

A Hybrid Scheme of the Transport Error Control for SVC Video Streaming (SVC 비디오 스트리밍을 위한 복합형 전송 오류 제어 기법)

  • Seo, Kwang-Deok;Moon, Chul-Wook;Jung, Soon-Heung;Kim, Jin-Soo
    • Journal of KIISE:Information Networking
    • /
    • v.36 no.1
    • /
    • pp.34-42
    • /
    • 2009
  • In this paper, we propose a practical hybrid transport error control scheme to provide SVC video streaming service over error-prone IP networks. Many error control mechanisms for various video coding standards have been proposed in the literature. However, there is little research result which can be practically applicable to the multilayered coding structure of SVC(the scalable extension of H.264/AVC). We present a new hybrid transport error control scheme that efficiently combines layered Forward Error Correction(FEC) and Automatic Repeat Request(ARQ) for better packet-loss resilience. In the proposed hybrid error control, we adopt ACK-based ARQ instead of NACK-based ARQ to maximize throughput which is the amount of effective data packets delivered over a physical link per time unit. In order to prove the effectiveness of the proposed hybrid error control scheme, we adopt NIST-Net network emulator which is a general-purpose tool for emulating performance dynamics in IP networks. It is shown by simulations over the NIST-Net that the proposed hybrid error control scheme shows improved packet-loss resilience even with much less number of overhead packets compared to various conventional error control schemes.

A Multicast Delivery Technique for VCR-like Interactions in Collaborative P2P Environment (협력 P2P 환경에서 VCR 기능을 위한 멀티캐스트 전송 기법)

  • Kim Jong-Gyung;Kim Jin-Hyuk;Park Seung-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.7B
    • /
    • pp.679-689
    • /
    • 2006
  • Delivering multicast stream is one of the cost-saving approach in the large scale VOD environment. Because implementing VCR-like interactions for user's convenience in the multicast streaming system involves complex problems, we need the proper solutions for them. In this paper, we propose a hybrid scheme which uses the general P2P and the patching scheme with the Collaborative Interaction Streaming Scheme(CISS). CISS provides jumping functionability to the appropriate multicast session after VCR-like interaction in the environment in which multiple peers transmit VCR-like interaction streams to the VCR-like functionability request node to reduce the loads generated by frequent join or departure of peers at the multicast tree during providing VCR-like functionability. Therefore, with the proposed scheme we can distribute network traffic and reduce control overhead and latency. And to evaluate the performance of proposed scheme we compare it in the aspect of the performance of streaming delivery topology, control overhead and streaming quality with P2Cast[10] and DSL[11]. The simulation result shows that proposed P2Patching reduces about 30% of process overhead and enhances about $25{\sim}30%$ of streaming quality compared with DSL.

Resolution Scheme of CRP Reservation Conflicts for Supporting QoS in ECMA-392-Based Ship Area Networks (ECMA-392 기반 선박 내 네트워크에서 QoS를 지원하는 CRP 예약 충돌 해결 방안)

  • Lee, Seong Ro;Oh, Joo-Seong;Kim, Beom-Mu;Lee, Yeonwoo;Jeong, Min-A;Lee, Seung Beom
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39C no.12
    • /
    • pp.1298-1306
    • /
    • 2014
  • In this paper, we use the ECMA-392 standard, the first cognitive radio networks to meet the demand for IT services in the ship. And, we investigate about the conflicts of devices that support multi-hop network based on the ECMA-392. Therefore, we propose the resolution scheme of CRP reservation conflicts to solve this. The current CRP reservation approaches does not solve the CRP reservation conflicts of ECMA-392 between devices that move at a distance of three hops. Therefore, it is not possible to guarantee the QoS of real time services such as multimedia streaming. So, we provide a new CRP reservation scheme to avoid conflict through a new 2-hop CRP Availability IE and the change of CRP Control field. From the simulation results, we know that the proposed method of 3 hops CRP reservation conflicts resolution improves the throughput of device.

The Medium Access Scheduling Scheme for Efficient Data Transmission in Wireless Body Area Network (WBAN 환경에서 효율적 데이터 전송을 위한 매체 접근 스케줄링 기법)

  • Jang, EunMee;Park, TaeShin;Kim, JinHyuk;Choi, SangBan
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.54 no.2
    • /
    • pp.16-27
    • /
    • 2017
  • IEEE 802.15.6 standard, a Wireless Body Area Network, aims to transfer not only medical data but also non-medical data, such as physical activity, streaming, multimedia game, living information, and entertainment. Services which transfer those data have very various data rates, intervals and frequencies of continuous access to a medium. Therefore, an efficient anti-collision operations and medium assigning operation have to be carried out when multiple nodes with different data rates are accessing shared medium. IEEE 802.15.6 standard for CSMA/CA medium access control method distributes access to the shared medium, transmits a control packet to avoid collision and checks status of the channel. This method is energy inefficient and causes overhead. These disadvantages conflict with the low power, low cost calculation requirement of wireless body area network, shall minimize such overhead for efficient wireless body area network operations. Therefore, in this paper, we propose a medium access scheduling scheme, which adjusts the time interval for accessing to the shared transmission medium according to the amount of data for generating respective sensor node, and a priority control algorithm, which temporarily adjusts the priority of the sensor node that causes transmission concession due to the data priority until next successful transmission to ensure fairness.

An Energy-Aware Multi-tree Video Multicast Scheme in Wireless Ad Hoc Networks (무선 애드 혹 네트워크에서 잔여 에너지를 고려한 다중 트리 비디오 멀티캐스트 기법)

  • Park, Jae-Young;Kang, Kyung-Ran;Cho, Young-Jong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.12B
    • /
    • pp.1336-1348
    • /
    • 2009
  • In this paper, we propose an energy-aware multi-tree video multicast scheme for wireless ad hoc networks. Some network nodes may have energy enough to receive and forward the whole video content whereas some may not. Even though the video quality may vary depending on the remaining energy, our scheme enables the low-energy nodes to join the video multicast session. The video stream is split into a set of multiple and independent descriptions by MDC (Multiple description coding) scheme. Each description corresponds to a substream and number of substreams determine the video quality. The member nodes determine how many substreams it would receive depending on the remaining energy and expected amount of packets per substream. So does the intermediate tree nodes. That builds a tree per substream and multiple trees per session. The data source disseminates each substream through corresponding tree. The video quality of the member nodes varies according to number of participating trees. We evaluate the performance of our scheme by simulation. Our scheme showed better peak signal to noise ratio and extended the lifetime of the network nodes compared with MAODV, which builds a single tree, and MT-MAODV, which builds multiple trees but does not consider the available energy.

An arbitration approach to resolve conflict to quality requirements in the level of the media service for multi-party collaboration environments (다자간 협업 환경을 위한 미디어 서비스 수준에서의 품질 요구사항 갈등 중재방법)

  • Han, Sang-Woo;Kim, Jong-Won
    • 한국HCI학회:학술대회논문집
    • /
    • 2008.02a
    • /
    • pp.601-606
    • /
    • 2008
  • When sharing real-time media in the ubiquitous computing environments, due to heterogeneous performance of devices, conflict to users' media service requirements might be occurred. To address the problems, there are extensive researches about media streaming QoS control schemes in the aspects of network or application. However, their deployment has met with difficulty because of critical reasons such as high development cost and system complexity. In this paper, in the level of media services, we propose a negotiation approach to offer improved quality of media services. The proposed approach Constructs video distribution group between producer and consumer services, which target to globally minimize the concession of users' quality requirements Consequently, users can be provided video services in the level of conformation to the users' expectation.

  • PDF

Performance Analysis of Service Model between server and client on PMSS System (PMSS 시스템에서 서버/클라이언트 간 서비스 모델의 성능분석)

  • Lee, Min-Hong;Kim, Kyung-Hoon;Nam, Ji-Seung
    • The KIPS Transactions:PartA
    • /
    • v.11A no.3
    • /
    • pp.207-212
    • /
    • 2004
  • This paper provides the higher user QoS(Quality of Service) by analyzing media service model between server and client in single VoD(Video on Demand) environment and applying it to parallel VoD environment. Media service model is divided into the Client Pull, Server Push, and IPP(Interleaving Pull & Push) model. A server sends data based on client's request in the Client Pull Model. A server one-sidedly sends data without client's request in the Server Pull model. And the WP model unites above two models. For a parallel VoD environment, We built the PMSS system which provides the parallel media streaming services that one client is simultaneously served by several servers. In the single and parallel VoD environment, We compare and analyze the performance of service models with respect to network delay and data size in buffer. In this experiment, we found that IPP service model keeps the least network delay and stable client buffer in the parallel VoD environment. This result shows that PMSS can provide the more quality of service.

Fast Game Encoder Based on Scene Descriptor for Gaming-on-Demand Service (주문형 게임 서비스를 위한 장면 기술자 기반 고속 게임 부호화기)

  • Jeon, Chan-Woong;Jo, Hyun-Ho;Sim, Dong-Gyu
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.7
    • /
    • pp.849-857
    • /
    • 2011
  • Gaming on demand(GOD) makes people enjoy games by encoding and transmitting game screen at a server side, and decoding the video at a client side. In this paper, we propose a fast game video encoder for multiple users over network with low-powered devices. In the proposed system, the computational complexity of game encoders is reduced by using scene descriptors, which consists of an object motion vector, global motion, and scene change. With additional information from game engines, the proposed encoder does not need to perform various complexity processes such as motion estimation and ratedistortion optimization. The motion estimation and rate-distortion optimization skipped by scene descriptors. We found that the proposed method improved 192 % in terms of FPS, compared with x264 software. With partial assembly code, we also improved coding speed by 86 % in terms of FPS. We found that the proposed fast encoder could encode over 60 FPS for real-time GOD applications.