登录
首页 » matlab » kMeanExtract

kMeanExtract

于 2013-03-20 发布 文件大小:2KB
0 230
下载积分: 1 下载次数: 19

代码说明:

  matlab语言,基于K-mean,也即是取K值法提取方法的关键帧抽取方法(matlab language, based on the K-mean, that is to take the value of K extraction method keyframe extraction method)

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

发表评论

0 个回复

  • NGC_ACM
    图割(GC)和主动轮廓模型(ACM)相结合的一种图像分割方法,既可以进行局部图像的分割,也可进行全局图像的分割,简单实用。(A combination of graph cuts (GC) and the active contour model (ACM) image segmentation method, either local image segmentation, global image segmentation, simple and practical.)
    2012-10-23 11:23:25下载
    积分:1
  • nsct_toolbox-zishiying
    基于NSCT变换的自适应去噪,里面包含仿真图(image denoising)
    2013-08-25 10:17:27下载
    积分:1
  • edge
    对图片预处理加入高斯噪声,各种经典边缘检测算子对图像进行边缘提取(Gaussian noise on the image pre-processing, a variety of classic edge detection operator to extract image edge)
    2013-11-25 20:50:35下载
    积分:1
  • 58366
    图像傅利叶变换源码程序,结合易语言位图操作支持库,通过傅利叶公式的计算变化图像。(Fourier transform image source program , combined with easy language support library bitmap operations , by calculating the Fourier formula change images.)
    2015-12-24 16:36:10下载
    积分:1
  • 01-LSB-image
    说明:  LSB算法在图像中隐藏文本信息,实现效果良好,分享给大家(The LSB algorithm hides the text information in the image to achieve good results and share it with everyone)
    2020-06-19 21:52:34下载
    积分:1
  • 归档
    五线谱的简单识别 识别出点的位置 需要数据灰度图(we can know how to know music)
    2018-08-02 10:24:14下载
    积分:1
  • jsteg
    Jsteg算法实现基于JPEG图像的信息隐藏(Jsteg algorithm information hiding based on JPEG image)
    2021-05-13 20:30:02下载
    积分:1
  • 人脸+虹膜识别+瞳距测量
    说明:  matlab实现人脸识别和虹膜定位 识别效果良好(Accurate eye location by MATLAB)
    2019-02-28 12:26:18下载
    积分:1
  • Colony_partition
    蚁群算法实现医学图像的分割,同时对比FCM算法,非常有用,可以直接运行,包含测试MRI图片(Ant-Colony algorithm for MRI image segmentation including MRI image for testing.)
    2013-12-27 00:37:19下载
    积分:1
  • BFSPDFS
    广度优先搜索和深度优先搜索在网络拓扑图上的实现。广度优先搜索是从某一节点开始,搜索与其线连接的所有节点,按照广度方向像外扩展,直到不重复遍历所有节点;深度优先搜索是从某一节点开始,沿着其搜索到的第一个节点不断深入下去,当无法再深入的时候,回溯节点,然后再在回溯中的某一节点开始沿另一个方向深度搜索,直到不重复的遍历所有节点。 (Breadth-first search and depth-first search in the network topology is realized. Breadth-first search is started from a node, searching all the nodes connected to its line, in accordance with the breadth direction as extracapsular extension, until no repeat traverse all nodes depth-first search is started from a node along its search to the first nodes deepening it, when it can not go any further, backtracking node, and then back again in the beginning of a node depth search in the other direction until the non-repetition of the traverse all nodes.)
    2013-08-10 10:37:12下载
    积分:1
  • 696516资源总数
  • 106914会员总数
  • 0今日下载