Logo
Unionpedia
Communication
Get it on Google Play
New! Download Unionpedia on your Android™ device!
Download
Faster access than browser!
 

Color quantization and K-means clustering

Shortcuts: Differences, Similarities, Jaccard Similarity Coefficient, References.

Difference between Color quantization and K-means clustering

Color quantization vs. K-means clustering

In computer graphics, color quantization or color image quantization is a process that reduces the number of distinct colors used in an image, usually with the intention that the new image should be as visually similar as possible to the original image. k-means clustering is a method of vector quantization, originally from signal processing, that is popular for cluster analysis in data mining.

Similarities between Color quantization and K-means clustering

Color quantization and K-means clustering have 6 things in common (in Unionpedia): Cluster analysis, Computer graphics, Euclidean distance, Image segmentation, Self-organizing map, Voronoi diagram.

Cluster analysis

Cluster analysis or clustering is the task of grouping a set of objects in such a way that objects in the same group (called a cluster) are more similar (in some sense) to each other than to those in other groups (clusters).

Cluster analysis and Color quantization · Cluster analysis and K-means clustering · See more »

Computer graphics

Computer graphics are pictures and films created using computers.

Color quantization and Computer graphics · Computer graphics and K-means clustering · See more »

Euclidean distance

In mathematics, the Euclidean distance or Euclidean metric is the "ordinary" straight-line distance between two points in Euclidean space.

Color quantization and Euclidean distance · Euclidean distance and K-means clustering · See more »

Image segmentation

In computer vision, image segmentation is the process of partitioning a digital image into multiple segments (sets of pixels, also known as super-pixels).

Color quantization and Image segmentation · Image segmentation and K-means clustering · See more »

Self-organizing map

A self-organizing map (SOM) or self-organizing feature map (SOFM) is a type of artificial neural network (ANN) that is trained using unsupervised learning to produce a low-dimensional (typically two-dimensional), discretized representation of the input space of the training samples, called a map, and is therefore a method to do dimensionality reduction.

Color quantization and Self-organizing map · K-means clustering and Self-organizing map · See more »

Voronoi diagram

In mathematics, a Voronoi diagram is a partitioning of a plane into regions based on distance to points in a specific subset of the plane.

Color quantization and Voronoi diagram · K-means clustering and Voronoi diagram · See more »

The list above answers the following questions

Color quantization and K-means clustering Comparison

Color quantization has 29 relations, while K-means clustering has 112. As they have in common 6, the Jaccard index is 4.26% = 6 / (29 + 112).

References

This article shows the relationship between Color quantization and K-means clustering. To access each article from which the information was extracted, please visit:

Hey! We are on Facebook now! »