搜索资源列表
The-Lagrange-interpolation-algorithm
- 基于VS2008编写，程序很简单，算法很经典实用。提出一种基于三次拉格朗日插值的自适应图像缩放算法 该算法首先计算目标像素点周围三组源像素点的方差，选取方差最小的一组源像素点，然后采用三次拉格日插值公式求得目标像素点的灰度值实验结果表明，本文算法所得的目标图像边缘清晰，且算法复杂度较低，便于硬件实现，可以实现实时图像缩放。-Based on VS2008, the program has a very simple algorithm is very classic and practical.
Mpeg2010-1-28-1233
- 用于视频中运动矢量的提取，效果很好，时间复杂度低。-Motion vector is used to extract the video, the effect is very good, low time complexity.
LDPC
- LDPC编码仿真的源码，LDPC码是一种基于矩阵构造编码和迭代译码的新型信道编码方案，它具有很低的译码复杂度，并且拥有逼近香农极限的优异性能。-LDPC coding simulation code, LDPC code is a matrix structure based on the iterative decoding of the new coding and channel coding scheme, which has a very low decoding complexity
read_ENVIimagefile
- 实现高光谱序列的读取操作，该序列是目前大家最广泛使用的一个版本， 速度快，复杂度低。-Achieve high spectral sequence reads, the sequence is currently the most widely used one everyone version, fast, low complexity.
maximumissues
- 这是算法设计的课堂作业最多约数问题，里面包括输入文件和源码，算法复杂度较低-This is the algorithm design of classroom work a maximum of about a few issues, which include the input file and source code, algorithm complexity is low
SolveOMP
- omp 算法 你可以通过这个算法完成图像恢复，效果好，恢复时间短，误码率低，解决凸优化算法复杂度高的缺点-omp algorithm you can accomplish by this algorithm for image restoration, good effect, shorter recovery time, error rate, to solve the shortcomings of convex optimization algorithm with high comple
main2
- omp 算法 你可以通过这个算法完成图像恢复，效果好，恢复时间短，误码率低，解决凸优化算法复杂度高的缺点-omp algorithm you can accomplish by this algorithm for image restoration, good effect, shorter recovery time, error rate, to solve the shortcomings of convex optimization algorithm with high comple
main
- omp 算法 你可以通过这个算法完成图像恢复，效果好，恢复时间短，误码率低，解决凸优化算法复杂度高的缺点convex optimization algorithm with high complexity-omp algorithm you can accomplish by this algorithm for image restoration, good effect, shorter recovery time, error rate, to solve the shortcomings
SolveBP
- omp 算法 你可以通过这个算法完成图像恢复，效果好，恢复时间短，误码率低，解决凸优化算法复杂度高的缺点-omp algorithm you can accomplish by this algorithm for image restoration, good effect, shorter recovery time, error rate, to solve the shortcomings of convex optimization algorithm with high comple
domp
- omp 算法 你可以通过这个算法完成图像恢复，效果好，恢复时间短，误码率低，解决凸优化算法复杂度高的缺点-omp algorithm you can accomplish by this algorithm for image restoration, good effect, shorter recovery time, error rate, to solve the shortcomings of convex optimization algorithm with high comple
LDPC-checking-matrix-generation
- 两种不同的方法构造低密度校验编码的校验矩阵，两种方法的复杂度有所不同，适合编码研究的学子们-Two different coding method for constructing low-density parity check matrix, the complexity of the two methods differ for students who study coding
6645LBP
- LBP已经成功应用于人脸检测，唇语识别，表情检测，动态纹理等等领域。其算法复杂度低，消耗内存小，原理简单.-LBP has been successfully applied to face detection, lip recognition, face detection, dynamic texture and so on. Its low algorithm complexity and memory consumption is small, simple principle.
nonlinear-state-constraints-filter
- 等式状态约束，解决了具有等式状态约束条件下的滤波问题，具有较好的滤波精度，时间复杂度较低。-Iterative shrinkage nonlinear state constraints filter
fbmp_v1_3.tar
- 经典的稀疏重构算法，即快速贝叶斯追踪算法，恢复出的信号精度高，恢复算法复杂度低-Classic sparse reconstruction algorithm, namely the bayesian tracking algorithm quickly, to restore the signal of high precision, low recovery algorithm complexity
POJ3468
- 树状数组解决区间操作_高效 对数组的某个区间进行两种操作：1）求和 2）每个数据加常数。要求：时间复杂度低 -The tree array to solve the interval _ efficient operation Two kinds of operations for a range of array: 1) the sum 2) each data with constant. Requirements: low time complexity.
顺序表逆置
- C语言实现顺序表的逆置算法，算法简单明了，时间复杂度低
problem9
- Descr iption 给定n个输入输出对，用给定的m次多项式拟合输入输出关系。当n大于多项式阶数m时，化为超定方程求解问题。这里采用最小二乘方法求解。问题建模如下： 1 化为矩阵形式： 2 其中 3 对上式求导，易得 4 利用对X的QR分解可以有效地降低上述运算的复杂度，并提高精度。请完成推导，并据此设计算法计算参数a*。 Input Descr iption 第一行输入n和m
SRC
- 稀疏表示的代码,用于人脸识别，复杂度低，基于BP算法的-SRC used for face recognition
histeq_my
- 将输入的猜的图像转换为灰度图后进行直方图均衡化，时间复杂度和空间复杂度较低-Guess the input image converted to grayscale histogram equalization, time complexity and space complexity is low
most
- 计算一个数列的众数，即出现次数最多的那个数，要求尽量低的时空复杂度-calculate a series of the plural, that is the highest number that the number of requests time and space as low complexity