WO2017107649A1 - Procédé et dispositif d'émission vidéo - Google Patents

Procédé et dispositif d'émission vidéo Download PDF

Info

Publication number
WO2017107649A1
WO2017107649A1 PCT/CN2016/103343 CN2016103343W WO2017107649A1 WO 2017107649 A1 WO2017107649 A1 WO 2017107649A1 CN 2016103343 W CN2016103343 W CN 2016103343W WO 2017107649 A1 WO2017107649 A1 WO 2017107649A1
Authority
WO
WIPO (PCT)
Prior art keywords
frame
gop
queue
video
frames
Prior art date
Application number
PCT/CN2016/103343
Other languages
English (en)
Chinese (zh)
Inventor
赵化强
Original Assignee
北京奇虎科技有限公司
奇智软件（北京）有限公司
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 北京奇虎科技有限公司, 奇智软件（北京）有限公司 filed Critical 北京奇虎科技有限公司
Publication of WO2017107649A1 publication Critical patent/WO2017107649A1/fr

Links

Images

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/24—Monitoring of processes or resources, e.g. monitoring of server load, available bandwidth, upstream requests
    • H04N21/2402—Monitoring of the downstream path of the transmission network, e.g. bandwidth available
    • 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/21—Server components or server architectures
    • H04N21/218—Source of audio or video content, e.g. local disk arrays
    • H04N21/2187—Live feed
    • 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/24—Monitoring of processes or resources, e.g. monitoring of server load, available bandwidth, upstream requests
    • 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/24—Monitoring of processes or resources, e.g. monitoring of server load, available bandwidth, upstream requests
    • H04N21/2401—Monitoring of the client buffer
    • 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/24—Monitoring of processes or resources, e.g. monitoring of server load, available bandwidth, upstream requests
    • H04N21/2407—Monitoring of transmitted content, e.g. distribution time, number of downloads
    • 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/85—Assembly of content; Generation of multimedia applications
    • H04N21/854—Content authoring
    • H04N21/8547—Content authoring involving timestamps for synchronizing content

Definitions

  • the present invention relates to the field of video technologies, and in particular, to a video transmission method and apparatus.
  • the present invention has been made in order to provide a video transmission method and apparatus that overcomes the above problems or at least partially solves the above problems.
  • a video transmission method including:
  • H is equal to the length of time of one picture group GOP plus a preset time offset value
  • L is greater than H and there are frames belonging to two GOPs in the buffer queue, one or more P frames are deleted from the last P frame of the previous GOP in the buffer queue such that L is less than or equal to H.
  • a video transmission apparatus comprising:
  • a receiving unit configured to receive a video stream of the collecting party, and sequentially put each video frame in the video stream into a buffer queue;
  • a cache unit adapted to cache the cache queue
  • a sending unit configured to sequentially take a video frame from the cache queue and transmit the data through the network
  • a monitoring unit configured to monitor a video frame queue length L in the cache queue
  • the congestion processing unit is adapted to perform a process of deleting a frame when L is less than or equal to H; wherein H is equal to a time length of a picture group GOP plus a preset time offset value; and is suitable when L is greater than H, and is cached When there are frames belonging to two GOPs in the queue, one or more P frames are deleted from the last P frame of the previous GOP in the buffer queue such that L is less than or equal to H.
  • a computer program comprising computer readable code that, when executed on a computing device, causes the computing device to perform a video transmission method according to the above.
  • a computer readable medium wherein a computer program as described above is stored.
  • the technical solution of the present invention sequentially takes video frames from the buffer queue and transmits them through the network, wherein the video frames are sequentially extracted from the video stream received by the collecting party and placed in the buffer pair column, and transmitted.
  • the length of the video frame queue L in the cache queue is monitored.
  • L is less than or equal to H, that is, the user can smoothly view the frame without processing, and L is greater than H, and the cache queue belongs to two.
  • the GOP frame that is, if the user has begun to appear unable to view smoothly, delete one or more P frames from the last P frame of the previous GOP in the buffer queue, such that L is less than or equal to H, where H is equal to one
  • the length of the GOP plus a preset time offset value Compared with the prior art, the technical solution provides a method for discarding video frames more efficiently, so that the user can watch more video content more smoothly in the case of poor network conditions, greatly Optimized user viewing experience.
  • FIG. 1 is a schematic flowchart diagram of a video transmission method according to an embodiment of the present invention
  • FIG. 2 is a schematic diagram showing that a video frame queue length L of a cache queue is greater than H, and a frame belonging to two GOPs exists in the buffer queue;
  • FIG. 3 is a schematic structural diagram of a video transmission apparatus according to an embodiment of the present invention.
  • Figure 4 shows schematically a block diagram of a computing device for performing the method according to the invention
  • Fig. 5 schematically shows a storage unit for holding or carrying program code implementing the method according to the invention.
  • FIG. 1 is a schematic flowchart diagram of a video transmission method according to an embodiment of the present invention. As shown in FIG. 1, the method includes:
  • Step S110 Receive a video stream of the collecting party, sequentially put each video frame in the video stream into a buffer queue, and sequentially take video frames from the buffer queue and transmit the data through the network.
  • the collecting party may be a user who performs a live webcast, and the video stream of the corresponding collecting party may be a video stream of e-sports game content, outdoor activity content, etc., which are all users who need the live broadcast platform to watch online in real time, and thus cannot be adopted. Buffered way to watch.
  • the collector can also be a live stream of live broadcasts, awards ceremonies, and the like.
  • the live content is pushed to the user, each video frame in the video stream needs to be sent to the user, and the user can watch through the player, and the size and function of the video frame are not necessarily the same, and the network transmission speed of the user usually exists. Fluctuations, so the video frames in the video stream need to be put into the buffer queue, and the video frames are sequentially taken from the queue for transmission through the network. That is to say, the cache queue is on the server side.
  • the reason that video card appears is that the user's network transmission rate is less than the video bit rate.
  • the user wants to watch the video content provided by the video provider synchronously.
  • the video provider is not considered here, such as the time taken by the collecting party to upload the collected video content and the video forwarding process on the server side. time spent.
  • the server needs to transmit the video stream to the user for viewing through the network, if the user's network transmission rate is high enough, the entire content in the video stream can be obtained very quickly.
  • the user's network transmission rate is 12500Kbps, and the video bit rate is only 1250kbps, so that the user can quickly receive all the frames in the video stream, that is, each video frame is placed in the buffer queue, and can be immediately The user takes it away.
  • the user's network transmission rate is lower than the video bit rate, a video frame is placed in the cache queue, and the user does not take it in time, resulting in more and more video frames being cached in the cache queue, and the cache queue is cached.
  • the length is limited. When the cache queue is full, some video frames in the cache queue need to be discarded.
  • the following two kinds of unsmooth experience will appear: First, since the network transmission rate is lower than the video bit rate, the video frame received on the terminal device has already been played, but no new one has been received. Video frame, then the video is stuck; second, the discarded video frame is impossible for the user to re Received, so the original dynamic video will skip this part of the video frame when it is played to the part of the video frame that has been discarded.
  • the user's network transmission rate is much smaller than the video bit rate
  • the combination of the above two situations may result in a situation where the video is almost static and the picture jumps to a picture, and the picture may be incomplete. The situation is often dubbed "card into a slide.”
  • the video stream of the collector is an H.264 video stream.
  • H.264 is a new generation of digital video compression format after MPEG4 jointly proposed by the International Organization for Standardization and the International Telecommunication Union. It has been widely used.
  • Step S120 monitoring the length L of the video frame queue in the cache queue.
  • Step S130 if L is less than or equal to H, no processing of deleting the frame is performed; wherein H is equal to the length of time of one GOP plus a preset time offset value.
  • a GOP refers to a group of consecutive pictures.
  • a video frame in an H.264 video stream includes an I frame (internal coded frame) and a P frame (forward predicted frame), and one GOP includes one I frame and multiple P frames.
  • the I frame contains a complete picture content, which is located at the front end of a GOP; and the P frame contains the difference between this frame and the previous I frame (or P frame), and the previously cached picture is needed for decoding.
  • the video length of a GOP is the time required for all frames to be played normally after decoding.
  • step S130 after the video frame in the video stream is transmitted to the terminal device of the user who views the video, for example, taking a GOP as an example, after all frames in the GOP are transmitted to the user's terminal device, the user needs to spend the video frame.
  • the time of the GOP is watched for the length of time. At this time, analysis is performed from the cache queue side. If L is less than or equal to H, it indicates that these video frames may be used during the time when the user views the transmitted GOP.
  • the preset time offset value is a case in which the idle time exists in the video transmission, and it may preferably be set to one tenth of the length of 200 ms or the GOP.
  • Step S140 if L is greater than H, and there are frames belonging to two GOPs in the buffer queue, one or more P frames are deleted from the last P frame of the previous GOP in the buffer queue, such that L is less than or equal to H.
  • the fluctuation range should be small. Therefore, the presence of frames belonging to two GOPs in the buffer queue indicates that the user does not have time to play a GOP that has been received by the user's terminal device. All frames of the next GOP can be removed from the cache queue. So this will only accumulate more and more frames in the cache queue, which will eventually lead to stuck. Therefore, in this step, one or more P frames are deleted from the last P frame of the previous GOP in the buffer queue until L is less than or equal to H. Since each P frame contains only the difference from the previous frame, deleting the P frame has the least impact on the user's viewing experience.
  • the video frames are sequentially taken from the buffer queue and transmitted through the network, wherein the video frames are sequentially extracted from the video stream received by the collecting party and placed in the cache pair column, in the transmission process.
  • the length of the video frame queue length L in the cache queue is monitored. When L is less than or equal to H, that is, the user can smoothly view the frame without processing, and L is greater than H, and the cache queue belongs to two frames.
  • the frame of the group GOP that is, if the user has begun to appear unable to view smoothly, one or more P frames are deleted from the last P frame of the previous GOP in the buffer queue, so that L is less than or equal to H, where H is equal to The length of a GOP plus a preset time offset value.
  • the technical solution provides a method for discarding video frames more efficiently, so that the user can watch more video content more smoothly in the case of poor network conditions, greatly Optimized user viewing experience.
  • the method shown in FIG. 1 further includes deleting all frames of the GOP located in the intermediate position in the buffer queue if L is greater than H and there are frames belonging to the three GOPs in the buffer queue.
  • the I frame is considered to contain the complete picture data
  • the amount of data is large, and the first I frame in the buffer queue may be being transmitted. Deleting it may cause the user to receive an incomplete I frame.
  • the picture is displayed, which reduces the user's viewing experience. When a complete GOP is deleted, only the picture jumps, and the experience is better than the flower screen.
  • detecting a video frame queue length L in the buffer queue includes: calculating, for each GOP in the buffer queue, a first frame belonging to the GOP in the cache queue The difference between the timestamp and the timestamp of the last frame, the length of time of the GOP in the cache queue is obtained; and the length of time of each GOP in the cache queue in the buffer queue is summed to obtain L.
  • a method of calculating a video frame queue length L which is actually a time length, is provided.
  • the time length of the GOP in the cache queue is calculated dynamically for each GOP in the cache queue to obtain the timestamp of the first frame and the last frame.
  • each GOP is in the cache queue.
  • the length of time in the sum is summed to get L.
  • the timestamp may be generated when it is added to the cache queue, but is not limited to this method.
  • the last P frame begins to delete one or more P frames, such that L is less than or equal to H.
  • the time frame of the first frame of the next GOP in the buffer queue is C, and the time stamp of the last frame is D; the buffer queue The timestamp of the first frame of the previous GOP is B; then the P frame in the previous GOP in the buffer queue with the timestamp greater than B+H-(DC) is deleted.
  • FIG. 2 shows a schematic diagram in which the video frame queue length L of the cache queue is greater than H, and there are frames belonging to two GOPs in the buffer queue.
  • the first frame in the latter GOP is an I frame, and its timestamp is C; the last frame is a P frame, and its timestamp is D.
  • the P frame in the previous GOP in the buffer queue with the time stamp greater than B+H-(D-C) is deleted.
  • the P frame after the time stamp X in the figure is deleted.
  • the method shown in FIG. 1 further includes: calculating a difference value of a timestamp carried by an I frame in two adjacent GOPs in the received video stream, and determining a time length of the GOP.
  • a method for dynamically calculating a GOP length in real time that is, calculating a difference of timestamps carried by I frames in two adjacent GOPs in a received video stream.
  • the timestamp may not be generated when the queue is added to the cache queue, and may be directly added to the corresponding video frame by the video stream collector.
  • FIG. 3 is a schematic structural diagram of a video transmission apparatus according to an embodiment of the present invention. As shown in FIG. 3, the video transmission apparatus 300 includes:
  • the receiving unit 310 is adapted to receive the H.264 video stream of the collecting party, and sequentially place each video frame in the video stream into a buffer queue.
  • the cache unit 320 is adapted to cache a cache queue.
  • the sending unit 330 is adapted to sequentially take video frames from the cache queue for transmission over the network.
  • the monitoring unit 340 is adapted to monitor the video frame queue length L in the buffer queue.
  • the congestion processing unit 350 is adapted to perform a process of deleting a frame when L is less than or equal to H; wherein H is equal to a time length of a GOP plus a preset time offset value; and is suitable when L is greater than H, and the buffer queue is Medium When there are frames belonging to two GOPs, one or more P frames are deleted from the last P frame of the previous GOP in the buffer queue such that L is less than or equal to H.
  • the device shown in FIG. 3 sequentially takes video frames from the buffer queue and transmits them through the network through mutual cooperation of the units, wherein the video frames are sequentially extracted from the video stream received by the collecting party and placed in the cache pair.
  • the length of the video frame queue L in the buffer queue is monitored, and when L is less than or equal to H, that is, the user can smoothly view the frame without performing the process of deleting the frame, and L is greater than H, and the buffer is There are two GOP frames in the queue, that is, if the user has to start to appear in a smooth view, one or more P frames are deleted from the last P frame of the previous GOP in the buffer queue, so that L is less than or equal to H, where H is equal to the length of time of one GOP plus a preset time offset value.
  • the technical solution provides a method for discarding video frames more efficiently, so that the user can watch more video content more smoothly in the case of poor network conditions, greatly Optimized user viewing experience.
  • the congestion processing unit 350 is further adapted to delete the cache queue in the middle when L is greater than H and there are frames belonging to the three GOPs in the buffer queue. All frames of the location of the GOP.
  • the monitoring unit 340 is adapted to calculate, for each GOP in the buffer queue, a timestamp of the first frame belonging to the GOP and a time of the last frame in the cache queue. The difference between the stamps gives the length of time that the GOP is in the cache queue; the length of time of each GOP in the cache queue in the cache queue is summed to obtain L.
  • the congestion processing unit 350 is adapted to: when there are frames belonging to two GOPs in the buffer queue, and L is greater than H, the previous GOP in the queue will be buffered.
  • the P frame with the timestamp greater than B+H-(DC) is deleted; wherein the timestamp of the first frame of the next GOP in the buffer queue is C, and the timestamp of the last frame is D; in the cache queue
  • the timestamp of the first frame of the previous GOP is B.
  • the apparatus shown in FIG. 3 further includes: a GOP length calculation unit adapted to calculate a difference of timestamps carried by I frames in two adjacent GOPs in the received video stream. , determine the length of time of the GOP.
  • the technical solution of the present invention sequentially takes video frames from the cache queue and transmits them through the network, wherein the video frames are sequentially extracted from the video stream received by the collecting party and placed in the cache pair column.
  • the length of the video frame queue L in the cache queue is monitored.
  • L is less than or equal to H, that is, the user can smoothly view the frame without performing the process of deleting the frame, and L is greater than H, and the cache queue belongs to two.
  • Frames of GOPs that is, if the user has begun to appear unable to view smoothly, one or more P frames are deleted from the last P frame of the previous GOP in the buffer queue, such that L is less than or equal to H, where H is equal to The length of a GOP plus a preset time offset value.
  • the technical solution provides a method for discarding video frames more efficiently, so that the user can watch more video content more smoothly in the case of poor network conditions, greatly Optimized user viewing experience.
  • modules in the devices of the embodiments can be adaptively changed and placed in one or more devices different from the embodiment.
  • the modules or units or components of the embodiments may be combined into one module or unit or component, and further they may be divided into a plurality of sub-modules or sub-units or sub-components.
  • any combination of the features disclosed in the specification, including the accompanying claims, the abstract and the drawings, and any methods so disclosed, or All processes or units of the device are combined.
  • Each feature disclosed in this specification (including the accompanying claims, the abstract and the drawings) may be replaced by alternative features that provide the same, equivalent or similar purpose.
  • Various component embodiments of the present invention may be implemented in hardware or on one or more processors
  • a microprocessor or digital signal processor may be used in practice to implement some or all of the functionality of some or all of the components of a video transmission device in accordance with embodiments of the present invention.
  • the invention can also be implemented as a device or device program (e.g., a computer program and a computer program product) for performing some or all of the methods described herein.
  • a program implementing the invention may be stored on a computer readable medium or may be in the form of one or more signals.
  • Such signals may be downloaded from an Internet website, provided on a carrier signal, or provided in any other form.
  • Figure 4 shows a block diagram of a computing device for performing the method in accordance with the present invention.
  • the computing device conventionally includes a processor 410 and a computer program product or computer readable medium in the form of a memory 420.
  • the memory 420 may be an electronic memory such as a flash memory, an EEPROM (Electrically Erasable Programmable Read Only Memory), an EPROM, a hard disk, or a ROM.
  • the memory 420 has a storage space 430 that stores program code 431 for performing any of the method steps described above.
  • the storage space 430 storing program code may store respective program codes 431 for implementing various steps in the above methods, respectively.
  • the program code can be read from or written to one or more computer program products.
  • These computer program products include program code carriers such as hard disks, compact disks (CDs), memory cards or floppy disks.
  • Such computer program products are typically portable or fixed storage units such as those shown in FIG.
  • the storage unit may have storage segments, storage spaces, and the like that are similarly arranged to memory 420 in the computing device of FIG.
  • the program code can be compressed, for example, in an appropriate form.
  • the storage unit stores computer readable program code 431', i.e., program code readable by a processor, such as 410, which, when executed by a computing device, causes the computing device to perform the operations described above. The various steps in the method.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Signal Processing (AREA)
  • Databases & Information Systems (AREA)
  • Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
  • Computer Security & Cryptography (AREA)
  • Compression Or Coding Systems Of Tv Signals (AREA)

Abstract

L'invention concerne un procédé et dispositif d'émission vidéo. Le procédé comporte les étapes consistant à: recevoir un flux vidéo d'une partie collectrice, placer successivement des trames vidéo dans le flux vidéo dans une file d'attente de cache, et extraire successivement les trames vidéo de la file d'attente de cache et émettre les trames vidéo via un réseau; surveiller la longueur L d'une file d'attente de trames vidéo dans la file d'attente de cache; si L est inférieure ou égale à H, ne pas supprimer une trame, H étant égale à la somme d'une longueur de temps d'un groupe d'images (GOP) et d'une valeur prédéfinie de décalage temporel; et si L est supérieure à H et si des trames appartenant à deux GOP sont présentes dans la file d'attente de cache, supprimer une ou plusieurs trames P en partant d'une dernière trame P d'un GOP précédent dans la file d'attente de cache, jusqu'à ce que L soit inférieure ou égale à H. En comparaison de la technique antérieure, la solution technique met en place un procédé plus efficace pour éliminer une trame vidéo, de sorte qu'un utilisateur peut regarder plus de contenus vidéo de façon plus fluide lorsque l'état du réseau est mauvais, optimisant ainsi considérablement l'agrément de visualisation pour l'utilisateur.
PCT/CN2016/103343 2015-12-22 2016-10-26 Procédé et dispositif d'émission vidéo WO2017107649A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201510974709.6A CN105611309B (zh) 2015-12-22 2015-12-22 一种视频传输方法和装置
CN201510974709.6 2015-12-22

Publications (1)

Publication Number Publication Date
WO2017107649A1 true WO2017107649A1 (fr) 2017-06-29

Family

ID=55990802

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2016/103343 WO2017107649A1 (fr) 2015-12-22 2016-10-26 Procédé et dispositif d'émission vidéo

Country Status (2)

Country Link
CN (1) CN105611309B (fr)
WO (1) WO2017107649A1 (fr)

Cited By (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110830838A (zh) * 2018-08-10 2020-02-21 高新兴科技集团股份有限公司 一种安防高清录像倒播方法及装置
CN111556010A (zh) * 2020-03-23 2020-08-18 北京达佳互联信息技术有限公司 直播流缓存方法、装置、电子设备及存储介质
CN111666195A (zh) * 2020-05-26 2020-09-15 上海连尚网络科技有限公司 一种用于提供视频信息或者图像信息的方法与设备
CN113068074A (zh) * 2021-03-24 2021-07-02 浙江大华技术股份有限公司 缓存方法和装置、计算机可读的存储介质及电子装置
CN114629996A (zh) * 2022-03-24 2022-06-14 咪咕音乐有限公司 视频彩铃推送方法、设备、存储介质及装置
CN115866162A (zh) * 2021-09-26 2023-03-28 中移雄安信息通信科技有限公司 视频流生成方法、装置、电子设备及存储介质
CN116801034A (zh) * 2023-08-25 2023-09-22 海马云（天津）信息技术有限公司 客户端保存音视频数据的方法和装置

Families Citing this family (14)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105611309B (zh) * 2015-12-22 2019-03-05 北京奇虎科技有限公司 一种视频传输方法和装置
CN106792247A (zh) * 2016-12-13 2017-05-31 飞狐信息技术（天津）有限公司 减少时延的直播流推送方法及装置、直播系统
CN106791899A (zh) * 2016-12-13 2017-05-31 飞狐信息技术（天津）有限公司 直播中减少观众端画面卡顿的方法及装置以及客户端
CN106713947A (zh) * 2016-12-13 2017-05-24 飞狐信息技术（天津）有限公司 减少直播时延和卡顿的方法及装置、直播系统
CN106604064A (zh) * 2016-12-30 2017-04-26 北京奇艺世纪科技有限公司 一种快速开播方法及装置
CN107347065A (zh) * 2017-06-29 2017-11-14 上海鋆创信息技术有限公司 一种数据推送方法及装置、一种终端及存储介质
CN107809682A (zh) * 2017-11-14 2018-03-16 北京威速科技有限公司 一种调节发送缓冲数据量的视频流量控制方法
CN108347645B (zh) * 2018-01-19 2021-02-26 浙江大华技术股份有限公司 一种视频帧解码显示的方法及装置
CN110062003B (zh) * 2019-04-30 2022-01-25 北京金山云网络技术有限公司 视频数据发送方法、装置、电子设备及存储介质
CN110312159B (zh) * 2019-05-24 2022-03-11 深圳市朗强科技有限公司 一种信号接收装置、流媒体传输系统及流媒体传输方法
CN112804579B (zh) * 2019-11-14 2023-02-28 上海哔哩哔哩科技有限公司 视频播放方法、装置、计算机设备和可读存储介质
CN111491201B (zh) * 2020-04-08 2023-04-25 深圳市昊一源科技有限公司 调整视频码流的方法及视频丢帧处理方法
CN113556505B (zh) * 2020-04-23 2022-11-25 杭州海康威视数字技术股份有限公司 数据处理方法、装置、电子设备及可读存储介质
CN113873295B (zh) * 2021-10-26 2024-05-28 北京金山云网络技术有限公司 多媒体信息处理方法、装置、设备及存储介质

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101360058A (zh) * 2008-09-08 2009-02-04 华为技术有限公司 一种控制缓存溢出的方法及装置
CN101626507A (zh) * 2008-07-07 2010-01-13 华为技术有限公司 一种识别rtp包的帧类型的方法、装置及系统
JP2013207375A (ja) * 2012-03-27 2013-10-07 Kddi Technology Corp ストリーミングデータ伝送システム、ストリーミングデータの伝送方法およびプログラム
CN104394421A (zh) * 2013-09-23 2015-03-04 贵阳朗玛信息技术股份有限公司 视频帧的处理方法及装置
CN104702968A (zh) * 2015-02-17 2015-06-10 华为技术有限公司 一种视频帧丢帧方法及视频发送装置
CN105611309A (zh) * 2015-12-22 2016-05-25 北京奇虎科技有限公司 一种视频传输方法和装置

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7221656B1 (en) * 2002-06-18 2007-05-22 Nortel Networks Limited Technique for implementing an admission control scheme for data flows
CN101232455B (zh) * 2008-02-04 2011-05-11 中兴通讯股份有限公司 一种拥塞控制方法及装置
CN101699867A (zh) * 2009-10-28 2010-04-28 武汉世纪信通通信产业有限公司 一种视频数据传输速率动态调整方法
CN102223218B (zh) * 2010-04-15 2014-06-25 华为技术有限公司 媒体报文重传抑制方法和设备
CN102695058B (zh) * 2012-05-30 2014-07-02 北京世纪鼎点软件有限公司 基于大尺度缓冲策略的音、视频编码流控方法
CN102970585B (zh) * 2012-11-30 2015-01-14 武汉市烽视威科技有限公司 一种流媒体快速频道切换的方法
CN104702972B (zh) * 2014-01-03 2018-04-20 杭州海康威视数字技术股份有限公司 一种自适应图像数据发送方法和装置

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101626507A (zh) * 2008-07-07 2010-01-13 华为技术有限公司 一种识别rtp包的帧类型的方法、装置及系统
CN101360058A (zh) * 2008-09-08 2009-02-04 华为技术有限公司 一种控制缓存溢出的方法及装置
JP2013207375A (ja) * 2012-03-27 2013-10-07 Kddi Technology Corp ストリーミングデータ伝送システム、ストリーミングデータの伝送方法およびプログラム
CN104394421A (zh) * 2013-09-23 2015-03-04 贵阳朗玛信息技术股份有限公司 视频帧的处理方法及装置
CN104702968A (zh) * 2015-02-17 2015-06-10 华为技术有限公司 一种视频帧丢帧方法及视频发送装置
CN105611309A (zh) * 2015-12-22 2016-05-25 北京奇虎科技有限公司 一种视频传输方法和装置

Cited By (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN110830838A (zh) * 2018-08-10 2020-02-21 高新兴科技集团股份有限公司 一种安防高清录像倒播方法及装置
CN110830838B (zh) * 2018-08-10 2024-01-09 高新兴科技集团股份有限公司 一种安防高清录像倒播方法及装置
CN111556010A (zh) * 2020-03-23 2020-08-18 北京达佳互联信息技术有限公司 直播流缓存方法、装置、电子设备及存储介质
CN111666195A (zh) * 2020-05-26 2020-09-15 上海连尚网络科技有限公司 一种用于提供视频信息或者图像信息的方法与设备
CN111666195B (zh) * 2020-05-26 2024-06-04 上海连尚网络科技有限公司 一种用于提供视频信息或者图像信息的方法与设备
CN113068074A (zh) * 2021-03-24 2021-07-02 浙江大华技术股份有限公司 缓存方法和装置、计算机可读的存储介质及电子装置
CN113068074B (zh) * 2021-03-24 2023-03-24 浙江大华技术股份有限公司 缓存方法和装置、计算机可读的存储介质及电子装置
CN115866162A (zh) * 2021-09-26 2023-03-28 中移雄安信息通信科技有限公司 视频流生成方法、装置、电子设备及存储介质
CN114629996A (zh) * 2022-03-24 2022-06-14 咪咕音乐有限公司 视频彩铃推送方法、设备、存储介质及装置
CN116801034A (zh) * 2023-08-25 2023-09-22 海马云（天津）信息技术有限公司 客户端保存音视频数据的方法和装置
CN116801034B (zh) * 2023-08-25 2023-11-03 海马云（天津）信息技术有限公司 客户端保存音视频数据的方法和装置

Also Published As

Publication number Publication date
CN105611309B (zh) 2019-03-05
CN105611309A (zh) 2016-05-25

Similar Documents

Publication Publication Date Title
WO2017107649A1 (fr) Procédé et dispositif d'émission vidéo
US10425679B2 (en) Method and device for displaying information on video image
TWI519150B (zh) 追蹤來自一接收裝置之使用者互動
WO2017166509A1 (fr) Procédé et dispositif de commande de lecture vidéo
CN108270738B (zh) 一种视频处理方法及网络设备
KR101742164B1 (ko) 매트릭스 코드를 이용한 플레이스쉬프팅 이용
CN109257631B (zh) 视频轮播播放方法、装置、计算机设备及存储介质
WO2016131223A1 (fr) Procédé de perte de trame pour trame vidéo et appareil d'envoi de vidéo
US9997203B2 (en) System and method for streaming and recording video
CN109474854B (zh) 视频播放方法、播放列表的生成方法及相关设备
US20180097573A1 (en) Method and system for detecting image delay
US20100242066A1 (en) Method of Performing Random Seek Preview for Streaming Video
US10135897B2 (en) Backfill of video stream
US20180376195A1 (en) Live streaming quick start method and system
CA2991623A1 (fr) Systeme de production multimedia a fonctionnalite de planification
US20130335447A1 (en) Electronic device and method for playing real-time images in a virtual reality
US10021433B1 (en) Video-production system with social-media features
CN111447455A (zh) 直播视频流回放处理方法、装置及计算设备
US9824722B2 (en) Method to mark and exploit at least one sequence record of a video presentation
CN112423140A (zh) 视频播放方法、装置、电子设备和存储介质
CN111726641A (zh) 直播视频的播放处理方法、装置及服务器
CN111726657A (zh) 直播视频的播放处理方法、装置及服务器
US20180098119A1 (en) Audience measurement and feedback system
US10033930B2 (en) Method of reducing a video file size for surveillance
KR20140007893A (ko) 비디오 스트림을 최적화하기 위한 방법

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: 16877460

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: 16877460

Country of ref document: EP

Kind code of ref document: A1