WO2012075804A1 - Procédé, dispositif, système et terminal pour le stockage et la localisation de données de trame - Google Patents

Procédé, dispositif, système et terminal pour le stockage et la localisation de données de trame Download PDF

Info

Publication number
WO2012075804A1
WO2012075804A1 PCT/CN2011/076368 CN2011076368W WO2012075804A1 WO 2012075804 A1 WO2012075804 A1 WO 2012075804A1 CN 2011076368 W CN2011076368 W CN 2011076368W WO 2012075804 A1 WO2012075804 A1 WO 2012075804A1
Authority
WO
WIPO (PCT)
Prior art keywords
frame
connector
address
current
frame data
Prior art date
Application number
PCT/CN2011/076368
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 WO2012075804A1 publication Critical patent/WO2012075804A1/fr

Links

Images

Classifications

    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
    • G11B27/00—Editing; Indexing; Addressing; Timing or synchronising; Monitoring; Measuring tape travel
    • G11B27/02—Editing, e.g. varying the order of information signals recorded on, or reproduced from, record carriers
    • G11B27/031—Electronic editing of digitised analogue information signals, e.g. audio or video signals
    • G11B27/034—Electronic editing of digitised analogue information signals, e.g. audio or video signals on discs
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
    • G11B27/00—Editing; Indexing; Addressing; Timing or synchronising; Monitoring; Measuring tape travel
    • G11B27/10—Indexing; Addressing; Timing or synchronising; Measuring tape travel
    • G11B27/19—Indexing; Addressing; Timing or synchronising; Measuring tape travel by using information detectable on the record carrier
    • G11B27/28—Indexing; Addressing; Timing or synchronising; Measuring tape travel by using information detectable on the record carrier by using information signals recorded by the same method as the main recording
    • G11B27/30—Indexing; Addressing; Timing or synchronising; Measuring tape travel by using information detectable on the record carrier by using information signals recorded by the same method as the main recording on the same track as the main recording
    • G11B27/3027—Indexing; Addressing; Timing or synchronising; Measuring tape travel by using information detectable on the record carrier by using information signals recorded by the same method as the main recording on the same track as the main recording used signal is digitally coded
    • G11B27/3036—Time code signal
    • G—PHYSICS
    • G11—INFORMATION STORAGE
    • G11B—INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER
    • G11B27/00—Editing; Indexing; Addressing; Timing or synchronising; Monitoring; Measuring tape travel
    • G11B27/10—Indexing; Addressing; Timing or synchronising; Measuring tape travel
    • G11B27/19—Indexing; Addressing; Timing or synchronising; Measuring tape travel by using information detectable on the record carrier
    • G11B27/28—Indexing; Addressing; Timing or synchronising; Measuring tape travel by using information detectable on the record carrier by using information signals recorded by the same method as the main recording
    • G11B27/30—Indexing; Addressing; Timing or synchronising; Measuring tape travel by using information detectable on the record carrier by using information signals recorded by the same method as the main recording on the same track as the main recording
    • G11B27/3081—Indexing; Addressing; Timing or synchronising; Measuring tape travel by using information detectable on the record carrier by using information signals recorded by the same method as the main recording on the same track as the main recording used signal is a video-frame or a video-field (P.I.P)

Definitions

  • the present invention relates to the field of video broadcasting, and in particular, to a method, an apparatus, a system, and a terminal device for storing and locating frame data.
  • the streaming media system especially the streaming program source on the embedded platform, while downloading and playing, it is necessary to efficiently manage the stored data stream, and it is necessary to simplify the later operation processing to ensure that the embedded resources are not wasted at the same time.
  • the most important resources for embedded are CPU and memory.
  • the frame data to be stored includes a pointer, a frame type, a frame length, a timestamp, and a data.
  • the pointer is stored.
  • frame type, frame length, timestamp, data, the probability of occurrence of B and P frames in the streaming media file is 90-95%, and the pointers of B and P frames often do not have much effect in the application process. This wastes resources on the CPU, hard disk, or memory. In positioning, the B and P frame pointers reduce the efficiency of positioning and waste CPU and memory resources.
  • the purpose of the embodiment of the present invention is to provide a method for storing frame data, which aims to solve the problem that the streaming media file in the prior art has a large number of redundant pointers, frame types, frame lengths, and time stamps when being stored, which wastes CPU and hard disk. Or memory resources, and the problem of less efficient retrieval or positioning.
  • a method for storing frame data includes the following steps:
  • the connector data structure including three address members: a current I frame address, a previous I frame address, and a next I frame address;
  • the identification information is stored in the first space after the frame data; the identification information includes: a current I frame address, a previous I frame address, and a next I frame address.
  • Another object of the embodiments of the present invention is to provide an apparatus for storing frame data, the apparatus comprising:
  • a first initial module configured to pre-create a connector data structure, where the connector data structure includes three address members: a current I frame address, a previous I frame address, and a next I frame address;
  • a storage module configured to receive and store frame data
  • An identifier module configured to determine whether the frame data is I frame data, and if yes, store the identification information in the first space after the frame data; the identifier information includes: a current I frame address, a previous I frame address, and the following I frame address.
  • Another object of the embodiments of the present invention is to provide a method for positioning frame data, the method comprising the following steps:
  • the timestamp of the I frame is the time point at which the positioning needs to be located.
  • Another object of the embodiments of the present invention is to provide a frame data locating device, the device comprising:
  • An information acquisition module configured to acquire a time point that needs to be located
  • a second initial module configured to pre-create a second temporary pointer variable of the connector data structure, and the second temporary pointer variable points to the pre-created global connector pointer variable;
  • a positioning module configured to obtain a timestamp of the I frame according to the current I frame address member pointed to by the second temporary pointer variable; determine whether the time point to be located is smaller than the timestamp of the I frame, and if not, the timestamp of the I frame is required The point in time of positioning.
  • Another object of the embodiments of the present invention is to provide a frame data storage and positioning system, the system comprising: a frame data storage device and a frame data positioning device;
  • the frame data storage device is configured to:
  • the connector data structure including three address members: a current I frame address, a previous I frame address, and a next I frame address;
  • the identification information is stored in the first space after the frame data; the identification information includes: a current I frame address, a previous I frame address, and a next I frame address;
  • the frame data locating device is configured to:
  • the timestamp of the I frame is the time point at which the positioning needs to be located.
  • Another object of embodiments of the present invention is to provide a terminal device including the frame data storage and positioning system.
  • the identification information is stored after the I frame data, and the acquired time point of the positioning and the frame recorded in the frame data storage device are obtained.
  • the timestamps are compared to determine the time point at which the positioning needs to be located; only the I frame data is stored in the stored process, and the corresponding identification information is stored, and the B frames and P frames that appear in the frame data need not store the identification information, which greatly saves
  • the storage efficiency and storage space reduce the memory consumption, and since only the identification information of the I frame is stored, in the positioning process, only the association relationship of the members in the connector data structure is required to achieve the purpose of quickly hopping and locating the I frame. Reduced memory consumption.
  • FIG. 1 is a general flowchart of a frame data storage method according to an embodiment of the present invention
  • FIG. 2 is a specific flowchart of a method for storing frame data according to an embodiment of the present invention
  • FIG. 3 is a schematic structural diagram of a frame data storage device according to an embodiment of the present invention.
  • FIG. 4 is a general flowchart of a method for positioning a frame data according to an embodiment of the present invention
  • FIG. 5 is a specific flowchart of a method for positioning a frame data according to an embodiment of the present invention
  • FIG. 6 is a schematic structural diagram of a frame data positioning apparatus according to an embodiment of the present invention.
  • FIG. 7 is a schematic structural diagram of a frame data storage and positioning system according to an embodiment of the present invention.
  • the invention stores the frame data, the frame length corresponding to the frame data, the frame timestamp and the start address of the frame, and determines the I frame, stores the identification information after the I frame data, and determines the acquired time point and the required positioning.
  • the frame timestamps recorded in the frame data storage device are compared to determine a time point that needs to be located; only the I frame data stores the corresponding identification information in the storage process, and the B frames and P frames that appear in the frame data in a large amount are not Need to store the identification information, which greatly improves the storage efficiency, saves the storage space and reduces the memory consumption, and achieves the purpose of fast storage and jump positioning through the association relationship of the members in the connector data structure, thereby reducing the memory consumption.
  • FIG. 1 is a general flowchart of a method for storing frame data according to an embodiment of the present invention. The method includes the following steps:
  • S101 Receive and store frame data, and record a start address of the frame data.
  • the frame data stores a frame length, a frame timestamp I_ms, and frame data when stored;
  • the identifier information includes: a current I frame address, a previous I frame address, and a next I frame address;
  • the first space is a space reserved for the memory occupied by the connector, and is used for storing the identification information
  • the identifier information is information of a connector data structure, and is used to identify that the received and stored frame data is I frame data, and the identifier information associates the I frame in the frame data;
  • the frame data by determining whether the frame data is an I frame, only the received I frame will store the identification information after the frame data, and only the I frame increases the appropriate memory consumption.
  • I The probability of occurrence of a frame is very small, so that no processing is performed on B frames and P frames with high probability of occurrence, a large amount of storage space and storage efficiency are saved, and memory consumption is reduced.
  • FIG. 2 is a specific flowchart of a method for storing frame data according to an embodiment of the present invention. The method includes the following steps:
  • the connector data structure creation process is specifically as follows:
  • the cur represents the current I frame address saved by the connector
  • the last represents the last I frame address saved by the connector
  • the next represents the next I frame address saved by the connector
  • the creation process of the global connector pointer variable is struct I_linker* m_g_v_w;
  • S203 Receive and store frame data, and record a start address of the frame data.
  • the frame data stores a frame length, a frame timestamp I_ms, and frame data when stored;
  • step S204 it is determined whether it is an I frame, if not, then returns to step S203, and if yes, proceeds to step S205;
  • the first space creation process is a space for reserving the memory size occupied by the connector, and is used for storing the identifier information, where the identifier information is information of the connector data structure, specifically sizeof (struct I_linker);
  • the identification information is stored after the frame data only when the frame is I.
  • the process of storing the identification information is based on the global connector pointer variable of the pre-created connector data structure and the first A temporary pointer variable and the interaction of the two variables and their members are completed. Only for the I frame, the appropriate memory consumption is increased. In the entire frame data storage process, the probability of occurrence of the I frame is very small, so that the probability of occurrence is high. B frames and P frames do not do any processing, which saves a lot of storage space and storage efficiency and reduces memory consumption.
  • FIG. 3 is a schematic structural diagram of a frame data storage apparatus according to an embodiment of the present invention.
  • the frame data storage device includes: a first initial module, a storage module, and an identification module;
  • a first initial module connected to the storage module, for creating a connector data structure, the connector data structure comprising three members: a current I frame address, a previous I frame address, and a next I frame address;
  • the connector data structure creation process is as follows:
  • the cur represents the current I frame address saved by the connector
  • the last represents the last I frame address saved by the connector
  • the next represents the next I frame address saved by the connector
  • a storage module which is respectively connected to the first initial module and the identifier module, configured to receive and store frame data, and record a start address of the frame data;
  • the frame data stores a frame length, a frame timestamp I_ms, and frame data when stored;
  • the identification module is connected to the storage module, and is configured to determine whether the received and stored frame data is an I frame, and if yes, store the identification information after the frame data;
  • the identification information is information of a connector data structure, and the identifier information storage process is:
  • the first space A of the memory occupied by the reserved connector is used to store the identification information, specifically sizeof(struct I_linker);
  • the connector data structure and its members are created by the first initial module.
  • the frame data received by the storage module is an I frame
  • the start address of the frame data is recorded, and the identifier module determines whether the received and stored data is In the case of an I frame, if yes, the identity module stores the identification information after the frame data; only the I frame increases the appropriate memory consumption.
  • the probability of occurrence of the I frame is very small, so that the probability of occurrence is high. B frames and P frames do not do any processing, which saves a lot of storage space and storage efficiency and reduces memory consumption.
  • FIG. 4 is a general flowchart of a method for positioning a frame data according to an embodiment of the present invention. The method includes the following steps:
  • the unit of the time point seek_ms to be positioned is milliseconds, which is the relative display time point corresponding to the I frame, which is the time offset starting from 0 ms, and the display start time is recorded in 0 ms at the start of display;
  • a second temporary pointer variable of the connector data structure is created in advance, and the second temporary pointer variable points to the pre-created global connector pointer variable; and the timestamp of the I frame is obtained according to the current I frame address member pointed to by the second temporary pointer variable;
  • the timestamp of the I frame is a time point that needs to be located
  • the timestamp I_ms of the I frame is a timestamp saved when the frame data is stored
  • the obtained time point of the required positioning is compared with the timestamp of the I frame. If the time point of the positioning is not less than the timestamp of the I frame, the timestamp of the I frame is the time point to be located. During the locating process, only the timestamp of the I frame needs to be determined.
  • the I frame data is followed by the identification information, and the front and rear I frame data are associated by the identification information, so that the identification information can be traced back to the required location.
  • the time point of the I frame and the start address of the I frame corresponding to the time point that needs to be located avoid the process of jumping from the I frame data to the B frame or the P frame data, thereby improving the positioning speed and reducing the memory consumption.
  • FIG. 5 is a specific flowchart of a method for positioning a frame data according to an embodiment of the present invention. The method includes the following steps:
  • the global connector pointer variable is created before the time point at which the positioning needs to be acquired, and the current connector pointer is saved;
  • I_linker* seek m_g_v_w
  • the timestamp I_ms of the I frame is a timestamp saved when the frame data is stored
  • step S504 determining whether the time point seek_ms to be located is smaller than the timestamp I_ms of the I frame, if not, proceeding to step S505, and if yes, proceeding to step S506;
  • the timestamp I_ms of the I frame is a time point that needs to be located
  • the second temporary pointer variable is created, the current connector pointer is obtained by the second temporary pointer variable and the global connector pointer variable, and the current I frame address member of the second temporary pointer variable is obtained.
  • the timestamp of the I frame is obtained by comparing the timestamp of the I frame with the time point to be located, and obtains the time point at which the positioning needs to be located.
  • the second temporary pointer variable is passed.
  • the last I frame address member obtains the identification information stored after the previous frame data, and saves it to the second temporary pointer variable, and so on to obtain the time point that needs to be finally positioned, and only needs to locate the identification information of the I frame.
  • the three member associations of the connector data structure quickly jump to the time point that needs to be located, thereby avoiding the process of jumping from the I frame data to the B frame or the P frame data, thereby improving the positioning efficiency and reducing the efficiency. Memory consumption.
  • FIG. 6 is a schematic structural diagram of a frame data positioning apparatus according to an embodiment of the present invention.
  • the frame data locating device includes: an information acquiring module, a second initial module, and a positioning module;
  • the information acquisition module is connected to the second initial module, and is used to obtain a time point seek_ms that needs to be located;
  • the second initial module is respectively connected to the information obtaining module and the positioning module, and is configured to create a second temporary pointer variable seek of the connector data structure, and the second temporary pointer variable seek points to the global connector pointer variable m_g_v_w; according to the second temporary pointer variable
  • the current I frame address member obtains the timestamp I_ms of the I frame;
  • the global connector pointer variable is created before the time point at which the positioning needs to be acquired, and the current connector pointer is saved;
  • I_linker* seek m_g_v_w
  • the positioning module is connected to the second initial module, and is used to determine whether the time point seek_ms to be located is smaller than the timestamp I_ms of the I frame. If not, the timestamp I_ms of the I frame is the time point to be located; if yes, the The last I frame address member of the second temporary pointer variable seek->last obtains the identification information stored after the previous frame data, and saves it to the second temporary pointer variable seek, and notifies the second initial module to again according to the second temporary The current I frame address member of the pointer variable obtains the timestamp I_ms of the I frame.
  • a second temporary pointer variable is created by the second initial module, and the current connector pointer is obtained by the second temporary pointer variable and the global connector pointer variable, according to the current I of the second temporary pointer variable.
  • the frame address member obtains the timestamp of the I frame; the locating module compares the timestamp of the I frame with the time point to be located, and obtains a time point that needs to be located.
  • FIG. 7 is a schematic structural diagram of a frame data storage and positioning system according to an embodiment of the present invention.
  • the frame data storage and positioning system includes: the frame data storage device according to the third embodiment, and the frame data positioning device according to the sixth embodiment, wherein the frame data storage device is connected to the frame data positioning device.
  • the system described includes:
  • a first initial module connected to the storage module, for creating a connector data structure, the connector data structure comprising three members: a current I frame address, a previous I frame address, and a next I frame address;
  • a storage module connected to the first initial module and the identifier module, configured to receive and store frame data, and record a starting address of the frame data;
  • the identification module is connected to the storage module, and is configured to determine whether the received and stored frame data is an I frame, and if yes, store the identification information after the frame data;
  • An information acquiring module is connected to the second initial module, and is used to obtain a time point that needs to be located;
  • a second initial module connected to the information acquisition module and the positioning module, configured to create a second temporary pointer variable of the connector data structure, and the second temporary pointer variable points to the pre-created global connector pointer variable; according to the second temporary pointer variable
  • the current I frame address member obtains the timestamp of the I frame
  • the positioning module is connected to the second initial module, and is used to determine whether the time point to be located is smaller than the timestamp of the I frame. If not, the timestamp of the I frame is the time point to be located; if yes, the second temporary The last I frame address member of the pointer variable obtains the identification information stored after the previous frame data, and saves it to the second temporary pointer variable, and notifies the second initial module to again according to the current I frame address member of the second temporary pointer variable. Get the timestamp of the I frame.
  • the working process of the frame data storage and positioning system is as follows:
  • the first initial module creates a connector data structure and three members thereof;
  • the storage module receives and stores the frame data, the frame data includes a frame length, a frame timestamp, and frame data, and simultaneously records a start address of the frame data;
  • the identification module determines the frame data.
  • the identification information is stored after the frame data; the storage of the identification information is completed by the global connector pointer variable of the connector data structure and the first temporary pointer variable; the information acquisition module Obtaining the point in time at which the positioning needs to be located, the second initial module creates a second temporary pointer variable of the connector data structure, and the second temporary pointer variable points to the pre-created global connector pointer variable; the current I frame address member according to the second temporary pointer variable Obtaining a timestamp of the I frame; the positioning module determines whether the time point to be located is smaller than the timestamp of the I frame, and if not, the timestamp of the I frame is the time point to be located; if yes, the second temporary pointer variable The last I frame address member obtains the identification information stored after the previous frame of data, and saves to the second Time pointer variable, and inform the second initial module to obtain the timestamp of the I frame according to the current I frame address member of the second temporary pointer variable; in the
  • the identification information stored after the I frame data is passed in the frame data locating device. Determining the acquired time point that needs to be located is compared with the frame timestamp recorded in the frame data storage device to determine a time point that needs to be located; only the I frame data is stored in the storage process, and the corresponding identification information is stored in the frame data.
  • a large number of B frames and P frames do not need to store identification information, which greatly saves storage efficiency and storage space, reduces memory consumption, and avoids the process of jumping from I frame data to B frame or P frame data during positioning. Improves the efficiency of positioning and reduces memory consumption.
  • the frame data storage and positioning system provided by the present invention can be applied to a terminal device that needs to store and locate frame data, such as a mobile phone or the like.

Landscapes

  • Engineering & Computer Science (AREA)
  • Multimedia (AREA)
  • Position Fixing By Use Of Radio Waves (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

L'invention concerne un procédé, un dispositif, un système et un terminal pour le stockage et la localisation de données de trame. L'information d'identification est stockée après les données de trame I par stockage des données de trame et de la longueur de trame, de l'horodatage de trame et de l'adresse de début de trame correspondant aux données de trame. Un instant devant être localisé est confirmé par comparaison de l'instant devant être localisé acquis et de l'horodatage de trame enregistré dans un dispositif de stockage de données de trame; l'information d'identification correspondante est stockée uniquement par les données de trame I pendant une opération de stockage, le stockage de l'information d'identification n'étant pas nécessaire dans les trames B et les trames P massivement présentes dans les données de trame. Cela permet d'améliorer de manière importante l'efficacité du stockage, d'économiser beaucoup d'espace de stockage et de réduire la consommation de mémoire. L'objectif visant à obtenir un stockage rapide et une localisation de saut est réalisé par la relation d'association d'éléments dans une structure de données de connecteur, ce qui permet de réduire la consommation de mémoire.
PCT/CN2011/076368 2010-12-08 2011-06-27 Procédé, dispositif, système et terminal pour le stockage et la localisation de données de trame WO2012075804A1 (fr)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN2010105797464A CN102169709A (zh) 2010-12-08 2010-12-08 一种帧数据存储和定位的方法、系统、终端设备
CN201010579746.4 2010-12-08

Publications (1)

Publication Number Publication Date
WO2012075804A1 true WO2012075804A1 (fr) 2012-06-14

Family

ID=44490840

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2011/076368 WO2012075804A1 (fr) 2010-12-08 2011-06-27 Procédé, dispositif, système et terminal pour le stockage et la localisation de données de trame

Country Status (2)

Country Link
CN (1) CN102169709A (fr)
WO (1) WO2012075804A1 (fr)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3334165A4 (fr) * 2015-08-04 2019-03-20 Hangzhou Hikvision Digital Technology Co., Ltd. Procédé de stockage, procédé et dispositif de lecture, de flux de données vidéo

Families Citing this family (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102868930B (zh) * 2012-09-06 2015-04-08 珠海全志科技股份有限公司 传输流数据包解码方法及装置
CN111093090A (zh) * 2018-10-24 2020-05-01 玲珑视界科技（北京）有限公司 一种基于tcp的组播频道快速切换系统及方法
CN111436004B (zh) * 2019-01-11 2023-02-21 腾讯科技（深圳）有限公司 视频播放方法、装置和设备、计算机可读存储介质

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1980390A (zh) * 2005-12-07 2007-06-13 联合信源数字音视频技术（北京）有限公司 支持精确定位的音视频媒体数据组织实现方法
CN101009825A (zh) * 2006-01-27 2007-08-01 中国科学院声学研究所 基于rtp协议的iptv机顶盒组/单播无缝切换方法
CN101193299A (zh) * 2006-11-30 2008-06-04 三洋电机株式会社 解码电路
US20090303867A1 (en) * 2007-09-18 2009-12-10 Hwang-Soo Lee Apparatus and method for preventing data read error for orthogonal frequency division multiplexing symbol demodulation

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101202873B (zh) * 2006-12-13 2012-07-25 株式会社日立制作所 信息记录再现装置和信息记录再现方法

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1980390A (zh) * 2005-12-07 2007-06-13 联合信源数字音视频技术（北京）有限公司 支持精确定位的音视频媒体数据组织实现方法
CN101009825A (zh) * 2006-01-27 2007-08-01 中国科学院声学研究所 基于rtp协议的iptv机顶盒组/单播无缝切换方法
CN101193299A (zh) * 2006-11-30 2008-06-04 三洋电机株式会社 解码电路
US20090303867A1 (en) * 2007-09-18 2009-12-10 Hwang-Soo Lee Apparatus and method for preventing data read error for orthogonal frequency division multiplexing symbol demodulation

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
EP3334165A4 (fr) * 2015-08-04 2019-03-20 Hangzhou Hikvision Digital Technology Co., Ltd. Procédé de stockage, procédé et dispositif de lecture, de flux de données vidéo
US10332565B2 (en) 2015-08-04 2019-06-25 Hangzhou Hikvision Digital Technology Co., Ltd. Video stream storage method, reading method and device

Also Published As

Publication number Publication date
CN102169709A (zh) 2011-08-31

Similar Documents

Publication Publication Date Title
WO2016192254A1 (fr) Procédé et dispositif de lecture en ligne d'une vidéo en réseau
WO2012075804A1 (fr) Procédé, dispositif, système et terminal pour le stockage et la localisation de données de trame
WO2016023148A1 (fr) Procédé de régulation de paquets, commutateur et contrôleur
WO2015085765A1 (fr) Procédé de poussée d'informations et terminal intelligent
WO2017092268A1 (fr) Système, dispositif et procédé de traitement de défaillance d'un terminal
WO2010021493A2 (fr) Procédé et appareil destinés à émettre des données radiodiffusées, et procédé et appareil destinés à recevoir des données radiodiffusées
WO2013004030A1 (fr) Écran à cristaux liquides, et son procédé et son dispositif d'attaque
WO2017084311A1 (fr) Procédé et dispositif pour accélérer la lecture d'une vidéo à fragment unique
WO2017036218A1 (fr) Procédé et dispositif de lecture de fichier multimédia
WO2016065705A1 (fr) Procédé et appareil de mise à jour de liste de canaux, et dispositif terminal
WO2017152603A1 (fr) Procédé et appareil d'affichage
WO2018028121A1 (fr) Procédé et dispositif de gestion de l'espace de stockage d'une partition de données
WO2017092267A1 (fr) Procédé et dispositif de gestion de canal
WO2017063368A1 (fr) Procédé et dispositif d'insertion de publicité vidéo
WO2017016310A1 (fr) Procédé et appareil pour configurer de façon dynamique des données de fonction de commande à distance
WO2017036204A1 (fr) Procédé et dispositif de positionnement de foyer pour une commutation d'application
WO2016056856A1 (fr) Procédé et système pour générer des données de vérification d'intégrité
WO2017215233A1 (fr) Procédé et système de commande d'interrupteur de terminal
WO2018076453A1 (fr) Procédé d'affichage d'application associée, dispositif et terminal mobile
WO2012028080A1 (fr) Procédé et dispositif servant à sauvegarder des informations données d'un terminal mobile
WO2019080401A1 (fr) Procédé et appareil de conversion d'instruction de script, et support de stockage lisible par ordinateur
WO2017032060A1 (fr) Procédé et appareil de fonctionnement d'interface et montre intelligente
WO2020114333A1 (fr) Procédé d'enseignement de réalité augmentée (ra) basé sur une vidéo, télévision intelligente, support de stockage et dispositif
WO2018010277A1 (fr) Procédé et dispositif de configuration de tv intelligente
WO2014042470A1 (fr) Procédé d'édition d'informations d'affichage et dispositif électronique correspondant

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

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

32PN Ep: public notification in the ep bulletin as address of the adressee cannot be established

Free format text: NOTING OF LOSS OF RIGHTS PURSUANT TO RULE 112(1) EPC (EPO FORM 1205A DATED 24/10/13)

122 Ep: pct application non-entry in european phase

Ref document number: 11847540

Country of ref document: EP

Kind code of ref document: A1