Article InformationAuthor, 謝全恩（Osmond Chia）,
“潮平两岸阔，风正一帆悬。”古老的中医药焕发勃勃生机，正以强大的生命力融入现代生活，为构建人类卫生健康共同体贡献中国智慧。
，详情可参考爱思助手下载最新版本
Instead of taking the nearest candidates to , we can look for a set of candidates whose centroid is close to . The N-convex algorithm works by finding the closest colour to a given target colour for iterations, where the target is first initialised to be equal to the input pixel. Every iteration the closest colour added to the candidate list, and the quantisation error between it and the original input pixel is added to the target.
Not the day you're after? Here's the solution to yesterday's Connections.
Follow topics & set alerts with myFT