⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 test3.java

📁 All the tool for build a network able to reconize any shapes. Very complete, a good base for anythi
💻 JAVA
字号:
package jnt;


import java.io.File;
import java.io.FileWriter;

import sdljava.SDLException;

import mouse.AfficheMatrice;
import mouse.mouseTracker;

import jnt.FFT.ComplexDouble2DFFT;

public class Test3 {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		
		mouseTracker myMouseTracker = new mouseTracker();
		
		AfficheMatrice am = new AfficheMatrice(myMouseTracker.xResolution,myMouseTracker.yResolution);
		
		double[][] newMat = new double[myMouseTracker.xResolution][myMouseTracker.yResolution];
		
		double[] newPict= new double[myMouseTracker.yResolution*myMouseTracker.xResolution*2];
		
		double[] transPict= new double[myMouseTracker.yResolution*myMouseTracker.xResolution*2];
		
		
		int k = 0;
			myMouseTracker.fill();
			for (int i=0; i<myMouseTracker.yResolution; i++){
				for (int j=0; j<myMouseTracker.xResolution; j++){
					newPict[k++]=myMouseTracker.binaryMap[j][i];
					newPict[k++]=0;
				}
			}

		ComplexDouble2DFFT methodes = new ComplexDouble2DFFT(myMouseTracker.xResolution, myMouseTracker.yResolution);
		methodes.transform(newPict);
		int j = 0;
		for (int i=0; i<newPict.length ;i++){
			if ((i%800<=33 || i%800>777) && (i<13200 || i>=306800)){
				transPict[j++]=newPict[i];
			}
			else
				transPict[j++]=0;
			}
		methodes.inverse(transPict);
		for(int i=0; i<transPict.length;i++){
			if(i%2==0){
				newMat[(i/2)%(myMouseTracker.xResolution)][i/(myMouseTracker.xResolution*2)]=transPict[i];
			}
		}
		  try
		  {
		        am.Display(newMat);
		  }
		  catch (SDLException e)
		  {e.printStackTrace();}

	}

}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -