资源列表
MPEG-4encoder
- mpeg4视频压缩源程序-mpeg4 video compression source
matlabpicfuse
- 这个做图像处理相关的源码里面，里面包含图像合相关的东西，希望给大家参考-do the image processing inside the source code, which contains images related to the Hopewell things that for your reference
GEP
- 一个用JAVA写的类，不过是一个简单的有关GEP的实现，希望对大家有用。如果有密码的话，应该是“1”-a written using Java class, but is a simple realization of the GEP, useful for all. If a password, should be "one"
SGA-C++
- 这个好象也是从网络上找到一个基本遗传算法的例子，解压缩的时候如果需要密码的话，应该是“1”。-It seems from the network to find a basic example of the genetic algorithm, decompress the password if necessary, should be "one."
SGA_java
- 用JAVA写的遗传算法的例子，比较简单，如果解压缩的时候需要密码的话，应该是“1”。写的比较简单。是老早以前写的了。-using Java to write the genetic algorithm example, relatively simple, if decompression time requires a password, then it should be "one." The relatively simple to write. Before long
Matlab_Image_Processing
- Matlab在图像处理与目标识别方面的应用实验程序示例。包括三个程序以及详细文档：一、染色体识别与统计，二、汽车牌照定位与字符识别，三、基于BP神经网络识别字符的简单实验。-Matlab in image processing and object recognition on the application of experimental procedures example. Including the three procedures and the detailed documentat
nqueens9901
- 著名的n皇后问题。实现结果为 请输入这是一个几皇后问题:4 4皇后问题有解为: 2 4 1 3 4皇后问题有解为: 3 1 4 2 Press any key to continue -n Queen's famous question. To achieve results Please enter several This is a Queen's : 4 Queen of the solutions to these problems : 2 4
beibaowenti007
- 用动态规划的向后处理法求解背包问题的最优决策序列。即给定一个背包序列的重量和相对应的效益值。做出一个最优决策序列Xi(i=1~n)，使得最终效益和最大。-dynamic planning backward processing method knapsack problem of optimal decision-making sequence. That is, given a sequence of backpack weight and the relative value of the
decodec
- 分层多描述解码 由编码程序分出的两个码流 可由此程序恢复原图像-hierarchical coding process by decoding the separation of the two bitstream This procedure can restore the original image
OCRcharacteridengtifycode
- OCR字符识别源代码，基于神经网络，用C#写的 -OCR character recognition source code, based on neural network, using the C# to write
encodc
- 2个描述的分层编码 将图像分为2个描述，并且每个描述可以单独解码-two layered image coding will be divided into two descr iptive, and can describe every single decoder
SELECT2
- 通过精心挑选划分元素v，可以得到一个最坏情况时间复杂度为O(n)的选择算法。本次实习要求用c语言将此算法实现。要求实现此功能：输入一组数，返回A[i],使其为A(m:p)中第k小的元素，k是一个全局变量，取大于1的整数-division through carefully selected elements v, one can be the worst time complexity of O (n) algorithm. The internship requirement c langua