File size: 6,713 Bytes
c574d3a |
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 |
import java.sql.SQLOutput;
import java.util.ArrayList;
import java.util.Collections;
public class Population {
private ArrayList<Node> closedList = new ArrayList<>();
private ArrayList<Individual> individuals;
public Population(int[][] imgArray, ArrayList<ArrayList<ArrayList<Edge>>> edges, int numSegments, int numIndividuals){
this.individuals = initRandomPopulation(imgArray, edges, numSegments, numIndividuals);
setRanks();
sortIndividuals();
ArrayList<Individual> fronts = selectFronts(numIndividuals);
this.individuals = reduceFronts(fronts, numIndividuals);
}
public Population(int[][] imgArray, ArrayList<ArrayList<ArrayList<Edge>>> edges, ArrayList<ArrayList<ArrayList<Integer>>> newIndividualRoots, int numIndividuals){
this.individuals = initChildPopulation(imgArray, edges, newIndividualRoots);
setRanks();
sortIndividuals();
ArrayList<Individual> fronts = selectFronts(numIndividuals);
this.individuals = reduceFronts(fronts, numIndividuals);
}
public ArrayList<Individual> getIndividuals() {
return individuals;
}
public void setIndividuals(ArrayList<Individual> individuals) {
this.individuals = individuals;
}
private void setRanks(){
for(Individual i : this.individuals){
setRank(i);
}
}
private void sortIndividuals(){
Collections.sort(this.individuals);
}
private ArrayList<Individual> selectFronts(int numIndividuals){
ArrayList<Individual> acceptedIndividuals = new ArrayList<>();
int rankCounter = 1;
while (acceptedIndividuals.size() < numIndividuals*2) {
ArrayList<Individual> individualsToAdd = getAllIndividualsOfRankN(rankCounter);
if (acceptedIndividuals.size() + individualsToAdd.size() > numIndividuals * 2) {
ArrayList<Individual> toAdd = Helpers.crowdingDistance(individualsToAdd, ((acceptedIndividuals.size() + individualsToAdd.size()) - (numIndividuals * 2)));
for(Individual i : toAdd){
acceptedIndividuals.add(i);
if(acceptedIndividuals.size() == numIndividuals*2){
break;
}
}
break;
} else {
acceptedIndividuals.addAll(individualsToAdd);
if(acceptedIndividuals.size() == numIndividuals * 2){ //We added exactly as many as we needed
break;
}
}
rankCounter++;
}
return acceptedIndividuals;
}
private ArrayList<Individual> reduceFronts(ArrayList<Individual> fronts, int numIndividuals){
return Helpers.crowdingDistance(fronts, numIndividuals); //Reduce number of individuals from 2N to N=numIndividuals
}
private ArrayList<Individual> initRandomPopulation(int[][] imgArray, ArrayList<ArrayList<ArrayList<Edge>>> edges, int numSegments, int numIndividuals){
ArrayList<Node> rootNodes;
ArrayList<Individual> individuals = new ArrayList<>();
for (int i = 0; i < numIndividuals * 3; i++) {
ArrayList<ArrayList<Node>> nodes = Helpers.initNodes(imgArray);
rootNodes = Helpers.initRootNodes(nodes, numSegments);
MST.prim(rootNodes, nodes, edges, numSegments);
ArrayList<Segment> segments = BFS.BFS(rootNodes);
individuals.add(new Individual(segments, nodes));
}
return individuals;
}
private ArrayList<Individual> initChildPopulation(int[][] imgArray, ArrayList<ArrayList<ArrayList<Edge>>> edges, ArrayList<ArrayList<ArrayList<Integer>>> newIndividualRoots){
ArrayList<Individual> individuals = new ArrayList<>();
for (int i = 0; i < newIndividualRoots.size(); i++) {
ArrayList<ArrayList<Node>> nodes = Helpers.initNodes(imgArray);
ArrayList<Node> rootNodes = new ArrayList<>();
for(ArrayList<Integer> rootCoord : newIndividualRoots.get(i)){
nodes.get(rootCoord.get(0)).get(rootCoord.get(1)).setRoot(true);
rootNodes.add(nodes.get(rootCoord.get(0)).get(rootCoord.get(1)));
}
MST.prim(rootNodes, nodes, edges, rootNodes.size());
ArrayList<Segment> segments = BFS.BFS(rootNodes);
individuals.add(new Individual(segments, nodes));
}
return individuals;
}
/*private void createRandomIndividuals(BufferedImage img, int numCentroids, int numIndividuals){
for (int i = 0; i < 3*numIndividuals; i++) {
ArrayList<ArrayList<Node>> nodes = initNodes(img);
ArrayList<Centroid> centroids = initCentroids(img, numCentroids);
ArrayList<Node> startNodes = getStartNodes(centroids, nodes);
ArrayList<SearchPath> searches = initSearches(startNodes);
dijkstra(img, nodes, searches, centroids);
Helpers.setAvgColor(centroids);
this.individuals.add(new Individual(centroids));
}
}*/
/*private void runIndividuals(BufferedImage img, int numCentroids, ArrayList<Individual> individuals) {
for (int i = 0; i < individuals.size(); i++) {
Individual currentIndividual = individuals.get(i);
ArrayList<ArrayList<Node>> nodes = initNodes(img);
ArrayList<Node> startNodes = getStartNodes(currentIndividual.getCentroids(), nodes);
ArrayList<SearchPath> searches = initSearches(startNodes);
dijkstra(img, nodes, searches, currentIndividual.getCentroids());
Helpers.setAvgColor(currentIndividual.getCentroids());
}
this.individuals = individuals;
}*/
public ArrayList<Individual> getAllIndividualsOfRankN(int n){
ArrayList<Individual> returned_individuals = new ArrayList<Individual>();
for(Individual i : this.individuals){
if (i.getRank() == n){
returned_individuals.add(i);
}
}
return returned_individuals;
}
public void setRank(Individual i){
int rank = 1;
for (Individual individual : this.individuals){
if(individual != i){
if(isDominated(i, individual)){
rank++;
}
}
}
i.setRank(rank);
}
public boolean isDominated(Individual i, Individual o){
if(i.getEdgeValue() > o.getEdgeValue() && i.getOverallDeviation() > o.getOverallDeviation()){
return true;
}
return false;
}
}
|