28 |
|
#define MINSAMP 7 |
29 |
|
/* maximum distance^2 before color reassign */ |
30 |
|
#define MAXDST2 12 |
31 |
– |
/* maximum frame buffer depth */ |
32 |
– |
#define FBDEPTH 8 |
31 |
|
/* map a color */ |
32 |
|
#define map_col(c,p) clrmap[p][ colval(c,p)<1. ? \ |
33 |
|
(int)(colval(c,p)*256.) : 255 ] |
35 |
|
#define CNODE short |
36 |
|
#define set_branch(p,c) ((c)<<2|(p)) |
37 |
|
#define set_pval(pv) ((pv)<<2|3) |
38 |
+ |
#define is_branch(cn) (((cn)&3)!=3) |
39 |
|
#define is_pval(cn) (((cn)&3)==3) |
40 |
|
#define part(cn) ((cn)>>2) |
41 |
|
#define prim(cn) ((cn)&3) |
42 |
|
#define pval(cn) ((cn)>>2) |
43 |
|
/* our color table */ |
44 |
< |
struct tabent { |
44 |
> |
static struct tabent { |
45 |
|
long sum[3]; /* sum of colors using this entry */ |
46 |
|
long n; /* number of colors */ |
47 |
|
short ent[3]; /* current table value */ |
48 |
< |
} clrtab[1<<FBDEPTH]; |
48 |
> |
} *clrtab = NULL; |
49 |
> |
/* color cube partition */ |
50 |
> |
static CNODE *ctree = NULL; |
51 |
|
/* our color correction map */ |
52 |
|
static BYTE clrmap[3][256]; |
53 |
|
/* histogram of colors used */ |
54 |
< |
static unsigned histo[NRED][NGRN][NBLU]; |
55 |
< |
/* initial color cube boundaries */ |
54 |
> |
static unsigned short histo[NRED][NGRN][NBLU]; |
55 |
> |
/* initial color cube boundary */ |
56 |
|
static int CLRCUBE[3][2] = {0,NRED,0,NGRN,0,NBLU}; |
56 |
– |
/* color cube partition */ |
57 |
– |
static CNODE ctree[1<<(FBDEPTH+1)]; |
57 |
|
|
58 |
|
|
59 |
|
int |
60 |
|
new_ctab(ncolors) /* start new color table with max ncolors */ |
61 |
|
int ncolors; |
62 |
|
{ |
63 |
< |
if (ncolors < 1 || ncolors > 1<<FBDEPTH) |
63 |
> |
int treesize; |
64 |
> |
|
65 |
> |
if (ncolors < 1) |
66 |
|
return(0); |
67 |
< |
/* clear color table */ |
68 |
< |
bzero(clrtab, sizeof(clrtab)); |
67 |
> |
/* free old tables */ |
68 |
> |
if (clrtab != NULL) |
69 |
> |
free((char *)clrtab); |
70 |
> |
if (ctree != NULL) |
71 |
> |
free((char *)ctree); |
72 |
> |
/* get new tables */ |
73 |
> |
for (treesize = 1; treesize < ncolors; treesize <<= 1) |
74 |
> |
; |
75 |
> |
treesize <<= 1; |
76 |
> |
clrtab = (struct tabent *)calloc(ncolors, sizeof(struct tabent)); |
77 |
> |
ctree = (CNODE *)malloc(treesize*sizeof(CNODE)); |
78 |
> |
if (clrtab == NULL || ctree == NULL) |
79 |
> |
return(0); |
80 |
|
/* partition color space */ |
81 |
< |
cut(ctree, FBDEPTH, CLRCUBE, 0, ncolors); |
81 |
> |
cut(ctree, 0, CLRCUBE, 0, ncolors); |
82 |
|
/* clear histogram */ |
83 |
|
bzero(histo, sizeof(histo)); |
84 |
|
/* return number of colors used */ |
93 |
|
{ |
94 |
|
int r, g, b; |
95 |
|
int cv[3]; |
96 |
< |
register union { CNODE *t; struct tabent *e; } p; |
96 |
> |
register CNODE *tp; |
97 |
|
register int h; |
98 |
|
/* map color */ |
99 |
|
r = map_col(col,RED); |
106 |
|
/* add to histogram */ |
107 |
|
histo[cv[RED]][cv[GRN]][cv[BLU]]++; |
108 |
|
/* find pixel in tree */ |
109 |
< |
p.t = ctree; |
110 |
< |
for (h = FBDEPTH; h > 0; h--) { |
111 |
< |
if (is_pval(*p.t)) |
100 |
< |
break; |
101 |
< |
if (cv[prim(*p.t)] < part(*p.t)) |
102 |
< |
p.t++; /* left branch */ |
109 |
> |
for (tp = ctree, h = 0; is_branch(*tp); h++) |
110 |
> |
if (cv[prim(*tp)] < part(*tp)) |
111 |
> |
tp += 1<<h; /* left branch */ |
112 |
|
else |
113 |
< |
p.t += 1<<h; /* right branch */ |
114 |
< |
} |
106 |
< |
h = pval(*p.t); |
113 |
> |
tp += 1<<(h+1); /* right branch */ |
114 |
> |
h = pval(*tp); |
115 |
|
/* add to color table */ |
116 |
< |
p.e = clrtab + h; |
117 |
< |
/* add to sum */ |
118 |
< |
p.e->sum[RED] += r; |
119 |
< |
p.e->sum[GRN] += g; |
112 |
< |
p.e->sum[BLU] += b; |
113 |
< |
p.e->n++; |
116 |
> |
clrtab[h].sum[RED] += r; |
117 |
> |
clrtab[h].sum[GRN] += g; |
118 |
> |
clrtab[h].sum[BLU] += b; |
119 |
> |
clrtab[h].n++; |
120 |
|
/* recompute average */ |
121 |
< |
r = p.e->sum[RED] / p.e->n; |
122 |
< |
g = p.e->sum[GRN] / p.e->n; |
123 |
< |
b = p.e->sum[BLU] / p.e->n; |
121 |
> |
r = clrtab[h].sum[RED] / clrtab[h].n; |
122 |
> |
g = clrtab[h].sum[GRN] / clrtab[h].n; |
123 |
> |
b = clrtab[h].sum[BLU] / clrtab[h].n; |
124 |
|
/* check for movement */ |
125 |
< |
if (p.e->n == 1 || |
126 |
< |
(r-p.e->ent[RED])*(r-p.e->ent[RED]) + |
127 |
< |
(g-p.e->ent[GRN])*(g-p.e->ent[GRN]) + |
128 |
< |
(b-p.e->ent[BLU])*(b-p.e->ent[BLU]) > MAXDST2) { |
129 |
< |
p.e->ent[RED] = r; |
130 |
< |
p.e->ent[GRN] = g; /* reassign pixel */ |
131 |
< |
p.e->ent[BLU] = b; |
125 |
> |
if (clrtab[h].n == 1 || |
126 |
> |
(r-clrtab[h].ent[RED])*(r-clrtab[h].ent[RED]) + |
127 |
> |
(g-clrtab[h].ent[GRN])*(g-clrtab[h].ent[GRN]) + |
128 |
> |
(b-clrtab[h].ent[BLU])*(b-clrtab[h].ent[BLU]) > MAXDST2) { |
129 |
> |
clrtab[h].ent[RED] = r; |
130 |
> |
clrtab[h].ent[GRN] = g; /* reassign pixel */ |
131 |
> |
clrtab[h].ent[BLU] = b; |
132 |
|
#ifdef notdef |
133 |
|
printf("pixel %d = (%d,%d,%d) (%d refs)\n", |
134 |
< |
h, r, g, b, p.e->n); |
134 |
> |
h, r, g, b, clrtab[h].n); |
135 |
|
#endif |
136 |
|
(*set_pixel)(h, r, g, b); |
137 |
|
} |
162 |
|
|
163 |
|
|
164 |
|
static |
165 |
< |
cut(tree, height, box, c0, c1) /* partition color space */ |
165 |
> |
cut(tree, level, box, c0, c1) /* partition color space */ |
166 |
|
register CNODE *tree; |
167 |
< |
int height; |
167 |
> |
int level; |
168 |
|
register int box[3][2]; |
169 |
|
int c0, c1; |
170 |
|
{ |
179 |
|
bcopy(box, kb, sizeof(kb)); |
180 |
|
/* do left (lesser) branch */ |
181 |
|
kb[prim(*tree)][1] = part(*tree); |
182 |
< |
cut(tree+1, height-1, kb, c0, (c0+c1)>>1); |
182 |
> |
cut(tree+(1<<level), level+1, kb, c0, (c0+c1)>>1); |
183 |
|
/* do right branch */ |
184 |
|
kb[prim(*tree)][0] = part(*tree); |
185 |
|
kb[prim(*tree)][1] = box[prim(*tree)][1]; |
186 |
< |
cut(tree+(1<<height), height-1, kb, (c0+c1)>>1, c1); |
186 |
> |
cut(tree+(1<<(level+1)), level+1, kb, (c0+c1)>>1, c1); |
187 |
|
} |
188 |
|
|
189 |
|
|