登录
首页 » Python » Cluster-master

Cluster-master

于 2020-12-18 发布
0 235
下载积分: 1 下载次数: 1
我要下载

代码说明：

说明：  用kmeans算法对输入点云进行聚类分割(Clustering segmentation of input point cloud using kmeans algorithm)

文件列表：

Cluster-master\.idea\classify.iml, 431 , 2020-12-13
Cluster-master\.idea\misc.xml, 185 , 2020-12-13
Cluster-master\.idea\modules.xml, 268 , 2018-04-23
Cluster-master\.idea\workspace.xml, 23430 , 2020-12-18
Cluster-master\cout.py, 536 , 2020-09-29
Cluster-master\data\Aggregation_cluster=7.txt, 9639 , 2018-04-23
Cluster-master\data\cloud93.txt, 1726261 , 2020-12-17
Cluster-master\data\flame.txt, 2887 , 2018-04-23
Cluster-master\data\flame_cluster=2.txt, 2887 , 2018-04-23
Cluster-master\data\Jain_cluster=2.txt, 4560 , 2018-04-23
Cluster-master\data\Pathbased_cluster=3.txt, 3785 , 2018-04-23
Cluster-master\data\Spiral_cluster=3.txt, 3888 , 2018-04-23
Cluster-master\data\trees.txt, 118889 , 2020-09-28
Cluster-master\data\vertices.txt, 422539 , 2020-10-10
Cluster-master\evaluate.py, 1338 , 2018-04-23
Cluster-master\Kmeans.py, 3185 , 2020-12-15
Cluster-master\Kmeans算法 .pdf, 505545 , 2018-04-23
Cluster-master\nmi.py, 1290 , 2018-04-23
Cluster-master\__pycache__\evaluate.cpython-36.pyc, 997 , 2020-09-28
Cluster-master\ͼƬ\21.png, 132158 , 2018-04-23
Cluster-master\ͼƬ\22.png, 56363 , 2018-04-23
Cluster-master\ͼƬ\23.png, 61689 , 2018-04-23
Cluster-master\ͼƬ\24.png, 63720 , 2018-04-23
Cluster-master\ͼƬ\25.png, 87925 , 2018-04-23
Cluster-master\ͼƬ\26.png, 97296 , 2018-04-23
Cluster-master\ͼƬ\31.png, 67782 , 2018-04-23
Cluster-master\ͼƬ\32.png, 124986 , 2018-04-23
Cluster-master\ͼƬ\33.png, 64154 , 2018-04-23
Cluster-master\ͼƬ\34.png, 65957 , 2018-04-23
Cluster-master\ͼƬ\35.png, 60311 , 2018-04-23
Cluster-master\ͼƬ\41.png, 119429 , 2018-04-23
Cluster-master\ͼƬ\42.png, 60363 , 2018-04-23
Cluster-master\ͼƬ\43.png, 64894 , 2018-04-23
Cluster-master\ͼƬ\44.png, 62362 , 2018-04-23
Cluster-master\ͼƬ\45.png, 55693 , 2018-04-23
Cluster-master\ͼƬ\51.png, 14294 , 2018-04-23
Cluster-master\ͼƬ\52.png, 5032 , 2018-04-23
Cluster-master\ͼƬ\53.png, 5486 , 2018-04-23
Cluster-master\.idea, 0 , 2020-12-18
Cluster-master\data, 0 , 2020-12-18
Cluster-master\__pycache__, 0 , 2020-12-18
Cluster-master\ͼƬ, 0 , 2020-12-18
Cluster-master, 0 , 2020-12-18

下载说明：请别用迅雷下载，失败请重下，重下不扣分！

发表评论

0 个回复

  • 如何分离一个顺序表里的0元素和非0元素？本程序展示了三种高效算法并比较他们之间的性能...
    如何分离一个顺序表里的0元素和非0元素？本程序展示了三种高效算法并比较他们之间的性能-How to separate 0 and non-0 element in a squencial list? The program shows three effective algorithm and compare their performances.
    2022-03-12 05:02:42下载
    积分：1
  • 这个是Hilbert曲线的实现算法,可以具体演示出每级曲线的绘制过程,最多可实现8级曲线的绘制....
    这个是Hilbert曲线的实现算法,可以具体演示出每级曲线的绘制过程,最多可实现8级曲线的绘制.-Hilbert Curve is the realization of the algorithm can be demonstrated that each specific grade curve of the process of drawing up to achieve eight curve drawing.
    2022-06-18 23:23:49下载
    积分：1
  • 11695 - DS_2017fall_HW4
    this is my data structure homework4
    2018-01-04 02:55:30下载
    积分：1
  • Database system concepts fifth edition of the courseware and the answer _PPTNote...
    数据库系统概念第五版课件及习题答案_PPTNotes-Database system concepts fifth edition of the courseware and the answer _PPTNotes Exercises
    2022-04-19 07:22:26下载
    积分：1
  • 非常好的来源。学习数据库的访问。一个详细的说明…
    非常非常好的消息来源。访问学习数据库。有详细的解释。我们希望能帮上忙
    2022-02-25 05:12:04下载
    积分：1
  • 一个Oracle性能监视工具，含几个sql文件
    一个Oracle性能监视工具，含几个sql文件- A Oracle performance surveillance tool, contains several sql document
    2022-07-01 21:02:31下载
    积分：1
  • Figure-topological-sort
    说明：  拓扑排序 　 对一个 有向无环图 G进行拓扑排序，是将G中所有顶点排成一个线性序列，使得图中任 意一对顶点u和v，若u，v ∈E，则u在线性序列中出现在v之前。 　 通常，这样的线性序列称为满足拓扑次序的序列，简称 拓扑序列 。 注意： 　 ①若将图中顶点按拓扑次序排成一行，则图中所有的有向边均是从左指向右的。 　 ②若图中存在有向环，则不可能使顶点满足拓扑次序。 　 ③一个DAG的拓扑序列通常表示某种方案切实可行。 (Topological sort In a directed acyclic graph G topological sort, is all vertices will G formed a linear sequence, make diagram post Meaning a pair of vertex u and v, if u, v ∈ E, then u in linear sequence in which they appear in v before. Usually, such linear sequence sequence of topological order called meet, abbreviation topology sequence. Note: (1) if the diagram according to the topology order line vertices, then figure all from left to right edge are pointing. (2) if the figure to exist in the ring, is impossible to have the vertex meet topological sequence. (3) a DAG topological sequence usually expressed some scheme is feasible. )
    2011-03-22 17:19:14下载
    积分：1
  • zuiyouerfenjiansuozhu
    最优二叉搜索树问题具有最优子结构性质，即其任意一棵子树都是一棵独立的最优二叉搜索树，所以可以采用动态规划方法，并且在每次更新时保存子树的根。(Optimal binary search tree problem has optimal substructure property that any of its sub-tree are an independent optimal binary search tree, so you can use dynamic programming methods, and save each update subtree roots.)
    2013-10-10 18:48:17下载
    积分：1
  • 数据结构(C语言版)
    该书籍详细讲述了C语言的数据结构部分，不断提高你的编程能力。(This book describes the data structure of C language in detail, and constantly improves your programming ability.)
    2020-06-22 07:00:01下载
    积分：1
  • kmp
    由遍历序列回复二叉树文档介绍 还不错 可以看看(Reply binary tree traversal sequence document presentation also can look at)
    2012-06-30 19:10:34下载
    积分：1
  • 696518资源总数
  • 106182会员总数
  • 24今日下载

热门标签

Visual C++ matlab C/C++ Java Others Unix_Linux EasyLanguage易语言 Visual Basic C# PDF C++ Delphi VHDL ASP WINDOWS
热门下载

Copyright© 2019-2025 | Powered by Imdn | 浙ICP备16007336号 | IMDN交流 | 联系客服（QQ：3324461878）

本网站资源收集自网络及网站用户上传，若有侵权请邮件至（3324461878@qq.com），核实后我们会在24小时内删除，谢谢！