Total members 11895 |It is currently Thu Dec 12, 2024 2:08 pm Login / Join Codemiles

Java

C/C++

PHP

C#

HTML

CSS

ASP

Javascript

JQuery

AJAX

XSD

Python

Matlab

R Scripts

Weka





Transform Rotate Filter
java code
/*
* Copyright (c) 1995-1997 Sun Microsystems, Inc. All Rights Reserved.
*
* Permission to use, copy, modify, and distribute this software
* and its documentation for NON-COMMERCIAL purposes and without
* fee is hereby granted provided that this copyright notice
* appears in all copies. Please refer to the file "copyright.html"
* for further important copyright and licensing information.
*
* SUN MAKES NO REPRESENTATIONS OR WARRANTIES ABOUT THE SUITABILITY OF
* THE SOFTWARE, EITHER EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED
* TO THE IMPLIED WARRANTIES OF MERCHANTABILITY, FITNESS FOR A
* PARTICULAR PURPOSE, OR NON-INFRINGEMENT. SUN SHALL NOT BE LIABLE FOR
* ANY DAMAGES SUFFERED BY LICENSEE AS A RESULT OF USING, MODIFYING OR
* DISTRIBUTING THIS SOFTWARE OR ITS DERIVATIVES.
*/
/*
* This file is the same in 1.0 and 1.1.
*/

import java.awt.image.ColorModel;
import java.awt.image.ImageFilter;
import java.util.Hashtable;
import java.awt.Rectangle;

public class RotateFilter extends ImageFilter {

private static ColorModel defaultRGB = ColorModel.getRGBdefault();

private double angle;
private double sin;
private double cos;
private double coord[] = new double[2];

private int raster[];
private int xoffset, yoffset;
private int srcW, srcH;
private int dstW, dstH;

public RotateFilter(double angle) {
this.angle = angle;
sin = Math.sin(angle);
cos = Math.cos(angle);
}

public void transform(double x, double y, double[] retcoord) {
// Remember that the coordinate system is upside down so apply
// the transform as if the angle were negated.
// cos(-angle) = cos(angle)
// sin(-angle) = -sin(angle)
retcoord[0] = cos * x + sin * y;
retcoord[1] = cos * y - sin * x;
}

public void itransform(double x, double y, double[] retcoord) {
// Remember that the coordinate system is upside down so apply
// the transform as if the angle were negated. Since inverting
// the transform is also the same as negating the angle, itransform
// is calculated the way you would expect to calculate transform.
retcoord[0] = cos * x - sin * y;
retcoord[1] = cos * y + sin * x;
}

public void transformBBox(Rectangle rect) {
double minx = Double.POSITIVE_INFINITY;
double miny = Double.POSITIVE_INFINITY;
double maxx = Double.NEGATIVE_INFINITY;
double maxy = Double.NEGATIVE_INFINITY;
for (int y = 0; y <= 1; y++) {
for (int x = 0; x <= 1; x++) {
transform(rect.x + x * rect.width,
rect.y + y * rect.height,
coord);
minx = Math.min(minx, coord[0]);
miny = Math.min(miny, coord[1]);
maxx = Math.max(maxx, coord[0]);
maxy = Math.max(maxy, coord[1]);
}
}
rect.x = (int) Math.floor(minx);
rect.y = (int) Math.floor(miny);
rect.width = (int) Math.ceil(maxx) - rect.x + 1;
rect.height = (int) Math.ceil(maxy) - rect.y + 1;
}

public void setDimensions(int width, int height) {
Rectangle rect = new Rectangle(0, 0, width, height);
transformBBox(rect);
xoffset = -rect.x;
yoffset = -rect.y;
srcW = width;
srcH = height;
dstW = rect.width;
dstH = rect.height;
raster = new int[srcW * srcH];
consumer.setDimensions(dstW, dstH);
}

public void setColorModel(ColorModel model) {
consumer.setColorModel(defaultRGB);
}

public void setHints(int hintflags) {
consumer.setHints(TOPDOWNLEFTRIGHT
| COMPLETESCANLINES
| SINGLEPASS
| (hintflags & SINGLEFRAME));
}

public void setPixels(int x, int y, int w, int h, ColorModel model,
byte pixels[], int off, int scansize) {
int srcoff = off;
int dstoff = y * srcW + x;
for (int yc = 0; yc < h; yc++) {
for (int xc = 0; xc < w; xc++) {
raster[dstoff++] = model.getRGB(pixels[srcoff++] & 0xff);
}
srcoff += (scansize - w);
dstoff += (srcW - w);
}
}

public void setPixels(int x, int y, int w, int h, ColorModel model,
int pixels[], int off, int scansize) {
int srcoff = off;
int dstoff = y * srcW + x;
if (model == defaultRGB) {
for (int yc = 0; yc < h; yc++) {
System.arraycopy(pixels, srcoff, raster, dstoff, w);
srcoff += scansize;
dstoff += srcW;
}
} else {
for (int yc = 0; yc < h; yc++) {
for (int xc = 0; xc < w; xc++) {
raster[dstoff++] = model.getRGB(pixels[srcoff++]);
}
srcoff += (scansize - w);
dstoff += (srcW - w);
}
}
}

public void imageComplete(int status) {
if (status == IMAGEERROR || status == IMAGEABORTED) {
consumer.imageComplete(status);
return;
}
int pixels[] = new int[dstW];
for (int dy = 0; dy < dstH; dy++) {
itransform(0 - xoffset, dy - yoffset, coord);
double x1 = coord[0];
double y1 = coord[1];
itransform(dstW - xoffset, dy - yoffset, coord);
double x2 = coord[0];
double y2 = coord[1];
double xinc = (x2 - x1) / dstW;
double yinc = (y2 - y1) / dstW;
for (int dx = 0; dx < dstW; dx++) {
int sx = (int) Math.round(x1);
int sy = (int) Math.round(y1);
if (sx < 0 || sy < 0 || sx >= srcW || sy >= srcH) {
pixels[dx] = 0;
} else {
pixels[dx] = raster[sy * srcW + sx];
}
x1 += xinc;
y1 += yinc;
}
consumer.setPixels(0, dy, dstW, 1, defaultRGB, pixels, 0, dstW);
}
consumer.imageComplete(status);
}
}




_________________
M. S. Rakha, Ph.D.
Queen's University
Canada


Author:
Mastermind
User avatar Posts: 2715
Have thanks: 74 time
Post new topic Reply to topic  [ 1 post ] 

  Related Posts  to : Transform Rotate Filter
 use of Affine Transform     -  
 Compute FFT (Fourier Transform) in ITK for a 2d image     -  
 force letters to be lowercase text-transform     -  
 Bit operations-set-get-xor-rotate on bits arrays     -  
 Rotate Image with specific angle     -  
 rotate sphere in a circle with light     -  
 Controlling the DC motor , Motor rotate clockwise Assembly     -  
 Median filter to image     -  
 wiener filter implementation     -  
 apply mean filter to image     -  



Topic Tags

Java AWT






Powered by phpBB © 2000, 2002, 2005, 2007 phpBB Group
All copyrights reserved to codemiles.com 2007-2011
mileX v1.0 designed by codemiles team
Codemiles.com is a participant in the Amazon Services LLC Associates Program, an affiliate advertising program designed to provide a means for sites to earn advertising fees by advertising and linking to Amazon.com