CN101710985A - Image brightness compensation method for image coding - Google Patents

Image brightness compensation method for image coding Download PDF

Info

Publication number
CN101710985A
CN101710985A CN 200910073397 CN200910073397A CN101710985A CN 101710985 A CN101710985 A CN 101710985A CN 200910073397 CN200910073397 CN 200910073397 CN 200910073397 A CN200910073397 A CN 200910073397A CN 101710985 A CN101710985 A CN 101710985A
Authority
CN
China
Prior art keywords
reference block
alpha
current block
template
image
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 200910073397
Other languages
Chinese (zh)
Other versions
CN101710985B (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.)
Harbin Institute of Technology
Original Assignee
Harbin Institute 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 Harbin Institute of Technology filed Critical Harbin Institute of Technology
Priority to CN 200910073397 priority Critical patent/CN101710985B/en
Publication of CN101710985A publication Critical patent/CN101710985A/en
Application granted granted Critical
Publication of CN101710985B publication Critical patent/CN101710985B/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 an image brightness compensation method for image coding, belongs to the field of image processing, and solves the problems of complexity, low speed and low compression efficiency of the conventional algorithm for performing brightness compensation for multi-viewpoint video coded images. The image brightness compensation method comprises the following steps: determining brightness difference between a current block P0 and a reference block PS by comparing the brightness difference between a current block template X0 and a reference block template XS, thereby realizing the brightness compensation for the current block; and utilizing a series of solved candidate weight matrixes B alpha, solving the optimal Bj and assigning the optimal Bj to weight matrixes B of the reference block PS, thereby solving the brightness difference between the current block template X0 and the reference block template XS according to B(X0T-XST), which serves as the brightness difference between the current block P0 and the reference block PS for brightness compensation.

Description

A kind of image brightness compensation method that is used for image encoding
Technical field
The present invention relates to a kind of image brightness compensation method that is used for image encoding, belong to image processing field.
Background technology
Because the progress that video obtains technology and video display technology, 3 D video is accepted by the consumer gradually with its distinctive advantage.By 3 D video technology people can be mutual the selection viewpoint, thereby the scene that can remove to observe real world with the angle that people like.Usually, 3 D video represents by many viewpoints, and each viewpoint is one and traditional passes through the two dimensional video sequence that video camera obtains.Multiple view video coding technology (MVC) is the key technology that adopts in the 3 D video transmission system that many viewpoints represent, can effectively reduce the computation complexity of transmission bandwidth and decoding end.
In the multiple view video coding system, because the influence of camera parameter and the variation of camera position and angle, the brightness value of same target object in different points of view can change.When carrying out predicting between the looking of multiple view video coding, these variations can cause mate in the difference estimation process inaccurate, cause the decline of code efficiency.People adopt the luminance compensation technology to solve difference estimation on the encoding and decoding aspect to mate inaccurate problem, promptly remove the luminance difference between different points of view in the difference estimation process.This luminance difference is called as local brightness variation.In decoding end, according to the difference predicted value, residual values and brightness changing value sum are reconstructed the piece that has carried out luminance compensation:
I(i,j)=R(i,j)+r(i+x,j+y)+C,
Wherein ((i j) is residual signals to R to I, and (i+x j+y) is reference block to r, and C is the brightness changing value of this piece for i, j) expression reconstructed blocks.
Luminance difference between the different points of view that exists in the multiple view video coding has caused influence to coding, and at present, the algorithm that the image of multiple view video coding is carried out luminance compensation is too complicated, and speed is slow, and compression efficiency is low.
Summary of the invention
The present invention seeks to that to carry out the algorithm of luminance compensation too complicated in order to solve at present image to multiple view video coding, speed is slow, and the problem that compression efficiency is low provides a kind of image brightness compensation method that is used for image encoding.
Method of the present invention may further comprise the steps:
The a certain macro block of definition current frame image is current block P 0, in present frame with described current block P 0Adjacent L shaped neighborhood is current block template X 0, current block template brightness value matrix is X 0, current block template brightness value matrix is X 0Transposed matrix be X 0 T,
Definition former frame image and current block P 0The macro block that is in same position is reference block P S, in the former frame image with described reference block P SAdjacent L shaped neighborhood is reference block template X S, reference block P SThe brightness value matrix be P S, reference block template brightness value matrix is X S, reference block template brightness value matrix X STransposed matrix be X S T,
Step 1, with reference block template X SIn all pixels and reference block P SCorrelation normalization form a series of candidate's weight matrix B α:
B α = ( l α , 0 Σ i = 0 m - 1 l α , i , l α , 1 Σ i = 0 m - 1 l α , i , . . . , l α , m - 1 Σ i = 0 m - 1 l α , i )
Reference block template X SIn m pixel altogether, each pixel on the angle [alpha] direction to reference block P SCorrelation be expressed as l respectively α, 0, l α, 1..., l α, m-1,
Wherein, α is reference block template X SIn pixel and reference block P SThe angle that intersects is the value of Discrete Change, and the Discrete Change amount of α is 5 °~20 °, 0 °≤α≤180 °,
Step 2, obtain reference block P SWeight matrix B=B j, wherein, parameter j is determined by following formula:
j = arg min α | P S - B α X S T E | ,
Step 3, according to B (X 0 T-X S T) E acquisition current block P 0With reference block P SBetween luminance difference, to current block P 0Carry out luminance compensation, wherein E is 1 complete 1 matrix for value, and its exponent number and reference block P SThe brightness value matrix be P SExponent number identical.
Advantage of the present invention: according to the luminance correlation of adjacent area in the video image, utilize the brightness of adjacent area to change the brightness variation of deriving between current block and the reference block, thereby realize luminance compensation to current block, algorithm of the present invention is simple, the speed of service is fast, has improved the multiple view video coding compression efficiency.
Description of drawings
Fig. 1 is the inventive method flow chart, Fig. 2 is current frame image distribution structure figure, Fig. 3 is former frame image distribution structure figure, and Fig. 4 is the correlation schematic diagram of pixel and reference block in the reference block template in the former frame image, and Fig. 5 utilizes the Race1 sequence to carry out the experimental result picture of emulation.
Embodiment
Embodiment one: below in conjunction with Fig. 1 to Fig. 5 present embodiment is described, present embodiment may further comprise the steps:
The a certain macro block of definition current frame image is current block P 0, in present frame with described current block P 0Adjacent L shaped neighborhood is current block template X 0, current block template brightness value matrix is X 0, current block template brightness value matrix is X 0Transposed matrix be X 0 T,
Definition former frame image and current block P 0The macro block that is in same position is reference block P S, in the former frame image with described reference block P SAdjacent L shaped neighborhood is reference block template X S, reference block P SThe brightness value matrix be P S, reference block template brightness value matrix is X S, reference block template brightness value matrix X STransposed matrix be X S T,
Step 1, with reference block template X SIn all pixels and reference block P SCorrelation normalization form a series of candidate's weight matrix B α:
B α = ( l α , 0 Σ i = 0 m - 1 l α , i , l α , 1 Σ i = 0 m - 1 l α , i , . . . , l α , m - 1 Σ i = 0 m - 1 l α , i ) - - - ( 1 )
Reference block template X SIn m pixel altogether, each pixel on the angle [alpha] direction to reference block P SCorrelation be expressed as l respectively α, 0, l α, 1..., l α, m-1,
Wherein, α is reference block template X SIn pixel and reference block P SThe angle that intersects is the value of Discrete Change, and the Discrete Change amount of α is 5 °~20 °, 0 °≤α≤180 °,
Step 2, obtain reference block P SWeight matrix B=B j, wherein, parameter j is determined by following formula:
j = arg min α | P S - B α X S T E | - - - ( 2 )
Step 3, according to B (X 0 T-X S T) E acquisition current block P 0With reference block P SBetween luminance difference, to current block P 0Carry out luminance compensation, wherein E is 1 complete 1 matrix for value, and its exponent number and reference block P SThe brightness value matrix be P SExponent number identical.
According to the continuity of adjacent area pixel brightness value in the video image, as shown in Figure 2, we define current block P 0L shaped neighborhood X 0Be the current block template, and current block template X 0Brightness value and current block P 0Brightness value between have stronger correlation.
Same, reference block P SWith reference block template X SBetween also have stronger correlation.
Therefore, method of the present invention is exactly by comparing current block template X 0With reference block template X SBetween luminance difference determine current block P 0With reference block P SBetween luminance difference.The establishment of formula (3) is promptly arranged.
Diff(P 0,P S)≈Diff(X 0,X S) (3)
P wherein 0, P S, X 0And X SBe the brightness value matrix.When calculating luminance difference, we think the luminance difference value basically identical in the piece, and the brightness value in the template is got weighted sum.That is:
P 0≈P s+(AX 0 T-BX S T)E (4)
AX wherein 0 T-BX S TBe the luminance difference between two pieces estimating to obtain according to template, E is 1 complete 1 matrix for value, current block P 0Weight matrix A and reference block P SWeight matrix B obtain according to the direction character of each pixel.Like this, in difference estimation and difference compensation process, can make up one and compensate the reference block that brightness changes, reference block P SThe matrix that forms after the compensate for brightness is:
P S′=P S+(AX 0 T-BX S T)E (5)
Improve the code efficiency of prediction between looking, improved the multiple view video coding compression efficiency.
Further, current block P 0With reference block P SThe direction character unanimity, A in the formula (5) and the value of B equate A=B in theory substantially, therefore, we only need obtain reference block P SWeight matrix B get final product, and formula (5) is reduced to:
P S′=P S+B(X 0 T-X S T)E (6)
P S' back by way of compensation current block P 0Brightness value matrix P 0, that is:
P 0=P S+B(X 0 T-X S T)E (7)
Introduce its computational process below in conjunction with Fig. 4:
The key of luminance compensation is whether luminance difference calculating is correct, and current block template X 0With reference block template X SWhen determining, luminance difference is determined by the luminance compensation weights.The present invention proposes and a kind ofly determine candidate's weights of template according to direction, and according to reference block P SIn direction character derive current block P 0Direction character.
For reference block template X SCertain interior pixel p defines its coordinate for (x y), as shown in Figure 4, puts ray and reference block P that p sends SWhat may intersect has a lot of bars, the direction character α that corresponding ray is different, its length of shining upon in piece is l, then defining point p on direction α to reference block P SCorrelation be l α, p, reference block template X SIn m pixel (from 0 to m) arranged, they and reference block P SCorrelation be respectively l α, 0, l α, 1..., l α, m-1, on the α direction, with all reference block template X SThe correlation normalization of middle m pixel obtains each candidate's weight matrix corresponding on the α direction:
B α = ( l α , 0 Σ i = 0 m - 1 l α , i , l α , 1 Σ i = 0 m - 1 l α , i , . . . , l α , m - 1 Σ i = 0 m - 1 l α , i ) ,
α is reference block template X SIn pixel can with reference block P SThe angle that intersects is the value of Discrete Change, and the Discrete Change amount of α is 5 °~20 °, 0 °≤α≤180 °,
Like this, just try to achieve a series of candidate's weight matrix B α, we select optimum weight matrix according to formula (2), can make | P S-B αX S TThe α assignment of E| minimum is given parameter j, again with B jAssignment is given reference block P SWeight matrix B, like this, just can be according to B (X 0 T-X S T) E obtains current block template X 0With reference block template X SBetween luminance difference, and as current block P 0With reference block P SBetween luminance difference, be used for luminance compensation.
Current block template brightness value matrix X 0, reference block template brightness value matrix is X SWith reference block P SWeight matrix B all be the matrix of 1 row m row, current block template brightness value transpose of a matrix matrix is X 0 TBe the matrix of capable 1 row of m, then B (X 0 T-X S T) be a number, E multiplies each other with matrix, obtains exponent number and reference block P SIdentical matrix is so that by formula (7) are to reference block P SLuminance compensation is carried out in addition.
The present invention is applicable to video compression system, includes but not limited to H.264/AVC, AVS, VC-1 etc.
Embodiment two: the difference of present embodiment and execution mode one is, is divided into 10 °~18 ° mutually between adjacent two discrete points of angle [alpha], and other is identical with execution mode one.
Fig. 5 has provided the rate distortion comparative result on the Race1 sequence, and wherein transverse axis is represented the bit number of average every frame, and the longitudinal axis is represented the Y-PSNR (PSNR) of average every frame.MVC is not for adding the result under the brightness compensation, and MVC+ICT (Illumination Compensation Template) is for having added the result based on the luminance compensation of template.As can be seen from the figure, the present invention has a significant effect to the compression efficiency that improves multiple view video coding.
Embodiment three: the difference of present embodiment and execution mode one is, is divided into 15 ° mutually between adjacent two discrete points of angle [alpha], and other is identical with execution mode one.
Present embodiment provides a specific embodiment, be divided into 15 ° mutually between adjacent two discrete points of angle [alpha], then the angle [alpha] value is 0,15,30,45,60,75,90,105,120,135,150,165, according to these discrete numerical value, tries to achieve 12 candidate's weight matrix B αValue is for use.
Embodiment four: the difference of present embodiment and execution mode one is, is divided into 18 ° mutually between adjacent two discrete points of angle [alpha], and other is identical with execution mode one.
Present embodiment provides a specific embodiment, be divided into 18 ° mutually between adjacent two discrete points of angle [alpha], then the angle [alpha] value is 0,18,36,54,72,90,108,126,144,162, according to these discrete numerical value, tries to achieve 10 candidate's weight matrix B αValue is for use.

Claims (5)

1. an image brightness compensation method that is used for image encoding is characterized in that, this method may further comprise the steps:
The a certain macro block of definition current frame image is current block P 0, in present frame with described current block P 0Adjacent L shaped neighborhood is current block template X 0, current block template brightness value matrix is X 0, current block template brightness value matrix is X 0Transposed matrix be X 0 T,
Definition former frame image and current block P 0The macro block that is in same position is reference block P S, in the former frame image with described reference block P SAdjacent L shaped neighborhood is reference block template X S, reference block P SThe brightness value matrix be P S, reference block template brightness value matrix is X S, reference block template brightness value matrix X STransposed matrix be X S T,
Step 1, with reference block template X SIn all pixels and reference block P SCorrelation normalization form a series of candidate's weight matrix B α:
B α = ( l α , 0 Σ i = 0 m - 1 l α , i , l α , 1 Σ i = 0 m - 1 l α , i , . . . , l α , m - 1 Σ i = 0 m - 1 l α , i )
Reference block template X SIn m pixel altogether, each pixel on the angle [alpha] direction to reference block P SCorrelation be expressed as l respectively α, 0, l α, 1..., l α, m-1, m is the natural number greater than 1,
Wherein, α is reference block template X SIn pixel can with reference block P SThe angle that intersects is the value of Discrete Change, and the Discrete Change amount of α is 5 °~20 °, 0 °≤α≤180 °,
Step 2, obtain reference block P SWeight matrix B=B j, wherein, parameter j is determined by following formula:
j = arg min α | P S - B α X S T E | ,
Step 3, according to B (X 0 T-X S T) E acquisition current block P 0With reference block P SBetween luminance difference, to current block P 0Carry out luminance compensation, wherein E is 1 complete 1 matrix for value, and its exponent number and reference block P SThe brightness value matrix be P SExponent number identical.
2. a kind of image brightness compensation method that is used for image encoding according to claim 1 is characterized in that current block P 0Carry out luminance compensation, compensation back current block P 0Brightness value matrix P 0For:
P 0=P S+B(X 0 T-X S T)E。
3. a kind of image brightness compensation method that is used for image encoding according to claim 1 is characterized in that, is divided into 10 °~18 ° mutually between adjacent two discrete points of angle [alpha].
4. a kind of image brightness compensation method that is used for image encoding according to claim 1 is characterized in that, is divided into 15 ° mutually between adjacent two discrete points of angle [alpha].
5. a kind of image brightness compensation method that is used for image encoding according to claim 1 is characterized in that, is divided into 18 ° mutually between adjacent two discrete points of angle [alpha].
CN 200910073397 2009-12-11 2009-12-11 Image brightness compensation method for image coding Expired - Fee Related CN101710985B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN 200910073397 CN101710985B (en) 2009-12-11 2009-12-11 Image brightness compensation method for image coding

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN 200910073397 CN101710985B (en) 2009-12-11 2009-12-11 Image brightness compensation method for image coding

Publications (2)

Publication Number Publication Date
CN101710985A true CN101710985A (en) 2010-05-19
CN101710985B CN101710985B (en) 2011-06-15

Family

ID=42403742

Family Applications (1)

Application Number Title Priority Date Filing Date
CN 200910073397 Expired - Fee Related CN101710985B (en) 2009-12-11 2009-12-11 Image brightness compensation method for image coding

Country Status (1)

Country Link
CN (1) CN101710985B (en)

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102355580A (en) * 2011-08-19 2012-02-15 上海国茂数字技术有限公司 Hexagonal transformation method and device applied to picture coding and video coding
WO2015139605A1 (en) * 2014-03-17 2015-09-24 Mediatek Inc. Method for low-latency illumination compensation process and depth lookup table based coding
WO2015139201A1 (en) * 2014-03-18 2015-09-24 Mediatek Singapore Pte. Ltd. Simplified illumination compensation in multi-view and 3d video coding
CN105335298A (en) * 2014-08-13 2016-02-17 Tcl集团股份有限公司 Storage method and device of luminance compensation numerical value of display panel
CN106548763A (en) * 2015-09-22 2017-03-29 中兴通讯股份有限公司 A kind of method for displaying image and device and terminal
WO2020155791A1 (en) * 2019-02-01 2020-08-06 华为技术有限公司 Inter-frame prediction method and device
CN111985220A (en) * 2020-07-30 2020-11-24 哈尔滨工业大学 End-to-end judicial literature automatic proofreading method based on deep learning
CN112950484A (en) * 2019-12-11 2021-06-11 鸣医(上海)生物科技有限公司 Method for removing color pollution of photographic image

Cited By (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102355580B (en) * 2011-08-19 2013-07-31 上海国茂数字技术有限公司 Hexagonal transformation method and device applied to picture coding and video coding
CN102355580A (en) * 2011-08-19 2012-02-15 上海国茂数字技术有限公司 Hexagonal transformation method and device applied to picture coding and video coding
CN106134191B (en) * 2014-03-17 2019-03-22 寰发股份有限公司 For the processing of low latency luminance compensation and the method for the coding based on depth look-up table
WO2015139605A1 (en) * 2014-03-17 2015-09-24 Mediatek Inc. Method for low-latency illumination compensation process and depth lookup table based coding
US10349083B2 (en) 2014-03-17 2019-07-09 Hfi Innovation Inc. Method for low-latency illumination compensation process and Depth Lookup Table based coding
CN106134191A (en) * 2014-03-17 2016-11-16 寰发股份有限公司 Process and the method for coding based on degree of depth look-up table for low latency luminance compensation
WO2015139201A1 (en) * 2014-03-18 2015-09-24 Mediatek Singapore Pte. Ltd. Simplified illumination compensation in multi-view and 3d video coding
CN105335298B (en) * 2014-08-13 2018-10-09 Tcl集团股份有限公司 A kind of storage method and device of the luminance compensation numerical value of display panel
CN105335298A (en) * 2014-08-13 2016-02-17 Tcl集团股份有限公司 Storage method and device of luminance compensation numerical value of display panel
WO2017049939A1 (en) * 2015-09-22 2017-03-30 中兴通讯股份有限公司 Picture display method, device, and terminal
CN106548763A (en) * 2015-09-22 2017-03-29 中兴通讯股份有限公司 A kind of method for displaying image and device and terminal
WO2020155791A1 (en) * 2019-02-01 2020-08-06 华为技术有限公司 Inter-frame prediction method and device
CN112950484A (en) * 2019-12-11 2021-06-11 鸣医(上海)生物科技有限公司 Method for removing color pollution of photographic image
CN112950484B (en) * 2019-12-11 2023-06-16 鸣医(上海)生物科技有限公司 Method for removing color pollution of photographic image
CN111985220A (en) * 2020-07-30 2020-11-24 哈尔滨工业大学 End-to-end judicial literature automatic proofreading method based on deep learning

Also Published As

Publication number Publication date
CN101710985B (en) 2011-06-15

Similar Documents

Publication Publication Date Title
CN101710985B (en) Image brightness compensation method for image coding
CN101729891B (en) Method for encoding multi-view depth video
CN100496121C (en) Image signal processing method of the interactive multi-view video system
CN101374242B (en) Depth map encoding compression method for 3DTV and FTV system
CN101895751B (en) Method and device for intra-frame prediction and intra-frame prediction-based encoding/decoding method and system
CN101404766B (en) Multi-view point video signal encoding method
CN104539962A (en) Layered video coding method fused with visual perception features
CN106105191A (en) For the method and apparatus processing multiview video signal
US9883200B2 (en) Method of acquiring neighboring disparity vectors for multi-texture and multi-depth video
CN102209243A (en) Depth map intra prediction method based on linear model
CN106170092A (en) Fast encoding method for lossless coding
CN106507116B (en) A kind of 3D-HEVC coding method predicted based on 3D conspicuousness information and View Synthesis
CN102801996B (en) Rapid depth map coding mode selection method based on JNDD (Just Noticeable Depth Difference) model
CN103327327B (en) For the inter prediction encoding unit selection method of high-performance video coding HEVC
CN103188496A (en) Fast motion estimation video encoding method based on motion vector distribution forecast
CN101309408A (en) Lightness block selection method of intra-frame prediction mode
CN104754359A (en) Depth map coding distortion forecasting method for two-dimensional free viewpoint video
CN103024381B (en) A kind of macro block mode fast selecting method based on proper discernable distortion
CN104704832A (en) Image processing method and apparatus for predicting motion vector and disparity vector
CN110446052A (en) The quick CU depth selection method of depth map in a kind of 3D-HEVC frame
CN106791768A (en) A kind of depth map frame per second method for improving that optimization is cut based on figure
CN103873867A (en) Free viewpoint video depth map distortion prediction method and free viewpoint video depth map coding method
CN103609114B (en) Code device, decoding apparatus, coding/decoding system, coded method and coding/decoding method
CN101902642B (en) Quick decision method for H.264 interframe SKIP modes
CN107509074B (en) Self-adaptive 3D video compression coding and decoding method based on compressed sensing

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
C17 Cessation of patent right
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20110615

Termination date: 20131211