gpt4 book ai didi

java - 高斯函数结果不准确

转载 作者:行者123 更新时间:2023-12-02 12:55:05 25 4
gpt4 key购买 nike

我有这个高斯函数。这没有产生预期的结果。因此图像无法正确模糊。在下面的代码中,我采用了内核大小(5)和西格玛值(1),这与我在下面的链接中采用的相同。如果有人能指出问题将会非常有帮助。

这是一个网站的链接Gaussian kernle link

public class KernelDemo {

public double[][] Calculate(int lenght, double weight) {
double[][] Kernel = new double[lenght][lenght];
double sumTotal = 0;
int kernelRadius = lenght / 2;
double distance = 0;

double calculatedEuler = 1.0 / (2.0 * Math.PI * Math.pow(weight, 2));

for (int filterY = -kernelRadius; filterY <= kernelRadius; filterY++) {
for (int filterX = -kernelRadius; filterX <= kernelRadius; filterX++) {
distance = ((filterX * filterX) + (filterY * filterY)) / (2 * (weight * weight));

Kernel[filterY + kernelRadius][filterX + kernelRadius] = calculatedEuler * Math.exp(-distance);

sumTotal += Kernel[filterY + kernelRadius][filterX + kernelRadius];
}
}

for (int y = 0; y < lenght; y++) {
for (int x = 0; x < lenght; x++) {
Kernel[y][x] = Kernel[y][x] * (1.0 / sumTotal);
}
}
return Kernel;
}

public static void main(String args[]) {
KernelDemo kd = new KernelDemo();
double terms[][];
terms = kd.Calculate(5,1);
for (int i = 0; i < 5; i++) {
for (int j = 0; j < 5; j++) {
System.out.print(terms[i][j]);
}
System.out.println();
}

}
}

最佳答案

这就是我处理生成二维高斯分布内核的方式。 Kernel 类只是一个 double[][] 包装,以强制执行某些规定(例如方阵 5x5 7x7,并确保长度为奇数)

public static Kernel generateBlurKernel(int length, double std){
Kernel out = new Kernel(length);

int center = length/2;
for(int i=0;i<length;i++){
for(int j=0;j<length;j++){
int x = Math.abs(j-center);
int y = Math.abs(i-center);
out.setValueAt(j, i, ((1d/(2*Math.PI*std*std))*Math.pow(Math.E, -((x*x)+(y*y))/(2*std*std))));
}
}
out.normalize();
return out;
}

如果您需要它,这也是我的 Kernel 类:

public class Kernel {

private final double[][] matrix;

public Kernel(int sidelength){
if((sidelength&1)==0)throw new IllegalArgumentException();
matrix = new double[sidelength][sidelength];
}


public double getValueAt(int x, int y){
return matrix[x][y];
}
public void setValueAt(int x, int y, double value){
matrix[x][y] = value;
}
public double sum(){
double sum = 0.0d;
for(double[] da:matrix){
for(double d:da){
sum+=d;
}
}
return sum;
}
public double[][] getFullKernal(){
return matrix;
}
public int getSideLegth(){
return matrix.length;
}
public void normalize(){
double normalizedConstant = 1d/sum();
for(int i=0;i<matrix.length;i++){
for(int j=0;j<matrix.length;j++){
matrix[i][j] = matrix[i][j]*normalizedConstant;
}
}
}
}

关于java - 高斯函数结果不准确,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/44459817/

25 4 0
Copyright 2021 - 2024 cfsdn All Rights Reserved 蜀ICP备2022000587号
广告合作:1813099741@qq.com 6ren.com