Repository navigation
Expand file tree
/
Copy pathSegmentation.java
More file actions
151 lines (124 loc) · 4.31 KB
/
Copy pathSegmentation.java
File metadata and controls
151 lines (124 loc) · 4.31 KB
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
package clojure2d.java.glitch;
import clojure2d.java.Pixels;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Arrays;
import clojure.lang.IFn;
import fastmath.vector.Vec4;
public final class Segmentation {
private int[] img;
private int w,h,no_vertices;
private ArrayList<Edge> edges = new ArrayList<Edge>();
private SegmentNode[] elements;
public Segmentation(int[] img, int w, int h) {
this.img = img;
this.w = w;
this.h = h;
no_vertices = w * h;
}
class Edge implements Comparable<Edge> {
int a,b;
double weight;
public int compareTo(Edge o) {
return this.weight<o.weight?-1:this.weight>o.weight?1:0;
}
}
class SegmentNode {
int rank,parent,size;
}
public void makeEdges(IFn distance) {
edges.clear();
for(int x=0;x<w;x++)
for(int y=0;y<h;y++) {
Vec4 c = Pixels.getColor(img,x,y,w,h,0);
if(x<w-1) {
Edge e = new Edge();
e.a = y*w+x;
e.b = y*w+x+1;
e.weight = (double)distance.invoke(c,Pixels.getColor(img,x+1,y,w,h,0));
edges.add(e);
}
if(y<h-1) {
Edge e = new Edge();
e.a = y*w+x;
e.b = (y+1)*w+x;
e.weight = (double)distance.invoke(c,Pixels.getColor(img,x,y+1,w,h,0));
edges.add(e);
}
if( (x<w-1) && (y<h-1)) {
Edge e = new Edge();
e.a = y*w+x;
e.b = (y+1)*w+x+1;
e.weight = (double)distance.invoke(c,Pixels.getColor(img,x+1,y+1,w,h,0));
edges.add(e);
}
if( (x<w-1) && (y>0)) {
Edge e = new Edge();
e.a = y*w+x;
e.b = (y-1)*w+x+1;
e.weight = (double)distance.invoke(c,Pixels.getColor(img,x+1,y-1,w,h,0));
edges.add(e);
}
}
// sort edges
Collections.sort(edges);
}
private int findEnd(int x) {
int y = x;
while(y != elements[y].parent) y = elements[y].parent;
elements[x].parent = y;
return y;
}
public int getSegment(int x, int y) {
return findEnd(y*w+x);
}
private void joinSegments(int x, int y) {
if(elements[x].rank > elements[y].rank) {
elements[y].parent = x;
elements[x].size += elements[y].size;
} else {
elements[x].parent = y;
elements[y].size += elements[x].size;
if(elements[x].rank == elements[y].rank) elements[y].rank++;
}
}
public int calculateSegmentation(IFn distance, double threshold, int min_size) {
makeEdges(distance);
return calculateSegmentation(threshold,min_size);
}
public int calculateSegmentation(double threshold, int min_size) {
int num = no_vertices;
elements = new SegmentNode[no_vertices];
// init nodes
for(int i=0;i<no_vertices;i++) {
SegmentNode s = new SegmentNode();
s.rank = 0;
s.size = 1;
s.parent = i;
elements[i]=s;
}
double[] thresholds = new double[no_vertices];
Arrays.fill(thresholds,threshold);
for(Edge edge: edges) {
int a = findEnd(edge.a);
int b = findEnd(edge.b);
if(a!=b) {
if(edge.weight <= thresholds[a] && edge.weight <= thresholds[b]) {
joinSegments(a,b);
a = findEnd(a);
thresholds[a] = edge.weight + threshold/elements[a].size;
num--;
}
}
}
for(Edge edge: edges) {
int a = findEnd(edge.a);
int b = findEnd(edge.b);
if( (a != b) && ((elements[a].size < min_size) || (elements[b].size < min_size))) {
joinSegments(a,b);
num--;
}
}
return num;
}
}