1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
|
/* */
/* Little cms - profiler construction set */
/* Copyright (C) 1998-2001 Marti Maria <marti@littlecms.com> */
/* */
/* THIS SOFTWARE IS PROVIDED "AS-IS" AND WITHOUT WARRANTY OF ANY KIND, */
/* EXPRESS, IMPLIED OR OTHERWISE, INCLUDING WITHOUT LIMITATION, ANY */
/* WARRANTY OF MERCHANTABILITY OR FITNESS FOR A PARTICULAR PURPOSE. */
/* */
/* IN NO EVENT SHALL MARTI MARIA BE LIABLE FOR ANY SPECIAL, INCIDENTAL, */
/* INDIRECT OR CONSEQUENTIAL DAMAGES OF ANY KIND, */
/* OR ANY DAMAGES WHATSOEVER RESULTING FROM LOSS OF USE, DATA OR PROFITS, */
/* WHETHER OR NOT ADVISED OF THE POSSIBILITY OF DAMAGE, AND ON ANY THEORY OF */
/* LIABILITY, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE */
/* OF THIS SOFTWARE. */
/* */
/* This file 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 2 of the License, or */
/* (at your option) any later version. */
/* */
/* This program 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 this program; if not, write to the Free Software */
/* Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA. */
/* */
/* As a special exception to the GNU General Public License, if you */
/* distribute this file as part of a program that contains a */
/* configuration script generated by Autoconf, you may include it under */
/* the same distribution terms that you use for the rest of that program. */
/* */
/* Version 1.09a */
/* */
/* Incremental Interpolator */
#include "lcmsprf.h"
/* Res points to a result in XYZ or Lab */
BOOL cdecl cmsxRegressionInterpolatorRGB(LPMEASUREMENT m,
int ColorSpace,
int RegressionTerms,
BOOL lUseLocalPatches,
int MinPatchesToCollect,
double r, double g, double b,
void* Res);
/* -------------------------------------------------------------- Implementation */
/* #define DEBUG 1 */
/* Estimate regression matrix */
static
void EstimateRegression(LPMEASUREMENT m, double r, double g, double b,
int ColorSpace,
LPMATN* ptfm,
int nterms,
BOOL lIncludeAllPatches,
int MinPatchesToCollect)
{
int nCollected;
MLRSTATISTICS maxAns;
int ToCollect;
SETOFPATCHES collected = cmsxPCollBuildSet(m, false);
SETOFPATCHES allowed = cmsxPCollBuildSet(m, true);
BOOL rc;
BOOL lPatchesExhausted = false;
CopyMemory(allowed, m -> Allowed, m->nPatches*sizeof(BOOL));
*ptfm = NULL;
ToCollect = max(MinPatchesToCollect, (nterms + 1));
do {
if (lIncludeAllPatches) {
CopyMemory(collected, allowed, m->nPatches*sizeof(BOOL));
lPatchesExhausted = true;
ToCollect = nCollected = m->nPatches;
}
else
{
nCollected = cmsxPCollPatchesNearRGB(m, m -> Allowed,
r, g, b,
ToCollect, collected);
if (nCollected < ToCollect) { /* No more patches available */
lPatchesExhausted = true;
}
else {
ToCollect = nCollected + 1; /* Start from here in next iteration */
}
}
/* We are going always 3 -> 3 for now.... */
rc = cmsxRegressionCreateMatrix(m, collected, nterms, ColorSpace, ptfm, &maxAns);
/* Does fit? */
if ((rc == false) || maxAns.R2adj < 0.95 || maxAns.R2adj > 1.0) {
maxAns.R2adj = -100; /* No, repeat */
}
} while (!lPatchesExhausted && maxAns.R2adj < 0.95);
#ifdef DEBUG
printf("R2adj: %g, F: %g\n", maxAns.R2adj, maxAns.F);
#endif
free(collected);
free(allowed);
}
BOOL cmsxRegressionInterpolatorRGB(LPMEASUREMENT m,
int ColorSpace,
int RegressionTerms,
BOOL lUseLocalPatches,
int MinPatchesToCollect,
double r, double g, double b,
void* Res)
{
LPMATN tfm = NULL;
EstimateRegression(m, r, g, b, ColorSpace, &tfm, RegressionTerms,
!lUseLocalPatches, MinPatchesToCollect);
if (tfm == NULL) return false;
switch (ColorSpace) {
case PT_Lab:
if (!cmsxRegressionRGB2Lab(r, g, b, tfm, (LPcmsCIELab) Res)) return false;
break;
case PT_XYZ:
if (!cmsxRegressionRGB2XYZ(r, g, b, tfm, (LPcmsCIEXYZ) Res)) return false;
break;
default:
return false;
}
MATNfree(tfm);
#ifdef DEBUG
printf("INTERPOLATED RGB %g,%g,%g Lab %g, %g, %g \n", r , g, b,
Lab->L, Lab->a, Lab->b);
#endif
return true;
}
/* Check the results of a given regression matrix */
static
void CheckOneRegressionMatrix(LPPROFILERCOMMONDATA hdr, LPMATN Matrix,
double* Mean, double* Std, double* Max)
{
cmsCIELab Lab;
cmsCIEXYZ XYZ;
double Hit, sum, sum2, n, dE;
int i;
cmsCIEXYZ D50;
D50.X = cmsD50_XYZ() -> X* 100.;
D50.Y = cmsD50_XYZ() -> Y* 100.;
D50.Z = cmsD50_XYZ() -> Z* 100.;
Hit = sum = sum2 = n = 0;
for (i=0; i < hdr -> m.nPatches; i++) {
if (hdr -> m.Allowed[i]) {
LPPATCH p = hdr -> m.Patches + i;
if (hdr -> PCSType == PT_Lab) {
WORD ProfileLabEncoded[3];
cmsxRegressionRGB2Lab(p -> Colorant.RGB[0],
p -> Colorant.RGB[1],
p -> Colorant.RGB[2],
Matrix, &Lab);
cmsFloat2LabEncoded(ProfileLabEncoded, &Lab);
cmsLabEncoded2Float(&Lab, ProfileLabEncoded);
dE = cmsDeltaE(&Lab, &p ->Lab);
}
else {
cmsCIELab Lab2;
cmsxRegressionRGB2XYZ(p -> Colorant.RGB[0],
p -> Colorant.RGB[1],
p -> Colorant.RGB[2],
Matrix, &XYZ);
_cmsxClampXYZ100(&XYZ);
cmsXYZ2Lab(&D50, &Lab, &XYZ);
cmsXYZ2Lab(&D50, &Lab2, &p ->XYZ);
dE = cmsDeltaE(&Lab, &Lab2);
}
if (dE > Hit)
Hit = dE;
sum += dE;
sum2 += dE * dE;
n = n + 1;
}
}
*Mean = sum / n;
*Std = sqrt((n * sum2 - sum * sum) / (n*(n-1)));
*Max = Hit;
}
/* Trial-and-error in order to get best number of terms. */
int cmsxFindOptimumNumOfTerms(LPPROFILERCOMMONDATA hdr, int nMaxTerms, BOOL* lAllOk)
{
int i, BestTerms;
BOOL rc;
LPMATN Matrix = NULL;
MLRSTATISTICS Stat;
double dEmean, dEStd, dEHit, Best;
BOOL lOneFound;
BestTerms = 4;
Best = 1000.;
lOneFound = false;
for (i=4; i <= nMaxTerms; i++) { /* 55 */
rc = cmsxRegressionCreateMatrix(&hdr -> m, hdr -> m.Allowed,
i, hdr -> PCSType, &Matrix, &Stat);
if (rc && Stat.R2adj < 1 && Stat.R2adj > 0.6) {
CheckOneRegressionMatrix(hdr, Matrix, &dEmean, &dEStd, &dEHit);
if (dEStd < Best && dEHit < 50.) {
Best = dEStd;
BestTerms = i;
lOneFound = true;
}
}
MATNfree(Matrix);
Matrix = NULL;
}
*lAllOk = lOneFound;
return BestTerms;
}
|
