CN114339431B - Time-lapse coding compression method - Google Patents
Time-lapse coding compression method Download PDFInfo
- Publication number
- CN114339431B CN114339431B CN202111548351.2A CN202111548351A CN114339431B CN 114339431 B CN114339431 B CN 114339431B CN 202111548351 A CN202111548351 A CN 202111548351A CN 114339431 B CN114339431 B CN 114339431B
- Authority
- CN
- China
- Prior art keywords
- frame
- motion
- blocks
- playing
- block
- 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.)
- Active
Links
Abstract
The invention discloses a time-lapse coding compression method, which comprises the following steps: when video playback is started, different play rates are set for a static scene and a motion scene; and decoding the playing frame every time, judging whether the current frame is a moving frame or a static frame, if the current frame is the moving frame, playing according to the set playing speed of the moving scene, otherwise, playing according to the set playing speed of the static scene. By using the method, different play rates can be set for the motion scene and the static scene, and the speed and the efficiency of video playback are considered.
Description
Technical Field
The invention belongs to the technical field of video coding, and particularly relates to a time-lapse coding compression method.
Background
At present, security video monitoring is rapidly developed, and various places such as communities, buildings, streets, banks and the like are provided with more and more cameras to ensure the security. Likewise, the video recorded by the security camera can be stored for playback when needed. Current review techniques typically play quickly (e.g., 32 times faster) to find the approximate suspicious scene points and then review them carefully. The above application has the following disadvantages: if the set review rate is too fast, important video scenes are easily ignored; moreover, careful staring is required, which is easy to cause visual fatigue and miss important video scenes. If a lower review rate is set, it generally takes longer to find the destination video scene.
In addition, there is also a review demand for slow live broadcasting of the current state of the art. There are many still video scenes in a slow live broadcast that are not generally of interest, often video scenes with moving objects. It is also easy to miss a highlight video scene if a fixed rate review is used.
Disclosure of Invention
The invention aims to solve the technical problem of providing a time-lapse coding compression method, by using the method, different play rates can be set for a motion scene and a static scene, and the speed and the efficiency of video playback are considered.
In order to solve the technical problems, the invention adopts the following technical scheme:
the embodiment of the invention provides a time-lapse coding compression method, which comprises the following steps:
when video playback is started, different play rates are set for a static scene and a motion scene;
and decoding the playing frame every time, judging whether the current frame is a moving frame or a static frame, if the current frame is the moving frame, playing according to the set playing speed of the moving scene, otherwise, playing according to the set playing speed of the static scene.
In one possible design, the play rate of a still scene is greater than the play rate of a moving scene.
In one possible design, determining whether the current frame is a motion frame or a still frame includes: after two playing frames are continuously acquired, the two playing frames are divided into a plurality of small blocks with the same size, the small blocks at corresponding positions are compared with the difference of brightness values, if the average difference value of the brightness exceeds a first threshold value, the small blocks are regarded as moving blocks, otherwise, the small blocks are regarded as static blocks, a first map for marking the moving blocks or the static blocks is obtained, then the first map is subjected to corrosion and expansion algorithm to obtain a final second map, the number of the moving blocks in the second map is counted, if the number of the moving blocks exceeds a second threshold value, the frame is regarded as the moving frame, and otherwise, the frame is the static frame.
In one possible design, after two play frames are continuously acquired, dividing the two play frames into a plurality of small blocks with equal size, comparing the small blocks at corresponding positions with the difference of brightness values, if the average difference of brightness exceeds a first threshold value, considering the small block as a motion block, otherwise, considering the small block as a static block, thereby obtaining a first map for marking the motion block or the static block comprises:
after continuously obtaining two play frames, respectively obtaining two decoded frames F1 and F2 after decoding, wherein the brightness planes of the two decoded frames are Y1 and Y2 respectively, and the horizontal resolution and the vertical resolution of the two decoded frames are W and H;
obtaining a differential plane Y3 of Y1 and Y2; for each pixel in Y1 and Y2, subtracting the absolute value from the same position to obtain the pixel value of the corresponding position of the Y3 plane, namely:
y3[ i, j ] =abs (Y1 [ i, j ] -Y2[ i, j ]), wherein: i=0, 1, 2..w-1, j=0, 1,2, 3..h-1, wherein ABS (·) is absolute;
dividing the Y3 plane into a plurality of small blocks with fixed size, wherein W is arranged in the horizontal direction 1 Blocks with H in vertical direction 1 The blocks are as follows:
W 1 ＝(W+15)/16
H 1 ＝(H+15)/16
let all blocks be referred to as blocks [ x, y ]]Wherein x= 0,1, 2..w 1 -1,y＝0,1,2...H 1 -1；
Then, the average value of pixels in each Block is obtained, and the average value of pixels in the Block [ x, y ] is calculated and obtained and is recorded as AVG [ x, y ]:
a first threshold value Thr1 is set, and if AVG [ x, y ] is greater than Thr1, block [ x, y ] is considered to be a motion Block, otherwise it is a still Block.
In one possible design, the first map is further subjected to erosion and expansion algorithm to obtain a final second map, the number of motion blocks in the second map is counted, if the number of motion blocks exceeds a second threshold, the frame is considered to be a motion frame, otherwise, the frame is a still frame, and the method comprises the following steps:
set Block [ x, y]Motion attribute of (2) is Motion [ x, y ]]If Block [ x, y]Motion [ x, y ] for Motion block]=1, otherwise Motion [ x, y]=0, for Motion [ x, y],x＝0,1,2...W 1 -1,y＝0,1,2...H 1 -1, performing corrosion and expansion algorithms, in particular:
firstly, a Motion [ x, y ] is subjected to a corrosion algorithm, and for each Block [ x, y ] with the Motion [ x, y ] value of 1, if 8 adjacent surrounding blocks are all static blocks, the Motion [ x, y ] is changed into 0;
expanding Motion x, y, namely, for each block with Motion x, y being 1, setting 1 for 8 blocks around;
and finally, in the Motion plane, forming a communication area by all blocks with Motion [ x, Y ] of 1 and adjacent blocks, and considering the Y2 frame as a Motion frame if the number of Motion blocks in a certain communication area reaches a preset second threshold Thr2, or else, considering the Y2 frame as a still frame.
In one possible design, play logic is defined at a certain rate to determine which frames need to be decoded or played to obtain two play frames in succession, comprising: determining the time stamp of the next ideal playing frame through the playing rate, analyzing whether the file has an I frame within a threshold time range of the time stamp, if so, taking the I frame as the playing frame, otherwise, finding an I frame nearest to the I frame forwards, and then decoding only from the I frame without playing until the B frame or the P frame nearest to the ideal time stamp is analyzed, wherein the I frame is taken as the playing frame.
In one possible design, the timestamp of the next ideal play frame is determined by the play rate, then, if there is an I frame in a threshold time range of the timestamp by parsing the file, if there is an I frame, the I frame is taken as the play frame, otherwise, an I frame closest to the I frame is found forward, then, only the play is decoded from the I frame until the B frame or the P frame closest to the ideal timestamp is parsed, and the frame includes as the play frame:
setting the frame rate of the original video frame to be FR fps, and setting the time interval between every two frames to be 1/FR seconds;
setting an error tolerance value of a playing time point as T0 seconds, and setting the current playing speed as X;
the first Frame of the video is decoded and played, the current Frame is recorded as the first Frame, the frame_curr is recorded, and the playing time of the current Frame is T_curr;
the ideal value of the frame_next to be played and the time T_next of the played Frame is T_next_best=T_curr+X/FR;
counting the Frame type and time stamp of each subsequent Frame from the current Frame until the time stamp of the Frame exceeds T_next_best+T0, taking T_next_best as the center, finding the nearest Frame from T_next_best and the Frame type as Intra, setting the Frame as Frame1, and if the time stamp of the Frame is between T_next_best-T0 and T_next_best+T0, selecting the Frame as the next Frame to be decoded and played, and updating the frame_curr as the Frame1 and the time stamp of the Frame 1; if there is no Intra Frame in this range, then find a nearest Intra Frame forward from t_next_best, set to Frame2, and start decoding from Frame2, but not play, decode until the Frame nearest to t_next_best, set to Frame3, then decode and play Frame3, and update frame_curr to Frame3, and t_curr is the timestamp of Frame 3;
and so on, determining which frames in the video need to be decoded and which frames need to be played.
The invention has the following beneficial effects:
(1) After the technical scheme of the invention is used, the overall situation of the video can be quickly previewed, the effect of adaptively reducing the playing speed in the interested scene can be achieved, and sensitive scenes are not missed for the files such as the monitoring video, the slow live broadcast and the like.
(2) After the technical scheme of the invention is used, after the playing speed is set, a better balance can be made on the accuracy of the speed and the complexity of decoding video frames.
(3) The technical scheme of the invention is not limited by video standards and video formats, and is suitable for almost all video standards at present, such as MPEG1, MPEG2, MPEG4, H264, H265, AVS+, AVS2, AVS3 and the like.
Detailed Description
The following description of the embodiments of the present invention will be made clearly and completely, and it is apparent that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
The embodiment of the invention discloses a time-lapse coding compression method, which comprises the following steps:
when video playback is started, different play rates are set for a static scene and a motion scene; in general, the play rate of a still scene is taken to be greater than the play rate of a moving scene.
And decoding the playing frame every time, judging whether the current frame is a moving frame or a static frame, if the current frame is the moving frame, playing according to the set playing speed of the moving scene, otherwise, playing according to the set playing speed of the static scene.
The time-lapse coding compression method is applied to monitoring videos or slow live broadcast files, can achieve the effects of quickly previewing the overall situation of the videos and adaptively reducing the playing speed in the interested scene, and does not miss sensitive scenes.
In one embodiment of the present invention, determining whether the current frame is a motion frame or a still frame includes: after two playing frames are continuously acquired, the two playing frames are divided into a plurality of small blocks with the same size, the small blocks at corresponding positions are compared with the difference of brightness values, if the average difference value of the brightness exceeds a first threshold value, the small blocks are regarded as moving blocks, otherwise, the small blocks are regarded as static blocks, a first map for marking the moving blocks or the static blocks is obtained, then the first map is subjected to corrosion and expansion algorithm to obtain a final second map, the number of the moving blocks in the second map is counted, if the number of the moving blocks exceeds a second threshold value, the frame is regarded as the moving frame, and otherwise, the frame is the static frame.
In an embodiment of the present invention, after two play frames are continuously acquired, the two play frames are divided into a plurality of small blocks with equal size, the small blocks at corresponding positions are compared with the difference of brightness values, if the average difference of brightness exceeds a first threshold value, the small block is considered to be a moving block, otherwise, the small block is considered to be a static block, and thus, the obtaining of a first map for marking the moving block or the static block includes:
after continuously obtaining two play frames, respectively obtaining two decoded frames F1 and F2 after decoding, wherein the brightness planes of the two decoded frames are Y1 and Y2 respectively, and the horizontal resolution and the vertical resolution of the two decoded frames are W and H; the low-pass filtering (such as gaussian filtering) can be performed on Y1 and Y2 first, so as to reduce gaussian noise introduced during camera acquisition.
Obtaining a differential plane Y3 of Y1 and Y2; for each pixel in Y1 and Y2, subtracting the absolute value from the same position to obtain the pixel value of the corresponding position of the Y3 plane, namely:
y3[ i, j ] =abs (Y1 [ i, j ] -Y2[ i, j ]), wherein: i=0, 1, 2..w-1, j=0, 1,2, 3..h-1, wherein ABS (·) is absolute;
the Y3 plane is divided into small blocks of fixed size, each typically 16x16 in size. Let the block size be 16x16, then there is W in the horizontal direction 1 Blocks with H in vertical direction 1 The blocks are as follows:
W 1 ＝(W+15)/16
H 1 ＝(H+15)/16
let all blocks be referred to as blocks [ x, y ]]Wherein x= 0,1, 2..w 1 -1,y＝0,1,2...H 1 -1；
Then, the average value of pixels in each Block is obtained, and the average value of pixels in the Block [ x, y ] is calculated and obtained and is recorded as AVG [ x, y ]:
a first threshold value Thr1 is set, and if AVG [ x, y ] is greater than Thr1, block [ x, y ] is considered to be a motion Block, otherwise it is a still Block.
In an embodiment of the present invention, the first map is further subjected to a corrosion and expansion algorithm to obtain a final second map, the number of motion blocks in the second map is counted, if the number of motion blocks exceeds a second threshold, the frame is considered to be a motion frame, otherwise, the frame is a still frame, including:
set Block [ x, y]Motion attribute of (2) is Motion [ x, y ]]If Block [ x, y]Motion [ x, y ] for Motion block]=1, otherwise Motion [ x, y]=0, for Motion [ x, y],x＝0,1,2...W 1 -1,y＝0,1,2...H 1 -1, performing corrosion and expansion algorithms, in particular:
firstly, a Motion [ x, y ] is subjected to a corrosion algorithm, and for each Block [ x, y ] with the Motion [ x, y ] value of 1, if 8 adjacent surrounding blocks are all static blocks, the Motion [ x, y ] is changed into 0;
expanding Motion x, y, namely, for each block with Motion x, y being 1, setting 1 for 8 blocks around;
and finally, in the Motion plane, forming a communication area by all blocks with Motion [ x, Y ] of 1 and adjacent blocks, and considering the Y2 frame as a Motion frame if the number of Motion blocks in a certain communication area reaches a preset second threshold Thr2, or else, considering the Y2 frame as a still frame.
By the method of the above embodiment, one play frame is obtained at a time, decoded first, and then whether the current frame is a motion frame or a still frame is judged. If the frame is a motion frame, setting the current playing rate as N, otherwise, setting the current playing rate as M, and updating the playing rate in the next decoding playing frame process in the subsequent judgment.
In an embodiment of the present invention, in order to obtain a play frame, it is necessary to determine which frames need to be played and which frames need to be decoded. Therefore, defining playing logic at a certain rate, determining which frames need to be decoded or played, so as to continuously acquire two playing frames, including: determining the time stamp of the next ideal playing frame through the playing rate, analyzing whether the file has an I frame within a threshold time range of the time stamp, if so, taking the I frame as the playing frame, otherwise, finding an I frame nearest to the I frame forwards, and then decoding only from the I frame without playing until the B frame or the P frame nearest to the ideal time stamp is analyzed, wherein the I frame is taken as the playing frame.
In an embodiment of the present invention, a time stamp of a next ideal playing frame is determined by a playing rate, then, if there is an I frame in a threshold time range of the time stamp, the I frame is used as a playing frame, otherwise, an I frame closest to the I frame is found forward, then, only the playing is decoded from the I frame until the B frame or the P frame closest to the ideal time stamp is resolved, and the frame as the playing frame includes:
setting the frame rate of the original video frame to be FR fps, and setting the time interval between every two frames to be 1/FR seconds;
setting an error tolerance value of a playing time point as T0 seconds, and setting the current playing speed as X;
the first Frame of the video is decoded and played, the current Frame is recorded as the first Frame, the frame_curr is recorded, and the playing time of the current Frame is T_curr;
the ideal value of the frame_next to be played and the time T_next of the played Frame is T_next_best=T_curr+X/FR;
counting the Frame type and time stamp of each subsequent Frame from the current Frame until the time stamp of the Frame exceeds T_next_best+T0, taking T_next_best as the center, finding the nearest Frame from T_next_best and the Frame type as Intra, setting the Frame as Frame1, and if the time stamp of the Frame is between T_next_best-T0 and T_next_best+T0, selecting the Frame as the next Frame to be decoded and played, and updating the frame_curr as the Frame1 and the time stamp of the Frame 1; if there is no Intra Frame in this range, then find a nearest Intra Frame forward from t_next_best, set to Frame2, and start decoding from Frame2, but not play, decode until the Frame nearest to t_next_best, set to Frame3, then decode and play Frame3, and update frame_curr to Frame3, and t_curr is the timestamp of Frame 3;
and so on, determining which frames in the video need to be decoded and which frames need to be played.
The reason for doing the above is that: first, if a frame is to be played, the frame must be decoded. And a frame is decoded and may or may not be played. Intra frames (i.e., key frames, or I frames, i.e., the first frame of a GOP) are individually decodable independent of previous frames. While decoding of other frame types (i.e., a GOP other than the first frame), if it is to be decoded, relies on the decoded data of the previous frame to form a dependency chain until it corresponds to the first frame of the GOP. Such as a GOP: intra (1), P (2), P (3), P (4). To decode frame 4, P (4), P (3) - > frame3, P (3) must be decoded first, P (2) - > to decode frame 2P (2), intra (1) must be decoded first.
Secondly: if there is an Intra frame within the time tolerance T0 of the optimal time point t_next_best, only the Intra frame needs to be decoded and played, and no other previous frame needs to be decoded, which is of course not more necessary to be played. Otherwise, frame2 is found outside this range, frames starting from Frame2 need to be decoded but not played until the point in time is close to the Frame of t_next_best, and finally this Frame is the Frame that needs to be decoded and played.
The time-lapse coding compression method of the embodiment of the invention is not limited by video standards and video formats, and is suitable for almost all video standards at present, such as MPEG1, MPEG2, MPEG4, H264, H265, AVS+, AVS2, AVS3 and the like.
It should be understood that the exemplary embodiments described herein are illustrative and not limiting. Although one or more embodiments of the present invention have been described, it will be understood by those of ordinary skill in the art that various changes in form and details may be made therein without departing from the spirit and scope of the present invention as defined by the following claims.
Claims (6)
1. A time-lapse coding compression method, comprising the steps of:
when video playback is started, different play rates are set for a static scene and a motion scene;
each time a playing frame is obtained, decoding is firstly carried out, whether the current frame is a moving frame or a static frame is judged, if the current frame is the moving frame, playing is carried out according to the set playing speed of the moving scene, otherwise, playing is carried out according to the set playing speed of the static scene;
determining whether the current frame is a motion frame or a still frame includes: after two playing frames are continuously acquired, the two playing frames are divided into a plurality of small blocks with the same size, the small blocks at corresponding positions are compared with the difference of brightness values, if the average difference value of the brightness exceeds a first threshold value, the small blocks are regarded as moving blocks, otherwise, the small blocks are regarded as static blocks, a first map for marking the moving blocks or the static blocks is obtained, then the first map is subjected to corrosion and expansion algorithm to obtain a final second map, the number of the moving blocks in the second map is counted, if the number of the moving blocks exceeds a second threshold value, the frame is regarded as the moving frame, and otherwise, the frame is the static frame.
2. The time-lapse coding compression method of claim 1, wherein the play rate of the still scene is greater than the play rate of the moving scene.
3. The time-lapse encoding compression method of claim 1, wherein after two play frames are continuously acquired, dividing the two play frames into a plurality of small blocks of equal size, comparing the small blocks at corresponding positions for the difference in luminance value, if the average difference in luminance exceeds a first threshold, considering the small block as a moving block, otherwise, considering the small block as a still block, thereby obtaining a first map for marking the moving block or the still block comprises:
after continuously obtaining two play frames, respectively obtaining two decoded frames F1 and F2 after decoding, wherein the brightness planes of the two decoded frames are Y1 and Y2 respectively, and the horizontal resolution and the vertical resolution of the two decoded frames are W and H;
obtaining a differential plane Y3 of Y1 and Y2; for each pixel in Y1 and Y2, subtracting the absolute value from the same position to obtain the pixel value of the corresponding position of the Y3 plane, namely:
y3[ i, j ] =abs (Y1 [ i, j ] -Y2[ i, j ]), wherein: i=0, 1, 2..w-1, j=0, 1,2, 3..h-1, wherein ABS (·) is absolute;
dividing the Y3 plane into a plurality of small blocks with fixed size, wherein W is arranged in the horizontal direction 1 Blocks with H in vertical direction 1 The blocks are as follows:
W 1 ＝(W+15)/16
H 1 ＝(H+15)/16
let all blocks be referred to as blocks [ x, y ]]Wherein x= 0,1, 2..w 1 -1,y＝0,1,2...H 1 -1；
Then, the average value of pixels in each Block is obtained, and the average value of pixels in the Block [ x, y ] is calculated and obtained and is recorded as AVG [ x, y ]:
a first threshold value Thr1 is set, and if AVG [ x, y ] is greater than Thr1, block [ x, y ] is considered to be a motion Block, otherwise it is a still Block.
4. A time-lapse coding compression method as claimed in claim 3, wherein the first map is subjected to erosion and expansion algorithm to obtain a final second map, the number of motion blocks in the second map is counted, if the number of motion blocks exceeds a second threshold, the frame is considered as a motion frame, otherwise the frame is a still frame comprising:
set Block [ x, y]Motion attribute of (2) is Motion [ x, y ]]If Block [ x, y]Motion [ x, y ] for Motion block]=1, otherwise Motion [ x, y]=0, for Motion [ x, y],x＝0,1,2...W 1 -1,y＝0,1,2...H 1 -1, performing corrosion and expansion algorithms, in particular:
firstly, a Motion [ x, y ] is subjected to a corrosion algorithm, and for each Block [ x, y ] with the Motion [ x, y ] value of 1, if 8 adjacent surrounding blocks are all static blocks, the Motion [ x, y ] is changed into 0;
expanding Motion x, y, namely, for each block with Motion x, y being 1, setting 1 for 8 blocks around;
and finally, in the Motion plane, forming a communication area by all blocks with Motion [ x, Y ] of 1 and adjacent blocks, and considering the Y2 frame as a Motion frame if the number of Motion blocks in a certain communication area reaches a preset second threshold Thr2, or else, considering the Y2 frame as a still frame.
5. The time-lapse encoding compression method of any one of claims 1 to 4, wherein defining playback logic at a rate determines which frames need to be decoded or played back to obtain two playback frames in succession, comprises: determining the time stamp of the next ideal playing frame through the playing rate, analyzing whether the file has an I frame within a threshold time range of the time stamp, if so, taking the I frame as the playing frame, otherwise, finding an I frame nearest to the I frame forwards, and then decoding only from the I frame without playing until the B frame or the P frame nearest to the ideal time stamp is analyzed, wherein the I frame is taken as the playing frame.
6. The time-lapse coding compression method of claim 5, wherein the time stamp of the next ideal play frame is determined by the play rate, then the I frame is taken as the play frame by parsing whether the file has the I frame within a threshold time range of the time stamp, otherwise, an I frame nearest to the I frame is found forward, then only the non-play frame is decoded from the I frame until the B frame or the P frame nearest to the ideal time stamp is parsed, and the frame as the play frame comprises:
setting the frame rate of the original video frame to be FR fps, and setting the time interval between every two frames to be 1/FR seconds;
setting an error tolerance value of a playing time point as T0 seconds, and setting the current playing speed as X;
the first Frame of the video is decoded and played, the current Frame is recorded as the first Frame, the frame_curr is recorded, and the playing time of the current Frame is T_curr;
the ideal value of the frame_next to be played and the time T_next of the played Frame is T_next_best=T_curr+X/FR;
counting the Frame type and time stamp of each subsequent Frame from the current Frame until the time stamp of the Frame exceeds T_next_best+T0, taking T_next_best as the center, finding the nearest Frame from T_next_best and the Frame type as Intra, setting the Frame as Frame1, and if the time stamp of the Frame is between T_next_best-T0 and T_next_best+T0, selecting the Frame as the next Frame to be decoded and played, and updating the frame_curr as the Frame1 and the time stamp of the Frame 1; if there is no Intra Frame in this range, then find a nearest Intra Frame forward from t_next_best, set to Frame2, and start decoding from Frame2, but not play, decode until the Frame nearest to t_next_best, set to Frame3, then decode and play Frame3, and update frame_curr to Frame3, and t_curr is the timestamp of Frame 3;
and so on, determining which frames in the video need to be decoded and which frames need to be played.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111548351.2A CN114339431B (en) | 2021-12-16 | 2021-12-16 | Time-lapse coding compression method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202111548351.2A CN114339431B (en) | 2021-12-16 | 2021-12-16 | Time-lapse coding compression method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN114339431A CN114339431A (en) | 2022-04-12 |
| CN114339431B true CN114339431B (en) | 2023-09-01 |
Family
ID=81053194
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202111548351.2A Active CN114339431B (en) | 2021-12-16 | 2021-12-16 | Time-lapse coding compression method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN114339431B (en) |
Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103348690A (en) * | 2011-11-26 | 2013-10-09 | 华为技术有限公司 | Video processing method and device |
| CN103561232A (en) * | 2010-12-29 | 2014-02-05 | 中国移动通信集团公司 | Method and device for identifying video monitoring scenes |
| CN104184997A (en) * | 2014-09-16 | 2014-12-03 | 哈尔滨恒誉名翔科技有限公司 | Quick surveillance video playback technique |
| CN104394426A (en) * | 2014-12-10 | 2015-03-04 | 福建星网锐捷网络有限公司 | Rate playing method and device of stream media |
| CN104519294A (en) * | 2013-09-27 | 2015-04-15 | 杭州海康威视数字技术股份有限公司 | Mobile information-based video recording playback method and device thereof |
| CN104702964A (en) * | 2015-03-30 | 2015-06-10 | 北京三好互动教育科技有限公司 | Image processing method and device |
| CN104967848A (en) * | 2015-06-16 | 2015-10-07 | 谢维波 | Scene analysis algorithm applied in network video monitoring system |
| CN105554516A (en) * | 2015-12-31 | 2016-05-04 | 杭州华为数字技术有限公司 | Method and device for playing monitoring video |
| CN105812618A (en) * | 2016-03-17 | 2016-07-27 | 浙江大华技术股份有限公司 | Motion detection method and motion detection device |
| CN108184165A (en) * | 2017-12-28 | 2018-06-19 | 广东欧珀移动通信有限公司 | Video broadcasting method, electronic device and computer readable storage medium |
| CN109218728A (en) * | 2018-11-16 | 2019-01-15 | 深圳市梦网百科信息技术有限公司 | A kind of scene change detection method and system |
| CN110913272A (en) * | 2019-12-03 | 2020-03-24 | 腾讯科技（深圳）有限公司 | Video playing method and device, computer readable storage medium and computer equipment |
| CN112291591A (en) * | 2020-09-21 | 2021-01-29 | 浙江大华技术股份有限公司 | Video data playback method, electronic equipment and storage medium |
| CN113259779A (en) * | 2021-07-01 | 2021-08-13 | 杭州觅睿科技股份有限公司 | Video processing method, device, equipment and storage medium |
Family Cites Families (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US6738980B2 (en) * | 2001-11-15 | 2004-05-18 | Industrial Technology Research Institute | Methods and systems for video streaming with VCR functionality |
| US8954178B2 (en) * | 2007-09-30 | 2015-02-10 | Optical Fusion, Inc. | Synchronization and mixing of audio and video streams in network-based video conferencing call systems |
| JP5284074B2 (en) * | 2008-12-18 | 2013-09-11 | キヤノン株式会社 | Image processing apparatus and image processing method |
| EP2919458A1 (en) * | 2014-03-11 | 2015-09-16 | Axis AB | Method and system for playback of motion video |
-
2021
- 2021-12-16 CN CN202111548351.2A patent/CN114339431B/en active Active
Patent Citations (14)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103561232A (en) * | 2010-12-29 | 2014-02-05 | 中国移动通信集团公司 | Method and device for identifying video monitoring scenes |
| CN103348690A (en) * | 2011-11-26 | 2013-10-09 | 华为技术有限公司 | Video processing method and device |
| CN104519294A (en) * | 2013-09-27 | 2015-04-15 | 杭州海康威视数字技术股份有限公司 | Mobile information-based video recording playback method and device thereof |
| CN104184997A (en) * | 2014-09-16 | 2014-12-03 | 哈尔滨恒誉名翔科技有限公司 | Quick surveillance video playback technique |
| CN104394426A (en) * | 2014-12-10 | 2015-03-04 | 福建星网锐捷网络有限公司 | Rate playing method and device of stream media |
| CN104702964A (en) * | 2015-03-30 | 2015-06-10 | 北京三好互动教育科技有限公司 | Image processing method and device |
| CN104967848A (en) * | 2015-06-16 | 2015-10-07 | 谢维波 | Scene analysis algorithm applied in network video monitoring system |
| CN105554516A (en) * | 2015-12-31 | 2016-05-04 | 杭州华为数字技术有限公司 | Method and device for playing monitoring video |
| CN105812618A (en) * | 2016-03-17 | 2016-07-27 | 浙江大华技术股份有限公司 | Motion detection method and motion detection device |
| CN108184165A (en) * | 2017-12-28 | 2018-06-19 | 广东欧珀移动通信有限公司 | Video broadcasting method, electronic device and computer readable storage medium |
| CN109218728A (en) * | 2018-11-16 | 2019-01-15 | 深圳市梦网百科信息技术有限公司 | A kind of scene change detection method and system |
| CN110913272A (en) * | 2019-12-03 | 2020-03-24 | 腾讯科技（深圳）有限公司 | Video playing method and device, computer readable storage medium and computer equipment |
| CN112291591A (en) * | 2020-09-21 | 2021-01-29 | 浙江大华技术股份有限公司 | Video data playback method, electronic equipment and storage medium |
| CN113259779A (en) * | 2021-07-01 | 2021-08-13 | 杭州觅睿科技股份有限公司 | Video processing method, device, equipment and storage medium |
Non-Patent Citations (1)
| Title |
|---|
| 基于图像识别的智能监控技术探讨;游艳雯;;智能建筑与城市信息(第08期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN114339431A (en) | 2022-04-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10382830B2 (en) | Trick play in digital video streaming | |
| US9497483B2 (en) | Method for generating and decoding a coded picture signal, an apparatus for generating and decoding a coded picture signal, a program for generating and decoding a coding picture signal, and an integrated circuit for generating and decoding a coded picture signal | |
| US8179961B2 (en) | Method and apparatus for adapting a default encoding of a digital video signal during a scene change period | |
| EP1813117A1 (en) | Method and device for processing coded video data | |
| US8139877B2 (en) | Image processing apparatus, image processing method, and computer-readable recording medium including shot generation | |
| CN104093021A (en) | Monitoring video compression method | |
| JPH10257436A (en) | Automatic hierarchical structuring method for moving image and browsing method using the same | |
| KR20040099343A (en) | Method and apparatus for detecting scene changes in video using a histogram of frame differences | |
| US20090225169A1 (en) | Method and system of key frame extraction | |
| US20150249829A1 (en) | Method, Apparatus and Computer Program Product for Video Compression | |
| US7308029B2 (en) | Method and apparatus for implementing B-picture scene changes | |
| Sugano et al. | A fast scene change detection on MPEG coding parameter domain | |
| CN114339431B (en) | Time-lapse coding compression method | |
| De Bruyne et al. | Temporal video segmentation on H. 264/AVC compressed bitstreams | |
| JP4350877B2 (en) | Compressed video scene change detection device, compressed video scene change detection method, and recording medium recording the program | |
| US10856002B2 (en) | Method, device and system for method of encoding a sequence of frames in a video stream | |
| CN106454341B (en) | A kind of HEVC prediction mode fast selecting method based on scene switching | |
| JPH10112863A (en) | Method and device for extracting motion subject information | |
| Ozbek et al. | Fast H. 264/AVC video encoding with multiple frame references | |
| JP2006311078A (en) | High efficiency coding recorder | |
| Li et al. | A robust, efficient, and fast global motion estimation method from MPEG compressed video | |
| JPH09200772A (en) | Compressed image data display device | |
| Salih et al. | Dynamic scene change detection in video coding | |
| Mithlesh et al. | Detection of Scene Change in Video | |
| Chunmei et al. | A new method for shot boundary detection |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |