登录
首页 » matlab » meanshift

meanshift

于 2009-06-03 发布 文件大小:175KB
0 154
下载积分: 1 下载次数: 223

代码说明:

  实现了基于mean-shift的图像检索,实现了比较两图像的相似度,选择最相近的图片(To achieve mean-shift based image retrieval, to realize the similarity of two images, the selection of the most similar image)

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

发表评论

0 个回复

  • khaledpls
    matlab PLS application
    2011-04-28 07:03:48下载
    积分:1
  • borrowm
    matalab程序好用便捷,关于宏观经济,有增长,有波动研究。(matalab program easy to use and convenient, on the macro economy, there is growth, there are fluctuations in research.)
    2009-09-12 16:25:00下载
    积分:1
  • part2
    Rayleigh Fading Channels in Mobile Digital Communication Systems Part II: Mitigation
    2010-09-11 20:59:20下载
    积分:1
  • signal-prossing
    Codes related in signal processing course and written in MATLAB. there are pdf files that explain the idea about codes. so there are more than 5 source codes.
    2011-07-21 13:54:51下载
    积分:1
  • cluster2008
    聚类算法,绝对值距离且比雪夫距离\平均值距离等.matlab程序,GUI界面,有详细说明(Clustering algorithm, the absolute value of the distance and Chebyshev distance the average distance. Matlab program, GUI interface, there is a detailed description)
    2009-03-28 15:56:57下载
    积分:1
  • ch5example6
    调频立体声接收机模型 对相应的立体声解码过程进行建模和仿真。设左右声道的信号分别为1000Hz和2000Hz的单频测试信号。 (FM stereo receiver model for the corresponding stereo decoding process modeling and simulation. Set left and right channel signals were 1000Hz and 2000Hz single frequency test signal.)
    2010-05-26 09:43:17下载
    积分:1
  • approximate-genetic-algoritm-matlab
    Approximate Genetic Algorithm
    2010-06-28 06:04:30下载
    积分:1
  • proyecto
    programa de procesamiento de imagenes
    2010-11-15 02:04:47下载
    积分:1
  • photo1d3
    this program is designed for solving the one-dimensional photonic structure for 1D multilayer structure using data in book, it get correct results.
    2012-05-13 22:40:23下载
    积分:1
  • kmeans
    k均值算法是一种迭代求解的聚类分析算法,其步骤是随机选取K个对象作为初始的聚类中心,然后计算每个对象与各个种子聚类中心之间的距离,把每个对象分配给距离它最近的聚类中心。聚类中心以及分配给它们的对象就代表一个聚类。(kmeans algorithm is an iterative solution clustering analysis algorithm. First, the initial clustering centers are randomly selected. Then, distance between between each point ans others are calculated, and each data point is designed to its nearest clustering center.)
    2020-06-21 23:40:01下载
    积分:1
  • 696518资源总数
  • 106182会员总数
  • 24今日下载