Image transformations

[Ryan Perlman]

HOMEWORK hints please :roll: I know there is classes in the API to do this but that is not the assignment. So please don't point me to AffineTransOp(). I will just post snippits since there is alot. I GUI that load an 2 dimesional PixelImage Then I have created 4 transformation with a 2Dimesional weight array. Example

  
public class GaussainFilter implements Filter {
  public void filter(PixelImage pi) {
    int scale = 16;
    int[][] weight = {{1, 2, 1},
                      {2, 4, 2},
                      {1, 2, 1}};
    pi.calcWeight(weight, scale);
  }
}

PixelImage Class

  
 public void calcWeight(int[][] w, int scale){
    int div = scale;
    int red;
    int green;
    int blue;
    int[][] weights = w;
    Pixel[][] pic = this.getData();
    for(int row = 1; row < pic.length - 1; row++){
      for(int col = 1; col < pic[0].length - 1; col++){
      red = pic[row][col].red * (calcRed(weights)/ scale);
      green = pic[row][col].green * (calcGreen(weights) / scale);
      blue = pic[row][col].red * (calcBlue(weights) / scale);
      if(red < 0){
        red = 0;
      }else if(red > 255){
        red = 255;
      }else
        red = red;
      if(green < 0){
        green = 0;
      }else if(green > 255){
        green = 255;
      }else
        green = green;
      if(blue < 0){
        blue = 0;
      }else if(blue > 255){
        blue = 255;
      }else
        blue = blue;
      Pixel temp = new Pixel(red, green, blue);
      //System.out.println("red " + pic[row][col].red +
                         //" green " + pic[row][col].green +
                         //" blue " + pic[row][col].blue);
      pic[row][col] = temp;
      }
    }
    setData(pic);
  }
  public int calcRed(int[][] w){
    int sum = 0;
    for(int row = 0; row < w.length; row++){
      for(int col = 0; col < w[0].length; col++){
        sum = w[row][col] * w[1][1];
      }
    }
    return sum * w[1][1];
  }
  public int calcGreen(int[][] w){
    int sum = 0;
    for(int row = 0; row < w.length; row++){
      for(int col = 0; col < w[0].length; col++){
        sum += w[row][col] * w[1][1];
      }
    }
    return sum * w[1][1];
  }
  public int calcBlue(int[][] w){
    int sum = 0;
    for(int row = 0; row < w.length; row++){
      for(int col = 0; col < w[0].length; col++){
        sum += w[row][col] * w[1][1];
      }
    }
    return sum * w[1][1];
  }

Yes I know this is not right I have been fussing with it all night. I don't really understand the concept of the Convolution Operation
the only differences with the other transformation are the weights that are passed in
Any hints would be appreciated
[ April 08, 2002: Message edited by: Ryan Perlman ]