Search - k means clustering for gaussian distribution

Search - k means clustering for gaussian distribution - List

[Other resource] misc DL : 0: Probability distribution functions. estimation - (dir) Probability distribution estimation. dsamp - Generates samples from discrete distribution. erfc2 - Normal cumulative distribution function. gmmsamp - Generates sample from Gaussian mixture model. gsamp - Generates sample from Gaussian distribution. cmeans - C-means (or K-means) clustering algorithm. mahalan - Computes Mahalanobis distance. pdfgauss - Computes probability for Gaussian distribution. pdfgmm - Computes probability for Gaussian mixture model. sigmoid - Evaluates sigmoid function.
Date : 2008-10-13 Size : 21.41kb User : 林枫
[AI-NN-PR] misc DL : 0: Probability distribution functions. estimation - (dir) Probability distribution estimation. dsamp - Generates samples from discrete distribution. erfc2 - Normal cumulative distribution function. gmmsamp - Generates sample from Gaussian mixture model. gsamp - Generates sample from Gaussian distribution. cmeans - C-means (or K-means) clustering algorithm. mahalan - Computes Mahalanobis distance. pdfgauss - Computes probability for Gaussian distribution. pdfgmm - Computes probability for Gaussian mixture model. sigmoid - Evaluates sigmoid function.-Probability distribution functions. estimation- (dir) Probability distribution estimation. dsamp- Generates samples from discrete distribution. erfc2- Normal cumulative distribution function. gmmsamp- Generates sample from Gaussian mixture model. gsamp- Generates sample from Gaussian distribution. cmeans- C-means (or K-means) clustering algorithm. mahalan- Computes Mahalanobis distance. pdfgauss- Computes probability for Gaussian distribution. pdfgmm- Computes probability for Gaussian mixture model. sigmoid- Evaluates sigmoid function.
Date : 2025-07-13 Size : 21kb User : 林枫
[AI-NN-PR] exp7 DL : 0: LBG分类算法用初始室心随机法和扰动因子分裂法两种方法，比较不同方法不同参数设置时的分类性能。 -LBG classification algorithm vector quantization: vector normalization within a certain range for a particular type, consists of two steps: first generate a codebook, which is the speech feature vector space by the first process- also known as clustering speech parameter sequence as a vector, the reference code for classified- also known as quantization. Clustering algorithm: it is relatively simple and commonly used K-means clustering algorithm. LBG is a clustering algorithm, which is generally assumed that the codebook size is fixed, and for a power of 2. Codebook is small, then expanding until it reaches the requirements. It is often an existing classification split into two subclasses, and initial value with the new code word to each subclass. LBG algorithm on random data and a certain regularity (and meet certain Gaussian distribution) data classification, and look at the performance of the LBG algorithm, the initial chamber heart random disturbance factor-secession law are two
Date : 2025-07-13 Size : 84kb User : zzc
[matlab] final-code DL : 0: This paper presents a new approach to image segmentation using Pillar K-means algorithm. This segmentation method includes a new mechanism for grouping the elements of high resolution images in order to improve accuracy and reduce the computation time. The system uses K-means for image segmentation optimized by the algorithm after Pillar. The Pillar algorithm considers the placement of pillars should be located as far from each other to resist the pressure distribution of a roof, as same as the number of centroids between the data distribution. This algorithm is able to optimize the K-means clustering for image segmentation in the aspects of accuracy and computation time. This algorithm distributes all initial centroids according to the maximum cumulative distance metric. This paper evaluates the proposed approach for image segmentation by comparing with K-means clustering algorithm and Gaussian mixture model and the participation of RGB, HSV, HSL and CIELAB color spaces. -This paper presents a new approach to image segmentation using Pillar K-means algorithm. This segmentation method includes a new mechanism for grouping the elements of high resolution images in order to improve accuracy and reduce the computation time. The system uses K-means for image segmentation optimized by the algorithm after Pillar. The Pillar algorithm considers the placement of pillars should be located as far from each other to resist the pressure distribution of a roof, as same as the number of centroids between the data distribution. This algorithm is able to optimize the K-means clustering for image segmentation in the aspects of accuracy and computation time. This algorithm distributes all initial centroids according to the maximum cumulative distance metric. This paper evaluates the proposed approach for image segmentation by comparing with K-means clustering algorithm and Gaussian mixture model and the participation of RGB, HSV, HSL and CIELAB color spaces.
Date : 2025-07-13 Size : 952kb User : Deepesh