Location:
Search - k-median
Search list
Description: 本软件是由作者经过数字图像处理课程的学习，采用vc++.net将其基本算法实现，其算法主要包括： 1.点运算（灰度直方图，直方图均衡处理，线性运算，二值化，灰度化等） 2.几何运算（旋转，放缩，镜像，平移） 3.几何空间增强（均值，中值滤波器，k近邻均值，中值滤波器，Roberts,sobel,priwitt,laplacian,wallis锐化算子等） 4.频率域增强（基2FFT进行空间域到频率域的转换，高斯，理想，巴特沃斯高低通滤波器） 5.形态学（膨胀，腐蚀，开，闭运算，边缘提取） 6.图像复原（加躁）----- 由于时间关系这部分为完成 7.另外加上一个用于读取24位dib的类。-the software is the author of Digital Image Processing courses of study, using vc. Net to its basic algorithm, the algorithm include : 1. Point Operators (histogram, histogram equalization, linear operation, two values, such as Gray) 2. Geometric Operational (rotation, scaling, mirror and translation) 3. geometric space enhancement (mean, median filter, k neighbors Mean, Median Filter, Roberts, segmentation, priwitt, Laplacian, Wallis Sharpening operator, etc.) 4. frequency Domain Enhancement (radix 2 FFT space frequency domain to the domain conversion, Gaussian, ideals, Butterworth High-Low Pass Filter) 5. Morphology (expansion, corrosion, open and close operations, edge extraction) 6. Image Restoration (plus impatient Hoffmann because of the time this is completed seven. Added to read fo
Platform: |
Size: 3416061 |
Author: 王晗 |
Hits:
Description: 本次的FEAL8轮叠代要求将64位的密文C与64位的密钥K经过要设计的解密程序运行得到所需的64位的明文P。由于2进制输入输出的位数太长不方便，再程序的数据运算中大量用上16进制。在数据的运算过程中又常常把输入的数据平均分成等份，因此在数据处理上用上数组形式。FEAL算法的三个基本运算函数是整个程序的重心，程序的密钥处理和解密过程都将以这三个运算函数为中心，因此，程序的设计以S函数 函数和 f函数来展开，再由主函数编写时调用三个函数。-the FEAL8 round of the iterative requirements of the dense 64-C and 64 K after the key to the solution design running close access to the 64 P explicit. As the two-band input and output of the median long inconvenient, and then process the data using a large number of computations 16 band. Operational data in the process often imported data divided into equal portions, in data processing using an array form. FEAL algorithm three basic computing function is the focus of the whole process, Key handling procedures and decryption process of the three operations will function as the center, therefore, procedures designed to S Function and f function to commence further prepared by the main function calls the three functions.
Platform: |
Size: 1652 |
Author: 逍遥 |
Hits:
Description: K近邻中值（均值）滤波器
1) 以待处理像素为中心，作一个m*m的作用模板。
2） 在模板中，选择K个与待处理像素的灰度差为最小的像素。
3） 将这K个像素的灰度均值（中值）替换掉原来的像素值。
-K-nearest neighbor median (mean) a filter) for the pixel to be addressed, for a m * m role template. 2) In the template, select and K-pending pixel gray worse for the smallest pixels. 3) this K-pixel gray average (median) replace the original pixel.
Platform: |
Size: 1613 |
Author: 上官云 |
Hits:
Description: 这是一个关于k中心聚类的算法，希望大家指点。
Platform: |
Size: 594008 |
Author: fanliutong |
Hits:
Description: ClustanGraphics聚类分析工具。提供了11种聚类算法。
Single Linkage (or Minimum Method, Nearest Neighbor)
Complete Linkage (or Maximum Method, Furthest Neighbor)
Average Linkage (UPGMA)
Weighted Average Linkage (WPGMA)
Mean Proximity
Centroid (UPGMC)
Median (WPGMC)
Increase in Sum of Squares (Ward s Method)
Sum of Squares
Flexible (ß space distortion parameter)
Density (or k-linkage, density-seeking mode analysis)
Platform: |
Size: 56120 |
Author: wangyexin |
Hits:
Description: 本软件是由作者经过数字图像处理课程的学习，采用vc++.net将其基本算法实现，其算法主要包括： 1.点运算（灰度直方图，直方图均衡处理，线性运算，二值化，灰度化等） 2.几何运算（旋转，放缩，镜像，平移） 3.几何空间增强（均值，中值滤波器，k近邻均值，中值滤波器，Roberts,sobel,priwitt,laplacian,wallis锐化算子等） 4.频率域增强（基2FFT进行空间域到频率域的转换，高斯，理想，巴特沃斯高低通滤波器） 5.形态学（膨胀，腐蚀，开，闭运算，边缘提取） 6.图像复原（加躁）----- 由于时间关系这部分为完成 7.另外加上一个用于读取24位dib的类。-the software is the author of Digital Image Processing courses of study, using vc. Net to its basic algorithm, the algorithm include : 1. Point Operators (histogram, histogram equalization, linear operation, two values, such as Gray) 2. Geometric Operational (rotation, scaling, mirror and translation) 3. geometric space enhancement (mean, median filter, k neighbors Mean, Median Filter, Roberts, segmentation, priwitt, Laplacian, Wallis Sharpening operator, etc.) 4. frequency Domain Enhancement (radix 2 FFT space frequency domain to the domain conversion, Gaussian, ideals, Butterworth High-Low Pass Filter) 5. Morphology (expansion, corrosion, open and close operations, edge extraction) 6. Image Restoration (plus impatient Hoffmann because of the time this is completed seven. Added to read fo
Platform: |
Size: 3416064 |
Author: 王晗 |
Hits:
Description: 本次的FEAL8轮叠代要求将64位的密文C与64位的密钥K经过要设计的解密程序运行得到所需的64位的明文P。由于2进制输入输出的位数太长不方便，再程序的数据运算中大量用上16进制。在数据的运算过程中又常常把输入的数据平均分成等份，因此在数据处理上用上数组形式。FEAL算法的三个基本运算函数是整个程序的重心，程序的密钥处理和解密过程都将以这三个运算函数为中心，因此，程序的设计以S函数 函数和 f函数来展开，再由主函数编写时调用三个函数。-the FEAL8 round of the iterative requirements of the dense 64-C and 64 K after the key to the solution design running close access to the 64 P explicit. As the two-band input and output of the median long inconvenient, and then process the data using a large number of computations 16 band. Operational data in the process often imported data divided into equal portions, in data processing using an array form. FEAL algorithm three basic computing function is the focus of the whole process, Key handling procedures and decryption process of the three operations will function as the center, therefore, procedures designed to S Function and f function to commence further prepared by the main function calls the three functions.
Platform: |
Size: 2048 |
Author: 逍遥 |
Hits:
Description: FIR FILTER verilog code-FIR FILTER Verilog code
Platform: |
Size: 26624 |
Author: QQ |
Hits:
Description: K近邻中值（均值）滤波器
1) 以待处理像素为中心，作一个m*m的作用模板。
2） 在模板中，选择K个与待处理像素的灰度差为最小的像素。
3） 将这K个像素的灰度均值（中值）替换掉原来的像素值。
-K-nearest neighbor median (mean) a filter) for the pixel to be addressed, for a m* m role template. 2) In the template, select and K-pending pixel gray worse for the smallest pixels. 3) this K-pixel gray average (median) replace the original pixel.
Platform: |
Size: 1024 |
Author: 上官云 |
Hits:
Description: 这是一个关于k中心聚类的算法，希望大家指点。-It is a clustering algorithm k centers, I hope everyone pointing.
Platform: |
Size: 593920 |
Author: fanliutong |
Hits:
Description: ClustanGraphics聚类分析工具。提供了11种聚类算法。
Single Linkage (or Minimum Method, Nearest Neighbor)
Complete Linkage (or Maximum Method, Furthest Neighbor)
Average Linkage (UPGMA)
Weighted Average Linkage (WPGMA)
Mean Proximity
Centroid (UPGMC)
Median (WPGMC)
Increase in Sum of Squares (Ward s Method)
Sum of Squares
Flexible (ß space distortion parameter)
Density (or k-linkage, density-seeking mode analysis) -ClustanGraphics clustering analysis tools. Provides 11 kinds of clustering algorithms. Single Linkage (or Minimum Method, Nearest Neighbor) Complete Linkage (or Maximum Method, Furthest Neighbor) Average Linkage (UPGMA) Weighted Average Linkage (WPGMA) Mean ProximityCentroid (UPGMC) Median (WPGMC) Increase in Sum of Squares (Ward s Method) Sum of SquaresFlexible (? space distortion parameter) Density (or k-linkage, density-seeking mode analysis)
Platform: |
Size: 56320 |
Author: wangyexin |
Hits:
Description: 大整数问题
设n是一个k（1≤k≤80）位的十进制正整数。
问题1：对于给定的任意整数n，编程计算满足p3+p2+3p≤n的位数为m的p的个数。
问题2：对于给定的任意整数n，编程求解满足p3+p2+3p≤n的p的最大值。
要求：
对于给定的每一个测试文件（形如：numberX_input.txt），分别生成一个结果文件（形如：numberX_out.txt）。比如，对于测试文件number1_input.txt，对应的结果文件为number1_out.txt。
参考数据：
(1) 若n=1908 ； p的最大值=12
(2) 若n= 2000000000000000000000000000002452458671514234457987956856；
p的最大值= 12599210498948731647-Big problem for integer n is a k (1 ≤ k ≤ 80) decimal places positive integer. Question 1: For a given arbitrary integer n, calculated to meet the p3+ P2+ 3p ≤ n the median number m of p. Question 2: For a given arbitrary integer n, Programming Solution to meet the p3+ P2+ 3p ≤ n the p maximum. Requirements: For a given test every file (such as shape: numberX_input.txt), respectively, the results generate a document (such as shape: numberX_out.txt). For example, the test file number1_input.txt, corresponding to the outcome document for the number1_out.txt. Reference: (1) if n = 1908 p maximum = 12 (2) If n = 2000000000000000000000000000002452458671514234457987956856 p maximum = 12599210498948731647
Platform: |
Size: 1199104 |
Author: ouyang |
Hits:
Description: 遗传算法的PID调节
题目：已知 ，利用GA 寻优PID参数，其中K=1，T=2， ，二进制/实数编码，位数不限，M，Pc，Pm自选，性能指标 ，Q=100为仿真计算步长。-PID regulation of genetic algorithms Title: known, the use of PID parameters of GA optimization, in which K = 1, T = 2,, binary/real-coded, not limited to the median, M, Pc, Pm-on-demand, performance indicators, Q = 100 step for the simulation.
Platform: |
Size: 2048 |
Author: qiqi |
Hits:
Description: 第k小元素的实现，包含四种算法 选择排序 快排 随机排序 中位数法-The first element in the realization of small k, including four fast sorting algorithm to choose a random row to sort the median method
Platform: |
Size: 598016 |
Author: cathere |
Hits:
Description: 将K均值算法用于图像分割,输入的是彩色图像,转换为灰度图像进行分割,输出结果为灰度图像.利用灰度做为特征对每个像素进行聚类,由于光照等原因,有时应该属于一个物体的像素,其灰度值也会有很大的差别,可能导致对该像素的聚类发生错误.在分割结果中,该物体表面会出现一些不同于其它像素的噪声点,因此,算法的最后,对结果进行一次中值滤波,以消除噪声,达到平滑图像的作用-The K means algorithm for image segmentation, the input is a color image, convert to grayscale image segmentation, the output of grayscale images. The use of gray as the characteristics of each pixel clustering, due to light and other reasons, and sometimes should belong to an object pixel, its gray value will also be very different, may lead to clustering of the pixel error has occurred. in the segmentation results, the surface, there would be different from other pixel noise points, so , the algorithm Finally, the results of a median filter to eliminate noise, to the role of smoothing the image
Platform: |
Size: 335872 |
Author: caoliang |
Hits:
Description: c++实现的k-median算法，需要的人可以看看。-c++ implementation of the k-median algorithm, can look at those who need it.
Platform: |
Size: 2048 |
Author: 黄小可 |
Hits:
Description: mat lab tool for k-median algorithnm
Platform: |
Size: 31374336 |
Author: shashank singh |
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: 对图像进行阈值，对比度，灰度，尺寸的调整，任意角度旋转，锐化，各种滤波处理，包括中值，均值，N*N最值滤波，修复，背景清除，K均值分色，二值化，各种边缘检测，以及后续处理细化等功能。-Threshold the image, contrast, gray, size adjustment, arbitrary angle rotation, sharpening, all kinds of filtering, including the median, mean, N* N the best filter, repair, background removal, K mean separation, binary, a variety of edge detection and subsequent treatment refining capabilities.
Platform: |
Size: 160768 |
Author: 齐志远 |
Hits:
Description: 要求有向树Ｔ的k个独立顶点组成的集合Ｆ，使cost(F)=∑min w(x)*d(x,u)的值达到最小。与有向树k中值问题类似，把有向树变转成为与之等价的二叉树，设Ｔ的以顶点x为根的子树T(x),其左、右儿子顶点分别为y和z。(A set F that consists of a k independent vertex to a tree T is required to minimize the value of the cost (F) = min w (x) *d (x, U). Similar to the K median problem of the directed tree, it transforms the directed tree into an equivalent two branch tree, and sets the subtree T (x) of T with vertex x as its root, whose left and right son vertices are y and Z, respectively.)
Platform: |
Size: 708608 |
Author: 为了
|
Hits: