Location:
Search - k邻域
Search list
Description: 由于K－均值聚类算法局部最优的特点，而模拟退火算法理论上具有全局最优的特点。因此，用模拟退火算法对聚类进行了改进。20组聚类仿真表明，平均每次对K结果值改进8次左右，效果显著。下一步工作：实际上在高温区随机生成邻域是个组合爆炸问题（见本人上载软件‘k－均值聚类算法’所述），高温跳出局部解的概率几乎为0，因此正考虑采用凸包约束进行模拟聚类，相关工作正在进行。很快将奉献给各位朋友。-as K-means clustering algorithm for optimal local characteristics, and simulated annealing algorithm theory with the characteristics of the global optimum. Thus, simulated annealing algorithm for clustering improvements. Cluster Group of 20 simulations show that the average value of K results improved about eight times, the results are obvious. The next step : In fact, in high temperature generated random neighborhood is a combination of explosives (see my software on the 'k-means clustering algorithm' mentioned above), high-temperature solution of partial out almost zero probability, it is considering the use of convex hull bound for simulation cluster, the work under way . Soon dedication to the ladies.
Platform: |
Size: 5778 |
Author: 韩磊 |
Hits:
Description: 由于K－均值聚类算法局部最优的特点，而模拟退火算法理论上具有全局最优的特点。因此，用模拟退火算法对聚类进行了改进。20组聚类仿真表明，平均每次对K结果值改进8次左右，效果显著。下一步工作：实际上在高温区随机生成邻域是个组合爆炸问题（见本人上载软件‘k－均值聚类算法’所述），高温跳出局部解的概率几乎为0，因此正考虑采用凸包约束进行模拟聚类，相关工作正在进行。很快将奉献给各位朋友。-as K-means clustering algorithm for optimal local characteristics, and simulated annealing algorithm theory with the characteristics of the global optimum. Thus, simulated annealing algorithm for clustering improvements. Cluster Group of 20 simulations show that the average value of K results improved about eight times, the results are obvious. The next step : In fact, in high temperature generated random neighborhood is a combination of explosives (see my software on the 'k-means clustering algorithm' mentioned above), high-temperature solution of partial out almost zero probability, it is considering the use of convex hull bound for simulation cluster, the work under way . Soon dedication to the ladies.
Platform: |
Size: 5120 |
Author: 韩磊 |
Hits:
Description: TextureAnlysis.m实现遥感图像的纹理分析，以 方向邻域内的灰度均值 和 灰度共生矩阵的熵 作为纹理特征，使用k-means聚类。-TextureAnlysis.m the realization of remote sensing image texture analysis to the direction of the gray-scale neighborhood of the mean and the entropy of gray level co-occurrence matrix as texture features, the use of k-means clustering.
Platform: |
Size: 207872 |
Author: xxl |
Hits:
Description: c++实现的KNN库:建立高维度的K-d tree,实现K邻域搜索，最小半径搜索-K-NN algorithm implementation.
It supports data structures and algorithms for both exact and approximate nearest neighbor searching in arbitrarily high dimensions.
Platform: |
Size: 624640 |
Author: duckur |
Hits:
Description: 所给程序中，先给出一副原始图像，在其中添加椒盐噪声，然后用几种方法进行平滑滤波，包括邻域均值法，邻域中值滤波和K邻域均值滤波，其中的K邻域均值滤波所选掩膜为3*3，K值取5，图片选用board.ti。-Given program, the first is given an original image, in which the added salt & pepper noise, and then use several methods of smoothing, including the neighborhood average method, o-field value filtering and K neighborhood mean filter, where K o domain mean filter mask for the selected 3* 3, K value of taking five, picture selection board.ti.
Platform: |
Size: 136192 |
Author: hanyantao |
Hits:
Description: 数字图像处理中的平滑和锐化（边缘检测）。包括1、添加椒盐、高斯噪声。2对噪声污染的图像分别使用邻域平均法、中值滤波法、K邻近平均法进行平滑。3对一幅图像利用Roberts梯度法、Sobel算子和拉普拉斯算子进行锐化，并比较结果。附处理源图像和处理结果截图。
-Digital image processing smoothing and sharpening (edge detection). Including 1, add salt and pepper, Gaussian noise. Two pairs of images were used noise pollution neighborhood average, median filtering, K close to the average method to smooth. 3 on an image using Roberts gradient method, Sobel operator and Laplacian sharpening, and compare the results. Laws dealing with the source image capture and processing results.
Platform: |
Size: 281600 |
Author: 刘雨相 |
Hits:
Description: 进行点云数据处理是需要进行中邻域搜索算法，上传的是K邻域搜索算法-For point cloud data processing is needed in the neighborhood search algorithm, upload the K neighborhood search algorithm
Platform: |
Size: 6144 |
Author: sad |
Hits:
Description: 邻域法。文献[ 24 ]提出一种基于动态邻域的选择策略,将一个目标定义为优化目标,而将其它所有目标定义为邻域目标,进而提出了选择全局最优粒子的动态邻域策略,但该方法对优化目标的选择以及邻域目标函数的排序较敏感。-Neighborhood method. [24] proposed a dynamic neighborhood based on the choice of strategy, a goal is defined as the optimization objective, and all other objectives will be defined as a neighborhood goals, and then select the global optimal particle proposed dynamic neighborhood strategy, but the Methods for optimizing the choice of target and neighborhood sensitive sort of objective function.
Platform: |
Size: 22528 |
Author: 杨科 |
Hits:
Description: K邻域模式识别方法 KNN算法不仅可以用于分类，还可以用于回归。通过找出一个样本的k个最近邻居，将这些邻居的属性的平均值赋给该样本，就可以得到该样本的属性。更有用的方法是将不同距离的邻居对该样本产生的影响给予不同的权值(weight)，如权值与距离成正比。-k-Nearest Neighbor algorithm
Platform: |
Size: 4096 |
Author: 郭乐 |
Hits:
Description: 一种基于栅格划分的海量散乱点云的K邻域搜索-Based on the grid by Massive Scattered Points K-neighborhood search
Platform: |
Size: 1565696 |
Author: 陈杰 |
Hits:
Description: 打开一幅图像，添加椒盐、高斯噪声，然后使用中值滤波，K邻域平均法进行平滑-Open an image, add salt and pepper, Gaussian noise, and then use the median filter, K neighborhood average method smoothed
Platform: |
Size: 321536 |
Author: 赵宇 |
Hits:
Description: 利用K_D树数据结构实现K邻域搜索的算法代码-K_D tree data structure the K neighborhood search algorithm code
Platform: |
Size: 2628608 |
Author: 叶冬荣 |
Hits:
Description: 实现散乱点云的K邻域搜索，对于从事逆向工程方向研究有较大的帮助-Of scattered point cloud the K neighborhood search, larger studies engaged in reverse engineering direction
Platform: |
Size: 4861952 |
Author: 晏海平 |
Hits:
Description: 基于ORL人脸库的人脸识别，基于PCA降维、K邻域识别法；以及PCA降维，Fisher判别-Face recognition based on the ORL database, based on the PCA dimension K neighborhood identification method PCA dimension, Fisher discriminant
Platform: |
Size: 24576 |
Author: wangwei |
Hits:
Description: 八叉树k邻域搜索思路和数据精简,点云数据P的K近邻指的是在物体空间内，点云数据内与P相邻的K个最近相邻点。这里采用八叉树分割法来搜索点P的K近邻。具体步骤是：先设定一个距离阈值，根据已知的P点坐标，可以求得相应的子立方体结点编号以及相邻的26个子立方体编号，每个子立方体记录下编号后，先在该子立方体内部搜索距离阈值范围内的K个近邻点，如果点数不够，则在其相邻的26个子立方体里面搜索，直到满足要求结束。
Platform: |
Size: 4901 |
Author: liangzi420 |
Hits:
Description: 自适应空间球的k邻域快速搜索算法，利用空间微分块与动态球策略的k近邻搜索算法研究-Origianl-Adaptive spatial neighborhood k ball fast search algorithm, differential block the use of space and dynamic ball strategy k nearest neighbor search algorithm-Origianl
Platform: |
Size: 381952 |
Author: 闫子熙 |
Hits:
Description: 利用matlab实现就近点邻域寻找算法，获取指定点k邻域范围内的点集-Using matlab realize the neighborhood looking for the nearest point algorithms, access points within a specified point range k neighborhood
Platform: |
Size: 1024 |
Author: 户田 |
Hits:
Description: 具备k邻域收索算法，根据不同的k值实现邻域收索，并输出收索后的邻域数据，通过交互式的界面实现邻域点的查询！-K neighborhood have received cord, cable algorithm to achieve a different neighborhood close k values through the GUI interface, and can output data after neighborhood close cord, also has good interactive input manually check!
Platform: |
Size: 11264 |
Author: maweifeng |
Hits:
Description: 不是说了吗k邻域算法，ieee9的k邻域算法，拿好不用谢(Did I say K neighborhood algorithm?)
Platform: |
Size: 39936 |
Author: hihiasd
|
Hits:
Description: kd树数据存储结构，进行klinyu搜索，GUI界面，具有保存搜索的k邻域数据(Kd tree data storage structure, k linyu search, GUI interface, with k neighborhood data to save the search)
Platform: |
Size: 8192 |
Author: maweifeng011 |
Hits: