本文整理汇总了Java中org.openimaj.image.colour.RGBColour.coloursFromMap方法的典型用法代码示例。如果您正苦于以下问题：Java RGBColour.coloursFromMap方法的具体用法？Java RGBColour.coloursFromMap怎么用？Java RGBColour.coloursFromMap使用的例子？那么恭喜您, 这里精选的方法代码示例或许可以为您提供帮助。您也可以进一步了解该方法所在类org.openimaj.image.colour.RGBColour的用法示例。
在下文中一共展示了RGBColour.coloursFromMap方法的3个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Java代码示例。
示例1: initKMeans
import org.openimaj.image.colour.RGBColour; //导入方法依赖的package包/类
private void initKMeans() {
final int k = (Integer) kSpn.getValue();
if (this.distCombo.getSelectedItem().equals("Euclidean"))
this.distanceMeasure = FloatFVComparison.EUCLIDEAN;
else if (this.distCombo.getSelectedItem().equals("Manhatten"))
this.distanceMeasure = FloatFVComparison.CITY_BLOCK;
else if (this.distCombo.getSelectedItem().equals("Cosine Distance"))
this.distanceMeasure = FloatFVComparison.COSINE_DIST;
this.assignments = new int[this.points.size()];
this.centroids = new Point2dImpl[k];
this.colours = RGBColour.coloursFromMap(ColourMap.HSV, k);
for (int i = 0; i < k; i++) {
centroids[i] = new Point2dImpl();
centroids[i].x = (float) (Math.random() * image.getWidth());
centroids[i].y = (float) (Math.random() * image.getHeight());
}
drawCentroidsImage(false);
}
示例2: initKMeans
import org.openimaj.image.colour.RGBColour; //导入方法依赖的package包/类
private void initKMeans() {
final int k = (Integer) kSpn.getValue();
this.assignments = new int[this.points.size()];
this.centroids = new Point2dImpl[k];
this.colours = RGBColour.coloursFromMap(ColourMap.HSV, k);
for (int i = 0; i < k; i++) {
centroids[i] = new Point2dImpl();
centroids[i].x = (float) (Math.random() * image.getWidth());
centroids[i].y = (float) (Math.random() * image.getHeight());
}
drawCentroidsImage(false);
}
示例3: mergeModes
import org.openimaj.image.colour.RGBColour; //导入方法依赖的package包/类
protected void mergeModes(double[][] modePerPoint) {
final DisjointSetForest<double[]> forest = new DisjointSetForest<double[]>();
for (int i = 0; i < modePerPoint.length; i++)
forest.makeSet(modePerPoint[i]);
final DoubleKDTree tree = new DoubleKDTree(modePerPoint);
for (int i = 0; i < modePerPoint.length; i++) {
final double[] point = modePerPoint[i];
tree.radiusSearch(modePerPoint[i], kde.getScaledBandwidth(), new TIntObjectProcedure<double[]>() {
@Override
public boolean execute(int a, double[] b) {
forest.union(point, b);
return true;
}
});
}
final Set<Set<double[]>> subsets = forest.getSubsets();
this.assignments = new int[modePerPoint.length];
this.modes = new double[subsets.size()][];
this.counts = new int[subsets.size()];
int current = 0;
for (final Set<double[]> s : subsets) {
this.modes[current] = new double[modePerPoint[0].length];
for (int i = 0; i < modePerPoint.length; i++) {
if (s.contains(modePerPoint[i])) {
assignments[i] = current;
for (int j = 0; j < modes[current].length; j++) {
modes[current][j] = modePerPoint[i][j];
}
}
}
this.counts[current] = s.size();
for (int j = 0; j < modes[current].length; j++) {
modes[current][j] /= counts[current];
}
current++;
}
this.colours = RGBColour.coloursFromMap(ColourMap.HSV, current);
}