liz/rawTherapee
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

Issue 2134: removed obsolete raw highlight preservation setting from GUI (still left in procparams for backwards compatilibility)

Browse Source
This commit is contained in:
torger
2015-07-10 12:00:36 +02:00
commit d5ca351c20
1751 changed files with 441944 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files

329
rtengine/rawimagesource_i.h Normal file
View File

@@ -0,0 +1,329 @@
/*
* 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/>.
*/
#ifndef RAWIMAGESOURCE_I_H_INCLUDED
#define RAWIMAGESOURCE_I_H_INCLUDED
#include "rawimagesource.h"
#include "curves.h"
namespace rtengine {
inline void RawImageSource::convert_row_to_YIQ (float* r, float* g, float* b, float* Y, float* I, float* Q, int W) {
for (int j=0; j<W; j++) {
Y[j] = .299 * r[j] + .587 * g[j] + .114 * b[j];
I[j] = .596 * r[j] - .275 * g[j] - .321 * b[j];
Q[j] = .212 * r[j] - .523 * g[j] + .311 * b[j];
}
}
inline void RawImageSource::convert_row_to_RGB (float* r, float* g, float* b, float* Y, float* I, float* Q, int W) {
for (int j=1; j<W-1; j++) {
r[j] = Y[j] + 0.956*I[j] + 0.621*Q[j];
g[j] = Y[j] - 0.272*I[j] - 0.647*Q[j];
b[j] = Y[j] - 1.105*I[j] + 1.702*Q[j];
}
}
inline void RawImageSource::convert_to_cielab_row (float* ar, float* ag, float* ab, float* oL, float* oa, float* ob) {
for (int j=0; j<W; j++) {
double r = ar[j];
double g = ag[j];
double b = ab[j];
double x = lc00 * r + lc01 * g + lc02 * b;
double y = lc10 * r + lc11 * g + lc12 * b;
double z = lc20 * r + lc21 * g + lc22 * b;
if (y>threshold)
oL[j] = cache[(int)y];
else
oL[j] = float(903.3 * y / MAXVALD);
oa[j] = float(500.0 * ((x>threshold ? cache[(int)x] : 7.787*x/MAXVALD+16.0/116.0) - (y>threshold ? cache[(int)y] : 7.787*y/MAXVALD+16.0/116.0)));
ob[j] = float(200.0 * ((y>threshold ? cache[(int)y] : 7.787*y/MAXVALD+16.0/116.0) - (z>threshold ? cache[(int)z] : 7.787*z/MAXVALD+16.0/116.0)));
}
}
inline void RawImageSource::interpolate_row_g (float* agh, float* agv, int i) {
for (int j=0; j<W; j++) {
if (ri->ISGREEN(i,j)) {
agh[j] = rawData[i][j];
agv[j] = rawData[i][j];
}
else {
int gh=0;
int gv=0;
if (j>1 && j<W-2) {
gh = (-rawData[i][j-2] + 2*rawData[i][j-1] + 2*rawData[i][j] + 2*rawData[i][j+1] -rawData[i][j+2]) / 4;
int maxgh = max(rawData[i][j-1], rawData[i][j+1]);
int mingh = min(rawData[i][j-1], rawData[i][j+1]);
if (gh>maxgh)
gh = maxgh;
else if (gh<mingh)
gh = mingh;
}
else if (j==0)
gh = rawData[i][1];
else if (j==1)
gh = (rawData[i][0] + rawData[i][2]) / 2;
else if (j==W-1)
gh = rawData[i][W-2];
else if (j==W-2)
gh = (rawData[i][W-1] + rawData[i][W-3]) / 2;
if (i>1 && i<H-2) {
gv = (-rawData[i-2][j] + 2*rawData[i-1][j] + 2*rawData[i][j] + 2*rawData[i+1][j] - rawData[i+2][j]) / 4;
int maxgv = max(rawData[i-1][j], rawData[i+1][j]);
int mingv = min(rawData[i-1][j], rawData[i+1][j]);
if (gv>maxgv)
gv = maxgv;
else if (gv<mingv)
gv = mingv;
}
else if (i==0)
gv = rawData[1][j];
else if (i==1)
gv = (rawData[0][j] + rawData[2][j]) / 2;
else if (i==H-1)
gv = rawData[H-2][j];
else if (i==H-2)
gv = (rawData[H-1][j] + rawData[H-3][j]) / 2;
agh[j] = gh;
agv[j] = gv;
}
}
}
inline void RawImageSource::interpolate_row_rb (float* ar, float* ab, float* pg, float* cg, float* ng, int i) {
if (ri->ISRED(i,0) || ri->ISRED(i,1)) {
// RGRGR or GRGRGR line
for (int j=0; j<W; j++) {
if (ri->ISRED(i,j)) {
// red is simple
ar[j] = rawData[i][j];
// blue: cross interpolation
int b = 0;
int n = 0;
if (i>0 && j>0) {
b += rawData[i-1][j-1] - pg[j-1];
n++;
}
if (i>0 && j<W-1) {
b += rawData[i-1][j+1] - pg[j+1];
n++;
}
if (i<H-1 && j>0) {
b += rawData[i+1][j-1] - ng[j-1];
n++;
}
if (i<H-1 && j<W-1) {
b += rawData[i+1][j+1] - ng[j+1];
n++;
}
b = cg[j] + b / n;
ab[j] = b;
}
else {
// linear R-G interp. horizontally
int r;
if (j==0)
r = cg[0] + rawData[i][1] - cg[1];
else if (j==W-1)
r = cg[W-1] + rawData[i][W-2] - cg[W-2];
else
r = cg[j] + (rawData[i][j-1] - cg[j-1] + rawData[i][j+1] - cg[j+1]) / 2;
ar[j] = CLIP(r);
// linear B-G interp. vertically
int b;
if (i==0)
b = ng[j] + rawData[1][j] - cg[j];
else if (i==H-1)
b = pg[j] + rawData[H-2][j] - cg[j];
else
b = cg[j] + (rawData[i-1][j] - pg[j] + rawData[i+1][j] - ng[j]) / 2;
ab[j] = b;
}
}
}
else {
// BGBGB or GBGBGB line
for (int j=0; j<W; j++) {
if (ri->ISBLUE(i,j)) {
// red is simple
ab[j] = rawData[i][j];
// blue: cross interpolation
int r = 0;
int n = 0;
if (i>0 && j>0) {
r += rawData[i-1][j-1] - pg[j-1];
n++;
}
if (i>0 && j<W-1) {
r += rawData[i-1][j+1] - pg[j+1];
n++;
}
if (i<H-1 && j>0) {
r += rawData[i+1][j-1] - ng[j-1];
n++;
}
if (i<H-1 && j<W-1) {
r += rawData[i+1][j+1] - ng[j+1];
n++;
}
r = cg[j] + r / n;
ar[j] = r;
}
else {
// linear B-G interp. horizontally
int b;
if (j==0)
b = cg[0] + rawData[i][1] - cg[1];
else if (j==W-1)
b = cg[W-1] + rawData[i][W-2] - cg[W-2];
else
b = cg[j] + (rawData[i][j-1] - cg[j-1] + rawData[i][j+1] - cg[j+1]) / 2;
ab[j] = CLIP(b);
// linear R-G interp. vertically
int r;
if (i==0)
r = ng[j] + rawData[1][j] - cg[j];
else if (i==H-1)
r = pg[j] + rawData[H-2][j] - cg[j];
else
r = cg[j] + (rawData[i-1][j] - pg[j] + rawData[i+1][j] - ng[j]) / 2;
ar[j] = r;
}
}
}
}
inline void RawImageSource::interpolate_row_rb_mul_pp (float* ar, float* ab, float* pg, float* cg, float* ng, int i, float r_mul, float g_mul, float b_mul, int x1, int width, int skip) {
if (ri->ISRED(i,0) || ri->ISRED(i,1)) {
// RGRGR or GRGRGR line
for (int j=x1, jx=0; jx<width; j+=skip, jx++) {
if (ri->ISRED(i,j)) {
// red is simple
ar[jx] = r_mul * rawData[i][j];
// blue: cross interpolation
float b = 0;
int n = 0;
if (i>0 && j>0) {
b += b_mul*rawData[i-1][j-1] - g_mul*pg[j-1];
n++;
}
if (i>0 && j<W-1) {
b += b_mul*rawData[i-1][j+1] - g_mul*pg[j+1];
n++;
}
if (i<H-1 && j>0) {
b += b_mul*rawData[i+1][j-1] - g_mul*ng[j-1];
n++;
}
if (i<H-1 && j<W-1) {
b += b_mul*rawData[i+1][j+1] - g_mul*ng[j+1];
n++;
}
b = g_mul*cg[j] + b / n;
ab[jx] = b;
}
else {
// linear R-G interp. horizontally
float r;
if (j==0)
r = g_mul*cg[0] + r_mul*rawData[i][1] - g_mul*cg[1];
else if (j==W-1)
r = g_mul*cg[W-1] + r_mul*rawData[i][W-2] - g_mul*cg[W-2];
else
r = g_mul*cg[j] + (r_mul*rawData[i][j-1] - g_mul*cg[j-1] + r_mul*rawData[i][j+1] - g_mul*cg[j+1]) / 2;
ar[jx] = r;
// linear B-G interp. vertically
float b;
if (i==0)
b = g_mul*ng[j] + b_mul*rawData[1][j] - g_mul*cg[j];
else if (i==H-1)
b = g_mul*pg[j] + b_mul*rawData[H-2][j] - g_mul*cg[j];
else
b = g_mul*cg[j] + (b_mul*rawData[i-1][j] - g_mul*pg[j] + b_mul*rawData[i+1][j] - g_mul*ng[j]) / 2;
ab[jx] = b;
}
}
}
else {
// BGBGB or GBGBGB line
for (int j=x1, jx=0; jx<width; j+=skip, jx++) {
if (ri->ISBLUE(i,j)) {
// red is simple
ab[jx] = b_mul*rawData[i][j];
// blue: cross interpolation
float r = 0;
int n = 0;
if (i>0 && j>0) {
r += r_mul*rawData[i-1][j-1] - g_mul*pg[j-1];
n++;
}
if (i>0 && j<W-1) {
r += r_mul*rawData[i-1][j+1] - g_mul*pg[j+1];
n++;
}
if (i<H-1 && j>0) {
r += r_mul*rawData[i+1][j-1] - g_mul*ng[j-1];
n++;
}
if (i<H-1 && j<W-1) {
r += r_mul*rawData[i+1][j+1] - g_mul*ng[j+1];
n++;
}
r = g_mul*cg[j] + r / n;
ar[jx] = r;
}
else {
// linear B-G interp. horizontally
float b;
if (j==0)
b = g_mul*cg[0] + b_mul*rawData[i][1] - g_mul*cg[1];
else if (j==W-1)
b = g_mul*cg[W-1] + b_mul*rawData[i][W-2] - g_mul*cg[W-2];
else
b = g_mul*cg[j] + (b_mul*rawData[i][j-1] - g_mul*cg[j-1] + b_mul*rawData[i][j+1] - g_mul*cg[j+1]) / 2;
ab[jx] = b;
// linear R-G interp. vertically
float r;
if (i==0)
r = g_mul*ng[j] + r_mul*rawData[1][j] - g_mul*cg[j];
else if (i==H-1)
r = g_mul*pg[j] + r_mul*rawData[H-2][j] - g_mul*cg[j];
else
r = g_mul*cg[j] + (r_mul*rawData[i-1][j] - g_mul*pg[j] + r_mul*rawData[i+1][j] - g_mul*ng[j]) / 2;
ar[jx] = r;
}
}
}
}
}
#endif