bear-only-tracking3

基于MAP的超分辨率重建算法，附有说明，使得大家方便运行。(The super-resolution by map.)

自己毕业设计做的改进的基于某vc视频处理框架代码的重心多目标跟踪代码(The center of gravity of a vc video processing framework code-based target tracking code own graduation design improvements do)

使用选择式掩膜平滑方法进行数字图像的边缘提取(Select the type mask smoothing method using digital image edge extraction)

【高斯核函数改进 参考价值1】LBF活动轮廓模型的改进.pdf【高斯核函数的改进 参考价值5】单核和多核相关向量机的比较研究.pdf([Gaussian kernel improved reference value 1] .pdf LBF improved active contour models comparative study [.pdf Gaussian kernel improvements reference 5] single and multi-core related vector machine)

This is an implementation of a ACCV 2010 paper, Exploiting Self-Similarities for Single Frame Super-Resolution.

冲激函数、阶跃函数及三角函数的小波变换、模极大线并求它们的李氏指数(The impulse function, step function and wavelet transform of the trigonometric function, the modulus maxima line and the Lipschitz exponents)

数字摄影测量中的最小二乘匹配算法，带示例图像(Feature points matching using LSTM)

说明：  实现平滑0范数压缩感知算法，主要对二维图像进行压缩感知重构。自行设置图像的采样数目、添加图像即可运行，无需修改。(Realizes a smooth 0-norm compressed sensing algorithm, mainly for compressed sensing reconstruction of two-dimensional images. Set the sample number of the image by yourself, add the image to run, no need to modify.)

在一个具有几个顶点的连通图G中，如果存在子图G 包含G中所有顶点和一部分边，且不形成回路，则称G 为图G的生成树，代价最小生成树则称为最小生成树。 (Has several vertices in a connected graph G, if there subgraph G ' contains all vertices of G and part of the side, and does not form a loop, called G' is a spanning tree of G, the minimum cost spanning tree is called minimum spanning tree.)

说明：  SAD立体匹配程序，附带测试图像.立体匹配学习的好内容。(SAD stereo matching process, attached to the test image. Stereo Matching learn the content.)