CN102045571A - Fast iterative search algorithm for stereo video coding - Google Patents

Fast iterative search algorithm for stereo video coding Download PDF

Info

Publication number
CN102045571A
CN102045571A CN 201110007342 CN201110007342A CN102045571A CN 102045571 A CN102045571 A CN 102045571A CN 201110007342 CN201110007342 CN 201110007342 CN 201110007342 A CN201110007342 A CN 201110007342A CN 102045571 A CN102045571 A CN 102045571A
Authority
CN
China
Prior art keywords
current block
vector
motion
iteration
time
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.)
Granted
Application number
CN 201110007342
Other languages
Chinese (zh)
Other versions
CN102045571B (en
Inventor
贾克斌
邓智玭
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing University of Technology
Original Assignee
Beijing University of Technology
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Beijing University of Technology filed Critical Beijing University of Technology
Priority to CN 201110007342 priority Critical patent/CN102045571B/en
Publication of CN102045571A publication Critical patent/CN102045571A/en
Application granted granted Critical
Publication of CN102045571B publication Critical patent/CN102045571B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Compression Or Coding Systems Of Tv Signals (AREA)

Abstract

The invention discloses a fast iterative search algorithm for stereo video coding, which is characterized in that a stereo-motion constraint model is defined according to the relation between the motion vector and disparity vector of the stereo image pair of the adjacent images of the left viewpoint and right viewpoint of a stereo video. The fast iterative search method for stereo video coding comprises the following steps: initializing, adjusting the RSR (rank sum ration) of an amending search window, carrying out iterative search, and suspending: calculating the initial motion vector and initial disparity vector of a current module by adopting an iterative search strategy, and designing the adaptive amending search window according to the error of the stereo-motion constraint model to amend the motion vector and disparity vector of the current module so that the optimum motion vector and optimum disparity vector of the current module can be finally predicted rapidly. Compared with the traditional full search algorithm, the fast iterative search algorithm provided by the invention can ensure the coding quality and save the coding time by over 96 percent.

Description

A kind of stereo scopic video coding iteratively faster searching method
Technical field
The present invention relates to field of video encoding, especially relate to motion vector and difference vector fast search algorithm in a kind of stereo scopic video coding.
Background technology
Three-dimensional video-frequency contains the depth information of scenery, has more the sense of reality on the sign of natural scene, has represented wide application prospect at the stereo visual system of 3D TV, mobile device and fields such as video conferencing with telepresenc.
Two video channels about three-dimensional video-frequency comprises, typical IPPPP predict as shown in Figure 1, horizontal direction is a time orientation, vertical direction is a viewpoint direction.Make that left viewpoint is a reference view, promptly left viewpoint is coding earlier, and first frame of left viewpoint is the I frame, when coding, does not need the information with reference to other frame, directly carries out dct transform, equal interval quantizing, and run length coding is sent into arithmetic encoder at last.Viewpoint other frame except that first frame in a left side all is the P frame, carries out estimation by the coded frame with reference to the left previous moment of viewpoint.Right viewpoint is the prediction viewpoint, and first frame is the P frame, has both allowed it to carry out disparity estimation with reference to first frame of left viewpoint, allows intraframe predictive coding again, chooses more excellent coded system from the two, has guaranteed code efficiency.All the other P frames of right viewpoint all comprise two reference frames, the reference frame of not only wanting the reference time direction (promptly, the coded frame in the right previous moment of viewpoint) carries out estimation, also want the reference frame (that is the coded frame in the left identical moment of viewpoint) of reference view direction to carry out disparity estimation.Traditional three-dimensional video-frequency compression passing through all direction search method, adopt the large search window to carry out estimation and disparity estimation respectively, with the time and space redundancy of eliminating same viewpoint inside and the crossing redundancy between the viewpoint of the left and right sides, and the rate distortion costs of comparing motion vector and difference vector, selection makes the final predictive vector as current block of rate distortion costs minimum.Wherein, rate distortion costs by RDCost (mv)=SAD (c, r)+λ * R (mv-p) calculates, mv represents the motion/disparity vector of current block, c represents current block, r represents to predict piece, and λ represents Lagrange multiplier, and p represents the predicted value of the motion/disparity vector of current block, the required bit number of difference of R (mv-p) presentation code motion/disparity vector and predicted value, SAD (c, r) expression current block and the prediction piece absolute error and
Figure BDA0000043764290000021
B 1, B 2Level and the Vertical number of pixels of representing piece respectively, the coordinate of [i, j] remarked pixel, c[i, j] expression current block pixel value; R[i-mv x, j-mv y] pixel value of expression prediction piece, (mv x, mv y) level and the vertical component size of motion/disparity vector of expression current block.Traditional full-search algorithm has brought huge operand when obtaining high distortion performance, limited the real-time application of three-dimensional video-frequency.
At present, three-dimensional video-frequency fast coding algorithm can be divided into two big classes substantially: a class is based on the encryption algorithm of predictive vector, with full-search algorithm a certain territory (disparity domain or motion field) calculated parallax or motion vector earlier, utilize " stereo-picture to ", to adopt fast algorithm to predict [1-2] then to another territory (motion field or disparity domain) at the consistency or the adjacent viewpoint motion vector agreement principle of adjacent moment difference vector.This class algorithm can obtain coding efficiency preferably, but because the accuracy of next territory (motion field or disparity domain) predictive vector depends on predicting the outcome of last territory (disparity domain or motion field), therefore last territory often adopts the full-search algorithm of limit to guarantee result's accuracy, and coding rate still has much room for improvement.Another kind of is motion and parallax associating algorithm for estimating, serial correlation principle according to three-dimensional video-frequency, the information of motion field and disparity domain can be utilized mutually, motion and the direct prediction of difference vector relation by adjacent image obtain the motion/disparity vector of current block, thereby reduce encoder complexity [3-4] to greatest extent.But the research of this class algorithm at present is mostly only at pixel domain or based on mpeg standard, can not with the block-based H.264/AVC video encoding standard compatibility of current main-stream, and, directly utilize the motion and the difference vector of adjacent image to concern that trying to achieve predictive vector is absorbed in local minimum easily, coding quality can not get guaranteeing.
The present invention is based on H.264/AVC standard, propose a kind of stereo scopic video coding iteratively faster searching algorithm based on solid-kinematic constraint model, significantly reduce encoder complexity under the prerequisite that guarantees high compression rate, is very significant.
Attached: list of references
[1]Ding?L?F,Chien?S?Y,Chen?L?G.Joint?prediction?algorithm?and?architecture?for?stereo?video?hybrid?coding?systems[J]IEEE?Transactions?on?Circuits?and?Systems?for?Video?Technology,2006,16(11):1324-1337
[2]Lai?P,Ortega?A.Predictive?fast?motion/disparity?search?for?multiview?video?coding[C]//SPIE.Proceedings?of?SPIE.San?Jose:Visual?Communications?and?Image?Processing,2006,6077:607709
[3]Paras?I,Alvertos?N,Tziritas?G.Joint?disparity?and?motion?field?estimation?in?stereoscopic?image?sequences[C]//IEEE.Proceedings?of?13th?International?Conference?on?Pattern?Recognition.Vienna:ICPR,1996:359-363
[4]Kim?Y,Lee?J,Park?C,et?al.MPEG-4?compatible?stereoscopic?sequence?codec?for?stereo?broadcasting[J]IEEE?Transactions?on?Consumer?Electronics,2005,51(4):1227-1236
Summary of the invention
The objective of the invention is to,,, realize the stereo scopic video coding of low complex degree to solve the high problem of picture frame encoder complexity of the right viewpoint of three-dimensional video-frequency except that first frame by a kind of stereo scopic video coding iteratively faster searching method is provided.
The present invention solves the problems of the technologies described above the technical scheme of taking:
A kind of stereo scopic video coding iteratively faster searching method makes the macro block MB in the right viewpoint t time chart picture R, tBe current block, i is the iteration step number, and δ is the model error of solid-kinematic constraint model, mv R, t(MB R, t) expression current block the optimal motion vector, dv R, t(MB R, t) expression current block optimum difference vector,
Figure BDA0000043764290000031
Be the rate distortion costs of the motion vector of the i time revised current block of iteration,
Figure BDA0000043764290000032
Be the rate distortion costs of the motion vector of the i-1 time revised current block of iteration,
Figure BDA0000043764290000033
Be the rate distortion costs of the difference vector of the i time revised current block of iteration,
Figure BDA0000043764290000034
Be the rate distortion costs of the difference vector of the i-1 time revised current block of iteration, may further comprise the steps:
1.1, initialization; Determine the motion-vector search starting point of current block
Figure BDA0000043764290000035
Difference vector search starting point with current block Obtain the motion-vector search starting point of revised current block
Figure BDA0000043764290000037
Difference vector search starting point with revised current block
Figure BDA0000043764290000038
Preserve the motion of revised current block and the rate distortion costs of difference vector search starting point;
1.2, according to the size of following formula adjustment correction search window RSR,
RSR = RSR MIN &delta; < T 1 RSR MIN + &delta; - T 1 T 2 - T 1 ( RSR MAX - RSR MIN ) T 1 &le; &delta; &le; T 2 RSR MAX &delta; > T 2
Wherein, T 1And T 2Represent two threshold value (T 1<T 2), RSR MINBe minimum correction search window, RSR MAXBe the maximum modified search window;
1.3, iterative search procedures; Determine the difference vector prediction initial value of the i time iteration current block
Figure BDA00000437642900000310
Carry out the vector correction, obtain the difference vector of the i time revised current block of iteration Determine the motion-vector prediction initial value of the i time iteration current block
Figure BDA00000437642900000312
Carry out the vector correction, obtain the motion vector of the i time revised current block of iteration
Figure BDA00000437642900000313
Preserve the rate distortion costs of the motion vector and the difference vector of the i time revised current block of iteration.
1.4, abort criterion: if
Figure BDA0000043764290000041
And
Figure BDA0000043764290000042
Then make the motion vector of the i-1 time revised current block of iteration
Figure BDA0000043764290000043
And difference vector
Figure BDA0000043764290000044
Respectively as the optimal motion vector mv of current block R, t(MB R, t) and the optimum difference vector dv of current block R, t(MB R, t), the finishing iteration search procedure, otherwise, make i=i+1, by
Figure BDA0000043764290000045
Recomputate and upgrade δ, jump to step 1.2, wherein,
Figure BDA0000043764290000046
With
Figure BDA0000043764290000047
Represent the motion vector of the i time revised current block of iteration and the difference vector of the i time revised current block of iteration respectively;
Wherein, The difference vector of representing the motion compensation block of the i time iteration current block in the time orientation reference frame,
Figure BDA0000043764290000049
The motion vector of the parallax compensation piece of the i time iteration current block in the viewpoint direction reference frame.
Aforesaid step 1.1 comprises:
2.1, make i=0, δ=0;
2.2, the motion-vector search starting point of described definite current block
Figure BDA00000437642900000410
Difference vector search starting point with current block
Figure BDA00000437642900000411
Pass through candidate set
Figure BDA00000437642900000412
With
Figure BDA00000437642900000413
Obtain;
Wherein, mv a/ dv a, mv b/ dv bAnd mv c/ dv cRepresent left side piece a, upper block b that current block is adjacent and motion or the difference vector of upper right c respectively, mv MedAnd dv MedRepresent the median vector of current block motion vector and the median vector of current block difference vector respectively, mv L, tBe the motion vector of current block piece identical in the viewpoint direction reference frame, dv with the current block position R, t-1Difference vector for current block piece identical in the time orientation reference frame with the current block position;
2.3, the described motion-vector search starting point that obtains revised current block
Figure BDA00000437642900000414
Difference vector search starting point with revised current block
Figure BDA00000437642900000415
Respectively with the motion-vector search starting point of current block Difference vector search starting point with current block
Figure BDA00000437642900000417
Be the center, delimit a RSR MIN* RSR MINThe correction search window, in this search window, do the vector correction and obtain; The rate distortion costs of the motion-vector search starting point of the revised current block of described preservation, note is done
Figure BDA00000437642900000418
The rate distortion costs of the difference vector search starting point of the revised current block of described preservation, note is done Make i=i+1.
Threshold value T in the aforesaid step 1.2 1Be 5, threshold value T 2Be 20, RSR MINBe 2, RSR MAXBe 96.
Aforesaid step 1.3 comprises:
4.1, the difference vector of the i time iteration current block prediction initial value
Figure BDA0000043764290000051
By
Figure BDA0000043764290000052
Calculate;
Wherein,
Figure BDA0000043764290000053
The motion vector of representing the current block that the i-1 time iteration obtains; The difference vector of the encoding block that expression is covered by the motion compensation block of current block in the time orientation reference frame, u are represented the number of the encoding block that is capped, will make
Figure BDA0000043764290000056
Minimum
Figure BDA0000043764290000057
As the difference vector of the motion compensation block of the i time iteration current block in the time orientation reference frame, note is done
Figure BDA0000043764290000058
Figure BDA0000043764290000059
It is the motion vector of the parallax compensation piece of current block in the viewpoint direction reference frame that obtain of the i-1 time iteration;
With
Figure BDA00000437642900000510
Be the center, delimit the search window of a RSR * RSR, in this search window, carry out the vector correction, obtain the difference vector of the i time revised current block of iteration
Figure BDA00000437642900000511
Preserve the rate distortion costs of the difference vector of the i time revised current block of iteration, note is done
Figure BDA00000437642900000512
4.2, the motion-vector prediction initial value of the i time iteration current block
Figure BDA00000437642900000513
By
Figure BDA00000437642900000514
Calculate;
Wherein,
Figure BDA00000437642900000515
Figure BDA00000437642900000516
The difference vector of the i time revised current block of iteration that obtains in the expression step 4.1,
Figure BDA00000437642900000517
The difference vector of the encoding block that expression is covered by the parallax compensation piece of current block in the viewpoint direction reference frame, v are represented the number of the encoding block that is capped, will make
Figure BDA00000437642900000518
Minimum
Figure BDA00000437642900000519
As the motion vector of the parallax compensation piece of the i time iteration current block in the viewpoint direction reference frame, note is done
Figure BDA00000437642900000520
Figure BDA00000437642900000521
The difference vector of the motion compensation block of the i time iteration current block in the time orientation reference frame that obtains in the expression step 4.1;
With
Figure BDA00000437642900000522
Be the center, delimit the search window of a RSR * RSR, in this search window, carry out the vector correction, obtain the motion vector of the i time revised current block of iteration
Figure BDA00000437642900000523
Preserve the rate distortion costs of the motion vector of the i time revised current block of iteration, note is done
Figure BDA0000043764290000061
Compared with prior art, the invention has the advantages that: traditional stereo scopic video coding algorithm adopts large search window separate searches motion vector and difference vector respectively in time orientation reference frame and viewpoint direction reference frame, there is not to utilize the vector correlation between " stereo-picture to ", the present invention is by setting up solid-kinematic constraint model, and iterative search strategy according to a kind of self adaptation correction of big gizmo window of model error, this method can be when keeping coding quality, greatly reduce the complexity of stereo scopic video coding, improve coding rate.
Experimental result proves that method of the present invention can not save for average 96.43% scramble time when not reducing coding quality substantially.
Description of drawings
Fig. 1 is the stereo scopic video coding structural representation;
Fig. 2 is solid-kinematic constraint model schematic diagram;
Fig. 3 is the flow chart of the inventive method;
Fig. 4 is the predictive vector schematic diagram of adjacent block;
Fig. 5 is a schematic diagram of asking the motion-vector prediction initial value;
Fig. 6 is a schematic diagram of asking difference vector prediction initial value;
Fig. 7 is the rate distortion curve signal of " Ballroom " sequence algorithms of different.
Embodiment
Embodiment is further elaborated the present invention below in conjunction with accompanying drawing.
Fig. 2 is solid-kinematic constraint model schematic diagram, and 4 width of cloth images of three-dimensional video-frequency left and right sides viewpoint adjacent moment are called one " stereo-picture to ", and wherein, right viewpoint t time chart is as F R, tBe present frame, MB R, tThe expression present frame, F R, tIn current block.F L, tExpression current block MB R, tAt the reference frame of viewpoint direction, F R, t-1Expression current block MB R, tAt the reference frame of time orientation, F L, t-1Expression DCMB L, tAt the reference frame of time orientation, F L, t-1Also be MCMB R, t-1At the reference frame of viewpoint direction, wherein, DCMB L, tExpression current block MB R, tAt F L, tIn the parallax compensation piece, MCMB L, t-1Expression DCMB L, tAt F L, t-1In motion compensation block, MCMB R, t-1Expression current block MB R, tAt F R, t-1In motion compensation block, DCMB L, t-1Expression MCMB R, t-1At F L, t-1In the parallax compensation piece.
The motion vector of " stereo-picture to " and difference vector relation can be expressed from the next,
δ=‖mv r,t(MB r,t)+dv r,t-1(MCMB r,t-1)-dv r,t(MB r,t)-mv l,t(DCMB l,t)‖
Wherein, ‖ v ‖ represents the norm of v, and δ is the model error of solid-kinematic constraint model, mv R, t(MB R, t) be current block MB R, tThe optimal motion vector, dv R, t(MB R, t) be current block MB R, tOptimum difference vector, dv R, t-1(MCMB R, t-1) be MCMB R, t-1Difference vector, mv L, t(DCMB L, t) be DCMB L, tMotion vector.
And if only if MCMB L, t-1And DCMB L, t-1For same object when the true convergent point on different 3D surface, the δ in the following formula equals 0, that is,
mv r,t(MB r,t)+dv r,t-1(MCMB r,t-1)=dv r,t(MB r,t)+mv l,t(DCMB l,t)
The present invention is directed to the encoding block design motion vector of all frames of the right viewpoint of three-dimensional video-frequency except that first frame and the method for quick predicting of difference vector, right viewpoint first frame still adopts full-search algorithm to guarantee search precision.Fig. 3 is the flow chart of the inventive method, is divided into initialization, adjusts and revise search box size, iterative search and four steps of abort criterion.Suppose the macro block MB in the right viewpoint t time chart picture R, tBe current block, i represents the iteration step number, and δ is the model error of solid-kinematic constraint model, mv R, t(MB R, t) and dv R, t(MB R, t) represent the optimal motion vector of current block and the optimum difference vector of current block respectively, method step of the present invention is as follows:
The first step, initialization:
1) makes i=0, δ=0;
2) by candidate set
Figure BDA0000043764290000071
With
Figure BDA0000043764290000072
Determine the motion-vector search starting point of current block
Figure BDA0000043764290000073
Difference vector search starting point with current block
Figure BDA0000043764290000074
Wherein, mv a/ dv a, mv b/ dv bAnd mv c/ dv cRepresent left side piece a, upper block b that current block is adjacent and motion or the difference vector of upper right c respectively, mv MedAnd dv MedThe median vector of representing the motion vector and the difference vector of current block respectively, median vector mv MedHorizontal component and vertical component equal mv respectively a, mv bAnd mv cThe intermediate value of horizontal component and vertical component, median vector dv MedHorizontal component and vertical component equal dv respectively a, dv bAnd dv cThe intermediate value of horizontal component and vertical component, mv L, tBe the motion vector of current block piece identical in the viewpoint direction reference frame, dv with the current block position R, t-1Be the difference vector of current block piece identical in the time orientation reference frame, as shown in Figure 4 with the current block position.Because the adjacent block of current block has been finished coding, each adjacent block all has only motion vector or difference vector, and for example, only there is mv in the adjacent block a for the current block left side aPerhaps dv a, therefore, if a encodes mv in the disparity estimation mode aJust do not exist.In this case, we replace mv with (0,0) aCalculate median vector mv MedRelatively the rate distortion costs of each candidate's predictive vector is chosen motion and the difference vector search starting point as the current block that make the rate distortion costs minimum respectively
Figure BDA0000043764290000081
With
Figure BDA0000043764290000082
3) respectively with the motion-vector search starting point of current block
Figure BDA0000043764290000083
Difference vector search starting point with current block
Figure BDA0000043764290000084
Be the center, delimit a RSR MIN* RSR MINThe correction search window, in this search window, do the vector correction, obtain the motion vector of revised current block and difference vector search starting point With
Figure BDA0000043764290000086
Preserve the rate distortion costs of the motion-vector search starting point of revised current block, note is done
Figure BDA0000043764290000087
Preserve the rate distortion costs of the difference vector search starting point of revised current block, note is done Make i=i+1.
Second step is according to the size of following formula adjustment correction search window RSR.
RSR = RSR MIN &delta; < T 1 RSR MIN + &delta; - T 1 T 2 - T 1 ( RSR MAX - RSR MIN ) T 1 &le; &delta; &le; T 2 RSR MAX &delta; > T 2
Wherein, RSR MINBe the correction search window (being generally 2 * 2 pixels) of minimum, RSR MAXBe the correction search window of maximum (get the search box size of full-search algorithm usually, promptly 96 * 96), T 1And T 2Represent two threshold value (T 1<T 2), be used for controlling the size of revising search window, when model error δ greater than threshold value T 2The time (T 2Be generally 20), current block is the motion occlusion area probably, needs to adopt big correction search window RSR MAXGuarantee search precision; When model error δ less than threshold value T 1The time, T 1Usually get 5, the motion/disparity vector that the current block that obtains in the current iteration process is described is very near the optimal motion/difference vector of current block, so, adopt less correction search window RSR MIN, just be enough to guarantee search precision; Otherwise, design the correction search window of a self adaptation size according to the size of model error δ.
The 3rd step, iterative search procedures:
1) by
Figure BDA00000437642900000810
Calculate the difference vector prediction initial value of current block in the i time iterative process
Figure BDA00000437642900000811
Wherein,
Figure BDA00000437642900000812
Figure BDA00000437642900000813
The motion vector of representing the current block that obtains in the i-1 time iterative process;
Figure BDA00000437642900000814
The difference vector of the encoding block that expression is covered by the motion compensation block of current block in the time orientation reference frame, u are represented the number of the encoding block that is capped, as shown in Figure 5, will make
Figure BDA00000437642900000815
Minimum
Figure BDA00000437642900000816
As the difference vector of the motion compensation block of current block in the time orientation reference frame in the i time iterative process, note is done
Figure BDA0000043764290000091
It is the motion vector of the parallax compensation piece of current block in the viewpoint direction reference frame that obtain in the i-1 time iterative process.
With Be the center, delimit the search window of a RSR * RSR, in this search window, carry out the vector correction, obtain the difference vector of revised current block in the i time iterative process
Figure BDA0000043764290000094
Preserve the rate distortion costs of the difference vector of revised current block in the i time iterative process, note is done
2) by
Figure BDA0000043764290000096
Calculate the motion-vector prediction initial value of current block in the i time iterative process
Figure BDA0000043764290000097
Wherein,
Figure BDA0000043764290000098
Figure BDA0000043764290000099
The difference vector of revised current block in the i time iterative process representing to obtain in the 3rd step step 1),
Figure BDA00000437642900000910
The difference vector of the encoding block that expression is covered by the parallax compensation piece of current block in the viewpoint direction reference frame, v are represented the number of the encoding block that is capped, as shown in Figure 6, will make
Figure BDA00000437642900000911
Minimum
Figure BDA00000437642900000912
As the motion vector of the parallax compensation piece of current block in the i time iterative process in the viewpoint direction reference frame, note is done
Figure BDA00000437642900000913
Figure BDA00000437642900000914
The difference vector of the motion compensation block of current block in the time orientation reference frame in the i time iterative process representing to obtain in the 3rd step step 1).
With
Figure BDA00000437642900000915
Be the center, delimit the search window of a RSR * RSR, in this search window, carry out the vector correction, obtain the motion vector of revised current block in the i time iterative process Preserve the rate distortion costs of the motion vector of revised current block in the i time iterative process, note is done
The 4th step, abort criterion:
Figure BDA00000437642900000918
The rate distortion costs of representing the motion vector of the i time revised current block of iterative process,
Figure BDA00000437642900000919
The rate distortion costs of representing the motion vector of the i-1 time revised current block of iterative process,
Figure BDA00000437642900000920
The rate distortion costs of representing the difference vector of the i time revised current block of iterative process,
Figure BDA00000437642900000921
The rate distortion costs of representing the difference vector of the i-1 time revised current block of iterative process, if
Figure BDA00000437642900000922
And
Figure BDA00000437642900000923
Then make the motion vector and the difference vector of revised current block in the i-1 time iterative process respectively With
Figure BDA00000437642900000925
Optimal motion vector mv as current block R, t(MB R, t) and the optimum difference vector dv of current block R, t(MB R, t), the finishing iteration search procedure.Otherwise, make i=i+1, by Recomputate and upgrade δ, jump to step B, wherein,
Figure BDA0000043764290000101
With The difference vector of representing revised current block in the motion vector of revised current block in the i time iterative process and the i time iterative process respectively,
Figure BDA0000043764290000103
The difference vector of representing the motion compensation block of current block in the time orientation reference frame in the i time iterative process,
Figure BDA0000043764290000104
The motion vector of the parallax compensation piece of current block in the viewpoint direction reference frame in the i time iterative process.
In order to check the performance of method proposed by the invention, method of the present invention and all direction search method are compared.Experiment porch is JMVM8.0, estimation and disparity estimation search box size are 32 * 32, macro block mode is Inter16 * 16, from " Ballroom ", " Exit ", " Vassar ", " Racel ", the viewpoint 0 of " Rena " sequence, respectively get 100 two field pictures in the viewpoint 1 respectively as left viewpoint and right viewpoint, left side viewpoint adopts traditional h.264 coding method to encode earlier, and right viewpoint adopts stereo scopic video coding iteratively faster searching method of the present invention to encode, and each sequence resolution is 640 * 480.All experiments are being configured to Intel (R) Core (TM) 2 Extreme X9650 2.99GHzCPU, and the PC of 4GB RAM goes up independent the execution.
Table 1 is that the coding result of algorithms of different compares.Fig. 7 is the rate distortion curve signal of " Ballroom " sequence algorithms of different.As can be seen, this paper algorithm is compared with the full search of JMVM, the variation of Y-PSNR at-0.33dB between+the 0.01dB, the excursion of average bit rate is between-10.93% to+0.07%, basically do not see the decline of coding quality, and this paper algorithm can be saved the scramble time more than 96%.
The coding result of table 1 algorithms of different and JMVM full-search algorithm are relatively
Figure BDA0000043764290000105

Claims (4)

1. a stereo scopic video coding iteratively faster searching method makes the macro block MB in the right viewpoint t time chart picture R, tBe current block, i is the iteration step number, and δ is the model error of solid-kinematic constraint model, mv R, t(MB R, t) expression current block the optimal motion vector, dv R, t(MB R, t) expression current block optimum difference vector,
Figure FDA0000043764280000011
Be the rate distortion costs of the motion vector of the i time revised current block of iteration,
Figure FDA0000043764280000012
Be the rate distortion costs of the motion vector of the i-1 time revised current block of iteration,
Figure FDA0000043764280000013
Be the rate distortion costs of the difference vector of the i time revised current block of iteration,
Figure FDA0000043764280000014
Be the rate distortion costs of the difference vector of the i-1 time revised current block of iteration, it is characterized in that may further comprise the steps:
1.1, initialization; Determine the motion-vector search starting point of current block
Figure FDA0000043764280000015
Difference vector search starting point with current block
Figure FDA0000043764280000016
Obtain the motion-vector search starting point of revised current block
Figure FDA0000043764280000017
Difference vector search starting point with revised current block
Figure FDA0000043764280000018
Preserve the motion of revised current block and the rate distortion costs of difference vector search starting point;
1.2, according to the size of following formula adjustment correction search window RSR,
RSR = RSR MIN &delta; < T 1 RSR MIN + &delta; - T 1 T 2 - T 1 ( RSR MAX - RSR MIN ) T 1 &le; &delta; &le; T 2 RSR MAX &delta; > T 2
Wherein, T 1And T 2Represent two threshold value (T 1<T 2), RAR MINBe minimum correction search window, RSR MAXBe the maximum modified search window;
1.3, iterative search procedures; Determine the difference vector prediction initial value of the i time iteration current block
Figure FDA00000437642800000110
Carry out the vector correction, obtain the difference vector of the i time revised current block of iteration
Figure FDA00000437642800000111
Determine the motion-vector prediction initial value of the i time iteration current block
Figure FDA00000437642800000112
Carry out the vector correction, obtain the motion vector of the i time revised current block of iteration Preserve the rate distortion costs of the motion vector and the difference vector of the i time revised current block of iteration;
1.4, abort criterion: if
Figure FDA00000437642800000114
And
Figure FDA00000437642800000115
Then make the motion vector of the i-1 time revised current block of iteration
Figure FDA00000437642800000116
And difference vector Respectively as the optimal motion vector mv of current block R, t(MB R, t) and the optimum difference vector dv of current block R, t(MB R, t), the finishing iteration search procedure, otherwise, make i=i+1, by Recomputate and upgrade δ, jump to step 1.2, wherein,
Figure FDA0000043764280000022
With
Figure FDA0000043764280000023
Represent the motion vector of the i time revised current block of iteration and the difference vector of the i time revised current block of iteration respectively;
Wherein,
Figure FDA0000043764280000024
The difference vector of representing the motion compensation block of the i time iteration current block in the time orientation reference frame,
Figure FDA0000043764280000025
The motion vector of the parallax compensation piece of the i time iteration current block in the viewpoint direction reference frame.
2. stereo scopic video coding iteratively faster searching method according to claim 1 is characterized in that described step 1.1 comprises:
2.1, make i=0, δ=0;
2.2, the motion-vector search starting point of described definite current block
Figure FDA0000043764280000026
Difference vector search starting point with current block
Figure FDA0000043764280000027
Pass through candidate set
Figure FDA0000043764280000028
With Obtain;
Wherein, mv a/ dv a, mv b/ dy bAnd mv c/ dv cRepresent left side piece a, upper block b that current block is adjacent and motion or the difference vector of upper right c respectively, mv MedAnd dv MedRepresent the median vector of current block motion vector and the median vector of current block difference vector respectively, mv L, tBe the motion vector of current block piece identical in the viewpoint direction reference frame, dv with the current block position R, t-1Difference vector for current block piece identical in the time orientation reference frame with the current block position;
2.3, the described motion-vector search starting point that obtains revised current block
Figure FDA00000437642800000210
Difference vector search starting point with revised current block
Figure FDA00000437642800000211
Respectively with the motion-vector search starting point of current block
Figure FDA00000437642800000212
Difference vector search starting point with current block
Figure FDA00000437642800000213
Be the center, delimit a RSR MIN* RSR MINThe correction search window, in this search window, do the vector correction and obtain; The rate distortion costs of the motion-vector search starting point of the revised current block of described preservation, note is done
Figure FDA00000437642800000214
The rate distortion costs of the difference vector search starting point of the revised current block of described preservation, note is done Make i=i+1.
3. stereo scopic video coding iteratively faster searching method according to claim 1 is characterized in that the threshold value T in the described step 1.2 1Be 5, threshold value T 2Be 20, RSR MINBe 2, RSR MAXBe 96.
4. stereo scopic video coding iteratively faster searching method according to claim 1 is characterized in that described step 1.3 comprises:
4.1, the difference vector of the i time iteration current block prediction initial value
Figure FDA0000043764280000031
By
Figure FDA0000043764280000032
Calculate;
Wherein,
Figure FDA0000043764280000033
Figure FDA0000043764280000034
The motion vector of representing the current block that the i-1 time iteration obtains; The difference vector of the encoding block that expression is covered by the motion compensation block of current block in the time orientation reference frame, u are represented the number of the encoding block that is capped, will make
Figure FDA0000043764280000036
Minimum
Figure FDA0000043764280000037
As the difference vector of the motion compensation block of the i time iteration current block in the time orientation reference frame, note is done
Figure FDA0000043764280000039
It is the motion vector of the parallax compensation piece of current block in the viewpoint direction reference frame that obtain of the i-1 time iteration;
With
Figure FDA00000437642800000310
Be the center, delimit the search window of a RSR * RSR, in this search window, carry out the vector correction, obtain the difference vector of the i time revised current block of iteration
Figure FDA00000437642800000311
Preserve the rate distortion costs of the difference vector of the i time revised current block of iteration, note is done
Figure FDA00000437642800000312
4.2, the motion-vector prediction initial value of the i time iteration current block
Figure FDA00000437642800000313
By
Figure FDA00000437642800000314
Calculate;
Wherein,
Figure FDA00000437642800000315
Figure FDA00000437642800000316
The difference vector of the i time revised current block of iteration that obtains in the expression step 4.1,
Figure FDA00000437642800000317
The difference vector of the encoding block that expression is covered by the parallax compensation piece of current block in the viewpoint direction reference frame, v are represented the number of the own encoding block that is capped, will make
Figure FDA00000437642800000318
Minimum
Figure FDA00000437642800000319
As the motion vector of the parallax compensation piece of the i time iteration current block in the viewpoint direction reference frame, note is done
Figure FDA00000437642800000321
The difference vector of the motion compensation block of the i time iteration current block in the time orientation reference frame that obtains in the expression step 4.1;
With Be the center, delimit the search window of a RSR * RSR, in this search window, carry out the vector correction, obtain the motion vector of the i time revised current block of iteration
Figure FDA00000437642800000323
Preserve the rate distortion costs of the motion vector of the i time revised current block of iteration, note is done
Figure FDA00000437642800000324
CN 201110007342 2011-01-13 2011-01-13 Fast iterative search algorithm for stereo video coding Expired - Fee Related CN102045571B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 201110007342 CN102045571B (en) 2011-01-13 2011-01-13 Fast iterative search algorithm for stereo video coding

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 201110007342 CN102045571B (en) 2011-01-13 2011-01-13 Fast iterative search algorithm for stereo video coding

Publications (2)

Publication Number Publication Date
CN102045571A true CN102045571A (en) 2011-05-04
CN102045571B CN102045571B (en) 2012-09-05

Family

ID=43911273

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 201110007342 Expired - Fee Related CN102045571B (en) 2011-01-13 2011-01-13 Fast iterative search algorithm for stereo video coding

Country Status (1)

Country Link
CN (1) CN102045571B (en)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102595164A (en) * 2012-02-27 2012-07-18 中兴通讯股份有限公司 Method, device and system for sending video image
CN103179390A (en) * 2011-12-23 2013-06-26 联发科技股份有限公司 Disparity search methods and apparatuses for searching for matching pixel block
WO2013159326A1 (en) * 2012-04-27 2013-10-31 Mediatek Singapore Pte. Ltd. Inter-view motion prediction in 3d video coding
CN108419082A (en) * 2017-02-10 2018-08-17 北京金山云网络技术有限公司 A kind of method for estimating and device
CN108885790A (en) * 2016-04-20 2018-11-23 英特尔公司 Image is handled based on exercise data generated
WO2022253318A1 (en) * 2021-06-04 2022-12-08 Beijing Bytedance Network Technology Co., Ltd. Method, device, and medium for video processing
CN115630191A (en) * 2022-12-22 2023-01-20 成都纵横自动化技术股份有限公司 Time-space data set retrieval method and device based on full-dynamic video and storage medium
CN115908170A (en) * 2022-11-04 2023-04-04 浙江华诺康科技有限公司 Binocular image noise reduction method and device, electronic device and storage medium

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090167843A1 (en) * 2006-06-08 2009-07-02 Izzat Hekmat Izzat Two pass approach to three dimensional Reconstruction
CN101600108A (en) * 2009-06-26 2009-12-09 北京工业大学 Motion in a kind of multiple view video coding and parallax combined estimation method
CN101895749A (en) * 2010-06-29 2010-11-24 宁波大学 Quick parallax estimation and motion estimation method
CN101917619A (en) * 2010-08-20 2010-12-15 浙江大学 Quick motion estimation method of multi-view video coding

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20090167843A1 (en) * 2006-06-08 2009-07-02 Izzat Hekmat Izzat Two pass approach to three dimensional Reconstruction
CN101600108A (en) * 2009-06-26 2009-12-09 北京工业大学 Motion in a kind of multiple view video coding and parallax combined estimation method
CN101895749A (en) * 2010-06-29 2010-11-24 宁波大学 Quick parallax estimation and motion estimation method
CN101917619A (en) * 2010-08-20 2010-12-15 浙江大学 Quick motion estimation method of multi-view video coding

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
《计算机辅助设计与图形学学报》 20101031 邓智玭,贾克斌,陈锐霖,伏长虹,萧允治 面向立体视频的视差-运动同步联立预测算法 第22卷, 第10期 2 *

Cited By (13)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103179390A (en) * 2011-12-23 2013-06-26 联发科技股份有限公司 Disparity search methods and apparatuses for searching for matching pixel block
CN102595164A (en) * 2012-02-27 2012-07-18 中兴通讯股份有限公司 Method, device and system for sending video image
WO2013127126A1 (en) * 2012-02-27 2013-09-06 中兴通讯股份有限公司 Video image sending method, device and system
US9912714B2 (en) 2012-02-27 2018-03-06 Zte Corporation Sending 3D image with first video image and macroblocks in the second video image
WO2013159326A1 (en) * 2012-04-27 2013-10-31 Mediatek Singapore Pte. Ltd. Inter-view motion prediction in 3d video coding
CN108885790A (en) * 2016-04-20 2018-11-23 英特尔公司 Image is handled based on exercise data generated
CN108885790B (en) * 2016-04-20 2022-11-22 英特尔公司 Processing images based on generated motion data
CN108419082A (en) * 2017-02-10 2018-08-17 北京金山云网络技术有限公司 A kind of method for estimating and device
WO2022253318A1 (en) * 2021-06-04 2022-12-08 Beijing Bytedance Network Technology Co., Ltd. Method, device, and medium for video processing
CN115908170A (en) * 2022-11-04 2023-04-04 浙江华诺康科技有限公司 Binocular image noise reduction method and device, electronic device and storage medium
CN115908170B (en) * 2022-11-04 2023-11-21 浙江华诺康科技有限公司 Noise reduction method and device for binocular image, electronic device and storage medium
CN115630191A (en) * 2022-12-22 2023-01-20 成都纵横自动化技术股份有限公司 Time-space data set retrieval method and device based on full-dynamic video and storage medium
CN115630191B (en) * 2022-12-22 2023-03-28 成都纵横自动化技术股份有限公司 Time-space data set retrieval method and device based on full-dynamic video and storage medium

Also Published As

Publication number Publication date
CN102045571B (en) 2012-09-05

Similar Documents

Publication Publication Date Title
CN102045571B (en) Fast iterative search algorithm for stereo video coding
US8817871B2 (en) Adaptive search range method for motion estimation and disparity estimation
CN101600108B (en) Joint estimation method for movement and parallax error in multi-view video coding
CN101917619B (en) Quick motion estimation method of multi-view video coding
US20120114036A1 (en) Method and Apparatus for Multiview Video Coding
US9961369B2 (en) Method and apparatus of disparity vector derivation in 3D video coding
CN101980538B (en) Fractal-based binocular stereoscopic video compression coding/decoding method
CN104285433A (en) Motion sensor assisted rate control for video encoding
CN104378643A (en) Intra-frame prediction mode selection method and system of 3D (3-dimension) video plus depth image
CN102291579A (en) Rapid fractal compression and decompression method for multi-cast stereo video
CN107318027A (en) Image coding/decoding method, image encoding/decoding apparatus and encoding/decoding image program
CN101990103A (en) Method and device for multi-view video coding
CN102316323B (en) Rapid binocular stereo-video fractal compressing and uncompressing method
CA2909561C (en) Method and apparatus for advanced temporal residual prediction in three-dimensional video coding
TWI489876B (en) A Multi - view Video Coding Method That Can Save Decoding Picture Memory Space
WO2006110007A1 (en) Method for coding in multiview video coding/decoding system
Huang et al. Encoding shaky videos by integrating efficient video stabilization
Lin et al. A fast direction predictor of inter frame prediction for multi-view video coding
CN102263952B (en) Quick fractal compression and decompression method for binocular stereo video based on object
CN102263953B (en) Quick fractal compression and decompression method for multicasting stereo video based on object
Lee et al. 3D motion estimation algorithm in 3D video coding
Lee et al. An object-based mode decision algorithm for multi-view video coding
KR101078525B1 (en) Method for coding of multi-view video
Deng et al. A fast view-temporal prediction algorithm for stereoscopic video coding
Kong et al. A Fast Algorithm for Motion and Disparity Estimation Based on the Reference Directions of Neighboring Macroblocks

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20120905

Termination date: 20150113

EXPY Termination of patent right or utility model