3432 lines
122 KiB
C++
3432 lines
122 KiB
C++
/*
|
||
* This file is part of RawTherapee.
|
||
*
|
||
* Copyright (c) 2004-2010 Gabor Horvath <hgabor@rawtherapee.com>
|
||
*
|
||
* RawTherapee is free software: you can redistribute it and/or modify
|
||
* it under the terms of the GNU General Public License as published by
|
||
* the Free Software Foundation, either version 3 of the License, or
|
||
* (at your option) any later version.
|
||
*
|
||
* RawTherapee is distributed in the hope that it will be useful,
|
||
* but WITHOUT ANY WARRANTY; without even the implied warranty of
|
||
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
|
||
* GNU General Public License for more details.
|
||
*
|
||
* You should have received a copy of the GNU General Public License
|
||
* along with RawTherapee. If not, see <http://www.gnu.org/licenses/>.
|
||
*/
|
||
#include <rawimagesource.h>
|
||
#include <rawimagesource_i.h>
|
||
#include <median.h>
|
||
#include <rawimage.h>
|
||
#include <math.h>
|
||
#include <mytime.h>
|
||
#include <iccmatrices.h>
|
||
#include <iccstore.h>
|
||
#include <image8.h>
|
||
#include <curves.h>
|
||
#include <dfmanager.h>
|
||
#include <ffmanager.h>
|
||
#include <slicer.h>
|
||
#include <iostream>
|
||
|
||
#ifdef _OPENMP
|
||
#include <omp.h>
|
||
#endif
|
||
|
||
namespace rtengine {
|
||
|
||
extern const Settings* settings;
|
||
|
||
#undef ABS
|
||
#undef MAX
|
||
#undef MIN
|
||
#undef DIST
|
||
|
||
#define ABS(a) ((a)<0?-(a):(a))
|
||
#define MAX(a,b) ((a)<(b)?(b):(a))
|
||
#define MIN(a,b) ((a)>(b)?(b):(a))
|
||
#define DIST(a,b) (ABS(a-b))
|
||
|
||
#define PIX_SORT(a,b) { if ((a)>(b)) {temp=(a);(a)=(b);(b)=temp;} }
|
||
|
||
#define med3x3(a0,a1,a2,a3,a4,a5,a6,a7,a8,median) { \
|
||
p[0]=a0; p[1]=a1; p[2]=a2; p[3]=a3; p[4]=a4; p[5]=a5; p[6]=a6; p[7]=a7; p[8]=a8; \
|
||
PIX_SORT(p[1],p[2]); PIX_SORT(p[4],p[5]); PIX_SORT(p[7],p[8]); \
|
||
PIX_SORT(p[0],p[1]); PIX_SORT(p[3],p[4]); PIX_SORT(p[6],p[7]); \
|
||
PIX_SORT(p[1],p[2]); PIX_SORT(p[4],p[5]); PIX_SORT(p[7],p[8]); \
|
||
PIX_SORT(p[0],p[3]); PIX_SORT(p[5],p[8]); PIX_SORT(p[4],p[7]); \
|
||
PIX_SORT(p[3],p[6]); PIX_SORT(p[1],p[4]); PIX_SORT(p[2],p[5]); \
|
||
PIX_SORT(p[4],p[7]); PIX_SORT(p[4],p[2]); PIX_SORT(p[6],p[4]); \
|
||
PIX_SORT(p[4],p[2]); median=p[4];} //a4 is the median
|
||
|
||
RawImageSource::RawImageSource ()
|
||
:ImageSource()
|
||
,plistener(NULL)
|
||
,green(NULL)
|
||
,red(NULL)
|
||
,blue(NULL)
|
||
,cache(NULL)
|
||
,border(4)
|
||
,rawData(NULL)
|
||
,ri(NULL)
|
||
{
|
||
hrmap[0] = NULL;
|
||
hrmap[1] = NULL;
|
||
hrmap[2] = NULL;
|
||
needhr = NULL;
|
||
hpmap = NULL;
|
||
camProfile = NULL;
|
||
embProfile = NULL;
|
||
}
|
||
|
||
RawImageSource::~RawImageSource () {
|
||
|
||
delete idata;
|
||
if (ri) {
|
||
delete ri;
|
||
}
|
||
|
||
if (green)
|
||
freeArray<unsigned short>(green, H);
|
||
if (red)
|
||
freeArray<unsigned short>(red, H);
|
||
if (blue)
|
||
freeArray<unsigned short>(blue, H);
|
||
if(rawData)
|
||
freeArray<unsigned short>(rawData, H);
|
||
if( cache )
|
||
delete [] cache;
|
||
if (hrmap[0]!=NULL) {
|
||
int dh = H/HR_SCALE;
|
||
freeArray<float>(hrmap[0], dh);
|
||
freeArray<float>(hrmap[1], dh);
|
||
freeArray<float>(hrmap[2], dh);
|
||
}
|
||
if (needhr)
|
||
freeArray<char>(needhr, H);
|
||
if (hpmap)
|
||
freeArray<char>(hpmap, H);
|
||
if (camProfile)
|
||
cmsCloseProfile (camProfile);
|
||
if (embProfile)
|
||
cmsCloseProfile (embProfile);
|
||
}
|
||
|
||
void RawImageSource::transformRect (PreviewProps pp, int tran, int &ssx1, int &ssy1, int &width, int &height, int &fw) {
|
||
|
||
pp.x += border;
|
||
pp.y += border;
|
||
|
||
if (d1x) {
|
||
if ((tran & TR_ROT) == TR_R90 || (tran & TR_ROT) == TR_R270) {
|
||
pp.x /= 2;
|
||
pp.w = pp.w/2+1;
|
||
}
|
||
else {
|
||
pp.y /= 2;
|
||
pp.h = pp.h/2+1;
|
||
}
|
||
}
|
||
|
||
int w = W, h = H;
|
||
if (fuji) {
|
||
w = ri->get_FujiWidth() * 2 + 1;
|
||
h = (H - ri->get_FujiWidth())*2 + 1;
|
||
}
|
||
|
||
int sw = w, sh = h;
|
||
if ((tran & TR_ROT) == TR_R90 || (tran & TR_ROT) == TR_R270) {
|
||
sw = h;
|
||
sh = w;
|
||
}
|
||
if( pp.w > sw-2*border) pp.w = sw-2*border;
|
||
if( pp.h > sh-2*border) pp.h = sh-2*border;
|
||
|
||
int ppx = pp.x, ppy = pp.y;
|
||
if (tran & TR_HFLIP)
|
||
ppx = sw - pp.x - pp.w;
|
||
if (tran & TR_VFLIP)
|
||
ppy = sh - pp.y - pp.h;
|
||
|
||
int sx1 = ppx;
|
||
int sy1 = ppy;
|
||
int sx2 = ppx + pp.w;
|
||
int sy2 = ppy + pp.h;
|
||
|
||
if ((tran & TR_ROT) == TR_R180) {
|
||
sx1 = w - ppx - pp.w;
|
||
sy1 = h - ppy - pp.h;
|
||
sx2 = sx1 + pp.w;
|
||
sy2 = sy1 + pp.h;
|
||
}
|
||
else if ((tran & TR_ROT) == TR_R90) {
|
||
sx1 = ppy;
|
||
sy1 = h - ppx - pp.w;
|
||
sx2 = sx1 + pp.h;
|
||
sy2 = sy1 + pp.w;
|
||
}
|
||
else if ((tran & TR_ROT) == TR_R270) {
|
||
sx1 = w - ppy - pp.h;
|
||
sy1 = ppx;
|
||
sx2 = sx1 + pp.h;
|
||
sy2 = sy1 + pp.w;
|
||
}
|
||
|
||
if (fuji) {
|
||
// atszamoljuk a koordinatakat fuji-ra:
|
||
ssx1 = (sx1+sy1) / 2;
|
||
ssy1 = (sy1 - sx2 ) / 2 + ri->get_FujiWidth();
|
||
int ssx2 = (sx2+sy2) / 2 + 1;
|
||
int ssy2 = (sy2 - sx1) / 2 + ri->get_FujiWidth();
|
||
fw = (sx2 - sx1) / 2 / pp.skip;
|
||
width = (ssx2 - ssx1) / pp.skip + ((ssx2 - ssx1) % pp.skip > 0);
|
||
height = (ssy2 - ssy1) / pp.skip + ((ssy2 - ssy1) % pp.skip > 0);
|
||
}
|
||
else {
|
||
ssx1 = sx1;
|
||
ssy1 = sy1;
|
||
width = (sx2 - sx1) / pp.skip + ((sx2 - sx1) % pp.skip > 0);
|
||
height = (sy2 - sy1) / pp.skip + ((sy2 - sy1) % pp.skip > 0);
|
||
}
|
||
}
|
||
|
||
void RawImageSource::getImage (ColorTemp ctemp, int tran, Image16* image, PreviewProps pp, HRecParams hrp, ColorManagementParams cmp, RAWParams raw )
|
||
{
|
||
|
||
isrcMutex.lock ();
|
||
|
||
tran = defTransform (tran);
|
||
|
||
// compute channel multipliers
|
||
double r, g, b, rm, gm, bm;
|
||
ctemp.getMultipliers (r, g, b);
|
||
rm = icoeff[0][0]*r + icoeff[0][1]*g + icoeff[0][2]*b;
|
||
gm = icoeff[1][0]*r + icoeff[1][1]*g + icoeff[1][2]*b;
|
||
bm = icoeff[2][0]*r + icoeff[2][1]*g + icoeff[2][2]*b;
|
||
rm = camwb_red / rm;
|
||
gm = camwb_green / gm;
|
||
bm = camwb_blue / bm;
|
||
double mul_lum = 0.299*rm + 0.587*gm + 0.114*bm;
|
||
rm /= mul_lum;
|
||
gm /= mul_lum;
|
||
bm /= mul_lum;
|
||
|
||
if (hrp.enabled)
|
||
defGain = log(initialGain) / log(2.0);
|
||
else {
|
||
defGain = 0.0;
|
||
rm *= initialGain;
|
||
gm *= initialGain;
|
||
bm *= initialGain;
|
||
}
|
||
|
||
if (hrp.enabled==true && hrp.method=="Color" && hrmap[0]==NULL)
|
||
updateHLRecoveryMap_ColorPropagation ();
|
||
|
||
// compute image area to render in order to provide the requested part of the image
|
||
int sx1, sy1, imwidth, imheight, fw;
|
||
transformRect (pp, tran, sx1, sy1, imwidth, imheight, fw);
|
||
|
||
// check possible overflows
|
||
int maximwidth, maximheight;
|
||
if ((tran & TR_ROT) == TR_R90 || (tran & TR_ROT) == TR_R270) {
|
||
maximwidth = image->height;
|
||
maximheight = image->width;
|
||
}
|
||
else {
|
||
maximwidth = image->width;
|
||
maximheight = image->height;
|
||
}
|
||
if (d1x)
|
||
maximheight /= 2;
|
||
|
||
// correct if overflow (very rare), but not fuji because it is corrected in transline
|
||
if (!fuji && imwidth>maximwidth)
|
||
imwidth = maximwidth;
|
||
if (!fuji && imheight>maximheight)
|
||
imheight = maximheight;
|
||
int maxx=this->W,maxy=this->H,skip=pp.skip;
|
||
|
||
if (sx1+skip*imwidth>maxx) imwidth --; // very hard to fix this situation without an 'if' in the loop.
|
||
double area=skip*skip;
|
||
rm/=area;
|
||
gm/=area;
|
||
bm/=area;
|
||
|
||
#ifdef _OPENMP
|
||
#pragma omp parallel
|
||
{
|
||
#endif
|
||
// render the requested image part
|
||
unsigned short* line_red = new unsigned short [imwidth];
|
||
unsigned short* line_grn = new unsigned short [imwidth];
|
||
unsigned short* line_blue = new unsigned short [imwidth];
|
||
|
||
|
||
|
||
#ifdef _OPENMP
|
||
#pragma omp for
|
||
#endif
|
||
for (int ix=0; ix<imheight; ix++) { int i=sy1+skip*ix;if (i>maxy-skip) i=maxy-skip; // avoid trouble
|
||
if (ri->isBayer()) {
|
||
for (int j=0,jx=sx1; j<imwidth; j++,jx+=skip) {
|
||
float rtot,gtot,btot;
|
||
rtot=gtot=btot=0;
|
||
for (int m=0; m<skip; m++)
|
||
for (int n=0; n<skip; n++)
|
||
{
|
||
rtot += red[i+m][jx+n];
|
||
gtot += green[i+m][jx+n];
|
||
btot += blue[i+m][jx+n];
|
||
}
|
||
line_red[j] = CLIP(rm*rtot);
|
||
line_grn[j] = CLIP(gm*gtot);
|
||
line_blue[j] = CLIP(bm*btot);
|
||
}
|
||
} else {
|
||
for (int j=0,jx=sx1; j<imwidth; j++,jx+=skip) {
|
||
float rtot,gtot,btot;
|
||
rtot=gtot=btot=0;
|
||
for (int m=0; m<skip; m++)
|
||
for (int n=0; n<skip; n++)
|
||
{
|
||
rtot += rawData[i+m][(jx+n)*3+0];
|
||
gtot += rawData[i+m][(jx+n)*3+1];
|
||
btot += rawData[i+m][(jx+n)*3+2];
|
||
}
|
||
line_red[j] = CLIP(rm*rtot);
|
||
line_grn[j] = CLIP(gm*gtot);
|
||
line_blue[j] = CLIP(bm*btot);
|
||
|
||
}
|
||
}
|
||
|
||
if (hrp.enabled)
|
||
hlRecovery (hrp.method, line_red, line_grn, line_blue, i, sx1, imwidth, skip);
|
||
|
||
transLine (line_red, line_grn, line_blue, ix, image, tran, imwidth, imheight, fw);
|
||
}
|
||
|
||
delete [] line_red;
|
||
delete [] line_grn;
|
||
delete [] line_blue;
|
||
#ifdef _OPENMP
|
||
}
|
||
#endif
|
||
if (fuji) {
|
||
int a = ((tran & TR_ROT) == TR_R90 && image->width%2==0) || ((tran & TR_ROT) == TR_R180 && image->height%2+image->width%2==1) || ((tran & TR_ROT) == TR_R270 && image->height%2==0);
|
||
// first row
|
||
for (int j=1+a; j<image->width-1; j+=2) {
|
||
image->r[0][j] = (image->r[1][j] + image->r[0][j+1] + image->r[0][j-1]) / 3;
|
||
image->g[0][j] = (image->g[1][j] + image->g[0][j+1] + image->g[0][j-1]) / 3;
|
||
image->b[0][j] = (image->b[1][j] + image->b[0][j+1] + image->b[0][j-1]) / 3;
|
||
}
|
||
// other rows
|
||
for (int i=1; i<image->height-1; i++) {
|
||
for (int j=2-(a+i+1)%2; j<image->width-1; j+=2) {
|
||
// edge-adaptive interpolation
|
||
double dh = (ABS(image->r[i][j+1] - image->r[i][j-1]) + ABS(image->g[i][j+1] - image->g[i][j-1]) + ABS(image->b[i][j+1] - image->b[i][j-1])) / 1.0;
|
||
double dv = (ABS(image->r[i+1][j] - image->r[i-1][j]) + ABS(image->g[i+1][j] - image->g[i-1][j]) + ABS(image->b[i+1][j] - image->b[i-1][j])) / 1.0;
|
||
double eh = 1.0 / (1.0 + dh);
|
||
double ev = 1.0 / (1.0 + dv);
|
||
image->r[i][j] = (eh * (image->r[i][j+1] + image->r[i][j-1]) + ev * (image->r[i+1][j] + image->r[i-1][j])) / (2.0 * (eh + ev));
|
||
image->g[i][j] = (eh * (image->g[i][j+1] + image->g[i][j-1]) + ev * (image->g[i+1][j] + image->g[i-1][j])) / (2.0 * (eh + ev));
|
||
image->b[i][j] = (eh * (image->b[i][j+1] + image->b[i][j-1]) + ev * (image->b[i+1][j] + image->b[i-1][j])) / (2.0 * (eh + ev));
|
||
}
|
||
// first pixel
|
||
if (2-(a+i+1)%2==2) {
|
||
image->r[i][0] = (image->r[i+1][0] + image->r[i-1][0] + image->r[i][1]) / 3;
|
||
image->g[i][0] = (image->g[i+1][0] + image->g[i-1][0] + image->g[i][1]) / 3;
|
||
image->b[i][0] = (image->b[i+1][0] + image->b[i-1][0] + image->b[i][1]) / 3;
|
||
}
|
||
// last pixel
|
||
if (2-(a+i+image->width)%2==2) {
|
||
image->r[i][image->width-1] = (image->r[i+1][image->width-1] + image->r[i-1][image->width-1] + image->r[i][image->width-2]) / 3;
|
||
image->g[i][image->width-1] = (image->g[i+1][image->width-1] + image->g[i-1][image->width-1] + image->g[i][image->width-2]) / 3;
|
||
image->b[i][image->width-1] = (image->b[i+1][image->width-1] + image->b[i-1][image->width-1] + image->b[i][image->width-2]) / 3;
|
||
}
|
||
}
|
||
// last row
|
||
int b = (a==1 && image->height%2) || (a==0 && image->height%2==0);
|
||
for (int j=1+b; j<image->width-1; j+=2) {
|
||
image->r[image->height-1][j] = (image->r[image->height-2][j] + image->r[image->height-1][j+1] + image->r[image->height-1][j-1]) / 3;
|
||
image->g[image->height-1][j] = (image->g[image->height-2][j] + image->g[image->height-1][j+1] + image->g[image->height-1][j-1]) / 3;
|
||
image->b[image->height-1][j] = (image->b[image->height-2][j] + image->b[image->height-1][j+1] + image->b[image->height-1][j-1]) / 3;
|
||
}
|
||
}
|
||
|
||
// Flip if needed
|
||
if (tran & TR_HFLIP)
|
||
hflip (image);
|
||
if (tran & TR_VFLIP)
|
||
vflip (image);
|
||
|
||
// Color correction
|
||
if (ri->isBayer() && pp.skip==1)
|
||
correction_YIQ_LQ (image, raw.ccSteps);
|
||
|
||
// Applying postmul
|
||
colorSpaceConversion (image, cmp, embProfile, camProfile, cam, defGain);
|
||
|
||
isrcMutex.unlock ();
|
||
}
|
||
|
||
/* cfaCleanFromMap: correct raw pixels looking at the bitmap
|
||
* takes into consideration if there are multiple bad pixels in the neighborhood
|
||
*/
|
||
int RawImageSource::cfaCleanFromMap( PixelsMap &bitmapBads )
|
||
{
|
||
float eps=1.0;
|
||
int counter=0;
|
||
for( int row = 2; row < H-2; row++ ){
|
||
for(int col = 2; col <W-2; col++ ){
|
||
int sk = bitmapBads.skipIfZero(col,row); //optimization for a stripe all zero
|
||
if( sk ){
|
||
col +=sk-1; //-1 is because of col++ in cycle
|
||
continue;
|
||
}
|
||
if( ! bitmapBads.get(col,row ) )
|
||
continue;
|
||
|
||
double wtdsum=0,norm=0,sum=0,tot=0;
|
||
for( int dy=-2;dy<=2;dy+=2){
|
||
for( int dx=-2;dx<=2;dx+=2){
|
||
if (dy==0 && dx==0) continue;
|
||
if( bitmapBads.get(col+dx,row+dy) ) continue;
|
||
sum += rawData[row+dy][col+dx];
|
||
tot++;
|
||
if (bitmapBads.get(col-dx,row-dy)) continue;
|
||
|
||
double dirwt = 1/( fabs( rawData[row+dy][col+dx]- rawData[row-dy][col-dx])+eps);
|
||
wtdsum += dirwt* rawData[row+dy][col+dx];
|
||
norm += dirwt;
|
||
}
|
||
}
|
||
if (norm > 0.0){
|
||
rawData[row][col]= wtdsum / norm;//gradient weighted average
|
||
counter++;
|
||
} else {
|
||
if (tot > 0) rawData[row][col] = sum/tot;//backup plan -- simple average
|
||
}
|
||
}
|
||
}
|
||
return counter;
|
||
}
|
||
|
||
/* Search for hot or dead pixels in the image and update the map
|
||
* For each pixel compare its value to the average of similar color surrounding
|
||
* (Taken from Emil Martinec idea)
|
||
*/
|
||
int RawImageSource::findHotDeadPixel( PixelsMap &bpMap, float thresh)
|
||
{
|
||
int counter=0;
|
||
|
||
unsigned short (*cfablur);
|
||
cfablur = (unsigned short (*)) calloc (H*W, sizeof *cfablur);
|
||
|
||
int iprev,inext,jprev,jnext;
|
||
unsigned short p[9],temp;
|
||
int top, bottom, left, right;
|
||
|
||
#pragma omp parallel
|
||
{
|
||
#pragma omp for
|
||
for (int i=0; i<H; i++) {
|
||
if (i<2) {iprev=i+2;} else {iprev=i-2;}
|
||
if (i>H-3) {inext=i-2;} else {inext=i+2;}
|
||
for (int j=0; j<W; j++) {
|
||
if (j<2) {jprev=j+2;} else {jprev=j-2;}
|
||
if (j>W-3) {jnext=j-2;} else {jnext=j+2;}
|
||
med3x3(rawData[iprev][jprev],rawData[iprev][j],rawData[iprev][jnext], \
|
||
rawData[i][jprev],rawData[i][j],rawData[i][jnext], \
|
||
rawData[inext][jprev],rawData[inext][j],rawData[inext][jnext],cfablur[i*W+j]);
|
||
}
|
||
}
|
||
|
||
#pragma omp for
|
||
//cfa pixel heat/death evaluation
|
||
for (int rr=0; rr < H; rr++) {
|
||
|
||
//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
||
|
||
for (int cc=0; cc < W; cc++) {
|
||
//rawData[rr][cc] = cfablur[rr*W+cc];//diagnostic
|
||
|
||
//evaluate pixel for heat/death
|
||
float pixdev = (float)abs(rawData[rr][cc]-cfablur[rr*W+cc]);
|
||
float hfnbrave=0;
|
||
top=MAX(0,rr-2);
|
||
bottom=MIN(H-1,rr+2);
|
||
left=MAX(0,cc-2);
|
||
right=MIN(W-1,cc+2);
|
||
for (int mm=top; mm<=bottom; mm++)
|
||
for (int nn=left; nn<=right; nn++) {
|
||
hfnbrave += (float)abs(rawData[mm][nn]-cfablur[mm*W+nn]);
|
||
}
|
||
hfnbrave = (hfnbrave-pixdev)/((bottom-top+1)*(right-left+1)-1);
|
||
|
||
if (pixdev > thresh*hfnbrave) {
|
||
// mark the pixel as "bad"
|
||
bpMap.set(cc,rr );
|
||
counter++;
|
||
}
|
||
}//end of pixel evaluation
|
||
|
||
|
||
}
|
||
}//end pragma
|
||
free (cfablur);
|
||
//printf ("counter %d \n",counter);
|
||
return counter;
|
||
}
|
||
|
||
|
||
void RawImageSource::rotateLine (unsigned short* line, unsigned short** channel, int tran, int i, int w, int h) {
|
||
|
||
if ((tran & TR_ROT) == TR_R180)
|
||
for (int j=0; j<w; j++)
|
||
channel[h-1-i][w-1-j] = line[j];
|
||
|
||
else if ((tran & TR_ROT) == TR_R90)
|
||
for (int j=0; j<w; j++)
|
||
channel[j][h-1-i] = line[j];
|
||
|
||
else if ((tran & TR_ROT) == TR_R270)
|
||
for (int j=0; j<w; j++)
|
||
channel[w-1-j][i] = line[j];
|
||
else
|
||
memcpy (channel[i], line, w*sizeof(unsigned short));
|
||
}
|
||
|
||
void RawImageSource::transLine (unsigned short* red, unsigned short* green, unsigned short* blue, int i, Image16* image, int tran, int imwidth, int imheight, int fw) {
|
||
|
||
// Fuji SuperCCD rotation + coarse rotation
|
||
if (fuji) {
|
||
int start = ABS(fw-i);
|
||
int w = fw * 2 + 1;
|
||
int h = (imheight - fw)*2 + 1;
|
||
|
||
if ((tran & TR_ROT) == TR_R180) {
|
||
int end = MIN(h+fw-i, w-fw+i);
|
||
for (int j=start; j<end; j++) {
|
||
int y = i+j-fw;
|
||
int x = fw-i+j;
|
||
if (x>=0 && y<image->height && y>=0 && x<image->width) {
|
||
image->r[image->height-1-y][image->width-1-x] = red[j];
|
||
image->g[image->height-1-y][image->width-1-x] = green[j];
|
||
image->b[image->height-1-y][image->width-1-x] = blue[j];
|
||
}
|
||
}
|
||
}
|
||
else if ((tran & TR_ROT) == TR_R270) {
|
||
int end = MIN(h+fw-i, w-fw+i);
|
||
for (int j=start; j<end; j++) {
|
||
int y = i+j-fw;
|
||
int x = fw-i+j;
|
||
if (x>=0 && x<image->height && y>=0 && y<image->width) {
|
||
image->r[image->height-1-x][y] = red[j];
|
||
image->g[image->height-1-x][y] = green[j];
|
||
image->b[image->height-1-x][y] = blue[j];
|
||
}
|
||
}
|
||
}
|
||
else if ((tran & TR_ROT) == TR_R90) {
|
||
int end = MIN(h+fw-i, w-fw+i);
|
||
for (int j=start; j<end; j++) {
|
||
int y = i+j-fw;
|
||
int x = fw-i+j;
|
||
if (x>=0 && y<image->width && y>=0 && x<image->height) {
|
||
image->r[x][image->width-1-y] = red[j];
|
||
image->g[x][image->width-1-y] = green[j];
|
||
image->b[x][image->width-1-y] = blue[j];
|
||
}
|
||
}
|
||
}
|
||
else {
|
||
int end = MIN(h+fw-i, w-fw+i);
|
||
for (int j=start; j<end; j++) {
|
||
int y = i+j-fw;
|
||
int x = fw-i+j;
|
||
if (x>=0 && y<image->height && y>=0 && x<image->width) {
|
||
image->r[y][x] = red[j];
|
||
image->g[y][x] = green[j];
|
||
image->b[y][x] = blue[j];
|
||
}
|
||
}
|
||
}
|
||
}
|
||
// Nikon D1X vertical interpolation + coarse rotation
|
||
else if (d1x) {
|
||
// copy new pixels
|
||
if ((tran & TR_ROT) == TR_R180) {
|
||
for (int j=0; j<imwidth; j++) {
|
||
image->r[2*imheight-2-2*i][imwidth-1-j] = red[j];
|
||
image->g[2*imheight-2-2*i][imwidth-1-j] = green[j];
|
||
image->b[2*imheight-2-2*i][imwidth-1-j] = blue[j];
|
||
}
|
||
|
||
if (i==1 || i==2) { // linear interpolation
|
||
int row = 2*imheight-1-2*i;
|
||
for (int j=0; j<imwidth; j++) {
|
||
int col = imwidth-1-j;
|
||
image->r[row][col] = (red[j] + image->r[row+1][col]) >> 1;
|
||
image->g[row][col] = (green[j] + image->g[row+1][col]) >> 1;
|
||
image->b[row][col] = (blue[j] + image->b[row+1][col]) >> 1;
|
||
}
|
||
}
|
||
else if (i==imheight-1) {
|
||
int row = 2*imheight-1-2*i;
|
||
for (int j=0; j<imwidth; j++) {
|
||
int col = imwidth-1-j;
|
||
image->r[row][col] = (red[j] + image->r[row+1][col]) >> 1;
|
||
image->g[row][col] = (green[j] + image->g[row+1][col]) >> 1;
|
||
image->b[row][col] = (blue[j] + image->b[row+1][col]) >> 1;
|
||
}
|
||
row = 2*imheight-1-2*i+2;
|
||
for (int j=0; j<imwidth; j++) {
|
||
int col = imwidth-1-j;
|
||
image->r[row][col] = (red[j] + image->r[row+1][col]) >> 1;
|
||
image->g[row][col] = (green[j] + image->g[row+1][col]) >> 1;
|
||
image->b[row][col] = (blue[j] + image->b[row+1][col]) >> 1;
|
||
}
|
||
}
|
||
else if (i>2 && i<imheight-1) { // vertical bicubic interpolationi
|
||
int row = 2*imheight-1-2*i+2;
|
||
for (int j=0; j<imwidth; j++) {
|
||
int col = imwidth-1-j;
|
||
image->r[row][col] = CLIP((int)(-0.0625*red[j] + 0.5625*image->r[row-1][col] + 0.5625*image->r[row+1][col] - 0.0625*image->r[row+3][col]));
|
||
image->g[row][col] = CLIP((int)(-0.0625*green[j] + 0.5625*image->g[row-1][col] + 0.5625*image->g[row+1][col] - 0.0625*image->g[row+3][col]));
|
||
image->b[row][col] = CLIP((int)(-0.0625*blue[j] + 0.5625*image->b[row-1][col] + 0.5625*image->b[row+1][col] - 0.0625*image->b[row+3][col]));
|
||
}
|
||
}
|
||
}
|
||
else if ((tran & TR_ROT) == TR_R90) {
|
||
for (int j=0; j<imwidth; j++) {
|
||
image->r[j][2*imheight-2-2*i] = red[j];
|
||
image->g[j][2*imheight-2-2*i] = green[j];
|
||
image->b[j][2*imheight-2-2*i] = blue[j];
|
||
}
|
||
if (i==1 || i==2) { // linear interpolation
|
||
int col = 2*imheight-1-2*i;
|
||
for (int j=0; j<imwidth; j++) {
|
||
image->r[j][col] = (red[j] + image->r[j][col+1]) >> 1;
|
||
image->g[j][col] = (green[j] + image->g[j][col+1]) >> 1;
|
||
image->b[j][col] = (blue[j] + image->b[j][col+1]) >> 1;
|
||
}
|
||
}
|
||
else if (i==imheight-1) {
|
||
int col = 2*imheight-1-2*i;
|
||
for (int j=0; j<imwidth; j++) {
|
||
image->r[j][col] = (red[j] + image->r[j][col+1]) >> 1;
|
||
image->g[j][col] = (green[j] + image->g[j][col+1]) >> 1;
|
||
image->b[j][col] = (blue[j] + image->b[j][col+1]) >> 1;
|
||
}
|
||
col = 2*imheight-1-2*i+2;
|
||
for (int j=0; j<imwidth; j++) {
|
||
image->r[j][col] = (red[j] + image->r[j][col+1]) >> 1;
|
||
image->g[j][col] = (green[j] + image->g[j][col+1]) >> 1;
|
||
image->b[j][col] = (blue[j] + image->b[j][col+1]) >> 1;
|
||
}
|
||
}
|
||
else if (i>2 && i<imheight-1) { // vertical bicubic interpolationi
|
||
int col = 2*imheight-1-2*i+2;
|
||
for (int j=0; j<imwidth; j++) {
|
||
image->r[j][col] = CLIP((int)(-0.0625*red[j] + 0.5625*image->r[j][col-1] + 0.5625*image->r[j][col+1] - 0.0625*image->r[j][col+3]));
|
||
image->g[j][col] = CLIP((int)(-0.0625*green[j] + 0.5625*image->g[j][col-1] + 0.5625*image->g[j][col+1] - 0.0625*image->g[j][col+3]));
|
||
image->b[j][col] = CLIP((int)(-0.0625*blue[j] + 0.5625*image->b[j][col-1] + 0.5625*image->b[j][col+1] - 0.0625*image->b[j][col+3]));
|
||
}
|
||
}
|
||
}
|
||
else if ((tran & TR_ROT) == TR_R270) {
|
||
for (int j=0; j<imwidth; j++) {
|
||
image->r[imwidth-1-j][2*i] = red[j];
|
||
image->g[imwidth-1-j][2*i] = green[j];
|
||
image->b[imwidth-1-j][2*i] = blue[j];
|
||
}
|
||
if (i==1 || i==2) { // linear interpolation
|
||
for (int j=0; j<imwidth; j++) {
|
||
int row = imwidth-1-j;
|
||
image->r[row][2*i-1] = (red[j] + image->r[row][2*i-2]) >> 1;
|
||
image->g[row][2*i-1] = (green[j] + image->g[row][2*i-2]) >> 1;
|
||
image->b[row][2*i-1] = (blue[j] + image->b[row][2*i-2]) >> 1;
|
||
}
|
||
}
|
||
else if (i==imheight-1) {
|
||
for (int j=0; j<imwidth; j++) {
|
||
int row = imwidth-1-j;
|
||
image->r[row][2*i-1] = (red[j] + image->r[row][2*i-2]) >> 1;
|
||
image->g[row][2*i-1] = (green[j] + image->g[row][2*i-2]) >> 1;
|
||
image->b[row][2*i-1] = (blue[j] + image->b[row][2*i-2]) >> 1;
|
||
image->r[row][2*i-3] = (image->r[row][2*i-2] + image->r[row][2*i-4]) >> 1;
|
||
image->g[row][2*i-3] = (image->g[row][2*i-2] + image->g[row][2*i-4]) >> 1;
|
||
image->b[row][2*i-3] = (image->b[row][2*i-2] + image->b[row][2*i-4]) >> 1;
|
||
}
|
||
}
|
||
else if (i>0 && i<imheight-1) { // vertical bicubic interpolationi
|
||
for (int j=0; j<imwidth; j++) {
|
||
int row = imwidth-1-j;
|
||
image->r[row][2*i-3] = CLIP((int)(-0.0625*red[j] + 0.5625*image->r[row][2*i-2] + 0.5625*image->r[row][2*i-4] - 0.0625*image->r[row][2*i-6]));
|
||
image->g[row][2*i-3] = CLIP((int)(-0.0625*green[j] + 0.5625*image->g[row][2*i-2] + 0.5625*image->g[row][2*i-4] - 0.0625*image->g[row][2*i-6]));
|
||
image->b[row][2*i-3] = CLIP((int)(-0.0625*blue[j] + 0.5625*image->b[row][2*i-2] + 0.5625*image->b[row][2*i-4] - 0.0625*image->b[row][2*i-6]));
|
||
}
|
||
}
|
||
}
|
||
else {
|
||
rotateLine (red, image->r, tran, 2*i, imwidth, imheight);
|
||
rotateLine (green, image->g, tran, 2*i, imwidth, imheight);
|
||
rotateLine (blue, image->b, tran, 2*i, imwidth, imheight);
|
||
|
||
if (i==1 || i==2) { // linear interpolation
|
||
for (int j=0; j<imwidth; j++) {
|
||
image->r[2*i-1][j] = (red[j] + image->r[2*i-2][j]) >> 1;
|
||
image->g[2*i-1][j] = (green[j] + image->g[2*i-2][j]) >> 1;
|
||
image->b[2*i-1][j] = (blue[j] + image->b[2*i-2][j]) >> 1;
|
||
}
|
||
}
|
||
else if (i==imheight-1) {
|
||
for (int j=0; j<imwidth; j++) {
|
||
image->r[2*i-3][j] = (image->r[2*i-4][j] + image->r[2*i-2][j]) >> 1;
|
||
image->g[2*i-3][j] = (image->g[2*i-4][j] + image->g[2*i-2][j]) >> 1;
|
||
image->b[2*i-3][j] = (image->b[2*i-4][j] + image->b[2*i-2][j]) >> 1;
|
||
image->r[2*i-1][j] = (red[j] + image->r[2*i-2][j]) >> 1;
|
||
image->g[2*i-1][j] = (green[j] + image->g[2*i-2][j]) >> 1;
|
||
image->b[2*i-1][j] = (blue[j] + image->b[2*i-2][j]) >> 1;
|
||
}
|
||
}
|
||
else if (i>2 && i<imheight-1) { // vertical bicubic interpolationi
|
||
for (int j=0; j<imwidth; j++) {
|
||
image->r[2*i-3][j] = CLIP((int)(-0.0625*red[j] + 0.5625*image->r[2*i-2][j] + 0.5625*image->r[2*i-4][j] - 0.0625*image->r[2*i-6][j]));
|
||
image->g[2*i-3][j] = CLIP((int)(-0.0625*green[j] + 0.5625*image->g[2*i-2][j] + 0.5625*image->g[2*i-4][j] - 0.0625*image->g[2*i-6][j]));
|
||
image->b[2*i-3][j] = CLIP((int)(-0.0625*blue[j] + 0.5625*image->b[2*i-2][j] + 0.5625*image->b[2*i-4][j] - 0.0625*image->b[2*i-6][j]));
|
||
}
|
||
}
|
||
}
|
||
}
|
||
// other (conventional) CCD coarse rotation
|
||
else {
|
||
rotateLine (red, image->r, tran, i, imwidth, imheight);
|
||
rotateLine (green, image->g, tran, i, imwidth, imheight);
|
||
rotateLine (blue, image->b, tran, i, imwidth, imheight);
|
||
}
|
||
}
|
||
|
||
void RawImageSource::getFullSize (int& w, int& h, int tr) {
|
||
|
||
tr = defTransform (tr);
|
||
|
||
if (fuji) {
|
||
w = ri->get_FujiWidth() * 2 + 1;
|
||
h = (H - ri->get_FujiWidth())*2 + 1;
|
||
}
|
||
else if (d1x) {
|
||
w = W;
|
||
h = 2*H-1;
|
||
}
|
||
else {
|
||
w = W;
|
||
h = H;
|
||
}
|
||
|
||
if ((tr & TR_ROT) == TR_R90 || (tr & TR_ROT) == TR_R270) {
|
||
int tmp = w;
|
||
w = h;
|
||
h = tmp;
|
||
}
|
||
w -= 2 * border;
|
||
h -= 2 * border;
|
||
}
|
||
|
||
void RawImageSource::getSize (int tran, PreviewProps pp, int& w, int& h) {
|
||
|
||
tran = defTransform (tran);
|
||
|
||
// if (fuji) {
|
||
// return;
|
||
// }
|
||
// else if (d1x) {
|
||
// return;
|
||
// }
|
||
// else {
|
||
w = pp.w / pp.skip + (pp.w % pp.skip > 0);
|
||
h = pp.h / pp.skip + (pp.h % pp.skip > 0);
|
||
// }
|
||
}
|
||
|
||
void RawImageSource::hflip (Image16* image) {
|
||
int width = image->width;
|
||
int height = image->height;
|
||
|
||
unsigned short* rowr = new unsigned short[width];
|
||
unsigned short* rowg = new unsigned short[width];
|
||
unsigned short* rowb = new unsigned short[width];
|
||
for (int i=0; i<height; i++) {
|
||
for (int j=0; j<width; j++) {
|
||
rowr[j] = image->r[i][width-1-j];
|
||
rowg[j] = image->g[i][width-1-j];
|
||
rowb[j] = image->b[i][width-1-j];
|
||
}
|
||
memcpy (image->r[i], rowr, width*sizeof(unsigned short));
|
||
memcpy (image->g[i], rowg, width*sizeof(unsigned short));
|
||
memcpy (image->b[i], rowb, width*sizeof(unsigned short));
|
||
}
|
||
delete [] rowr;
|
||
delete [] rowg;
|
||
delete [] rowb;
|
||
}
|
||
|
||
void RawImageSource::vflip (Image16* image) {
|
||
int width = image->width;
|
||
int height = image->height;
|
||
|
||
register unsigned short tmp;
|
||
for (int i=0; i<height/2; i++)
|
||
for (int j=0; j<width; j++) {
|
||
tmp = image->r[i][j];
|
||
image->r[i][j] = image->r[height-1-i][j];
|
||
image->r[height-1-i][j] = tmp;
|
||
tmp = image->g[i][j];
|
||
image->g[i][j] = image->g[height-1-i][j];
|
||
image->g[height-1-i][j] = tmp;
|
||
tmp = image->b[i][j];
|
||
image->b[i][j] = image->b[height-1-i][j];
|
||
image->b[height-1-i][j] = tmp;
|
||
}
|
||
}
|
||
|
||
void RawImageSource::inverse33 (double (*coeff)[3], double (*icoeff)[3]) {
|
||
double nom = coeff[0][2]*coeff[1][1]*coeff[2][0] - coeff[0][1]*coeff[1][2]*coeff[2][0] - coeff[0][2]*coeff[1][0]*coeff[2][1] + coeff[0][0]*coeff[1][2]*coeff[2][1] + coeff[0][1]*coeff[1][0]*coeff[2][2] - coeff[0][0]*coeff[1][1]*coeff[2][2];
|
||
icoeff[0][0] = (coeff[1][2]*coeff[2][1]-coeff[1][1]*coeff[2][2]) / nom;
|
||
icoeff[0][1] = -(coeff[0][2]*coeff[2][1]-coeff[0][1]*coeff[2][2]) / nom;
|
||
icoeff[0][2] = (coeff[0][2]*coeff[1][1]-coeff[0][1]*coeff[1][2]) / nom;
|
||
icoeff[1][0] = -(coeff[1][2]*coeff[2][0]-coeff[1][0]*coeff[2][2]) / nom;
|
||
icoeff[1][1] = (coeff[0][2]*coeff[2][0]-coeff[0][0]*coeff[2][2]) / nom;
|
||
icoeff[1][2] = -(coeff[0][2]*coeff[1][0]-coeff[0][0]*coeff[1][2]) / nom;
|
||
icoeff[2][0] = (coeff[1][1]*coeff[2][0]-coeff[1][0]*coeff[2][1]) / nom;
|
||
icoeff[2][1] = -(coeff[0][1]*coeff[2][0]-coeff[0][0]*coeff[2][1]) / nom;
|
||
icoeff[2][2] = (coeff[0][1]*coeff[1][0]-coeff[0][0]*coeff[1][1]) / nom;
|
||
}
|
||
|
||
int RawImageSource::load (Glib::ustring fname, bool batch) {
|
||
|
||
MyTime t1,t2;
|
||
t1.set();
|
||
fileName = fname;
|
||
|
||
if (plistener) {
|
||
plistener->setProgressStr ("Decoding...");
|
||
plistener->setProgress (0.0);
|
||
}
|
||
|
||
ri = new RawImage(fname);
|
||
int res = ri->loadRaw ();
|
||
if (res)
|
||
return res;
|
||
ri->compress_image();
|
||
if (plistener) {
|
||
plistener->setProgress (0.8);
|
||
}
|
||
/***** Copy once constant data extracted from raw *******/
|
||
W = ri->get_width();
|
||
H = ri->get_height();
|
||
fuji = ri->get_FujiWidth()!=0;
|
||
for (int i=0; i<3; i++)
|
||
for (int j=0; j<3; j++)
|
||
coeff[i][j] = ri->get_rgb_cam(i,j);
|
||
// compute inverse of the color transformation matrix
|
||
inverse33 (coeff, icoeff);
|
||
|
||
d1x = ! ri->get_model().compare("D1X");
|
||
if (d1x)
|
||
border = 8;
|
||
if ( ri->get_profile() )
|
||
embProfile = cmsOpenProfileFromMem (ri->get_profile(), ri->get_profileLen());
|
||
|
||
// create profile
|
||
memset (cam, 0, sizeof(cam));
|
||
for (int i=0; i<3; i++)
|
||
for (int j=0; j<3; j++)
|
||
for (int k=0; k<3; k++)
|
||
cam[i][j] += coeff[k][i] * sRGB_d50[k][j];
|
||
camProfile = iccStore->createFromMatrix (cam, false, "Camera");
|
||
inverse33 (cam, icam);
|
||
|
||
float pre_mul[4];
|
||
ri->get_colorsCoeff( pre_mul, scale_mul, cblack );
|
||
|
||
camwb_red = ri->get_pre_mul(0) / pre_mul[0];
|
||
camwb_green = ri->get_pre_mul(1) / pre_mul[1];
|
||
camwb_blue = ri->get_pre_mul(2) / pre_mul[2];
|
||
initialGain = 1.0 / MIN(MIN(pre_mul[0],pre_mul[1]),pre_mul[2]);
|
||
|
||
double cam_r = coeff[0][0]*camwb_red + coeff[0][1]*camwb_green + coeff[0][2]*camwb_blue;
|
||
double cam_g = coeff[1][0]*camwb_red + coeff[1][1]*camwb_green + coeff[1][2]*camwb_blue;
|
||
double cam_b = coeff[2][0]*camwb_red + coeff[2][1]*camwb_green + coeff[2][2]*camwb_blue;
|
||
|
||
wb = ColorTemp (cam_r, cam_g, cam_b);
|
||
|
||
ri->set_prefilters();
|
||
|
||
//Load complete Exif informations
|
||
RawMetaDataLocation rml;
|
||
rml.exifBase = ri->get_exifBase();
|
||
rml.ciffBase = ri->get_ciffBase();
|
||
rml.ciffLength = ri->get_ciffLen();
|
||
idata = new ImageData (fname, &rml);
|
||
|
||
green = allocArray<unsigned short>(W,H);
|
||
red = allocArray<unsigned short>(W,H);
|
||
blue = allocArray<unsigned short>(W,H);
|
||
hpmap = allocArray<char>(W, H);
|
||
|
||
if (plistener) {
|
||
plistener->setProgress (1.0);
|
||
}
|
||
plistener=NULL; // This must be reset, because only load() is called through progressConnector
|
||
t2.set();
|
||
if( settings->verbose )
|
||
printf("Load %s: %d usec\n",fname.c_str(), t2.etime(t1));
|
||
|
||
return 0; // OK!
|
||
}
|
||
|
||
void RawImageSource::preprocess (const RAWParams &raw)
|
||
{
|
||
MyTime t1,t2;
|
||
t1.set();
|
||
Glib::ustring newDF = raw.dark_frame;
|
||
RawImage *rid=NULL;
|
||
if (!raw.df_autoselect) {
|
||
if( raw.dark_frame.size()>0)
|
||
rid = dfm.searchDarkFrame( raw.dark_frame );
|
||
} else {
|
||
rid = dfm.searchDarkFrame( idata->getMake(), idata->getModel(),idata->getISOSpeed(),idata->getShutterSpeed(),idata->getDateTimeAsTS());
|
||
}
|
||
if( rid && settings->verbose){
|
||
printf( "Subtracting Darkframe:%s\n",rid->get_filename().c_str());
|
||
}
|
||
|
||
//FLATFIELD start
|
||
Glib::ustring newFF = raw.ff_file;
|
||
RawImage *rif=NULL;
|
||
if (!raw.ff_AutoSelect) {
|
||
if( raw.ff_file.size()>0)
|
||
rif = ffm.searchFlatField( raw.ff_file );
|
||
} else {
|
||
rif = ffm.searchFlatField( idata->getMake(), idata->getModel(),idata->getLens(),idata->getFocalLen(), idata->getFNumber(), idata->getDateTimeAsTS());
|
||
}
|
||
if( rif && settings->verbose) {
|
||
printf( "Flat Field Correction:%s\n",rif->get_filename().c_str());
|
||
}
|
||
copyOriginalPixels(raw, ri, rid, rif);
|
||
//FLATFIELD end
|
||
|
||
|
||
PixelsMap bitmapBads(W,H);
|
||
int totBP=0; // Hold count of bad pixels to correct
|
||
|
||
// Always correct camera badpixels
|
||
std::list<badPix> *bp = dfm.getBadPixels( idata->getMake(), idata->getModel(), idata->getSerialNumber() );
|
||
if( !bp && !idata->getSerialNumber().empty() )
|
||
bp = dfm.getBadPixels( idata->getMake(), idata->getModel(), "" ); // 2nd try without serial number
|
||
if( bp ){
|
||
totBP+=bitmapBads.set( *bp );
|
||
if( settings->verbose ){
|
||
std::cout << "Correcting " << bp->size() << " pixels from .badpixels" << std::endl;
|
||
}
|
||
}
|
||
|
||
// If darkframe selected, correct hotpixels found on darkframe
|
||
bp = 0;
|
||
if( raw.df_autoselect ){
|
||
bp = dfm.getHotPixels( idata->getMake(), idata->getModel(),idata->getISOSpeed(),idata->getShutterSpeed(), idata->getDateTimeAsTS() );
|
||
}else if( raw.dark_frame.size()>0 )
|
||
bp = dfm.getHotPixels( raw.dark_frame );
|
||
if(bp){
|
||
totBP+=bitmapBads.set( *bp );
|
||
if( settings->verbose && bp->size()>0){
|
||
std::cout << "Correcting " << bp->size() << " hotpixels from darkframe" << std::endl;
|
||
}
|
||
}
|
||
|
||
scaleColors( 0,0, W, H);
|
||
|
||
defGain = log(initialGain) / log(2.0);
|
||
|
||
if ( raw.hotdeadpix_filt ) {
|
||
if (plistener) {
|
||
plistener->setProgressStr ("Hot/Dead Pixel Filter...");
|
||
plistener->setProgress (0.0);
|
||
}
|
||
int nFound =findHotDeadPixel( bitmapBads, 10.0 );
|
||
totBP += nFound;
|
||
if( settings->verbose && nFound>0){
|
||
printf( "Correcting %d hot/dead pixels found inside image\n",nFound );
|
||
}
|
||
}
|
||
if( totBP )
|
||
cfaCleanFromMap( bitmapBads );
|
||
|
||
// check if it is an olympus E camera, if yes, compute G channel pre-compensation factors
|
||
if ( raw.greenthresh || (((idata->getMake().size()>=7 && idata->getMake().substr(0,7)=="OLYMPUS" && idata->getModel()[0]=='E') || (idata->getMake().size()>=9 && idata->getMake().substr(0,7)=="Panasonic")) && raw.dmethod != RAWParams::methodstring[ RAWParams::vng4] && ri->isBayer()) ) {
|
||
// global correction
|
||
int ng1=0, ng2=0, i=0;
|
||
double avgg1=0., avgg2=0.;
|
||
|
||
#pragma omp parallel for default(shared) private(i) reduction(+: ng1, ng2, avgg1, avgg2)
|
||
for (i=border; i<H-border; i++)
|
||
for (int j=border; j<W-border; j++)
|
||
if (ri->ISGREEN(i,j)) {
|
||
if (i%2==0) {
|
||
avgg1 += rawData[i][j];
|
||
ng1++;
|
||
}
|
||
else {
|
||
avgg2 += rawData[i][j];
|
||
ng2++;
|
||
}
|
||
}
|
||
double corrg1 = ((double)avgg1/ng1 + (double)avgg2/ng2) / 2.0 / ((double)avgg1/ng1);
|
||
double corrg2 = ((double)avgg1/ng1 + (double)avgg2/ng2) / 2.0 / ((double)avgg2/ng2);
|
||
|
||
#pragma omp parallel for default(shared)
|
||
for (int i=border; i<H-border; i++)
|
||
for (int j=border; j<W-border; j++)
|
||
if (ri->ISGREEN(i,j)) {
|
||
unsigned short currData;
|
||
currData = (unsigned short)(rawData[i][j] * (i%2 ? corrg2 : corrg1));
|
||
rawData[i][j] = CLIP(currData);
|
||
}
|
||
}
|
||
|
||
if ( raw.greenthresh >0) {
|
||
if (plistener) {
|
||
plistener->setProgressStr ("Green equilibrate...");
|
||
plistener->setProgress (0.0);
|
||
}
|
||
green_equilibrate(0.01*(raw.greenthresh));
|
||
}
|
||
|
||
|
||
if ( raw.linenoise >0 ) {
|
||
if (plistener) {
|
||
plistener->setProgressStr ("Line Denoise...");
|
||
plistener->setProgress (0.0);
|
||
}
|
||
|
||
cfa_linedn(0.00002*(raw.linenoise));
|
||
}
|
||
|
||
if ( raw.ca_autocorrect || raw.cared || raw.cablue ) {
|
||
if (plistener) {
|
||
plistener->setProgressStr ("CA Auto Correction...");
|
||
plistener->setProgress (0.0);
|
||
}
|
||
|
||
CA_correct_RT(raw.cared, raw.cablue);
|
||
}
|
||
|
||
if ( raw.expos !=1 ) { // exposure
|
||
if (plistener) {
|
||
plistener->setProgressStr ("Exposure Correction...");
|
||
plistener->setProgress (0.0);
|
||
}
|
||
exp_bef(raw.expos, raw.preser);
|
||
|
||
}
|
||
|
||
t2.set();
|
||
if( settings->verbose )
|
||
printf("Preprocessing: %d usec\n", t2.etime(t1));
|
||
return;
|
||
}
|
||
void RawImageSource::demosaic(const RAWParams &raw)
|
||
{
|
||
if (ri->isBayer()) {
|
||
MyTime t1,t2;
|
||
t1.set();
|
||
if ( raw.dmethod == RAWParams::methodstring[RAWParams::hphd] )
|
||
hphd_demosaic ();
|
||
else if (raw.dmethod == RAWParams::methodstring[RAWParams::vng4] )
|
||
vng4_demosaic ();
|
||
else if (raw.dmethod == RAWParams::methodstring[RAWParams::ahd] )
|
||
ahd_demosaic (0,0,W,H);
|
||
else if (raw.dmethod == RAWParams::methodstring[RAWParams::amaze] )
|
||
amaze_demosaic_RT (0,0,W,H);
|
||
else if (raw.dmethod == RAWParams::methodstring[RAWParams::dcb] )
|
||
dcb_demosaic(raw.dcb_iterations, raw.dcb_enhance? 1:0);
|
||
else if (raw.dmethod == RAWParams::methodstring[RAWParams::eahd])
|
||
eahd_demosaic ();
|
||
else if (raw.dmethod == RAWParams::methodstring[RAWParams::fast] )
|
||
fast_demo (0,0,W,H);
|
||
else
|
||
nodemosaic();
|
||
t2.set();
|
||
if( settings->verbose )
|
||
printf("Demosaicing: %s - %d usec\n",raw.dmethod.c_str(), t2.etime(t1));
|
||
}
|
||
if (plistener) {
|
||
plistener->setProgressStr ("Ready.");
|
||
plistener->setProgress (1.0);
|
||
}
|
||
|
||
}
|
||
|
||
|
||
/* Copy original pixel data and
|
||
* subtract dark frame (if present) from current image and apply flat field correction (if present)
|
||
*/
|
||
void RawImageSource::copyOriginalPixels(const RAWParams &raw, RawImage *src, RawImage *riDark, RawImage *riFlatFile )
|
||
{
|
||
|
||
if (ri->isBayer()) {
|
||
if (!rawData)
|
||
rawData = allocArray< unsigned short >(W,H);
|
||
if (riDark && W == riDark->get_width() && H == riDark->get_height()) {
|
||
for (int row = 0; row < H; row++) {
|
||
for (int col = 0; col < W; col++) {
|
||
rawData[row][col] = MAX (src->data[row][col]+ri->get_black() - riDark->data[row][col], 0);
|
||
}
|
||
}
|
||
}else{
|
||
for (int row = 0; row < H; row++) {
|
||
for (int col = 0; col < W; col++) {
|
||
rawData[row][col] = src->data[row][col];
|
||
}
|
||
}
|
||
}
|
||
}else{
|
||
if (!rawData)
|
||
rawData = allocArray< unsigned short >(3*W,H);
|
||
if (riDark && W == riDark->get_width() && H == riDark->get_height()) {
|
||
for (int row = 0; row < H; row++) {
|
||
for (int col = 0; col < W; col++) {
|
||
rawData[row][3*col+0] = MAX (src->data[row][3*col+0]+ri->get_black() - riDark->data[row][3*col+0], 0);
|
||
rawData[row][3*col+1] = MAX (src->data[row][3*col+1]+ri->get_black() - riDark->data[row][3*col+1], 0);
|
||
rawData[row][3*col+2] = MAX (src->data[row][3*col+2]+ri->get_black() - riDark->data[row][3*col+2], 0);
|
||
}
|
||
}
|
||
}else{
|
||
for (int row = 0; row < H; row++) {
|
||
for (int col = 0; col < W; col++) {
|
||
rawData[row][3*col+0] = src->data[row][3*col+0];
|
||
rawData[row][3*col+1] = src->data[row][3*col+1];
|
||
rawData[row][3*col+2] = src->data[row][3*col+2];
|
||
}
|
||
}
|
||
}
|
||
}
|
||
|
||
|
||
if (ri->isBayer() && riFlatFile && W == riFlatFile->get_width() && H == riFlatFile->get_height()) {
|
||
//TODO: flat field correction for non-Bayer raw data
|
||
//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
||
float (*cfablur);
|
||
cfablur = (float (*)) calloc (H*W, sizeof *cfablur);
|
||
//#define BS 32
|
||
int BS = raw.ff_BlurRadius;
|
||
if (BS&1) BS++;
|
||
|
||
//function call to cfabloxblur
|
||
if (raw.ff_BlurType == RAWParams::ff_BlurTypestring[RAWParams::v_ff])
|
||
cfaboxblur(riFlatFile, cfablur, 2*BS, 0);
|
||
else if (raw.ff_BlurType == RAWParams::ff_BlurTypestring[RAWParams::h_ff])
|
||
cfaboxblur(riFlatFile, cfablur, 0, 2*BS);
|
||
else if (raw.ff_BlurType == RAWParams::ff_BlurTypestring[RAWParams::vh_ff])
|
||
//slightly more complicated blur if trying to correct both vertical and horizontal anomalies
|
||
cfaboxblur(riFlatFile, cfablur, BS, BS);//first do area blur to correct vignette
|
||
else //(raw.ff_BlurType == RAWParams::ff_BlurTypestring[RAWParams::area_ff])
|
||
cfaboxblur(riFlatFile, cfablur, BS, BS);
|
||
|
||
float refctrval,reflocval,refcolor[2][2],vignettecorr,colorcastcorr;
|
||
//find center ave values by channel
|
||
for (int m=0; m<2; m++)
|
||
for (int n=0; n<2; n++) {
|
||
refcolor[m][n] = MAX(0,cfablur[(2*(H>>2)+m)*W+2*(W>>2)+n] - ri->get_black());
|
||
}
|
||
|
||
for (int m=0; m<2; m++)
|
||
for (int n=0; n<2; n++) {
|
||
for (int row = 0; row+m < H; row+=2)
|
||
for (int col = 0; col+n < W; col+=2) {
|
||
|
||
vignettecorr = ( refcolor[m][n]/MAX(1e-5,cfablur[(row+m)*W+col+n]-ri->get_black()) );
|
||
rawData[row+m][col+n] = CLIP(round(rawData[row+m][col+n] * vignettecorr));
|
||
//would rather not clip, but this is the restriction of ushort
|
||
}
|
||
}
|
||
|
||
if (raw.ff_BlurType == RAWParams::ff_BlurTypestring[RAWParams::vh_ff]) {
|
||
float (*cfablur1);
|
||
cfablur1 = (float (*)) calloc (H*W, sizeof *cfablur1);
|
||
float (*cfablur2);
|
||
cfablur2 = (float (*)) calloc (H*W, sizeof *cfablur2);
|
||
//slightly more complicated blur if trying to correct both vertical and horizontal anomalies
|
||
cfaboxblur(riFlatFile, cfablur1, 0, 2*BS);//now do horizontal blur
|
||
cfaboxblur(riFlatFile, cfablur2, 2*BS, 0);//now do vertical blur
|
||
|
||
float vlinecorr, hlinecorr;
|
||
|
||
for (int m=0; m<2; m++)
|
||
for (int n=0; n<2; n++) {
|
||
for (int row = 0; row+m < H; row+=2)
|
||
for (int col = 0; col+n < W; col+=2) {
|
||
hlinecorr = ( MAX(1e-5,cfablur[(row+m)*W+col+n]-ri->get_black())/MAX(1e-5,cfablur1[(row+m)*W+col+n]-ri->get_black()) );
|
||
vlinecorr = ( MAX(1e-5,cfablur[(row+m)*W+col+n]-ri->get_black())/MAX(1e-5,cfablur2[(row+m)*W+col+n]-ri->get_black()) );
|
||
rawData[row+m][col+n] = CLIP(round(rawData[row+m][col+n] * hlinecorr * vlinecorr));
|
||
//would rather not clip, but this is the restriction of ushort
|
||
}
|
||
}
|
||
free (cfablur1);
|
||
free (cfablur2);
|
||
}
|
||
|
||
free (cfablur);
|
||
//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
||
//#undef BS
|
||
|
||
|
||
}
|
||
|
||
}
|
||
|
||
void RawImageSource::cfaboxblur(RawImage *riFlatFile, float* cfablur, int boxH, int boxW ) {
|
||
|
||
float (*temp);
|
||
temp = (float (*)) calloc (H*W, sizeof *temp);
|
||
|
||
//box blur cfa image; box size = BS
|
||
//horizontal blur
|
||
for (int row = 0; row < H; row++) {
|
||
int len = boxW/2 + 1;
|
||
temp[row*W+0] = (float)riFlatFile->data[row][0]/len;
|
||
temp[row*W+1] = (float)riFlatFile->data[row][1]/len;
|
||
for (int j=2; j<=boxW; j+=2) {
|
||
temp[row*W+0] += (float)riFlatFile->data[row][j]/len;
|
||
temp[row*W+1] += (float)riFlatFile->data[row][j+1]/len;
|
||
}
|
||
for (int col=2; col<=boxW; col+=2) {
|
||
temp[row*W+col] = (temp[row*W+col-2]*len + riFlatFile->data[row][col+boxW])/(len+1);
|
||
temp[row*W+col+1] = (temp[row*W+col-1]*len + riFlatFile->data[row][col+boxW+1])/(len+1);
|
||
len ++;
|
||
}
|
||
for (int col = boxW+2; col < W-boxW; col++) {
|
||
temp[row*W+col] = temp[row*W+col-2] + ((float)(riFlatFile->data[row][col+boxW] - riFlatFile->data[row][col-boxW-2]))/len;
|
||
}
|
||
for (int col=W-boxW; col<W; col+=2) {
|
||
temp[row*W+col] = (temp[row*W+col-2]*len - riFlatFile->data[row][col-boxW-2])/(len-1);
|
||
if ((W&1)==0)
|
||
temp[row*W+col+1] = (temp[row*W+col-1]*len - riFlatFile->data[row][col-boxW-1])/(len-1);
|
||
len --;
|
||
}
|
||
}
|
||
|
||
//vertical blur
|
||
for (int col = 0; col < W; col++) {
|
||
int len = boxH/2 + 1;
|
||
cfablur[0*W+col] = temp[0*W+col]/len;
|
||
cfablur[1*W+col] = temp[1*W+col]/len;
|
||
for (int i=2; i<boxH+2; i+=2) {
|
||
cfablur[0*W+col] += temp[i*W+col]/len;
|
||
cfablur[1*W+col] += temp[(i+1)*W+col]/len;
|
||
}
|
||
for (int row=2; row<boxH+2; row+=2) {
|
||
cfablur[row*W+col] = (cfablur[(row-2)*W+col]*len + temp[(row+boxH)*W+col])/(len+1);
|
||
cfablur[(row+1)*W+col] = (cfablur[(row-1)*W+col]*len + temp[(row+boxH+1)*W+col])/(len+1);
|
||
len ++;
|
||
}
|
||
for (int row = boxH+2; row < H-boxH; row++) {
|
||
cfablur[row*W+col] = cfablur[(row-2)*W+col] + (temp[(row+boxH)*W+col] - temp[(row-boxH-2)*W+col])/len;
|
||
}
|
||
for (int row=H-boxH; row<H; row+=2) {
|
||
cfablur[row*W+col] = (cfablur[(row-2)*W+col]*len - temp[(row-boxH-2)*W+col])/(len-1);
|
||
if ((H&1)==0)
|
||
cfablur[(row+1)*W+col] = (cfablur[(row-1)*W+col]*len - temp[(row-boxH-1)*W+col])/(len-1);
|
||
len --;
|
||
}
|
||
}
|
||
free (temp);
|
||
|
||
}
|
||
|
||
|
||
/* Scale original pixels into the range 0 65535 using black offsets and multipliers */
|
||
void RawImageSource::scaleColors(int winx,int winy,int winw,int winh)
|
||
{
|
||
// scale image colors
|
||
if( ri->isBayer() ){
|
||
for (int row = winy; row < winy+winh; row ++){
|
||
for (int col = winx; col < winx+winw; col++) {
|
||
int val = rawData[row][col];
|
||
if (!val)
|
||
continue;
|
||
int c = FC(row, col);
|
||
val -= cblack[c];
|
||
val *= scale_mul[c];
|
||
rawData[row][col] = CLIP(val);
|
||
}
|
||
}
|
||
}else{
|
||
for (int row = winy; row < winy+winh; row ++){
|
||
for (int col = winx; col < winx+winw; col++) {
|
||
int val = rawData[row][3*col+0];
|
||
if (val){
|
||
val -= cblack[0];
|
||
val *= scale_mul[0];
|
||
rawData[row][3*col+0] = CLIP(val);
|
||
}
|
||
val = rawData[row][3*col+1];
|
||
if (val){
|
||
val -= cblack[1];
|
||
val *= scale_mul[1];
|
||
rawData[row][3*col+1] = CLIP(val);
|
||
}
|
||
val = rawData[row][3*col+2];
|
||
if (val){
|
||
val -= cblack[2];
|
||
val *= scale_mul[2];
|
||
rawData[row][3*col+2] = CLIP(val);
|
||
}
|
||
}
|
||
}
|
||
}
|
||
|
||
}
|
||
|
||
int RawImageSource::defTransform (int tran) {
|
||
|
||
int deg = ri->get_rotateDegree();
|
||
if ((tran & TR_ROT) == TR_R180)
|
||
deg += 180;
|
||
else if ((tran & TR_ROT) == TR_R90)
|
||
deg += 90;
|
||
else if ((tran & TR_ROT) == TR_R270)
|
||
deg += 270;
|
||
deg %= 360;
|
||
|
||
int ret = 0;
|
||
if (deg==90)
|
||
ret |= TR_R90;
|
||
else if (deg==180)
|
||
ret |= TR_R180;
|
||
else if (deg==270)
|
||
ret |= TR_R270;
|
||
if (tran & TR_HFLIP)
|
||
ret |= TR_HFLIP;
|
||
if (tran & TR_VFLIP)
|
||
ret |= TR_VFLIP;
|
||
return ret;
|
||
}
|
||
|
||
void RawImageSource::correction_YIQ_LQ_ (Image16* im, int row_from, int row_to) {
|
||
|
||
int W = im->width;
|
||
|
||
int** rbconv_Y = new int*[3];
|
||
int** rbconv_I = new int*[3];
|
||
int** rbconv_Q = new int*[3];
|
||
int** rbout_I = new int*[3];
|
||
int** rbout_Q = new int*[3];
|
||
for (int i=0; i<3; i++) {
|
||
rbconv_Y[i] = new int[W];
|
||
rbconv_I[i] = new int[W];
|
||
rbconv_Q[i] = new int[W];
|
||
rbout_I[i] = new int[W];
|
||
rbout_Q[i] = new int[W];
|
||
}
|
||
|
||
int* row_I = new int[W];
|
||
int* row_Q = new int[W];
|
||
|
||
int* pre1_I = new int[3];
|
||
int* pre2_I = new int[3];
|
||
int* post1_I = new int[3];
|
||
int* post2_I = new int[3];
|
||
int middle_I[6];
|
||
int* pre1_Q = new int[3];
|
||
int* pre2_Q = new int[3];
|
||
int* post1_Q = new int[3];
|
||
int* post2_Q = new int[3];
|
||
int middle_Q[6];
|
||
int* tmp;
|
||
|
||
int ppx=0, px=(row_from-1)%3, cx=row_from%3, nx=0;
|
||
|
||
convert_row_to_YIQ (im->r[row_from-1], im->g[row_from-1], im->b[row_from-1], rbconv_Y[px], rbconv_I[px], rbconv_Q[px], W);
|
||
convert_row_to_YIQ (im->r[row_from], im->g[row_from], im->b[row_from], rbconv_Y[cx], rbconv_I[cx], rbconv_Q[cx], W);
|
||
|
||
for (int j=0; j<W; j++) {
|
||
rbout_I[px][j] = rbconv_I[px][j];
|
||
rbout_Q[px][j] = rbconv_Q[px][j];
|
||
}
|
||
|
||
for (int i=row_from; i<row_to; i++) {
|
||
|
||
ppx = (i-2)%3;
|
||
px = (i-1)%3;
|
||
cx = i%3;
|
||
nx = (i+1)%3;
|
||
|
||
convert_row_to_YIQ (im->r[i+1], im->g[i+1], im->b[i+1], rbconv_Y[nx], rbconv_I[nx], rbconv_Q[nx], W);
|
||
|
||
SORT3(rbconv_I[px][0],rbconv_I[cx][0],rbconv_I[nx][0],pre1_I[0],pre1_I[1],pre1_I[2]);
|
||
SORT3(rbconv_I[px][1],rbconv_I[cx][1],rbconv_I[nx][1],pre2_I[0],pre2_I[1],pre2_I[2]);
|
||
SORT3(rbconv_Q[px][0],rbconv_Q[cx][0],rbconv_Q[nx][0],pre1_Q[0],pre1_Q[1],pre1_Q[2]);
|
||
SORT3(rbconv_Q[px][1],rbconv_Q[cx][1],rbconv_Q[nx][1],pre2_Q[0],pre2_Q[1],pre2_Q[2]);
|
||
|
||
// median I channel
|
||
for (int j=1; j<W-2; j+=2) {
|
||
SORT3(rbconv_I[px][j+1],rbconv_I[cx][j+1],rbconv_I[nx][j+1],post1_I[0],post1_I[1],post1_I[2]);
|
||
SORT3(rbconv_I[px][j+2],rbconv_I[cx][j+2],rbconv_I[nx][j+2],post2_I[0],post2_I[1],post2_I[2]);
|
||
MERGESORT(pre2_I[0],pre2_I[1],pre2_I[2],post1_I[0],post1_I[1],post1_I[2],middle_I[0],middle_I[1],middle_I[2],middle_I[3],middle_I[4],middle_I[5]);
|
||
MEDIAN7(pre1_I[0],pre1_I[1],pre1_I[2],middle_I[1],middle_I[2],middle_I[3],middle_I[4],rbout_I[cx][j]);
|
||
MEDIAN7(post2_I[0],post2_I[1],post2_I[2],middle_I[1],middle_I[2],middle_I[3],middle_I[4],rbout_I[cx][j+1]);
|
||
tmp = pre1_I;
|
||
pre1_I = post1_I;
|
||
post1_I = tmp;
|
||
tmp = pre2_I;
|
||
pre2_I = post2_I;
|
||
post2_I = tmp;
|
||
|
||
}
|
||
// median Q channel
|
||
for (int j=1; j<W-2; j+=2) {
|
||
SORT3(rbconv_Q[px][j+1],rbconv_Q[cx][j+1],rbconv_Q[nx][j+1],post1_Q[0],post1_Q[1],post1_Q[2]);
|
||
SORT3(rbconv_Q[px][j+2],rbconv_Q[cx][j+2],rbconv_Q[nx][j+2],post2_Q[0],post2_Q[1],post2_Q[2]);
|
||
MERGESORT(pre2_Q[0],pre2_Q[1],pre2_Q[2],post1_Q[0],post1_Q[1],post1_Q[2],middle_Q[0],middle_Q[1],middle_Q[2],middle_Q[3],middle_Q[4],middle_Q[5]);
|
||
MEDIAN7(pre1_Q[0],pre1_Q[1],pre1_Q[2],middle_Q[1],middle_Q[2],middle_Q[3],middle_Q[4],rbout_Q[cx][j]);
|
||
MEDIAN7(post2_Q[0],post2_Q[1],post2_Q[2],middle_Q[1],middle_Q[2],middle_Q[3],middle_Q[4],rbout_Q[cx][j+1]);
|
||
tmp = pre1_Q;
|
||
pre1_Q = post1_Q;
|
||
post1_Q = tmp;
|
||
tmp = pre2_Q;
|
||
pre2_Q = post2_Q;
|
||
post2_Q = tmp;
|
||
}
|
||
// fill first and last element in rbout
|
||
rbout_I[cx][0] = rbconv_I[cx][0];
|
||
rbout_I[cx][W-1] = rbconv_I[cx][W-1];
|
||
rbout_I[cx][W-2] = rbconv_I[cx][W-2];
|
||
rbout_Q[cx][0] = rbconv_Q[cx][0];
|
||
rbout_Q[cx][W-1] = rbconv_Q[cx][W-1];
|
||
rbout_Q[cx][W-2] = rbconv_Q[cx][W-2];
|
||
|
||
// blur i-1th row
|
||
if (i>row_from) {
|
||
for (int j=1; j<W-1; j++) {
|
||
row_I[j] = (rbout_I[px][j-1]+rbout_I[px][j]+rbout_I[px][j+1]+rbout_I[cx][j-1]+rbout_I[cx][j]+rbout_I[cx][j+1]+rbout_I[nx][j-1]+rbout_I[nx][j]+rbout_I[nx][j+1])/9;
|
||
row_Q[j] = (rbout_Q[px][j-1]+rbout_Q[px][j]+rbout_Q[px][j+1]+rbout_Q[cx][j-1]+rbout_Q[cx][j]+rbout_Q[cx][j+1]+rbout_Q[nx][j-1]+rbout_Q[nx][j]+rbout_Q[nx][j+1])/9;
|
||
}
|
||
row_I[0] = rbout_I[px][0];
|
||
row_Q[0] = rbout_Q[px][0];
|
||
row_I[W-1] = rbout_I[px][W-1];
|
||
row_Q[W-1] = rbout_Q[px][W-1];
|
||
convert_row_to_RGB (im->r[i-1], im->g[i-1], im->b[i-1], rbconv_Y[px], row_I, row_Q, W);
|
||
}
|
||
}
|
||
// blur last 3 row and finalize H-1th row
|
||
for (int j=1; j<W-1; j++) {
|
||
row_I[j] = (rbout_I[px][j-1]+rbout_I[px][j]+rbout_I[px][j+1]+rbout_I[cx][j-1]+rbout_I[cx][j]+rbout_I[cx][j+1]+rbconv_I[nx][j-1]+rbconv_I[nx][j]+rbconv_I[nx][j+1])/9;
|
||
row_Q[j] = (rbout_Q[px][j-1]+rbout_Q[px][j]+rbout_Q[px][j+1]+rbout_Q[cx][j-1]+rbout_Q[cx][j]+rbout_Q[cx][j+1]+rbconv_Q[nx][j-1]+rbconv_Q[nx][j]+rbconv_Q[nx][j+1])/9;
|
||
}
|
||
row_I[0] = rbout_I[cx][0];
|
||
row_Q[0] = rbout_Q[cx][0];
|
||
row_I[W-1] = rbout_I[cx][W-1];
|
||
row_Q[W-1] = rbout_Q[cx][W-1];
|
||
convert_row_to_RGB (im->r[row_to-1], im->g[row_to-1], im->b[row_to-1], rbconv_Y[cx], row_I, row_Q, W);
|
||
|
||
freeArray<int>(rbconv_Y, 3);
|
||
freeArray<int>(rbconv_I, 3);
|
||
freeArray<int>(rbconv_Q, 3);
|
||
freeArray<int>(rbout_I, 3);
|
||
freeArray<int>(rbout_Q, 3);
|
||
delete [] row_I;
|
||
delete [] row_Q;
|
||
delete [] pre1_I;
|
||
delete [] pre2_I;
|
||
delete [] post1_I;
|
||
delete [] post2_I;
|
||
delete [] pre1_Q;
|
||
delete [] pre2_Q;
|
||
delete [] post1_Q;
|
||
delete [] post2_Q;
|
||
}
|
||
|
||
|
||
void RawImageSource::correction_YIQ_LQ (Image16* im, int times) {
|
||
|
||
if (im->height<4)
|
||
return;
|
||
|
||
for (int t=0; t<times; t++) {
|
||
#ifdef _OPENMP
|
||
#pragma omp parallel
|
||
{
|
||
int tid = omp_get_thread_num();
|
||
int nthreads = omp_get_num_threads();
|
||
int blk = (im->height-2)/nthreads;
|
||
|
||
if (tid<nthreads-1)
|
||
correction_YIQ_LQ_ (im, 1 + tid*blk, 1 + (tid+1)*blk);
|
||
else
|
||
correction_YIQ_LQ_ (im, 1 + tid*blk, im->height - 1);
|
||
}
|
||
#else
|
||
correction_YIQ_LQ_ (im, 1 , im->height - 1);
|
||
#endif
|
||
}
|
||
}
|
||
|
||
|
||
void RawImageSource::colorSpaceConversion (Image16* im, ColorManagementParams cmp, cmsHPROFILE embedded, cmsHPROFILE camprofile, double camMatrix[3][3], double& defgain) {
|
||
|
||
if (cmp.input == "(none)")
|
||
return;
|
||
|
||
MyTime t1, t2, t3;
|
||
|
||
t1.set ();
|
||
|
||
cmsHPROFILE in;
|
||
cmsHPROFILE out;
|
||
|
||
Glib::ustring inProfile = cmp.input;
|
||
|
||
if (inProfile=="(embedded)") {
|
||
if (embedded)
|
||
in = embedded;
|
||
else
|
||
in = camprofile;
|
||
}
|
||
else if (inProfile=="(camera)" || inProfile=="")
|
||
in = camprofile;
|
||
else {
|
||
in = iccStore->getProfile (inProfile);
|
||
if (in==NULL)
|
||
inProfile = "(camera)";
|
||
}
|
||
|
||
|
||
if (inProfile=="(camera)" || inProfile=="" || (inProfile=="(embedded)" && !embedded)) {
|
||
// in this case we avoid using the slllllooooooowwww lcms
|
||
|
||
// out = iccStore->workingSpace (wProfile);
|
||
// hTransform = cmsCreateTransform (in, TYPE_RGB_16_PLANAR, out, TYPE_RGB_16_PLANAR, settings->colorimetricIntent, cmsFLAGS_MATRIXINPUT | cmsFLAGS_MATRIXOUTPUT);//cmsFLAGS_MATRIXINPUT | cmsFLAGS_MATRIXOUTPUT);
|
||
// cmsDoTransform (hTransform, im->data, im->data, im->planestride/2);
|
||
// cmsDeleteTransform(hTransform);
|
||
TMatrix work = iccStore->workingSpaceInverseMatrix (cmp.working);
|
||
double mat[3][3] = {{0, 0, 0}, {0, 0, 0}, {0, 0, 0}};
|
||
for (int i=0; i<3; i++)
|
||
for (int j=0; j<3; j++)
|
||
for (int k=0; k<3; k++)
|
||
mat[i][j] += camMatrix[i][k] * work[k][j];
|
||
|
||
#pragma omp parallel for
|
||
for (int i=0; i<im->height; i++)
|
||
for (int j=0; j<im->width; j++) {
|
||
|
||
int newr = mat[0][0]*im->r[i][j] + mat[1][0]*im->g[i][j] + mat[2][0]*im->b[i][j];
|
||
int newg = mat[0][1]*im->r[i][j] + mat[1][1]*im->g[i][j] + mat[2][1]*im->b[i][j];
|
||
int newb = mat[0][2]*im->r[i][j] + mat[1][2]*im->g[i][j] + mat[2][2]*im->b[i][j];
|
||
|
||
im->r[i][j] = CLIP(newr);
|
||
im->g[i][j] = CLIP(newg);
|
||
im->b[i][j] = CLIP(newb);
|
||
}
|
||
}
|
||
else {
|
||
out = iccStore->workingSpace (cmp.working);
|
||
// out = iccStore->workingSpaceGamma (wProfile);
|
||
lcmsMutex->lock ();
|
||
cmsHTRANSFORM hTransform = cmsCreateTransform (in, TYPE_RGB_16_PLANAR, out, TYPE_RGB_16_PLANAR, settings->colorimetricIntent, 0);
|
||
lcmsMutex->unlock ();
|
||
if (hTransform) {
|
||
if (cmp.gammaOnInput) {
|
||
double gd = pow (2.0, defgain);
|
||
defgain = 0.0;
|
||
#pragma omp parallel for
|
||
for (int i=0; i<im->height; i++)
|
||
for (int j=0; j<im->width; j++) {
|
||
im->r[i][j] = CurveFactory::gamma (CLIP(defgain*im->r[i][j]));
|
||
im->g[i][j] = CurveFactory::gamma (CLIP(defgain*im->g[i][j]));
|
||
im->b[i][j] = CurveFactory::gamma (CLIP(defgain*im->b[i][j]));
|
||
}
|
||
}
|
||
cmsDoTransform (hTransform, im->data, im->data, im->planestride/2);
|
||
}
|
||
else {
|
||
lcmsMutex->lock ();
|
||
hTransform = cmsCreateTransform (camprofile, TYPE_RGB_16_PLANAR, out, TYPE_RGB_16_PLANAR, settings->colorimetricIntent, 0);
|
||
lcmsMutex->unlock ();
|
||
cmsDoTransform (hTransform, im->data, im->data, im->planestride/2);
|
||
}
|
||
cmsDeleteTransform(hTransform);
|
||
}
|
||
t3.set ();
|
||
// printf ("ICM TIME: %d\n", t3.etime(t1));
|
||
}
|
||
|
||
void RawImageSource::eahd_demosaic () {
|
||
|
||
if (plistener) {
|
||
plistener->setProgressStr ("Demosaicing...");
|
||
plistener->setProgress (0.0);
|
||
}
|
||
|
||
// prepare chache and constants for cielab conversion
|
||
lc00 = (0.412453 * coeff[0][0] + 0.357580 * coeff[1][0] + 0.180423 * coeff[2][0]) / 0.950456;
|
||
lc01 = (0.412453 * coeff[0][1] + 0.357580 * coeff[1][1] + 0.180423 * coeff[2][1]) / 0.950456;
|
||
lc02 = (0.412453 * coeff[0][2] + 0.357580 * coeff[1][2] + 0.180423 * coeff[2][2]) / 0.950456;
|
||
|
||
lc10 = 0.212671 * coeff[0][0] + 0.715160 * coeff[1][0] + 0.072169 * coeff[2][0];
|
||
lc11 = 0.212671 * coeff[0][1] + 0.715160 * coeff[1][1] + 0.072169 * coeff[2][1];
|
||
lc12 = 0.212671 * coeff[0][2] + 0.715160 * coeff[1][2] + 0.072169 * coeff[2][2];
|
||
|
||
lc20 = (0.019334 * coeff[0][0] + 0.119193 * coeff[1][0] + 0.950227 * coeff[2][0]) / 1.088754;
|
||
lc21 = (0.019334 * coeff[0][1] + 0.119193 * coeff[1][1] + 0.950227 * coeff[2][1]) / 1.088754;
|
||
lc22 = (0.019334 * coeff[0][2] + 0.119193 * coeff[1][2] + 0.950227 * coeff[2][2]) / 1.088754;
|
||
|
||
int maxindex = 2*65536;
|
||
cache = new double[maxindex];
|
||
threshold = (int)(0.008856*MAXVAL);
|
||
for (int i=0; i<maxindex; i++)
|
||
cache[i] = exp(1.0/3.0 * log((double)i / MAXVAL));
|
||
|
||
// end of cielab preparation
|
||
|
||
unsigned short* rh[3];
|
||
unsigned short* gh[4];
|
||
unsigned short* bh[3];
|
||
unsigned short* rv[3];
|
||
unsigned short* gv[4];
|
||
unsigned short* bv[3];
|
||
short* lLh[3];
|
||
short* lah[3];
|
||
short* lbh[3];
|
||
short* lLv[3];
|
||
short* lav[3];
|
||
short* lbv[3];
|
||
unsigned short* homh[3];
|
||
unsigned short* homv[3];
|
||
|
||
for (int i=0; i<4; i++) {
|
||
gh[i] = new unsigned short[W];
|
||
gv[i] = new unsigned short[W];
|
||
}
|
||
|
||
for (int i=0; i<3; i++) {
|
||
rh[i] = new unsigned short[W];
|
||
bh[i] = new unsigned short[W];
|
||
rv[i] = new unsigned short[W];
|
||
bv[i] = new unsigned short[W];
|
||
lLh[i] = new short[W];
|
||
lah[i] = new short[W];
|
||
lbh[i] = new short[W];
|
||
lLv[i] = new short[W];
|
||
lav[i] = new short[W];
|
||
lbv[i] = new short[W];
|
||
homh[i] = new unsigned short[W];
|
||
homv[i] = new unsigned short[W];
|
||
}
|
||
|
||
// interpolate first two lines
|
||
interpolate_row_g (gh[0], gv[0], 0);
|
||
interpolate_row_g (gh[1], gv[1], 1);
|
||
interpolate_row_g (gh[2], gv[2], 2);
|
||
interpolate_row_rb (rh[0], bh[0], NULL, gh[0], gh[1], 0);
|
||
interpolate_row_rb (rv[0], bv[0], NULL, gv[0], gv[1], 0);
|
||
interpolate_row_rb (rh[1], bh[1], gh[0], gh[1], gh[2], 1);
|
||
interpolate_row_rb (rv[1], bv[1], gv[0], gv[1], gv[2], 1);
|
||
|
||
convert_to_cielab_row (rh[0], gh[0], bh[0], lLh[0], lah[0], lbh[0]);
|
||
convert_to_cielab_row (rv[0], gv[0], bv[0], lLv[0], lav[0], lbv[0]);
|
||
convert_to_cielab_row (rh[1], gh[1], bh[1], lLh[1], lah[1], lbh[1]);
|
||
convert_to_cielab_row (rv[1], gv[1], bv[1], lLv[1], lav[1], lbv[1]);
|
||
|
||
|
||
for (int j=0; j<W; j++) {
|
||
homh[0][j] = 0;
|
||
homv[0][j] = 0;
|
||
homh[1][j] = 0;
|
||
homv[1][j] = 0;
|
||
}
|
||
|
||
const static int delta = 1;
|
||
|
||
int dLmaph[9];
|
||
int dLmapv[9];
|
||
int dCamaph[9];
|
||
int dCamapv[9];
|
||
int dCbmaph[9];
|
||
int dCbmapv[9];
|
||
|
||
for (int i=1; i<H-1; i++) {
|
||
|
||
int ix = i%3;
|
||
int imx = (i-1)%3;
|
||
int ipx = (i+1)%3;
|
||
|
||
if (i<H-2) {
|
||
interpolate_row_g (gh[(i+2)%4], gv[(i+2)%4], i+2);
|
||
interpolate_row_rb (rh[(i+1)%3], bh[(i+1)%3], gh[i%4], gh[(i+1)%4], gh[(i+2)%4], i+1);
|
||
interpolate_row_rb (rv[(i+1)%3], bv[(i+1)%3], gv[i%4], gv[(i+1)%4], gv[(i+2)%4], i+1);
|
||
}
|
||
else {
|
||
interpolate_row_rb (rh[(i+1)%3], bh[(i+1)%3], gh[i%4], gh[(i+1)%4], NULL, i+1);
|
||
interpolate_row_rb (rv[(i+1)%3], bv[(i+1)%3], gv[i%4], gv[(i+1)%4], NULL, i+1);
|
||
}
|
||
|
||
convert_to_cielab_row (rh[(i+1)%3], gh[(i+1)%4], bh[(i+1)%3], lLh[(i+1)%3], lah[(i+1)%3], lbh[(i+1)%3]);
|
||
convert_to_cielab_row (rv[(i+1)%3], gv[(i+1)%4], bv[(i+1)%3], lLv[(i+1)%3], lav[(i+1)%3], lbv[(i+1)%3]);
|
||
|
||
for (int j=0; j<W; j++) {
|
||
homh[ipx][j] = 0;
|
||
homv[ipx][j] = 0;
|
||
}
|
||
int sh, sv, idx, idx2;
|
||
for (int j=1; j<W-1; j++) {
|
||
|
||
int dmi = 0;
|
||
for (int x=-1; x<=1; x++) {
|
||
idx = (i+x)%3;
|
||
idx2 = (i+x)%2;
|
||
for (int y=-1; y<=1; y++) {
|
||
// compute distance in a, b, and L
|
||
if (dmi<4) {
|
||
sh=homh[idx][j+y];
|
||
sv=homv[idx][j+y];
|
||
if (sh>sv) { // fixate horizontal pixel
|
||
dLmaph[dmi] = DIST(lLh[ix][j], lLh[idx][j+y]);
|
||
dCamaph[dmi] = DIST(lah[ix][j], lah[idx][j+y]);
|
||
dCbmaph[dmi] = DIST(lbh[ix][j], lbh[idx][j+y]);
|
||
dLmapv[dmi] = DIST(lLv[ix][j], lLh[idx][j+y]);
|
||
dCamapv[dmi] = DIST(lav[ix][j], lah[idx][j+y]);
|
||
dCbmapv[dmi] = DIST(lbv[ix][j], lbh[idx][j+y]);
|
||
}
|
||
else if (sh<sv) {
|
||
dLmaph[dmi] = DIST(lLh[ix][j], lLv[idx][j+y]);
|
||
dCamaph[dmi] = DIST(lah[ix][j], lav[idx][j+y]);
|
||
dCbmaph[dmi] = DIST(lbh[ix][j], lbv[idx][j+y]);
|
||
dLmapv[dmi] = DIST(lLv[ix][j], lLv[idx][j+y]);
|
||
dCamapv[dmi] = DIST(lav[ix][j], lav[idx][j+y]);
|
||
dCbmapv[dmi] = DIST(lbv[ix][j], lbv[idx][j+y]);
|
||
}
|
||
else {
|
||
dLmaph[dmi] = DIST(lLh[ix][j], lLh[idx][j+y]);
|
||
dCamaph[dmi] = DIST(lah[ix][j], lah[idx][j+y]);
|
||
dCbmaph[dmi] = DIST(lbh[ix][j], lbh[idx][j+y]);
|
||
dLmapv[dmi] = DIST(lLv[ix][j], lLv[idx][j+y]);
|
||
dCamapv[dmi] = DIST(lav[ix][j], lav[idx][j+y]);
|
||
dCbmapv[dmi] = DIST(lbv[ix][j], lbv[idx][j+y]);
|
||
}
|
||
}
|
||
else {
|
||
dLmaph[dmi] = DIST(lLh[ix][j], lLh[idx][j+y]);
|
||
dCamaph[dmi] = DIST(lah[ix][j], lah[idx][j+y]);
|
||
dCbmaph[dmi] = DIST(lbh[ix][j], lbh[idx][j+y]);
|
||
dLmapv[dmi] = DIST(lLv[ix][j], lLv[idx][j+y]);
|
||
dCamapv[dmi] = DIST(lav[ix][j], lav[idx][j+y]);
|
||
dCbmapv[dmi] = DIST(lbv[ix][j], lbv[idx][j+y]);
|
||
}
|
||
dmi++;
|
||
}
|
||
}
|
||
// compute eL & eC
|
||
int eL = MIN(MAX(dLmaph[3],dLmaph[5]),MAX(dLmapv[1],dLmapv[7]));
|
||
int eCa = MIN(MAX(dCamaph[3],dCamaph[5]),MAX(dCamapv[1],dCamapv[7]));
|
||
int eCb = MIN(MAX(dCbmaph[3],dCbmaph[5]),MAX(dCbmapv[1],dCbmapv[7]));
|
||
|
||
int wh = 0;
|
||
for (int dmi=0; dmi<9; dmi++)
|
||
if (dLmaph[dmi]<=eL && dCamaph[dmi]<=eCa && dCbmaph[dmi]<=eCb)
|
||
wh++;
|
||
|
||
int wv = 0;
|
||
for (int dmi=0; dmi<9; dmi++)
|
||
if (dLmapv[dmi]<=eL && dCamapv[dmi]<=eCa && dCbmapv[dmi]<=eCb)
|
||
wv++;
|
||
|
||
homh[imx][j-1]+=wh;
|
||
homh[imx][j] +=wh;
|
||
homh[imx][j+1]+=wh;
|
||
homh[ix][j-1] +=wh;
|
||
homh[ix][j] +=wh;
|
||
homh[ix][j+1] +=wh;
|
||
homh[ipx][j-1]+=wh;
|
||
homh[ipx][j] +=wh;
|
||
homh[ipx][j+1]+=wh;
|
||
|
||
homv[imx][j-1]+=wv;
|
||
homv[imx][j] +=wv;
|
||
homv[imx][j+1]+=wv;
|
||
homv[ix][j-1] +=wv;
|
||
homv[ix][j] +=wv;
|
||
homv[ix][j+1] +=wv;
|
||
homv[ipx][j-1]+=wv;
|
||
homv[ipx][j] +=wv;
|
||
homv[ipx][j+1]+=wv;
|
||
}
|
||
//}
|
||
// finalize image
|
||
int hc, vc;
|
||
for (int j=0; j<W; j++) {
|
||
if (ri->ISGREEN(i-1,j))
|
||
green[i-1][j] = rawData[i-1][j];
|
||
else {
|
||
hc = homh[imx][j];
|
||
vc = homv[imx][j];
|
||
if (hc > vc)
|
||
green[i-1][j] = gh[(i-1)%4][j];
|
||
else if (hc < vc)
|
||
green[i-1][j] = gv[(i-1)%4][j];
|
||
else
|
||
green[i-1][j] = (gh[(i-1)%4][j] + gv[(i-1)%4][j]) / 2;
|
||
}
|
||
}
|
||
|
||
if (!(i%20) && plistener)
|
||
plistener->setProgress ((double)i / (H-2));
|
||
}
|
||
// finish H-2th and H-1th row, homogenity value is still valailable
|
||
int hc, vc;
|
||
for (int i=H-1; i<H+1; i++)
|
||
for (int j=0; j<W; j++) {
|
||
hc = homh[(i-1)%3][j];
|
||
vc = homv[(i-1)%3][j];
|
||
if (hc > vc)
|
||
green[i-1][j] = gh[(i-1)%4][j];
|
||
else if (hc < vc)
|
||
green[i-1][j] = gv[(i-1)%4][j];
|
||
else
|
||
green[i-1][j] = (gh[(i-1)%4][j] + gv[(i-1)%4][j]) / 2;
|
||
}
|
||
|
||
freeArray2<unsigned short>(rh, 3);
|
||
freeArray2<unsigned short>(gh, 4);
|
||
freeArray2<unsigned short>(bh, 3);
|
||
freeArray2<unsigned short>(rv, 3);
|
||
freeArray2<unsigned short>(gv, 4);
|
||
freeArray2<unsigned short>(bv, 3);
|
||
freeArray2<short>(lLh, 3);
|
||
freeArray2<short>(lah, 3);
|
||
freeArray2<short>(lbh, 3);
|
||
freeArray2<unsigned short>(homh, 3);
|
||
freeArray2<short>(lLv, 3);
|
||
freeArray2<short>(lav, 3);
|
||
freeArray2<short>(lbv, 3);
|
||
freeArray2<unsigned short>(homv, 3);
|
||
|
||
// Interpolate R and B
|
||
for (int i=0; i<H; i++) {
|
||
if (i==0)
|
||
// rm, gm, bm must be recovered
|
||
//interpolate_row_rb_mul_pp (red, blue, NULL, green[i], green[i+1], i, rm, gm, bm, 0, W, 1);
|
||
interpolate_row_rb_mul_pp (red[i], blue[i], NULL, green[i], green[i+1], i, 1.0, 1.0, 1.0, 0, W, 1);
|
||
else if (i==H-1)
|
||
interpolate_row_rb_mul_pp (red[i], blue[i], green[i-1], green[i], NULL, i, 1.0, 1.0, 1.0, 0, W, 1);
|
||
else
|
||
interpolate_row_rb_mul_pp (red[i], blue[i], green[i-1], green[i], green[i+1], i, 1.0, 1.0, 1.0, 0, W, 1);
|
||
|
||
}
|
||
}
|
||
|
||
void RawImageSource::hphd_vertical (float** hpmap, int col_from, int col_to) {
|
||
|
||
float* temp = new float[MAX(W,H)];
|
||
float* avg = new float[MAX(W,H)];
|
||
float* dev = new float[MAX(W,H)];
|
||
|
||
memset (temp, 0, MAX(W,H)*sizeof(float));
|
||
memset (avg, 0, MAX(W,H)*sizeof(float));
|
||
memset (dev, 0, MAX(W,H)*sizeof(float));
|
||
|
||
for (int k=col_from; k<col_to; k++) {
|
||
for (int i=5; i<H-5; i++) {
|
||
temp[i] = (rawData[i-5][k] - 8*rawData[i-4][k] + 27*rawData[i-3][k] - 48*rawData[i-2][k] + 42*rawData[i-1][k] -
|
||
(rawData[i+5][k] - 8*rawData[i+4][k] + 27*rawData[i+3][k] - 48*rawData[i+2][k] + 42*rawData[i+1][k])) / 100.0;
|
||
temp[i] = ABS(temp[i]);
|
||
}
|
||
for (int j=4; j<H-4; j++) {
|
||
float avgL = (temp[j-4] + temp[j-3] + temp[j-2] + temp[j-1] + temp[j] + temp[j+1] + temp[j+2] + temp[j+3] + temp[j+4]) / 9.0;
|
||
avg[j] = avgL;
|
||
float devL = ((temp[j-4]-avgL)*(temp[j-4]-avgL) + (temp[j-3]-avgL)*(temp[j-3]-avgL) + (temp[j-2]-avgL)*(temp[j-2]-avgL) + (temp[j-1]-avgL)*(temp[j-1]-avgL) + (temp[j]-avgL)*(temp[j]-avgL) + (temp[j+1]-avgL)*(temp[j+1]-avgL) + (temp[j+2]-avgL)*(temp[j+2]-avgL) + (temp[j+3]-avgL)*(temp[j+3]-avgL) + (temp[j+4]-avgL)*(temp[j+4]-avgL)) / 9.0;
|
||
if (devL<0.001) devL = 0.001;
|
||
dev[j] = devL;
|
||
}
|
||
for (int j=5; j<H-5; j++) {
|
||
float avgL = avg[j-1];
|
||
float avgR = avg[j+1];
|
||
float devL = dev[j-1];
|
||
float devR = dev[j+1];
|
||
hpmap[j][k] = avgL + (avgR - avgL) * devL / (devL + devR);
|
||
}
|
||
}
|
||
delete [] temp;
|
||
delete [] avg;
|
||
delete [] dev;
|
||
}
|
||
|
||
void RawImageSource::hphd_horizontal (float** hpmap, int row_from, int row_to) {
|
||
|
||
float* temp = new float[MAX(W,H)];
|
||
float* avg = new float[MAX(W,H)];
|
||
float* dev = new float[MAX(W,H)];
|
||
|
||
memset (temp, 0, MAX(W,H)*sizeof(float));
|
||
memset (avg, 0, MAX(W,H)*sizeof(float));
|
||
memset (dev, 0, MAX(W,H)*sizeof(float));
|
||
|
||
for (int i=row_from; i<row_to; i++) {
|
||
for (int j=5; j<W-5; j++) {
|
||
temp[j] = (rawData[i][j-5] - 8*rawData[i][j-4] + 27*rawData[i][j-3] - 48*rawData[i][j-2] + 42*rawData[i][j-1] -
|
||
(rawData[i][j+5] - 8*rawData[i][j+4] + 27*rawData[i][j+3] - 48*rawData[i][j+2] + 42*rawData[i][j+1])) / 100;
|
||
temp[j] = ABS(temp[j]);
|
||
}
|
||
for (int j=4; j<W-4; j++) {
|
||
float avgL = (temp[j-4] + temp[j-3] + temp[j-2] + temp[j-1] + temp[j] + temp[j+1] + temp[j+2] + temp[j+3] + temp[j+4]) / 9.0;
|
||
avg[j] = avgL;
|
||
float devL = ((temp[j-4]-avgL)*(temp[j-4]-avgL) + (temp[j-3]-avgL)*(temp[j-3]-avgL) + (temp[j-2]-avgL)*(temp[j-2]-avgL) + (temp[j-1]-avgL)*(temp[j-1]-avgL) + (temp[j]-avgL)*(temp[j]-avgL) + (temp[j+1]-avgL)*(temp[j+1]-avgL) + (temp[j+2]-avgL)*(temp[j+2]-avgL) + (temp[j+3]-avgL)*(temp[j+3]-avgL) + (temp[j+4]-avgL)*(temp[j+4]-avgL)) / 9.0;
|
||
if (devL<0.001) devL = 0.001;
|
||
dev[j] = devL;
|
||
}
|
||
for (int j=5; j<W-5; j++) {
|
||
float avgL = avg[j-1];
|
||
float avgR = avg[j+1];
|
||
float devL = dev[j-1];
|
||
float devR = dev[j+1];
|
||
float hpv = avgL + (avgR - avgL) * devL / (devL + devR);
|
||
if (hpmap[i][j] < 0.8*hpv)
|
||
this->hpmap[i][j] = 2;
|
||
else if (hpv < 0.8*hpmap[i][j])
|
||
this->hpmap[i][j] = 1;
|
||
else
|
||
this->hpmap[i][j] = 0;
|
||
}
|
||
}
|
||
delete [] temp;
|
||
delete [] avg;
|
||
delete [] dev;
|
||
}
|
||
|
||
void RawImageSource::hphd_green () {
|
||
|
||
#pragma omp parallel for
|
||
for (int i=3; i<H-3; i++) {
|
||
for (int j=3; j<W-3; j++) {
|
||
if (ri->ISGREEN(i,j))
|
||
green[i][j] = rawData[i][j];
|
||
else {
|
||
if (this->hpmap[i][j]==1) {
|
||
int g2 = rawData[i][j+1] + ((rawData[i][j] - rawData[i][j+2]) >> 1);
|
||
int g4 = rawData[i][j-1] + ((rawData[i][j] - rawData[i][j-2]) >> 1);
|
||
|
||
int dx = rawData[i][j+1] - rawData[i][j-1];
|
||
int d1 = rawData[i][j+3] - rawData[i][j+1];
|
||
int d2 = rawData[i][j+2] - rawData[i][j];
|
||
int d3 = (rawData[i-1][j+2] - rawData[i-1][j]) >> 1;
|
||
int d4 = (rawData[i+1][j+2] - rawData[i+1][j]) >> 1;
|
||
|
||
double e2 = 1.0 / (1.0 + ABS(dx) + ABS(d1) + ABS(d2) + ABS(d3) + ABS(d4));
|
||
|
||
d1 = rawData[i][j-3] - rawData[i][j-1];
|
||
d2 = rawData[i][j-2] - rawData[i][j];
|
||
d3 = (rawData[i-1][j-2] - rawData[i-1][j]) >> 1;
|
||
d4 = (rawData[i+1][j-2] - rawData[i+1][j]) >> 1;
|
||
|
||
double e4 = 1.0 / (1.0 + ABS(dx) + ABS(d1) + ABS(d2) + ABS(d3) + ABS(d4));
|
||
|
||
green[i][j] = CLIP((e2 * g2 + e4 * g4) / (e2 + e4));
|
||
}
|
||
else if (this->hpmap[i][j]==2) {
|
||
int g1 = rawData[i-1][j] + ((rawData[i][j] - rawData[i-2][j]) >> 1);
|
||
int g3 = rawData[i+1][j] + ((rawData[i][j] - rawData[i+2][j]) >> 1);
|
||
|
||
int dy = rawData[i+1][j] - rawData[i-1][j];
|
||
int d1 = rawData[i-1][j] - rawData[i-3][j];
|
||
int d2 = rawData[i][j] - rawData[i-2][j];
|
||
int d3 = (rawData[i][j-1] - rawData[i-2][j-1]) >> 1;
|
||
int d4 = (rawData[i][j+1] - rawData[i-2][j+1]) >> 1;
|
||
|
||
double e1 = 1.0 / (1.0 + ABS(dy) + ABS(d1) + ABS(d2) + ABS(d3) + ABS(d4));
|
||
|
||
d1 = rawData[i+1][j] - rawData[i+3][j];
|
||
d2 = rawData[i][j] - rawData[i+2][j];
|
||
d3 = (rawData[i][j-1] - rawData[i+2][j-1]) >> 1;
|
||
d4 = (rawData[i][j+1] - rawData[i+2][j+1]) >> 1;
|
||
|
||
double e3 = 1.0 / (1.0 + ABS(dy) + ABS(d1) + ABS(d2) + ABS(d3) + ABS(d4));
|
||
|
||
green[i][j] = CLIP((e1 * g1 + e3 * g3) / (e1 + e3));
|
||
}
|
||
else {
|
||
int g1 = rawData[i-1][j] + ((rawData[i][j] - rawData[i-2][j]) >> 1);
|
||
int g2 = rawData[i][j+1] + ((rawData[i][j] - rawData[i][j+2]) >> 1);
|
||
int g3 = rawData[i+1][j] + ((rawData[i][j] - rawData[i+2][j]) >> 1);
|
||
int g4 = rawData[i][j-1] + ((rawData[i][j] - rawData[i][j-2]) >> 1);
|
||
|
||
int dx = rawData[i][j+1] - rawData[i][j-1];
|
||
int dy = rawData[i+1][j] - rawData[i-1][j];
|
||
|
||
int d1 = rawData[i-1][j] - rawData[i-3][j];
|
||
int d2 = rawData[i][j] - rawData[i-2][j];
|
||
int d3 = (rawData[i][j-1] - rawData[i-2][j-1]) >> 1;
|
||
int d4 = (rawData[i][j+1] - rawData[i-2][j+1]) >> 1;
|
||
|
||
double e1 = 1.0 / (1.0 + ABS(dy) + ABS(d1) + ABS(d2) + ABS(d3) + ABS(d4));
|
||
|
||
d1 = rawData[i][j+3] - rawData[i][j+1];
|
||
d2 = rawData[i][j+2] - rawData[i][j];
|
||
d3 = (rawData[i-1][j+2] - rawData[i-1][j]) >> 1;
|
||
d4 = (rawData[i+1][j+2] - rawData[i+1][j]) >> 1;
|
||
|
||
double e2 = 1.0 / (1.0 + ABS(dx) + ABS(d1) + ABS(d2) + ABS(d3) + ABS(d4));
|
||
|
||
d1 = rawData[i+1][j] - rawData[i+3][j];
|
||
d2 = rawData[i][j] - rawData[i+2][j];
|
||
d3 = (rawData[i][j-1] - rawData[i+2][j-1]) >> 1;
|
||
d4 = (rawData[i][j+1] - rawData[i+2][j+1]) >> 1;
|
||
|
||
double e3 = 1.0 / (1.0 + ABS(dy) + ABS(d1) + ABS(d2) + ABS(d3) + ABS(d4));
|
||
|
||
d1 = rawData[i][j-3] - rawData[i][j-1];
|
||
d2 = rawData[i][j-2] - rawData[i][j];
|
||
d3 = (rawData[i-1][j-2] - rawData[i-1][j]) >> 1;
|
||
d4 = (rawData[i+1][j-2] - rawData[i+1][j]) >> 1;
|
||
|
||
double e4 = 1.0 / (1.0 + ABS(dx) + ABS(d1) + ABS(d2) + ABS(d3) + ABS(d4));
|
||
|
||
green[i][j] = CLIP((e1*g1 + e2*g2 + e3*g3 + e4*g4) / (e1 + e2 + e3 + e4));
|
||
}
|
||
}
|
||
}
|
||
}
|
||
}
|
||
|
||
void RawImageSource::hphd_demosaic () {
|
||
|
||
if (plistener) {
|
||
plistener->setProgressStr ("Demosaicing...");
|
||
plistener->setProgress (0.0);
|
||
}
|
||
|
||
float** hpmap = new float*[H];
|
||
for (int i=0; i<H; i++) {
|
||
hpmap[i] = new float[W];
|
||
memset(hpmap[i], 0, W*sizeof(float));
|
||
}
|
||
|
||
#ifdef _OPENMP
|
||
#pragma omp parallel
|
||
{
|
||
int tid = omp_get_thread_num();
|
||
int nthreads = omp_get_num_threads();
|
||
int blk = W/nthreads;
|
||
|
||
if (tid<nthreads-1)
|
||
hphd_vertical (hpmap, tid*blk, (tid+1)*blk);
|
||
else
|
||
hphd_vertical (hpmap, tid*blk, W);
|
||
}
|
||
#else
|
||
hphd_vertical (hpmap, 0, W);
|
||
#endif
|
||
if (plistener)
|
||
plistener->setProgress (0.33);
|
||
|
||
for (int i=0; i<H; i++)
|
||
memset(this->hpmap[i], 0, W*sizeof(char));
|
||
|
||
#ifdef _OPENMP
|
||
#pragma omp parallel
|
||
{
|
||
int tid = omp_get_thread_num();
|
||
int nthreads = omp_get_num_threads();
|
||
int blk = H/nthreads;
|
||
|
||
if (tid<nthreads-1)
|
||
hphd_horizontal (hpmap, tid*blk, (tid+1)*blk);
|
||
else
|
||
hphd_horizontal (hpmap, tid*blk, H);
|
||
}
|
||
#else
|
||
hphd_horizontal (hpmap, 0, H);
|
||
#endif
|
||
freeArray<float>(hpmap, H);
|
||
|
||
if (plistener)
|
||
plistener->setProgress (0.66);
|
||
|
||
|
||
hphd_green ();
|
||
for (int i=0; i<H; i++) {
|
||
if (i==0)
|
||
// rm, gm, bm must be recovered
|
||
//interpolate_row_rb_mul_pp (red, blue, NULL, green[i], green[i+1], i, rm, gm, bm, 0, W, 1);
|
||
interpolate_row_rb_mul_pp (red[i], blue[i], NULL, green[i], green[i+1], i, 1.0, 1.0, 1.0, 0, W, 1);
|
||
else if (i==H-1)
|
||
interpolate_row_rb_mul_pp (red[i], blue[i], green[i-1], green[i], NULL, i, 1.0, 1.0, 1.0, 0, W, 1);
|
||
else
|
||
interpolate_row_rb_mul_pp (red[i], blue[i], green[i-1], green[i], green[i+1], i, 1.0, 1.0, 1.0, 0, W, 1);
|
||
|
||
}
|
||
if (plistener)
|
||
plistener->setProgress (1.0);
|
||
}
|
||
|
||
void RawImageSource::HLRecovery_Luminance (unsigned short* rin, unsigned short* gin, unsigned short* bin, unsigned short* rout, unsigned short* gout, unsigned short* bout, int width, int maxval) {
|
||
|
||
for (int i=0; i<width; i++) {
|
||
int r = rin[i], g = gin[i], b = bin[i];
|
||
if (r>maxval || g>maxval || b>maxval) {
|
||
int ro = MIN (r, maxval);
|
||
int go = MIN (g, maxval);
|
||
int bo = MIN (b, maxval);
|
||
double L = r + g + b;
|
||
double C = 1.732050808 * (r - g);
|
||
double H = 2 * b - r - g;
|
||
double Co = 1.732050808 * (ro - go);
|
||
double Ho = 2 * bo - ro - go;
|
||
if (r!=g && g!=b) {
|
||
double ratio = sqrt ((Co*Co+Ho*Ho) / (C*C+H*H));
|
||
C *= ratio;
|
||
H *= ratio;
|
||
}
|
||
int rr = L / 3.0 - H / 6.0 + C / 3.464101615;
|
||
int gr = L / 3.0 - H / 6.0 - C / 3.464101615;
|
||
int br = L / 3.0 + H / 3.0;
|
||
rout[i] = CLIP(rr);
|
||
gout[i] = CLIP(gr);
|
||
bout[i] = CLIP(br);
|
||
}
|
||
else {
|
||
rout[i] = rin[i];
|
||
gout[i] = gin[i];
|
||
bout[i] = bin[i];
|
||
}
|
||
}
|
||
}
|
||
|
||
void RawImageSource::HLRecovery_CIELab (unsigned short* rin, unsigned short* gin, unsigned short* bin, unsigned short* rout, unsigned short* gout, unsigned short* bout, int width, int maxval, double cam[3][3], double icam[3][3]) {
|
||
|
||
static bool crTableReady = false;
|
||
static double fv[0x10000];
|
||
if (!crTableReady) {
|
||
for (int ix=0; ix < 0x10000; ix++) {
|
||
double rx = ix / 65535.0;
|
||
fv[ix] = rx > 0.008856 ? exp(1.0/3 * log(rx)) : 7.787*rx + 16/116.0;
|
||
}
|
||
crTableReady = true;
|
||
}
|
||
|
||
for (int i=0; i<width; i++) {
|
||
int r = rin[i], g = gin[i], b = bin[i];
|
||
if (r>maxval || g>maxval || b>maxval) {
|
||
int ro = MIN (r, maxval);
|
||
int go = MIN (g, maxval);
|
||
int bo = MIN (b, maxval);
|
||
double yy = cam[0][1]*r + cam[1][1]*g + cam[2][1]*b;
|
||
double fy = fv[CLIP((int)yy)];
|
||
// compute LCH decompostion of the clipped pixel (only color information, thus C and H will be used)
|
||
double x = cam[0][0]*ro + cam[1][0]*go + cam[2][0]*bo;
|
||
double y = cam[0][1]*ro + cam[1][1]*go + cam[2][1]*bo;
|
||
double z = cam[0][2]*ro + cam[1][2]*go + cam[2][2]*bo;
|
||
x = fv[CLIP((int)x)];
|
||
y = fv[CLIP((int)y)];
|
||
z = fv[CLIP((int)z)];
|
||
// convert back to rgb
|
||
double fz = fy - y + z;
|
||
double fx = fy + x - y;
|
||
double zr = (fz<=0.206893) ? ((116.0*fz-16.0)/903.3) : (fz * fz * fz);
|
||
double xr = (fx<=0.206893) ? ((116.0*fx-16.0)/903.3) : (fx * fx * fx);
|
||
x = xr*65535.0 - 0.5;
|
||
y = yy;
|
||
z = zr*65535.0 - 0.5;
|
||
int rr = icam[0][0]*x + icam[1][0]*y + icam[2][0]*z;
|
||
int gr = icam[0][1]*x + icam[1][1]*y + icam[2][1]*z;
|
||
int br = icam[0][2]*x + icam[1][2]*y + icam[2][2]*z;
|
||
rout[i] = CLIP(rr);
|
||
gout[i] = CLIP(gr);
|
||
bout[i] = CLIP(br);
|
||
}
|
||
else {
|
||
rout[i] = rin[i];
|
||
gout[i] = gin[i];
|
||
bout[i] = bin[i];
|
||
}
|
||
}
|
||
}
|
||
|
||
void RawImageSource::hlRecovery (std::string method, unsigned short* red, unsigned short* green, unsigned short* blue, int i, int sx1, int width, int skip) {
|
||
|
||
if (method=="Luminance")
|
||
HLRecovery_Luminance (red, green, blue, red, green, blue, width, 65535 / initialGain);
|
||
else if (method=="CIELab blending")
|
||
HLRecovery_CIELab (red, green, blue, red, green, blue, width, 65535 / initialGain, cam, icam);
|
||
else if (method=="Color")
|
||
HLRecovery_ColorPropagation (red, green, blue, i, sx1, width, skip);
|
||
}
|
||
|
||
int RawImageSource::getAEHistogram (unsigned int* histogram, int& histcompr) {
|
||
|
||
histcompr = 3;
|
||
|
||
memset (histogram, 0, (65536>>histcompr)*sizeof(int));
|
||
|
||
for (int i=border; i<H-border; i++) {
|
||
int start, end;
|
||
if (fuji) {
|
||
int fw = ri->get_FujiWidth();
|
||
start = ABS(fw-i) + border;
|
||
end = MIN( H+ W-fw-i, fw+i) - border;
|
||
}
|
||
else {
|
||
start = border;
|
||
end = W-border;
|
||
}
|
||
if (ri->isBayer())
|
||
for (int j=start; j<end; j++) {
|
||
if (ri->ISGREEN(i,j))
|
||
histogram[CLIP((int)(camwb_green*rawData[i][j]))>>histcompr]+=4;
|
||
else if (ri->ISRED(i,j))
|
||
histogram[CLIP((int)(camwb_red*rawData[i][j]))>>histcompr]+=4;
|
||
else if (ri->ISBLUE(i,j))
|
||
histogram[CLIP((int)(camwb_blue*rawData[i][j]))>>histcompr]+=4;
|
||
} else {
|
||
for (int j=start; j<3*end; j++) {
|
||
histogram[CLIP((int)(camwb_red*rawData[i][j+0]))>>histcompr]++;
|
||
histogram[CLIP((int)(camwb_green*rawData[i][j+1]))>>histcompr]+=2;
|
||
histogram[CLIP((int)(camwb_blue*rawData[i][j+2]))>>histcompr]++;
|
||
}
|
||
}
|
||
|
||
}
|
||
return 1;
|
||
}
|
||
|
||
ColorTemp RawImageSource::getAutoWB () {
|
||
|
||
double avg_r = 0;
|
||
double avg_g = 0;
|
||
double avg_b = 0;
|
||
int rn = 0, gn = 0, bn = 0;
|
||
|
||
if (fuji) {
|
||
for (int i=32; i<H-32; i++) {
|
||
int fw = ri->get_FujiWidth();
|
||
int start = ABS(fw-i) + 32;
|
||
int end = MIN(H+W-fw-i, fw+i) - 32;
|
||
for (int j=start; j<end; j++) {
|
||
if (!ri->isBayer()) {
|
||
double d = CLIP(initialGain*(rawData[i][3*j]));
|
||
if (d>64000)
|
||
continue;
|
||
avg_r += d; rn++;
|
||
d = CLIP(initialGain*(rawData[i][3*j+1]));
|
||
if (d>64000)
|
||
continue;
|
||
avg_g += d; gn++;
|
||
d = CLIP(initialGain*(rawData[i][3*j+2]));
|
||
if (d>64000)
|
||
continue;
|
||
avg_b += d; bn++;
|
||
}
|
||
else {
|
||
int c = FC( i, j);
|
||
double d = CLIP(initialGain*(rawData[i][j]));
|
||
if (d>64000)
|
||
continue;
|
||
double dp = d;
|
||
if (c==0) {
|
||
avg_r += dp;
|
||
rn++;
|
||
}
|
||
else if (c==1) {
|
||
avg_g += dp;
|
||
gn++;
|
||
}
|
||
else if (c==2) {
|
||
avg_b += dp;
|
||
bn++;
|
||
}
|
||
}
|
||
}
|
||
}
|
||
}
|
||
else {
|
||
if (!ri->isBayer()) {
|
||
for (int i=32; i<H-32; i++)
|
||
for (int j=32; j<W-32; j++) {
|
||
double dr = CLIP(initialGain*(rawData[i][3*j] ));
|
||
double dg = CLIP(initialGain*(rawData[i][3*j+1]));
|
||
double db = CLIP(initialGain*(rawData[i][3*j+2]));
|
||
if (dr>64000 || dg>64000 || db>64000) continue;
|
||
avg_r += dr; rn++;
|
||
avg_g += dg;
|
||
avg_b += db;
|
||
}
|
||
gn = rn; bn=rn;
|
||
} else {
|
||
//determine GRBG coset; (ey,ex) is the offset of the R subarray
|
||
int ey, ex;
|
||
if (ri->ISGREEN(0,0)) {//first pixel is G
|
||
if (ri->ISRED(0,1)) {ey=0; ex=1;} else {ey=1; ex=0;}
|
||
} else {//first pixel is R or B
|
||
if (ri->ISRED(0,0)) {ey=0; ex=0;} else {ey=1; ex=1;}
|
||
}
|
||
double d[2][2];
|
||
for (int i=32; i<H-32; i+=2)
|
||
for (int j=32; j<W-32; j+=2) {
|
||
//average a Bayer quartet if nobody is clipped
|
||
d[0][0] = CLIP(initialGain*(rawData[i][j] ));
|
||
d[0][1] = CLIP(initialGain*(rawData[i][j+1] ));
|
||
d[1][0] = CLIP(initialGain*(rawData[i+1][j] ));
|
||
d[1][1] = CLIP(initialGain*(rawData[i+1][j+1]));
|
||
if ( d[0][0]>64000 || d[0][1]>64000 || d[1][0]>64000 || d[1][1]>64000 ) continue;
|
||
avg_r += d[ey][ex];
|
||
avg_g += d[1-ey][ex] + d[ey][1-ex];
|
||
avg_b += d[1-ey][1-ex];
|
||
rn++;
|
||
}
|
||
gn = 2*rn;
|
||
bn = rn;
|
||
}
|
||
}
|
||
if( settings->verbose )
|
||
printf ("AVG: %g %g %g\n", avg_r/rn, avg_g/gn, avg_b/bn);
|
||
|
||
// return ColorTemp (pow(avg_r/rn, 1.0/6.0)*img_r, pow(avg_g/gn, 1.0/6.0)*img_g, pow(avg_b/bn, 1.0/6.0)*img_b);
|
||
|
||
double reds = avg_r/rn * camwb_red;
|
||
double greens = avg_g/gn * camwb_green;
|
||
double blues = avg_b/bn * camwb_blue;
|
||
|
||
double rm = coeff[0][0]*reds + coeff[0][1]*greens + coeff[0][2]*blues;
|
||
double gm = coeff[1][0]*reds + coeff[1][1]*greens + coeff[1][2]*blues;
|
||
double bm = coeff[2][0]*reds + coeff[2][1]*greens + coeff[2][2]*blues;
|
||
|
||
return ColorTemp (rm, gm, bm);
|
||
}
|
||
|
||
|
||
void RawImageSource::transformPosition (int x, int y, int tran, int& ttx, int& tty) {
|
||
|
||
tran = defTransform (tran);
|
||
|
||
x += border;
|
||
y += border;
|
||
|
||
if (d1x) {
|
||
if ((tran & TR_ROT) == TR_R90 || (tran & TR_ROT) == TR_R270)
|
||
x /= 2;
|
||
else
|
||
y /= 2;
|
||
}
|
||
|
||
int w = W, h = H;
|
||
if (fuji) {
|
||
w = ri->get_FujiWidth() * 2 + 1;
|
||
h = (H - ri->get_FujiWidth())*2 + 1;
|
||
}
|
||
int sw = w, sh = h;
|
||
if ((tran & TR_ROT) == TR_R90 || (tran & TR_ROT) == TR_R270) {
|
||
sw = h;
|
||
sh = w;
|
||
}
|
||
|
||
int ppx = x, ppy = y;
|
||
if (tran & TR_HFLIP)
|
||
ppx = sw - 1 - x ;
|
||
if (tran & TR_VFLIP)
|
||
ppy = sh - 1 - y;
|
||
|
||
int tx = ppx;
|
||
int ty = ppy;
|
||
|
||
if ((tran & TR_ROT) == TR_R180) {
|
||
tx = w - 1 - ppx;
|
||
ty = h - 1 - ppy;
|
||
}
|
||
else if ((tran & TR_ROT) == TR_R90) {
|
||
tx = ppy;
|
||
ty = h - 1 - ppx;
|
||
}
|
||
else if ((tran & TR_ROT) == TR_R270) {
|
||
tx = w - 1 - ppy;
|
||
ty = ppx;
|
||
}
|
||
|
||
if (fuji) {
|
||
ttx = (tx+ty) / 2;
|
||
tty = (ty-tx) / 2 + ri->get_FujiWidth();
|
||
}
|
||
else {
|
||
ttx = tx;
|
||
tty = ty;
|
||
}
|
||
}
|
||
|
||
|
||
ColorTemp RawImageSource::getSpotWB (std::vector<Coord2D> red, std::vector<Coord2D> green, std::vector<Coord2D>& blue, int tran) {
|
||
|
||
int x; int y;
|
||
double reds = 0, greens = 0, blues = 0;
|
||
int rn = 0;
|
||
|
||
if (!ri->isBayer()) {
|
||
int xmin, xmax, ymin, ymax;
|
||
int xr, xg, xb, yr, yg, yb;
|
||
for (int i=0; i<red.size(); i++) {
|
||
transformPosition (red[i].x, red[i].y, tran, xr, yr);
|
||
transformPosition (green[i].x, green[i].y, tran, xg, yg);
|
||
transformPosition (blue[i].x, blue[i].y, tran, xb, yb);
|
||
if (initialGain*(rawData[yr][3*xr] )>52500 ||
|
||
initialGain*(rawData[yg][3*xg+1])>52500 ||
|
||
initialGain*(rawData[yb][3*xb+2])>52500) continue;
|
||
xmin = MIN(xr,MIN(xg,xb));
|
||
xmax = MAX(xr,MAX(xg,xb));
|
||
ymin = MIN(yr,MIN(yg,yb));
|
||
ymax = MAX(yr,MAX(yg,yb));
|
||
if (xmin>=0 && ymin>=0 && xmax<W && ymax<H) {
|
||
reds += (rawData[yr][3*xr] );
|
||
greens += (rawData[yg][3*xg+1]);
|
||
blues += (rawData[yb][3*xb+2]);
|
||
rn++;
|
||
}
|
||
}
|
||
|
||
} else {
|
||
|
||
int d[9][2] = {{0,0}, {-1,-1}, {-1,0}, {-1,1}, {0,-1}, {0,1}, {1,-1}, {1,0}, {1,1}};
|
||
int rloc, gloc, bloc, rnbrs, gnbrs, bnbrs;
|
||
for (int i=0; i<red.size(); i++) {
|
||
transformPosition (red[i].x, red[i].y, tran, x, y);
|
||
rloc=gloc=bloc=rnbrs=gnbrs=bnbrs=0;
|
||
for (int k=0; k<9; k++) {
|
||
int xv = x + d[k][0];
|
||
int yv = y + d[k][1];
|
||
int c = FC(yv,xv);
|
||
if (c==0 && xv>=0 && yv>=0 && xv<W && yv<H) { //RED
|
||
rloc += (rawData[yv][xv]);
|
||
rnbrs++;
|
||
continue;
|
||
}else if (c==2 && xv>=0 && yv>=0 && xv<W && yv<H) { //BLUE
|
||
bloc += (rawData[yv][xv]);
|
||
bnbrs++;
|
||
continue;
|
||
} else { // GREEN
|
||
gloc += (rawData[yv][xv]);
|
||
gnbrs++;
|
||
continue;
|
||
}
|
||
|
||
}
|
||
rloc /= rnbrs; gloc /= gnbrs; bloc /= bnbrs;
|
||
if (rloc*initialGain<64000 && gloc*initialGain<64000 && bloc*initialGain<64000) {
|
||
reds += rloc; greens += gloc; blues += bloc; rn++;
|
||
}
|
||
//transformPosition (green[i].x, green[i].y, tran, x, y);//these are redundant now ??? if not, repeat for these blocks same as for red[]
|
||
//transformPosition (blue[i].x, blue[i].y, tran, x, y);
|
||
}
|
||
}
|
||
|
||
if (2*rn < red.size()) {
|
||
return ColorTemp ();
|
||
}
|
||
else {
|
||
reds = reds/rn * camwb_red;
|
||
greens = greens/rn * camwb_green;
|
||
blues = blues/rn * camwb_blue;
|
||
|
||
double rm = coeff[0][0]*reds + coeff[0][1]*greens + coeff[0][2]*blues;
|
||
double gm = coeff[1][0]*reds + coeff[1][1]*greens + coeff[1][2]*blues;
|
||
double bm = coeff[2][0]*reds + coeff[2][1]*greens + coeff[2][2]*blues;
|
||
|
||
return ColorTemp (rm, gm, bm);
|
||
}
|
||
}
|
||
|
||
#define FORCC for (c=0; c < colors; c++)
|
||
#define fc(row,col) \
|
||
(ri->prefilters >> ((((row) << 1 & 14) + ((col) & 1)) << 1) & 3)
|
||
typedef unsigned short ushort;
|
||
void RawImageSource::vng4_demosaic () {
|
||
|
||
static const signed char *cp, terms[] = {
|
||
-2,-2,+0,-1,0,0x01, -2,-2,+0,+0,1,0x01, -2,-1,-1,+0,0,0x01,
|
||
-2,-1,+0,-1,0,0x02, -2,-1,+0,+0,0,0x03, -2,-1,+0,+1,1,0x01,
|
||
-2,+0,+0,-1,0,0x06, -2,+0,+0,+0,1,0x02, -2,+0,+0,+1,0,0x03,
|
||
-2,+1,-1,+0,0,0x04, -2,+1,+0,-1,1,0x04, -2,+1,+0,+0,0,0x06,
|
||
-2,+1,+0,+1,0,0x02, -2,+2,+0,+0,1,0x04, -2,+2,+0,+1,0,0x04,
|
||
-1,-2,-1,+0,0,0x80, -1,-2,+0,-1,0,0x01, -1,-2,+1,-1,0,0x01,
|
||
-1,-2,+1,+0,1,0x01, -1,-1,-1,+1,0,0x88, -1,-1,+1,-2,0,0x40,
|
||
-1,-1,+1,-1,0,0x22, -1,-1,+1,+0,0,0x33, -1,-1,+1,+1,1,0x11,
|
||
-1,+0,-1,+2,0,0x08, -1,+0,+0,-1,0,0x44, -1,+0,+0,+1,0,0x11,
|
||
-1,+0,+1,-2,1,0x40, -1,+0,+1,-1,0,0x66, -1,+0,+1,+0,1,0x22,
|
||
-1,+0,+1,+1,0,0x33, -1,+0,+1,+2,1,0x10, -1,+1,+1,-1,1,0x44,
|
||
-1,+1,+1,+0,0,0x66, -1,+1,+1,+1,0,0x22, -1,+1,+1,+2,0,0x10,
|
||
-1,+2,+0,+1,0,0x04, -1,+2,+1,+0,1,0x04, -1,+2,+1,+1,0,0x04,
|
||
+0,-2,+0,+0,1,0x80, +0,-1,+0,+1,1,0x88, +0,-1,+1,-2,0,0x40,
|
||
+0,-1,+1,+0,0,0x11, +0,-1,+2,-2,0,0x40, +0,-1,+2,-1,0,0x20,
|
||
+0,-1,+2,+0,0,0x30, +0,-1,+2,+1,1,0x10, +0,+0,+0,+2,1,0x08,
|
||
+0,+0,+2,-2,1,0x40, +0,+0,+2,-1,0,0x60, +0,+0,+2,+0,1,0x20,
|
||
+0,+0,+2,+1,0,0x30, +0,+0,+2,+2,1,0x10, +0,+1,+1,+0,0,0x44,
|
||
+0,+1,+1,+2,0,0x10, +0,+1,+2,-1,1,0x40, +0,+1,+2,+0,0,0x60,
|
||
+0,+1,+2,+1,0,0x20, +0,+1,+2,+2,0,0x10, +1,-2,+1,+0,0,0x80,
|
||
+1,-1,+1,+1,0,0x88, +1,+0,+1,+2,0,0x08, +1,+0,+2,-1,0,0x40,
|
||
+1,+0,+2,+1,0,0x10
|
||
}, chood[] = { -1,-1, -1,0, -1,+1, 0,+1, +1,+1, +1,0, +1,-1, 0,-1 };
|
||
|
||
if (plistener) {
|
||
plistener->setProgressStr ("Demosaicing...");
|
||
plistener->setProgress (0.0);
|
||
}
|
||
|
||
ushort (*brow[5])[4], *pix;
|
||
int prow=7, pcol=1, *ip, *code[16][16], gval[8], gmin, gmax, sum[4];
|
||
int row, col, x, y, x1, x2, y1, y2, t, weight, grads, color, diag;
|
||
int g, diff, thold, num, c, width=W, height=H, colors=4;
|
||
ushort (*image)[4];
|
||
int lcode[16][16][32], shift, i, j;
|
||
|
||
image = (ushort (*)[4]) calloc (H*W, sizeof *image);
|
||
for (int ii=0; ii<H; ii++)
|
||
for (int jj=0; jj<W; jj++)
|
||
image[ii*W+jj][fc(ii,jj)] = rawData[ii][jj];
|
||
|
||
// first linear interpolation
|
||
for (row=0; row < 16; row++)
|
||
for (col=0; col < 16; col++) {
|
||
ip = lcode[row][col];
|
||
memset (sum, 0, sizeof sum);
|
||
for (y=-1; y <= 1; y++)
|
||
for (x=-1; x <= 1; x++) {
|
||
shift = (y==0) + (x==0);
|
||
if (shift == 2) continue;
|
||
color = fc(row+y,col+x);
|
||
*ip++ = (width*y + x)*4 + color;
|
||
*ip++ = shift;
|
||
*ip++ = color;
|
||
sum[color] += 1 << shift;
|
||
}
|
||
FORCC
|
||
if (c != fc(row,col)) {
|
||
*ip++ = c;
|
||
*ip++ = 256 / sum[c];
|
||
}
|
||
}
|
||
|
||
for (row=1; row < height-1; row++)
|
||
for (col=1; col < width-1; col++) {
|
||
pix = image[row*width+col];
|
||
ip = lcode[row & 15][col & 15];
|
||
memset (sum, 0, sizeof sum);
|
||
for (i=8; i--; ip+=3)
|
||
sum[ip[2]] += pix[ip[0]] << ip[1];
|
||
for (i=colors; --i; ip+=2)
|
||
pix[ip[0]] = sum[ip[0]] * ip[1] >> 8;
|
||
}
|
||
|
||
// lin_interpolate();
|
||
|
||
|
||
ip = (int *) calloc ((prow+1)*(pcol+1), 1280);
|
||
for (row=0; row <= prow; row++) /* Precalculate for VNG */
|
||
for (col=0; col <= pcol; col++) {
|
||
code[row][col] = ip;
|
||
for (cp=terms, t=0; t < 64; t++) {
|
||
y1 = *cp++; x1 = *cp++;
|
||
y2 = *cp++; x2 = *cp++;
|
||
weight = *cp++;
|
||
grads = *cp++;
|
||
color = fc(row+y1,col+x1);
|
||
if (fc(row+y2,col+x2) != color) continue;
|
||
diag = (fc(row,col+1) == color && fc(row+1,col) == color) ? 2:1;
|
||
if (abs(y1-y2) == diag && abs(x1-x2) == diag) continue;
|
||
*ip++ = (y1*width + x1)*4 + color;
|
||
*ip++ = (y2*width + x2)*4 + color;
|
||
*ip++ = weight;
|
||
for (g=0; g < 8; g++)
|
||
if (grads & 1<<g) *ip++ = g;
|
||
*ip++ = -1;
|
||
}
|
||
*ip++ = INT_MAX;
|
||
for (cp=chood, g=0; g < 8; g++) {
|
||
y = *cp++; x = *cp++;
|
||
*ip++ = (y*width + x) * 4;
|
||
color = fc(row,col);
|
||
if (fc(row+y,col+x) != color && fc(row+y*2,col+x*2) == color)
|
||
*ip++ = (y*width + x) * 8 + color;
|
||
else
|
||
*ip++ = 0;
|
||
}
|
||
}
|
||
brow[4] = (ushort (*)[4]) calloc (width*3, sizeof **brow);
|
||
for (row=0; row < 3; row++)
|
||
brow[row] = brow[4] + row*width;
|
||
for (row=2; row < height-2; row++) { /* Do VNG interpolation */
|
||
for (col=2; col < width-2; col++) {
|
||
color = fc(row,col);
|
||
pix = image[row*width+col];
|
||
ip = code[row & prow][col & pcol];
|
||
memset (gval, 0, sizeof gval);
|
||
while ((g = ip[0]) != INT_MAX) { /* Calculate gradients */
|
||
diff = ABS(pix[g] - pix[ip[1]]) << ip[2];
|
||
gval[ip[3]] += diff;
|
||
ip += 5;
|
||
if ((g = ip[-1]) == -1) continue;
|
||
gval[g] += diff;
|
||
while ((g = *ip++) != -1)
|
||
gval[g] += diff;
|
||
}
|
||
ip++;
|
||
gmin = gmax = gval[0]; /* Choose a threshold */
|
||
for (g=1; g < 8; g++) {
|
||
if (gmin > gval[g]) gmin = gval[g];
|
||
if (gmax < gval[g]) gmax = gval[g];
|
||
}
|
||
if (gmax == 0) {
|
||
memcpy (brow[2][col], pix, sizeof *image);
|
||
continue;
|
||
}
|
||
thold = gmin + (gmax >> 1);
|
||
memset (sum, 0, sizeof sum);
|
||
for (num=g=0; g < 8; g++,ip+=2) { /* Average the neighbors */
|
||
if (gval[g] <= thold) {
|
||
FORCC
|
||
if (c == color && ip[1])
|
||
sum[c] += (pix[c] + pix[ip[1]]) >> 1;
|
||
else
|
||
sum[c] += pix[ip[0] + c];
|
||
num++;
|
||
}
|
||
}
|
||
FORCC { /* Save to buffer */
|
||
t = pix[color];
|
||
if (c != color)
|
||
t += (sum[c] - sum[color]) / num;
|
||
brow[2][col][c] = CLIP(t);
|
||
}
|
||
}
|
||
if (row > 3) /* Write buffer to image */
|
||
memcpy (image[(row-2)*width+2], brow[0]+2, (width-4)*sizeof *image);
|
||
for (g=0; g < 4; g++)
|
||
brow[(g-1) & 3] = brow[g];
|
||
if (!(row%20) && plistener)
|
||
plistener->setProgress ((double)row / (H-2));
|
||
}
|
||
memcpy (image[(row-2)*width+2], brow[0]+2, (width-4)*sizeof *image);
|
||
memcpy (image[(row-1)*width+2], brow[1]+2, (width-4)*sizeof *image);
|
||
free (brow[4]);
|
||
free (code[0][0]);
|
||
|
||
for (int i=0; i<H; i++) {
|
||
for (int j=0; j<W; j++)
|
||
green[i][j] = (image[i*W+j][1] + image[i*W+j][3]) >> 1;
|
||
}
|
||
// Interpolate R and B
|
||
for (int i=0; i<H; i++) {
|
||
if (i==0)
|
||
// rm, gm, bm must be recovered
|
||
//interpolate_row_rb_mul_pp (red, blue, NULL, green[i], green[i+1], i, rm, gm, bm, 0, W, 1);
|
||
interpolate_row_rb_mul_pp (red[i], blue[i], NULL, green[i], green[i+1], i, 1.0, 1.0, 1.0, 0, W, 1);
|
||
else if (i==H-1)
|
||
interpolate_row_rb_mul_pp (red[i], blue[i], green[i-1], green[i], NULL, i, 1.0, 1.0, 1.0, 0, W, 1);
|
||
else
|
||
interpolate_row_rb_mul_pp (red[i], blue[i], green[i-1], green[i], green[i+1], i, 1.0, 1.0, 1.0, 0, W, 1);
|
||
}
|
||
free (image);
|
||
}
|
||
|
||
|
||
#undef fc
|
||
#define fc(row,col) \
|
||
(ri->get_filters() >> ((((row) << 1 & 14) + ((col) & 1)) << 1) & 3)
|
||
#define LIM(x,min,max) MAX(min,MIN(x,max))
|
||
#define ULIM(x,y,z) ((y) < (z) ? LIM(x,y,z) : LIM(x,z,y))
|
||
|
||
void RawImageSource::border_interpolate(int border, ushort (*image)[4], int start, int end)
|
||
{
|
||
unsigned row, col, y, x, f, c, sum[8];
|
||
int width=W, height=H;
|
||
int colors = 3;
|
||
|
||
if (end == 0 )end = H;
|
||
for (row=start; row < end; row++)
|
||
for (col=0; col < width; col++) {
|
||
if (col==border && row >= border && row < height-border)
|
||
col = width-border;
|
||
memset (sum, 0, sizeof sum);
|
||
for (y=row-1; y != row+2; y++)
|
||
for (x=col-1; x != col+2; x++)
|
||
if (y < height && x < width) {
|
||
f = fc(y,x);
|
||
sum[f] += image[y*width+x][f];
|
||
sum[f+4]++;
|
||
}
|
||
f = fc(row,col);
|
||
FORCC if (c != f && sum[c+4])
|
||
image[row*width+col][c] = sum[c] / sum[c+4];
|
||
}
|
||
}
|
||
|
||
/*
|
||
Adaptive Homogeneity-Directed interpolation is based on
|
||
the work of Keigo Hirakawa, Thomas Parks, and Paul Lee.
|
||
*/
|
||
#define TS 256 /* Tile Size */
|
||
#define FORC(cnt) for (c=0; c < cnt; c++)
|
||
#define FORC3 FORC(3)
|
||
#define SQR(x) ((x)*(x))
|
||
|
||
void RawImageSource::ahd_demosaic(int winx, int winy, int winw, int winh)
|
||
{
|
||
int i, j, k, top, left, row, col, tr, tc, c, d, val, hm[2];
|
||
ushort (*pix)[4], (*rix)[3];
|
||
static const int dir[4] = { -1, 1, -TS, TS };
|
||
unsigned ldiff[2][4], abdiff[2][4], leps, abeps;
|
||
float r, cbrt[0x10000], xyz[3], xyz_cam[3][4];
|
||
ushort (*rgb)[TS][TS][3];
|
||
short (*lab)[TS][TS][3], (*lix)[3];
|
||
char (*homo)[TS][TS], *buffer;
|
||
|
||
int width=W, height=H;
|
||
ushort (*image)[4];
|
||
int colors = 3;
|
||
|
||
const double xyz_rgb[3][3] = { /* XYZ from RGB */
|
||
{ 0.412453, 0.357580, 0.180423 },
|
||
{ 0.212671, 0.715160, 0.072169 },
|
||
{ 0.019334, 0.119193, 0.950227 }
|
||
};
|
||
|
||
const float d65_white[3] = { 0.950456, 1, 1.088754 };
|
||
|
||
if (plistener) {
|
||
plistener->setProgressStr ("Demosaicing...");
|
||
plistener->setProgress (0.0);
|
||
}
|
||
|
||
image = (ushort (*)[4]) calloc (H*W, sizeof *image);
|
||
for (int ii=0; ii<H; ii++)
|
||
for (int jj=0; jj<W; jj++)
|
||
image[ii*W+jj][fc(ii,jj)] = rawData[ii][jj];
|
||
|
||
for (i=0; i < 0x10000; i++) {
|
||
r = i / 65535.0;
|
||
cbrt[i] = r > 0.008856 ? pow(r,1/3.0) : 7.787*r + 16/116.0;
|
||
}
|
||
|
||
for (i=0; i < 3; i++)
|
||
for (j=0; j < colors; j++)
|
||
for (xyz_cam[i][j] = k=0; k < 3; k++)
|
||
xyz_cam[i][j] += xyz_rgb[i][k] * coeff[k][j] / d65_white[i];
|
||
|
||
border_interpolate(5, image);
|
||
buffer = (char *) malloc (26*TS*TS); /* 1664 kB */
|
||
//merror (buffer, "ahd_interpolate()");
|
||
rgb = (ushort(*)[TS][TS][3]) buffer;
|
||
lab = (short (*)[TS][TS][3])(buffer + 12*TS*TS);
|
||
homo = (char (*)[TS][TS]) (buffer + 24*TS*TS);
|
||
|
||
// helper variables for progress indication
|
||
int n_tiles = ((height-7 + (TS-7))/(TS-6)) * ((width-7 + (TS-7))/(TS-6));
|
||
int tile = 0;
|
||
|
||
for (top=2; top < height-5; top += TS-6)
|
||
for (left=2; left < width-5; left += TS-6) {
|
||
|
||
/* Interpolate green horizontally and vertically: */
|
||
for (row = top; row < top+TS && row < height-2; row++) {
|
||
col = left + (FC(row,left) & 1);
|
||
for (c = FC(row,col); col < left+TS && col < width-2; col+=2) {
|
||
pix = image + row*width+col;
|
||
val = ((pix[-1][1] + pix[0][c] + pix[1][1]) * 2
|
||
- pix[-2][c] - pix[2][c]) >> 2;
|
||
rgb[0][row-top][col-left][1] = ULIM(val,pix[-1][1],pix[1][1]);
|
||
val = ((pix[-width][1] + pix[0][c] + pix[width][1]) * 2
|
||
- pix[-2*width][c] - pix[2*width][c]) >> 2;
|
||
rgb[1][row-top][col-left][1] = ULIM(val,pix[-width][1],pix[width][1]);
|
||
}
|
||
}
|
||
|
||
/* Interpolate red and blue, and convert to CIELab: */
|
||
for (d=0; d < 2; d++)
|
||
for (row=top+1; row < top+TS-1 && row < height-3; row++)
|
||
for (col=left+1; col < left+TS-1 && col < width-3; col++) {
|
||
pix = image + row*width+col;
|
||
rix = &rgb[d][row-top][col-left];
|
||
lix = &lab[d][row-top][col-left];
|
||
if ((c = 2 - FC(row,col)) == 1) {
|
||
c = FC(row+1,col);
|
||
val = pix[0][1] + (( pix[-1][2-c] + pix[1][2-c]
|
||
- rix[-1][1] - rix[1][1] ) >> 1);
|
||
rix[0][2-c] = CLIP(val);
|
||
val = pix[0][1] + (( pix[-width][c] + pix[width][c]
|
||
- rix[-TS][1] - rix[TS][1] ) >> 1);
|
||
} else
|
||
val = rix[0][1] + (( pix[-width-1][c] + pix[-width+1][c]
|
||
+ pix[+width-1][c] + pix[+width+1][c]
|
||
- rix[-TS-1][1] - rix[-TS+1][1]
|
||
- rix[+TS-1][1] - rix[+TS+1][1] + 1) >> 2);
|
||
rix[0][c] = CLIP(val);
|
||
c = FC(row,col);
|
||
rix[0][c] = pix[0][c];
|
||
xyz[0] = xyz[1] = xyz[2] = 0.5;
|
||
FORCC {
|
||
xyz[0] += xyz_cam[0][c] * rix[0][c];
|
||
xyz[1] += xyz_cam[1][c] * rix[0][c];
|
||
xyz[2] += xyz_cam[2][c] * rix[0][c];
|
||
}
|
||
xyz[0] = cbrt[CLIP((int) xyz[0])];
|
||
xyz[1] = cbrt[CLIP((int) xyz[1])];
|
||
xyz[2] = cbrt[CLIP((int) xyz[2])];
|
||
lix[0][0] = 64 * (116 * xyz[1] - 16);
|
||
lix[0][1] = 64 * 500 * (xyz[0] - xyz[1]);
|
||
lix[0][2] = 64 * 200 * (xyz[1] - xyz[2]);
|
||
}
|
||
|
||
/* Build homogeneity maps from the CIELab images: */
|
||
memset (homo, 0, 2*TS*TS);
|
||
for (row=top+2; row < top+TS-2 && row < height-4; row++) {
|
||
tr = row-top;
|
||
for (col=left+2; col < left+TS-2 && col < width-4; col++) {
|
||
tc = col-left;
|
||
for (d=0; d < 2; d++) {
|
||
lix = &lab[d][tr][tc];
|
||
for (i=0; i < 4; i++) {
|
||
ldiff[d][i] = ABS(lix[0][0]-lix[dir[i]][0]);
|
||
abdiff[d][i] = SQR(lix[0][1]-lix[dir[i]][1])
|
||
+ SQR(lix[0][2]-lix[dir[i]][2]);
|
||
}
|
||
}
|
||
leps = MIN(MAX(ldiff[0][0],ldiff[0][1]),
|
||
MAX(ldiff[1][2],ldiff[1][3]));
|
||
abeps = MIN(MAX(abdiff[0][0],abdiff[0][1]),
|
||
MAX(abdiff[1][2],abdiff[1][3]));
|
||
for (d=0; d < 2; d++)
|
||
for (i=0; i < 4; i++)
|
||
if (ldiff[d][i] <= leps && abdiff[d][i] <= abeps)
|
||
homo[d][tr][tc]++;
|
||
}
|
||
}
|
||
|
||
/* Combine the most homogenous pixels for the final result: */
|
||
for (row=top+3; row < top+TS-3 && row < height-5; row++) {
|
||
tr = row-top;
|
||
for (col=left+3; col < left+TS-3 && col < width-5; col++) {
|
||
tc = col-left;
|
||
for (d=0; d < 2; d++)
|
||
for (hm[d]=0, i=tr-1; i <= tr+1; i++)
|
||
for (j=tc-1; j <= tc+1; j++)
|
||
hm[d] += homo[d][i][j];
|
||
if (hm[0] != hm[1])
|
||
FORC3 image[row*width+col][c] = rgb[hm[1] > hm[0]][tr][tc][c];
|
||
else
|
||
FORC3 image[row*width+col][c] =
|
||
(rgb[0][tr][tc][c] + rgb[1][tr][tc][c]) >> 1;
|
||
}
|
||
}
|
||
|
||
tile++;
|
||
if(plistener) {
|
||
plistener->setProgress((double)tile / n_tiles);
|
||
}
|
||
}
|
||
|
||
if(plistener) plistener->setProgress (1.0);
|
||
free (buffer);
|
||
for (int i=0; i<H; i++) {
|
||
for (int j=0; j<W; j++){
|
||
red[i][j] = image[i*W+j][0];
|
||
green[i][j] = image[i*W+j][1];
|
||
blue[i][j] = image[i*W+j][2];
|
||
}
|
||
}
|
||
|
||
free (image);
|
||
}
|
||
#undef TS
|
||
|
||
void RawImageSource::nodemosaic()
|
||
{
|
||
red = new unsigned short*[H];
|
||
green = new unsigned short*[H];
|
||
blue = new unsigned short*[H];
|
||
for (int i=0; i<H; i++) {
|
||
red[i] = new unsigned short[W];
|
||
green[i] = new unsigned short[W];
|
||
blue[i] = new unsigned short[W];
|
||
for (int j=0; j<W; j++){
|
||
switch( FC(i,j)){
|
||
case 0: red[i][j] = rawData[i][j]; break;
|
||
case 1: green[i][j] = rawData[i][j]; break;
|
||
case 2: blue[i][j] = rawData[i][j]; break;
|
||
}
|
||
}
|
||
}
|
||
}
|
||
|
||
/*
|
||
* Redistribution and use in source and binary forms, with or without
|
||
* modification, are permitted provided that the following conditions are
|
||
* met:
|
||
*
|
||
* * Redistributions of source code must retain the above copyright
|
||
* notice, this list of conditions and the following disclaimer.
|
||
* * Redistributions in binary form must reproduce the above
|
||
* copyright notice, this list of conditions and the following disclaimer
|
||
* in the documentation and/or other materials provided with the
|
||
* distribution.
|
||
* * Neither the name of the author nor the names of its
|
||
* contributors may be used to endorse or promote products derived from
|
||
* this software without specific prior written permission.
|
||
*
|
||
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
||
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
||
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR
|
||
* A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT
|
||
* OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,
|
||
* SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT
|
||
* LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
|
||
* DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
|
||
* THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
|
||
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
|
||
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
|
||
*/
|
||
|
||
// If you want to use the code, you need to display name of the original authors in
|
||
// your software!
|
||
|
||
/* DCB demosaicing by Jacek Gozdz (cuniek@kft.umcs.lublin.pl)
|
||
* the code is open source (BSD licence)
|
||
*/
|
||
|
||
#define TILESIZE 256
|
||
#define TILEBORDER 10
|
||
#define CACHESIZE (TILESIZE+2*TILEBORDER)
|
||
|
||
inline void RawImageSource::dcb_initTileLimits(int &colMin, int &rowMin, int &colMax, int &rowMax, int x0, int y0, int border)
|
||
{
|
||
rowMin = border;
|
||
colMin = border;
|
||
rowMax = CACHESIZE-border;
|
||
colMax = CACHESIZE-border;
|
||
if(!y0 ) rowMin = TILEBORDER+border;
|
||
if(!x0 ) colMin = TILEBORDER+border;
|
||
if( y0+TILESIZE+TILEBORDER >= H-border) rowMax = TILEBORDER+H-border-y0;
|
||
if( x0+TILESIZE+TILEBORDER >= W-border) colMax = TILEBORDER+W-border-x0;
|
||
}
|
||
|
||
void RawImageSource::fill_raw( ushort (*cache )[4], int x0, int y0, ushort** rawData)
|
||
{
|
||
int rowMin,colMin,rowMax,colMax;
|
||
dcb_initTileLimits(colMin,rowMin,colMax,rowMax,x0,y0,0);
|
||
|
||
for (int row=rowMin,y=y0-TILEBORDER+rowMin; row<rowMax; row++,y++)
|
||
for (int col=colMin,x=x0-TILEBORDER+colMin,indx=row*CACHESIZE+col; col<colMax; col++,x++,indx++){
|
||
cache[indx][fc(y,x)] = rawData[y][x];
|
||
}
|
||
}
|
||
|
||
void RawImageSource::fill_border( ushort (*cache )[4], int border, int x0, int y0)
|
||
{
|
||
unsigned row, col, y, x, f, c, sum[8];
|
||
int colors = 3;
|
||
|
||
for (row = y0; row < y0+TILESIZE+TILEBORDER && row<H; row++){
|
||
for (col = x0; col < x0+TILESIZE+TILEBORDER && col<W; col++) {
|
||
if (col >= border && col < W - border && row >= border && row < H - border){
|
||
col = W - border;
|
||
if(col >= x0+TILESIZE+TILEBORDER )
|
||
break;
|
||
}
|
||
memset(sum, 0, sizeof sum);
|
||
for (y = row - 1; y != row + 2; y++)
|
||
for (x = col - 1; x != col + 2; x++)
|
||
if (y < H && y< y0+TILESIZE+TILEBORDER && x < W && x<x0+TILESIZE+TILEBORDER) {
|
||
f = fc(y,x);
|
||
sum[f] += cache[(y-y0 +TILEBORDER)* CACHESIZE +TILEBORDER+ x-x0][f];
|
||
sum[f + 4]++;
|
||
}
|
||
f = fc(row,col);
|
||
FORCC
|
||
if (c != f && sum[c + 4])
|
||
cache[(row-y0+TILEBORDER) * CACHESIZE +TILEBORDER + col-x0][c] = sum[c] / sum[c + 4];
|
||
}
|
||
}
|
||
}
|
||
// saves red and blue
|
||
void RawImageSource::copy_to_buffer( ushort (*buffer)[3], ushort (*image)[4])
|
||
{
|
||
for (int indx=0; indx < CACHESIZE*CACHESIZE; indx++) {
|
||
buffer[indx][0]=image[indx][0]; //R
|
||
buffer[indx][2]=image[indx][2]; //B
|
||
}
|
||
}
|
||
|
||
// restores red and blue
|
||
void RawImageSource::restore_from_buffer(ushort (*image)[4], ushort (*buffer)[3])
|
||
{
|
||
for (int indx=0; indx < CACHESIZE*CACHESIZE; indx++) {
|
||
image[indx][0]=buffer[indx][0]; //R
|
||
image[indx][2]=buffer[indx][2]; //B
|
||
}
|
||
}
|
||
|
||
// First pass green interpolation
|
||
void RawImageSource::dcb_hid(ushort (*image)[4],ushort (*bufferH)[3], ushort (*bufferV)[3], int x0, int y0)
|
||
{
|
||
const int u=CACHESIZE, v=2*CACHESIZE;
|
||
int rowMin,colMin,rowMax,colMax;
|
||
dcb_initTileLimits(colMin,rowMin,colMax,rowMax,x0,y0,2);
|
||
|
||
// green pixels
|
||
for (int row = rowMin; row < rowMax; row++) {
|
||
for (int col = colMin+(FC(y0-TILEBORDER+row,x0-TILEBORDER+colMin)&1),indx=row*CACHESIZE+col,c=FC(y0-TILEBORDER+row,x0-TILEBORDER+col); col < colMax; col+=2, indx+=2) {
|
||
int current = ( image[indx-1][1] + image[indx+1][1])/2;
|
||
bufferH[indx][1] = CLIP(current);
|
||
current = (image[indx+u][1] + image[indx-u][1])/2;
|
||
bufferV[indx][1] = CLIP(current);
|
||
}
|
||
}
|
||
// red in blue pixel, blue in red pixel
|
||
for (int row=rowMin; row < rowMax; row++)
|
||
for (int col=colMin+(FC(y0-TILEBORDER+row,x0-TILEBORDER+colMin) & 1), indx=row*CACHESIZE+col, c=2-FC(y0-TILEBORDER+row,x0-TILEBORDER+col); col < colMax; col+=2, indx+=2) {
|
||
int current = ( 4*bufferH[indx][1]
|
||
- bufferH[indx+u+1][1] - bufferH[indx+u-1][1] - bufferH[indx-u+1][1] - bufferH[indx-u-1][1]
|
||
+ image[indx+u+1][c] + image[indx+u-1][c] + image[indx-u+1][c] + image[indx-u-1][c] )/4;
|
||
bufferH[indx][c] = CLIP(current);
|
||
current = ( 4*bufferV[indx][1]
|
||
- bufferV[indx+u+1][1] - bufferV[indx+u-1][1] - bufferV[indx-u+1][1] - bufferV[indx-u-1][1]
|
||
+ image[indx+u+1][c] + image[indx+u-1][c] + image[indx-u+1][c] + image[indx-u-1][c] )/4;
|
||
bufferV[indx][c] = CLIP(current);
|
||
|
||
}
|
||
|
||
// red or blue in green pixels
|
||
for (int row=rowMin; row<rowMax; row++)
|
||
for (int col=colMin+(FC(y0-TILEBORDER+row,x0-TILEBORDER+colMin+1)&1), indx=row*CACHESIZE+col,c=FC(y0-TILEBORDER+row,x0-TILEBORDER+col+1),d=2-c; col<colMax; col+=2, indx+=2) {
|
||
int current = ( image[indx+1][c] + image[indx-1][c])/2;
|
||
bufferH[indx][c] = CLIP( current );
|
||
current = (2*bufferH[indx][1] - bufferH[indx+u][1] - bufferH[indx-u][1] + image[indx+u][d] + image[indx-u][d])/2;
|
||
bufferH[indx][d] = CLIP( current );
|
||
current = (2*bufferV[indx][1] - bufferV[indx+1][1] - bufferV[indx-1][1] + image[indx+1][c] + image[indx-1][c])/2;
|
||
bufferV[indx][c] = CLIP( current );
|
||
current = (image[indx+u][d] + image[indx-u][d])/2;
|
||
bufferV[indx][d] = CLIP( current );
|
||
}
|
||
|
||
// Decide green pixels
|
||
for (int row = rowMin; row < rowMax; row++)
|
||
for (int col = colMin+(FC(y0-TILEBORDER+row,x0-TILEBORDER+colMin)&1),indx=row*CACHESIZE+col,c=FC(y0-TILEBORDER+row,x0-TILEBORDER+col),d=2-c; col < colMax; col+=2, indx+=2) {
|
||
int current = MAX(image[indx+v][c], MAX(image[indx-v][c], MAX(image[indx-2][c], image[indx+2][c]))) -
|
||
MIN(image[indx+v][c], MIN(image[indx-v][c], MIN(image[indx-2][c], image[indx+2][c]))) +
|
||
MAX(image[indx+1+u][d], MAX(image[indx+1-u][d], MAX(image[indx-1+u][d], image[indx-1-u][d]))) -
|
||
MIN(image[indx+1+u][d], MIN(image[indx+1-u][d], MIN(image[indx-1+u][d], image[indx-1-u][d])));
|
||
|
||
int currentH = MAX(bufferH[indx+v][d], MAX(bufferH[indx-v][d], MAX(bufferH[indx-2][d], bufferH[indx+2][d]))) -
|
||
MIN(bufferH[indx+v][d], MIN(bufferH[indx-v][d], MIN(bufferH[indx-2][d], bufferH[indx+2][d]))) +
|
||
MAX(bufferH[indx+1+u][c], MAX(bufferH[indx+1-u][c], MAX(bufferH[indx-1+u][c], bufferH[indx-1-u][c]))) -
|
||
MIN(bufferH[indx+1+u][c], MIN(bufferH[indx+1-u][c], MIN(bufferH[indx-1+u][c], bufferH[indx-1-u][c])));
|
||
|
||
int currentV = MAX(bufferV[indx+v][d], MAX(bufferV[indx-v][d], MAX(bufferV[indx-2][d], bufferV[indx+2][d]))) -
|
||
MIN(bufferV[indx+v][d], MIN(bufferV[indx-v][d], MIN(bufferV[indx-2][d], bufferV[indx+2][d]))) +
|
||
MAX(bufferV[indx+1+u][c], MAX(bufferV[indx+1-u][c], MAX(bufferV[indx-1+u][c], bufferV[indx-1-u][c]))) -
|
||
MIN(bufferV[indx+1+u][c], MIN(bufferV[indx+1-u][c], MIN(bufferV[indx-1+u][c], bufferV[indx-1-u][c])));
|
||
|
||
if (ABS(current-currentH) < ABS(current-currentV))
|
||
image[indx][1] = bufferH[indx][1];
|
||
else
|
||
image[indx][1] = bufferV[indx][1];
|
||
}
|
||
|
||
}
|
||
|
||
|
||
// missing colors are interpolated
|
||
void RawImageSource::dcb_color(ushort (*image)[4], int x0, int y0)
|
||
{
|
||
const int u=CACHESIZE;
|
||
int rowMin,colMin,rowMax,colMax;
|
||
dcb_initTileLimits(colMin,rowMin,colMax,rowMax,x0,y0,1);
|
||
|
||
// red in blue pixel, blue in red pixel
|
||
for (int row=rowMin; row < rowMax; row++)
|
||
for (int col=colMin+(FC(y0-TILEBORDER+row,x0-TILEBORDER+colMin) & 1), indx=row*CACHESIZE+col, c=2-FC(y0-TILEBORDER+row,x0-TILEBORDER+col); col < colMax; col+=2, indx+=2) {
|
||
int current = ( 4*image[indx][1]
|
||
- image[indx+u+1][1] - image[indx+u-1][1] - image[indx-u+1][1] - image[indx-u-1][1]
|
||
+ image[indx+u+1][c] + image[indx+u-1][c] + image[indx-u+1][c] + image[indx-u-1][c] )/4;
|
||
image[indx][c] = CLIP(current);
|
||
}
|
||
|
||
// red or blue in green pixels
|
||
for (int row=rowMin; row<rowMax; row++)
|
||
for (int col=colMin+(FC(y0-TILEBORDER+row,x0-TILEBORDER+colMin+1)&1), indx=row*CACHESIZE+col,c=FC(y0-TILEBORDER+row,x0-TILEBORDER+col+1),d=2-c; col<colMax; col+=2, indx+=2) {
|
||
int current = (2*image[indx][1] - image[indx+1][1] - image[indx-1][1] + image[indx+1][c] + image[indx-1][c])/2;
|
||
image[indx][c] = CLIP( current );
|
||
current = (2*image[indx][1] - image[indx+u][1] - image[indx-u][1] + image[indx+u][d] + image[indx-u][d])/2;
|
||
image[indx][d] = CLIP( current );
|
||
}
|
||
}
|
||
|
||
// green correction
|
||
void RawImageSource::dcb_hid2(ushort (*image)[4], int x0, int y0)
|
||
{
|
||
const int u=CACHESIZE, v=2*CACHESIZE;
|
||
int rowMin,colMin,rowMax,colMax;
|
||
dcb_initTileLimits(colMin,rowMin,colMax,rowMax,x0,y0,2);
|
||
|
||
for (int row=rowMin; row < rowMax; row++) {
|
||
for (int col = colMin+(FC(y0-TILEBORDER+row,x0-TILEBORDER+colMin)&1),indx=row*CACHESIZE+col,c=FC(y0-TILEBORDER+row,x0-TILEBORDER+col); col < colMax; col+=2, indx+=2) {
|
||
int current = (image[indx+v][1] + image[indx-v][1] + image[indx-2][1] + image[indx+2][1])/4 +
|
||
image[indx][c] - ( image[indx+v][c] + image[indx-v][c] + image[indx-2][c] + image[indx+2][c])/4;
|
||
image[indx][1]=CLIP(current);
|
||
}
|
||
}
|
||
}
|
||
|
||
// green is used to create
|
||
// an interpolation direction map
|
||
// 1 = vertical
|
||
// 0 = horizontal
|
||
// saved in image[][3]
|
||
void RawImageSource::dcb_map(ushort (*image)[4], int x0, int y0)
|
||
{
|
||
const int u=4*CACHESIZE;
|
||
int rowMin,colMin,rowMax,colMax;
|
||
dcb_initTileLimits(colMin,rowMin,colMax,rowMax,x0,y0,2);
|
||
|
||
for (int row=rowMin; row < rowMax; row++) {
|
||
for (int col=colMin, indx=row*CACHESIZE+col; col < colMax; col++, indx++) {
|
||
ushort *pix = &(image[indx][1]);
|
||
if ( *pix > ( pix[-4] + pix[+4] + pix[-u] + pix[+u])/4 )
|
||
image[indx][3] = ((MIN( pix[-4], pix[+4]) + pix[-4] + pix[+4] ) < (MIN( pix[-u], pix[+u]) + pix[-u] + pix[+u]));
|
||
else
|
||
image[indx][3] = ((MAX( pix[-4], pix[+4]) + pix[-4] + pix[+4] ) > (MAX( pix[-u], pix[+u]) + pix[-u] + pix[+u]));
|
||
}
|
||
}
|
||
}
|
||
|
||
|
||
// interpolated green pixels are corrected using the map
|
||
void RawImageSource::dcb_correction(ushort (*image)[4], int x0, int y0)
|
||
{
|
||
const int u=CACHESIZE, v=2*CACHESIZE;
|
||
int rowMin,colMin,rowMax,colMax;
|
||
dcb_initTileLimits(colMin,rowMin,colMax,rowMax,x0,y0,2);
|
||
|
||
for (int row=rowMin; row < rowMax; row++) {
|
||
for (int col = colMin+(FC(y0-TILEBORDER+row,x0-TILEBORDER+colMin)&1),indx=row*CACHESIZE+col,c=FC(y0-TILEBORDER+row,x0-TILEBORDER+col); col < colMax; col+=2, indx+=2) {
|
||
int current = 4*image[indx][3] +
|
||
2*(image[indx+u][3] + image[indx-u][3] + image[indx+1][3] + image[indx-1][3]) +
|
||
image[indx+v][3] + image[indx-v][3] + image[indx+2][3] + image[indx-2][3];
|
||
image[indx][1] = ((16-current)*(image[indx-1][1] + image[indx+1][1])/2 + current*(image[indx-u][1] + image[indx+u][1])/2)/16;
|
||
}
|
||
}
|
||
}
|
||
|
||
// R and B smoothing using green contrast, all pixels except 2 pixel wide border
|
||
void RawImageSource::dcb_pp(ushort (*image)[4], int x0, int y0)
|
||
{
|
||
const int u=CACHESIZE;
|
||
int rowMin,colMin,rowMax,colMax;
|
||
dcb_initTileLimits(colMin,rowMin,colMax,rowMax,x0,y0,2);
|
||
|
||
for (int row=rowMin; row < rowMax; row++)
|
||
for (int col=colMin, indx=row*CACHESIZE+col; col < colMax; col++, indx++) {
|
||
//int r1 = ( image[indx-1][0] + image[indx+1][0] + image[indx-u][0] + image[indx+u][0] + image[indx-u-1][0] + image[indx+u+1][0] + image[indx-u+1][0] + image[indx+u-1][0])/8;
|
||
//int g1 = ( image[indx-1][1] + image[indx+1][1] + image[indx-u][1] + image[indx+u][1] + image[indx-u-1][1] + image[indx+u+1][1] + image[indx-u+1][1] + image[indx+u-1][1])/8;
|
||
//int b1 = ( image[indx-1][2] + image[indx+1][2] + image[indx-u][2] + image[indx+u][2] + image[indx-u-1][2] + image[indx+u+1][2] + image[indx-u+1][2] + image[indx+u-1][2])/8;
|
||
ushort (*pix)[4] = image+(indx-u-1);
|
||
int r1 = (*pix)[0];
|
||
int g1 = (*pix)[1];
|
||
int b1 = (*pix)[2];
|
||
pix++;
|
||
r1 += (*pix)[0];
|
||
g1 += (*pix)[1];
|
||
b1 += (*pix)[2];
|
||
pix++;
|
||
r1 += (*pix)[0];
|
||
g1 += (*pix)[1];
|
||
b1 += (*pix)[2];
|
||
pix+=CACHESIZE-2;
|
||
r1 += (*pix)[0];
|
||
g1 += (*pix)[1];
|
||
b1 += (*pix)[2];
|
||
pix+=2;
|
||
r1 += (*pix)[0];
|
||
g1 += (*pix)[1];
|
||
b1 += (*pix)[2];
|
||
pix+=CACHESIZE-2;
|
||
r1 += (*pix)[0];
|
||
g1 += (*pix)[1];
|
||
b1 += (*pix)[2];
|
||
pix++;
|
||
r1 += (*pix)[0];
|
||
g1 += (*pix)[1];
|
||
b1 += (*pix)[2];
|
||
pix++;
|
||
r1 += (*pix)[0];
|
||
g1 += (*pix)[1];
|
||
b1 += (*pix)[2];
|
||
r1 /=8;
|
||
g1 /=8;
|
||
b1 /=8;
|
||
r1 = r1 + ( image[indx][1] - g1 );
|
||
b1 = b1 + ( image[indx][1] - g1 );
|
||
image[indx][0] = CLIP(r1);
|
||
image[indx][2] = CLIP(b1);
|
||
}
|
||
}
|
||
|
||
// interpolated green pixels are corrected using the map
|
||
// with correction
|
||
void RawImageSource::dcb_correction2(ushort (*image)[4], int x0, int y0)
|
||
{
|
||
const int u=CACHESIZE, v=2*CACHESIZE;
|
||
int rowMin,colMin,rowMax,colMax;
|
||
dcb_initTileLimits(colMin,rowMin,colMax,rowMax,x0,y0,4);
|
||
|
||
for (int row=rowMin; row < rowMax; row++) {
|
||
for (int col = colMin+(FC(y0-TILEBORDER+row,x0-TILEBORDER+colMin)&1),indx=row*CACHESIZE+col,c=FC(y0-TILEBORDER+row,x0-TILEBORDER+col); col < colMax; col+=2, indx+=2) {
|
||
int current = 4*image[indx][3] +
|
||
2*(image[indx+u][3] + image[indx-u][3] + image[indx+1][3] + image[indx-1][3]) +
|
||
image[indx+v][3] + image[indx-v][3] + image[indx+2][3] + image[indx-2][3];
|
||
current = ((16-current)*((image[indx-1][1] + image[indx+1][1])/2 + image[indx][c] - (image[indx+2][c] + image[indx-2][c])/2) + current*((image[indx-u][1] + image[indx+u][1])/2 + image[indx][c] - (image[indx+v][c] + image[indx-v][c])/2))/16;
|
||
image[indx][1] = CLIP(current);
|
||
}
|
||
}
|
||
}
|
||
|
||
// image refinement
|
||
void RawImageSource::dcb_refinement(ushort (*image)[4], int x0, int y0)
|
||
{
|
||
const int u=CACHESIZE, v=2*CACHESIZE, w=3*CACHESIZE;
|
||
int rowMin,colMin,rowMax,colMax;
|
||
dcb_initTileLimits(colMin,rowMin,colMax,rowMax,x0,y0,4);
|
||
|
||
float f[5],g1,g2;
|
||
|
||
for (int row=rowMin; row < rowMax; row++)
|
||
for (int col=colMin+(FC(y0-TILEBORDER+row,x0-TILEBORDER+colMin)&1),indx=row*CACHESIZE+col,c=FC(y0-TILEBORDER+row,x0-TILEBORDER+col); col < colMax; col+=2,indx+=2){
|
||
int current = 4*image[indx][3] +
|
||
2*(image[indx+u][3] + image[indx-u][3] + image[indx+1][3] + image[indx-1][3])
|
||
+image[indx+v][3] + image[indx-v][3] + image[indx-2][3] + image[indx+2][3];
|
||
|
||
f[0] = (float)(image[indx-u][1] + image[indx+u][1])/(2 + 2*image[indx][c]);
|
||
f[1] = 2*(float)image[indx-u][1]/(2 + image[indx-v][c] + image[indx][c]);
|
||
f[2] = (float)(image[indx-u][1] + image[indx-w][1])/(2 + 2*image[indx-v][c]);
|
||
f[3] = 2*(float)image[indx+u][1]/(2 + image[indx+v][c] + image[indx][c]);
|
||
f[4] = (float)(image[indx+u][1] + image[indx+w][1])/(2 + 2*image[indx+v][c]);
|
||
|
||
g1 = (f[0] + f[1] + f[2] + f[3] + f[4] - MAX(f[1], MAX(f[2], MAX(f[3], f[4]))) - MIN(f[1], MIN(f[2], MIN(f[3], f[4]))))/3.0;
|
||
|
||
f[0] = (float)(image[indx-1][1] + image[indx+1][1])/(2 + 2*image[indx][c]);
|
||
f[1] = 2*(float)image[indx-1][1]/(2 + image[indx-2][c] + image[indx][c]);
|
||
f[2] = (float)(image[indx-1][1] + image[indx-3][1])/(2 + 2*image[indx-2][c]);
|
||
f[3] = 2*(float)image[indx+1][1]/(2 + image[indx+2][c] + image[indx][c]);
|
||
f[4] = (float)(image[indx+1][1] + image[indx+3][1])/(2 + 2*image[indx+2][c]);
|
||
|
||
g2 = (f[0] + f[1] + f[2] + f[3] + f[4] - MAX(f[1], MAX(f[2], MAX(f[3], f[4]))) - MIN(f[1], MIN(f[2], MIN(f[3], f[4]))))/3.0;
|
||
|
||
image[indx][1] = CLIP((2+image[indx][c])*(current*g1 + (16-current)*g2)/16.0);
|
||
|
||
// get rid of the overshooted pixels
|
||
int min = MIN(image[indx+1+u][1], MIN(image[indx+1-u][1], MIN(image[indx-1+u][1], MIN(image[indx-1-u][1], MIN(image[indx-1][1], MIN(image[indx+1][1], MIN(image[indx-u][1], image[indx+u][1])))))));
|
||
int max = MAX(image[indx+1+u][1], MAX(image[indx+1-u][1], MAX(image[indx-1+u][1], MAX(image[indx-1-u][1], MAX(image[indx-1][1], MAX(image[indx+1][1], MAX(image[indx-u][1], image[indx+u][1])))))));
|
||
|
||
image[indx][1] = LIM(image[indx][1], min, max);
|
||
|
||
|
||
}
|
||
}
|
||
|
||
// missing colors are interpolated using high quality algorithm by Luis Sanz Rodríguez
|
||
void RawImageSource::dcb_color_full(ushort (*image)[4], int x0, int y0, float (*chroma)[2])
|
||
{
|
||
const int u=CACHESIZE, v=2*CACHESIZE, w=3*CACHESIZE;
|
||
int rowMin,colMin,rowMax,colMax;
|
||
dcb_initTileLimits(colMin,rowMin,colMax,rowMax,x0,y0,3);
|
||
|
||
int i,j;
|
||
float f[4],g[4];
|
||
|
||
for (int row=1; row < CACHESIZE-1; row++)
|
||
for (int col=1+(FC(y0-TILEBORDER+row,x0-TILEBORDER+1)&1),indx=row*CACHESIZE+col,c=FC(y0-TILEBORDER+row,x0-TILEBORDER+col),d=c/2; col < CACHESIZE-1; col+=2,indx+=2)
|
||
chroma[indx][d]=image[indx][c]-image[indx][1];
|
||
|
||
for (int row=rowMin; row<rowMax; row++)
|
||
for (int col=colMin+(FC(y0-TILEBORDER+row,x0-TILEBORDER+colMin)&1),indx=row*CACHESIZE+col,c=1-FC(y0-TILEBORDER+row,x0-TILEBORDER+col)/2,d=1-c; col<colMax; col+=2,indx+=2) {
|
||
f[0]=1.0/(float)(1.0+fabs(chroma[indx-u-1][c]-chroma[indx+u+1][c])+fabs(chroma[indx-u-1][c]-chroma[indx-w-3][c])+fabs(chroma[indx+u+1][c]-chroma[indx-w-3][c]));
|
||
f[1]=1.0/(float)(1.0+fabs(chroma[indx-u+1][c]-chroma[indx+u-1][c])+fabs(chroma[indx-u+1][c]-chroma[indx-w+3][c])+fabs(chroma[indx+u-1][c]-chroma[indx-w+3][c]));
|
||
f[2]=1.0/(float)(1.0+fabs(chroma[indx+u-1][c]-chroma[indx-u+1][c])+fabs(chroma[indx+u-1][c]-chroma[indx+w+3][c])+fabs(chroma[indx-u+1][c]-chroma[indx+w-3][c]));
|
||
f[3]=1.0/(float)(1.0+fabs(chroma[indx+u+1][c]-chroma[indx-u-1][c])+fabs(chroma[indx+u+1][c]-chroma[indx+w-3][c])+fabs(chroma[indx-u-1][c]-chroma[indx+w+3][c]));
|
||
g[0]=1.325*chroma[indx-u-1][c]-0.175*chroma[indx-w-3][c]-0.075*chroma[indx-w-1][c]-0.075*chroma[indx-u-3][c];
|
||
g[1]=1.325*chroma[indx-u+1][c]-0.175*chroma[indx-w+3][c]-0.075*chroma[indx-w+1][c]-0.075*chroma[indx-u+3][c];
|
||
g[2]=1.325*chroma[indx+u-1][c]-0.175*chroma[indx+w-3][c]-0.075*chroma[indx+w-1][c]-0.075*chroma[indx+u-3][c];
|
||
g[3]=1.325*chroma[indx+u+1][c]-0.175*chroma[indx+w+3][c]-0.075*chroma[indx+w+1][c]-0.075*chroma[indx+u+3][c];
|
||
chroma[indx][c]=(f[0]*g[0]+f[1]*g[1]+f[2]*g[2]+f[3]*g[3])/(f[0]+f[1]+f[2]+f[3]);
|
||
}
|
||
for (int row=rowMin; row<rowMax; row++)
|
||
for (int col=colMin+(FC(y0-TILEBORDER+row,x0-TILEBORDER+colMin+1)&1),indx=row*CACHESIZE+col,c=FC(y0-TILEBORDER+row,x0-TILEBORDER+col+1)/2; col<colMax; col+=2,indx+=2)
|
||
for(int d=0;d<=1;c=1-c,d++){
|
||
f[0]=1.0/(float)(1.0+fabs(chroma[indx-u][c]-chroma[indx+u][c])+fabs(chroma[indx-u][c]-chroma[indx-w][c])+fabs(chroma[indx+u][c]-chroma[indx-w][c]));
|
||
f[1]=1.0/(float)(1.0+fabs(chroma[indx+1][c]-chroma[indx-1][c])+fabs(chroma[indx+1][c]-chroma[indx+3][c])+fabs(chroma[indx-1][c]-chroma[indx+3][c]));
|
||
f[2]=1.0/(float)(1.0+fabs(chroma[indx-1][c]-chroma[indx+1][c])+fabs(chroma[indx-1][c]-chroma[indx-3][c])+fabs(chroma[indx+1][c]-chroma[indx-3][c]));
|
||
f[3]=1.0/(float)(1.0+fabs(chroma[indx+u][c]-chroma[indx-u][c])+fabs(chroma[indx+u][c]-chroma[indx+w][c])+fabs(chroma[indx-u][c]-chroma[indx+w][c]));
|
||
|
||
g[0]=0.875*chroma[indx-u][c]+0.125*chroma[indx-w][c];
|
||
g[1]=0.875*chroma[indx+1][c]+0.125*chroma[indx+3][c];
|
||
g[2]=0.875*chroma[indx-1][c]+0.125*chroma[indx-3][c];
|
||
g[3]=0.875*chroma[indx+u][c]+0.125*chroma[indx+w][c];
|
||
|
||
chroma[indx][c]=(f[0]*g[0]+f[1]*g[1]+f[2]*g[2]+f[3]*g[3])/(f[0]+f[1]+f[2]+f[3]);
|
||
}
|
||
|
||
for(int row=rowMin; row<rowMax; row++)
|
||
for(int col=colMin,indx=row*CACHESIZE+col; col<colMax; col++,indx++){
|
||
image[indx][0]=CLIP(chroma[indx][0]+image[indx][1]);
|
||
image[indx][2]=CLIP(chroma[indx][1]+image[indx][1]);
|
||
}
|
||
}
|
||
|
||
// DCB demosaicing main routine (sharp version)
|
||
void RawImageSource::dcb_demosaic(int iterations, int dcb_enhance)
|
||
{
|
||
double currentProgress=0.0;
|
||
if(plistener) {
|
||
plistener->setProgressStr ("DCB Demosaicing...");
|
||
plistener->setProgress (currentProgress);
|
||
}
|
||
|
||
int wTiles = W/TILESIZE + (W%TILESIZE?1:0);
|
||
int hTiles = H/TILESIZE + (H%TILESIZE?1:0);
|
||
int numTiles = wTiles * hTiles;
|
||
int tilesDone=0;
|
||
#ifdef _OPENMP
|
||
int nthreads = omp_get_max_threads();
|
||
ushort (**image)[4] = (ushort(**)[4]) calloc( nthreads,sizeof( void*) );
|
||
ushort (**image2)[3] = (ushort(**)[3]) calloc( nthreads,sizeof( void*) );
|
||
ushort (**image3)[3] = (ushort(**)[3]) calloc( nthreads,sizeof( void*) );
|
||
float (**chroma)[2] = (float (**)[2]) calloc( nthreads,sizeof( void*) );
|
||
for(int i=0; i<nthreads; i++){
|
||
image[i] = (ushort(*)[4]) calloc( CACHESIZE*CACHESIZE, sizeof **image);
|
||
image2[i]= (ushort(*)[3]) calloc( CACHESIZE*CACHESIZE, sizeof **image2);
|
||
image3[i]= (ushort(*)[3]) calloc( CACHESIZE*CACHESIZE, sizeof **image3);
|
||
chroma[i]= (float (*)[2]) calloc( CACHESIZE*CACHESIZE, sizeof **chroma);
|
||
}
|
||
#else
|
||
ushort (*image)[4] = (ushort(*)[4]) calloc( CACHESIZE*CACHESIZE, sizeof *image);
|
||
ushort (*image2)[3] = (ushort(*)[3]) calloc( CACHESIZE*CACHESIZE, sizeof *image2);
|
||
ushort (*image3)[3] = (ushort(*)[3]) calloc( CACHESIZE*CACHESIZE, sizeof *image3);
|
||
float (*chroma)[2] = (float (*)[2]) calloc( CACHESIZE*CACHESIZE, sizeof *chroma);
|
||
#endif
|
||
|
||
#pragma omp parallel for
|
||
for( int iTile=0; iTile < numTiles; iTile++){
|
||
int xTile = iTile % wTiles;
|
||
int yTile = iTile / wTiles;
|
||
int x0 = xTile*TILESIZE;
|
||
int y0 = yTile*TILESIZE;
|
||
|
||
#ifdef _OPENMP
|
||
int tid = omp_get_thread_num();
|
||
ushort (*tile)[4] = image[tid];
|
||
ushort (*buffer)[3] = image2[tid];
|
||
ushort (*buffer2)[3]= image3[tid];
|
||
float (*chrm)[2] = chroma[tid];
|
||
#else
|
||
ushort (*tile)[4] = image;
|
||
ushort (*buffer)[3] = image2;
|
||
ushort (*buffer2)[3]= image3;
|
||
float (*chrm)[2] = chroma;
|
||
#endif
|
||
|
||
fill_raw( tile, x0,y0,rawData );
|
||
if( !xTile || !yTile || xTile==wTiles-1 || yTile==hTiles-1)
|
||
fill_border(tile,6, x0, y0);
|
||
dcb_hid(tile,buffer,buffer2,x0,y0);
|
||
copy_to_buffer(buffer, tile);
|
||
for (int i=iterations; i>0;i--) {
|
||
dcb_hid2(tile,x0,y0);
|
||
dcb_hid2(tile,x0,y0);
|
||
dcb_hid2(tile,x0,y0);
|
||
dcb_map(tile,x0,y0);
|
||
dcb_correction(tile,x0,y0);
|
||
}
|
||
dcb_color(tile,x0,y0);
|
||
dcb_pp(tile,x0,y0);
|
||
dcb_map(tile,x0,y0);
|
||
dcb_correction2(tile,x0,y0);
|
||
dcb_map(tile,x0,y0);
|
||
dcb_correction(tile,x0,y0);
|
||
dcb_color(tile,x0,y0);
|
||
dcb_map(tile,x0,y0);
|
||
dcb_correction(tile,x0,y0);
|
||
dcb_map(tile,x0,y0);
|
||
dcb_correction(tile,x0,y0);
|
||
dcb_map(tile,x0,y0);
|
||
restore_from_buffer(tile, buffer);
|
||
dcb_color(tile,x0,y0);
|
||
if (dcb_enhance) {
|
||
dcb_refinement(tile,x0,y0);
|
||
dcb_color_full(tile,x0,y0,chrm);
|
||
}
|
||
|
||
for(int y=0;y<TILESIZE && y0+y<H;y++){
|
||
for (int j=0; j<TILESIZE && x0+j<W; j++){
|
||
red[y0+y][x0+j] = tile[(y+TILEBORDER)*CACHESIZE+TILEBORDER+j][0];
|
||
green[y0+y][x0+j] = tile[(y+TILEBORDER)*CACHESIZE+TILEBORDER+j][1];
|
||
blue[y0+y][x0+j] = tile[(y+TILEBORDER)*CACHESIZE+TILEBORDER+j][2];
|
||
}
|
||
}
|
||
|
||
#ifdef _OPENMP
|
||
if(omp_get_thread_num()==0)
|
||
#endif
|
||
{
|
||
if( plistener && double(tilesDone)/numTiles > currentProgress){
|
||
currentProgress+=0.1; // Show progress each 10%
|
||
plistener->setProgress (currentProgress);
|
||
}
|
||
}
|
||
#pragma omp atomic
|
||
tilesDone++;
|
||
}
|
||
|
||
#ifdef _OPENMP
|
||
for(int i=0; i<nthreads; i++){
|
||
free(image[i]);
|
||
free(image2[i]);
|
||
free(image3[i]);
|
||
free(chroma[i]);
|
||
}
|
||
#endif
|
||
free(image);
|
||
free(image2);
|
||
free(image3);
|
||
free(chroma);
|
||
|
||
if(plistener) plistener->setProgress (1.0);
|
||
}
|
||
#undef TILEBORDER
|
||
#undef TILESIZE
|
||
#undef CACHESIZE
|
||
|
||
//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
||
//Emil's code for AMaZE
|
||
#include "fast_demo.cc"//fast demosaic
|
||
#include "amaze_demosaic_RT.cc"//AMaZE demosaic
|
||
#include "CA_correct_RT.cc"//Emil's CA auto correction
|
||
#include "cfa_linedn_RT.cc"//Emil's CA auto correction
|
||
#include "green_equil_RT.cc"//Emil's green channel equilibration
|
||
#include "expo_before_b.cc"//Jacques's exposure before interpolation
|
||
|
||
//%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
||
|
||
|
||
} /* namespace */
|
||
|
||
|