这些缩放算法有什么区别？
谁能向我解释这些缩放算法之间的区别？即哪些更适合放大或缩小，哪些更适合照片，哪些更适合 2 位图像，以及各自的相对速度等等......
bicubic
bilinear
box
data dependent triangulation
nearest neighbor
谢谢！
我有一些有点像素化的大型 2 位图像，我想知道可以使用哪些缩放算法来对它们进行去像素化，也许可以通过使用不同的算法进行下采样然后上采样（或反之亦然）。
Could anyone explain to me the difference between these scaling algorithms? i.e. Which ones are better for upscaling or downscaling, which are better for photos and which are better for 2-bit images, and the relative speed of each, etc...
bicubic
bilinear
box
data dependent triangulation
nearest neighbor
Thank you!
I have some large 2-bit images that are a bit pixelated and I want to know which scaling algorithms I can use to de-pixelate them, perhaps by downsampling then upsampling (or vice-versa) using different algorithms.
如果你对这篇内容有疑问，欢迎到本站社区发帖提问 参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。
绑定邮箱获取回复消息
由于您还没有绑定你的真实邮箱，如果其他用户或者作者回复了您的评论，将不能在第一时间通知您！
发布评论
评论（1）
双三次
双三次是要使用的插值类型。它尝试将三次多项式拟合到您的已知像素。然后使用该多项式来计算未知像素的颜色。
三次多项式的优点是颜色变化平滑，但计算起来比其他多项式要困难得多。
双线性
双线性插值也是如此，只不过它假设线性坐标变化。这导致颜色变化不如双三次插值那么平滑，但更容易计算。
盒子
我不太确定，但我假设他们只是使用左上角已知像素的像素值。这会导致图像像素化严重。
最近邻居
每个未知像素都会获得最近的已知像素的颜色。应该会产生非常像素化的图像。
此说。每种方法都有其优点和缺点，结果很大程度上取决于上采样的规模。
Bicubic
Bicubic is the type of interpolation to be used. It trys to fit a cubic polynomial to your known pixel. This polynomial is then used to calculate the color of unknown pixel.
The cubic polynomial has the advantage of a smooth colorchanges but it is much harder to calculate then all the others.
Bilinear
Same goes for bilinear interpolation except that it assumes a linear coor change. The leads to colorchanges not as smooth as bicubic interpolation but it is much easier to calculate.
Box
I am not quite sure but i would assume they just use the pixel value of the top left known pixel. This would lead to a very pixelated image.
Nearest neighbour
Every unknown pixel gets the color of the nearest known pixel. Should lead to very pixelated images.
This said. Every method has its pros and cons and the result depends very much on the scale of your upsampling.