[英]Inaccurate result from gaussian function
我有這個高斯函數。 效果不理想。 因此,圖像無法正確模糊。 在下面的代碼中,我采用了內核大小( 5 )和sigma value( 1 ),與我在下面的鏈接中獲得的相同。 如果有人可以指出問題,那將非常有幫助。
這是網站高斯內核鏈接的鏈接
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();
}
}
}
這就是我處理生成2d高斯分布內核的方式。 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;
}
}
}
}
聲明:本站的技術帖子網頁,遵循CC BY-SA 4.0協議,如果您需要轉載,請注明本站網址或者原文地址。任何問題請咨詢:yoyou2525@163.com.