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
|
import java.awt.*;
import java.awt.image.*;
import java.applet.*;
import java.net.*;
import java.io.*;
import java.lang.Math;
import java.util.*;
import java.awt.event.*;
import javax.swing.*;
import javax.swing.JApplet;
import javax.imageio.*;
import javax.swing.event.*;
public class circleHough {
int[] input;
int[] output;
float[] template={-1,0,1,-2,0,2,-1,0,1};;
double progress;
int width;
int height;
int[] acc;
int accSize=30;
int[] results;
int r;
public void circleHough() {
progress=0;
}
public void init(int[] inputIn, int widthIn, int heightIn, int radius) {
r = radius;
width=widthIn;
height=heightIn;
input = new int[width*height];
output = new int[width*height];
input=inputIn;
for(int x=0;x<width;x++) {
for(int y=0;y<height;y++) {
output[x + (width*y)] = 0xff000000;
}
}
}
public void setLines(int lines) {
accSize=lines;
}
// hough transform for lines (polar), returns the accumulator array
public int[] process() {
// for polar we need accumulator of 180degress * the longest length in the image
int rmax = (int)Math.sqrt(width*width + height*height);
acc = new int[width * height];
for(int x=0;x<width;x++) {
for(int y=0;y<height;y++) {
acc[x*width+y] =0 ;
}
}
int x0, y0;
double t;
progress=0;
for(int x=0;x<width;x++) {
progress+=0.5;
for(int y=0;y<height;y++) {
if ((input[y*width+x] & 0xff)== 255) {
for (int theta=0; theta<360; theta++) {
t = (theta * 3.14159265) / 180;
x0 = (int)Math.round(x - r * Math.cos(t));
y0 = (int)Math.round(y - r * Math.sin(t));
if(x0 < width && x0 > 0 && y0 < height && y0 > 0) {
acc[x0 + (y0 * width)] += 1;
}
}
}
}
}
// now normalise to 255 and put in format for a pixel array
int max=0;
// Find max acc value
for(int x=0;x<width;x++) {
for(int y=0;y<height;y++) {
if (acc[x + (y * width)] > max) {
max = acc[x + (y * width)];
}
}
}
//System.out.println("Max :" + max);
// Normalise all the values
int value;
for(int x=0;x<width;x++) {
for(int y=0;y<height;y++) {
value = (int)(((double)acc[x + (y * width)]/(double)max)*255.0);
acc[x + (y * width)] = 0xff000000 | (value << 16 | value << 8 | value);
}
}
findMaxima();
System.out.println("done");
return output;
}
private int[] findMaxima() {
results = new int[accSize*3];
int[] output = new int[width*height];
for(int x=0;x<width;x++) {
for(int y=0;y<height;y++) {
int value = (acc[x + (y * width)] & 0xff);
// if its higher than lowest value add it and then sort
if (value > results[(accSize-1)*3]) {
// add to bottom of array
results[(accSize-1)*3] = value;
results[(accSize-1)*3+1] = x;
results[(accSize-1)*3+2] = y;
// shift up until its in right place
int i = (accSize-2)*3;
while ((i >= 0) && (results[i+3] > results[i])) {
for(int j=0; j<3; j++) {
int temp = results[i+j];
results[i+j] = results[i+3+j];
results[i+3+j] = temp;
}
i = i - 3;
if (i < 0) break;
}
}
}
}
double ratio=(double)(width/2)/accSize;
System.out.println("top "+accSize+" matches:");
for(int i=accSize-1; i>=0; i--){
progress+=ratio;
//System.out.println("value: " + results[i*3] + ", r: " + results[i*3+1] + ", theta: " + results[i*3+2]);
drawCircle(results[i*3], results[i*3+1], results[i*3+2]);
}
return output;
}
private void setPixel(int value, int xPos, int yPos) {
output[(yPos * width)+xPos] = 0xff000000 | (value << 16 | value << 8 | value);
}
// draw circle at x y
private void drawCircle(int pix, int xCenter, int yCenter) {
pix = 250;
int x, y, r2;
int radius = r;
r2 = r * r;
setPixel(pix, xCenter, yCenter + radius);
setPixel(pix, xCenter, yCenter - radius);
setPixel(pix, xCenter + radius, yCenter);
setPixel(pix, xCenter - radius, yCenter);
y = radius;
x = 1;
y = (int) (Math.sqrt(r2 - 1) + 0.5);
while (x < y) {
setPixel(pix, xCenter + x, yCenter + y);
setPixel(pix, xCenter + x, yCenter - y);
setPixel(pix, xCenter - x, yCenter + y);
setPixel(pix, xCenter - x, yCenter - y);
setPixel(pix, xCenter + y, yCenter + x);
setPixel(pix, xCenter + y, yCenter - x);
setPixel(pix, xCenter - y, yCenter + x);
setPixel(pix, xCenter - y, yCenter - x);
x += 1;
y = (int) (Math.sqrt(r2 - x*x) + 0.5);
}
if (x == y) {
setPixel(pix, xCenter + x, yCenter + y);
setPixel(pix, xCenter + x, yCenter - y);
setPixel(pix, xCenter - x, yCenter + y);
setPixel(pix, xCenter - x, yCenter - y);
}
}
public int[] getAcc() {
return acc;
}
public int getProgress() {
return (int)progress;
}
} |
Partager