原书出处
Foundations of Computer Vision (Antonio Torralba, Phillip Isola etc.)
K-means operates on a data matrix of N datapoints by M features per datapoint. Our first task is to convert the segmentation problem to that format. The simplest thing to do is let each pixel be a datapoint and the pixel's color be its feature vector. For ease of visualization, we will use the ab color value as the two-dimensional (2D) feature per pixel. An
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/Foundations of Computer Vision (Antonio Torralba, Phillip Isola etc.)/_epub-src/OPS/xhtml/c031.xhtml
EPUB SHA-256:60a7eebc43f5d9a675d776fed3736fbdaa791e55877023f2f8cba016a9b384f8