[go: up one dir, main page]
More Web Proxy on the site http://driver.im/

CN100568913C - Edge crispening color interpolation method based on gradient - Google Patents

Edge crispening color interpolation method based on gradient Download PDF

Info

Publication number
CN100568913C
CN100568913C CNB2006101240671A CN200610124067A CN100568913C CN 100568913 C CN100568913 C CN 100568913C CN B2006101240671 A CNB2006101240671 A CN B2006101240671A CN 200610124067 A CN200610124067 A CN 200610124067A CN 100568913 C CN100568913 C CN 100568913C
Authority
CN
China
Prior art keywords
gradient
component
edge
interpolation
threshold value
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CNB2006101240671A
Other languages
Chinese (zh)
Other versions
CN101197916A (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.)
Guangzhou Ankai Microelectronics Co.,Ltd.
Original Assignee
ANKAI (GUANGZHOU) SOFTWARE TECHN Co Ltd
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 ANKAI (GUANGZHOU) SOFTWARE TECHN Co Ltd filed Critical ANKAI (GUANGZHOU) SOFTWARE TECHN Co Ltd
Priority to CNB2006101240671A priority Critical patent/CN100568913C/en
Publication of CN101197916A publication Critical patent/CN101197916A/en
Application granted granted Critical
Publication of CN100568913C publication Critical patent/CN100568913C/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Landscapes

  • Image Processing (AREA)
  • Facsimile Image Signal Circuits (AREA)
  • Color Image Communication Systems (AREA)

Abstract

The invention discloses a kind of edge crispening color interpolation method based on gradient, may further comprise the steps: (1) sets Grads threshold, makes its span be [0,255]; (2) all damaged green components are carried out interpolation: obtain to want the level and the vertical gradient of interpolation point correspondence position, obtain green component if the both greater than step (1) threshold value, then strengthens by the edge; (3) be that non-green component carries out the respective color interpolation to current point: obtain out current point two diagonal gradients, obtain respective component if the both greater than step (1) threshold value, then strengthens by the edge; (4) be that green component carries out red and blue component interpolation to current point: obtain out the level and the vertical gradient of current some correspondence position, obtain respective component if the both greater than step (1) threshold value, then strengthens by the edge.Adopt the method for the invention can eliminate the edge noise that color interpolation brings, can increase the edge sharpening effect again.

Description

Edge crispening color interpolation method based on gradient
Technical field
The present invention relates to a kind of color interpolation method, particularly a kind of edge crispening color interpolation method based on gradient.
Background technology
In existing various imaging devices, the overwhelming majority adopts the CFA imageing sensor.Each sensitive component in such CCD or the cmos sensor can only be gathered a certain components of pixel color, and in the whole sensor dot matrix, each point has only a photoreceptor, that is to say for each pixel to collect a color component, and other two components will be lost.Therefore, two components that must provide a kind of method to refill to lose make each output pixel all have redness (R), green (G), blue (B) component output.
At present, a kind of fairly simple method is arranged, the mean value of respective color component calculates current damaged component around promptly adopting.
As shown in Figure 1, calculate green and the blue component lost the R33 position, adopt 5 * 5 zone calculating, then computing formula is:
G 33 = G 12 + G 14 + G 21 + G 23 + G 25 + G 32 + G 34 + G 41 + G 43 + G 45 + G 52 + G 54 12 (1)
B 33 = B 22 + B 24 + B 42 + B 44 4
For the entire image data, adopt corresponding method to calculate all damaged data.
Adopt this method,, will cause image to produce serious edge noise, be unfavorable for subsequent treatment dateout because the value of the value of fringe region and non-fringe region interacts.
And another improved bilinear interpolation (Bilinear Interpolation) method then is to adopt gradient to judge the color component that comes adaptometer damaged.
To at red component location of pixels interpolation green component, the formula below adopting calculates:
g ^ ( i , j ) = g ^ B ( i , j ) + αΔ R ( i , j ) - - - ( 2 )
α is the correction coefficient of current gradient, Be the mean value of the green component around the current location, Δ R(i, j) be r (formula calculates below adopting for i, the j) Grad of present position:
Figure C20061012406700063
(m,n)={(0,-2),(0,2),(-2,0),(2,0)}
g ^ B ( i , j ) = 1 4 Σg ( i + m , j + n ) - - - ( 4 )
(m,n)={(0,-1),(0,1),(-1,0),(1,0)}
To at blue component location of pixels interpolation green component, adopt said method too.
To at green component location of pixels interpolation red component, adopt following method:
r ^ ( i , j ) = r ^ B ( i , j ) + βΔ G ( i , j ) - - - ( 5 )
Δ G(i j) adopts (3) calculating by formula of nine points, sees Fig. 2.
To at blue component location of pixels interpolation red component, adopt following method:
r ^ ( i , j ) = r ^ B ( i , j ) + γΔ B ( i , j ) - - - ( 6 )
Δ as shown in Figure 2 B(i j) adopts (3) calculating by formula of five points.
And, calculate (see figure 2) according to calculating damaged red component for calculating damaged blue component.
And for the choosing of α, β, three coefficients of γ, then be before the computing with handle after the mean square deviation (Mean Square Error (MSE)) of two width of cloth images.Making α, β, the γ value of MSE minimum is optimum value.Having provided one group of optimum value in the method is α=1/2, β=5/8, γ=3/4.Bring above-mentioned parameter into above-mentioned formula, be converted to the matrix form (see figure 2), the design factor of this color component of numeral in the color block.
Though this method has reduced the value of fringe region and the interactional influence of value of non-fringe region, has reduced edge noise.But owing to adopt the mode that compares MSE to calculate α, β, three coefficients of γ, the picture after feasible the processing is near original image, so also do not play the effect of edge sharpening.
Summary of the invention
The objective of the invention is to provide a kind of and can eliminate the edge noise that color interpolation brings, can increase the edge crispening color interpolation method based on gradient of edge sharpening effect again.
To achieve these goals, a kind of edge crispening color interpolation method based on gradient provided by the invention may further comprise the steps:
(1), set Grads threshold, make its span be [0,255];
(2), all damaged green components are carried out interpolation: obtain to want the level and the vertical gradient of interpolation point correspondence position, if two gradients all greater than step (1) threshold value, then strengthen obtaining damaged green component by the edge; If at least one Grad is then pressed corresponding mean value method interpolation less than threshold value;
(3), be that non-green component carries out the respective color interpolation to current point: obtain two diagonal gradients of current some correspondence position, if two gradients all greater than step (1) threshold value, then strengthen obtaining respective component by the edge; If at least one Grad is then pressed corresponding mean value method interpolation less than threshold value;
(4), be that green component carries out redness and blue component interpolation to current point: obtain the level and the vertical gradient of current some correspondence position, if two gradients all greater than step (1) threshold value, then strengthen obtaining respective component by the edge; If at least one Grad is then pressed corresponding mean value method interpolation less than threshold value.
Step of the present invention (2) is if two gradients all less than threshold value, then adopt two gradient counterparties to obtain damaged green component to mean value; If have only a gradient less than threshold value, then adopt the little gradient counterparty of relative value to mean value obtain damaged green component.
Step of the present invention (2) strengthens by the edge and obtains damaged green component and be: according to the magnitude relationship of level and vertical gradient respectively by horizontal gradient greater than, be equal to or less than three kinds of situations of vertical gradient and obtain green component.
At least one Grad of step of the present invention (3) is less than under the threshold value situation, adopt the little counterparty of gradient institute of relative value to mean value obtain its color component.
Step of the present invention (3) if two gradients all greater than threshold value, are obtained the color component process by the edge enhancing is:
C ( i , j ) = C ( i - 1 , j - 1 ) - G ( i - 1 , j - 1 ) + C ( i - 1 , j + 1 ) - G ( i - 1 , j + 1 ) 4
+ C ( i + 1 , j - 1 ) - G ( i + 1 , j - 1 ) + C ( i + 1 , j + 1 ) - G ( i + 1 , j + 1 ) 4 + G ( i , j )
Wherein, and C (i j) represents current i, the primitive color component of j position, and (i j) represents current i, the green component of j position to G.
At least one Grad of step of the present invention (4) is less than under the threshold value situation, the counterparty of gradient institute that wherein relative value is little to color component obtain with its direction mean value, another color component is then used to strengthen by its edge and is obtained.
Step of the present invention (4) if two gradients all greater than threshold value, are obtained the color component process by the edge enhancing is:
B ( i , j - 1 ) = ( C ( i , j - 2 ) - G ( i , j - 2 ) ) + ( C ( i , j ) - G ( i , j ) ) 2 + C ( i , j - 1 )
R ( i , j - 1 ) = C ( i - 1 , j - 1 ) - G ( i - 1 , j - 1 ) + C ( i + 1 , j - 1 ) - G ( i + 1 , j - 1 ) 2 + C ( i , j - 1 )
Wherein, B (i, j), R (i, j) and G (i j) represents current i respectively, the blueness of j position, redness and green component, (i j) represents current i to C, the primitive color component of j position.
The present invention calculates the gradient of four direction by utilizing existing color component value, and compares with the Grads threshold that sets in advance, judges whether current location is in the edge.If be in the edge, then the gradient of the four direction by current location relation is carried out respective edges and is strengthened, and can not introduce noise; Otherwise, then adopt the method for average color interpolation to carry out interpolation, help removing the power supply noise of the transducer generation of non-border district in the image.
Description of drawings
Fig. 1 is 5 * 5 pattern diagram in the interpolation of average value method;
Fig. 2 is the bilinear interpolation schematic diagram;
Fig. 3 is an interpolation method schematic flow sheet of the present invention;
Fig. 4 is that the present invention is to damaged green component interpolation schematic flow sheet;
Fig. 5 is the schematic flow sheet that non-green component carries out the respective color interpolation for the present invention to current point.
Embodiment
Adopt to judge among the present invention that vertical, level and positive and negative diagonal four direction judge the gradient direction of current pixel position.Set Grads threshold Thre, same excessively relatively greatest gradient value of four direction and the magnitude relationship of Thre judge whether current point is boundary point, carrying out the edge thus strengthens, stipulate that in the present invention the Thre span is [0,255], when the Grad of current location during greater than Thre, can determine that then current location is in marginal position, carry out the edge by corresponding calculated and strengthen.
As shown in Figure 3, the present invention mainly may further comprise the steps:
(1), set Grads threshold, make its span be [0,255];
(2), as shown in Figure 4, all damaged green components are carried out interpolation: obtain to want the level and the vertical gradient of interpolation point correspondence position, if at least one Grad is then pressed corresponding mean value method interpolation less than step (1) threshold value.Wherein, if two gradients all less than threshold value, then adopt two gradient counterparties to obtain damaged green component to mean value; If have only a gradient less than threshold value, then adopt the little gradient counterparty of relative value to mean value obtain damaged green component.And when two gradients all greater than threshold value, then according to the magnitude relationship of level and vertical gradient respectively by horizontal gradient greater than, be equal to or less than three kinds of situations of vertical gradient, strengthen obtaining damaged green component successively by the edge:
As HG>VG
G ( i , j ) = C ( i - 1 , j ) + C ( i + 1 , j ) 2 + 2 × C ( i , j ) - C ( i + 2 , j ) - C ( i - 2 , j ) 4
As HG<VG
G ( i , j ) = C ( i , j - 1 ) + C ( i , j + 1 ) 2 + 2 × C ( i , j ) - C ( i , j + 2 ) - C ( i , j - 2 ) 4
Work as HG=VG
G ( i , j ) = C ( i - 1 , j ) + C ( i + 1 , j ) + C ( i , j - 1 ) + C ( i , j + 1 ) 4
+ 2 × C ( i , j ) - C ( i + 2 , j ) - C ( i - 2 , j ) + 2 × C ( i , j ) - C ( i , j + 2 ) - C ( i , j - 2 ) 8
Wherein, and G (i, j) current i, the green component of j position, C (i j) represents current i, the primitive color component of j position, and HG and VG represent level and vertical gradient respectively.
(3), as shown in Figure 5, to current point is that non-green component carries out the respective color interpolation: the two diagonal gradients that obtain current some correspondence position, if at least one Grad is less than step (1) threshold value, then adopt the little counterparty of gradient institute of relative value to mean value obtain its color component:
Work as NEG=minG, adopt the value on the 45 degree directions to calculate its color component,
Work as NWG=minG, adopt the value on-45 degree directions to calculate its color component (minG is the minimum value of two diagonal gradient NEG, NWG); If two gradients all greater than threshold value, then strengthen obtaining respective component by the edge:
C ( i , j ) = C ( i - 1 , j - 1 ) - G ( i - 1 , j - 1 ) + C ( i - 1 , j + 1 ) - G ( i - 1 , j + 1 ) 4
+ C ( i + 1 , j - 1 ) - G ( i + 1 , j - 1 ) + C ( i + 1 , j + 1 ) - G ( i + 1 , j + 1 ) 4 + G ( i , j )
Wherein, (i j) represents current i to C, the primitive color component of j position, G (i, j) current i, the green component of j position.
(4), be that green component carries out redness and blue component interpolation: the level and the vertical gradient that obtain current some correspondence position to current point, if at least one Grad less than step (1) the threshold value counterparty of gradient institute that then wherein relative value is little to color component obtain with its direction mean value, another color component is then used to strengthen by its edge and is obtained:
minG=min(HG,VG)
When minG<Thre:
B ( i , j - 1 ) = C ( i , j - 2 ) + C ( i , j ) 2 R ( i , j - 1 ) = C ( i - 1 , j - 1 ) - G ( i - 1 , j - 1 ) + C ( i + 1 , j - 1 ) 2 + C ( i , j - 1 ) minG=HG
B ( i , j - 1 ) = ( C ( i , j - 2 ) - G ( i , j - 2 ) ) + ( C ( i , j ) - G ( i , j ) ) 2 + C ( i , j - 1 ) R ( i , j - 1 ) = C ( i - 1 , j - 1 ) + C ( i + 1 , j - 2 ) 2 Other
Wherein, HG and VG are respectively level and vertical gradient, and Thre is a threshold value.
If two gradients all greater than step (1) threshold value, then strengthen obtaining respective component by the edge:
B ( i , j - 1 ) = ( C ( i , j - 2 ) - G ( i , j - 2 ) ) + ( C ( i , j ) - G ( i , j ) ) 2 + C ( i , j - 1 )
R ( i , j - 1 ) = C ( i - 1 , j - 1 ) - G ( i - 1 , j - 1 ) + C ( i + 1 , j - 1 ) - G ( i + 1 , j - 1 ) 2 + C ( i , j - 1 )
Wherein, and B (i, j) current i, the blue component of j position, R (i, j) current i, the red component of j position, (i j) represents current i to C, the primitive color component of j position.
Wherein, level, vertical and two diagonal gradient calculation are followed successively by:
HG=|2×C(i,j)-C(i,j-2)-C(i,j+2)|+|C(i,j+1)-C(i,j-1)|
VG=|2×C(i,j)-C(i+2,j)-C(i-2,j)|+|C(i+1,j)-C(i-1,j)|
NEG=|2×C(i,j)-C(i+2,j-2)-C(i-2,j+2)|+|C(i+1,j-1)-C(i-1,j+1)|
NWG=|2×C(i,j)-C(i+2,j+2)-C(i-2,j-2)|+|C(i+1,j+1)-C(i-1,j-1)|
Following example be detailed process by implementation process, be example with the B44 position among Fig. 1, at first calculate the green component values G44 of blue component position, its step is as follows:
(1) horizontal gradient (HG) and vertical gradient (VG) of calculating correspondence position.
HG=|2×B44-B42-B46|+|G45-G43|
VG=|2×B44-B64-B24|+|G54-G34|
(2), calculate current green component according to gradient magnitude.
(a) if HG<Thre and VG<Thre set up simultaneously;
G 44 = G 43 + G 34 + G 45 + G 54 4
(b) if HG<Thre sets up;
G 44 = G 43 + G 45 2
(c) if VG<Thre sets up;
G 44 = G 34 + G 54 2
(d) other but do not belong to above-mentioned three kinds of conditions;
G 44 = G 34 + G 54 2 + 2 × B 44 - B 64 - B 24 4 As HG>VG
G 44 = G 43 + G 45 2 + 2 × B 44 - B 42 - B 46 4 As HG<VG
G 44 = G 34 + G 54 + G 43 + G 45 4 + 2 × B 44 - B 64 - B 24 + 2 * B 44 - B 42 - B 46 8 Work as HG==VG
Wherein, adopt to use the same method and to calculate the green component values of red component position.
Then, calculate the red color component value of blue component position.Calculate R44, the value of the G44 that needs use previous step calculates, its step is as follows:
(1) calculates cornerwise gradient NEG, NWG and minimum value minG.
NEG=|2×B44-B62-B26|+|R53-R35|
NWG=|2×B44-B66-B22|+|R55-R33|
min?G=min(NEG,NWG)
(2), calculate the value of R44 according to gradient magnitude.
(a) if minG<Thre sets up;
R 44 = R 53 + R 35 2 Work as minG==NEG
R 44 = R 33 + R 55 2 Other
(b) other but do not belong to above-mentioned condition.
R 44 = ( R 33 - G 33 ) + ( R 35 - G 35 ) + ( R 53 - G 53 ) + ( R 55 - G 55 ) 4 + G 44
Wherein, the blue component value that adopting uses the same method can calculate the red component position is such as B33.
At last, calculate damaged red component and the blue component in green component position.With G43 is example, calculates B43 and R43, and its step is as follows:
(1) the gradient VG of the gradient HG of calculated level direction, vertical direction and minimum value minG.
HG=|2×G43-G41-G45|+|B44-B42|
VG=|2×G43-G23-G63|+|R53-R33|
minG=min(HG,VG)
(2) calculate corresponding value according to gradient magnitude.
(a) if minG<Thre sets up;
When minG==HG:
B 43 = B 42 + B 44 2
R 43 = ( R 33 - G 33 ) + ( R 53 - G 53 ) 2 + G 43
Other:
B 43 = ( B 42 - G 42 ) + ( B 44 - G 44 ) 2 + G 43
R 43 = R 33 + R 53 2
(b) other but do not belong to above-mentioned condition.
B 43 = ( B 42 - G 42 ) + ( B 44 - G 44 ) 2 + G 43 ;
R 43 = ( R 33 - G 33 ) + ( R 53 - G 53 ) 2 + G 43

Claims (7)

1, a kind of edge crispening color interpolation method based on gradient is characterized in that may further comprise the steps:
(1), set Grads threshold, make its span be [0,255];
(2), all damaged green components are carried out interpolation: obtain to want the level and the vertical gradient of interpolation point correspondence position, if two gradients all greater than step (1) threshold value, then strengthen obtaining damaged green component by the edge; If at least one gradient is then pressed corresponding mean value method interpolation less than threshold value;
(3), the current point to non-green component carries out the respective color interpolation: obtain two diagonal gradients of current some correspondence position, if two gradients all greater than step (1) threshold value, then strengthen obtaining respective component by the edge; If at least one gradient is then pressed corresponding mean value method interpolation less than threshold value;
(4), the current point to green component carries out redness and blue component interpolation: obtain the level and the vertical gradient of current some correspondence position, if two gradients all greater than step (1) threshold value, then strengthen obtaining respective component by the edge; If at least one gradient is then pressed corresponding mean value method interpolation less than threshold value.
2, edge crispening color interpolation method according to claim 1 is characterized in that: described step (2) is if two gradients all less than threshold value, then adopt two gradient counterparties to obtain damaged green component to mean value; If have only a gradient less than threshold value, then adopt the little gradient counterparty of relative value to mean value obtain damaged green component.
3, edge crispening color interpolation method according to claim 1 is characterized in that: described step (2) strengthens by the edge and obtains damaged green component and be: according to the magnitude relationship of level and vertical gradient respectively by horizontal gradient greater than, be equal to or less than three kinds of situations of vertical gradient and obtain green component.
4, edge crispening color interpolation method according to claim 1 is characterized in that: at least one gradient of described step (3) is less than under the threshold value situation, adopt the little counterparty of gradient institute of relative value to mean value obtain its respective component.
5, edge crispening color interpolation method according to claim 1 is characterized in that: described step (3) if two gradients all greater than threshold value, are obtained the respective component process by the edge enhancing is:
C ( i , j ) = C ( i - 1 , j - 1 ) - G ( i - 1 , j - 1 ) + C ( i - 1 , j + 1 ) - G ( i - 1 , j + 1 ) 4
+ C ( i + 1 , j - 1 ) - G ( i + 1 , j - 1 ) + C ( i + 1 , j + 1 ) - G ( i + 1 , j + 1 ) 4 + G ( i , j )
Wherein, and C (i j) represents current i, the primitive color component of j position, and (i j) represents current i, the green component of j position to G.
6, edge crispening color interpolation method according to claim 1 is characterized in that: described step (4) if two gradients all greater than threshold value, are obtained the respective component process by the edge enhancing is:
B ( i , j - 1 ) = ( C ( i , j - 2 ) - G ( i , j - 2 ) ) + ( C ( i , j ) - G ( i , j ) ) 2 + C ( i , j - 1 )
R ( i , j - 1 ) = C ( i - 1 , j - 1 ) - G ( i - 1 , j - 1 ) + C ( i + 1 , j - 1 ) - G ( i + 1 , j - 1 ) 2 + C ( i , j - 1 )
Wherein, and B (i j) represents current i, the blue component of j position, R (i j) represents current i, the red component of j position, G (i j) represents current i, the green component of j position, and (i j) represents current i to C, the primitive color component of j position.
7, a kind of edge crispening color interpolation method based on gradient is characterized in that may further comprise the steps:
(1), set Grads threshold, make its span be [0,255];
(2), all damaged green components are carried out interpolation: obtain to want the level and the vertical gradient of interpolation point correspondence position, if two gradients all greater than step (1) threshold value, then strengthen obtaining damaged green component by the edge; If at least one gradient is then pressed corresponding mean value method interpolation less than threshold value;
(3), the current point to non-green component carries out the respective color interpolation: obtain two diagonal gradients of current some correspondence position, if two gradients all greater than step (1) threshold value, then strengthen obtaining respective component by the edge; If at least one gradient is then pressed corresponding mean value method interpolation less than threshold value;
(4), the current point to green component carries out redness and blue component interpolation: obtain the level and the vertical gradient of current some correspondence position, if two gradients all greater than step (1) threshold value, then strengthen obtaining respective component by the edge; At least one gradient is less than under the threshold value situation, the counterparty of gradient institute that wherein relative value is little to color component obtain with its direction mean value, another color component then strengthens with the edge and obtains.
CNB2006101240671A 2006-12-05 2006-12-05 Edge crispening color interpolation method based on gradient Active CN100568913C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNB2006101240671A CN100568913C (en) 2006-12-05 2006-12-05 Edge crispening color interpolation method based on gradient

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB2006101240671A CN100568913C (en) 2006-12-05 2006-12-05 Edge crispening color interpolation method based on gradient

Publications (2)

Publication Number Publication Date
CN101197916A CN101197916A (en) 2008-06-11
CN100568913C true CN100568913C (en) 2009-12-09

Family

ID=39548041

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB2006101240671A Active CN100568913C (en) 2006-12-05 2006-12-05 Edge crispening color interpolation method based on gradient

Country Status (1)

Country Link
CN (1) CN100568913C (en)

Families Citing this family (9)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102316280B (en) * 2010-06-30 2013-09-04 格科微电子(上海)有限公司 Image sensor and method for eliminating power supply noises of image sensor
CN102413271B (en) * 2011-11-21 2013-11-13 晶门科技(深圳)有限公司 Image processing method and device for eliminating false contour
CN102938843B (en) 2012-11-22 2014-12-03 华为技术有限公司 Image processing method, image processing device and imaging device
CN104346778B (en) * 2013-07-30 2017-08-22 比亚迪股份有限公司 The edge enhancing method and device and digital camera equipment of image
CN105577981A (en) * 2015-12-22 2016-05-11 深圳大学 Edge self-adaptive color restoration method and system
CN107517367B (en) * 2017-07-28 2019-11-01 建荣半导体(深圳)有限公司 Baeyer area image interpolation method, device, picture processing chip and storage device
TWI664605B (en) 2018-08-16 2019-07-01 瑞昱半導體股份有限公司 Color reconstruction device and method
CN110858894B (en) * 2018-08-23 2021-11-26 瑞昱半导体股份有限公司 Color reconstruction device and method
CN114529459B (en) * 2022-04-25 2022-08-02 东莞市兆丰精密仪器有限公司 Method, system and medium for enhancing image edge

Also Published As

Publication number Publication date
CN101197916A (en) 2008-06-11

Similar Documents

Publication Publication Date Title
CN100568913C (en) Edge crispening color interpolation method based on gradient
CN102509294B (en) Single-image-based global depth estimation method
CN102063706B (en) Rapid defogging method
CN107578392B (en) Convolution neural network demosaicing method based on residual interpolation
TWI516132B (en) An image processing apparatus, an image processing method, and a program
CN102222326B (en) Method and device for deblurring images based on single low resolution
CN103632362B (en) Images match processing method, apparatus and system
US8040558B2 (en) Apparatus and method for shift invariant differential (SID) image data interpolation in fully populated shift invariant matrix
CN103595980B (en) Based on the color filter array image demosaicing method of outline non-local mean value
CN103327220B (en) With green channel for the denoising method guided on low-light (level) Bayer image
CN104537625A (en) Bayer color image interpolation method based on direction flag bit
CN103347190B (en) Edge-related and color-combined demosaicing and amplifying method
CN108734668B (en) Image color recovery method and device, computer readable storage medium and terminal
JP4863505B2 (en) Image processing device
US20110142363A1 (en) Image correction apparatus and image correction method
CN107590791A (en) Image enchancing method and image processing apparatus
CN107342037A (en) Data method for transformation, device and computer-readable recording medium
CN107833186A (en) A kind of simple lens spatial variations image recovery method based on Encoder Decoder deep learning models
CN103491280B (en) A kind of bayer images associating denoising interpolation method
US20070247530A1 (en) Interpolation Method for Captured Color Image Data
CN104657941A (en) Image edge self-adaptive enhancing method and device
CN108024100A (en) Based on the Bayer format image interpolation method for improving edge guiding
CN101639932A (en) Method and system for enhancing digital image resolution
US20080062479A1 (en) Heterogeneity-projection hard-decision interpolation method for color reproduction
CN107622477A (en) A kind of RGBW images joint demosaicing and deblurring method

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
C56 Change in the name or address of the patentee

Owner name: ANYKA (GUANGZHOU) MICROELECTRONICS TECHNOLOGY CO.,

Free format text: FORMER NAME: ANYKA( GUANGZHOU ) SOFTWARE TECHNOLOGY CO., LTD.

CP03 Change of name, title or address

Address after: No. 182, science Avenue, Science Town, Guangzhou hi tech Industrial Development Zone, Guangdong 301-303, 401-402, C1

Patentee after: Anyka (Guangzhou) Microelectronics Technology Co., Ltd.

Address before: Guangdong city of Guangzhou province science and Technology Park Tianhe Software Park in Gaotang New District No. 1033 building 6 high way

Patentee before: Ankai (Guangzhou) Software Techn Co., Ltd.

CP01 Change in the name or title of a patent holder
CP01 Change in the name or title of a patent holder

Address after: 510663 301-303, 401-402, area C1, 182 science Avenue, Science City, Guangzhou high tech Industrial Development Zone, Guangdong Province

Patentee after: Guangzhou Ankai Microelectronics Co.,Ltd.

Address before: 510663 301-303, 401-402, area C1, 182 science Avenue, Science City, Guangzhou high tech Industrial Development Zone, Guangdong Province

Patentee before: ANYKA (GUANGZHOU) MICROELECTRONICS TECHNOLOGY Co.,Ltd.

CP02 Change in the address of a patent holder
CP02 Change in the address of a patent holder

Address after: 510555 No. 107 Bowen Road, Huangpu District, Guangzhou, Guangdong

Patentee after: Guangzhou Ankai Microelectronics Co.,Ltd.

Address before: 510663 301-303, 401-402, area C1, 182 science Avenue, Science City, Guangzhou high tech Industrial Development Zone, Guangdong Province

Patentee before: Guangzhou Ankai Microelectronics Co.,Ltd.