1 |
greg |
3.1 |
/* Copyright (c) 1997 Regents of the University of California */ |
2 |
|
|
|
3 |
|
|
#ifndef lint |
4 |
|
|
static char SCCSid[] = "$SunId$ LBL"; |
5 |
|
|
#endif |
6 |
|
|
|
7 |
|
|
/* |
8 |
|
|
* Tone mapping functions. |
9 |
|
|
* See tonemap.h for detailed function descriptions. |
10 |
|
|
*/ |
11 |
|
|
|
12 |
|
|
#include <stdio.h> |
13 |
|
|
#include <math.h> |
14 |
|
|
#include "tmprivat.h" |
15 |
|
|
#include "tmerrmsg.h" |
16 |
|
|
|
17 |
|
|
#define exp10(x) exp(M_LN10*(x)) |
18 |
|
|
|
19 |
|
|
struct tmStruct *tmTop = NULL; /* current tone mapping stack */ |
20 |
|
|
|
21 |
greg |
3.4 |
/* our list of conversion packages */ |
22 |
|
|
struct tmPackage *tmPkg[TM_MAXPKG]; |
23 |
|
|
int tmNumPkgs = 0; /* number of registered packages */ |
24 |
greg |
3.1 |
|
25 |
gregl |
3.5 |
int tmLastError; /* last error incurred by library */ |
26 |
|
|
char *tmLastFunction; /* error-generating function name */ |
27 |
greg |
3.4 |
|
28 |
gregl |
3.5 |
|
29 |
greg |
3.1 |
int |
30 |
|
|
tmErrorReturn(func, err) /* error return (with message) */ |
31 |
|
|
char *func; |
32 |
|
|
int err; |
33 |
|
|
{ |
34 |
gregl |
3.5 |
tmLastFunction = func; |
35 |
|
|
tmLastError = err; |
36 |
greg |
3.2 |
if (tmTop != NULL && tmTop->flags & TM_F_NOSTDERR) |
37 |
greg |
3.1 |
return(err); |
38 |
|
|
fputs(func, stderr); |
39 |
|
|
fputs(": ", stderr); |
40 |
|
|
fputs(tmErrorMessage[err], stderr); |
41 |
|
|
fputs("!\n", stderr); |
42 |
|
|
return(err); |
43 |
|
|
} |
44 |
|
|
|
45 |
|
|
|
46 |
|
|
struct tmStruct * |
47 |
|
|
tmInit(flags, monpri, gamval) /* initialize new tone mapping */ |
48 |
|
|
int flags; |
49 |
|
|
RGBPRIMP monpri; |
50 |
|
|
double gamval; |
51 |
|
|
{ |
52 |
|
|
static char funcName[] = "tmInit"; |
53 |
|
|
COLORMAT cmat; |
54 |
|
|
register struct tmStruct *tmnew; |
55 |
|
|
register int i; |
56 |
|
|
/* allocate structure */ |
57 |
|
|
tmnew = (struct tmStruct *)malloc(sizeof(struct tmStruct)); |
58 |
|
|
if (tmnew == NULL) |
59 |
|
|
return(NULL); |
60 |
|
|
|
61 |
|
|
tmnew->flags = flags & ~TM_F_UNIMPL; |
62 |
|
|
/* set monitor transform */ |
63 |
|
|
if (monpri == NULL || monpri == stdprims || tmnew->flags & TM_F_BW) { |
64 |
|
|
tmnew->monpri = stdprims; |
65 |
|
|
tmnew->clf[RED] = rgb2xyzmat[1][0]; |
66 |
|
|
tmnew->clf[GRN] = rgb2xyzmat[1][1]; |
67 |
|
|
tmnew->clf[BLU] = rgb2xyzmat[1][2]; |
68 |
|
|
} else { |
69 |
|
|
comprgb2xyzmat(cmat, tmnew->monpri=monpri); |
70 |
|
|
tmnew->clf[RED] = cmat[1][0]; |
71 |
|
|
tmnew->clf[GRN] = cmat[1][1]; |
72 |
|
|
tmnew->clf[BLU] = cmat[1][2]; |
73 |
|
|
} |
74 |
|
|
/* set gamma value */ |
75 |
|
|
if (gamval < MINGAM) |
76 |
|
|
tmnew->mongam = DEFGAM; |
77 |
|
|
else |
78 |
|
|
tmnew->mongam = gamval; |
79 |
greg |
3.4 |
/* set color divisors */ |
80 |
|
|
for (i = 0; i < 3; i++) |
81 |
|
|
tmnew->cdiv[i] = 256.*pow(tmnew->clf[i], 1./tmnew->mongam); |
82 |
|
|
|
83 |
greg |
3.1 |
/* set input transform */ |
84 |
|
|
tmnew->inppri = tmnew->monpri; |
85 |
|
|
tmnew->cmat[0][0] = tmnew->cmat[1][1] = tmnew->cmat[2][2] = |
86 |
|
|
tmnew->inpsf = WHTEFFICACY; |
87 |
|
|
tmnew->cmat[0][1] = tmnew->cmat[0][2] = tmnew->cmat[1][0] = |
88 |
|
|
tmnew->cmat[1][2] = tmnew->cmat[2][0] = tmnew->cmat[2][1] = 0.; |
89 |
gregl |
3.6 |
tmnew->hbrmin = tmnew->hbrmax = 0; |
90 |
greg |
3.1 |
tmnew->histo = NULL; |
91 |
gregl |
3.6 |
tmnew->mbrmin = tmnew->mbrmax = 0; |
92 |
greg |
3.1 |
tmnew->lumap = NULL; |
93 |
greg |
3.4 |
/* zero private data */ |
94 |
|
|
for (i = TM_MAXPKG; i--; ) |
95 |
|
|
tmnew->pd[i] = NULL; |
96 |
|
|
/* make tmnew current */ |
97 |
greg |
3.1 |
tmnew->tmprev = tmTop; |
98 |
|
|
return(tmTop = tmnew); |
99 |
|
|
} |
100 |
|
|
|
101 |
|
|
|
102 |
|
|
int |
103 |
|
|
tmSetSpace(pri, sf) /* set input color space for conversions */ |
104 |
|
|
RGBPRIMP pri; |
105 |
|
|
double sf; |
106 |
|
|
{ |
107 |
|
|
static char funcName[] = "tmSetSpace"; |
108 |
|
|
register int i, j; |
109 |
|
|
/* error check */ |
110 |
|
|
if (tmTop == NULL) |
111 |
|
|
returnErr(TM_E_TMINVAL); |
112 |
|
|
if (sf <= 1e-12) |
113 |
|
|
returnErr(TM_E_ILLEGAL); |
114 |
|
|
/* check if no change */ |
115 |
|
|
if (pri == tmTop->inppri && FEQ(sf, tmTop->inpsf)) |
116 |
|
|
returnOK; |
117 |
|
|
tmTop->inppri = pri; /* let's set it */ |
118 |
|
|
tmTop->inpsf = sf; |
119 |
|
|
|
120 |
|
|
if (tmTop->flags & TM_F_BW) { /* color doesn't matter */ |
121 |
|
|
tmTop->monpri = tmTop->inppri; /* eliminate xform */ |
122 |
|
|
if (tmTop->inppri == TM_XYZPRIM) { |
123 |
|
|
tmTop->clf[CIEX] = tmTop->clf[CIEZ] = 0.; |
124 |
|
|
tmTop->clf[CIEY] = 1.; |
125 |
|
|
} else { |
126 |
|
|
comprgb2xyzmat(tmTop->cmat, tmTop->monpri); |
127 |
|
|
tmTop->clf[RED] = tmTop->cmat[1][0]; |
128 |
|
|
tmTop->clf[GRN] = tmTop->cmat[1][1]; |
129 |
|
|
tmTop->clf[BLU] = tmTop->cmat[1][2]; |
130 |
|
|
} |
131 |
|
|
tmTop->cmat[0][0] = tmTop->cmat[1][1] = tmTop->cmat[2][2] = |
132 |
|
|
tmTop->inpsf; |
133 |
|
|
tmTop->cmat[0][1] = tmTop->cmat[0][2] = tmTop->cmat[1][0] = |
134 |
|
|
tmTop->cmat[1][2] = tmTop->cmat[2][0] = tmTop->cmat[2][1] = 0.; |
135 |
|
|
|
136 |
|
|
} else if (tmTop->inppri == TM_XYZPRIM) /* input is XYZ */ |
137 |
|
|
compxyz2rgbmat(tmTop->cmat, tmTop->monpri); |
138 |
|
|
|
139 |
|
|
else { /* input is RGB */ |
140 |
|
|
if (tmTop->inppri != tmTop->monpri && |
141 |
|
|
PRIMEQ(tmTop->inppri, tmTop->monpri)) |
142 |
|
|
tmTop->inppri = tmTop->monpri; /* no xform */ |
143 |
|
|
comprgb2rgbmat(tmTop->cmat, tmTop->inppri, tmTop->monpri); |
144 |
|
|
} |
145 |
|
|
for (i = 0; i < 3; i++) |
146 |
|
|
for (j = 0; j < 3; j++) |
147 |
|
|
tmTop->cmat[i][j] *= tmTop->inpsf; |
148 |
greg |
3.4 |
/* set color divisors */ |
149 |
|
|
for (i = 0; i < 3; i++) |
150 |
|
|
if (tmTop->clf[i] > .001) |
151 |
|
|
tmTop->cdiv[i] = |
152 |
|
|
256.*pow(tmTop->clf[i], 1./tmTop->mongam); |
153 |
|
|
else |
154 |
|
|
tmTop->cdiv[i] = 1; |
155 |
|
|
/* notify packages */ |
156 |
|
|
for (i = tmNumPkgs; i--; ) |
157 |
|
|
if (tmTop->pd[i] != NULL && tmPkg[i]->NewSpace != NULL) |
158 |
|
|
(*tmPkg[i]->NewSpace)(tmTop); |
159 |
greg |
3.1 |
returnOK; |
160 |
|
|
} |
161 |
|
|
|
162 |
|
|
|
163 |
|
|
void |
164 |
|
|
tmClearHisto() /* clear current histogram */ |
165 |
|
|
{ |
166 |
|
|
if (tmTop == NULL || tmTop->histo == NULL) |
167 |
|
|
return; |
168 |
greg |
3.4 |
free((MEM_PTR)tmTop->histo); |
169 |
greg |
3.1 |
tmTop->histo = NULL; |
170 |
|
|
} |
171 |
|
|
|
172 |
|
|
|
173 |
|
|
int |
174 |
|
|
tmCvColors(ls, cs, scan, len) /* convert float colors */ |
175 |
|
|
TMbright *ls; |
176 |
|
|
BYTE *cs; |
177 |
|
|
COLOR *scan; |
178 |
|
|
int len; |
179 |
|
|
{ |
180 |
|
|
static char funcName[] = "tmCvColors"; |
181 |
greg |
3.4 |
static COLOR csmall = {1e-6, 1e-6, 1e-6}; |
182 |
greg |
3.1 |
COLOR cmon; |
183 |
|
|
double lum, slum; |
184 |
|
|
register double d; |
185 |
|
|
register int i; |
186 |
|
|
|
187 |
|
|
if (tmTop == NULL) |
188 |
|
|
returnErr(TM_E_TMINVAL); |
189 |
|
|
if (ls == NULL | scan == NULL | len <= 0) |
190 |
|
|
returnErr(TM_E_ILLEGAL); |
191 |
|
|
for (i = len; i--; ) { |
192 |
greg |
3.4 |
if (tmNeedMatrix(tmTop)) /* get monitor RGB */ |
193 |
greg |
3.1 |
colortrans(cmon, tmTop->cmat, scan[i]); |
194 |
|
|
else { |
195 |
|
|
cmon[RED] = tmTop->inpsf*scan[i][RED]; |
196 |
|
|
cmon[GRN] = tmTop->inpsf*scan[i][GRN]; |
197 |
|
|
cmon[BLU] = tmTop->inpsf*scan[i][BLU]; |
198 |
|
|
} |
199 |
|
|
/* world luminance */ |
200 |
|
|
lum = tmTop->clf[RED]*cmon[RED] + |
201 |
|
|
tmTop->clf[GRN]*cmon[GRN] + |
202 |
|
|
tmTop->clf[BLU]*cmon[BLU] ; |
203 |
|
|
/* check range */ |
204 |
greg |
3.4 |
if (clipgamut(cmon, lum, CGAMUT_LOWER, csmall, cwhite)) |
205 |
greg |
3.1 |
lum = tmTop->clf[RED]*cmon[RED] + |
206 |
|
|
tmTop->clf[GRN]*cmon[GRN] + |
207 |
|
|
tmTop->clf[BLU]*cmon[BLU] ; |
208 |
|
|
if (lum < MINLUM) { |
209 |
|
|
ls[i] = MINBRT-1; /* bogus value */ |
210 |
|
|
lum = MINLUM; |
211 |
|
|
} else { |
212 |
|
|
d = TM_BRTSCALE*log(lum); /* encode it */ |
213 |
|
|
ls[i] = d>0. ? (int)(d+.5) : (int)(d-.5); |
214 |
|
|
} |
215 |
|
|
if (cs == TM_NOCHROM) /* no color? */ |
216 |
|
|
continue; |
217 |
|
|
if (tmTop->flags & TM_F_MESOPIC && lum < LMESUPPER) { |
218 |
|
|
slum = scotlum(cmon); /* mesopic adj. */ |
219 |
|
|
if (lum < LMESLOWER) |
220 |
|
|
cmon[RED] = cmon[GRN] = cmon[BLU] = slum; |
221 |
|
|
else { |
222 |
|
|
d = (lum - LMESLOWER)/(LMESUPPER - LMESLOWER); |
223 |
|
|
if (tmTop->flags & TM_F_BW) |
224 |
|
|
cmon[RED] = cmon[GRN] = |
225 |
|
|
cmon[BLU] = d*lum; |
226 |
|
|
else |
227 |
|
|
scalecolor(cmon, d); |
228 |
|
|
d = (1.-d)*slum; |
229 |
|
|
cmon[RED] += d; |
230 |
|
|
cmon[GRN] += d; |
231 |
|
|
cmon[BLU] += d; |
232 |
|
|
} |
233 |
|
|
} else if (tmTop->flags & TM_F_BW) { |
234 |
|
|
cmon[RED] = cmon[GRN] = cmon[BLU] = lum; |
235 |
|
|
} |
236 |
|
|
d = tmTop->clf[RED]*cmon[RED]/lum; |
237 |
greg |
3.4 |
cs[3*i ] = d>=.999 ? 255 : |
238 |
|
|
(int)(256.*pow(d, 1./tmTop->mongam)); |
239 |
greg |
3.1 |
d = tmTop->clf[GRN]*cmon[GRN]/lum; |
240 |
greg |
3.4 |
cs[3*i+1] = d>=.999 ? 255 : |
241 |
|
|
(int)(256.*pow(d, 1./tmTop->mongam)); |
242 |
greg |
3.1 |
d = tmTop->clf[BLU]*cmon[BLU]/lum; |
243 |
greg |
3.4 |
cs[3*i+2] = d>=.999 ? 255 : |
244 |
|
|
(int)(256.*pow(d, 1./tmTop->mongam)); |
245 |
greg |
3.1 |
} |
246 |
|
|
returnOK; |
247 |
|
|
} |
248 |
|
|
|
249 |
|
|
|
250 |
|
|
int |
251 |
|
|
tmAddHisto(ls, len, wt) /* add values to histogram */ |
252 |
|
|
register TMbright *ls; |
253 |
|
|
int len; |
254 |
|
|
int wt; |
255 |
|
|
{ |
256 |
|
|
static char funcName[] = "tmAddHisto"; |
257 |
gregl |
3.7 |
int oldorig, oldlen, horig, hlen; |
258 |
greg |
3.1 |
register int i, j; |
259 |
|
|
|
260 |
|
|
if (len <= 0) |
261 |
|
|
returnErr(TM_E_ILLEGAL); |
262 |
|
|
if (tmTop == NULL) |
263 |
|
|
returnErr(TM_E_TMINVAL); |
264 |
|
|
/* first, grow limits */ |
265 |
|
|
if (tmTop->histo == NULL) { |
266 |
|
|
for (i = len; i-- && ls[i] < MINBRT; ) |
267 |
|
|
; |
268 |
|
|
if (i < 0) |
269 |
|
|
returnOK; |
270 |
gregl |
3.6 |
tmTop->hbrmin = tmTop->hbrmax = ls[i]; |
271 |
greg |
3.1 |
oldlen = 0; |
272 |
|
|
} else { |
273 |
gregl |
3.6 |
oldorig = (tmTop->hbrmin-MINBRT)/HISTEP; |
274 |
|
|
oldlen = (tmTop->hbrmax-MINBRT)/HISTEP + 1 - oldorig; |
275 |
greg |
3.1 |
} |
276 |
|
|
for (i = len; i--; ) { |
277 |
|
|
if ((j = ls[i]) < MINBRT) |
278 |
|
|
continue; |
279 |
gregl |
3.6 |
if (j < tmTop->hbrmin) |
280 |
|
|
tmTop->hbrmin = j; |
281 |
|
|
else if (j > tmTop->hbrmax) |
282 |
|
|
tmTop->hbrmax = j; |
283 |
greg |
3.1 |
} |
284 |
gregl |
3.6 |
horig = (tmTop->hbrmin-MINBRT)/HISTEP; |
285 |
|
|
hlen = (tmTop->hbrmax-MINBRT)/HISTEP + 1 - horig; |
286 |
greg |
3.1 |
if (hlen > oldlen) { /* (re)allocate histogram */ |
287 |
|
|
register int *newhist = (int *)calloc(hlen, sizeof(int)); |
288 |
|
|
if (newhist == NULL) |
289 |
|
|
returnErr(TM_E_NOMEM); |
290 |
|
|
if (oldlen) { /* copy and free old */ |
291 |
greg |
3.2 |
for (i = oldlen, j = i+oldorig-horig; i; ) |
292 |
|
|
newhist[--j] = tmTop->histo[--i]; |
293 |
greg |
3.4 |
free((MEM_PTR)tmTop->histo); |
294 |
greg |
3.1 |
} |
295 |
|
|
tmTop->histo = newhist; |
296 |
|
|
} |
297 |
|
|
if (wt == 0) |
298 |
|
|
returnOK; |
299 |
|
|
for (i = len; i--; ) /* add in new counts */ |
300 |
|
|
if (ls[i] >= MINBRT) |
301 |
|
|
tmTop->histo[ (ls[i]-MINBRT)/HISTEP - horig ] += wt; |
302 |
|
|
returnOK; |
303 |
|
|
} |
304 |
|
|
|
305 |
|
|
|
306 |
|
|
static double |
307 |
|
|
htcontrs(La) /* human threshold contrast sensitivity, dL(La) */ |
308 |
|
|
double La; |
309 |
|
|
{ |
310 |
|
|
double l10La, l10dL; |
311 |
|
|
/* formula taken from Ferwerda et al. [SG96] */ |
312 |
|
|
if (La < 1.148e-4) |
313 |
|
|
return(1.38e-3); |
314 |
|
|
l10La = log10(La); |
315 |
|
|
if (l10La < -1.44) /* rod response regime */ |
316 |
|
|
l10dL = pow(.405*l10La + 1.6, 2.18) - 2.86; |
317 |
|
|
else if (l10La < -.0184) |
318 |
|
|
l10dL = l10La - .395; |
319 |
|
|
else if (l10La < 1.9) /* cone response regime */ |
320 |
|
|
l10dL = pow(.249*l10La + .65, 2.7) - .72; |
321 |
|
|
else |
322 |
|
|
l10dL = l10La - 1.255; |
323 |
|
|
|
324 |
|
|
return(exp10(l10dL)); |
325 |
|
|
} |
326 |
|
|
|
327 |
|
|
|
328 |
|
|
int |
329 |
|
|
tmComputeMapping(gamval, Lddyn, Ldmax) |
330 |
|
|
double gamval; |
331 |
|
|
double Lddyn; |
332 |
|
|
double Ldmax; |
333 |
|
|
{ |
334 |
|
|
static char funcName[] = "tmComputeMapping"; |
335 |
|
|
int *histo; |
336 |
|
|
float *cumf; |
337 |
|
|
int brt0, histlen, histot, threshold, ceiling, trimmings; |
338 |
|
|
double logLddyn, Ldmin, Ldavg, Lwavg, Tr, Lw, Ld; |
339 |
|
|
int4 sum; |
340 |
|
|
register double d; |
341 |
|
|
register int i, j; |
342 |
|
|
|
343 |
|
|
if (tmTop == NULL || tmTop->histo == NULL) |
344 |
|
|
returnErr(TM_E_TMINVAL); |
345 |
|
|
/* check arguments */ |
346 |
|
|
if (Lddyn < MINLDDYN) Lddyn = DEFLDDYN; |
347 |
|
|
if (Ldmax < MINLDMAX) Ldmax = DEFLDMAX; |
348 |
|
|
if (gamval < MINGAM) gamval = tmTop->mongam; |
349 |
|
|
/* compute handy values */ |
350 |
|
|
Ldmin = Ldmax/Lddyn; |
351 |
|
|
logLddyn = log(Lddyn); |
352 |
|
|
Ldavg = sqrt(Ldmax*Ldmin); |
353 |
gregl |
3.6 |
i = (tmTop->hbrmin-MINBRT)/HISTEP; |
354 |
greg |
3.1 |
brt0 = MINBRT + HISTEP/2 + i*HISTEP; |
355 |
gregl |
3.6 |
histlen = (tmTop->hbrmax-MINBRT)/HISTEP + 1 - i; |
356 |
greg |
3.1 |
/* histogram total and mean */ |
357 |
|
|
histot = 0; sum = 0; |
358 |
|
|
j = brt0 + histlen*HISTEP; |
359 |
|
|
for (i = histlen; i--; ) { |
360 |
greg |
3.2 |
histot += tmTop->histo[i]; |
361 |
|
|
sum += (j -= HISTEP) * tmTop->histo[i]; |
362 |
greg |
3.1 |
} |
363 |
|
|
threshold = histot*.025 + .5; |
364 |
|
|
if (threshold < 4) |
365 |
|
|
returnErr(TM_E_TMFAIL); |
366 |
|
|
Lwavg = tmLuminance( (double)sum / histot ); |
367 |
greg |
3.2 |
if (!(tmTop->flags & TM_F_LINEAR)) { /* clamp histogram */ |
368 |
|
|
histo = (int *)malloc(histlen*sizeof(int)); |
369 |
|
|
cumf = (float *)malloc((histlen+1)*sizeof(float)); |
370 |
|
|
if (histo == NULL | cumf == NULL) |
371 |
|
|
returnErr(TM_E_NOMEM); |
372 |
|
|
for (i = histlen; i--; ) /* make malleable copy */ |
373 |
|
|
histo[i] = tmTop->histo[i]; |
374 |
|
|
do { /* iterate to solution */ |
375 |
|
|
sum = 0; /* cumulative probability */ |
376 |
|
|
for (i = 0; i < histlen; i++) { |
377 |
|
|
cumf[i] = (double)sum/histot; |
378 |
|
|
sum += histo[i]; |
379 |
|
|
} |
380 |
|
|
cumf[i] = 1.; |
381 |
gregl |
3.6 |
Tr = histot * (double)(tmTop->hbrmax - tmTop->hbrmin) / |
382 |
greg |
3.1 |
((double)histlen*TM_BRTSCALE) / logLddyn; |
383 |
greg |
3.2 |
ceiling = Tr + 1.; |
384 |
|
|
trimmings = 0; /* clip to envelope */ |
385 |
|
|
for (i = histlen; i--; ) { |
386 |
|
|
if (tmTop->flags & TM_F_HCONTR) { |
387 |
|
|
Lw = tmLuminance(brt0 + i*HISTEP); |
388 |
|
|
Ld = Ldmin * exp( logLddyn * |
389 |
greg |
3.1 |
.5*(cumf[i]+cumf[i+1]) ); |
390 |
greg |
3.2 |
ceiling = Tr * (htcontrs(Ld) * Lw) / |
391 |
greg |
3.1 |
(htcontrs(Lw) * Ld) + 1.; |
392 |
greg |
3.2 |
} |
393 |
|
|
if (histo[i] > ceiling) { |
394 |
|
|
trimmings += histo[i] - ceiling; |
395 |
|
|
histo[i] = ceiling; |
396 |
|
|
} |
397 |
greg |
3.1 |
} |
398 |
greg |
3.2 |
} while ((histot -= trimmings) > threshold && |
399 |
|
|
trimmings > threshold); |
400 |
|
|
} |
401 |
|
|
/* allocate luminance map */ |
402 |
gregl |
3.6 |
if (tmTop->lumap != NULL) |
403 |
|
|
free((MEM_PTR)tmTop->lumap); |
404 |
|
|
tmTop->mbrmin = tmTop->hbrmin; |
405 |
|
|
tmTop->mbrmax = tmTop->hbrmax; |
406 |
|
|
tmTop->lumap = (unsigned short *)malloc( |
407 |
|
|
(tmTop->mbrmax-tmTop->mbrmin+1)*sizeof(unsigned short) ); |
408 |
|
|
if (tmTop->lumap == NULL) |
409 |
|
|
returnErr(TM_E_NOMEM); |
410 |
greg |
3.1 |
if (tmTop->flags & TM_F_LINEAR || histot <= threshold) { |
411 |
|
|
/* linear tone mapping */ |
412 |
|
|
if (tmTop->flags & TM_F_HCONTR) |
413 |
|
|
d = htcontrs(Ldavg) / htcontrs(Lwavg); |
414 |
|
|
else |
415 |
|
|
d = Ldavg / Lwavg; |
416 |
|
|
d = log(d/Ldmax); |
417 |
gregl |
3.6 |
for (i = tmTop->mbrmax-tmTop->mbrmin+1; i--; ) |
418 |
greg |
3.1 |
tmTop->lumap[i] = 256. * exp( |
419 |
gregl |
3.6 |
( d + (tmTop->mbrmin+i)/(double)TM_BRTSCALE ) |
420 |
greg |
3.1 |
/ gamval ); |
421 |
|
|
} else { |
422 |
|
|
/* histogram adjustment */ |
423 |
gregl |
3.6 |
for (i = tmTop->mbrmax-tmTop->mbrmin+1; i--; ) { |
424 |
|
|
j = d = (double)i/(tmTop->mbrmax-tmTop->mbrmin)*histlen; |
425 |
greg |
3.1 |
d -= (double)j; |
426 |
|
|
Ld = Ldmin*exp(logLddyn*((1.-d)*cumf[j]+d*cumf[j+1])); |
427 |
|
|
d = (Ld - Ldmin)/(Ldmax - Ldmin); |
428 |
|
|
tmTop->lumap[i] = 256.*pow(d, 1./gamval); |
429 |
|
|
} |
430 |
|
|
} |
431 |
greg |
3.2 |
if (!(tmTop->flags & TM_F_LINEAR)) { |
432 |
greg |
3.4 |
free((MEM_PTR)histo); |
433 |
|
|
free((MEM_PTR)cumf); |
434 |
greg |
3.2 |
} |
435 |
greg |
3.1 |
returnOK; |
436 |
|
|
} |
437 |
|
|
|
438 |
|
|
|
439 |
|
|
int |
440 |
|
|
tmMapPixels(ps, ls, cs, len) |
441 |
|
|
register BYTE *ps; |
442 |
|
|
TMbright *ls; |
443 |
|
|
register BYTE *cs; |
444 |
|
|
int len; |
445 |
|
|
{ |
446 |
|
|
static char funcName[] = "tmMapPixels"; |
447 |
greg |
3.4 |
register int4 li, pv; |
448 |
greg |
3.1 |
|
449 |
|
|
if (tmTop == NULL || tmTop->lumap == NULL) |
450 |
|
|
returnErr(TM_E_TMINVAL); |
451 |
|
|
if (ps == NULL | ls == NULL | len <= 0) |
452 |
|
|
returnErr(TM_E_ILLEGAL); |
453 |
|
|
while (len--) { |
454 |
gregl |
3.6 |
if ((li = *ls++) < tmTop->mbrmin) |
455 |
|
|
li = tmTop->mbrmin; |
456 |
|
|
else if (li > tmTop->mbrmax) |
457 |
|
|
li = tmTop->mbrmax; |
458 |
|
|
li = tmTop->lumap[li - tmTop->mbrmin]; |
459 |
greg |
3.1 |
if (cs == TM_NOCHROM) |
460 |
|
|
*ps++ = li>255 ? 255 : li; |
461 |
|
|
else { |
462 |
greg |
3.4 |
pv = *cs++ * li / tmTop->cdiv[RED]; |
463 |
greg |
3.1 |
*ps++ = pv>255 ? 255 : pv; |
464 |
greg |
3.4 |
pv = *cs++ * li / tmTop->cdiv[GRN]; |
465 |
greg |
3.1 |
*ps++ = pv>255 ? 255 : pv; |
466 |
greg |
3.4 |
pv = *cs++ * li / tmTop->cdiv[BLU]; |
467 |
greg |
3.1 |
*ps++ = pv>255 ? 255 : pv; |
468 |
|
|
} |
469 |
|
|
} |
470 |
|
|
returnOK; |
471 |
|
|
} |
472 |
|
|
|
473 |
|
|
|
474 |
|
|
struct tmStruct * |
475 |
|
|
tmPop() /* pop top tone mapping off stack */ |
476 |
|
|
{ |
477 |
|
|
register struct tmStruct *tms; |
478 |
|
|
|
479 |
|
|
if ((tms = tmTop) != NULL) |
480 |
|
|
tmTop = tms->tmprev; |
481 |
|
|
return(tms); |
482 |
|
|
} |
483 |
|
|
|
484 |
|
|
|
485 |
|
|
int |
486 |
|
|
tmPull(tms) /* pull a tone mapping from stack */ |
487 |
|
|
register struct tmStruct *tms; |
488 |
|
|
{ |
489 |
|
|
register struct tmStruct *tms2; |
490 |
|
|
/* special cases first */ |
491 |
|
|
if (tms == NULL | tmTop == NULL) |
492 |
|
|
return(0); |
493 |
|
|
if (tms == tmTop) { |
494 |
|
|
tmTop = tms->tmprev; |
495 |
|
|
tms->tmprev = NULL; |
496 |
|
|
return(1); |
497 |
|
|
} |
498 |
|
|
for (tms2 = tmTop; tms2->tmprev != NULL; tms2 = tms2->tmprev) |
499 |
|
|
if (tms == tms2->tmprev) { /* remove it */ |
500 |
|
|
tms2->tmprev = tms->tmprev; |
501 |
|
|
tms->tmprev = NULL; |
502 |
|
|
return(1); |
503 |
|
|
} |
504 |
|
|
return(0); /* not found on stack */ |
505 |
|
|
} |
506 |
|
|
|
507 |
|
|
|
508 |
greg |
3.3 |
struct tmStruct * |
509 |
|
|
tmDup() /* duplicate top tone mapping */ |
510 |
|
|
{ |
511 |
|
|
int len; |
512 |
|
|
register int i; |
513 |
|
|
register struct tmStruct *tmnew; |
514 |
|
|
|
515 |
|
|
if (tmTop == NULL) /* anything to duplicate? */ |
516 |
|
|
return(NULL); |
517 |
|
|
tmnew = (struct tmStruct *)malloc(sizeof(struct tmStruct)); |
518 |
|
|
if (tmnew == NULL) |
519 |
|
|
return(NULL); |
520 |
|
|
*tmnew = *tmTop; /* copy everything */ |
521 |
|
|
if (tmnew->histo != NULL) { /* duplicate histogram */ |
522 |
gregl |
3.6 |
len = (tmnew->hbrmax-MINBRT)/HISTEP + 1 - |
523 |
|
|
(tmnew->hbrmin-MINBRT)/HISTEP; |
524 |
greg |
3.3 |
tmnew->histo = (int *)malloc(len*sizeof(int)); |
525 |
|
|
if (tmnew->histo != NULL) |
526 |
|
|
for (i = len; i--; ) |
527 |
|
|
tmnew->histo[i] = tmTop->histo[i]; |
528 |
|
|
} |
529 |
|
|
if (tmnew->lumap != NULL) { /* duplicate luminance mapping */ |
530 |
gregl |
3.6 |
len = tmnew->mbrmax-tmnew->mbrmin+1; |
531 |
greg |
3.3 |
tmnew->lumap = (unsigned short *)malloc( |
532 |
|
|
len*sizeof(unsigned short) ); |
533 |
|
|
if (tmnew->lumap != NULL) |
534 |
|
|
for (i = len; i--; ) |
535 |
|
|
tmnew->lumap[i] = tmTop->lumap[i]; |
536 |
|
|
} |
537 |
greg |
3.4 |
/* clear package data */ |
538 |
|
|
for (i = tmNumPkgs; i--; ) |
539 |
|
|
tmnew->pd[i] = NULL; |
540 |
greg |
3.3 |
tmnew->tmprev = tmTop; /* make copy current */ |
541 |
|
|
return(tmTop = tmnew); |
542 |
|
|
} |
543 |
|
|
|
544 |
|
|
|
545 |
greg |
3.1 |
int |
546 |
|
|
tmPush(tms) /* push tone mapping on top of stack */ |
547 |
|
|
register struct tmStruct *tms; |
548 |
|
|
{ |
549 |
|
|
static char funcName[] = "tmPush"; |
550 |
|
|
/* check validity */ |
551 |
greg |
3.4 |
if (tms == NULL) |
552 |
greg |
3.1 |
returnErr(TM_E_ILLEGAL); |
553 |
|
|
if (tms == tmTop) /* check necessity */ |
554 |
|
|
returnOK; |
555 |
|
|
/* pull if already in stack */ |
556 |
|
|
(void)tmPull(tms); |
557 |
|
|
/* push it on top */ |
558 |
|
|
tms->tmprev = tmTop; |
559 |
|
|
tmTop = tms; |
560 |
|
|
returnOK; |
561 |
|
|
} |
562 |
|
|
|
563 |
|
|
|
564 |
|
|
void |
565 |
|
|
tmDone(tms) /* done with tone mapping -- destroy it */ |
566 |
|
|
register struct tmStruct *tms; |
567 |
|
|
{ |
568 |
greg |
3.4 |
register int i; |
569 |
greg |
3.1 |
/* NULL arg. is equiv. to tmTop */ |
570 |
|
|
if (tms == NULL && (tms = tmTop) == NULL) |
571 |
|
|
return; |
572 |
|
|
/* take out of stack if present */ |
573 |
|
|
(void)tmPull(tms); |
574 |
|
|
/* free tables */ |
575 |
|
|
if (tms->histo != NULL) |
576 |
greg |
3.4 |
free((MEM_PTR)tms->histo); |
577 |
greg |
3.1 |
if (tms->lumap != NULL) |
578 |
greg |
3.4 |
free((MEM_PTR)tms->lumap); |
579 |
|
|
/* free private data */ |
580 |
|
|
for (i = tmNumPkgs; i--; ) |
581 |
|
|
if (tms->pd[i] != NULL) |
582 |
|
|
(*tmPkg[i]->Free)(tms->pd[i]); |
583 |
|
|
free((MEM_PTR)tms); /* free basic structure */ |
584 |
greg |
3.1 |
} |