WO2009104153A1 - Procédé et dispositif pour transférer des flux vidéo sur un réseau - Google Patents

Procédé et dispositif pour transférer des flux vidéo sur un réseau Download PDF

Info

Publication number
WO2009104153A1
WO2009104153A1 PCT/IB2009/050685 IB2009050685W WO2009104153A1 WO 2009104153 A1 WO2009104153 A1 WO 2009104153A1 IB 2009050685 W IB2009050685 W IB 2009050685W WO 2009104153 A1 WO2009104153 A1 WO 2009104153A1
Authority
WO
WIPO (PCT)
Prior art keywords
video
substreams
disjoint
relevance
priority
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Ceased
Application number
PCT/IB2009/050685
Other languages
English (en)
Inventor
Narendranath Udupa
Manjunath Ramachandra Iyer
Shyam Vasudevarao
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Koninklijke Philips NV
Original Assignee
Koninklijke Philips Electronics NV
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Koninklijke Philips Electronics NV filed Critical Koninklijke Philips Electronics NV
Publication of WO2009104153A1 publication Critical patent/WO2009104153A1/fr
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
    • H04N21/234—Processing of video elementary streams, e.g. splicing of video streams or manipulating encoded video stream scene graphs
    • H04N21/2343—Processing of video elementary streams, e.g. splicing of video streams or manipulating encoded video stream scene graphs involving reformatting operations of video signals for distribution or compliance with end-user requests or end-user device requirements
    • H04N21/234381—Processing of video elementary streams, e.g. splicing of video streams or manipulating encoded video stream scene graphs involving reformatting operations of video signals for distribution or compliance with end-user requests or end-user device requirements by altering the temporal resolution, e.g. decreasing the frame rate by frame skipping
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
    • H04N21/234—Processing of video elementary streams, e.g. splicing of video streams or manipulating encoded video stream scene graphs
    • H04N21/2343—Processing of video elementary streams, e.g. splicing of video streams or manipulating encoded video stream scene graphs involving reformatting operations of video signals for distribution or compliance with end-user requests or end-user device requirements
    • H04N21/234327—Processing of video elementary streams, e.g. splicing of video streams or manipulating encoded video stream scene graphs involving reformatting operations of video signals for distribution or compliance with end-user requests or end-user device requirements by decomposing into layers, e.g. base layer and one or more enhancement layers
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
    • H04N21/234—Processing of video elementary streams, e.g. splicing of video streams or manipulating encoded video stream scene graphs
    • H04N21/2347—Processing of video elementary streams, e.g. splicing of video streams or manipulating encoded video stream scene graphs involving video stream encryption
    • H04N21/23476—Processing of video elementary streams, e.g. splicing of video streams or manipulating encoded video stream scene graphs involving video stream encryption by partially encrypting, e.g. encrypting the ending portion of a movie
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/23—Processing of content or additional data; Elementary server operations; Server middleware
    • H04N21/238—Interfacing the downstream path of the transmission network, e.g. adapting the transmission rate of a video stream to network bandwidth; Processing of multiplex streams
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/25—Management operations performed by the server for facilitating the content distribution or administrating data related to end-users or client devices, e.g. end-user or client device authentication, learning user preferences for recommending movies
    • H04N21/262—Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists
    • H04N21/26208—Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists the scheduling operation being performed under constraints
    • H04N21/26216—Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists the scheduling operation being performed under constraints involving the channel capacity, e.g. network bandwidth
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/20—Servers specifically adapted for the distribution of content, e.g. VOD servers; Operations thereof
    • H04N21/25—Management operations performed by the server for facilitating the content distribution or administrating data related to end-users or client devices, e.g. end-user or client device authentication, learning user preferences for recommending movies
    • H04N21/262—Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists
    • H04N21/26208—Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists the scheduling operation being performed under constraints
    • H04N21/26225—Content or additional data distribution scheduling, e.g. sending additional data at off-peak times, updating software modules, calculating the carousel transmission frequency, delaying a video stream transmission, generating play-lists the scheduling operation being performed under constraints involving billing parameters, e.g. priority for subscribers of premium services
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
    • H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
    • H04N21/80—Generation or processing of content or additional data by content creator independently of the distribution process; Content per se
    • H04N21/83—Generation or processing of protective or descriptive data associated with content; Content structuring
    • H04N21/845—Structuring of content, e.g. decomposing content into time segments
    • H04N21/8456—Structuring of content, e.g. decomposing content into time segments by decomposing the content in the time domain, e.g. in time segments

Definitions

  • the present invention relates to a method of transferring at least one video stream in a communication system.
  • a video stream is understood as consisting of moving images, audio and text.
  • the present invention is especially advantageous in situations where the available bandwidth is limited.
  • the invention also relates to a corresponding computer program product comprising instructions for implementing the steps of said method, and to a communication device arranged to transfer video streams in a communication network.
  • a method of transferring at least one video stream in a communication network comprising the following steps: generating temporally disjoint video substreams from a video stream; assigning to at least some of the disjoint video substreams a priority index indicating the relevance of the corresponding disjoint video substream(s) to a viewer; and
  • the present invention provides the advantage that it makes possible to inherently guarantee higher priority for meaningful information by providing efficient sharing of resources and bandwidth. Based on an intelligent mechanism to assign priorities to different parts of the stream based on the relevance of general perception, the important and interesting portions of the stream would take precedence over the other parts. Less relevant streams get lower priority or they are completely discarded. Therefore, it can be assured that the important information reaches the user. Furthermore, the proposed method uses the existing infrastructure and it overcomes the alternative solutions such as dynamic change in the quantisation steps in known prior art methods.
  • the transfer characteristics relate to QoS and thus the present invention can provide relevance based QoS.
  • the present invention can also provide new possibilities of revenue generation for service providers as they can fill the non- utilisable lower QoS slots for transmitting less relevant information at lower tariff.
  • a computer program product comprising instructions for implementing the method according the first aspect of the invention when loaded and run on computer means of a communication device.
  • a communication device in a communication network arranged for transferring at least one video stream in a communication network, the communication device comprising: a clipping unit for generating temporally disjoint video substreams from a video stream; a priority allocation unit for assigning to at least some of the disjoint video substreams a priority index indicating the relevance of the corresponding substream(s) to a viewer; and an input/output unit for transferring the temporally disjoint video substreams so that at least one transfer characteristic of at least some of the transferred disjoint video substreams is adjusted depending on the priority index of the corresponding disjoint video substream.
  • FIG. 1 shows four communication devices located in a communication network, where the teachings of the invention may be applied;
  • - Figure 2 is a flow chart describing an embodiment of a method in accordance with the present invention
  • - Figure 3 shows the mapping of the QoS levels to different video scenes based on their relevance
  • FIG. 4 shows a simplified block diagram of a communication device, which is arranged to implement the teachings of the present invention.
  • the present invention describes a mechanism allowing to transfer a video stream over limited network resources effectively by generating temporally disjoint substreams of different qualities and assigning priorities to these disjoint substreams. It is also possible to assign priorities first and then generate the temporally disjoint video substreams of different qualities.
  • the priorities that reflect the relevance of the corresponding streams to the viewer can be assigned by for instance taking advantage of the movie-in-a- minute (MIAMI) type algorithms, which are explained later in more detail.
  • MIAMI movie-in-a- minute
  • FIG 1 shows two servers 101, in this case also called content providers, located in the Internet and arranged to communicate with a consumer device, in this case a computer 103 located on customer's premises.
  • a network manager 105 also known as a bandwidth service provider, for managing, taking care of resource allocation and controlling the network traffic.
  • the network manager 105 can be arranged to be in communication with any of the network devices.
  • the communication in the shown network is based on the Internet protocol (IP) as is well known in the art.
  • IP Internet protocol
  • the servers 101 intend to send a video file to the computer 103, but the network manager 105 notices that the network is rather congested and thus network traffic in this part of the network needs to be somehow limited.
  • the servers 101 need to divide in step 203 the video streams (obtained in step 201) into substreams that may or may not be of equal length. These substreams are now considered to be temporally disjoint.
  • step 205 different priorities are then assigned to these substreams. The priority values are based on the relevance that a customer, in this case the user of the computer 103, would consider to be associated with each substream.
  • MIAMI algorithm For assigning the priorities the MIAMI algorithm can be used, as described for instance in a publication entitled “Browsing video recordings using movie-in-a-minute”, Mauro Barbieri et al., Consumer Electronics, ICCE'06, January 7-11, 2006;
  • the principles of the MIAMI algorithm will be briefly discussed. Generating a MIAMI video stream can be divided into four main steps.
  • the first step is the audio and video feature extraction.
  • various content analysis algorithms are applied to the audio and video signals to extract a set of numerical audiovisual features.
  • Video features include low-level attributes such as contrast, colour distribution, motion activity and mid-level attributes such as presence of faces and camera motion. Examples of audio features are root mean square (RMS) value, bandwidth, and zero-crossing rate.
  • RMS root mean square
  • Audio and video segmentation and classification includes segmenting the video into shots or substreams by using a standard short cut detection algorithm. Visually consistent shots that are not far apart in time are clustered into scenes. Long shots are subdivided info smaller segments, while short shots are merged to fulfil a requirement of visual continuity.
  • An audio classifier is used to classify audio into coherent classes such as silence, speech, music, and noise. Specific requirements are taken into account to avoid silence segments and interruption in speech segments.
  • the last 10% of the video can also be discarded.
  • the last 10% of video can be given the highest priority.
  • the segments selection step consists of searching the best set of segments that maximize the importance score function in the space of all possible previews.
  • a heuristic search strategy has been implemented that iteratively improves an initial set of selected segments. The starting set is constructed by selecting for each scene the segment with the highest priority score. At every iteration the first segments of each scene that improve the importance score function are added to the set. The algorithm stops after a given fixed number of iterations is reached, or if the importance score function cannot be significantly improved. This search strategy may not provide the best solution, but it quickly yields an adequate solution for the typical MIAMI video usage.
  • Fusing the selected segments into one continuous audiovisual stream composes the MIAMI preview. Abrupt audio and video transitions between segments are smoothed using fading and dissolve effects.
  • the MIAMI algorithm searches the most important segments, in this embodiment of the present invention all segments, scenes or substreams are classified using the principles of the MIAMI algorithm.
  • An algorithm such as MIAMI runs over the video stream and generates substreams with different degrees of relevance and information. Although each of them may have the same length, the degree of highlights captured by each of them as perceived by the human beings would be different.
  • the packets are divided into substreams at the video scene level, each scene comprising multiple frames so that multiple video frames are considered at a time.
  • a priority index directly mapping on to the QoS is assigned to each of them.
  • IPv4 for example, up to 8 distinct QoS levels may be used.
  • the priority values are assigned to different substreams based on their semantic relevance.
  • the present embodiment could be generalized so that irrespective of the application type, various scenes from different applications can be assigned priorities.
  • the commercial values may be fixed by a service provider i.e. some of the temporally disjoint streams may be skipped without hampering the theme of the video.
  • the servers 101 inform the network manager 105 about the result so that the network manager 105 can then allocate resources to the servers 101 and thereby gives priorities to video substreams with high priorities.
  • the network manager 105 is responsible for adjusting the QoS of the video substreams based on their corresponding priorities.
  • the QoS is defined for each set of frames, i.e. scenes(s), at a time. It is to be understood that the relevance can be given to the information to be transferred by any one of the elements shown in Figure 1.
  • MIAMI MIAMI algorithm
  • the classification can be done manually so that the user himself assigns the priorities to different segments.
  • the video streams can be transferred by the servers 101 to the computer 103 by adjusting the QoS based on the assigned priorities.
  • Figure 3 illustrates an example, where a video stream is ranked into three relevance groups, namely high, medium and low, while the QoS is shown to be in two levels, namely high for level 2 and low for level 1. For the relevance value medium, the QoS level of 1 or 2 can be allocated. The mapping of the QoS level to the relevance values is also shown in Figure 3.
  • Figure 4 shows a simplified block diagram of the server 101. It is to be noted that only the blocks relevant to the understanding of the present invention are shown.
  • the initial video stream can be saved in a memory 401 from where the video stream can be fed to a video stream clipping unit 403, which is arranged to clip the video stream into temporally disjoint video substreams as explained above.
  • the video stream clipping unit 403 is connected to a priority allocation unit 405, which is arranged to assign priorities to the video substreams.
  • the priority allocation unit is arranged to run the MIAMI algorithm.
  • the priority allocation unit 405 is then connected to an input/output (I/O) unit 407.
  • I/O input/output
  • a processor unit 409 that is arranged to control the overall operation of the server 101.
  • the I/O unit 407 could be replaced with a transceiver unit.
  • the strength of encryption could be adjusted.
  • both the QoS and the strength of encryption could be adjusted.
  • the whole content of the video stream has to be encrypted using the same level of security.
  • strength of encryption could be varied. For instance, in a football match, the goal scored, goal saved, red/yellow card incidents, etc can be encrypted with highest strength, while mid field dabbles, swapping of players do not need not be encrypted at all.
  • bowlers running up to bowl is of low relevance, while the instant of batsman facing the ball is more relevant. Batsman defending the ball is less relevant compared to batsman getting out or batsman scoring a four/six. It is sufficient to encrypt most relevant portions of the content rather than encrypting the whole content.
  • the second embodiment of the present invention is basically an automatic temporally scalable security mechanism based on relevance of content.
  • MIAMI type algorithms are proven to provide ranking of video shots based on relevance. After obtaining ranking of movie or video shots by MIAMI type algorithms, highest security, which usually demands more processing power, is to be provided to highest ranking shots and similarly reducing security, i.e. which usually demands lesser processing power, as the ranking of the shots decreases.
  • the present invention also provides a flexible revenue model, which enhances the effective use of network infrastructure, satisfies both the content provider 101 and the end user 103, as well as augments the revenue collection.
  • the content provider 101 who defines multiple relevance levels to the content will be paying less than the content provider 101 who defines a single relevance level (high).
  • the cost charged by the bandwidth service provider 105 will be proportional to the relevance of the content so that highly relevant information with good QoS will cost more than information which is less relevant.
  • the content providers 101 can thereby agree on lower level QoS for lower relevance content.
  • variable QoS level which will be proportional to the relevance of the content being viewed, he can be charged appropriately less.
  • the quality he perceives does not necessarily drop.
  • the bandwidth service provider 105 has the flexibility to vary the QoS level of the content based on its relevance level. Hence, he can keep the end user 103 and content provider 101 satisfied without investing on the expensive network infrastructure. The end user 103 is assured of meaningful high quality content when it matters most (during the viewing of relevant portion).
  • the payment is linked to relevance of content. Different packages may be carved out based on the different fractions of high, medium and low relevance information. For instance a package can contain 60% high, 30% medium and 10% low relevance segments. If the transfer characteristics are not scaled based on the relevance, then the low relevance segments consume the same bandwidth as the other segments, but carry less relevant information than the high relevance segments.
  • the content provider 101 may be charged with different rates for different combinations of the relevant frames to transmit.
  • the end user 103 will be charged with different rates for different segments (high, medium and low).
  • the basic package may contain only high relevance segments.
  • the medium and low relevant segments would be transferred at a higher QoS level based on the availability of the bandwidth in the network. If necessitated the medium and low relevant segments would be transferred at a medium or lower QoS level. This categorisation may he done based on the requirement of either content provider 101 or the end user 101.
  • the bandwidth service providers 105 are competing for subscriptions of end-users to their network. To lure end users to subscribe to his network, one bandwidth service provider 105 may claim that his network carries significant (say more than 60%) high relevance content at any point of time. To achieve this claim, he may charge less for high relevant content. This will attract more content owners with high relevance to use this network service provider. This will also attract more end users to subscribe to this network because of significant availability of high relevance content.
  • the embodiments of the invention explained above were described in the context of the Internet, but it is to be noted that the teachings of the present invention can be applied to different kinds of wired or wireless communication networks, such as telecommunications networks.
  • the techniques explained above are intended to provide differentiated service over the network.
  • the bandwidth and resources assigned to the video stream transfer over the network may be mapped on to the relevance of the stream so that the genuinely relevant video gets better bandwidth and service.
  • the present invention also provides a mechanism to transfer video files efficiently over IP. The priorities would be taken care automatically.
  • the invention also relates to a computer program product that is able to implement any of the method steps as described above when loaded and run on computer means of the communication devices.
  • the computer program may be stored/distributed on a suitable medium supplied together with or as a part of other hardware, but may also be distributed in other forms, such as via the Internet or other wired or wireless telecommunication systems.
  • the invention also relates to an integrated circuit that is arranged to perform any of the method steps in accordance with the embodiments of the invention.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Databases & Information Systems (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)

Abstract

La présente invention concerne un procédé de transfert de flux vidéo sur un réseau de communication. Le procédé comporte les étapes suivantes effectuées par un dispositif de communication fonctionnant sur le réseau de communication : (a) générer (203) des sous-flux vidéo temporellement disjoints à partir d'un flux vidéo; (b) affecter (205) à au moins une partie des sous-flux vidéo disjoints un indice de priorité indiquant la pertinence du sous-flux vidéo disjoint correspondant pour un spectateur; et (c) transférer (207) les sous-flux vidéo temporellement disjoints de telle sorte qu'au moins une caractéristique du transfert, comme la Qualité de Service, d'au moins une partie des sous-flux vidéo disjoints transférés soit ajustée en fonction de l'indice de priorité du sous-flux vidéo disjoint correspondant.
PCT/IB2009/050685 2008-02-20 2009-02-19 Procédé et dispositif pour transférer des flux vidéo sur un réseau Ceased WO2009104153A1 (fr)

Applications Claiming Priority (4)

Application Number Priority Date Filing Date Title
EP08305028 2008-02-20
EP08305028.6 2008-02-20
EP08305137.5 2008-04-29
EP08305137 2008-04-29

Publications (1)

Publication Number Publication Date
WO2009104153A1 true WO2009104153A1 (fr) 2009-08-27

Family

ID=40637797

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/IB2009/050685 Ceased WO2009104153A1 (fr) 2008-02-20 2009-02-19 Procédé et dispositif pour transférer des flux vidéo sur un réseau

Country Status (1)

Country Link
WO (1) WO2009104153A1 (fr)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2014012573A1 (fr) * 2012-07-16 2014-01-23 Telefonaktiebolaget L M Ericsson (Publ) Procédé et appareil pour la détermination d'un flux de services vidéo composite
US20150229970A1 (en) * 2011-08-18 2015-08-13 Vid Scale, Inc. Methods and systems for packet differentiation
WO2018125556A1 (fr) * 2016-12-29 2018-07-05 Arris Enterprises Llc Procédé de gestion dynamique de distribution de contenu
WO2023015807A1 (fr) * 2021-08-11 2023-02-16 浙江智慧视频安防创新中心有限公司 Procédé et appareil de transmission de données de rétine numérique, dispositif électronique et support de stockage

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0952709A1 (fr) * 1998-04-20 1999-10-27 BRITISH TELECOMMUNICATIONS public limited company Système à stockage et transmission de données
US20030072376A1 (en) * 2001-10-12 2003-04-17 Koninklijke Philips Electronics N.V. Transmission of video using variable rate modulation
US20030217091A1 (en) * 2002-05-14 2003-11-20 Tomio Echigo Content provisioning system and method
WO2004010643A1 (fr) * 2002-07-18 2004-01-29 British Telecommunications Public Limited Company Regulation du debit de donnees
EP1531588A1 (fr) * 2003-11-12 2005-05-18 Agere Systems, Inc. Transmission de contenus media en utilisant de la differentiation de la qualité de service dans un flux media
US20050185821A1 (en) * 2002-10-03 2005-08-25 Medialive, A Corporation Of France System and process for adaptive and progressive scrambling of video streams

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP0952709A1 (fr) * 1998-04-20 1999-10-27 BRITISH TELECOMMUNICATIONS public limited company Système à stockage et transmission de données
US20030072376A1 (en) * 2001-10-12 2003-04-17 Koninklijke Philips Electronics N.V. Transmission of video using variable rate modulation
US20030217091A1 (en) * 2002-05-14 2003-11-20 Tomio Echigo Content provisioning system and method
WO2004010643A1 (fr) * 2002-07-18 2004-01-29 British Telecommunications Public Limited Company Regulation du debit de donnees
US20050185821A1 (en) * 2002-10-03 2005-08-25 Medialive, A Corporation Of France System and process for adaptive and progressive scrambling of video streams
EP1531588A1 (fr) * 2003-11-12 2005-05-18 Agere Systems, Inc. Transmission de contenus media en utilisant de la differentiation de la qualité de service dans un flux media

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
WORRALL S T ET AL: "PRIORITISATION OF DATA PARTITIONED MPEG-4 VIDEO OVER MOBILE NETWORKS", EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, WILEY & SONS, CHICHESTER, GB, vol. 12, no. 3, 1 May 2001 (2001-05-01), pages 169 - 174, XP001059348, ISSN: 1124-318X *

Cited By (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20150229970A1 (en) * 2011-08-18 2015-08-13 Vid Scale, Inc. Methods and systems for packet differentiation
WO2014012573A1 (fr) * 2012-07-16 2014-01-23 Telefonaktiebolaget L M Ericsson (Publ) Procédé et appareil pour la détermination d'un flux de services vidéo composite
WO2018125556A1 (fr) * 2016-12-29 2018-07-05 Arris Enterprises Llc Procédé de gestion dynamique de distribution de contenu
US10986152B2 (en) 2016-12-29 2021-04-20 Arris Enterprises Llc Method for dynamically managing content delivery
US11627176B2 (en) 2016-12-29 2023-04-11 Arris Enterprises Llc Method for dynamically managing content delivery
WO2023015807A1 (fr) * 2021-08-11 2023-02-16 浙江智慧视频安防创新中心有限公司 Procédé et appareil de transmission de données de rétine numérique, dispositif électronique et support de stockage

Similar Documents

Publication Publication Date Title
KR101478656B1 (ko) 적응 스트리밍 시스템에서 비트 전송률 조정
US6295294B1 (en) Technique for limiting network congestion
US7093028B1 (en) User and content aware object-based data stream transmission methods and arrangements
US8259861B2 (en) Methods and systems for providing bandwidth adjustment
RU2604416C2 (ru) Способ управления полосой пропускания и соответсвующее устройство
JP5479107B2 (ja) コンテンツ通信のためのシステム及び方法
EP3065414B1 (fr) Dispositif et procédé de transmission, dispositif et procédé de réception
MX2007013244A (es) Metodo y aparato para asignacion dinamica de ancho de banda de video sobre una linea de suscriptor digital.
US20140189760A1 (en) Method and system for allocating wireless resources
KR20140143907A (ko) 이동통신 시스템에서 비디오 비트레이트 할당 방법 및 장치
WO2008062989A1 (fr) Procédé d'exploitation d'un système de contenus sur demande
JP3582979B2 (ja) 通信装置、通信方法及び記録媒体
Ziviani et al. Improving the delivery quality of MPEG video streams by using differentiated services
WO2009104153A1 (fr) Procédé et dispositif pour transférer des flux vidéo sur un réseau
Ramamurthi et al. Video-QoE aware resource management at network core
Tanjung et al. Qoe optimization in dash-based multiview video streaming
Hassan et al. Video streaming processing using fog computing
Nguyen et al. An adaptive streaming method of 360 videos over HTTP/2 protocol
Fu et al. QoE-based SVC layer dropping in LTE networks using content-aware layer priorities
Ma et al. HTTP live streaming bandwidth management using intelligent segment selection
Dubin et al. A fair server adaptation algorithm for HTTP adaptive streaming using video complexity
CA2916847A1 (fr) Gestion de politique de bande passante dans un reseau de distribution de contenu auto-corrige
Panta Mobile video delivery: Challenges and opportunities
Catalan-Cid et al. FALCON: Joint fair airtime allocation and rate control for DASH video streaming in software defined wireless networks
EP3949307B1 (fr) Entité de communication et procédé destiné à la transmission d'un flux de données vidéo

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 09711594

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 09711594

Country of ref document: EP

Kind code of ref document: A1