CN103796019B - A kind of balanced code check coded method - Google Patents
A kind of balanced code check coded method Download PDFInfo
- Publication number
- CN103796019B CN103796019B CN201210435590.1A CN201210435590A CN103796019B CN 103796019 B CN103796019 B CN 103796019B CN 201210435590 A CN201210435590 A CN 201210435590A CN 103796019 B CN103796019 B CN 103796019B
- Authority
- CN
- China
- Prior art keywords
- frames
- frame
- code check
- coded method
- data
- 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
- 238000000034 method Methods 0.000 title claims abstract description 43
- 230000005540 biological transmission Effects 0.000 claims abstract description 22
- 230000000750 progressive effect Effects 0.000 claims abstract description 9
- 230000011218 segmentation Effects 0.000 claims abstract description 8
- 230000003068 static effect Effects 0.000 claims abstract description 6
- 230000008901 benefit Effects 0.000 abstract description 3
- 238000005192 partition Methods 0.000 abstract description 3
- 230000033001 locomotion Effects 0.000 description 7
- 241001269238 Data Species 0.000 description 5
- 230000000694 effects Effects 0.000 description 4
- 230000006835 compression Effects 0.000 description 3
- 238000007906 compression Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 239000012634 fragment Substances 0.000 description 3
- 230000006978 adaptation Effects 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 2
- 238000003780 insertion Methods 0.000 description 2
- 230000037431 insertion Effects 0.000 description 2
- 230000008569 process Effects 0.000 description 2
- 238000011084 recovery Methods 0.000 description 2
- 230000000007 visual effect Effects 0.000 description 2
- 238000009825 accumulation Methods 0.000 description 1
- 230000015572 biosynthetic process Effects 0.000 description 1
- 230000008859 change Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 230000001627 detrimental effect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000001914 filtration Methods 0.000 description 1
- 238000009499 grossing Methods 0.000 description 1
- 239000000463 material Substances 0.000 description 1
- 239000000203 mixture Substances 0.000 description 1
- 238000012856 packing Methods 0.000 description 1
- 230000001902 propagating effect Effects 0.000 description 1
- 230000008439 repair process Effects 0.000 description 1
- 239000007787 solid Substances 0.000 description 1
- 230000003595 spectral effect Effects 0.000 description 1
Landscapes
- Compression Or Coding Systems Of Tv Signals (AREA)
Abstract
The invention discloses the I frames in image sequence are divided into multiple bands and are separately encoded transmission, specifically include following steps by a kind of balanced code check coded method：（1）Carry out band segmentation：In static transcoding, in described image sequence, dynamic finds next scene switching point in advance, and at this scene switching point inserts I frames；（2）Simultaneous transmission：The data of the I frames after band segmentation, are transmitted respectively；When P frames or B frame data are transmitted, the follow-up I frames for having encoded the band partition encoding for completing are transmitted in the lump；（3）Merge decoding：Corresponding progressive decoding device constantly collects follow-up I frame data in P frames and B frame transmitting procedures is received, and waits all to collect completing, then which is decoded.It is an advantage of the current invention that can bring the fluctuation of code stream itself due to the I frames that must be inserted into during effectively gentle image coding and decoding by the present invention, the steady propagation for video code flow provides possibility.
Description
Technical field
This is the present invention relates to a kind of video encoding method, and in particular to one kind first carries out band segmentation and then compiles respectively
The balanced code check coded method of code transmission.
Background technology
There are multiple technical standards with regard to coding and decoding video, including ISO/IEC motions expert group (MPEG) at this stage
MPEG-1, MPEG-2, the MPEG-4 of series, and the joint video of International Telecommunication Union's ITU Video Coding Experts Groups (VCEG)
The combination with standard of group (JVT) H.264/AVC, H.264 also referred to as MPEG4part 10, these video compression technology standards are all logical
Overcompression technology is compressed to video data so as to improve efficiency of transmission.In actual telecommunications application, the nominal transmission of circuit
Bandwidth is often fixed, it is difficult to adapt to the significantly shake of variable bit rate VBR (Variable Bitrate).For example, VBR side
The compressed video stream of formula coding, its maximal rate and the upper and lower fluctuation range of minimum code rate are possible to reach 10 times, so significantly
The fluctuation of degree, it is difficult to be adapted to existing telecommunications network.In order to being adapted to that existing telecommunications network is compared, needs carry out solid
Constant bit rate CBR (Constant Bitrate) is encoded.
In modern video encoding standard, typically there is Intra (I) frame, P frames, B frames, the efficiency of I frames are minimum, B frames can be with
Carry out bi-directionally referenced, its efficiency highest.The data bit bit number of one I frames occupancy can be the hundreds of times of B frames, and this results in
The significantly shake of code check fundamentally, is highly detrimental to CBR cbr (constant bit rate)s coding.H.264 each macro block is allowed with reference to not
Same image, selects different reference pictures improve compression efficiency.
One typical video compress sequence is exactly to be made up of above-mentioned I frames P frame B frames.As the code efficiency of I frames is less than P
Frame and B frames, so I frames compare saving, particularly under the limited scene of code check or transmission bandwidth.I frames independently can be solved
Code, and every IDR frame (Instananeous Decoding Refresh decode instant refresh frame) is exactly an entrance or random
Access point, does not allow follow-up frame across IDR with reference to frame above, and I frames are limited without this.IDR is exactly the starting point of a decoding.
In order to allow one video sequence of random access memory, need to insert a number of every IDR frame in the sequence.In Shot change, by
Very big in scene changes, the content that can be used for reference between frame and frame is few, and now more effective with I frames coding, this I frame may not necessarily
It is an every IDR frame.The first frame started in one GOP must be an every IDR frame, and a GOP was tied before another IDR
Beam.Between IDR due to the I frames of the factors such as carry over insertion can be by following frame across with reference to the previous frame of this I frame.One more
The every IDR frame density of crypto set is obviously more beneficial for one video sequence of user's random access.The I frames inserted due to carry over can be with
It is defined as IDR so as to guide the beginning of a new GOP, such IDR be called nature IDR.Between no carry over, by
In the every IDR frame that GOP length constraints are forced to insert, passive every IDR frame can be called.Passive every IDR frame has redundancy with frame before.IDR
Frame afterwards can not be referred to the frame before I frames with reference to the frame before IDR, the frame after I frames.
Hierarchy has four layers, is followed successively by image layer (picture layer), slice layer (slice from top to bottom
Layer), macroblock layer (MB) and block layer (block layer).Ribbon structure is a slice header and follow-up strip data.
Band is defined as the combination of some macro blocks in an image.Band can absolute coding, a band can not be with reference to other bands
Data.In having the transmission environment of error code, ribbon structure is conducive to Error Resiliency.Each interior strips has multiple MB, one
MB is the chroma data of the intensity pixel data and 8x8 of 16x16.H.264 in standard, by data VCL of video compress with by this
Transport layer NAL that formation is transmitted on data packing adaptation particular network is separated.On image redundancy representation space between neighbor
Similarity, time redundancy is represented very big similarity between frame and frame, can reference and reference mutually.Spectral redundancy is referred to
Between different color compositions with mutual relation.Reference picture is selected, and the reference picture of motion compensation can be with reference to figure
As being selected in relief area.H.264 allow each macro block with reference to different images, select different reference pictures improve
Compression efficiency.
Progressive decoding device refreshes the random access of the every IDR frame for being related to the inwhole Successful transmissions of its data, and picture material is more
Progressive recovery in individual coded image.Progressive decoding refresh basic idea be by a part of macroblock coding of frame be intraframe coding.
When decoder starts decoding in a random accessing points, for the decoder, the reference frame of motion compensation is unknown
's.Decoder can rebuild the macro block of intraframe coding, but motion-compensated macroblock be related to not to be properly received reference frame can not be by
Recover.After multiple decoding frames, the intra-coded regions of accumulation gradually increase, and may finally obtain a complete reconstruction figure
Picture.
H.264 middle utilization loop filtering weakens boundary effect, but closes on macro block and may fail to be correctly decoded reconstruction.Half-pix
It is also to be rebuild by 6 taps or 4 tap filters with 1/4 pixel.The pixel for failing correct reconstruction may be used for interpolation
One pixel being located within reliable decoding region, this will cause to solve code error.
To solve problems, many units and inventor have been made compared with in-depth study to this, and disclose a series of
There is the solution of creation.As Nokia Oy once applied and disclosed on May 17th, 2006 on April 28th, 2003
The patent of invention (number of patent application is 03809615.3) of one entitled " random access point in Video coding ", which is in identification
Carry out on the basis of the potential complexity that progressive decoding device method for refreshing is realized.According to the method, be made up of frame of video
Individual video sequence is encoded, and wherein coded method includes at least one frame of video being divided into one group of encoding block, and uses frame in
Encode to encode the encoding block described at least one.Then, including at least one intraframe coding encoding block the first reliable area
Domain is determined, and it is reliable described first so as to prevent that the first described reliable area is encoded in described video sequence
Information dependency is produced between encoding block outside region and the first described reliable area.It is somebody's turn to do when accessing from an arbitrary point
During video sequence, decoder can use described reliable area as a random access point.The advantage of the invention is energy
It is enough in and random access point is provided in encoded video streams, reliably simultaneously a part for more new image areas, rather than the area
The coverage of the whole intra-frame macro block in domain, and prevent the space-time of transmission error from propagating.Additionally, the different error of its permission is protected
Shield and transmission priority are so as to improving the priority of the visual quality and subjectivity according to the video data of different piece of reception
The traffic is formed, and the whole I frames in conversational applications can be avoided, so that the delay between terminal-terminal is minimum, and improved
The visual quality for receiving.But the method is not good enough for the treatment effect of carry over I frames because the image content of carry over I frames with
The picture identical part of front and continued seldom, does not have the content that can much inherit and refer to, so the intraframe coding of front and continued picture
Very big help can not be played to follow-up carry over I frames in part.Additionally, Tsing-Hua University applied on January 12nd, 2007
(number of patent application is for a kind of one entitled " video coding-decoding method for supporting frame of video random read take " patent of invention
200710062633.5), its coded method is：Frame of video is grouped, I frames will be arranged to by all frames in group, P frames, B frames and
Random read take frame W frames, and to all frame I frames in group, P frames, B frames carry out traditional code, are first according to the coding of P frames to W frames
Mode is encoded, and recycles the coded method of distributed video coding with reference to from the nearest I frames of the W frames and the I frames and the W
Any one frame before frame is encoded to the W frames；Coding/decoding method is：When random read take need not be carried out, the I to each group
Frame, P frames, B frames carry out traditional decoding, and W frames are decoded by the method for P frames；When needing to carry out random read take, using distributed
The coding/decoding method of Video coding is directly decoded to W frames.The advantage of the method is can not only to improve the random write of frame of video
Performance is taken, and the code stream for generating has certain anti-error performance, but which there is also an obvious shortcoming, be exactly except right
I frames, P frames, B frames are carried out outside tradition decoding, also W frames will be decoded by the method for P frames, and can not be released to front I frames
Rely on, practical effect is poor.
The content of the invention
For the defect for overcoming above-mentioned prior art to exist, the present invention provides a kind of balanced code check coded method, by this
Method can bring the fluctuation of code stream itself due to the I frames that must be inserted into during effectively gentle image coding and decoding, be video
The steady propagation of code stream is provided may.
To achieve these goals, technical scheme is as follows：A kind of balanced code check coded method, by image sequence
In I frames be divided into multiple bands, be separately encoded transmission, specifically include following steps：(1) carry out band segmentation：Turn static
In code, in described image sequence, dynamic finds next scene switching point in advance, and at this scene switching point inserts I
Frame；(2) simultaneous transmission：The data of the I frames after band segmentation, are transmitted respectively；When P frames or B frame data are transmitted, in the lump
The follow-up I frames for having encoded the band partition encoding for completing of transmission；(3) merge decoding：Corresponding progressive decoding device is receiving P
In frame and B frame transmitting procedures, follow-up I frame data are constantly collected, wait all to collect completing, then which is decoded.
Further, in the decoding step, standard decoding program is decoded after strip data is received respectively, in I frames
These strip datas unanimously show by the display time, will obtain a complete I frame.
Further, the I frames in the step (1) shift to an earlier date absolute coding.
Further, when carrying out simultaneous transmission in the step (2), after selecting to transmit in the lump according to the size of P or B frames
After the strip data of I frames, P frames and I frame bars more level off to target bit rate with the transmission frame that merges that data are constituted so that overall code stream
It is steady balanced.
Further, band is divided into per follow-up I two field pictures in described image sequence, the macro block in these bands can be with sky
Between it is adjacent can also be non-conterminous.
Further, the region of the stick is arbitrary shape.
A kind of video encoder of the balanced code check coded method for described in claim 1, the encoder are arranged to
Follow-up I frames are divided into at least two bands, described band are encoded by intraframe coding.
A kind of Video Decoder of the balanced code check coded method for described in claim 1, it is characterised in that the solution
Code device is progressive decoding device, for merging decoding to the collected multiple strip datas of I frames.
The beneficial effects of the present invention is：(1) in decoding end, due to the display time of these dividing strip be it is consistent,
The display time of the I frames that they represent is equal to all, standard decoding program is decoded after these strip datas are received respectively, in I
These strip datas unanimously show by the display time of frame, will obtain a complete I frame.By these steps, it is possible to keep away
Exempt from the fluctuation that the big data quantity of I frames brings, and P frame B interframe, and quantity of motion is not of uniform size in the GOP causes etc., cause
Coded data it is not of uniform size cause bring code stream fluctuation.(2) this method is the I that next one GOP is transmitted in this GOP interior codings
Frame, is across GOP global adaptation Bit allocation, so can both smooth the coding complexity caused because of motion and texture etc. in GOP
Property fluctuation, it is also possible to smooth the fluctuation of this complexity across GOP, for example, when the texture and complicated movement of next GOP, can be
The I frames of next GOP beginnings carry out finer coding；When the complexity of this GOP is high, then the I frames for simplifying next one GOP are compiled
The degree that becomes more meticulous of code, carries out Rate Control adjustment of overall importance, forms the approximate effect that CBR is required.(3) after encoded in advance
After I frames be according to band cutting after be separately encoded and transmit in advance, so, even if the data of part band are lost in transmitting procedure
Lose, cause some bands be correctly decoded, decoding end can also be maximum according to the band for being properly received data for receiving
Repair and lose data strip and show in limit ground.(4) as these I frame data are important, it is the basis of subsequent frame reference, this
The data of a little transmission in advance can be circulated check code transmission, when there is partial data to lose in transmitting procedure, can be with
Do data recovery.This method is more suitable for the offline static coding of program request, is not suitable for live coding, because offline coding can
To detect next carry over point in advance, the position of next I frames can be confirmed in advance, and the live look-ahead next one that is difficult to is changed
Site, also cannot confirm the position of previous I frames in advance.
Description of the drawings
Design principle block diagrams of the Fig. 1 for the embodiment of the present invention.
Specific embodiment
In order that the technological means of the present invention, creation characteristic and reached purpose are readily apparent from understanding, below in conjunction with concrete reality
Apply example and the present invention is expanded on further.
Embodiment 1：I frames in described image sequence are divided into multiple bands by a kind of balanced code check coded method, respectively
Coding transmission, specifically includes following steps：
Step one, for static transcoding process, can find next scene switching point in image sequence in advance, and determine
It is scheduled on insertion I frames at this scene switching point.This I frame is due to being in-line coding, unrelated with other frames, can be than the P before it
Frame and B frames shift to an earlier date absolute coding.
Step 2, the data produced by band segmentation and then coding are transmitted respectively.
Step 3, it is as the data of P frames and B frames are considerably less than the data of I frames, when P frames or B frame data are transmitted, suitable
With the follow-up I frame data for having encoded the band partition encoding for completing are transmitted, be conducive to smoothing out code stream.Along with the follow-up of transmission
The size of the data fragments of I frames, is the size according to this frame (P or B), and then the data fragments of I frames are just less greatly for this frame, and this frame is little
Then the data fragments of I frames are just big, and main purpose is smooth-going code stream, strives for reaching object code in the timeslice of each frame
Rate.For example, the video for fps=25, the timeslice of a frame is 40ms, the reason if target bit rate is 1Mbps, per frame
Think that size is 41943bit.
Step 4, in decoding end, decoder constantly collects follow-up I frame data in P frames and B frame transmitting procedures, waits complete
Collect and complete in portion, you can intactly decode this I frame.
Step 5, as existing video standard is not carried out the standard syntax of above-mentioned algorithm, said process to be realized can
In the method transmitted with sideband data, realized by the cooperation of decoding end.
Step 6, a kind of simple dividing method are exactly divided into the same zones of different of size I frames.So
The data of coding different bands out are substantially similar.Stiff band cutting may leave the vestige of band boundaries.In addition
A kind of dividing method, be the region division with more georeferencing characteristics be a band, such as background band, prospect bar
Band.Determine that band is split according to prospect shape, the border of such band will not be apparent.After the completion of coding, these can be compiled
Packet after code in magnitude order, is individually assigned to the P frames or B frame data bags of above GOP, along band transmission.These
Band border can cover mutually, form redundancy.Not static band, but divided according to image conditions dynamic, finally have one
Individual remainder encoding strip thereof, it is ensured that a complete renewal is obtained when a cycle is finished.
Step 7, in decoding end, as the display time of these dividing strip is consistent, is all equal to what they represented
The display time of I frames, standard decoding program are decoded after these strip datas are received respectively, I frames the display time by these
Strip data unanimously shows, will obtain a complete I frame.
By these steps, it is possible to the fluctuation for avoiding the big data quantity of I frames from bringing, and P frame B interframe, and one
Complexity and quantity of motion is not of uniform size causes etc., the coded data for the causing code stream for causing to bring not of uniform size in individual GOP and between GOP
Fluctuation.
Above content is with reference to specific preferred implementation further description made for the present invention, it is impossible to assert
The present invention be embodied as be confined to these explanations.For general technical staff of the technical field of the invention,
On the premise of without departing from core idea of the present invention, some simple deduction or replace can also be made, these changes and improvements all fall
Enter in scope of the claimed invention.
Claims (7)
1. a kind of balanced code check coded method, it is characterised in that the I frames in image sequence are divided into into multiple bands, are compiled respectively
Code transmission, specifically includes following steps：(1) carry out band segmentation：In static transcoding, in described image sequence, dynamic shifts to an earlier date
Next scene switching point is found, and I frames is inserted at this scene switching point；(2) simultaneous transmission：I frames after band segmentation
Data, transmitted respectively；When P frames or B frame data are transmitted, the follow-up band for completing that encoded is transmitted in the lump and is divided
Cut the I frames of coding；(3) merge decoding：Corresponding progressive decoding device is constantly collected follow-up in P frames and B frame transmitting procedures is received
I frame data, wait all to collect completing, then which decoded.
2. balanced code check coded method according to claim 1, it is characterised in that the I frames in the step (1) are only in advance
Vertical coding.
3. balanced code check coded method according to claim 1, it is characterised in that carry out while passing in the step (2)
When defeated, according to the follow-up I frames that the size of P or B frames selects to transmit in the lump.
4. balanced code check coded method according to claim 1, it is characterised in that in described image sequence each image is all
By the reliable area being made up of the adjacent macro block in space, the reliable area keeps constant or increases frame by frame.
5. balanced code check coded method according to claim 4, it is characterised in that the reliable area is arbitrary shape.
6. a kind of video encoder of the balanced code check coded method for described in claim 1, it is characterised in that the encoder
It is arranged to at least one frame of video to be divided into one group of encoding block, the encoding block described at least one is entered by intraframe coding
Row coding.
7. a kind of Video Decoder of the balanced code check coded method for described in claim 1, it is characterised in that the decoding
Device is progressive decoding device, for merging decoding to collected P frames, B frames and I frame data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210435590.1A CN103796019B (en) | 2012-11-05 | 2012-11-05 | A kind of balanced code check coded method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201210435590.1A CN103796019B (en) | 2012-11-05 | 2012-11-05 | A kind of balanced code check coded method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103796019A CN103796019A (en) | 2014-05-14 |
| CN103796019B true CN103796019B (en) | 2017-03-29 |
Family
ID=50671241
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201210435590.1A Expired - Fee Related CN103796019B (en) | 2012-11-05 | 2012-11-05 | A kind of balanced code check coded method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103796019B (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105765973B (en) | 2015-03-31 | 2018-06-08 | 深圳市大疆创新科技有限公司 | A kind of method and code device of image coding |
| CN106713913B (en) * | 2015-12-09 | 2020-01-10 | 腾讯科技（深圳）有限公司 | Video image frame sending method and device and video image frame receiving method and device |
| CN109151469B (en) | 2017-06-15 | 2020-06-30 | 腾讯科技（深圳）有限公司 | Video coding method, device and equipment |
| CN112449190B (en) * | 2019-09-05 | 2024-07-09 | 曙光网络科技有限公司 | Decoding method of concurrent video session IPB frame image group |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2001063935A1 (en) * | 2000-02-24 | 2001-08-30 | M-Wave Limited | Video and audio coding |
| KR20040062109A (en) * | 2002-12-31 | 2004-07-07 | 엘지전자 주식회사 | Method for moving picture coding |
| CN1774934A (en) * | 2002-04-29 | 2006-05-17 | 诺基亚有限公司 | Random access points in video encoding |
| CN1848953A (en) * | 2005-04-11 | 2006-10-18 | 华为技术有限公司 | Method for controlling code rate in H263 coding |
-
2012
- 2012-11-05 CN CN201210435590.1A patent/CN103796019B/en not_active Expired - Fee Related
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2001063935A1 (en) * | 2000-02-24 | 2001-08-30 | M-Wave Limited | Video and audio coding |
| CN1774934A (en) * | 2002-04-29 | 2006-05-17 | 诺基亚有限公司 | Random access points in video encoding |
| KR20040062109A (en) * | 2002-12-31 | 2004-07-07 | 엘지전자 주식회사 | Method for moving picture coding |
| CN1848953A (en) * | 2005-04-11 | 2006-10-18 | 华为技术有限公司 | Method for controlling code rate in H263 coding |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103796019A (en) | 2014-05-14 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7826531B2 (en) | Indicating regions within a picture | |
| CN103873869A (en) | Code rate control method | |
| CN103155571B (en) | Decoding stereo video data | |
| US7991053B2 (en) | Method and apparatus to enable acquisition of media in streaming applications | |
| JP5238523B2 (en) | Moving picture encoding apparatus, moving picture decoding apparatus, and moving picture decoding method | |
| CN105409215B (en) | depth prediction mode selecting method and device | |
| CN101321284B (en) | Encoding/decoding method, equipment and system | |
| JP2008099325A (en) | Method for random access and gradual video refresh in video coding | |
| CN105379284A (en) | Dynamic image encoding apparatus and operation method thereof | |
| CN103796019B (en) | A kind of balanced code check coded method | |
| WO2000018136A1 (en) | Region-based refresh strategy for video compression | |
| CN104883572B (en) | It is a kind of based on preceding background separation encoding device H.264 or H.265 and method | |
| CN102438147B (en) | Intra-frame synchronous stereo video multi-reference frame mode inter-view predictive coding and decoding method | |
| JP2001285876A (en) | Image encoding device, its method, video camera, image recording device and image transmitting device | |
| CN106412611B (en) | A kind of complexity control method of efficient video coding | |
| CN105163117A (en) | Image coding and processing methods and devices | |
| CN101568038B (en) | Multi-viewpoint error resilient coding scheme based on disparity/movement joint estimation | |
| CN104081771B (en) | For being compressed the method and apparatus of coding to the image in image sequence | |
| CA2542026C (en) | Indicating regions within a picture | |
| KR100780844B1 (en) | Decoder, processing system and processing method for multi-view frame data, and recording medium having program performing this | |
| JP2015082799A (en) | Animation decoding process device, animation encoding process device, and operation method thereof | |
| CN117812268A (en) | Video transcoding method, device, equipment and medium | |
| Suzuki et al. | Standardization of HEVC Video Coding Scheme Reducing Video Traffic by Half and Perspective for Mobile Services | |
| JP2004147306A (en) | Low delay video encoding and decoding apparatus | |
| Wang | Research on error resilient schemes for video transmission |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20170329 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |