-
Notifications
You must be signed in to change notification settings - Fork 48
/
Bitmap.java
782 lines (680 loc) · 27.8 KB
/
Bitmap.java
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
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
package bdsup2sub.bitmap;
import bdsup2sub.core.Core;
import bdsup2sub.filters.Filter;
import bdsup2sub.filters.FilterOp;
import bdsup2sub.tools.QuantizeFilter;
import java.awt.image.*;
import java.util.Arrays;
import java.util.HashMap;
import static bdsup2sub.bitmap.ColorSpaceUtils.RGB2YCbCr;
/*
* Copyright 2009 Volker Oth (0xdeadbeef)
*
* Licensed under the Apache License, Version 2.0 (the "License");
* you may not use this file except in compliance with the License.
* You may obtain a copy of the License at
*
* http://www.apache.org/licenses/LICENSE-2.0
*
* Unless required by applicable law or agreed to in writing, software
* distributed under the License is distributed on an "AS IS" BASIS,
* WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
* See the License for the specific language governing permissions and
* limitations under the License.
*/
/**
* Class to handle byte based bitmaps with a separate palette up to 256 colors.
*
* @author 0xdeadbeef
*
*/
public class Bitmap {
/** Bitmap width in pixels */
private final int width;
/** Bitmap height in pixels */
private final int height;
/** Byte array containing image data */
private final byte buffer[];
public Bitmap(int width, int height) {
this.width = width;
this.height = height;
buffer = new byte[width * height];
}
public Bitmap(int width, int height, byte fillerColorIndex) {
this(width, height);
fillWithColorIndexValue(fillerColorIndex);
}
public Bitmap(int width, int height, byte[] buffer) {
this.width = width;
this.height = height;
this.buffer = buffer;
}
public Bitmap(Bitmap bitmap) {
width = bitmap.width;
height = bitmap.height;
buffer = Arrays.copyOf(bitmap.buffer, bitmap.buffer.length);
}
private void fillWithColorIndexValue(byte colorIndex) {
for (int i = 0; i < width * height; i++)
buffer[i] = colorIndex;
}
public void fillRectangularWithColorIndex(int rectX, int rectY, int rectWidth, int rectHeight, byte colorIndex) {
int xMax = rectX + rectWidth;
if (xMax > width) {
xMax = width;
}
int yMax = rectY+rectHeight;
if (yMax > height) {
yMax = height;
}
for (int y = rectY; y < yMax; y++) {
int yOfs = y * width;
for (int x = rectX; x < xMax; x++) {
buffer[yOfs + x] = colorIndex;
}
}
}
public BufferedImage getImage(ColorModel colorModel) {
DataBuffer dataBuffer = new DataBufferByte(buffer, width * height);
SampleModel sampleModel = new SinglePixelPackedSampleModel(DataBuffer.TYPE_BYTE, width, height, new int[]{ 0xff });
WritableRaster raster = Raster.createWritableRaster(sampleModel, dataBuffer, null);
return new BufferedImage(colorModel, raster, false, null);
}
public int getPrimaryColorIndex(byte[] alpha, int alphaThreshold, byte[] luma) {
int colorIndexCount = alpha.length;
int[] histogram = createHistogram(colorIndexCount);
weightHistogramWithAlphaAndLumaValues(histogram, alpha, alphaThreshold, luma);
return getColorIndexWithTheHighestValue(histogram);
}
private int[] createHistogram(int colorIndexCount) {
int histogram[] = new int[colorIndexCount];
Arrays.fill(histogram, 0);
for (byte b : buffer) {
histogram[(b & 0xff)]++;
}
return histogram;
}
private void weightHistogramWithAlphaAndLumaValues(int[] histogram, byte[] alphaValues, int alphaThreshold, byte[] lumaValues) {
for (int i = 0; i < histogram.length; i++) {
int alpha = alphaValues[i] & 0xff;
if (alpha < alphaThreshold) {
alpha = 0;
}
histogram[i] = (histogram[i] * alpha + 128) / 256; // prefer opaque
int luma = lumaValues[i] & 0xff;
histogram[i] = (histogram[i] * luma + 128) / 256; // prefer light
}
}
private int getColorIndexWithTheHighestValue(int[] histogram) {
int maxValue = 0;
int colorIndex = 0;
for (int i=0; i < histogram.length; i++) {
if (histogram[i] > maxValue) {
maxValue = histogram[i];
colorIndex = i;
}
}
return colorIndex;
}
public int getHighestVisibleColorIndex(byte[] alphaValues) {
int maxColorIndex = 0;
for (byte b : buffer) {
int colorIndex = b & 0xff;
if ((alphaValues[colorIndex] & 0xff) > 0) {
if (colorIndex > maxColorIndex) {
maxColorIndex = colorIndex;
if (maxColorIndex == 255) {
break;
}
}
}
}
return maxColorIndex;
}
/**
* Convert a palettized Bitmap (where each palette entry has individual alpha)
* to a Bitmap with N color palette, where:
* index0 = transparent (background), index1 = light color (pattern), ... , indexN-2 = dark color, indexN-1 = black.
*
* For N-1 luminances, N-2 thresholds are needed
* lumaThreshold[0] is the threshold for the lightest color (-> index 1)
* lumaThreshold[N-2] is the threshold for the darkest color (-> index N-1)
*/
public Bitmap getBitmapWithNormalizedPalette(byte[] alphaValues, int alphaThreshold, byte[] lumaValues, int lumaThreshold[]) {
Bitmap bm = new Bitmap(width, height);
HashMap<Integer, Integer> p = new HashMap<Integer, Integer>();
int newColorIndex;
for (int i = 0; i < buffer.length; i++) {
int colorIndex = buffer[i] & 0xff;
int alpha = alphaValues[colorIndex] & 0xff;
int luma = lumaValues[colorIndex] & 0xff;
Integer existingColorIndex = p.get((alpha << 8) | luma);
if (existingColorIndex != null) {
newColorIndex = existingColorIndex;
}
else {
if (alpha < alphaThreshold) {
newColorIndex = 0; // transparent color
} else {
newColorIndex = 1; // default: lightest color
for (int threshold : lumaThreshold) {
if (luma > threshold) {
break;
}
newColorIndex++; // try next darker color
}
}
p.put((alpha << 8) | luma, newColorIndex);
}
bm.buffer[i] = (byte)newColorIndex;
}
return bm;
}
/**
* Scales a palettized Bitmap (where each palette entry has individual alpha) using bilinear filtering
* to a Bitmap with N color palette, where:
* index0 = transparent, index1 = light color, ... , indexN-2 = dark color, indexN-1 = black.
* @param sizeX Target width
* @param sizeY Target height
* @param pal Palette of the source Bitmap
* @param alphaThr Threshold for alpha (transparency), lower = more transparent
* @param lumThr Threshold for luminances. For N-1 luminances, N-2 thresholds are needed
* lumThr[0] is the threshold for the lightest color (-> idx 1)
* lumThr[N-2] is the threshold for the darkest color (-> idx N-1)
* @return Scaled Bitmap which uses a fixed frame Palette.
*/
public Bitmap scaleBilinearLm(final int sizeX, final int sizeY, final Palette pal, final int alphaThr, final int lumThr[]) {
final byte[] cy = pal.getY();
final byte[] a = pal.getAlpha();
final double scaleX = (double)(width - 1) / (sizeX - 1);
final double scaleY = (double)(height - 1) / (sizeY - 1);
int lastCY = 0;
int lastA = 0;
int lastColIdx = 0; // 0 is the transparent color
Bitmap trg = new Bitmap(sizeX, sizeY);
for (int yt = 0; yt < sizeY; yt++) {
double ys = yt * scaleY; // source coordinate
int ysi = (int)ys;
double wy = (ys - ysi);
double wy1 = 1.0 - wy;
for (int xt = 0; xt < sizeX; xt++) {
double xs = xt * scaleX; // source coordinate
int xsi = (int)xs;
double wx = (xs - xsi); // weight factor
double wx1 = 1.0 - wx;
// interpolate pixel
// top left
double w = wx1 * wy1;
int idx = getPixel(xsi, ysi) & 0xff;
double at = (a[idx] & 0xff) * w;
double cyt = (cy[idx] & 0xff) * w;
// top right
if (xsi < width - 1) {
w = wx * wy1;
idx = getPixel(xsi + 1, ysi) & 0xff;
at += (a[idx] & 0xff) * w;
cyt += (cy[idx] & 0xff) * w;
} // else assume transparent black
// bottom left
if (ysi < height-1) {
w = wx1 * wy;
idx = getPixel(xsi, ysi + 1) & 0xff;
at += (a[idx] & 0xff) * w;
cyt += (cy[idx] & 0xff) * w;
} // else assume transparent black
// bottom right
if ((ysi < height - 1) && (xsi < width - 1)) {
w = wx * wy;
idx = getPixel(xsi + 1, ysi + 1) & 0xff;
at += (a[idx] & 0xff) * w;
cyt += (cy[idx] & 0xff) * w;
} // else assume transparent black
int ati = (int)at;
int cyti = (int)cyt;
// find color index in palette
// already known ?
int colIdx = lastColIdx;
if (ati != lastA || cyti != lastCY ) {
// determine index in target
if (ati < alphaThr) {
colIdx = 0; // transparent color
} else {
colIdx = 1; // default: lightest color
for (int threshold : lumThr) {
if (cyti > threshold) {
break;
}
colIdx++; // try next darker color
}
}
// remember
lastA = ati;
lastCY = cyti;
lastColIdx = colIdx;
}
// write target pixel
trg.setPixel(xt, yt, (byte)colIdx);
}
}
return trg;
}
/**
* Scales a palettized Bitmap (where each palette entry has individual alpha) using a given scaling filter
* to a Bitmap with N color palette, where:
* index0 = transparent, index1 = light color, ... , indexN-2 = dark color, indexN-1 = black
* @param sizeX Target width
* @param sizeY Target height
* @param pal Palette of the source Bitmap
* @param alphaThr Threshold for alpha (transparency), lower = more transparent
* @param lumThr Threshold for luminances. For N-1 luminances, N-2 thresholds are needed
* lumThr[0] is the threshold for the lightest color (-> idx 1)
* lumThr[N-2] is the threshold for the darkest color (-> idx N-1)
* @param f Filter for scaling
* @return Scaled Bitmap which uses a fixed frame Palette.
*/
public Bitmap scaleFilterLm(final int sizeX, final int sizeY, final Palette pal, final int alphaThr, final int lumThr[], final Filter f) {
FilterOp fOp = new FilterOp();
fOp.setFilter(f);
final int[] trg = fOp.filter(this, pal, sizeX, sizeY);
Bitmap bm = new Bitmap(sizeX, sizeY);
// select nearest colors in existing palette
HashMap<Integer, Integer> p = new HashMap<Integer, Integer>();
for (int i = 0; i < trg.length; i++) {
int color = trg[i];
int colIdx;
Integer idxEx = p.get(color);
if (idxEx != null) {
colIdx = idxEx;
}
else {
int alpha = (color >> 24) & 0xff;
int red = (color >> 16) & 0xff;
int green = (color >> 8) & 0xff;
int blue = color & 0xff;
int cyp = RGB2YCbCr(red, green, blue, false)[0];
// determine index in target
if (alpha < alphaThr) {
colIdx = 0; // transparent color
} else {
colIdx = 1; // default: lightest color
for (int threshold : lumThr) {
if (cyp > threshold) {
break;
}
colIdx++; // try next darker color
}
}
p.put(color, colIdx);
}
// write target pixel
bm.buffer[i] = (byte)colIdx;
}
return bm;
}
/** Scales a palettized Bitmap to a Bitmap with the same palette using bilinear filtering.
* @param sizeX Target width
* @param sizeY Target height
* @param pal Palette of the source Bitmap
* @return Scaled Bitmap which uses the same Palette as the source Bitmap.
*/
public Bitmap scaleBilinear(final int sizeX, final int sizeY, final Palette pal) {
final byte[] r = pal.getR();
final byte[] g = pal.getG();
final byte[] b = pal.getB();
final byte[] a = pal.getAlpha();
final double scaleX = (double)(width - 1) / (sizeX - 1);
final double scaleY = (double)(height - 1) / (sizeY - 1);
int lastR = 0;
int lastG = 0;
int lastB = 0;
int lastA = 0;
int lastColIdx = pal.getIndexOfMostTransparentPaletteEntry();
final Bitmap trg = new Bitmap(sizeX, sizeY);
for (int yt = 0; yt < sizeY; yt++) {
double ys = yt * scaleY; // source coordinate
int ysi = (int)ys;
double wy = (ys - ysi);
double wy1 = 1.0 - wy;
for (int xt = 0; xt < sizeX; xt++) {
double xs = xt * scaleX; // source coordinate
int xsi = (int)xs;
double wx = (xs - xsi); // weight factor
double wx1 = 1.0 - wx;
// interpolate pixel
// top left
double w = wx1 * wy1;
int idx = getPixel(xsi, ysi) & 0xff;
double at = (a[idx] & 0xff) * w;
double rt = (r[idx] & 0xff) * w;
double gt = (g[idx] & 0xff) * w;
double bt = (b[idx] & 0xff) * w;
// top right
if (xsi < width - 1) {
w = wx * wy1;
idx = getPixel(xsi + 1, ysi) & 0xff;
at += (a[idx] & 0xff) * w;
rt += (r[idx] & 0xff) * w;
gt += (g[idx] & 0xff) * w;
bt += (b[idx] & 0xff) * w;
} // else assume transparent black
// bottom left
if (ysi < height - 1) {
w = wx1 * wy;
idx = getPixel(xsi, ysi + 1) & 0xff;
at += (a[idx] & 0xff) * w;
rt += (r[idx] & 0xff) * w;
gt += (g[idx] & 0xff) * w;
bt += (b[idx] & 0xff) * w;
} // else assume transparent black
// bottom right
if ((ysi < height - 1) && (xsi < width - 1)) {
w = wx * wy;
idx = getPixel(xsi + 1, ysi + 1) & 0xff;
at += (a[idx] & 0xff) * w;
rt += (r[idx] & 0xff) * w;
gt += (g[idx] & 0xff) * w;
bt += (b[idx] & 0xff) * w;
} // else assume transparent black
int ati = (int)(at + 0.5);
int rti = (int)(rt + 0.5);
int gti = (int)(gt + 0.5);
int bti = (int)(bt + 0.5);
// find color index in palette
// already known ?
int colIdx = lastColIdx;
if (ati != lastA || rti != lastR || gti != lastG || bti!=lastB) {
int minDistance = 0xffffff; // init > 0xff*0xff*4 = 0x03f804
for (idx = 0; idx < pal.getSize(); idx++) {
// distance vector (skip sqrt)
int ad = ati - (a[idx] & 0xff);
int rd = rti - (r[idx] & 0xff);
int gd = gti - (g[idx] & 0xff);
int bd = bti - (b[idx] & 0xff);
int distance = rd * rd + gd * gd + bd * bd + ad * ad;
// new minimum distance ?
if ( distance < minDistance) {
colIdx = idx;
minDistance = distance;
if (minDistance == 0) {
break;
}
}
}
// remember values
lastA = ati;
lastR = rti;
lastG = gti;
lastB = bti;
lastColIdx = colIdx;
}
// write target pixel
trg.setPixel(xt, yt, (byte)colIdx);
}
}
return trg;
}
/** Scales a palettized Bitmap to a Bitmap with a new quantized Palette using bilinear filtering.
* @param sizeX Target width
* @param sizeY Target height
* @param pal Palette of the source Bitmap
* @param dither True: apply dithering
* @return Scaled Bitmap and new Palette
*/
public BitmapWithPalette scaleBilinear(final int sizeX, final int sizeY, final Palette pal, final boolean dither) {
final byte[] r = pal.getR();
final byte[] g = pal.getG();
final byte[] b = pal.getB();
final byte[] a = pal.getAlpha();
final double scaleX = (double)(width - 1) / (sizeX - 1);
final double scaleY = (double)(height - 1) / (sizeY - 1);
final int[] trg = new int[sizeX * sizeY];
for (int yt = 0; yt < sizeY; yt++) {
double ys = yt * scaleY; // source coordinate
int ysi = (int)ys;
double wy = (ys - ysi);
double wy1 = 1.0 - wy;
int ofsY = yt * sizeX;
for (int xt = 0; xt < sizeX; xt++) {
double xs = xt * scaleX; // source coordinate
int xsi = (int)xs;
double wx = (xs - xsi); // weight factor
int idx;
// interpolate pixel
double wx1 = 1.0 - wx;
int x,y;
// top left
double w = wx1 * wy1;
idx = getPixel(xsi, ysi) & 0xff;
double at = (a[idx] & 0xff) * w;
double rt = (r[idx] & 0xff) * w;
double gt = (g[idx] & 0xff) * w;
double bt = (b[idx] & 0xff) * w;
// top right
x = xsi + 1;
if (x < width) {
w = wx * wy1;
idx = getPixel(x, ysi) & 0xff;
at += (a[idx] & 0xff) * w;
rt += (r[idx] & 0xff) * w;
gt += (g[idx] & 0xff) * w;
bt += (b[idx] & 0xff) * w;
} // else assume transparent black
// bottom left
y = ysi + 1;
if (y < height) {
w = wx1 * wy;
idx = getPixel(xsi, y) & 0xff;
at += (a[idx] & 0xff) * w;
rt += (r[idx] & 0xff) * w;
gt += (g[idx] & 0xff) * w;
bt += (b[idx] & 0xff) * w;
} // else assume transparent black
// bottom right
x = xsi + 1;
y = ysi + 1;
if ((x < width) && (y < height)) {
w = wx * wy;
idx = getPixel(x, y) & 0xff;
at += (a[idx] & 0xff) * w;
rt += (r[idx] & 0xff) * w;
gt += (g[idx] & 0xff) * w;
bt += (b[idx] & 0xff) * w;
} // else assume transparent black
int ati = (int)(at);
int rti = (int)(rt);
int gti = (int)(gt);
int bti = (int)(bt);
trg[xt + ofsY] = ((ati << 24) | (rti << 16) | (gti << 8) | bti);
}
}
// quantize image
QuantizeFilter qf = new QuantizeFilter();
final Bitmap bm = new Bitmap(sizeX, sizeY);
int[] ct = qf.quantize(trg, bm.buffer, sizeX, sizeY, 255, dither, dither);
int size = ct.length;
if (size > 255) {
size = 255;
Core.printWarn("Quantizer failed.\n");
}
// create palette
Palette trgPal = new Palette(256);
for (int i = 0; i < size; i++) {
trgPal.setARGB(i,ct[i]);
}
return new BitmapWithPalette(bm, trgPal);
}
/** Scales a palettized Bitmap to a Bitmap with the same Palette using a given scaling filter.
* @param sizeX Target width
* @param sizeY Target height
* @param pal Palette of the source Bitmap
* @param f Filter for scaling
* @return Scaled Bitmap which uses the same Palette as the source Bitmap.
*/
public Bitmap scaleFilter(final int sizeX, final int sizeY, final Palette pal, final Filter f) {
final byte[] r = pal.getR();
final byte[] g = pal.getG();
final byte[] b = pal.getB();
final byte[] a = pal.getAlpha();
FilterOp fOp = new FilterOp();
fOp.setFilter(f);
final int[] trg = fOp.filter(this, pal, sizeX, sizeY);
final Bitmap bm = new Bitmap(sizeX, sizeY);
// select nearest colors in existing palette
HashMap<Integer, Integer> p = new HashMap<Integer, Integer>();
for (int i = 0; i < trg.length; i++) {
int color = trg[i];
int colIdx;
Integer idxEx = p.get(color);
if (idxEx != null) {
colIdx = idxEx;
} else {
colIdx = 0;
int minDistance = 0xffffff; // init > 0xff*0xff*4 = 0x03f804
int alpha = (color >> 24) & 0xff;
int red = (color >> 16) & 0xff;
int green = (color >> 8) & 0xff;
int blue = color & 0xff;
for (int idx = 0; idx < pal.getSize(); idx++) {
// distance vector (skip sqrt)
int ad = alpha - (a[idx] & 0xff);
int rd = red - (r[idx] & 0xff);
int gd = green - (g[idx] & 0xff);
int bd = blue - (b[idx] & 0xff);
int distance = rd * rd + gd * gd + bd * bd + ad * ad;
// new minimum distance ?
if ( distance < minDistance) {
colIdx = idx;
minDistance = distance;
if (minDistance == 0) {
break;
}
}
}
p.put(color, colIdx);
}
// write target pixel
bm.buffer[i] = (byte)colIdx;
}
return bm;
}
/** Scales a palettized Bitmap to a Bitmap with a new quantized Palette using a given scaling filter.
* @param sizeX Target width
* @param sizeY Target height
* @param pal Palette of the source Bitmap
* @param f Filter for scaling
* @param dither True: apply dithering
* @return Scaled Bitmap and new Palette
*/
public BitmapWithPalette scaleFilter(final int sizeX, final int sizeY, final Palette pal, final Filter f, final boolean dither) {
FilterOp fOp = new FilterOp();
fOp.setFilter(f);
final int[] trg = fOp.filter(this, pal, sizeX, sizeY);
// quantize image
QuantizeFilter qf = new QuantizeFilter();
final Bitmap bm = new Bitmap(sizeX, sizeY);
int[] ct = qf.quantize(trg, bm.buffer, sizeX, sizeY, 255, dither, dither);
int size = ct.length;
if (size > 255) {
size = 255;
Core.printWarn("Quantizer failed.\n");
}
// create palette
Palette trgPal = new Palette(256);
for (int i = 0; i < size; i++) {
trgPal.setARGB(i, ct[i]);
}
return new BitmapWithPalette(bm, trgPal);
}
public int[] toARGB(Palette pal) {
int[] argbValues = new int[buffer.length];
for (int i = 0; i < argbValues.length; i++) {
argbValues[i] = pal.getARGB(buffer[i] & 0xff);
}
return argbValues;
}
public Bitmap crop(int xOffset, int yOffset, int croppedBitmapWidth, int croppedBitmapHeight) {
Bitmap bitmap = new Bitmap(croppedBitmapWidth, croppedBitmapHeight);
int yOfsSrc = yOffset * width;
int yOfsTrg = 0;
for (int i = 0; i < croppedBitmapHeight; i++, yOfsSrc += width, yOfsTrg += croppedBitmapWidth) {
for (int xTrg = 0; xTrg < croppedBitmapWidth; xTrg++) {
bitmap.buffer[xTrg + yOfsTrg] = buffer[xOffset + xTrg + yOfsSrc];
}
}
return bitmap;
}
public BitmapBounds getCroppingBounds(byte[] alpha, int alphaThreshold) {
int xMin, xMax, yMin, yMax;
// search lower bound
yMax = height - 1;
int yOfs = yMax * width;
for (int y = height - 1; y > 0; y--, yOfs -= width) {
yMax = y;
if (isRowWithColorAboveAlphaThreshold(yOfs, alpha, alphaThreshold)) {
break;
}
}
// search upper bound
yMin = 0;
yOfs = 0;
for (int y = 0; y < yMax; y++, yOfs += width) {
yMin = y;
if (isRowWithColorAboveAlphaThreshold(yOfs, alpha, alphaThreshold)) {
break;
}
}
// search right bound
xMax = width-1;
for (int x = width - 1; x > 0; x--) {
xMax = x;
if (isColumnWithColorAboveAlphaThreshold(x, yMin, yMax, alpha, alphaThreshold)) {
break;
}
}
// search left bound
xMin = 0;
for (int x = 0; x < xMax; x++) {
xMin = x;
if (isColumnWithColorAboveAlphaThreshold(x, yMin, yMax, alpha, alphaThreshold)) {
break;
}
}
return new BitmapBounds(xMin, xMax, yMin, yMax);
}
private boolean isRowWithColorAboveAlphaThreshold(int yOfs, byte[] alpha, int alphaThreshold) {
for (int x = 0; x < width; x++) {
if (isColorAboveAlphaThreshold(yOfs + x, alpha, alphaThreshold)) {
return true;
}
}
return false;
}
private boolean isColumnWithColorAboveAlphaThreshold(int x, int yMin, int yMax, byte[] alpha, int alphaThreshold) {
int yOfs = yMin * width;
for (int i = yMin; i < yMax; i++, yOfs += width) {
if (isColorAboveAlphaThreshold(yOfs + x, alpha, alphaThreshold)) {
return true;
}
}
return false;
}
private boolean isColorAboveAlphaThreshold(int bufferIndex, byte[] alpha, int alphaThreshold) {
int idx = buffer[bufferIndex] & 0xff;
return (alpha[idx] & 0xff) >= alphaThreshold;
}
public int getWidth() {
return width;
}
public int getHeight() {
return height;
}
public byte[] getInternalBuffer() {
return buffer;
}
private byte getPixel(int x, int y) {
return buffer[x + width * y];
}
private void setPixel(int x, int y, byte color) {
buffer[x + width * y] = color;
}
}