登录
首页 » matlab » HOG_LBP

HOG_LBP

于 2018-02-06 发布 文件大小:1KB
0 172
下载积分: 1 下载次数: 75

代码说明:

  融合hog与lbp特征的图像分类,使用svm进行分类,最终给出运行混淆矩阵(The image classification of hog and LBP features is classified by SVM, and the run obfuscation matrix is finally given.)

文件列表:

HOG_LBP.m, 3855 , 2018-01-11

下载说明:请别用迅雷下载,失败请重下,重下不扣分!

发表评论

0 个回复

  • sift-0.9.14.tar
    sift的matlab代码,是最新的,效果不错,其中有很多详细说明,可以试试。(sift the matlab code, is the latest, well, there are a lot of detail, you can try.)
    2008-05-06 09:04:32下载
    积分:1
  • Variable-step-with-Grey-Prediction-Fuzzy-Control-o
    变步长灰色预测的配浆浓度模糊控制研究Variable step with Grey Prediction Fuzzy Control of plasma concentrations(Variable step with Grey Prediction Fuzzy Control of plasma concentrations)
    2011-01-10 19:32:52下载
    积分:1
  • OSU-SVM
    SVM工具箱 分类与回归算法 OSU SVM Classifier Matlab Toolbox(support vector machine procedures, the classification results very good)
    2010-11-19 17:27:28下载
    积分:1
  • Kmeans-julei
    动态聚类的k均值算法,采用matlab编程,内有多个子程序,和一个主程序(dynamic clustering algorithm k mean using matlab)
    2011-06-24 10:19:10下载
    积分:1
  • UE
    说明:  UE Simulation LTE from Vienna University
    2010-09-23 02:27:50下载
    积分:1
  • forecast
    利用matlab软件建立模型,利用ARMA模型对数据进行预测(Using matlab software to model the data using the ARMA model prediction)
    2013-08-09 17:36:49下载
    积分:1
  • MATLAB-GUI-generation
    matlab,gui资料,生成gui,非常不错,希望您喜欢。(matlab, gui information, very good, I hope you like it.)
    2014-10-12 19:24:51下载
    积分:1
  • WSNmodeldoc
    Matlab Low cost nodes which could either have a fixed location or randomly
    2012-09-21 18:13:27下载
    积分:1
  • SMI(Algorithm)
    智能天线自适应非盲波束形成SMI算法,有很好的参考价值。(Smart Antenna Adaptive SMI non-blind beamforming algorithms, have a good reference value.)
    2008-12-09 20:18:20下载
    积分:1
  • cebk_tsp
    用离散数学或图论的术语来说,假设有一个图g=(v,e),其中v是顶点集,e是边集,设d=(dij)是由顶点i和顶点j之间的距离所组成的距离矩阵,旅行商问题就是求出一条通过所有顶点且每个顶点只通过一次的具有最短距离的回路。 (Discrete Mathematics or use the terminology of graph theory, assume that a graph g = (v, e), where v is the vertex set, e is the edge set, let d = (dij) is a vertex between i and vertex j formed from the distance matrix, a traveling salesman problem is obtained through all the vertices and each vertex only once has the shortest distance through the loop.)
    2011-05-22 08:12:37下载
    积分:1
  • 696518资源总数
  • 105877会员总数
  • 14今日下载