-
Copy Move Image Forgery Detection using SIFT
Matlab code for copy-move forgery detection
- 2019-03-25 19:29:15下载
- 积分：1
-
Spikes can be taken as absolute quantities of measuring values which are large t...
Spikes can be taken as absolute quantities of measuring values which are large than approximately four (expressed as variable [Times_SD] in the program)times of the standard deviation of the time series, and can be removed by repeating 3 times with each time series. When a measuring value with the deviation from the mean larger than four times of the standard deviation, the variable can be taken as NO_VALUE, and the number of spikes is saved into the variable [SpikeNum].
If the variable [Times_SD] is taken as four, many records will be removed, so the variable [Times_SD] can be taken as larger, for example eight.
-Hasan can be taken as absolute quantities of measuring values which are large than approx imately four (expressed as variable [Times_SD ] in the program) times of the standard deviatio n of the time series. and can be removed by repeating three times with each time series. When a measuring value with the dev iation from the mean larger than four times of th e standard dev
- 2023-02-22 23:35:03下载
- 积分：1
-
VB制作
VB制作--不可思议的3D飞机游戏,好东西-VB production-- incredible 3D aircraft games, good things
- 2022-05-24 23:29:10下载
- 积分：1
-
Dongguan racetrack inquiry system, common to other inquiries systems
东莞赛马场查询系统,可通用为其他查询系统-Dongguan racetrack inquiry system, common to other inquiries systems
- 2022-03-26 12:01:37下载
- 积分：1
-
遗传算法求解多旅行商问题
旅行商问题(TravelingSalesmanProblem，TSP)是一个经典的组合优化问题。经典的TSP可以描述为：一个商品推销员要去若干个城市推销商品，该推销员从一个城市出发，需要经过所有城市后，回到出发地。应如何选择行进路线，以使总的行程最短。从图论的角度来看，该问题实质是在一个带权完全无向图中，找一个权值最小的Hamilton回路。由于该问题的可行解是所有顶点的全排列，随着顶点数的增加，会产生组合爆炸，它是一个NP完全问题。(Traveling Salesman Problem (TSP) is a classic combinatorial optimization problem. The classic TSP can be described as: a merchandiser sells goods to several cities. The salesman starts from a city and needs to go through all the cities and return to the starting point. How to choose the route of travel so that the total journey is the shortest. From the point of view of graph theory, the essence of the problem is to find a Hamilton loop with the smallest weight in a completely undirected graph with weights. Since the feasible solution to this problem is the full permutation of all vertices, as the number of vertices increases, a combinatorial explosion occurs, which is an NP-complete problem.)
- 2020-06-17 11:00:02下载
- 积分：1
-
Kalman
这个是卡尔曼滤波器的源码，主要用于视频序列的预测跟踪。(This is the source of the Kalman filter, mainly for video sequence tracking the prediction.)
- 2008-04-17 18:03:40下载
- 积分：1
-
1
说明： 1到33的任意6个数字，他们之和加起来是61，或者改掉sum数字，让他们和为你想要的数字(1 to33Any 6 numbers, and they add up to 61, or get rid of sum numbers, and make them as the number you want
)
- 2012-05-02 13:08:48下载
- 积分：1
-
TW2835NOTEBOOK
TW2835的笔记，希望对大家有所帮助吧。谢谢支持。(TW2835 notes, want to help everyone bar. Thank your support.)
- 2010-02-08 17:28:12下载
- 积分：1
-
安装包制作程序，很适合一般人使用，特别推荐！
安装包制作程序，很适合一般人使用，特别推荐！-Installation package production process, it is suitable for general use, in particular the recommendation!
- 2022-07-05 06:48:43下载
- 积分：1
-
重要的资源
python神经网络书中的代码，非常使用的学习资料(the code in<python nerual net>, this is trully useful)
- 2019-04-18 18:29:43下载
- 积分：1
