summaryrefslogtreecommitdiff
path: root/java/awt/image/AffineTransformOp.java
blob: 7820684d24b6d3778f7f9054665402c978ce91ba (plain)
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
/* AffineTransformOp.java --  This class performs affine 
   transformation between two images or rasters in 2 dimensions.
   Copyright (C) 2004, 2006 Free Software Foundation

This file is part of GNU Classpath.

GNU Classpath 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, or (at your option)
any later version.

GNU Classpath 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 GNU Classpath; see the file COPYING.  If not, write to the
Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA
02110-1301 USA.

Linking this library statically or dynamically with other modules is
making a combined work based on this library.  Thus, the terms and
conditions of the GNU General Public License cover the whole
combination.

As a special exception, the copyright holders of this library give you
permission to link this library with independent modules to produce an
executable, regardless of the license terms of these independent
modules, and to copy and distribute the resulting executable under
terms of your choice, provided that you also meet, for each linked
independent module, the terms and conditions of the license of that
module.  An independent module is a module which is not derived from
or based on this library.  If you modify this library, you may extend
this exception to your version of the library, but you are not
obligated to do so.  If you do not wish to do so, delete this
exception statement from your version. */

package java.awt.image;

import java.awt.Graphics2D;
import java.awt.Rectangle;
import java.awt.RenderingHints;
import java.awt.geom.AffineTransform;
import java.awt.geom.NoninvertibleTransformException;
import java.awt.geom.Point2D;
import java.awt.geom.Rectangle2D;
import java.util.Arrays;

/**
 * This class performs affine transformation between two images or 
 * rasters in 2 dimensions. 
 *
 * @author Olga Rodimina (rodimina@redhat.com) 
 * @author Francis Kung (fkung@redhat.com)
 */
public class AffineTransformOp implements BufferedImageOp, RasterOp
{
    public static final int TYPE_NEAREST_NEIGHBOR = 1;
    
    public static final int TYPE_BILINEAR = 2;
    
    /**
     * @since 1.5.0
     */
    public static final int TYPE_BICUBIC = 3;

    private AffineTransform transform;
    private RenderingHints hints;
    
    /**
     * Construct AffineTransformOp with the given xform and interpolationType.
     * Interpolation type can be TYPE_BILINEAR, TYPE_BICUBIC or
     * TYPE_NEAREST_NEIGHBOR.
     *
     * @param xform AffineTransform that will applied to the source image 
     * @param interpolationType type of interpolation used
     * @throws ImagingOpException if the transform matrix is noninvertible
     */
    public AffineTransformOp (AffineTransform xform, int interpolationType)
    {
      this.transform = xform;
      if (xform.getDeterminant() == 0)
        throw new ImagingOpException(null);

      switch (interpolationType)
      {
      case TYPE_BILINEAR:
        hints = new RenderingHints (RenderingHints.KEY_INTERPOLATION, 
                                    RenderingHints.VALUE_INTERPOLATION_BILINEAR);
        break;
      case TYPE_BICUBIC:
        hints = new RenderingHints (RenderingHints.KEY_INTERPOLATION, 
				    RenderingHints.VALUE_INTERPOLATION_BICUBIC);
        break;
      default:
        hints = new RenderingHints (RenderingHints.KEY_INTERPOLATION,
                                    RenderingHints.VALUE_INTERPOLATION_NEAREST_NEIGHBOR);
      }
    }

    /**
     * Construct AffineTransformOp with the given xform and rendering hints.
     * 
     * @param xform AffineTransform that will applied to the source image
     * @param hints rendering hints that will be used during transformation
     * @throws ImagingOpException if the transform matrix is noninvertible
     */
    public AffineTransformOp (AffineTransform xform, RenderingHints hints)
    {
      this.transform = xform;
      this.hints = hints;
      if (xform.getDeterminant() == 0)
        throw new ImagingOpException(null);
    }

    /**
     * Creates empty BufferedImage with the size equal to that of the 
     * transformed image and correct number of bands. The newly created 
     * image is created with the specified ColorModel. 
     * If the ColorModel is equal to null, an appropriate ColorModel is used.
     *
     * @param src source image
     * @param destCM color model for the destination image
     * @return new compatible destination image
     */
    public BufferedImage createCompatibleDestImage (BufferedImage src,
                                                    ColorModel destCM)
    {
      if (destCM != null)
        return new BufferedImage(destCM,
                                 createCompatibleDestRaster(src.getRaster()),
                                 src.isAlphaPremultiplied(), null);

      // This behaviour was determined by Mauve testcases, and is compatible
      // with the reference implementation
      if (src.getType() == BufferedImage.TYPE_INT_ARGB_PRE
          || src.getType() == BufferedImage.TYPE_4BYTE_ABGR
          || src.getType() == BufferedImage.TYPE_4BYTE_ABGR_PRE)
        return new BufferedImage(src.getWidth(), src.getHeight(), src.getType());

      else
        return new BufferedImage(src.getWidth(), src.getHeight(),
                                 BufferedImage.TYPE_INT_ARGB);
    }

    /**
     * Creates empty WritableRaster with the size equal to the transformed 
     * source raster and correct number of bands 
     *
     * @param src source raster
     * @throws RasterFormatException if resulting width or height of raster is 0
     * @return new compatible raster
     */
    public WritableRaster createCompatibleDestRaster (Raster src)
    {
      Rectangle2D rect = getBounds2D(src);
      
      // throw RasterFormatException if resulting width or height of the
      // transformed raster is 0

      if (rect.getWidth () == 0 || rect.getHeight () == 0) 
        throw new RasterFormatException("width or height is 0");

      return src.createCompatibleWritableRaster((int) rect.getWidth(), 
                                                (int) rect.getHeight());
    }

    /**
     * Transforms source image using transform specified at the constructor.
     * The resulting transformed image is stored in the destination image if one
     * is provided; otherwise a new BufferedImage is created and returned. 
     *
     * @param src source image
     * @param dst destination image
     * @throws IllegalArgumentException if the source and destination image are
     *          the same
     * @return transformed source image
     */
    public final BufferedImage filter (BufferedImage src, BufferedImage dst)
    {

      if (dst == src)
        throw new IllegalArgumentException ("src image cannot be the same as " +
                "the dst image");

      // If the destination image is null, then use a compatible BufferedImage  
      if (dst == null)
        dst = createCompatibleDestImage(src, null);

      Graphics2D gr = (Graphics2D) dst.createGraphics ();
      gr.setRenderingHints (hints);	
      gr.drawImage (src, transform, null);
      return dst;

    }

    /**
     * Transforms source raster using transform specified at the constructor.
     * The resulting raster is stored in the destination raster if it is not
     * null, otherwise a new raster is created and returned.
     *
     * @param src source raster
     * @param dst destination raster
     * @throws IllegalArgumentException if the source and destination are not
     *          compatible
     * @return transformed raster
     */
    public final WritableRaster filter (Raster src, WritableRaster dst)
    {
      if (dst == src)
        throw new IllegalArgumentException("src image cannot be the same as"
					   + " the dst image");

      if (dst == null)
        dst = createCompatibleDestRaster(src);

      if (src.getNumBands() != dst.getNumBands())
        throw new IllegalArgumentException("src and dst must have same number"
					   + " of bands");
      
      // Create arrays to hold all the points
      double[] dstPts = new double[dst.getHeight() * dst.getWidth() * 2];
      double[] srcPts = new double[dst.getHeight() * dst.getWidth() * 2];

      // Populate array with all points in the *destination* raster
      int i = 0;
      for (int x = 0; x < dst.getWidth(); x++)
        {
          for (int y = 0; y < dst.getHeight(); y++)
            {
              dstPts[i++] = x;
              dstPts[i++] = y;
            }
        }
      Rectangle srcbounds = src.getBounds();

      // Use an inverse transform to map each point in the destination to
      // a point in the source.  Note that, while all points in the destination
      // matrix are integers, this is not necessarily true for points in the
      // source (hence why interpolation is required) 
      try
        {
          AffineTransform inverseTx = transform.createInverse();
          inverseTx.transform(dstPts, 0, srcPts, 0, dstPts.length / 2);
        }
      catch (NoninvertibleTransformException e)
        {
          // Shouldn't happen since the constructor traps this
          throw new ImagingOpException(e.getMessage());
        }

      // Different interpolation methods...
      if (hints.containsValue(RenderingHints.VALUE_INTERPOLATION_NEAREST_NEIGHBOR))
        filterNearest(src, dst, dstPts, srcPts);
      
      else if (hints.containsValue(RenderingHints.VALUE_INTERPOLATION_BILINEAR))
        filterBilinear(src, dst, dstPts, srcPts);
    
      else          // bicubic
        filterBicubic(src, dst, dstPts, srcPts);

      return dst;  
    }

    /**
     * Transforms source image using transform specified at the constructor and 
     * returns bounds of the transformed image.
     *
     * @param src image to be transformed
     * @return bounds of the transformed image.
     */
    public final Rectangle2D getBounds2D (BufferedImage src)
    {
      return getBounds2D (src.getRaster());
    }
   
    /**
     * Returns bounds of the transformed raster.
     *
     * @param src raster to be transformed
     * @return bounds of the transformed raster.
     */
    public final Rectangle2D getBounds2D (Raster src)
    {
      return transform.createTransformedShape(src.getBounds()).getBounds2D();
    }

    /**
     * Returns interpolation type used during transformations
     *
     * @return interpolation type
     */
    public final int getInterpolationType ()
    {
      if (hints.containsValue(RenderingHints.VALUE_INTERPOLATION_BILINEAR))
        return TYPE_BILINEAR;
      
      else if (hints.containsValue(RenderingHints.VALUE_INTERPOLATION_BICUBIC))
        return TYPE_BICUBIC;
      
      else 
        return TYPE_NEAREST_NEIGHBOR;
    }

    /** 
     * Returns location of the transformed source point. The resulting point 
     * is stored in the dstPt if one is specified.
     *  
     * @param srcPt point to be transformed
     * @param dstPt destination point
     * @return the location of the transformed source point.
     */
    public final Point2D getPoint2D (Point2D srcPt, Point2D dstPt)
    {
      return transform.transform (srcPt, dstPt);
    }

    /**
     * Returns rendering hints that are used during transformation.
     *
     * @return rendering hints
     */
    public final RenderingHints getRenderingHints ()
    {
      return hints;
    }

    /**
     * Returns transform used in transformation between source and destination
     * image.
     *
     * @return transform
     */
    public final AffineTransform getTransform ()
    {
      return transform;
    }
    
    /**
     * Perform nearest-neighbour filtering
     * 
     * @param src the source raster
     * @param dst the destination raster
     * @param dpts array of points on the destination raster
     * @param pts array of corresponding points on the source raster
     */
    private void filterNearest(Raster src, WritableRaster dst, double[] dpts,
                               double[] pts)
    {
      Rectangle srcbounds = src.getBounds();
  
      // For all points on the destination raster, copy the value from the
      // corrosponding (rounded) source point
      for (int i = 0; i < dpts.length; i += 2)
        {
          int srcX = (int) Math.round(pts[i]) + src.getMinX();
          int srcY = (int) Math.round(pts[i + 1]) + src.getMinY();
          
          if (srcbounds.contains(srcX, srcY))
            dst.setDataElements((int) dpts[i] + dst.getMinX(),
                                (int) dpts[i + 1] + dst.getMinY(),
                                src.getDataElements(srcX, srcY, null));
        }
    }

    /**
     * Perform bilinear filtering
     * 
     * @param src the source raster
     * @param dst the destination raster
     * @param dpts array of points on the destination raster
     * @param pts array of corresponding points on the source raster
     */
    private void filterBilinear(Raster src, WritableRaster dst, double[] dpts,
                              double[] pts)
    {
      Rectangle srcbounds = src.getBounds();
  
      // For all points in the destination raster, use bilinear interpolation
      // to find the value from the corrosponding source points
      for (int i = 0; i < dpts.length; i += 2)
        {
          int srcX = (int) Math.round(pts[i]) + src.getMinX();
          int srcY = (int) Math.round(pts[i + 1]) + src.getMinY();
          
          if (srcbounds.contains(srcX, srcY))
            {
              // Corner case at the bottom or right edge; use nearest neighbour
              if (pts[i] >= src.getWidth() - 1
                  || pts[i + 1] >= src.getHeight() - 1)
                dst.setDataElements((int) dpts[i] + dst.getMinX(),
                                    (int) dpts[i + 1] + dst.getMinY(),
                                    src.getDataElements(srcX, srcY, null));
  
              // Standard case, apply the bilinear formula
              else
                {
                  int x = (int) Math.floor(pts[i] + src.getMinX());
                  int y = (int) Math.floor(pts[i + 1] + src.getMinY());
                  double xdiff = pts[i] + src.getMinX() - x;
                  double ydiff = pts[i + 1] + src.getMinY() - y;
  
                  // Run the interpolation for each band
                  for (int j = 0; j < src.getNumBands(); j++)
                    {
                      double result = (src.getSampleDouble(x, y, j) * (1 - xdiff)
                                         + src.getSampleDouble(x + 1, y, j) * xdiff)
                                       * (1 - ydiff)
                                       + (src.getSampleDouble(x, y + 1, j)
                                          * (1 - xdiff)
                                          + src.getSampleDouble(x + 1, y + 1, j)
                                          * xdiff)
                                       * ydiff;
                      dst.setSample((int) dpts[i] + dst.getMinX(),
                                    (int) dpts[i + 1] + dst.getMinY(),
                                    j, result);
                    }
                }
            }
        }
    }

    /**
     * Perform bicubic filtering
     * based on http://local.wasp.uwa.edu.au/~pbourke/colour/bicubic/
     * 
     * @param src the source raster
     * @param dst the destination raster
     * @param dpts array of points on the destination raster
     * @param pts array of corresponding points on the source raster
     */
    private void filterBicubic(Raster src, WritableRaster dst, double[] dpts,
                               double[] pts)
    {
      Rectangle srcbounds = src.getBounds();
  
      // For all points on the destination raster, perform bicubic interpolation
      // from corrosponding source points
      double[] result = new double[src.getNumBands()];
      for (int i = 0; i < dpts.length; i += 2)
        {
          if (srcbounds.contains((int) Math.round(pts[i]) + src.getMinX(),
                                 (int) Math.round(pts[i + 1]) + src.getMinY()))
            {
              int x = (int) Math.floor(pts[i] + src.getMinX());
              int y = (int) Math.floor(pts[i + 1] + src.getMinY());
              double dx = pts[i] + src.getMinX() - x;
              double dy = pts[i + 1] + src.getMinY() - y;
              Arrays.fill(result, 0);
  
              for (int m = - 1; m < 3; m++)
                {
                  for (int n = - 1; n < 3; n++)
                    {
                      // R(x) = ( P(x+2)^3 - 4 P(x+1)^3 + 6 P(x)^3 - 4 P(x-1)^3 ) / 6
                      double r1 = 0;
                      double r2 = 0;
  
                      // Calculate R(m - dx)
                      double rx = m - dx + 2;
                      if (rx > 0)
                        r1 += rx * rx * rx;
  
                      rx = m - dx + 1;
                      if (rx > 0)
                        r1 -= 4 * rx * rx * rx;
  
                      rx = m - dx;
                      if (rx > 0)
                        r1 += 6 * rx * rx * rx;
  
                      rx = m - dx - 1;
                      if (rx > 0)
                        r1 -= 4 * rx * rx * rx;
  
                      r1 /= 6;
  
                      // Calculate R(dy - n);
                      rx = dy - n + 2;
                      if (rx > 0)
                        r2 += rx * rx * rx;
  
                      rx = dy - n + 1;
                      if (rx > 0)
                        r2 -= 4 * rx * rx * rx;
  
                      rx = dy - n;
                      if (rx > 0)
                        r2 += 6 * rx * rx * rx;
  
                      rx = dy - n - 1;
                      if (rx > 0)
                        r2 -= 4 * rx * rx * rx;
  
                      r2 /= 6;
  
                      // Calculate F(i+m, j+n) R(m - dx) R(dy - n)
                      // Check corner cases
                      int srcX = x + m;
                      if (srcX >= src.getMinX() + src.getWidth())
                        srcX = src.getMinX() + src.getWidth() - 1;
                      else if (srcX < src.getMinX())
                        srcX = src.getMinX();

                      int srcY = y + n;
                      if (srcY >= src.getMinY() + src.getHeight())
                        srcY = src.getMinY() + src.getHeight() - 1;
                      else if (srcY < src.getMinY())
                        srcY = src.getMinY();

                      // Calculate once for each band
                      for (int j = 0; j < result.length; j++)
                        result[j] += src.getSample(srcX, srcY, j) * r1 * r2;
                    }
                }
  
              // Put it all together
              for (int j = 0; j < result.length; j++)
                dst.setSample((int) dpts[i] + dst.getMinX(),
                              (int) dpts[i + 1] + dst.getMinY(),
                              j, result[j]);
            }
        }
    }
}