CN101888513B - Method for converting video frame rate - Google Patents
Method for converting video frame rate Download PDFInfo
- Publication number
- CN101888513B CN101888513B CN2010102140520A CN201010214052A CN101888513B CN 101888513 B CN101888513 B CN 101888513B CN 2010102140520 A CN2010102140520 A CN 2010102140520A CN 201010214052 A CN201010214052 A CN 201010214052A CN 101888513 B CN101888513 B CN 101888513B
- Authority
- CN
- China
- Prior art keywords
- frame
- output
- input
- frame rate
- timestamp
- 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.)
- Expired - Fee Related
Links
Images
Abstract
The invention discloses a method for converting video frame rate. Each frame in an input video sequence has a time stamp; and the video sequence is input in an ascending order according to the time stamp; and after a desired time stamp of each output frame is calculated, a frame closest to the desired time stamp is selected from an input frame queue and output. The method has the advantages of supporting the conversion from any input frame rate to any output frequency rate not greater than the input frequency rate, supporting the input of variable frame rate and having high tolerance, along with high universality and high stability.
Description
Technical field
The present invention relates to the video code conversion field, relate in particular to a kind of method for converting video frame rate.
Background technology
At present the video frequency program on the mobile phone mainly contains two sources greatly, the one, through video frequency collection card from TV signal images acquired and transcoding, the 2nd, the media file transcoding from the PC.Because the mobile phone terminal computing capability is more weak, and the wireless transmission limited bandwidth, often last than TV signal, the PC media file of the frame per second that the mobile video coding is adopted is much lower.The frame per second that the mobile video coding adopts is generally 5 frames/second-15 frame/second.The frame per second of TV signal is 25 frame/seconds (pal mode) or 30 frame/seconds (TSC-system formula), and the media file frame per second on the PC also majority at 15 frames/more than second.Therefore, when carrying out the mobile video transcoding, need a kind of frame rate conversion algorithm from the high frame-rate video sequence of input, to extract the needed low frame-rate video sequence of coding.
Frame rate conversion method commonly used at present is to concern according to the multiple between input frame rate and the output frame rate; Every separated some frames (for example extract a frame from the incoming frame sequence; Input frame rate was 25 frame/seconds; The output frame rate of expectation was 5 frame/seconds, then need be from list entries per 5 frames extract the output of 1 frame), but this method can become when input frame rate and output frame rate an odd lot doubly concern and is difficult to processing; In addition, for the video acquisition system of some low and middle-ends, when video acquisition generation frame losing, can cause the not strict frame per second that sets that reaches of video sequence frame per second of gathering; And the media file format on the part PC, for example RMVB also supports to become frame-rate video to make that the time interval between input video sequence frame and the frame is not constant.
Summary of the invention
The purpose of the embodiment of the invention is to propose a kind of method for converting video frame rate, and being intended to solve prior art can't be transformed into arbitrarily output frame rate, can't handle problems such as the input video frame per second is variable, input video frame losing from input frame rate arbitrarily.
To achieve these goals, the embodiment of the invention proposes a kind of method for converting video frame rate, and this method realizes like this:
A. initialization n ← 1, Q
1← P
1, O
1← I
1, with Q
1As first output frame output;
B. upgrade O
2← O
1+ Δ, n ← 2, m ← 2, Best
m=+∞;
C. judge | I
n-O
m|＜Best
m, get into steps d;
D. upgrade Best
m← | I
n-O
m|, Q
m← P
n
E. make n ← n+1, forward next incoming frame to, get into step c;
P wherein
nBe the n frame of input, I
nIt is the timestamp of the n frame of input; Q
mFor being suitable as most at present the frame of m output, O
mThe expected time that is m output frame stabs, and Δ is according to the due time interval of output frame rate, O between the output frame
mSatisfy O
m=O
M-1+ Δ; Best
mBe in the present incoming frame and O
mImmediate timestamp and O
mAbsolute value (promptly | I
n-O
m| minimum value) ,+∞ is a positive infinity.
Preferably, also comprise after the said step b:
Judge | I
n-O
m|>=Bes
m, get into step f;
F. with Q
mAs m output frame output;
G. make m ← m+1, O
m← O
M-1+ Δ,
H. change steps d over to;
I wherein
nIt is the timestamp of the n frame of input; Q
mFor being suitable as most at present the frame of m output, O
mThe expected time that is m output frame stabs, and Δ is according to the due time interval of output frame rate, O between the output frame
mSatisfy O
m=O
M-1+ Δ; Best
mBe in the present incoming frame and O
mImmediate timestamp is with O
mThe absolute value of difference (promptly | I
n-O
m| minimum value).
Preferably, also comprise between said step g and the step h:
I. judge I
n-O
m＞Δ then gets into step J, otherwise gets into steps d;
J. calculate i=(I
n-O
m) Δ, wherein symbol " " representative divide exactly;
K. with frame Q
M-1Repeat i output, upgrade m ← m+i, O
m← O
M-i+ i* Δ.
I wherein
nIt is the timestamp of the n frame of input; Q
mFor being suitable as most at present the frame of m output, O
mThe expected time that is m output frame stabs, and Δ is according to the due time interval of output frame rate, O between the output frame
mSatisfy O
m=O
M-1+ Δ.
Beneficial effect of the present invention: one, have good versatility.Support is transformed into output frame rate arbitrarily from input frame rate arbitrarily, also supports to become the input of frame per second, only requires that input frame rate is greater than or equal to output frame rate.Be applicable to the transcoding of live telecast signal and the transcoding of media file; Two, fault-tolerance is preferably arranged.When input video sequence generation frame losing causes output frame to can not find the coupling frame; The present invention can detect; The output frame that can not find coupling uses a current nearest output frame to substitute; With the frame per second that keeps exporting, and follow-up output frame can not cause losing synchronously with incoming frame because of the front frame losing.
Description of drawings
Fig. 1 is the method for converting video frame rate flow chart of the embodiment of the invention 1;
Fig. 2 is the method for converting video frame rate flow chart of the embodiment of the invention 2.
Embodiment
In order to make the object of the invention, technical scheme and advantage clearer, below in conjunction with accompanying drawing and embodiment, the present invention is further elaborated, for the ease of explanation, only show the part relevant with the embodiment of the invention.Should be appreciated that the specific embodiment that this place is described, only be used to explain the present invention, not in order to restriction the present invention.
Each frame in the video sequence that the present invention need import all has timestamp (i.e. this frame collection or the time mark of playing), and video sequence is imported according to the timestamp incremental order.The present invention uses first incoming frame as output, and uses the timestamp of first incoming frame to stab as the expected time of first output frame.According to output frame rate, the expected time that calculates next output frame stabs then.For after each incoming frame, relatively whether its timestamp more stabs near the expected time of output frame than a last incoming frame.If more approaching, then abandon an incoming frame, let current incoming frame become new output candidate frame; If more approaching, then use an incoming frame as output, and calculate the expected time stamp of next output frame according to output frame rate unlike previous frame.For better fault-tolerance is arranged, forward to seek next output frame before, check that whether current incoming frame timestamp stabs to surpass the time interval of an output frame big than the expected time of next output frame.If, then there are one or more output frame to can not find the incoming frame of coupling, need carry out fault-tolerant processing, with the optimum Match that finds that ensures that follow-up output frame still can be correct.
Embodiment one
Make P
nBe the n frame of input, I
nIt is the timestamp of the n frame of input; Make Q
mFor being suitable as most at present the frame of m output, O
mThe expected time that is m output frame stabs, and Δ is according to the due time interval of output frame rate, then O between the output frame
mSatisfy O
m=O
M-1+ Δ; Make Best
mBe in the present incoming frame and O
mImmediate timestamp is with O
mThe absolute value of difference (promptly | I
n-O
m| minimum value, for example: for Best
1, be exactly among the different n, | I
n-O
1| middle minimum; For Best
2, be exactly among the different n, | I
n-O
2| middle minimum, by that analogy); It is to set the frame output time under the perfect condition according to output frame rate that the wherein said expected time stabs, and for example, if output frame rate is 5 frame per seconds, it is 0 second that the expected time of first frame stabs, and it is exactly 0.4 that second frame is exactly 0.2, the three, by that analogy.Each frame in the video sequence that the present invention need import all has timestamp, and video sequence is according to timestamp incremental order input, if the video of input is to collect from TV signal, timestamp can obtain from the acquisition time of image; If the video of input is the media file on the PC, then timestamp can obtain from the PTS (Presentation Time Stamp, reproduction time stabs) of image.
Shown in Figure 1 is the method for converting video frame rate flow chart of the embodiment of the invention.Said method comprising the steps of:
S101, initialization n ← 1, Q
1← P
1, O
1← I
1, with Q
1As first output frame output;
S102 upgrades O
2← O
1+ Δ, n ← 2, m ← 2, Best
m=+∞, wherein+∞ representes positive infinity;
S103, the absolute value of more current incoming frame timestamp and stamp difference of current candidate's output frame expected time (| I
n-O
m| with Best
mSize, if | I
n-O
m| less than Best
m, change step S104; Otherwise change step S106;
S104 upgrades Best
m← | I
n-O
m|, Q
m← P
n
S105, n ← n+1 forwards next incoming frame to, gets into step S103;
S106 is with Q
mAs m output frame output;
S107 makes m ← m+1, O
m← O
M-1+ Δ;
S108 is if judge I
n-O
m＞Δ then gets into step S109, otherwise gets into step S104;
S109 calculates i=(I
n-O
m) Δ, wherein symbol " " representative divide exactly;
S110 is with frame Q
M-1Repeat i output, upgrade m ← m+i, O
m← O
M-i+ i* Δ gets into step S104.
Because the input video sequence timestamp increases progressively, if therefore | I
n-O
m|＞| I
N-1-O
m|, then | I
N+1-O
m|, | I
N+2-O
m| ... also must be greater than | I
N-1-O
m|, can confirm Best
mCan not be updated again, with O
mImmediate incoming frame is exactly P
N-1Method step S103 judges new incoming frame P earlier
n| I
n-O
m| can upgrade Best
mIf can, execution in step S104 upgrades Best
m, and make P
nThe output candidate frame Q of Cheng Xin
m, forward to and handle next incoming frame, return step S103; If can not, can confirm I
N-1With O
mBe immediate, thus execution in step S106, output Q
mThen forward to and seek next output frame at step S107.The adding of step S108, S109, S110 is in order to make method that better fault-tolerance arranged, and avoids causing input and output to lose synchronously under the situation of list entries frame losing.If I
n-O
m＞Δ has been explained from O
mTo O
M+1This time period does not have corresponding incoming frame, does not have in the list entries and O
mThe frame that is complementary.And except O
m, O
M+1Possibly can not find the incoming frame that is complementary Deng also, therefore through calculating i=(I
n-O
m) Δ, obtain what output frames and can't find the incoming frame that is complementary.These output frames that can not find coupling use a current nearest output frame O
M-1Substitute, to keep the frame per second of output.Upgrade m ← m+i then, O
m← O
M-i+ i* Δ.Final updating Best
m, let Pn become output candidate frame Q
m
The embodiment of the invention was stabbed through the expected time that calculates each output frame, from the incoming frame formation, selected successively then with the expected time and stabbed the most approaching frame output, and have fault-tolerant treatment.Embodiment of the invention versatility is good, and is more stable, supports to be transformed into output frame rate arbitrarily from input frame rate arbitrarily, also supports to become the input (only requiring that input frame rate is greater than or equal to output frame rate and gets final product) of frame per second; The embodiment of the invention has fault-tolerance preferably; When input video sequence generation frame losing causes output frame to can not find the coupling frame; The inventive method can detect; The output frame that can not find coupling uses a current nearest output frame to substitute, and with the frame per second that keeps exporting, and follow-up output frame can not cause losing synchronously with incoming frame because of the front frame losing.
Embodiment two
Make P
nBe the n frame of input, I
nIt is the timestamp of the n frame of input; Make Q
mFor being suitable as most at present the candidate frame of m output, O
mThe expected time that is m output frame stabs, and Δ is according to the due time interval of output frame rate, then O between the output frame
mSatisfy O
m=O
M-1+ Δ; Make Best
mBe in the present incoming frame and O
mImmediate timestamp and O
mThe absolute value of difference (promptly | I
n-O
m| minimum value, for example: for Best
1, be exactly among the different n, | I
n-O
1| middle minimum; For Best
2, be exactly among the different n, | I
n-O
2| middle minimum, by that analogy); It is to set the frame output time under the perfect condition according to output frame rate that the wherein said expected time stabs, and for example, if output frame rate is 5 frame per seconds, it is 0 second that the expected time of first frame stabs, and it is exactly 0.4 that second frame is exactly 0.2, the three, by that analogy.Each frame in the video sequence that the present invention need import all has timestamp, and video sequence is according to timestamp incremental order input, if the video of input is to collect from TV signal, timestamp can obtain from the acquisition time of image; If the video of input is the media file on the PC, then timestamp can obtain from the PTS (Presentation Time Stamp, reproduction time stabs) of image.
Shown in Figure 2 is the method for converting video frame rate flow chart of the embodiment of the invention.The difference of said method and embodiment 1 is that it does not comprise step S108, S109, S110, directly gets into step S104 from step S107, said method comprising the steps of:
S101, initialization n ← 1, Q
1← P
1, O
1← I
1, with Q
1As first output frame output;
S102 upgrades O
2← O
1+ Δ, n ← 2, m ← 2, Best
m=+∞, wherein+∞ representes positive infinity;
S103, the absolute value of more current incoming frame timestamp and stamp difference of current candidate's output frame expected time (| I
n-O
m|) and Best
mSize, if | I
n-O
m| less than Best
m, change step S104; Otherwise change step S106;
S104 upgrades Best
m← | I
n-O
m|, Q
m← P
n
S105, n ← n+1 forwards next incoming frame to, gets into step S103;
S106 is with Q
mAs m output frame output;
S107 makes m ← m+1, O
m← O
M-1+ Δ gets into step S104;
Because the input video sequence timestamp increases progressively, if therefore | I
n-O
m|＞| I
N-1-O
m|, then | I
N+1-O
m|, | I
N+2-O
m| ... also must be greater than | I
N-1-O
m|, can confirm Best
mCan not be updated again, with O
mImmediate incoming frame is exactly P
N-1Method step S103 judges new incoming frame P earlier
n| I
n-O
m| can upgrade Best
mIf can, execution in step S104 upgrades Best
m, and make P
nThe output candidate frame Q of Cheng Xin
m, forward to and handle next incoming frame, return step S103; If can not, can confirm I
N-1With O
mBe immediate, thus execution in step S106, output Q
mThen forward to and seek next output frame, jump to step S104 then at step S107.
The embodiment of the invention was stabbed through the expected time that calculates each output frame, from the incoming frame formation, selected successively then with the expected time and stabbed the most approaching frame output.Embodiment of the invention versatility is good, and is more stable, supports to be transformed into output frame rate arbitrarily from input frame rate arbitrarily, also supports to become the input (only requiring that input frame rate is greater than or equal to output frame rate and gets final product) of frame per second.
Those having ordinary skill in the art will appreciate that; All or part of step in realization the foregoing description method can be accomplished through the program command related hardware; Described program can be stored in the computer read/write memory medium, and described storage medium can be ROM, RAM, disk, CD etc.
The above is merely preferred embodiment of the present invention, not in order to restriction the present invention, all any modifications of within spirit of the present invention and principle, being done, is equal to and replaces and improvement etc., all should be included within protection scope of the present invention.
Claims (6)
1. a method for converting video frame rate is characterized in that, said method comprises step:
A. initialization n ← 1, Q
1← P
1, O
1← I
1, with Q
1As first output frame output;
B. upgrade O
2← O
1+ Δ, n ← 2, m ← 2, Best
m=+∞;
C. judge if | I
n-O
m|＜Best
m, get into steps d, otherwise, step f got into;
D. upgrade Best
m← | I
n-O
m|, Q
m← P
n
E. make n ← n+1, forward next incoming frame to, get into step c;
F. with Q
mAs m output frame output;
G. make m ← m+1, O
m← O
M-1+ Δ,
H. change steps d over to;
P wherein
nBe the n frame of input, I
nIt is the timestamp of the n frame of input; Q
mFor being suitable as most at present the frame of m output, O
mThe expected time that is m output frame stabs, and Δ is according to the due time interval of output frame rate, O between the output frame
mSatisfy O
m=O
M-1+ Δ; Best
mBe in the present incoming frame and O
mImmediate timestamp and O
mThe absolute value of difference ,+∞ is a positive infinity.
2. method for converting video frame rate as claimed in claim 1 is characterized in that, also comprises between said step g and the step h:
I. judge I
n-O
m＞Δ then gets into step J, otherwise gets into steps d;
J. calculate i=(I
n-O
m) Δ, wherein symbol " " representative divide exactly;
K. with frame Q
M-1Repeat i output, upgrade m ← m+i, O
m← O
M-i+ i* Δ;
I wherein
nBe the timestamp of the n frame of input, Q
mFor being suitable as most at present the frame of m output, O
mThe expected time that is m output frame stabs, and Δ is according to the due time interval of output frame rate, O between the output frame
mSatisfy O
m=O
M-1+ Δ.
3. according to claim 1 or claim 2 method for converting video frame rate is characterized in that, it is to set the frame output time under the perfect condition according to output frame rate that the said expected time stabs.
4. method for converting video frame rate as claimed in claim 3 is characterized in that, said timestamp is the collection or the reproduction time mark of frame.
5. like claim 1 or 2 or 4 described method for converting video frame rate, it is characterized in that each frame in the video sequence of input all has timestamp.
6. method for converting video frame rate as claimed in claim 5 is characterized in that, said video sequence is imported according to the timestamp incremental order.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102140520A CN101888513B (en) | 2010-06-29 | 2010-06-29 | Method for converting video frame rate |
| HK11103426.5A HK1149407A1 (en) | 2010-06-29 | 2011-04-06 | A method for converting frame rate of video |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN2010102140520A CN101888513B (en) | 2010-06-29 | 2010-06-29 | Method for converting video frame rate |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101888513A CN101888513A (en) | 2010-11-17 |
| CN101888513B true CN101888513B (en) | 2012-09-05 |
Family
ID=43074201
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN2010102140520A Expired - Fee Related CN101888513B (en) | 2010-06-29 | 2010-06-29 | Method for converting video frame rate |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN101888513B (en) |
| HK (1) | HK1149407A1 (en) |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105979332A (en) * | 2015-12-04 | 2016-09-28 | 乐视致新电子科技（天津）有限公司 | Video data detection method and device |
| CN106817588B (en) * | 2017-02-06 | 2019-07-05 | 网宿科技股份有限公司 | Transcoding control method and device, net cast method and system |
| US10382718B2 (en) * | 2017-12-27 | 2019-08-13 | Anapass Inc. | Frame rate detection method and frame rate conversion method |
| CN112449243B (en) * | 2021-01-28 | 2021-06-15 | 浙江华创视讯科技有限公司 | Video processing method, device, equipment and storage medium |
| CN113163260B (en) * | 2021-03-09 | 2023-03-24 | 北京百度网讯科技有限公司 | Video frame output control method and device and electronic equipment |
| CN114449309B (en) * | 2022-02-14 | 2023-10-13 | 杭州登虹科技有限公司 | Dynamic diagram playing method for cloud guide |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1366271A (en) * | 2000-12-08 | 2002-08-28 | 松下电器产业株式会社 | Data transform device, data coding device and data recording device |
| CN101416505A (en) * | 2006-03-28 | 2009-04-22 | 株式会社东芝 | Method of processing video data and wireless communication apparatus |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20070230898A1 (en) * | 2006-03-31 | 2007-10-04 | Masstech Group Inc. | Random access searching with frame accuracy and without indexing within windows media video |
-
2010
- 2010-06-29 CN CN2010102140520A patent/CN101888513B/en not_active Expired - Fee Related
-
2011
- 2011-04-06 HK HK11103426.5A patent/HK1149407A1/en not_active IP Right Cessation
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1366271A (en) * | 2000-12-08 | 2002-08-28 | 松下电器产业株式会社 | Data transform device, data coding device and data recording device |
| CN101416505A (en) * | 2006-03-28 | 2009-04-22 | 株式会社东芝 | Method of processing video data and wireless communication apparatus |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101888513A (en) | 2010-11-17 |
| HK1149407A1 (en) | 2011-09-30 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101888513B (en) | Method for converting video frame rate | |
| CN102724492B (en) | Method and system for transmitting and playing video images | |
| US8495697B1 (en) | Techniques to provide an enhanced video replay | |
| CN101588473B (en) | Multimedia time shifting broadcasting method and system | |
| JP2014527350A (en) | Multi-view video data encoding method and apparatus, decoding method and apparatus | |
| CN104602127A (en) | Method and system for synchronously playing directed videos and video director | |
| CN1852414B (en) | Video code-flow gamma characteristic correction method and multi-point control unit | |
| CN103475935A (en) | Method and device for retrieving video segments | |
| CN102917258A (en) | Video playing method, terminal and system based on video contents | |
| CN104581406A (en) | Network video recording and playback system and method | |
| CN102265607A (en) | image scaling curve generation | |
| CN103369351A (en) | Streaming media fast-forward and fast-backward processing method, video server and system | |
| US7996699B2 (en) | System and method for synchronizing multiple media devices | |
| CN109194887A (en) | A kind of cloud cuts video record and clipping method and plug-in unit | |
| CN103517135A (en) | Method, system and television capable of playing MP4-format video files continuously | |
| CN105611395A (en) | MP4 format video online play method and system thereof | |
| CN102884804B (en) | The synchronous error bearing calibration of audio signal and vision signal and device | |
| CN103856819A (en) | Play speed adjusting device and method | |
| CN103019575B (en) | A kind of mobile terminal and information processing method thereof | |
| CN104429066A (en) | Method for encoding a digital video image | |
| US11290724B2 (en) | Inter prediction method and apparatus, and terminal device | |
| CN102811380A (en) | Demultiplexing method and demultiplexing device for audio and video data in multimedia files | |
| CN111669605B (en) | Method and device for synchronizing multimedia data and associated interactive data thereof | |
| CN105898320A (en) | Panorama video decoding method and device and terminal equipment based on Android platform | |
| CN102868913A (en) | Method and system for remote synchronous virtual monitoring |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: DE Ref document number: 1149407 Country of ref document: HK |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| REG | Reference to a national code |
Ref country code: HK Ref legal event code: GR Ref document number: 1149407 Country of ref document: HK |
|
| ASS | Succession or assignment of patent right |
Owner name: SHENZHEN YUNZHOU MULTIMEDIA TECHNOLOGY CO., LTD. Free format text: FORMER OWNER: SHENZHEN TEMOBI SCIENCE + TECHNOLOGY CO., LTD. Effective date: 20140801 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20140801 Address after: Unit B4 9 building 518057 Guangdong city of Shenzhen province Nanshan District high in the four EVOC Technology Building No. 31 Patentee after: Shenzhen Yunzhou Multimedia Technology Co., Ltd. Address before: 19, building 518057, Changhong technology building, 18 South twelve Road, Nanshan District science and technology, Guangdong, Shenzhen Patentee before: Shenzhen Temobi Science & Tech Development Co.,Ltd. |
|
| C56 | Change in the name or address of the patentee | ||
| CP02 | Change in the address of a patent holder |
Address after: The central Shenzhen city of Guangdong Province, 518057 Keyuan Road, Nanshan District science and Technology Park No. 15 Science Park Sinovac A Building 1 unit 403, No. 405 unit Patentee after: Shenzhen Yunzhou Multimedia Technology Co., Ltd. Address before: Unit B4 9 building 518057 Guangdong city of Shenzhen province Nanshan District high in the four EVOC Technology Building No. 31 Patentee before: Shenzhen Yunzhou Multimedia Technology Co., Ltd. |
|
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20120905 Termination date: 20190629 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |