Bayer轉(zhuǎn)換算法

1、Bayer轉(zhuǎn)換算法轉(zhuǎn)/* raw.h */#ifndef _RAW_H_ #define _RAW_H_ #define GP_OK 1 typedef enum BAYER_TILE_RGGB = 0, BAYER_TILE_GRBG = 1, BAYER_TILE_BGGR = 2, BAYER_TILE_GBRG = 3, BAYER_TILE_RGGB_INTERLACED = 4, BAYER_TILE_GRBG_INTERLACED = 5, BAYER_TILE_BGGR_INTERLACED = 6, BAYER_TILE_GBRG_INTERLACED = 7, BayerT

2、ile; int gp_bayer_expand (unsigned char *input, int w, int h, unsigned char *output, BayerTile tile); int gp_bayer_decode (unsigned char *input, int w, int h, unsigned char *output, BayerTile tile); int gp_bayer_interpolate (unsigned char *image, int w, int h, BayerTile tile); #endif /* raw.c */#inc

3、lude raw.h static const int tile_colours84 = 0, 1, 1, 2, 1, 0, 2, 1, 2, 1, 1, 0, 1, 2, 0, 1, 0, 1, 1, 2, 1, 0, 2, 1, 2, 1, 1, 0, 1, 2, 0, 1; #define RED 0 #define GREEN 1 #define BLUE 2 static int gp_bayer_accrue (unsigned char *image, int w, int h, int x0, int y0, int x1, int y1, int x2, int y2, in

4、t x3, int y3, int colour); int gp_bayer_expand (unsigned char *input, int w, int h, unsigned char *output, BayerTile tile) int x, y, i; int colour, bayer; unsigned char *ptr = input; switch (tile) case BAYER_TILE_RGGB: case BAYER_TILE_GRBG: case BAYER_TILE_BGGR: case BAYER_TILE_GBRG: for (y = 0; y h

5、; +y) for (x = 0; x w; +x, +ptr) bayer = (x&1?0:1) + (y&1?0:2); colour = tile_colourstilebayer; i = (y * w + x) * 3; outputi+RED = 0; outputi+GREEN = 0; outputi+BLUE = 0; outputi+colour = *ptr; break; case BAYER_TILE_RGGB_INTERLACED: case BAYER_TILE_GRBG_INTERLACED: case BAYER_TILE_BGGR_INTERLACED:

6、case BAYER_TILE_GBRG_INTERLACED: for (y = 0; y h; +y, ptr+=w) for (x = 0; x 1:ptr(w1)+(x1); break; return (GP_OK); #define AD(x, y, w) (y)*(w)*3+3*(x) int gp_bayer_interpolate (unsigned char *image, int w, int h, BayerTile tile) int x, y, bayer; int p0, p1, p2, p3; int value, div ; switch (tile) def

7、ault: case BAYER_TILE_RGGB: case BAYER_TILE_RGGB_INTERLACED: p0 = 0; p1 = 1; p2 = 2; p3 = 3; break; case BAYER_TILE_GRBG: case BAYER_TILE_GRBG_INTERLACED: p0 = 1; p1 = 0; p2 = 3; p3 = 2; break; case BAYER_TILE_BGGR: case BAYER_TILE_BGGR_INTERLACED: p0 = 3; p1 = 2; p2 = 1; p3 = 0; break; case BAYER_T

8、ILE_GBRG: case BAYER_TILE_GBRG_INTERLACED: p0 = 2; p1 = 3; p2 = 0; p3 = 1; break; for (y = 0; y h; y+) for (x = 0; x w; x+) bayer = (x&1?0:1) + (y&1?0:2); if ( bayer = p0 ) /* red. green lrtb, blue diagonals */ imageAD(x,y,w)+GREEN = gp_bayer_accrue(image, w, h, x-1, y, x+1, y, x, y-1, x, y+1, GREEN

9、) ; imageAD(x,y,w)+BLUE = gp_bayer_accrue(image, w, h, x+1, y+1, x-1, y-1, x-1, y+1, x+1, y-1, BLUE) ; else if (bayer = p1) /* green. red lr, blue tb */ div = value = 0; if (x (w - 1) value += imageAD(x+1,y,w)+RED; div+; if (x) value += imageAD(x-1,y,w)+RED; div+; imageAD(x,y,w)+RED = value / div; d

10、iv = value = 0; if (y (h - 1) value += imageAD(x,y+1,w)+BLUE; div+; if (y) value += imageAD(x,y-1,w)+BLUE; div+; imageAD(x,y,w)+BLUE = value / div; else if ( bayer = p2 ) /* green. blue lr, red tb */ div = value = 0; if (x (w - 1) value += imageAD(x+1,y,w)+BLUE; div+; if (x) value += imageAD(x-1,y,w

11、)+BLUE; div+; imageAD(x,y,w)+BLUE = value / div; div = value = 0; if (y (h - 1) value += imageAD(x,y+1,w)+RED; div+; if (y) value += imageAD(x,y-1,w)+RED; div+; imageAD(x,y,w)+RED = value / div; else /* blue. green lrtb, red diagonals */ imageAD(x,y,w)+GREEN = gp_bayer_accrue (image, w, h, x-1, y, x

12、+1, y, x, y-1, x, y+1, GREEN) ; imageAD(x,y,w)+RED = gp_bayer_accrue (image, w, h, x+1, y+1, x-1, y-1, x-1, y+1, x+1, y-1, RED) ; return (GP_OK); static int gp_bayer_accrue (unsigned char *image, int w, int h, int x0, int y0, int x1, int y1, int x2, int y2, int x3, int y3, int colour) int x 4 ; int

13、y 4 ; int value 4 ; int above 4 ; int counter ; int sum_of_values; int average ; int i ; x0 = x0 ; x1 = x1 ; x2 = x2 ; x3 = x3 ; y0 = y0 ; y1 = y1 ; y2 = y2 ; y3 = y3 ; counter = sum_of_values = 0 ; if(colour = GREEN) for (i = 0 ; i = 0) & (xi = 0) & (yi 2*vdiff) return (value 3 + value 2)/2 ; if(vd

14、iff 2*hdiff) return (value 1 + value 0)/2 ; /* for blue and red */ counter = sum_of_values = 0 ; for (i = 0 ; i = 0) & (xi = 0) & (yi h) value i = imageAD(xi,yi,w) + colour ; sum_of_values += value i ; counter+ ; average = sum_of_values / counter ; if (counter 4) return average ; /* Less than four s

15、urrounding - just take average */ counter = 0 ; for (i = 0 ; i average ; if (abovei) counter+ ; /* Note: counter = 0 indicates all values the same */ if (counter = 2) | (counter = 0) return average ; sum_of_values = 0 ; for (i = 0 ; i 4 ; i+) if (counter = 3) = abovei) sum_of_values += valuei ; retu

16、rn sum_of_values / 3 ; int gp_bayer_decode (unsigned char *input, int w, int h, unsigned char *output, BayerTile tile) gp_bayer_expand (input, w, h, output, tile); gp_bayer_interpolate (output, w, h, tile); return (GP_OK); Bayer圖像處理Bayer是相機內(nèi)部的原始圖片, 一般后綴名為.raw. 很多軟件都可以查看, 比如PS.我們相機拍照下來存儲在存儲卡上的.jpeg或其

17、它格式的圖片, 都是從.raw格式轉(zhuǎn)化過來的. .raw格式內(nèi)部的存儲方式有多種, 但不管如何, 都是前兩行的排列不同. 其格式可能如下:G R G R G R G RB G B G B G B GG R G R G R G RB G B G B G B G橫為2的倍數(shù), 豎為4的倍數(shù), 它們構(gòu)成了分辨率. 如, 上面則代表了 8 * 4 分辨率的Bayer圖.我們要知道的是, G = 2 * R 及 G = 2 * B, 即綠色值為紅色值或藍(lán)色值的兩倍, 因為人眼對綠色更敏感, 所以綠色的分量更重.下面說一下從bayer轉(zhuǎn)換成rgb圖的算法, RGB圖, 即為三色圖, 一個像素點就由RGB三

18、種顏色構(gòu)成的混合色, 而bayer圖一個像素就只有一個顏色, 或R或G或B. 因為bayer一個像素點只有一種顏色, 需要借助這個像素點周圍的顏色對它進(jìn)行插值(填充)另外的兩種顏色, 它本身的顏色就不用插了. 一般的算法是:對于插入R和B, Rx = ( R1 + R2 ) / 2; 或-取上邊和下邊的平均值, 或是左邊和右邊的平均值Rx = ( R1 + R2 + R3 + R4 ) / 4;-取四個邊的平均值B同理. 如:G B GR G RG B G對于中間的G, 它缺少 R和B, 用上下和左右的平均值進(jìn)行求值.對于B G BG R GB G B這個圖呢, 中間點R, 缺少G和B, G暫時沒討論, 那么 B, 就是從R的四個B角進(jìn)行求平均值.=如果插入G, 稍有些復(fù)雜.不過一般的算法與R和B一樣, 復(fù)雜的算法, 其復(fù)雜程度也提升一倍, 不過精度更高, 如果對于視頻監(jiān)測系統(tǒng)來說, 精度相對來說不必要求太高, 用R或B的解法即可. 下面說復(fù)雜的:對于圖:R1G1R4 G4 R G2 R2G3R3對于中間點R, 它需要插